2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
26 #include "adt/strutil.h"
28 #include "diagnostic.h"
29 #include "format_check.h"
35 #include "type_hash.h"
38 #include "attribute_t.h"
39 #include "lang_features.h"
43 #include "adt/bitfiddle.h"
44 #include "adt/error.h"
45 #include "adt/array.h"
47 //#define PRINT_TOKENS
48 #define MAX_LOOKAHEAD 1
53 entity_namespace_t namespc;
56 typedef struct declaration_specifiers_t declaration_specifiers_t;
57 struct declaration_specifiers_t {
58 source_position_t source_position;
59 storage_class_t storage_class;
60 unsigned char alignment; /**< Alignment, 0 if not set. */
62 bool thread_local : 1; /**< GCC __thread */
63 attribute_t *attributes; /**< list of attributes */
68 * An environment for parsing initializers (and compound literals).
70 typedef struct parse_initializer_env_t {
71 type_t *type; /**< the type of the initializer. In case of an
72 array type with unspecified size this gets
73 adjusted to the actual size. */
74 entity_t *entity; /**< the variable that is initialized if any */
75 bool must_be_constant;
76 } parse_initializer_env_t;
78 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
80 /** The current token. */
82 /** The lookahead ring-buffer. */
83 static token_t lookahead_buffer[MAX_LOOKAHEAD];
84 /** Position of the next token in the lookahead buffer. */
85 static size_t lookahead_bufpos;
86 static stack_entry_t *environment_stack = NULL;
87 static stack_entry_t *label_stack = NULL;
88 static scope_t *file_scope = NULL;
89 static scope_t *current_scope = NULL;
90 /** Point to the current function declaration if inside a function. */
91 static function_t *current_function = NULL;
92 static entity_t *current_entity = NULL;
93 static switch_statement_t *current_switch = NULL;
94 static statement_t *current_loop = NULL;
95 static statement_t *current_parent = NULL;
96 static ms_try_statement_t *current_try = NULL;
97 static linkage_kind_t current_linkage;
98 static goto_statement_t *goto_first = NULL;
99 static goto_statement_t **goto_anchor = NULL;
100 static label_statement_t *label_first = NULL;
101 static label_statement_t **label_anchor = NULL;
102 /** current translation unit. */
103 static translation_unit_t *unit = NULL;
104 /** true if we are in an __extension__ context. */
105 static bool in_gcc_extension = false;
106 static struct obstack temp_obst;
107 static entity_t *anonymous_entity;
108 static declaration_t **incomplete_arrays;
109 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
112 #define PUSH_CURRENT_ENTITY(entity) \
113 entity_t *const new_current_entity = (entity); \
114 entity_t *const old_current_entity = current_entity; \
115 ((void)(current_entity = new_current_entity))
116 #define POP_CURRENT_ENTITY() (assert(current_entity == new_current_entity), (void)(current_entity = old_current_entity))
118 #define PUSH_PARENT(stmt) \
119 statement_t *const new_parent = (stmt); \
120 statement_t *const old_parent = current_parent; \
121 ((void)(current_parent = new_parent))
122 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
124 #define PUSH_SCOPE(scope) \
125 size_t const top = environment_top(); \
126 scope_t *const new_scope = (scope); \
127 scope_t *const old_scope = (new_scope ? scope_push(new_scope) : NULL)
128 #define PUSH_SCOPE_STATEMENT(scope) PUSH_SCOPE(c_mode & (_C99 | _CXX) ? (scope) : NULL)
129 #define POP_SCOPE() (new_scope ? assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top) : (void)0)
131 #define PUSH_EXTENSION() \
133 bool const old_gcc_extension = in_gcc_extension; \
134 while (next_if(T___extension__)) { \
135 in_gcc_extension = true; \
138 #define POP_EXTENSION() \
139 ((void)(in_gcc_extension = old_gcc_extension))
141 /** special symbol used for anonymous entities. */
142 static symbol_t *sym_anonymous = NULL;
144 /** The token anchor set */
145 static unsigned short token_anchor_set[T_LAST_TOKEN];
147 /** The current source position. */
148 #define HERE (&token.base.source_position)
150 /** true if we are in GCC mode. */
151 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
153 static statement_t *parse_compound_statement(bool inside_expression_statement);
154 static statement_t *parse_statement(void);
156 static expression_t *parse_subexpression(precedence_t);
157 static expression_t *parse_expression(void);
158 static type_t *parse_typename(void);
159 static void parse_externals(void);
160 static void parse_external(void);
162 static void parse_compound_type_entries(compound_t *compound_declaration);
164 static void check_call_argument(type_t *expected_type,
165 call_argument_t *argument, unsigned pos);
167 typedef enum declarator_flags_t {
169 DECL_MAY_BE_ABSTRACT = 1U << 0,
170 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
171 DECL_IS_PARAMETER = 1U << 2
172 } declarator_flags_t;
174 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
175 declarator_flags_t flags);
177 static void semantic_comparison(binary_expression_t *expression);
179 #define STORAGE_CLASSES \
180 STORAGE_CLASSES_NO_EXTERN \
183 #define STORAGE_CLASSES_NO_EXTERN \
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: \
250 case T_FLOATINGPOINT: \
254 case T_STRING_LITERAL: \
255 case T___FUNCDNAME__: \
256 case T___FUNCSIG__: \
257 case T___PRETTY_FUNCTION__: \
258 case T___alignof__: \
259 case T___builtin_classify_type: \
260 case T___builtin_constant_p: \
261 case T___builtin_isgreater: \
262 case T___builtin_isgreaterequal: \
263 case T___builtin_isless: \
264 case T___builtin_islessequal: \
265 case T___builtin_islessgreater: \
266 case T___builtin_isunordered: \
267 case T___builtin_offsetof: \
268 case T___builtin_va_arg: \
269 case T___builtin_va_copy: \
270 case T___builtin_va_start: \
281 * Returns the size of a statement node.
283 * @param kind the statement kind
285 static size_t get_statement_struct_size(statement_kind_t kind)
287 static const size_t sizes[] = {
288 [STATEMENT_ERROR] = sizeof(statement_base_t),
289 [STATEMENT_EMPTY] = sizeof(statement_base_t),
290 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
291 [STATEMENT_RETURN] = sizeof(return_statement_t),
292 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
293 [STATEMENT_IF] = sizeof(if_statement_t),
294 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
295 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
296 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
297 [STATEMENT_BREAK] = sizeof(statement_base_t),
298 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
299 [STATEMENT_GOTO] = sizeof(goto_statement_t),
300 [STATEMENT_LABEL] = sizeof(label_statement_t),
301 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
302 [STATEMENT_WHILE] = sizeof(while_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_STRING_LITERAL] = sizeof(string_literal_expression_t),
330 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
331 [EXPR_CALL] = sizeof(call_expression_t),
332 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
333 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
334 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
335 [EXPR_SELECT] = sizeof(select_expression_t),
336 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
337 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
338 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
339 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
340 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
341 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
342 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
343 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
344 [EXPR_VA_START] = sizeof(va_start_expression_t),
345 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
346 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
347 [EXPR_STATEMENT] = sizeof(statement_expression_t),
348 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
350 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
351 return sizes[EXPR_UNARY_FIRST];
353 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
354 return sizes[EXPR_BINARY_FIRST];
356 assert((size_t)kind < lengthof(sizes));
357 assert(sizes[kind] != 0);
362 * Allocate a statement node of given kind and initialize all
363 * fields with zero. Sets its source position to the position
364 * of the current token.
366 static statement_t *allocate_statement_zero(statement_kind_t kind)
368 size_t size = get_statement_struct_size(kind);
369 statement_t *res = allocate_ast_zero(size);
371 res->base.kind = kind;
372 res->base.parent = current_parent;
373 res->base.source_position = *HERE;
378 * Allocate an expression node of given kind and initialize all
381 * @param kind the kind of the expression to allocate
383 static expression_t *allocate_expression_zero(expression_kind_t kind)
385 size_t size = get_expression_struct_size(kind);
386 expression_t *res = allocate_ast_zero(size);
388 res->base.kind = kind;
389 res->base.type = type_error_type;
390 res->base.source_position = *HERE;
395 * Creates a new invalid expression at the source position
396 * of the current token.
398 static expression_t *create_error_expression(void)
400 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
401 expression->base.type = type_error_type;
406 * Creates a new invalid statement.
408 static statement_t *create_error_statement(void)
410 return allocate_statement_zero(STATEMENT_ERROR);
414 * Allocate a new empty statement.
416 static statement_t *create_empty_statement(void)
418 return allocate_statement_zero(STATEMENT_EMPTY);
422 * Returns the size of an initializer node.
424 * @param kind the initializer kind
426 static size_t get_initializer_size(initializer_kind_t kind)
428 static const size_t sizes[] = {
429 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
430 [INITIALIZER_STRING] = sizeof(initializer_string_t),
431 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_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] = lexer_token;
477 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
480 print_token(stderr, &token);
481 fprintf(stderr, "\n");
485 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
487 static inline bool next_if(token_kind_t const type)
489 if (token.kind == type) {
498 * Return the next token with a given lookahead.
500 static inline const token_t *look_ahead(size_t num)
502 assert(0 < num && num <= MAX_LOOKAHEAD);
503 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
504 return &lookahead_buffer[pos];
508 * Adds a token type to the token type anchor set (a multi-set).
510 static void add_anchor_token(token_kind_t const token_kind)
512 assert(token_kind < T_LAST_TOKEN);
513 ++token_anchor_set[token_kind];
517 * Remove a token type from the token type anchor set (a multi-set).
519 static void rem_anchor_token(token_kind_t const token_kind)
521 assert(token_kind < T_LAST_TOKEN);
522 assert(token_anchor_set[token_kind] != 0);
523 --token_anchor_set[token_kind];
527 * Eat tokens until a matching token type is found.
529 static void eat_until_matching_token(token_kind_t const type)
531 token_kind_t end_token;
533 case '(': end_token = ')'; break;
534 case '{': end_token = '}'; break;
535 case '[': end_token = ']'; break;
536 default: end_token = type; break;
539 unsigned parenthesis_count = 0;
540 unsigned brace_count = 0;
541 unsigned bracket_count = 0;
542 while (token.kind != end_token ||
543 parenthesis_count != 0 ||
545 bracket_count != 0) {
546 switch (token.kind) {
548 case '(': ++parenthesis_count; break;
549 case '{': ++brace_count; break;
550 case '[': ++bracket_count; break;
553 if (parenthesis_count > 0)
563 if (bracket_count > 0)
566 if (token.kind == end_token &&
567 parenthesis_count == 0 &&
581 * Eat input tokens until an anchor is found.
583 static void eat_until_anchor(void)
585 while (token_anchor_set[token.kind] == 0) {
586 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
587 eat_until_matching_token(token.kind);
593 * Eat a whole block from input tokens.
595 static void eat_block(void)
597 eat_until_matching_token('{');
602 * Report a parse error because an expected token was not found.
605 #if defined __GNUC__ && __GNUC__ >= 4
606 __attribute__((sentinel))
608 void parse_error_expected(const char *message, ...)
610 if (message != NULL) {
611 errorf(HERE, "%s", message);
614 va_start(ap, message);
615 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
620 * Report an incompatible type.
622 static void type_error_incompatible(const char *msg,
623 const source_position_t *source_position, type_t *type1, type_t *type2)
625 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
629 static bool skip_till(token_kind_t const expected, char const *const context)
631 if (UNLIKELY(token.kind != expected)) {
632 parse_error_expected(context, expected, NULL);
633 add_anchor_token(expected);
635 rem_anchor_token(expected);
636 if (token.kind != expected)
643 * Expect the current token is the expected token.
644 * If not, generate an error and skip until the next anchor.
646 static void expect(token_kind_t const expected)
648 if (skip_till(expected, NULL))
652 static symbol_t *expect_identifier(char const *const context, source_position_t *const pos)
654 if (!skip_till(T_IDENTIFIER, context))
656 symbol_t *const sym = token.base.symbol;
664 * Push a given scope on the scope stack and make it the
667 static scope_t *scope_push(scope_t *new_scope)
669 if (current_scope != NULL) {
670 new_scope->depth = current_scope->depth + 1;
673 scope_t *old_scope = current_scope;
674 current_scope = new_scope;
679 * Pop the current scope from the scope stack.
681 static void scope_pop(scope_t *old_scope)
683 current_scope = old_scope;
687 * Search an entity by its symbol in a given namespace.
689 static entity_t *get_entity(const symbol_t *const symbol,
690 namespace_tag_t namespc)
692 entity_t *entity = symbol->entity;
693 for (; entity != NULL; entity = entity->base.symbol_next) {
694 if ((namespace_tag_t)entity->base.namespc == namespc)
701 /* §6.2.3:1 24) There is only one name space for tags even though three are
703 static entity_t *get_tag(symbol_t const *const symbol,
704 entity_kind_tag_t const kind)
706 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
707 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
709 "'%Y' defined as wrong kind of tag (previous definition %P)",
710 symbol, &entity->base.source_position);
717 * pushs an entity on the environment stack and links the corresponding symbol
720 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
722 symbol_t *symbol = entity->base.symbol;
723 entity_namespace_t namespc = entity->base.namespc;
724 assert(namespc != 0);
726 /* replace/add entity into entity list of the symbol */
729 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
734 /* replace an entry? */
735 if (iter->base.namespc == namespc) {
736 entity->base.symbol_next = iter->base.symbol_next;
742 /* remember old declaration */
744 entry.symbol = symbol;
745 entry.old_entity = iter;
746 entry.namespc = namespc;
747 ARR_APP1(stack_entry_t, *stack_ptr, entry);
751 * Push an entity on the environment stack.
753 static void environment_push(entity_t *entity)
755 assert(entity->base.source_position.input_name != NULL);
756 assert(entity->base.parent_scope != NULL);
757 stack_push(&environment_stack, entity);
761 * Push a declaration on the global label stack.
763 * @param declaration the declaration
765 static void label_push(entity_t *label)
767 /* we abuse the parameters scope as parent for the labels */
768 label->base.parent_scope = ¤t_function->parameters;
769 stack_push(&label_stack, label);
773 * pops symbols from the environment stack until @p new_top is the top element
775 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
777 stack_entry_t *stack = *stack_ptr;
778 size_t top = ARR_LEN(stack);
781 assert(new_top <= top);
785 for (i = top; i > new_top; --i) {
786 stack_entry_t *entry = &stack[i - 1];
788 entity_t *old_entity = entry->old_entity;
789 symbol_t *symbol = entry->symbol;
790 entity_namespace_t namespc = entry->namespc;
792 /* replace with old_entity/remove */
795 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
797 assert(iter != NULL);
798 /* replace an entry? */
799 if (iter->base.namespc == namespc)
803 /* restore definition from outer scopes (if there was one) */
804 if (old_entity != NULL) {
805 old_entity->base.symbol_next = iter->base.symbol_next;
806 *anchor = old_entity;
808 /* remove entry from list */
809 *anchor = iter->base.symbol_next;
813 ARR_SHRINKLEN(*stack_ptr, new_top);
817 * Pop all entries from the environment stack until the new_top
820 * @param new_top the new stack top
822 static void environment_pop_to(size_t new_top)
824 stack_pop_to(&environment_stack, new_top);
828 * Pop all entries from the global label stack until the new_top
831 * @param new_top the new stack top
833 static void label_pop_to(size_t new_top)
835 stack_pop_to(&label_stack, new_top);
838 static atomic_type_kind_t get_akind(const type_t *type)
840 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
841 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
842 return type->atomic.akind;
846 * §6.3.1.1:2 Do integer promotion for a given type.
848 * @param type the type to promote
849 * @return the promoted type
851 static type_t *promote_integer(type_t *type)
853 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
860 * Check if a given expression represents a null pointer constant.
862 * @param expression the expression to check
864 static bool is_null_pointer_constant(const expression_t *expression)
866 /* skip void* cast */
867 if (expression->kind == EXPR_UNARY_CAST) {
868 type_t *const type = skip_typeref(expression->base.type);
869 if (types_compatible(type, type_void_ptr))
870 expression = expression->unary.value;
873 type_t *const type = skip_typeref(expression->base.type);
874 if (!is_type_integer(type))
876 switch (is_constant_expression(expression)) {
877 case EXPR_CLASS_ERROR: return true;
878 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
879 default: return false;
884 * Create an implicit cast expression.
886 * @param expression the expression to cast
887 * @param dest_type the destination type
889 static expression_t *create_implicit_cast(expression_t *expression,
892 type_t *const source_type = expression->base.type;
894 if (source_type == dest_type)
897 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
898 cast->unary.value = expression;
899 cast->base.type = dest_type;
900 cast->base.implicit = true;
905 typedef enum assign_error_t {
907 ASSIGN_ERROR_INCOMPATIBLE,
908 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
909 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
910 ASSIGN_WARNING_POINTER_FROM_INT,
911 ASSIGN_WARNING_INT_FROM_POINTER
914 static void report_assign_error(assign_error_t error, type_t *orig_type_left, expression_t const *const right, char const *const context, source_position_t const *const pos)
916 type_t *const orig_type_right = right->base.type;
917 type_t *const type_left = skip_typeref(orig_type_left);
918 type_t *const type_right = skip_typeref(orig_type_right);
923 case ASSIGN_ERROR_INCOMPATIBLE:
924 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
927 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
928 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
929 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
931 /* the left type has all qualifiers from the right type */
932 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
933 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);
937 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
938 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
941 case ASSIGN_WARNING_POINTER_FROM_INT:
942 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
945 case ASSIGN_WARNING_INT_FROM_POINTER:
946 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
950 panic("invalid error value");
954 /** Implements the rules from §6.5.16.1 */
955 static assign_error_t semantic_assign(type_t *orig_type_left,
956 const expression_t *const right)
958 type_t *const orig_type_right = right->base.type;
959 type_t *const type_left = skip_typeref(orig_type_left);
960 type_t *const type_right = skip_typeref(orig_type_right);
962 if (is_type_pointer(type_left)) {
963 if (is_null_pointer_constant(right)) {
964 return ASSIGN_SUCCESS;
965 } else if (is_type_pointer(type_right)) {
966 type_t *points_to_left
967 = skip_typeref(type_left->pointer.points_to);
968 type_t *points_to_right
969 = skip_typeref(type_right->pointer.points_to);
970 assign_error_t res = ASSIGN_SUCCESS;
972 /* the left type has all qualifiers from the right type */
973 unsigned missing_qualifiers
974 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
975 if (missing_qualifiers != 0) {
976 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
979 points_to_left = get_unqualified_type(points_to_left);
980 points_to_right = get_unqualified_type(points_to_right);
982 if (is_type_void(points_to_left))
985 if (is_type_void(points_to_right)) {
986 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
987 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
990 if (!types_compatible(points_to_left, points_to_right)) {
991 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
995 } else if (is_type_integer(type_right)) {
996 return ASSIGN_WARNING_POINTER_FROM_INT;
998 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
999 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1000 && is_type_pointer(type_right))) {
1001 return ASSIGN_SUCCESS;
1002 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1003 type_t *const unqual_type_left = get_unqualified_type(type_left);
1004 type_t *const unqual_type_right = get_unqualified_type(type_right);
1005 if (types_compatible(unqual_type_left, unqual_type_right)) {
1006 return ASSIGN_SUCCESS;
1008 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1009 return ASSIGN_WARNING_INT_FROM_POINTER;
1012 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1013 return ASSIGN_SUCCESS;
1015 return ASSIGN_ERROR_INCOMPATIBLE;
1018 static expression_t *parse_constant_expression(void)
1020 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1022 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1023 errorf(&result->base.source_position,
1024 "expression '%E' is not constant", result);
1030 static expression_t *parse_assignment_expression(void)
1032 return parse_subexpression(PREC_ASSIGNMENT);
1035 static void append_string(string_t const *const s)
1037 /* FIXME Using the ast_obstack is a hack. Using the symbol_obstack is not
1038 * possible, because other tokens are grown there alongside. */
1039 obstack_grow(&ast_obstack, s->begin, s->size);
1042 static string_t finish_string(void)
1044 obstack_1grow(&ast_obstack, '\0');
1045 size_t const size = obstack_object_size(&ast_obstack) - 1;
1046 char const *const string = obstack_finish(&ast_obstack);
1047 return (string_t){ string, size };
1050 static string_t concat_string_literals(string_encoding_t *const out_enc)
1052 assert(token.kind == T_STRING_LITERAL);
1055 string_encoding_t enc = token.string.encoding;
1056 if (look_ahead(1)->kind == T_STRING_LITERAL) {
1057 append_string(&token.string.string);
1058 eat(T_STRING_LITERAL);
1059 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects string constant concatenation");
1061 if (token.string.encoding != STRING_ENCODING_CHAR) {
1062 enc = token.string.encoding;
1064 append_string(&token.string.string);
1065 eat(T_STRING_LITERAL);
1066 } while (token.kind == T_STRING_LITERAL);
1067 result = finish_string();
1069 result = token.string.string;
1070 eat(T_STRING_LITERAL);
1077 static string_t parse_string_literals(char const *const context)
1079 if (!skip_till(T_STRING_LITERAL, context))
1080 return (string_t){ "", 0 };
1082 string_encoding_t enc;
1083 source_position_t const pos = *HERE;
1084 string_t const res = concat_string_literals(&enc);
1086 if (enc != STRING_ENCODING_CHAR) {
1087 errorf(&pos, "expected plain string literal, got wide string literal");
1093 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1095 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1096 attribute->kind = kind;
1097 attribute->source_position = *HERE;
1102 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1105 * __attribute__ ( ( attribute-list ) )
1109 * attribute_list , attrib
1114 * any-word ( identifier )
1115 * any-word ( identifier , nonempty-expr-list )
1116 * any-word ( expr-list )
1118 * where the "identifier" must not be declared as a type, and
1119 * "any-word" may be any identifier (including one declared as a
1120 * type), a reserved word storage class specifier, type specifier or
1121 * type qualifier. ??? This still leaves out most reserved keywords
1122 * (following the old parser), shouldn't we include them, and why not
1123 * allow identifiers declared as types to start the arguments?
1125 * Matze: this all looks confusing and little systematic, so we're even less
1126 * strict and parse any list of things which are identifiers or
1127 * (assignment-)expressions.
1129 static attribute_argument_t *parse_attribute_arguments(void)
1131 attribute_argument_t *first = NULL;
1132 attribute_argument_t **anchor = &first;
1133 if (token.kind != ')') do {
1134 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1136 /* is it an identifier */
1137 if (token.kind == T_IDENTIFIER
1138 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1139 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1140 argument->v.symbol = token.base.symbol;
1143 /* must be an expression */
1144 expression_t *expression = parse_assignment_expression();
1146 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1147 argument->v.expression = expression;
1150 /* append argument */
1152 anchor = &argument->next;
1153 } while (next_if(','));
1158 static attribute_t *parse_attribute_asm(void)
1160 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1163 attribute->a.arguments = parse_attribute_arguments();
1167 static attribute_t *parse_attribute_gnu_single(void)
1169 /* parse "any-word" */
1170 symbol_t *const symbol = token.base.symbol;
1171 if (symbol == NULL) {
1172 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1176 attribute_kind_t kind;
1177 char const *const name = symbol->string;
1178 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1179 if (kind > ATTRIBUTE_GNU_LAST) {
1180 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1181 /* TODO: we should still save the attribute in the list... */
1182 kind = ATTRIBUTE_UNKNOWN;
1186 const char *attribute_name = get_attribute_name(kind);
1187 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1191 attribute_t *attribute = allocate_attribute_zero(kind);
1194 /* parse arguments */
1196 attribute->a.arguments = parse_attribute_arguments();
1201 static attribute_t *parse_attribute_gnu(void)
1203 attribute_t *first = NULL;
1204 attribute_t **anchor = &first;
1206 eat(T___attribute__);
1207 add_anchor_token(')');
1208 add_anchor_token(',');
1212 if (token.kind != ')') do {
1213 attribute_t *attribute = parse_attribute_gnu_single();
1215 *anchor = attribute;
1216 anchor = &attribute->next;
1218 } while (next_if(','));
1219 rem_anchor_token(',');
1220 rem_anchor_token(')');
1227 /** Parse attributes. */
1228 static attribute_t *parse_attributes(attribute_t *first)
1230 attribute_t **anchor = &first;
1232 while (*anchor != NULL)
1233 anchor = &(*anchor)->next;
1235 attribute_t *attribute;
1236 switch (token.kind) {
1237 case T___attribute__:
1238 attribute = parse_attribute_gnu();
1239 if (attribute == NULL)
1244 attribute = parse_attribute_asm();
1248 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1253 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1257 case T__forceinline:
1258 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1259 eat(T__forceinline);
1263 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1268 /* TODO record modifier */
1269 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1270 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1278 *anchor = attribute;
1279 anchor = &attribute->next;
1283 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1285 static entity_t *determine_lhs_ent(expression_t *const expr,
1288 switch (expr->kind) {
1289 case EXPR_REFERENCE: {
1290 entity_t *const entity = expr->reference.entity;
1291 /* we should only find variables as lvalues... */
1292 if (entity->base.kind != ENTITY_VARIABLE
1293 && entity->base.kind != ENTITY_PARAMETER)
1299 case EXPR_ARRAY_ACCESS: {
1300 expression_t *const ref = expr->array_access.array_ref;
1301 entity_t * ent = NULL;
1302 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1303 ent = determine_lhs_ent(ref, lhs_ent);
1306 mark_vars_read(ref, lhs_ent);
1308 mark_vars_read(expr->array_access.index, lhs_ent);
1313 mark_vars_read(expr->select.compound, lhs_ent);
1314 if (is_type_compound(skip_typeref(expr->base.type)))
1315 return determine_lhs_ent(expr->select.compound, lhs_ent);
1319 case EXPR_UNARY_DEREFERENCE: {
1320 expression_t *const val = expr->unary.value;
1321 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1323 return determine_lhs_ent(val->unary.value, lhs_ent);
1325 mark_vars_read(val, NULL);
1331 mark_vars_read(expr, NULL);
1336 #define ENT_ANY ((entity_t*)-1)
1339 * Mark declarations, which are read. This is used to detect variables, which
1343 * x is not marked as "read", because it is only read to calculate its own new
1347 * x and y are not detected as "not read", because multiple variables are
1350 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1352 switch (expr->kind) {
1353 case EXPR_REFERENCE: {
1354 entity_t *const entity = expr->reference.entity;
1355 if (entity->kind != ENTITY_VARIABLE
1356 && entity->kind != ENTITY_PARAMETER)
1359 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1360 entity->variable.read = true;
1366 // TODO respect pure/const
1367 mark_vars_read(expr->call.function, NULL);
1368 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1369 mark_vars_read(arg->expression, NULL);
1373 case EXPR_CONDITIONAL:
1374 // TODO lhs_decl should depend on whether true/false have an effect
1375 mark_vars_read(expr->conditional.condition, NULL);
1376 if (expr->conditional.true_expression != NULL)
1377 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1378 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1382 if (lhs_ent == ENT_ANY
1383 && !is_type_compound(skip_typeref(expr->base.type)))
1385 mark_vars_read(expr->select.compound, lhs_ent);
1388 case EXPR_ARRAY_ACCESS: {
1389 mark_vars_read(expr->array_access.index, lhs_ent);
1390 expression_t *const ref = expr->array_access.array_ref;
1391 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1392 if (lhs_ent == ENT_ANY)
1395 mark_vars_read(ref, lhs_ent);
1400 mark_vars_read(expr->va_arge.ap, lhs_ent);
1404 mark_vars_read(expr->va_copye.src, lhs_ent);
1407 case EXPR_UNARY_CAST:
1408 /* Special case: Use void cast to mark a variable as "read" */
1409 if (is_type_void(skip_typeref(expr->base.type)))
1414 case EXPR_UNARY_THROW:
1415 if (expr->unary.value == NULL)
1418 case EXPR_UNARY_DEREFERENCE:
1419 case EXPR_UNARY_DELETE:
1420 case EXPR_UNARY_DELETE_ARRAY:
1421 if (lhs_ent == ENT_ANY)
1425 case EXPR_UNARY_NEGATE:
1426 case EXPR_UNARY_PLUS:
1427 case EXPR_UNARY_BITWISE_NEGATE:
1428 case EXPR_UNARY_NOT:
1429 case EXPR_UNARY_TAKE_ADDRESS:
1430 case EXPR_UNARY_POSTFIX_INCREMENT:
1431 case EXPR_UNARY_POSTFIX_DECREMENT:
1432 case EXPR_UNARY_PREFIX_INCREMENT:
1433 case EXPR_UNARY_PREFIX_DECREMENT:
1434 case EXPR_UNARY_ASSUME:
1436 mark_vars_read(expr->unary.value, lhs_ent);
1439 case EXPR_BINARY_ADD:
1440 case EXPR_BINARY_SUB:
1441 case EXPR_BINARY_MUL:
1442 case EXPR_BINARY_DIV:
1443 case EXPR_BINARY_MOD:
1444 case EXPR_BINARY_EQUAL:
1445 case EXPR_BINARY_NOTEQUAL:
1446 case EXPR_BINARY_LESS:
1447 case EXPR_BINARY_LESSEQUAL:
1448 case EXPR_BINARY_GREATER:
1449 case EXPR_BINARY_GREATEREQUAL:
1450 case EXPR_BINARY_BITWISE_AND:
1451 case EXPR_BINARY_BITWISE_OR:
1452 case EXPR_BINARY_BITWISE_XOR:
1453 case EXPR_BINARY_LOGICAL_AND:
1454 case EXPR_BINARY_LOGICAL_OR:
1455 case EXPR_BINARY_SHIFTLEFT:
1456 case EXPR_BINARY_SHIFTRIGHT:
1457 case EXPR_BINARY_COMMA:
1458 case EXPR_BINARY_ISGREATER:
1459 case EXPR_BINARY_ISGREATEREQUAL:
1460 case EXPR_BINARY_ISLESS:
1461 case EXPR_BINARY_ISLESSEQUAL:
1462 case EXPR_BINARY_ISLESSGREATER:
1463 case EXPR_BINARY_ISUNORDERED:
1464 mark_vars_read(expr->binary.left, lhs_ent);
1465 mark_vars_read(expr->binary.right, lhs_ent);
1468 case EXPR_BINARY_ASSIGN:
1469 case EXPR_BINARY_MUL_ASSIGN:
1470 case EXPR_BINARY_DIV_ASSIGN:
1471 case EXPR_BINARY_MOD_ASSIGN:
1472 case EXPR_BINARY_ADD_ASSIGN:
1473 case EXPR_BINARY_SUB_ASSIGN:
1474 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1475 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1476 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1477 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1478 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1479 if (lhs_ent == ENT_ANY)
1481 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1482 mark_vars_read(expr->binary.right, lhs_ent);
1487 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1490 case EXPR_LITERAL_CASES:
1491 case EXPR_LITERAL_CHARACTER:
1493 case EXPR_STRING_LITERAL:
1494 case EXPR_COMPOUND_LITERAL: // TODO init?
1496 case EXPR_CLASSIFY_TYPE:
1499 case EXPR_BUILTIN_CONSTANT_P:
1500 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1502 case EXPR_STATEMENT: // TODO
1503 case EXPR_LABEL_ADDRESS:
1504 case EXPR_ENUM_CONSTANT:
1508 panic("unhandled expression");
1511 static designator_t *parse_designation(void)
1513 designator_t *result = NULL;
1514 designator_t **anchor = &result;
1517 designator_t *designator;
1518 switch (token.kind) {
1520 designator = allocate_ast_zero(sizeof(designator[0]));
1521 designator->source_position = *HERE;
1523 add_anchor_token(']');
1524 designator->array_index = parse_constant_expression();
1525 rem_anchor_token(']');
1529 designator = allocate_ast_zero(sizeof(designator[0]));
1530 designator->source_position = *HERE;
1532 designator->symbol = expect_identifier("while parsing designator", NULL);
1533 if (!designator->symbol)
1541 assert(designator != NULL);
1542 *anchor = designator;
1543 anchor = &designator->next;
1547 static initializer_t *initializer_from_string(array_type_t *const type,
1548 const string_t *const string)
1550 /* TODO: check len vs. size of array type */
1553 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1554 initializer->string.string = *string;
1559 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1560 const string_t *const string)
1562 /* TODO: check len vs. size of array type */
1565 initializer_t *const initializer =
1566 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1567 initializer->wide_string.string = *string;
1573 * Build an initializer from a given expression.
1575 static initializer_t *initializer_from_expression(type_t *orig_type,
1576 expression_t *expression)
1578 /* TODO check that expression is a constant expression */
1580 /* §6.7.8.14/15 char array may be initialized by string literals */
1581 type_t *type = skip_typeref(orig_type);
1582 type_t *expr_type_orig = expression->base.type;
1583 type_t *expr_type = skip_typeref(expr_type_orig);
1585 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1586 array_type_t *const array_type = &type->array;
1587 type_t *const element_type = skip_typeref(array_type->element_type);
1589 if (element_type->kind == TYPE_ATOMIC && expression->kind == EXPR_STRING_LITERAL) {
1590 switch (expression->string_literal.encoding) {
1591 case STRING_ENCODING_CHAR: {
1592 atomic_type_kind_t const akind = element_type->atomic.akind;
1593 if (akind == ATOMIC_TYPE_CHAR
1594 || akind == ATOMIC_TYPE_SCHAR
1595 || akind == ATOMIC_TYPE_UCHAR) {
1596 return initializer_from_string(array_type,
1597 &expression->string_literal.value);
1602 case STRING_ENCODING_WIDE: {
1603 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1604 if (get_unqualified_type(element_type) == bare_wchar_type) {
1605 return initializer_from_wide_string(array_type,
1606 &expression->string_literal.value);
1614 assign_error_t error = semantic_assign(type, expression);
1615 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1617 report_assign_error(error, type, expression, "initializer",
1618 &expression->base.source_position);
1620 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1621 result->value.value = create_implicit_cast(expression, type);
1627 * Parses an scalar initializer.
1629 * §6.7.8.11; eat {} without warning
1631 static initializer_t *parse_scalar_initializer(type_t *type,
1632 bool must_be_constant)
1634 /* there might be extra {} hierarchies */
1636 if (token.kind == '{') {
1637 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1641 } while (token.kind == '{');
1644 expression_t *expression = parse_assignment_expression();
1645 mark_vars_read(expression, NULL);
1646 if (must_be_constant && !is_linker_constant(expression)) {
1647 errorf(&expression->base.source_position,
1648 "initialisation expression '%E' is not constant",
1652 initializer_t *initializer = initializer_from_expression(type, expression);
1654 if (initializer == NULL) {
1655 errorf(&expression->base.source_position,
1656 "expression '%E' (type '%T') doesn't match expected type '%T'",
1657 expression, expression->base.type, type);
1662 bool additional_warning_displayed = false;
1663 while (braces > 0) {
1665 if (token.kind != '}') {
1666 if (!additional_warning_displayed) {
1667 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1668 additional_warning_displayed = true;
1679 * An entry in the type path.
1681 typedef struct type_path_entry_t type_path_entry_t;
1682 struct type_path_entry_t {
1683 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1685 size_t index; /**< For array types: the current index. */
1686 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1691 * A type path expression a position inside compound or array types.
1693 typedef struct type_path_t type_path_t;
1694 struct type_path_t {
1695 type_path_entry_t *path; /**< An flexible array containing the current path. */
1696 type_t *top_type; /**< type of the element the path points */
1697 size_t max_index; /**< largest index in outermost array */
1701 * Prints a type path for debugging.
1703 static __attribute__((unused)) void debug_print_type_path(
1704 const type_path_t *path)
1706 size_t len = ARR_LEN(path->path);
1708 for (size_t i = 0; i < len; ++i) {
1709 const type_path_entry_t *entry = & path->path[i];
1711 type_t *type = skip_typeref(entry->type);
1712 if (is_type_compound(type)) {
1713 /* in gcc mode structs can have no members */
1714 if (entry->v.compound_entry == NULL) {
1718 fprintf(stderr, ".%s",
1719 entry->v.compound_entry->base.symbol->string);
1720 } else if (is_type_array(type)) {
1721 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1723 fprintf(stderr, "-INVALID-");
1726 if (path->top_type != NULL) {
1727 fprintf(stderr, " (");
1728 print_type(path->top_type);
1729 fprintf(stderr, ")");
1734 * Return the top type path entry, ie. in a path
1735 * (type).a.b returns the b.
1737 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1739 size_t len = ARR_LEN(path->path);
1741 return &path->path[len-1];
1745 * Enlarge the type path by an (empty) element.
1747 static type_path_entry_t *append_to_type_path(type_path_t *path)
1749 size_t len = ARR_LEN(path->path);
1750 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1752 type_path_entry_t *result = & path->path[len];
1753 memset(result, 0, sizeof(result[0]));
1758 * Descending into a sub-type. Enter the scope of the current top_type.
1760 static void descend_into_subtype(type_path_t *path)
1762 type_t *orig_top_type = path->top_type;
1763 type_t *top_type = skip_typeref(orig_top_type);
1765 type_path_entry_t *top = append_to_type_path(path);
1766 top->type = top_type;
1768 if (is_type_compound(top_type)) {
1769 compound_t *const compound = top_type->compound.compound;
1770 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1772 if (entry != NULL) {
1773 top->v.compound_entry = &entry->declaration;
1774 path->top_type = entry->declaration.type;
1776 path->top_type = NULL;
1778 } else if (is_type_array(top_type)) {
1780 path->top_type = top_type->array.element_type;
1782 assert(!is_type_valid(top_type));
1787 * Pop an entry from the given type path, ie. returning from
1788 * (type).a.b to (type).a
1790 static void ascend_from_subtype(type_path_t *path)
1792 type_path_entry_t *top = get_type_path_top(path);
1794 path->top_type = top->type;
1796 size_t len = ARR_LEN(path->path);
1797 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1801 * Pop entries from the given type path until the given
1802 * path level is reached.
1804 static void ascend_to(type_path_t *path, size_t top_path_level)
1806 size_t len = ARR_LEN(path->path);
1808 while (len > top_path_level) {
1809 ascend_from_subtype(path);
1810 len = ARR_LEN(path->path);
1814 static bool walk_designator(type_path_t *path, const designator_t *designator,
1815 bool used_in_offsetof)
1817 for (; designator != NULL; designator = designator->next) {
1818 type_path_entry_t *top = get_type_path_top(path);
1819 type_t *orig_type = top->type;
1821 type_t *type = skip_typeref(orig_type);
1823 if (designator->symbol != NULL) {
1824 symbol_t *symbol = designator->symbol;
1825 if (!is_type_compound(type)) {
1826 if (is_type_valid(type)) {
1827 errorf(&designator->source_position,
1828 "'.%Y' designator used for non-compound type '%T'",
1832 top->type = type_error_type;
1833 top->v.compound_entry = NULL;
1834 orig_type = type_error_type;
1836 compound_t *compound = type->compound.compound;
1837 entity_t *iter = compound->members.entities;
1838 for (; iter != NULL; iter = iter->base.next) {
1839 if (iter->base.symbol == symbol) {
1844 errorf(&designator->source_position,
1845 "'%T' has no member named '%Y'", orig_type, symbol);
1848 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1849 if (used_in_offsetof && iter->compound_member.bitfield) {
1850 errorf(&designator->source_position,
1851 "offsetof designator '%Y' must not specify bitfield",
1856 top->type = orig_type;
1857 top->v.compound_entry = &iter->declaration;
1858 orig_type = iter->declaration.type;
1861 expression_t *array_index = designator->array_index;
1862 if (is_constant_expression(array_index) != EXPR_CLASS_CONSTANT)
1865 if (!is_type_array(type)) {
1866 if (is_type_valid(type)) {
1867 errorf(&designator->source_position,
1868 "[%E] designator used for non-array type '%T'",
1869 array_index, orig_type);
1874 long index = fold_constant_to_int(array_index);
1875 if (!used_in_offsetof) {
1877 errorf(&designator->source_position,
1878 "array index [%E] must be positive", array_index);
1879 } else if (type->array.size_constant) {
1880 long array_size = type->array.size;
1881 if (index >= array_size) {
1882 errorf(&designator->source_position,
1883 "designator [%E] (%d) exceeds array size %d",
1884 array_index, index, array_size);
1889 top->type = orig_type;
1890 top->v.index = (size_t) index;
1891 orig_type = type->array.element_type;
1893 path->top_type = orig_type;
1895 if (designator->next != NULL) {
1896 descend_into_subtype(path);
1902 static void advance_current_object(type_path_t *path, size_t top_path_level)
1904 type_path_entry_t *top = get_type_path_top(path);
1906 type_t *type = skip_typeref(top->type);
1907 if (is_type_union(type)) {
1908 /* in unions only the first element is initialized */
1909 top->v.compound_entry = NULL;
1910 } else if (is_type_struct(type)) {
1911 declaration_t *entry = top->v.compound_entry;
1913 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1914 if (next_entity != NULL) {
1915 assert(is_declaration(next_entity));
1916 entry = &next_entity->declaration;
1921 top->v.compound_entry = entry;
1922 if (entry != NULL) {
1923 path->top_type = entry->type;
1926 } else if (is_type_array(type)) {
1927 assert(is_type_array(type));
1931 if (!type->array.size_constant || top->v.index < type->array.size) {
1935 assert(!is_type_valid(type));
1939 /* we're past the last member of the current sub-aggregate, try if we
1940 * can ascend in the type hierarchy and continue with another subobject */
1941 size_t len = ARR_LEN(path->path);
1943 if (len > top_path_level) {
1944 ascend_from_subtype(path);
1945 advance_current_object(path, top_path_level);
1947 path->top_type = NULL;
1952 * skip any {...} blocks until a closing bracket is reached.
1954 static void skip_initializers(void)
1958 while (token.kind != '}') {
1959 if (token.kind == T_EOF)
1961 if (token.kind == '{') {
1969 static initializer_t *create_empty_initializer(void)
1971 static initializer_t empty_initializer
1972 = { .list = { { INITIALIZER_LIST }, 0 } };
1973 return &empty_initializer;
1977 * Parse a part of an initialiser for a struct or union,
1979 static initializer_t *parse_sub_initializer(type_path_t *path,
1980 type_t *outer_type, size_t top_path_level,
1981 parse_initializer_env_t *env)
1983 if (token.kind == '}') {
1984 /* empty initializer */
1985 return create_empty_initializer();
1988 type_t *orig_type = path->top_type;
1989 type_t *type = NULL;
1991 if (orig_type == NULL) {
1992 /* We are initializing an empty compound. */
1994 type = skip_typeref(orig_type);
1997 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2000 designator_t *designator = NULL;
2001 if (token.kind == '.' || token.kind == '[') {
2002 designator = parse_designation();
2003 goto finish_designator;
2004 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2005 /* GNU-style designator ("identifier: value") */
2006 designator = allocate_ast_zero(sizeof(designator[0]));
2007 designator->source_position = *HERE;
2008 designator->symbol = token.base.symbol;
2013 /* reset path to toplevel, evaluate designator from there */
2014 ascend_to(path, top_path_level);
2015 if (!walk_designator(path, designator, false)) {
2016 /* can't continue after designation error */
2020 initializer_t *designator_initializer
2021 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2022 designator_initializer->designator.designator = designator;
2023 ARR_APP1(initializer_t*, initializers, designator_initializer);
2025 orig_type = path->top_type;
2026 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2031 if (token.kind == '{') {
2032 if (type != NULL && is_type_scalar(type)) {
2033 sub = parse_scalar_initializer(type, env->must_be_constant);
2036 if (env->entity != NULL) {
2037 errorf(HERE, "extra brace group at end of initializer for '%N'", env->entity);
2039 errorf(HERE, "extra brace group at end of initializer");
2044 descend_into_subtype(path);
2047 add_anchor_token('}');
2048 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2050 rem_anchor_token('}');
2055 goto error_parse_next;
2057 ascend_from_subtype(path);
2060 /* must be an expression */
2061 expression_t *expression = parse_assignment_expression();
2062 mark_vars_read(expression, NULL);
2064 if (env->must_be_constant && !is_linker_constant(expression)) {
2065 errorf(&expression->base.source_position,
2066 "Initialisation expression '%E' is not constant",
2071 /* we are already outside, ... */
2072 if (outer_type == NULL)
2073 goto error_parse_next;
2074 type_t *const outer_type_skip = skip_typeref(outer_type);
2075 if (is_type_compound(outer_type_skip) &&
2076 !outer_type_skip->compound.compound->complete) {
2077 goto error_parse_next;
2080 source_position_t const* const pos = &expression->base.source_position;
2081 if (env->entity != NULL) {
2082 warningf(WARN_OTHER, pos, "excess elements in initializer for '%N'", env->entity);
2084 warningf(WARN_OTHER, pos, "excess elements in initializer");
2086 goto error_parse_next;
2089 /* handle { "string" } special case */
2090 if (expression->kind == EXPR_STRING_LITERAL && outer_type != NULL) {
2091 sub = initializer_from_expression(outer_type, expression);
2094 if (token.kind != '}') {
2095 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2097 /* TODO: eat , ... */
2102 /* descend into subtypes until expression matches type */
2104 orig_type = path->top_type;
2105 type = skip_typeref(orig_type);
2107 sub = initializer_from_expression(orig_type, expression);
2111 if (!is_type_valid(type)) {
2114 if (is_type_scalar(type)) {
2115 errorf(&expression->base.source_position,
2116 "expression '%E' doesn't match expected type '%T'",
2117 expression, orig_type);
2121 descend_into_subtype(path);
2125 /* update largest index of top array */
2126 const type_path_entry_t *first = &path->path[0];
2127 type_t *first_type = first->type;
2128 first_type = skip_typeref(first_type);
2129 if (is_type_array(first_type)) {
2130 size_t index = first->v.index;
2131 if (index > path->max_index)
2132 path->max_index = index;
2135 /* append to initializers list */
2136 ARR_APP1(initializer_t*, initializers, sub);
2139 if (token.kind == '}') {
2142 add_anchor_token('}');
2144 rem_anchor_token('}');
2145 if (token.kind == '}') {
2150 /* advance to the next declaration if we are not at the end */
2151 advance_current_object(path, top_path_level);
2152 orig_type = path->top_type;
2153 if (orig_type != NULL)
2154 type = skip_typeref(orig_type);
2160 size_t len = ARR_LEN(initializers);
2161 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2162 initializer_t *result = allocate_ast_zero(size);
2163 result->kind = INITIALIZER_LIST;
2164 result->list.len = len;
2165 memcpy(&result->list.initializers, initializers,
2166 len * sizeof(initializers[0]));
2168 DEL_ARR_F(initializers);
2169 ascend_to(path, top_path_level+1);
2174 skip_initializers();
2175 DEL_ARR_F(initializers);
2176 ascend_to(path, top_path_level+1);
2180 static expression_t *make_size_literal(size_t value)
2182 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2183 literal->base.type = type_size_t;
2186 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2187 literal->literal.value = make_string(buf);
2193 * Parses an initializer. Parsers either a compound literal
2194 * (env->declaration == NULL) or an initializer of a declaration.
2196 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2198 type_t *type = skip_typeref(env->type);
2199 size_t max_index = 0;
2200 initializer_t *result;
2202 if (is_type_scalar(type)) {
2203 result = parse_scalar_initializer(type, env->must_be_constant);
2204 } else if (token.kind == '{') {
2208 memset(&path, 0, sizeof(path));
2209 path.top_type = env->type;
2210 path.path = NEW_ARR_F(type_path_entry_t, 0);
2212 descend_into_subtype(&path);
2214 add_anchor_token('}');
2215 result = parse_sub_initializer(&path, env->type, 1, env);
2216 rem_anchor_token('}');
2218 max_index = path.max_index;
2219 DEL_ARR_F(path.path);
2223 /* parse_scalar_initializer() also works in this case: we simply
2224 * have an expression without {} around it */
2225 result = parse_scalar_initializer(type, env->must_be_constant);
2228 /* §6.7.8:22 array initializers for arrays with unknown size determine
2229 * the array type size */
2230 if (is_type_array(type) && type->array.size_expression == NULL
2231 && result != NULL) {
2233 switch (result->kind) {
2234 case INITIALIZER_LIST:
2235 assert(max_index != 0xdeadbeaf);
2236 size = max_index + 1;
2239 case INITIALIZER_STRING:
2240 size = result->string.string.size + 1;
2243 case INITIALIZER_WIDE_STRING:
2244 size = result->wide_string.string.size;
2247 case INITIALIZER_DESIGNATOR:
2248 case INITIALIZER_VALUE:
2249 /* can happen for parse errors */
2254 internal_errorf(HERE, "invalid initializer type");
2257 type_t *new_type = duplicate_type(type);
2259 new_type->array.size_expression = make_size_literal(size);
2260 new_type->array.size_constant = true;
2261 new_type->array.has_implicit_size = true;
2262 new_type->array.size = size;
2263 env->type = new_type;
2269 static void append_entity(scope_t *scope, entity_t *entity)
2271 if (scope->last_entity != NULL) {
2272 scope->last_entity->base.next = entity;
2274 scope->entities = entity;
2276 entity->base.parent_entity = current_entity;
2277 scope->last_entity = entity;
2281 static compound_t *parse_compound_type_specifier(bool is_struct)
2283 source_position_t const pos = *HERE;
2284 eat(is_struct ? T_struct : T_union);
2286 symbol_t *symbol = NULL;
2287 entity_t *entity = NULL;
2288 attribute_t *attributes = NULL;
2290 if (token.kind == T___attribute__) {
2291 attributes = parse_attributes(NULL);
2294 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2295 if (token.kind == T_IDENTIFIER) {
2296 /* the compound has a name, check if we have seen it already */
2297 symbol = token.base.symbol;
2298 entity = get_tag(symbol, kind);
2301 if (entity != NULL) {
2302 if (entity->base.parent_scope != current_scope &&
2303 (token.kind == '{' || token.kind == ';')) {
2304 /* we're in an inner scope and have a definition. Shadow
2305 * existing definition in outer scope */
2307 } else if (entity->compound.complete && token.kind == '{') {
2308 source_position_t const *const ppos = &entity->base.source_position;
2309 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2310 /* clear members in the hope to avoid further errors */
2311 entity->compound.members.entities = NULL;
2314 } else if (token.kind != '{') {
2315 char const *const msg =
2316 is_struct ? "while parsing struct type specifier" :
2317 "while parsing union type specifier";
2318 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2323 if (entity == NULL) {
2324 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2325 entity->compound.alignment = 1;
2326 entity->base.parent_scope = current_scope;
2327 if (symbol != NULL) {
2328 environment_push(entity);
2330 append_entity(current_scope, entity);
2333 if (token.kind == '{') {
2334 parse_compound_type_entries(&entity->compound);
2336 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2337 if (symbol == NULL) {
2338 assert(anonymous_entity == NULL);
2339 anonymous_entity = entity;
2343 if (attributes != NULL) {
2344 handle_entity_attributes(attributes, entity);
2347 return &entity->compound;
2350 static void parse_enum_entries(type_t *const enum_type)
2354 if (token.kind == '}') {
2355 errorf(HERE, "empty enum not allowed");
2360 add_anchor_token('}');
2361 add_anchor_token(',');
2363 add_anchor_token('=');
2364 source_position_t pos;
2365 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2366 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2367 entity->enum_value.enum_type = enum_type;
2368 rem_anchor_token('=');
2371 expression_t *value = parse_constant_expression();
2373 value = create_implicit_cast(value, enum_type);
2374 entity->enum_value.value = value;
2379 record_entity(entity, false);
2380 } while (next_if(',') && token.kind != '}');
2381 rem_anchor_token(',');
2382 rem_anchor_token('}');
2387 static type_t *parse_enum_specifier(void)
2389 source_position_t const pos = *HERE;
2394 switch (token.kind) {
2396 symbol = token.base.symbol;
2397 entity = get_tag(symbol, ENTITY_ENUM);
2400 if (entity != NULL) {
2401 if (entity->base.parent_scope != current_scope &&
2402 (token.kind == '{' || token.kind == ';')) {
2403 /* we're in an inner scope and have a definition. Shadow
2404 * existing definition in outer scope */
2406 } else if (entity->enume.complete && token.kind == '{') {
2407 source_position_t const *const ppos = &entity->base.source_position;
2408 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2419 parse_error_expected("while parsing enum type specifier",
2420 T_IDENTIFIER, '{', NULL);
2424 if (entity == NULL) {
2425 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2426 entity->base.parent_scope = current_scope;
2429 type_t *const type = allocate_type_zero(TYPE_ENUM);
2430 type->enumt.enume = &entity->enume;
2431 type->enumt.base.akind = ATOMIC_TYPE_INT;
2433 if (token.kind == '{') {
2434 if (symbol != NULL) {
2435 environment_push(entity);
2437 append_entity(current_scope, entity);
2438 entity->enume.complete = true;
2440 parse_enum_entries(type);
2441 parse_attributes(NULL);
2443 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2444 if (symbol == NULL) {
2445 assert(anonymous_entity == NULL);
2446 anonymous_entity = entity;
2448 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2449 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2456 * if a symbol is a typedef to another type, return true
2458 static bool is_typedef_symbol(symbol_t *symbol)
2460 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2461 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2464 static type_t *parse_typeof(void)
2470 add_anchor_token(')');
2473 expression_t *expression = NULL;
2475 switch (token.kind) {
2477 if (is_typedef_symbol(token.base.symbol)) {
2479 type = parse_typename();
2482 expression = parse_expression();
2483 type = revert_automatic_type_conversion(expression);
2488 rem_anchor_token(')');
2491 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2492 typeof_type->typeoft.expression = expression;
2493 typeof_type->typeoft.typeof_type = type;
2498 typedef enum specifiers_t {
2499 SPECIFIER_SIGNED = 1 << 0,
2500 SPECIFIER_UNSIGNED = 1 << 1,
2501 SPECIFIER_LONG = 1 << 2,
2502 SPECIFIER_INT = 1 << 3,
2503 SPECIFIER_DOUBLE = 1 << 4,
2504 SPECIFIER_CHAR = 1 << 5,
2505 SPECIFIER_WCHAR_T = 1 << 6,
2506 SPECIFIER_SHORT = 1 << 7,
2507 SPECIFIER_LONG_LONG = 1 << 8,
2508 SPECIFIER_FLOAT = 1 << 9,
2509 SPECIFIER_BOOL = 1 << 10,
2510 SPECIFIER_VOID = 1 << 11,
2511 SPECIFIER_INT8 = 1 << 12,
2512 SPECIFIER_INT16 = 1 << 13,
2513 SPECIFIER_INT32 = 1 << 14,
2514 SPECIFIER_INT64 = 1 << 15,
2515 SPECIFIER_INT128 = 1 << 16,
2516 SPECIFIER_COMPLEX = 1 << 17,
2517 SPECIFIER_IMAGINARY = 1 << 18,
2520 static type_t *get_typedef_type(symbol_t *symbol)
2522 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2523 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2526 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2527 type->typedeft.typedefe = &entity->typedefe;
2532 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2534 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2536 add_anchor_token(')');
2537 add_anchor_token(',');
2541 add_anchor_token('=');
2542 source_position_t pos;
2543 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2544 rem_anchor_token('=');
2546 symbol_t **prop = NULL;
2548 if (streq(prop_sym->string, "put")) {
2549 prop = &property->put_symbol;
2550 } else if (streq(prop_sym->string, "get")) {
2551 prop = &property->get_symbol;
2553 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2557 add_anchor_token(T_IDENTIFIER);
2559 rem_anchor_token(T_IDENTIFIER);
2561 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2563 *prop = sym ? sym : sym_anonymous;
2564 } while (next_if(','));
2565 rem_anchor_token(',');
2566 rem_anchor_token(')');
2568 attribute->a.property = property;
2574 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2576 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2577 if (next_if(T_restrict)) {
2578 kind = ATTRIBUTE_MS_RESTRICT;
2579 } else if (token.kind == T_IDENTIFIER) {
2580 char const *const name = token.base.symbol->string;
2581 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2583 const char *attribute_name = get_attribute_name(k);
2584 if (attribute_name != NULL && streq(attribute_name, name)) {
2590 if (kind == ATTRIBUTE_UNKNOWN) {
2591 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2594 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2598 attribute_t *attribute = allocate_attribute_zero(kind);
2601 if (kind == ATTRIBUTE_MS_PROPERTY) {
2602 return parse_attribute_ms_property(attribute);
2605 /* parse arguments */
2607 attribute->a.arguments = parse_attribute_arguments();
2612 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2616 add_anchor_token(')');
2618 if (token.kind != ')') {
2619 attribute_t **anchor = &first;
2621 while (*anchor != NULL)
2622 anchor = &(*anchor)->next;
2624 attribute_t *attribute
2625 = parse_microsoft_extended_decl_modifier_single();
2626 if (attribute == NULL)
2629 *anchor = attribute;
2630 anchor = &attribute->next;
2631 } while (next_if(','));
2633 rem_anchor_token(')');
2638 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2640 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2641 if (is_declaration(entity)) {
2642 entity->declaration.type = type_error_type;
2643 entity->declaration.implicit = true;
2644 } else if (kind == ENTITY_TYPEDEF) {
2645 entity->typedefe.type = type_error_type;
2646 entity->typedefe.builtin = true;
2648 if (kind != ENTITY_COMPOUND_MEMBER)
2649 record_entity(entity, false);
2653 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2655 type_t *type = NULL;
2656 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2657 unsigned type_specifiers = 0;
2658 bool newtype = false;
2659 bool saw_error = false;
2661 memset(specifiers, 0, sizeof(*specifiers));
2662 specifiers->source_position = *HERE;
2665 specifiers->attributes = parse_attributes(specifiers->attributes);
2667 switch (token.kind) {
2669 #define MATCH_STORAGE_CLASS(token, class) \
2671 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2672 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2674 specifiers->storage_class = class; \
2675 if (specifiers->thread_local) \
2676 goto check_thread_storage_class; \
2680 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2681 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2682 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2683 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2684 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2687 specifiers->attributes
2688 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2692 if (specifiers->thread_local) {
2693 errorf(HERE, "duplicate '__thread'");
2695 specifiers->thread_local = true;
2696 check_thread_storage_class:
2697 switch (specifiers->storage_class) {
2698 case STORAGE_CLASS_EXTERN:
2699 case STORAGE_CLASS_NONE:
2700 case STORAGE_CLASS_STATIC:
2704 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2705 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2706 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2707 wrong_thread_storage_class:
2708 errorf(HERE, "'__thread' used with '%s'", wrong);
2715 /* type qualifiers */
2716 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2718 qualifiers |= qualifier; \
2722 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2723 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2724 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2725 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2726 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2727 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2728 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2729 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2731 /* type specifiers */
2732 #define MATCH_SPECIFIER(token, specifier, name) \
2734 if (type_specifiers & specifier) { \
2735 errorf(HERE, "multiple " name " type specifiers given"); \
2737 type_specifiers |= specifier; \
2742 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2743 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2744 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2745 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2746 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2747 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2748 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2749 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2750 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2751 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2752 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2753 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2754 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2755 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2756 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2757 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2758 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2759 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2763 specifiers->is_inline = true;
2767 case T__forceinline:
2768 eat(T__forceinline);
2769 specifiers->modifiers |= DM_FORCEINLINE;
2774 if (type_specifiers & SPECIFIER_LONG_LONG) {
2775 errorf(HERE, "too many long type specifiers given");
2776 } else if (type_specifiers & SPECIFIER_LONG) {
2777 type_specifiers |= SPECIFIER_LONG_LONG;
2779 type_specifiers |= SPECIFIER_LONG;
2784 #define CHECK_DOUBLE_TYPE() \
2785 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2788 CHECK_DOUBLE_TYPE();
2789 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2791 type->compound.compound = parse_compound_type_specifier(true);
2794 CHECK_DOUBLE_TYPE();
2795 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2796 type->compound.compound = parse_compound_type_specifier(false);
2799 CHECK_DOUBLE_TYPE();
2800 type = parse_enum_specifier();
2803 CHECK_DOUBLE_TYPE();
2804 type = parse_typeof();
2806 case T___builtin_va_list:
2807 CHECK_DOUBLE_TYPE();
2808 type = duplicate_type(type_valist);
2809 eat(T___builtin_va_list);
2812 case T_IDENTIFIER: {
2813 /* only parse identifier if we haven't found a type yet */
2814 if (type != NULL || type_specifiers != 0) {
2815 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2816 * declaration, so it doesn't generate errors about expecting '(' or
2818 switch (look_ahead(1)->kind) {
2825 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2829 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2834 goto finish_specifiers;
2838 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2839 if (typedef_type == NULL) {
2840 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2841 * declaration, so it doesn't generate 'implicit int' followed by more
2842 * errors later on. */
2843 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2849 errorf(HERE, "%K does not name a type", &token);
2851 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2853 type = allocate_type_zero(TYPE_TYPEDEF);
2854 type->typedeft.typedefe = &entity->typedefe;
2862 goto finish_specifiers;
2867 type = typedef_type;
2871 /* function specifier */
2873 goto finish_specifiers;
2878 specifiers->attributes = parse_attributes(specifiers->attributes);
2880 if (type == NULL || (saw_error && type_specifiers != 0)) {
2881 atomic_type_kind_t atomic_type;
2883 /* match valid basic types */
2884 switch (type_specifiers) {
2885 case SPECIFIER_VOID:
2886 atomic_type = ATOMIC_TYPE_VOID;
2888 case SPECIFIER_WCHAR_T:
2889 atomic_type = ATOMIC_TYPE_WCHAR_T;
2891 case SPECIFIER_CHAR:
2892 atomic_type = ATOMIC_TYPE_CHAR;
2894 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2895 atomic_type = ATOMIC_TYPE_SCHAR;
2897 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2898 atomic_type = ATOMIC_TYPE_UCHAR;
2900 case SPECIFIER_SHORT:
2901 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2902 case SPECIFIER_SHORT | SPECIFIER_INT:
2903 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2904 atomic_type = ATOMIC_TYPE_SHORT;
2906 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2907 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2908 atomic_type = ATOMIC_TYPE_USHORT;
2911 case SPECIFIER_SIGNED:
2912 case SPECIFIER_SIGNED | SPECIFIER_INT:
2913 atomic_type = ATOMIC_TYPE_INT;
2915 case SPECIFIER_UNSIGNED:
2916 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2917 atomic_type = ATOMIC_TYPE_UINT;
2919 case SPECIFIER_LONG:
2920 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2921 case SPECIFIER_LONG | SPECIFIER_INT:
2922 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2923 atomic_type = ATOMIC_TYPE_LONG;
2925 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2926 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2927 atomic_type = ATOMIC_TYPE_ULONG;
2930 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2931 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2932 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2933 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2935 atomic_type = ATOMIC_TYPE_LONGLONG;
2936 goto warn_about_long_long;
2938 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2939 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2941 atomic_type = ATOMIC_TYPE_ULONGLONG;
2942 warn_about_long_long:
2943 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
2946 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2947 atomic_type = unsigned_int8_type_kind;
2950 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2951 atomic_type = unsigned_int16_type_kind;
2954 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2955 atomic_type = unsigned_int32_type_kind;
2958 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2959 atomic_type = unsigned_int64_type_kind;
2962 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2963 atomic_type = unsigned_int128_type_kind;
2966 case SPECIFIER_INT8:
2967 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2968 atomic_type = int8_type_kind;
2971 case SPECIFIER_INT16:
2972 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2973 atomic_type = int16_type_kind;
2976 case SPECIFIER_INT32:
2977 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2978 atomic_type = int32_type_kind;
2981 case SPECIFIER_INT64:
2982 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2983 atomic_type = int64_type_kind;
2986 case SPECIFIER_INT128:
2987 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2988 atomic_type = int128_type_kind;
2991 case SPECIFIER_FLOAT:
2992 atomic_type = ATOMIC_TYPE_FLOAT;
2994 case SPECIFIER_DOUBLE:
2995 atomic_type = ATOMIC_TYPE_DOUBLE;
2997 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2998 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3000 case SPECIFIER_BOOL:
3001 atomic_type = ATOMIC_TYPE_BOOL;
3003 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3004 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3005 atomic_type = ATOMIC_TYPE_FLOAT;
3007 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3008 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3009 atomic_type = ATOMIC_TYPE_DOUBLE;
3011 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3012 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3013 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3016 /* invalid specifier combination, give an error message */
3017 source_position_t const* const pos = &specifiers->source_position;
3018 if (type_specifiers == 0) {
3020 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3021 if (!(c_mode & _CXX) && !strict_mode) {
3022 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3023 atomic_type = ATOMIC_TYPE_INT;
3026 errorf(pos, "no type specifiers given in declaration");
3029 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3030 (type_specifiers & SPECIFIER_UNSIGNED)) {
3031 errorf(pos, "signed and unsigned specifiers given");
3032 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3033 errorf(pos, "only integer types can be signed or unsigned");
3035 errorf(pos, "multiple datatypes in declaration");
3041 if (type_specifiers & SPECIFIER_COMPLEX) {
3042 type = allocate_type_zero(TYPE_COMPLEX);
3043 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3044 type = allocate_type_zero(TYPE_IMAGINARY);
3046 type = allocate_type_zero(TYPE_ATOMIC);
3048 type->atomic.akind = atomic_type;
3050 } else if (type_specifiers != 0) {
3051 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3054 /* FIXME: check type qualifiers here */
3055 type->base.qualifiers = qualifiers;
3058 type = identify_new_type(type);
3060 type = typehash_insert(type);
3063 if (specifiers->attributes != NULL)
3064 type = handle_type_attributes(specifiers->attributes, type);
3065 specifiers->type = type;
3069 specifiers->type = type_error_type;
3072 static type_qualifiers_t parse_type_qualifiers(void)
3074 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3077 switch (token.kind) {
3078 /* type qualifiers */
3079 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3080 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3081 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3082 /* microsoft extended type modifiers */
3083 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3084 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3085 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3086 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3087 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3096 * Parses an K&R identifier list
3098 static void parse_identifier_list(scope_t *scope)
3100 assert(token.kind == T_IDENTIFIER);
3102 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3103 /* a K&R parameter has no type, yet */
3107 append_entity(scope, entity);
3108 } while (next_if(',') && token.kind == T_IDENTIFIER);
3111 static entity_t *parse_parameter(void)
3113 declaration_specifiers_t specifiers;
3114 parse_declaration_specifiers(&specifiers);
3116 entity_t *entity = parse_declarator(&specifiers,
3117 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3118 anonymous_entity = NULL;
3122 static void semantic_parameter_incomplete(const entity_t *entity)
3124 assert(entity->kind == ENTITY_PARAMETER);
3126 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3127 * list in a function declarator that is part of a
3128 * definition of that function shall not have
3129 * incomplete type. */
3130 type_t *type = skip_typeref(entity->declaration.type);
3131 if (is_type_incomplete(type)) {
3132 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3136 static bool has_parameters(void)
3138 /* func(void) is not a parameter */
3139 if (look_ahead(1)->kind != ')')
3141 if (token.kind == T_IDENTIFIER) {
3142 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3145 if (entity->kind != ENTITY_TYPEDEF)
3147 type_t const *const type = skip_typeref(entity->typedefe.type);
3148 if (!is_type_void(type))
3150 if (c_mode & _CXX) {
3151 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3152 * is not allowed. */
3153 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3154 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3155 /* §6.7.5.3:10 Qualification is not allowed here. */
3156 errorf(HERE, "'void' as parameter must not have type qualifiers");
3158 } else if (token.kind != T_void) {
3166 * Parses function type parameters (and optionally creates variable_t entities
3167 * for them in a scope)
3169 static void parse_parameters(function_type_t *type, scope_t *scope)
3171 add_anchor_token(')');
3174 if (token.kind == T_IDENTIFIER &&
3175 !is_typedef_symbol(token.base.symbol) &&
3176 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3177 type->kr_style_parameters = true;
3178 parse_identifier_list(scope);
3179 } else if (token.kind == ')') {
3180 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3181 if (!(c_mode & _CXX))
3182 type->unspecified_parameters = true;
3183 } else if (has_parameters()) {
3184 function_parameter_t **anchor = &type->parameters;
3185 add_anchor_token(',');
3187 switch (token.kind) {
3190 type->variadic = true;
3191 goto parameters_finished;
3196 entity_t *entity = parse_parameter();
3197 if (entity->kind == ENTITY_TYPEDEF) {
3198 errorf(&entity->base.source_position,
3199 "typedef not allowed as function parameter");
3202 assert(is_declaration(entity));
3204 semantic_parameter_incomplete(entity);
3206 function_parameter_t *const parameter =
3207 allocate_parameter(entity->declaration.type);
3209 if (scope != NULL) {
3210 append_entity(scope, entity);
3213 *anchor = parameter;
3214 anchor = ¶meter->next;
3219 goto parameters_finished;
3221 } while (next_if(','));
3222 parameters_finished:
3223 rem_anchor_token(',');
3226 rem_anchor_token(')');
3230 typedef enum construct_type_kind_t {
3231 CONSTRUCT_POINTER = 1,
3232 CONSTRUCT_REFERENCE,
3235 } construct_type_kind_t;
3237 typedef union construct_type_t construct_type_t;
3239 typedef struct construct_type_base_t {
3240 construct_type_kind_t kind;
3241 source_position_t pos;
3242 construct_type_t *next;
3243 } construct_type_base_t;
3245 typedef struct parsed_pointer_t {
3246 construct_type_base_t base;
3247 type_qualifiers_t type_qualifiers;
3248 variable_t *base_variable; /**< MS __based extension. */
3251 typedef struct parsed_reference_t {
3252 construct_type_base_t base;
3253 } parsed_reference_t;
3255 typedef struct construct_function_type_t {
3256 construct_type_base_t base;
3257 type_t *function_type;
3258 } construct_function_type_t;
3260 typedef struct parsed_array_t {
3261 construct_type_base_t base;
3262 type_qualifiers_t type_qualifiers;
3268 union construct_type_t {
3269 construct_type_kind_t kind;
3270 construct_type_base_t base;
3271 parsed_pointer_t pointer;
3272 parsed_reference_t reference;
3273 construct_function_type_t function;
3274 parsed_array_t array;
3277 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3279 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3280 memset(cons, 0, size);
3282 cons->base.pos = *HERE;
3287 static construct_type_t *parse_pointer_declarator(void)
3289 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3291 cons->pointer.type_qualifiers = parse_type_qualifiers();
3292 //cons->pointer.base_variable = base_variable;
3297 /* ISO/IEC 14882:1998(E) §8.3.2 */
3298 static construct_type_t *parse_reference_declarator(void)
3300 if (!(c_mode & _CXX))
3301 errorf(HERE, "references are only available for C++");
3303 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3310 static construct_type_t *parse_array_declarator(void)
3312 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3313 parsed_array_t *const array = &cons->array;
3316 add_anchor_token(']');
3318 bool is_static = next_if(T_static);
3320 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3323 is_static = next_if(T_static);
3325 array->type_qualifiers = type_qualifiers;
3326 array->is_static = is_static;
3328 expression_t *size = NULL;
3329 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3330 array->is_variable = true;
3332 } else if (token.kind != ']') {
3333 size = parse_assignment_expression();
3335 /* §6.7.5.2:1 Array size must have integer type */
3336 type_t *const orig_type = size->base.type;
3337 type_t *const type = skip_typeref(orig_type);
3338 if (!is_type_integer(type) && is_type_valid(type)) {
3339 errorf(&size->base.source_position,
3340 "array size '%E' must have integer type but has type '%T'",
3345 mark_vars_read(size, NULL);
3348 if (is_static && size == NULL)
3349 errorf(&array->base.pos, "static array parameters require a size");
3351 rem_anchor_token(']');
3357 static construct_type_t *parse_function_declarator(scope_t *scope)
3359 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3361 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3362 function_type_t *ftype = &type->function;
3364 ftype->linkage = current_linkage;
3365 ftype->calling_convention = CC_DEFAULT;
3367 parse_parameters(ftype, scope);
3369 cons->function.function_type = type;
3374 typedef struct parse_declarator_env_t {
3375 bool may_be_abstract : 1;
3376 bool must_be_abstract : 1;
3377 decl_modifiers_t modifiers;
3379 source_position_t source_position;
3381 attribute_t *attributes;
3382 } parse_declarator_env_t;
3385 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3387 /* construct a single linked list of construct_type_t's which describe
3388 * how to construct the final declarator type */
3389 construct_type_t *first = NULL;
3390 construct_type_t **anchor = &first;
3392 env->attributes = parse_attributes(env->attributes);
3395 construct_type_t *type;
3396 //variable_t *based = NULL; /* MS __based extension */
3397 switch (token.kind) {
3399 type = parse_reference_declarator();
3403 panic("based not supported anymore");
3408 type = parse_pointer_declarator();
3412 goto ptr_operator_end;
3416 anchor = &type->base.next;
3418 /* TODO: find out if this is correct */
3419 env->attributes = parse_attributes(env->attributes);
3423 construct_type_t *inner_types = NULL;
3425 switch (token.kind) {
3427 if (env->must_be_abstract) {
3428 errorf(HERE, "no identifier expected in typename");
3430 env->symbol = token.base.symbol;
3431 env->source_position = *HERE;
3437 /* Parenthesized declarator or function declarator? */
3438 token_t const *const la1 = look_ahead(1);
3439 switch (la1->kind) {
3441 if (is_typedef_symbol(la1->base.symbol)) {
3443 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3444 * interpreted as ``function with no parameter specification'', rather
3445 * than redundant parentheses around the omitted identifier. */
3447 /* Function declarator. */
3448 if (!env->may_be_abstract) {
3449 errorf(HERE, "function declarator must have a name");
3456 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3457 /* Paranthesized declarator. */
3459 add_anchor_token(')');
3460 inner_types = parse_inner_declarator(env);
3461 if (inner_types != NULL) {
3462 /* All later declarators only modify the return type */
3463 env->must_be_abstract = true;
3465 rem_anchor_token(')');
3474 if (env->may_be_abstract)
3476 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3481 construct_type_t **const p = anchor;
3484 construct_type_t *type;
3485 switch (token.kind) {
3487 scope_t *scope = NULL;
3488 if (!env->must_be_abstract) {
3489 scope = &env->parameters;
3492 type = parse_function_declarator(scope);
3496 type = parse_array_declarator();
3499 goto declarator_finished;
3502 /* insert in the middle of the list (at p) */
3503 type->base.next = *p;
3506 anchor = &type->base.next;
3509 declarator_finished:
3510 /* append inner_types at the end of the list, we don't to set anchor anymore
3511 * as it's not needed anymore */
3512 *anchor = inner_types;
3517 static type_t *construct_declarator_type(construct_type_t *construct_list,
3520 construct_type_t *iter = construct_list;
3521 for (; iter != NULL; iter = iter->base.next) {
3522 source_position_t const* const pos = &iter->base.pos;
3523 switch (iter->kind) {
3524 case CONSTRUCT_FUNCTION: {
3525 construct_function_type_t *function = &iter->function;
3526 type_t *function_type = function->function_type;
3528 function_type->function.return_type = type;
3530 type_t *skipped_return_type = skip_typeref(type);
3532 if (is_type_function(skipped_return_type)) {
3533 errorf(pos, "function returning function is not allowed");
3534 } else if (is_type_array(skipped_return_type)) {
3535 errorf(pos, "function returning array is not allowed");
3537 if (skipped_return_type->base.qualifiers != 0) {
3538 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3542 /* The function type was constructed earlier. Freeing it here will
3543 * destroy other types. */
3544 type = typehash_insert(function_type);
3548 case CONSTRUCT_POINTER: {
3549 if (is_type_reference(skip_typeref(type)))
3550 errorf(pos, "cannot declare a pointer to reference");
3552 parsed_pointer_t *pointer = &iter->pointer;
3553 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3557 case CONSTRUCT_REFERENCE:
3558 if (is_type_reference(skip_typeref(type)))
3559 errorf(pos, "cannot declare a reference to reference");
3561 type = make_reference_type(type);
3564 case CONSTRUCT_ARRAY: {
3565 if (is_type_reference(skip_typeref(type)))
3566 errorf(pos, "cannot declare an array of references");
3568 parsed_array_t *array = &iter->array;
3569 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3571 expression_t *size_expression = array->size;
3572 if (size_expression != NULL) {
3574 = create_implicit_cast(size_expression, type_size_t);
3577 array_type->base.qualifiers = array->type_qualifiers;
3578 array_type->array.element_type = type;
3579 array_type->array.is_static = array->is_static;
3580 array_type->array.is_variable = array->is_variable;
3581 array_type->array.size_expression = size_expression;
3583 if (size_expression != NULL) {
3584 switch (is_constant_expression(size_expression)) {
3585 case EXPR_CLASS_CONSTANT: {
3586 long const size = fold_constant_to_int(size_expression);
3587 array_type->array.size = size;
3588 array_type->array.size_constant = true;
3589 /* §6.7.5.2:1 If the expression is a constant expression,
3590 * it shall have a value greater than zero. */
3592 errorf(&size_expression->base.source_position,
3593 "size of array must be greater than zero");
3594 } else if (size == 0 && !GNU_MODE) {
3595 errorf(&size_expression->base.source_position,
3596 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3601 case EXPR_CLASS_VARIABLE:
3602 array_type->array.is_vla = true;
3605 case EXPR_CLASS_ERROR:
3610 type_t *skipped_type = skip_typeref(type);
3612 if (is_type_incomplete(skipped_type)) {
3613 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3614 } else if (is_type_function(skipped_type)) {
3615 errorf(pos, "array of functions is not allowed");
3617 type = identify_new_type(array_type);
3621 internal_errorf(pos, "invalid type construction found");
3627 static type_t *automatic_type_conversion(type_t *orig_type);
3629 static type_t *semantic_parameter(const source_position_t *pos,
3631 const declaration_specifiers_t *specifiers,
3632 entity_t const *const param)
3634 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3635 * shall be adjusted to ``qualified pointer to type'',
3637 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3638 * type'' shall be adjusted to ``pointer to function
3639 * returning type'', as in 6.3.2.1. */
3640 type = automatic_type_conversion(type);
3642 if (specifiers->is_inline && is_type_valid(type)) {
3643 errorf(pos, "'%N' declared 'inline'", param);
3646 /* §6.9.1:6 The declarations in the declaration list shall contain
3647 * no storage-class specifier other than register and no
3648 * initializations. */
3649 if (specifiers->thread_local || (
3650 specifiers->storage_class != STORAGE_CLASS_NONE &&
3651 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3653 errorf(pos, "invalid storage class for '%N'", param);
3656 /* delay test for incomplete type, because we might have (void)
3657 * which is legal but incomplete... */
3662 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3663 declarator_flags_t flags)
3665 parse_declarator_env_t env;
3666 memset(&env, 0, sizeof(env));
3667 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3669 construct_type_t *construct_type = parse_inner_declarator(&env);
3671 construct_declarator_type(construct_type, specifiers->type);
3672 type_t *type = skip_typeref(orig_type);
3674 if (construct_type != NULL) {
3675 obstack_free(&temp_obst, construct_type);
3678 attribute_t *attributes = parse_attributes(env.attributes);
3679 /* append (shared) specifier attribute behind attributes of this
3681 attribute_t **anchor = &attributes;
3682 while (*anchor != NULL)
3683 anchor = &(*anchor)->next;
3684 *anchor = specifiers->attributes;
3687 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3688 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.source_position);
3689 entity->typedefe.type = orig_type;
3691 if (anonymous_entity != NULL) {
3692 if (is_type_compound(type)) {
3693 assert(anonymous_entity->compound.alias == NULL);
3694 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3695 anonymous_entity->kind == ENTITY_UNION);
3696 anonymous_entity->compound.alias = entity;
3697 anonymous_entity = NULL;
3698 } else if (is_type_enum(type)) {
3699 assert(anonymous_entity->enume.alias == NULL);
3700 assert(anonymous_entity->kind == ENTITY_ENUM);
3701 anonymous_entity->enume.alias = entity;
3702 anonymous_entity = NULL;
3706 /* create a declaration type entity */
3707 source_position_t const *const pos = env.symbol ? &env.source_position : &specifiers->source_position;
3708 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3709 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3711 if (env.symbol != NULL) {
3712 if (specifiers->is_inline && is_type_valid(type)) {
3713 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3716 if (specifiers->thread_local ||
3717 specifiers->storage_class != STORAGE_CLASS_NONE) {
3718 errorf(&env.source_position, "'%N' must have no storage class", entity);
3721 } else if (flags & DECL_IS_PARAMETER) {
3722 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3723 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3724 } else if (is_type_function(type)) {
3725 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3726 entity->function.is_inline = specifiers->is_inline;
3727 entity->function.elf_visibility = default_visibility;
3728 entity->function.parameters = env.parameters;
3730 if (env.symbol != NULL) {
3731 /* this needs fixes for C++ */
3732 bool in_function_scope = current_function != NULL;
3734 if (specifiers->thread_local || (
3735 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3736 specifiers->storage_class != STORAGE_CLASS_NONE &&
3737 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3739 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3743 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3744 entity->variable.elf_visibility = default_visibility;
3745 entity->variable.thread_local = specifiers->thread_local;
3747 if (env.symbol != NULL) {
3748 if (specifiers->is_inline && is_type_valid(type)) {
3749 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3752 bool invalid_storage_class = false;
3753 if (current_scope == file_scope) {
3754 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3755 specifiers->storage_class != STORAGE_CLASS_NONE &&
3756 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3757 invalid_storage_class = true;
3760 if (specifiers->thread_local &&
3761 specifiers->storage_class == STORAGE_CLASS_NONE) {
3762 invalid_storage_class = true;
3765 if (invalid_storage_class) {
3766 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3771 entity->declaration.type = orig_type;
3772 entity->declaration.alignment = get_type_alignment(orig_type);
3773 entity->declaration.modifiers = env.modifiers;
3774 entity->declaration.attributes = attributes;
3776 storage_class_t storage_class = specifiers->storage_class;
3777 entity->declaration.declared_storage_class = storage_class;
3779 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3780 storage_class = STORAGE_CLASS_AUTO;
3781 entity->declaration.storage_class = storage_class;
3784 if (attributes != NULL) {
3785 handle_entity_attributes(attributes, entity);
3788 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3789 adapt_special_functions(&entity->function);
3795 static type_t *parse_abstract_declarator(type_t *base_type)
3797 parse_declarator_env_t env;
3798 memset(&env, 0, sizeof(env));
3799 env.may_be_abstract = true;
3800 env.must_be_abstract = true;
3802 construct_type_t *construct_type = parse_inner_declarator(&env);
3804 type_t *result = construct_declarator_type(construct_type, base_type);
3805 if (construct_type != NULL) {
3806 obstack_free(&temp_obst, construct_type);
3808 result = handle_type_attributes(env.attributes, result);
3814 * Check if the declaration of main is suspicious. main should be a
3815 * function with external linkage, returning int, taking either zero
3816 * arguments, two, or three arguments of appropriate types, ie.
3818 * int main([ int argc, char **argv [, char **env ] ]).
3820 * @param decl the declaration to check
3821 * @param type the function type of the declaration
3823 static void check_main(const entity_t *entity)
3825 const source_position_t *pos = &entity->base.source_position;
3826 if (entity->kind != ENTITY_FUNCTION) {
3827 warningf(WARN_MAIN, pos, "'main' is not a function");
3831 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3832 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3835 type_t *type = skip_typeref(entity->declaration.type);
3836 assert(is_type_function(type));
3838 function_type_t const *const func_type = &type->function;
3839 type_t *const ret_type = func_type->return_type;
3840 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3841 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3843 const function_parameter_t *parm = func_type->parameters;
3845 type_t *const first_type = skip_typeref(parm->type);
3846 type_t *const first_type_unqual = get_unqualified_type(first_type);
3847 if (!types_compatible(first_type_unqual, type_int)) {
3848 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3852 type_t *const second_type = skip_typeref(parm->type);
3853 type_t *const second_type_unqual
3854 = get_unqualified_type(second_type);
3855 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3856 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3860 type_t *const third_type = skip_typeref(parm->type);
3861 type_t *const third_type_unqual
3862 = get_unqualified_type(third_type);
3863 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3864 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3868 goto warn_arg_count;
3872 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3877 static void error_redefined_as_different_kind(const source_position_t *pos,
3878 const entity_t *old, entity_kind_t new_kind)
3880 char const *const what = get_entity_kind_name(new_kind);
3881 source_position_t const *const ppos = &old->base.source_position;
3882 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3885 static bool is_entity_valid(entity_t *const ent)
3887 if (is_declaration(ent)) {
3888 return is_type_valid(skip_typeref(ent->declaration.type));
3889 } else if (ent->kind == ENTITY_TYPEDEF) {
3890 return is_type_valid(skip_typeref(ent->typedefe.type));
3895 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3897 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3898 if (attributes_equal(tattr, attr))
3905 * test wether new_list contains any attributes not included in old_list
3907 static bool has_new_attributes(const attribute_t *old_list,
3908 const attribute_t *new_list)
3910 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3911 if (!contains_attribute(old_list, attr))
3918 * Merge in attributes from an attribute list (probably from a previous
3919 * declaration with the same name). Warning: destroys the old structure
3920 * of the attribute list - don't reuse attributes after this call.
3922 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3925 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3927 if (contains_attribute(decl->attributes, attr))
3930 /* move attribute to new declarations attributes list */
3931 attr->next = decl->attributes;
3932 decl->attributes = attr;
3936 static bool is_main(entity_t*);
3939 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3940 * for various problems that occur for multiple definitions
3942 entity_t *record_entity(entity_t *entity, const bool is_definition)
3944 const symbol_t *const symbol = entity->base.symbol;
3945 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3946 const source_position_t *pos = &entity->base.source_position;
3948 /* can happen in error cases */
3952 assert(!entity->base.parent_scope);
3953 assert(current_scope);
3954 entity->base.parent_scope = current_scope;
3956 entity_t *const previous_entity = get_entity(symbol, namespc);
3957 /* pushing the same entity twice will break the stack structure */
3958 assert(previous_entity != entity);
3960 if (entity->kind == ENTITY_FUNCTION) {
3961 type_t *const orig_type = entity->declaration.type;
3962 type_t *const type = skip_typeref(orig_type);
3964 assert(is_type_function(type));
3965 if (type->function.unspecified_parameters &&
3966 previous_entity == NULL &&
3967 !entity->declaration.implicit) {
3968 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3971 if (is_main(entity)) {
3976 if (is_declaration(entity) &&
3977 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3978 current_scope != file_scope &&
3979 !entity->declaration.implicit) {
3980 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3983 if (previous_entity != NULL) {
3984 source_position_t const *const ppos = &previous_entity->base.source_position;
3986 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3987 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3988 assert(previous_entity->kind == ENTITY_PARAMETER);
3989 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3993 if (previous_entity->base.parent_scope == current_scope) {
3994 if (previous_entity->kind != entity->kind) {
3995 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
3996 error_redefined_as_different_kind(pos, previous_entity,
4001 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4002 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4005 if (previous_entity->kind == ENTITY_TYPEDEF) {
4006 type_t *const type = skip_typeref(entity->typedefe.type);
4007 type_t *const prev_type
4008 = skip_typeref(previous_entity->typedefe.type);
4009 if (c_mode & _CXX) {
4010 /* C++ allows double typedef if they are identical
4011 * (after skipping typedefs) */
4012 if (type == prev_type)
4015 /* GCC extension: redef in system headers is allowed */
4016 if ((pos->is_system_header || ppos->is_system_header) &&
4017 types_compatible(type, prev_type))
4020 errorf(pos, "redefinition of '%N' (declared %P)",
4025 /* at this point we should have only VARIABLES or FUNCTIONS */
4026 assert(is_declaration(previous_entity) && is_declaration(entity));
4028 declaration_t *const prev_decl = &previous_entity->declaration;
4029 declaration_t *const decl = &entity->declaration;
4031 /* can happen for K&R style declarations */
4032 if (prev_decl->type == NULL &&
4033 previous_entity->kind == ENTITY_PARAMETER &&
4034 entity->kind == ENTITY_PARAMETER) {
4035 prev_decl->type = decl->type;
4036 prev_decl->storage_class = decl->storage_class;
4037 prev_decl->declared_storage_class = decl->declared_storage_class;
4038 prev_decl->modifiers = decl->modifiers;
4039 return previous_entity;
4042 type_t *const type = skip_typeref(decl->type);
4043 type_t *const prev_type = skip_typeref(prev_decl->type);
4045 if (!types_compatible(type, prev_type)) {
4046 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4048 unsigned old_storage_class = prev_decl->storage_class;
4050 if (is_definition &&
4052 !(prev_decl->modifiers & DM_USED) &&
4053 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4054 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4057 storage_class_t new_storage_class = decl->storage_class;
4059 /* pretend no storage class means extern for function
4060 * declarations (except if the previous declaration is neither
4061 * none nor extern) */
4062 if (entity->kind == ENTITY_FUNCTION) {
4063 /* the previous declaration could have unspecified parameters or
4064 * be a typedef, so use the new type */
4065 if (prev_type->function.unspecified_parameters || is_definition)
4066 prev_decl->type = type;
4068 switch (old_storage_class) {
4069 case STORAGE_CLASS_NONE:
4070 old_storage_class = STORAGE_CLASS_EXTERN;
4073 case STORAGE_CLASS_EXTERN:
4074 if (is_definition) {
4075 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4076 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4078 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4079 new_storage_class = STORAGE_CLASS_EXTERN;
4086 } else if (is_type_incomplete(prev_type)) {
4087 prev_decl->type = type;
4090 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4091 new_storage_class == STORAGE_CLASS_EXTERN) {
4093 warn_redundant_declaration: ;
4095 = has_new_attributes(prev_decl->attributes,
4097 if (has_new_attrs) {
4098 merge_in_attributes(decl, prev_decl->attributes);
4099 } else if (!is_definition &&
4100 is_type_valid(prev_type) &&
4101 !pos->is_system_header) {
4102 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4104 } else if (current_function == NULL) {
4105 if (old_storage_class != STORAGE_CLASS_STATIC &&
4106 new_storage_class == STORAGE_CLASS_STATIC) {
4107 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4108 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4109 prev_decl->storage_class = STORAGE_CLASS_NONE;
4110 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4112 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4114 goto error_redeclaration;
4115 goto warn_redundant_declaration;
4117 } else if (is_type_valid(prev_type)) {
4118 if (old_storage_class == new_storage_class) {
4119 error_redeclaration:
4120 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4122 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4127 prev_decl->modifiers |= decl->modifiers;
4128 if (entity->kind == ENTITY_FUNCTION) {
4129 previous_entity->function.is_inline |= entity->function.is_inline;
4131 return previous_entity;
4135 if (is_warn_on(why = WARN_SHADOW) ||
4136 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4137 char const *const what = get_entity_kind_name(previous_entity->kind);
4138 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4142 if (entity->kind == ENTITY_FUNCTION) {
4143 if (is_definition &&
4144 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4146 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4147 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4149 goto warn_missing_declaration;
4152 } else if (entity->kind == ENTITY_VARIABLE) {
4153 if (current_scope == file_scope &&
4154 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4155 !entity->declaration.implicit) {
4156 warn_missing_declaration:
4157 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4162 environment_push(entity);
4163 append_entity(current_scope, entity);
4168 static void parser_error_multiple_definition(entity_t *entity,
4169 const source_position_t *source_position)
4171 errorf(source_position, "redefinition of '%N' (declared %P)", entity, &entity->base.source_position);
4174 static bool is_declaration_specifier(const token_t *token)
4176 switch (token->kind) {
4180 return is_typedef_symbol(token->base.symbol);
4187 static void parse_init_declarator_rest(entity_t *entity)
4189 type_t *orig_type = type_error_type;
4191 if (entity->base.kind == ENTITY_TYPEDEF) {
4192 source_position_t const *const pos = &entity->base.source_position;
4193 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4195 assert(is_declaration(entity));
4196 orig_type = entity->declaration.type;
4199 type_t *type = skip_typeref(orig_type);
4201 if (entity->kind == ENTITY_VARIABLE
4202 && entity->variable.initializer != NULL) {
4203 parser_error_multiple_definition(entity, HERE);
4207 declaration_t *const declaration = &entity->declaration;
4208 bool must_be_constant = false;
4209 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4210 entity->base.parent_scope == file_scope) {
4211 must_be_constant = true;
4214 if (is_type_function(type)) {
4215 source_position_t const *const pos = &entity->base.source_position;
4216 errorf(pos, "'%N' is initialized like a variable", entity);
4217 orig_type = type_error_type;
4220 parse_initializer_env_t env;
4221 env.type = orig_type;
4222 env.must_be_constant = must_be_constant;
4223 env.entity = entity;
4225 initializer_t *initializer = parse_initializer(&env);
4227 if (entity->kind == ENTITY_VARIABLE) {
4228 /* §6.7.5:22 array initializers for arrays with unknown size
4229 * determine the array type size */
4230 declaration->type = env.type;
4231 entity->variable.initializer = initializer;
4235 /* parse rest of a declaration without any declarator */
4236 static void parse_anonymous_declaration_rest(
4237 const declaration_specifiers_t *specifiers)
4240 anonymous_entity = NULL;
4242 source_position_t const *const pos = &specifiers->source_position;
4243 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4244 specifiers->thread_local) {
4245 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4248 type_t *type = specifiers->type;
4249 switch (type->kind) {
4250 case TYPE_COMPOUND_STRUCT:
4251 case TYPE_COMPOUND_UNION: {
4252 if (type->compound.compound->base.symbol == NULL) {
4253 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4262 warningf(WARN_OTHER, pos, "empty declaration");
4267 static void check_variable_type_complete(entity_t *ent)
4269 if (ent->kind != ENTITY_VARIABLE)
4272 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4273 * type for the object shall be complete [...] */
4274 declaration_t *decl = &ent->declaration;
4275 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4276 decl->storage_class == STORAGE_CLASS_STATIC)
4279 type_t *const type = skip_typeref(decl->type);
4280 if (!is_type_incomplete(type))
4283 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4284 * are given length one. */
4285 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4286 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4290 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4294 static void parse_declaration_rest(entity_t *ndeclaration,
4295 const declaration_specifiers_t *specifiers,
4296 parsed_declaration_func finished_declaration,
4297 declarator_flags_t flags)
4299 add_anchor_token(';');
4300 add_anchor_token(',');
4302 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4304 if (token.kind == '=') {
4305 parse_init_declarator_rest(entity);
4306 } else if (entity->kind == ENTITY_VARIABLE) {
4307 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4308 * [...] where the extern specifier is explicitly used. */
4309 declaration_t *decl = &entity->declaration;
4310 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4311 is_type_reference(skip_typeref(decl->type))) {
4312 source_position_t const *const pos = &entity->base.source_position;
4313 errorf(pos, "reference '%#N' must be initialized", entity);
4317 check_variable_type_complete(entity);
4322 add_anchor_token('=');
4323 ndeclaration = parse_declarator(specifiers, flags);
4324 rem_anchor_token('=');
4326 rem_anchor_token(',');
4327 rem_anchor_token(';');
4330 anonymous_entity = NULL;
4333 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4335 symbol_t *symbol = entity->base.symbol;
4339 assert(entity->base.namespc == NAMESPACE_NORMAL);
4340 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4341 if (previous_entity == NULL
4342 || previous_entity->base.parent_scope != current_scope) {
4343 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4348 if (is_definition) {
4349 errorf(HERE, "'%N' is initialised", entity);
4352 return record_entity(entity, false);
4355 static void parse_declaration(parsed_declaration_func finished_declaration,
4356 declarator_flags_t flags)
4358 add_anchor_token(';');
4359 declaration_specifiers_t specifiers;
4360 parse_declaration_specifiers(&specifiers);
4361 rem_anchor_token(';');
4363 if (token.kind == ';') {
4364 parse_anonymous_declaration_rest(&specifiers);
4366 entity_t *entity = parse_declarator(&specifiers, flags);
4367 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4372 static type_t *get_default_promoted_type(type_t *orig_type)
4374 type_t *result = orig_type;
4376 type_t *type = skip_typeref(orig_type);
4377 if (is_type_integer(type)) {
4378 result = promote_integer(type);
4379 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4380 result = type_double;
4386 static void parse_kr_declaration_list(entity_t *entity)
4388 if (entity->kind != ENTITY_FUNCTION)
4391 type_t *type = skip_typeref(entity->declaration.type);
4392 assert(is_type_function(type));
4393 if (!type->function.kr_style_parameters)
4396 add_anchor_token('{');
4398 PUSH_SCOPE(&entity->function.parameters);
4400 entity_t *parameter = entity->function.parameters.entities;
4401 for ( ; parameter != NULL; parameter = parameter->base.next) {
4402 assert(parameter->base.parent_scope == NULL);
4403 parameter->base.parent_scope = current_scope;
4404 environment_push(parameter);
4407 /* parse declaration list */
4409 switch (token.kind) {
4411 /* This covers symbols, which are no type, too, and results in
4412 * better error messages. The typical cases are misspelled type
4413 * names and missing includes. */
4415 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4425 /* update function type */
4426 type_t *new_type = duplicate_type(type);
4428 function_parameter_t *parameters = NULL;
4429 function_parameter_t **anchor = ¶meters;
4431 /* did we have an earlier prototype? */
4432 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4433 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4436 function_parameter_t *proto_parameter = NULL;
4437 if (proto_type != NULL) {
4438 type_t *proto_type_type = proto_type->declaration.type;
4439 proto_parameter = proto_type_type->function.parameters;
4440 /* If a K&R function definition has a variadic prototype earlier, then
4441 * make the function definition variadic, too. This should conform to
4442 * §6.7.5.3:15 and §6.9.1:8. */
4443 new_type->function.variadic = proto_type_type->function.variadic;
4445 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4447 new_type->function.unspecified_parameters = true;
4450 bool need_incompatible_warning = false;
4451 parameter = entity->function.parameters.entities;
4452 for (; parameter != NULL; parameter = parameter->base.next,
4454 proto_parameter == NULL ? NULL : proto_parameter->next) {
4455 if (parameter->kind != ENTITY_PARAMETER)
4458 type_t *parameter_type = parameter->declaration.type;
4459 if (parameter_type == NULL) {
4460 source_position_t const* const pos = ¶meter->base.source_position;
4462 errorf(pos, "no type specified for function '%N'", parameter);
4463 parameter_type = type_error_type;
4465 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4466 parameter_type = type_int;
4468 parameter->declaration.type = parameter_type;
4471 semantic_parameter_incomplete(parameter);
4473 /* we need the default promoted types for the function type */
4474 type_t *not_promoted = parameter_type;
4475 parameter_type = get_default_promoted_type(parameter_type);
4477 /* gcc special: if the type of the prototype matches the unpromoted
4478 * type don't promote */
4479 if (!strict_mode && proto_parameter != NULL) {
4480 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4481 type_t *promo_skip = skip_typeref(parameter_type);
4482 type_t *param_skip = skip_typeref(not_promoted);
4483 if (!types_compatible(proto_p_type, promo_skip)
4484 && types_compatible(proto_p_type, param_skip)) {
4486 need_incompatible_warning = true;
4487 parameter_type = not_promoted;
4490 function_parameter_t *const function_parameter
4491 = allocate_parameter(parameter_type);
4493 *anchor = function_parameter;
4494 anchor = &function_parameter->next;
4497 new_type->function.parameters = parameters;
4498 new_type = identify_new_type(new_type);
4500 if (need_incompatible_warning) {
4501 symbol_t const *const sym = entity->base.symbol;
4502 source_position_t const *const pos = &entity->base.source_position;
4503 source_position_t const *const ppos = &proto_type->base.source_position;
4504 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4506 entity->declaration.type = new_type;
4508 rem_anchor_token('{');
4511 static bool first_err = true;
4514 * When called with first_err set, prints the name of the current function,
4517 static void print_in_function(void)
4521 char const *const file = current_function->base.base.source_position.input_name;
4522 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4527 * Check if all labels are defined in the current function.
4528 * Check if all labels are used in the current function.
4530 static void check_labels(void)
4532 for (const goto_statement_t *goto_statement = goto_first;
4533 goto_statement != NULL;
4534 goto_statement = goto_statement->next) {
4535 label_t *label = goto_statement->label;
4536 if (label->base.source_position.input_name == NULL) {
4537 print_in_function();
4538 source_position_t const *const pos = &goto_statement->base.source_position;
4539 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4543 if (is_warn_on(WARN_UNUSED_LABEL)) {
4544 for (const label_statement_t *label_statement = label_first;
4545 label_statement != NULL;
4546 label_statement = label_statement->next) {
4547 label_t *label = label_statement->label;
4549 if (! label->used) {
4550 print_in_function();
4551 source_position_t const *const pos = &label_statement->base.source_position;
4552 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4558 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4560 entity_t const *const end = last != NULL ? last->base.next : NULL;
4561 for (; entity != end; entity = entity->base.next) {
4562 if (!is_declaration(entity))
4565 declaration_t *declaration = &entity->declaration;
4566 if (declaration->implicit)
4569 if (!declaration->used) {
4570 print_in_function();
4571 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4572 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4573 print_in_function();
4574 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4579 static void check_unused_variables(statement_t *const stmt, void *const env)
4583 switch (stmt->kind) {
4584 case STATEMENT_DECLARATION: {
4585 declaration_statement_t const *const decls = &stmt->declaration;
4586 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4591 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4600 * Check declarations of current_function for unused entities.
4602 static void check_declarations(void)
4604 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4605 const scope_t *scope = ¤t_function->parameters;
4606 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4608 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4609 walk_statements(current_function->statement, check_unused_variables,
4614 static int determine_truth(expression_t const* const cond)
4617 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4618 fold_constant_to_bool(cond) ? 1 :
4622 static void check_reachable(statement_t *);
4623 static bool reaches_end;
4625 static bool expression_returns(expression_t const *const expr)
4627 switch (expr->kind) {
4629 expression_t const *const func = expr->call.function;
4630 type_t const *const type = skip_typeref(func->base.type);
4631 if (type->kind == TYPE_POINTER) {
4632 type_t const *const points_to
4633 = skip_typeref(type->pointer.points_to);
4634 if (points_to->kind == TYPE_FUNCTION
4635 && points_to->function.modifiers & DM_NORETURN)
4639 if (!expression_returns(func))
4642 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4643 if (!expression_returns(arg->expression))
4650 case EXPR_REFERENCE:
4651 case EXPR_ENUM_CONSTANT:
4652 case EXPR_LITERAL_CASES:
4653 case EXPR_LITERAL_CHARACTER:
4654 case EXPR_STRING_LITERAL:
4655 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4656 case EXPR_LABEL_ADDRESS:
4657 case EXPR_CLASSIFY_TYPE:
4658 case EXPR_SIZEOF: // TODO handle obscure VLA case
4661 case EXPR_BUILTIN_CONSTANT_P:
4662 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4667 case EXPR_STATEMENT: {
4668 bool old_reaches_end = reaches_end;
4669 reaches_end = false;
4670 check_reachable(expr->statement.statement);
4671 bool returns = reaches_end;
4672 reaches_end = old_reaches_end;
4676 case EXPR_CONDITIONAL:
4677 // TODO handle constant expression
4679 if (!expression_returns(expr->conditional.condition))
4682 if (expr->conditional.true_expression != NULL
4683 && expression_returns(expr->conditional.true_expression))
4686 return expression_returns(expr->conditional.false_expression);
4689 return expression_returns(expr->select.compound);
4691 case EXPR_ARRAY_ACCESS:
4693 expression_returns(expr->array_access.array_ref) &&
4694 expression_returns(expr->array_access.index);
4697 return expression_returns(expr->va_starte.ap);
4700 return expression_returns(expr->va_arge.ap);
4703 return expression_returns(expr->va_copye.src);
4705 case EXPR_UNARY_CASES_MANDATORY:
4706 return expression_returns(expr->unary.value);
4708 case EXPR_UNARY_THROW:
4711 case EXPR_BINARY_CASES:
4712 // TODO handle constant lhs of && and ||
4714 expression_returns(expr->binary.left) &&
4715 expression_returns(expr->binary.right);
4718 panic("unhandled expression");
4721 static bool initializer_returns(initializer_t const *const init)
4723 switch (init->kind) {
4724 case INITIALIZER_VALUE:
4725 return expression_returns(init->value.value);
4727 case INITIALIZER_LIST: {
4728 initializer_t * const* i = init->list.initializers;
4729 initializer_t * const* const end = i + init->list.len;
4730 bool returns = true;
4731 for (; i != end; ++i) {
4732 if (!initializer_returns(*i))
4738 case INITIALIZER_STRING:
4739 case INITIALIZER_WIDE_STRING:
4740 case INITIALIZER_DESIGNATOR: // designators have no payload
4743 panic("unhandled initializer");
4746 static bool noreturn_candidate;
4748 static void check_reachable(statement_t *const stmt)
4750 if (stmt->base.reachable)
4752 if (stmt->kind != STATEMENT_DO_WHILE)
4753 stmt->base.reachable = true;
4755 statement_t *last = stmt;
4757 switch (stmt->kind) {
4758 case STATEMENT_ERROR:
4759 case STATEMENT_EMPTY:
4761 next = stmt->base.next;
4764 case STATEMENT_DECLARATION: {
4765 declaration_statement_t const *const decl = &stmt->declaration;
4766 entity_t const * ent = decl->declarations_begin;
4767 entity_t const *const last_decl = decl->declarations_end;
4769 for (;; ent = ent->base.next) {
4770 if (ent->kind == ENTITY_VARIABLE &&
4771 ent->variable.initializer != NULL &&
4772 !initializer_returns(ent->variable.initializer)) {
4775 if (ent == last_decl)
4779 next = stmt->base.next;
4783 case STATEMENT_COMPOUND:
4784 next = stmt->compound.statements;
4786 next = stmt->base.next;
4789 case STATEMENT_RETURN: {
4790 expression_t const *const val = stmt->returns.value;
4791 if (val == NULL || expression_returns(val))
4792 noreturn_candidate = false;
4796 case STATEMENT_IF: {
4797 if_statement_t const *const ifs = &stmt->ifs;
4798 expression_t const *const cond = ifs->condition;
4800 if (!expression_returns(cond))
4803 int const val = determine_truth(cond);
4806 check_reachable(ifs->true_statement);
4811 if (ifs->false_statement != NULL) {
4812 check_reachable(ifs->false_statement);
4816 next = stmt->base.next;
4820 case STATEMENT_SWITCH: {
4821 switch_statement_t const *const switchs = &stmt->switchs;
4822 expression_t const *const expr = switchs->expression;
4824 if (!expression_returns(expr))
4827 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4828 long const val = fold_constant_to_int(expr);
4829 case_label_statement_t * defaults = NULL;
4830 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4831 if (i->expression == NULL) {
4836 if (i->first_case <= val && val <= i->last_case) {
4837 check_reachable((statement_t*)i);
4842 if (defaults != NULL) {
4843 check_reachable((statement_t*)defaults);
4847 bool has_default = false;
4848 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4849 if (i->expression == NULL)
4852 check_reachable((statement_t*)i);
4859 next = stmt->base.next;
4863 case STATEMENT_EXPRESSION: {
4864 /* Check for noreturn function call */
4865 expression_t const *const expr = stmt->expression.expression;
4866 if (!expression_returns(expr))
4869 next = stmt->base.next;
4873 case STATEMENT_CONTINUE:
4874 for (statement_t *parent = stmt;;) {
4875 parent = parent->base.parent;
4876 if (parent == NULL) /* continue not within loop */
4880 switch (parent->kind) {
4881 case STATEMENT_WHILE: goto continue_while;
4882 case STATEMENT_DO_WHILE: goto continue_do_while;
4883 case STATEMENT_FOR: goto continue_for;
4889 case STATEMENT_BREAK:
4890 for (statement_t *parent = stmt;;) {
4891 parent = parent->base.parent;
4892 if (parent == NULL) /* break not within loop/switch */
4895 switch (parent->kind) {
4896 case STATEMENT_SWITCH:
4897 case STATEMENT_WHILE:
4898 case STATEMENT_DO_WHILE:
4901 next = parent->base.next;
4902 goto found_break_parent;
4910 case STATEMENT_COMPUTED_GOTO: {
4911 if (!expression_returns(stmt->computed_goto.expression))
4914 statement_t *parent = stmt->base.parent;
4915 if (parent == NULL) /* top level goto */
4921 case STATEMENT_GOTO:
4922 next = stmt->gotos.label->statement;
4923 if (next == NULL) /* missing label */
4927 case STATEMENT_LABEL:
4928 next = stmt->label.statement;
4931 case STATEMENT_CASE_LABEL:
4932 next = stmt->case_label.statement;
4935 case STATEMENT_WHILE: {
4936 while_statement_t const *const whiles = &stmt->whiles;
4937 expression_t const *const cond = whiles->condition;
4939 if (!expression_returns(cond))
4942 int const val = determine_truth(cond);
4945 check_reachable(whiles->body);
4950 next = stmt->base.next;
4954 case STATEMENT_DO_WHILE:
4955 next = stmt->do_while.body;
4958 case STATEMENT_FOR: {
4959 for_statement_t *const fors = &stmt->fors;
4961 if (fors->condition_reachable)
4963 fors->condition_reachable = true;
4965 expression_t const *const cond = fors->condition;
4970 } else if (expression_returns(cond)) {
4971 val = determine_truth(cond);
4977 check_reachable(fors->body);
4982 next = stmt->base.next;
4986 case STATEMENT_MS_TRY: {
4987 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4988 check_reachable(ms_try->try_statement);
4989 next = ms_try->final_statement;
4993 case STATEMENT_LEAVE: {
4994 statement_t *parent = stmt;
4996 parent = parent->base.parent;
4997 if (parent == NULL) /* __leave not within __try */
5000 if (parent->kind == STATEMENT_MS_TRY) {
5002 next = parent->ms_try.final_statement;
5010 panic("invalid statement kind");
5013 while (next == NULL) {
5014 next = last->base.parent;
5016 noreturn_candidate = false;
5018 type_t *const type = skip_typeref(current_function->base.type);
5019 assert(is_type_function(type));
5020 type_t *const ret = skip_typeref(type->function.return_type);
5021 if (!is_type_void(ret) &&
5022 is_type_valid(ret) &&
5023 !is_main(current_entity)) {
5024 source_position_t const *const pos = &stmt->base.source_position;
5025 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5030 switch (next->kind) {
5031 case STATEMENT_ERROR:
5032 case STATEMENT_EMPTY:
5033 case STATEMENT_DECLARATION:
5034 case STATEMENT_EXPRESSION:
5036 case STATEMENT_RETURN:
5037 case STATEMENT_CONTINUE:
5038 case STATEMENT_BREAK:
5039 case STATEMENT_COMPUTED_GOTO:
5040 case STATEMENT_GOTO:
5041 case STATEMENT_LEAVE:
5042 panic("invalid control flow in function");
5044 case STATEMENT_COMPOUND:
5045 if (next->compound.stmt_expr) {
5051 case STATEMENT_SWITCH:
5052 case STATEMENT_LABEL:
5053 case STATEMENT_CASE_LABEL:
5055 next = next->base.next;
5058 case STATEMENT_WHILE: {
5060 if (next->base.reachable)
5062 next->base.reachable = true;
5064 while_statement_t const *const whiles = &next->whiles;
5065 expression_t const *const cond = whiles->condition;
5067 if (!expression_returns(cond))
5070 int const val = determine_truth(cond);
5073 check_reachable(whiles->body);
5079 next = next->base.next;
5083 case STATEMENT_DO_WHILE: {
5085 if (next->base.reachable)
5087 next->base.reachable = true;
5089 do_while_statement_t const *const dw = &next->do_while;
5090 expression_t const *const cond = dw->condition;
5092 if (!expression_returns(cond))
5095 int const val = determine_truth(cond);
5098 check_reachable(dw->body);
5104 next = next->base.next;
5108 case STATEMENT_FOR: {
5110 for_statement_t *const fors = &next->fors;
5112 fors->step_reachable = true;
5114 if (fors->condition_reachable)
5116 fors->condition_reachable = true;
5118 expression_t const *const cond = fors->condition;
5123 } else if (expression_returns(cond)) {
5124 val = determine_truth(cond);
5130 check_reachable(fors->body);
5136 next = next->base.next;
5140 case STATEMENT_MS_TRY:
5142 next = next->ms_try.final_statement;
5147 check_reachable(next);
5150 static void check_unreachable(statement_t* const stmt, void *const env)
5154 switch (stmt->kind) {
5155 case STATEMENT_DO_WHILE:
5156 if (!stmt->base.reachable) {
5157 expression_t const *const cond = stmt->do_while.condition;
5158 if (determine_truth(cond) >= 0) {
5159 source_position_t const *const pos = &cond->base.source_position;
5160 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5165 case STATEMENT_FOR: {
5166 for_statement_t const* const fors = &stmt->fors;
5168 // if init and step are unreachable, cond is unreachable, too
5169 if (!stmt->base.reachable && !fors->step_reachable) {
5170 goto warn_unreachable;
5172 if (!stmt->base.reachable && fors->initialisation != NULL) {
5173 source_position_t const *const pos = &fors->initialisation->base.source_position;
5174 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5177 if (!fors->condition_reachable && fors->condition != NULL) {
5178 source_position_t const *const pos = &fors->condition->base.source_position;
5179 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5182 if (!fors->step_reachable && fors->step != NULL) {
5183 source_position_t const *const pos = &fors->step->base.source_position;
5184 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5190 case STATEMENT_COMPOUND:
5191 if (stmt->compound.statements != NULL)
5193 goto warn_unreachable;
5195 case STATEMENT_DECLARATION: {
5196 /* Only warn if there is at least one declarator with an initializer.
5197 * This typically occurs in switch statements. */
5198 declaration_statement_t const *const decl = &stmt->declaration;
5199 entity_t const * ent = decl->declarations_begin;
5200 entity_t const *const last = decl->declarations_end;
5202 for (;; ent = ent->base.next) {
5203 if (ent->kind == ENTITY_VARIABLE &&
5204 ent->variable.initializer != NULL) {
5205 goto warn_unreachable;
5215 if (!stmt->base.reachable) {
5216 source_position_t const *const pos = &stmt->base.source_position;
5217 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5223 static bool is_main(entity_t *entity)
5225 static symbol_t *sym_main = NULL;
5226 if (sym_main == NULL) {
5227 sym_main = symbol_table_insert("main");
5230 if (entity->base.symbol != sym_main)
5232 /* must be in outermost scope */
5233 if (entity->base.parent_scope != file_scope)
5239 static void prepare_main_collect2(entity_t*);
5241 static void parse_external_declaration(void)
5243 /* function-definitions and declarations both start with declaration
5245 add_anchor_token(';');
5246 declaration_specifiers_t specifiers;
5247 parse_declaration_specifiers(&specifiers);
5248 rem_anchor_token(';');
5250 /* must be a declaration */
5251 if (token.kind == ';') {
5252 parse_anonymous_declaration_rest(&specifiers);
5256 add_anchor_token(',');
5257 add_anchor_token('=');
5258 add_anchor_token(';');
5259 add_anchor_token('{');
5261 /* declarator is common to both function-definitions and declarations */
5262 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5264 rem_anchor_token('{');
5265 rem_anchor_token(';');
5266 rem_anchor_token('=');
5267 rem_anchor_token(',');
5269 /* must be a declaration */
5270 switch (token.kind) {
5274 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5279 /* must be a function definition */
5280 parse_kr_declaration_list(ndeclaration);
5282 if (token.kind != '{') {
5283 parse_error_expected("while parsing function definition", '{', NULL);
5284 eat_until_matching_token(';');
5288 assert(is_declaration(ndeclaration));
5289 type_t *const orig_type = ndeclaration->declaration.type;
5290 type_t * type = skip_typeref(orig_type);
5292 if (!is_type_function(type)) {
5293 if (is_type_valid(type)) {
5294 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5300 source_position_t const *const pos = &ndeclaration->base.source_position;
5301 if (is_typeref(orig_type)) {
5303 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5306 if (is_type_compound(skip_typeref(type->function.return_type))) {
5307 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5309 if (type->function.unspecified_parameters) {
5310 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5312 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5315 /* §6.7.5.3:14 a function definition with () means no
5316 * parameters (and not unspecified parameters) */
5317 if (type->function.unspecified_parameters &&
5318 type->function.parameters == NULL) {
5319 type_t *copy = duplicate_type(type);
5320 copy->function.unspecified_parameters = false;
5321 type = identify_new_type(copy);
5323 ndeclaration->declaration.type = type;
5326 entity_t *const entity = record_entity(ndeclaration, true);
5327 assert(entity->kind == ENTITY_FUNCTION);
5328 assert(ndeclaration->kind == ENTITY_FUNCTION);
5330 function_t *const function = &entity->function;
5331 if (ndeclaration != entity) {
5332 function->parameters = ndeclaration->function.parameters;
5335 PUSH_SCOPE(&function->parameters);
5337 entity_t *parameter = function->parameters.entities;
5338 for (; parameter != NULL; parameter = parameter->base.next) {
5339 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5340 parameter->base.parent_scope = current_scope;
5342 assert(parameter->base.parent_scope == NULL
5343 || parameter->base.parent_scope == current_scope);
5344 parameter->base.parent_scope = current_scope;
5345 if (parameter->base.symbol == NULL) {
5346 errorf(¶meter->base.source_position, "parameter name omitted");
5349 environment_push(parameter);
5352 if (function->statement != NULL) {
5353 parser_error_multiple_definition(entity, HERE);
5356 /* parse function body */
5357 int label_stack_top = label_top();
5358 function_t *old_current_function = current_function;
5359 current_function = function;
5360 PUSH_CURRENT_ENTITY(entity);
5364 goto_anchor = &goto_first;
5366 label_anchor = &label_first;
5368 statement_t *const body = parse_compound_statement(false);
5369 function->statement = body;
5372 check_declarations();
5373 if (is_warn_on(WARN_RETURN_TYPE) ||
5374 is_warn_on(WARN_UNREACHABLE_CODE) ||
5375 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5376 noreturn_candidate = true;
5377 check_reachable(body);
5378 if (is_warn_on(WARN_UNREACHABLE_CODE))
5379 walk_statements(body, check_unreachable, NULL);
5380 if (noreturn_candidate &&
5381 !(function->base.modifiers & DM_NORETURN)) {
5382 source_position_t const *const pos = &body->base.source_position;
5383 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5387 if (is_main(entity)) {
5388 /* Force main to C linkage. */
5389 type_t *const type = entity->declaration.type;
5390 assert(is_type_function(type));
5391 if (type->function.linkage != LINKAGE_C) {
5392 type_t *new_type = duplicate_type(type);
5393 new_type->function.linkage = LINKAGE_C;
5394 entity->declaration.type = identify_new_type(new_type);
5397 if (enable_main_collect2_hack)
5398 prepare_main_collect2(entity);
5401 POP_CURRENT_ENTITY();
5403 assert(current_function == function);
5404 current_function = old_current_function;
5405 label_pop_to(label_stack_top);
5411 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5413 entity_t *iter = compound->members.entities;
5414 for (; iter != NULL; iter = iter->base.next) {
5415 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5418 if (iter->base.symbol == symbol) {
5420 } else if (iter->base.symbol == NULL) {
5421 /* search in anonymous structs and unions */
5422 type_t *type = skip_typeref(iter->declaration.type);
5423 if (is_type_compound(type)) {
5424 if (find_compound_entry(type->compound.compound, symbol)
5435 static void check_deprecated(const source_position_t *source_position,
5436 const entity_t *entity)
5438 if (!is_declaration(entity))
5440 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5443 source_position_t const *const epos = &entity->base.source_position;
5444 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5446 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5448 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5453 static expression_t *create_select(const source_position_t *pos,
5455 type_qualifiers_t qualifiers,
5458 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5460 check_deprecated(pos, entry);
5462 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5463 select->select.compound = addr;
5464 select->select.compound_entry = entry;
5466 type_t *entry_type = entry->declaration.type;
5467 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5469 /* bitfields need special treatment */
5470 if (entry->compound_member.bitfield) {
5471 unsigned bit_size = entry->compound_member.bit_size;
5472 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5473 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5474 res_type = type_int;
5478 /* we always do the auto-type conversions; the & and sizeof parser contains
5479 * code to revert this! */
5480 select->base.type = automatic_type_conversion(res_type);
5487 * Find entry with symbol in compound. Search anonymous structs and unions and
5488 * creates implicit select expressions for them.
5489 * Returns the adress for the innermost compound.
5491 static expression_t *find_create_select(const source_position_t *pos,
5493 type_qualifiers_t qualifiers,
5494 compound_t *compound, symbol_t *symbol)
5496 entity_t *iter = compound->members.entities;
5497 for (; iter != NULL; iter = iter->base.next) {
5498 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5501 symbol_t *iter_symbol = iter->base.symbol;
5502 if (iter_symbol == NULL) {
5503 type_t *type = iter->declaration.type;
5504 if (type->kind != TYPE_COMPOUND_STRUCT
5505 && type->kind != TYPE_COMPOUND_UNION)
5508 compound_t *sub_compound = type->compound.compound;
5510 if (find_compound_entry(sub_compound, symbol) == NULL)
5513 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5514 sub_addr->base.source_position = *pos;
5515 sub_addr->base.implicit = true;
5516 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5520 if (iter_symbol == symbol) {
5521 return create_select(pos, addr, qualifiers, iter);
5528 static void parse_bitfield_member(entity_t *entity)
5532 expression_t *size = parse_constant_expression();
5535 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5536 type_t *type = entity->declaration.type;
5537 if (!is_type_integer(skip_typeref(type))) {
5538 errorf(HERE, "bitfield base type '%T' is not an integer type",
5542 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5543 /* error already reported by parse_constant_expression */
5544 size_long = get_type_size(type) * 8;
5546 size_long = fold_constant_to_int(size);
5548 const symbol_t *symbol = entity->base.symbol;
5549 const symbol_t *user_symbol
5550 = symbol == NULL ? sym_anonymous : symbol;
5551 unsigned bit_size = get_type_size(type) * 8;
5552 if (size_long < 0) {
5553 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5554 } else if (size_long == 0 && symbol != NULL) {
5555 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5556 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5557 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5560 /* hope that people don't invent crazy types with more bits
5561 * than our struct can hold */
5563 (1 << sizeof(entity->compound_member.bit_size)*8));
5567 entity->compound_member.bitfield = true;
5568 entity->compound_member.bit_size = (unsigned char)size_long;
5571 static void parse_compound_declarators(compound_t *compound,
5572 const declaration_specifiers_t *specifiers)
5574 add_anchor_token(';');
5575 add_anchor_token(',');
5579 if (token.kind == ':') {
5580 /* anonymous bitfield */
5581 type_t *type = specifiers->type;
5582 entity_t *const entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL, HERE);
5583 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5584 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5585 entity->declaration.type = type;
5587 parse_bitfield_member(entity);
5589 attribute_t *attributes = parse_attributes(NULL);
5590 attribute_t **anchor = &attributes;
5591 while (*anchor != NULL)
5592 anchor = &(*anchor)->next;
5593 *anchor = specifiers->attributes;
5594 if (attributes != NULL) {
5595 handle_entity_attributes(attributes, entity);
5597 entity->declaration.attributes = attributes;
5599 append_entity(&compound->members, entity);
5601 entity = parse_declarator(specifiers,
5602 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5603 source_position_t const *const pos = &entity->base.source_position;
5604 if (entity->kind == ENTITY_TYPEDEF) {
5605 errorf(pos, "typedef not allowed as compound member");
5607 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5609 /* make sure we don't define a symbol multiple times */
5610 symbol_t *symbol = entity->base.symbol;
5611 if (symbol != NULL) {
5612 entity_t *prev = find_compound_entry(compound, symbol);
5614 source_position_t const *const ppos = &prev->base.source_position;
5615 errorf(pos, "multiple declarations of '%N' (declared %P)", entity, ppos);
5619 if (token.kind == ':') {
5620 parse_bitfield_member(entity);
5622 attribute_t *attributes = parse_attributes(NULL);
5623 handle_entity_attributes(attributes, entity);
5625 type_t *orig_type = entity->declaration.type;
5626 type_t *type = skip_typeref(orig_type);
5627 if (is_type_function(type)) {
5628 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5629 } else if (is_type_incomplete(type)) {
5630 /* §6.7.2.1:16 flexible array member */
5631 if (!is_type_array(type) ||
5632 token.kind != ';' ||
5633 look_ahead(1)->kind != '}') {
5634 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5635 } else if (compound->members.entities == NULL) {
5636 errorf(pos, "flexible array member in otherwise empty struct");
5641 append_entity(&compound->members, entity);
5644 } while (next_if(','));
5645 rem_anchor_token(',');
5646 rem_anchor_token(';');
5649 anonymous_entity = NULL;
5652 static void parse_compound_type_entries(compound_t *compound)
5655 add_anchor_token('}');
5658 switch (token.kind) {
5660 case T___extension__:
5661 case T_IDENTIFIER: {
5663 declaration_specifiers_t specifiers;
5664 parse_declaration_specifiers(&specifiers);
5665 parse_compound_declarators(compound, &specifiers);
5671 rem_anchor_token('}');
5674 compound->complete = true;
5680 static type_t *parse_typename(void)
5682 declaration_specifiers_t specifiers;
5683 parse_declaration_specifiers(&specifiers);
5684 if (specifiers.storage_class != STORAGE_CLASS_NONE
5685 || specifiers.thread_local) {
5686 /* TODO: improve error message, user does probably not know what a
5687 * storage class is...
5689 errorf(&specifiers.source_position, "typename must not have a storage class");
5692 type_t *result = parse_abstract_declarator(specifiers.type);
5700 typedef expression_t* (*parse_expression_function)(void);
5701 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5703 typedef struct expression_parser_function_t expression_parser_function_t;
5704 struct expression_parser_function_t {
5705 parse_expression_function parser;
5706 precedence_t infix_precedence;
5707 parse_expression_infix_function infix_parser;
5710 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5712 static type_t *get_string_type(string_encoding_t const enc)
5714 bool const warn = is_warn_on(WARN_WRITE_STRINGS);
5716 case STRING_ENCODING_CHAR: return warn ? type_const_char_ptr : type_char_ptr;
5717 case STRING_ENCODING_WIDE: return warn ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5719 panic("invalid string encoding");
5723 * Parse a string constant.
5725 static expression_t *parse_string_literal(void)
5727 expression_t *const expr = allocate_expression_zero(EXPR_STRING_LITERAL);
5728 expr->string_literal.value = concat_string_literals(&expr->string_literal.encoding);
5729 expr->base.type = get_string_type(expr->string_literal.encoding);
5734 * Parse a boolean constant.
5736 static expression_t *parse_boolean_literal(bool value)
5738 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5739 literal->base.type = type_bool;
5740 literal->literal.value.begin = value ? "true" : "false";
5741 literal->literal.value.size = value ? 4 : 5;
5743 eat(value ? T_true : T_false);
5747 static void warn_traditional_suffix(void)
5749 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5750 &token.number.suffix);
5753 static void check_integer_suffix(void)
5755 const string_t *suffix = &token.number.suffix;
5756 if (suffix->size == 0)
5759 bool not_traditional = false;
5760 const char *c = suffix->begin;
5761 if (*c == 'l' || *c == 'L') {
5764 not_traditional = true;
5766 if (*c == 'u' || *c == 'U') {
5769 } else if (*c == 'u' || *c == 'U') {
5770 not_traditional = true;
5773 } else if (*c == 'u' || *c == 'U') {
5774 not_traditional = true;
5776 if (*c == 'l' || *c == 'L') {
5784 errorf(HERE, "invalid suffix '%S' on integer constant", suffix);
5785 } else if (not_traditional) {
5786 warn_traditional_suffix();
5790 static type_t *check_floatingpoint_suffix(void)
5792 const string_t *suffix = &token.number.suffix;
5793 type_t *type = type_double;
5794 if (suffix->size == 0)
5797 bool not_traditional = false;
5798 const char *c = suffix->begin;
5799 if (*c == 'f' || *c == 'F') {
5802 } else if (*c == 'l' || *c == 'L') {
5804 type = type_long_double;
5807 errorf(HERE, "invalid suffix '%S' on floatingpoint constant", suffix);
5808 } else if (not_traditional) {
5809 warn_traditional_suffix();
5816 * Parse an integer constant.
5818 static expression_t *parse_number_literal(void)
5820 expression_kind_t kind;
5823 switch (token.kind) {
5825 kind = EXPR_LITERAL_INTEGER;
5826 check_integer_suffix();
5830 case T_FLOATINGPOINT:
5831 kind = EXPR_LITERAL_FLOATINGPOINT;
5832 type = check_floatingpoint_suffix();
5836 panic("unexpected token type in parse_number_literal");
5839 expression_t *literal = allocate_expression_zero(kind);
5840 literal->base.type = type;
5841 literal->literal.value = token.number.number;
5842 literal->literal.suffix = token.number.suffix;
5845 /* integer type depends on the size of the number and the size
5846 * representable by the types. The backend/codegeneration has to determine
5849 determine_literal_type(&literal->literal);
5854 * Parse a character constant.
5856 static expression_t *parse_character_constant(void)
5858 expression_t *const literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5859 literal->string_literal.encoding = token.string.encoding;
5860 literal->string_literal.value = token.string.string;
5862 switch (token.string.encoding) {
5863 case STRING_ENCODING_CHAR:
5864 literal->base.type = c_mode & _CXX ? type_char : type_int;
5865 if (literal->string_literal.value.size > 1) {
5866 if (!GNU_MODE && !(c_mode & _C99)) {
5867 errorf(HERE, "more than 1 character in character constant");
5869 literal->base.type = type_int;
5870 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5875 case STRING_ENCODING_WIDE:
5876 literal->base.type = type_int;
5877 if (wstrlen(&literal->string_literal.value) > 1) {
5878 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5883 eat(T_CHARACTER_CONSTANT);
5887 static entity_t *create_implicit_function(symbol_t *symbol, source_position_t const *const pos)
5889 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5890 ntype->function.return_type = type_int;
5891 ntype->function.unspecified_parameters = true;
5892 ntype->function.linkage = LINKAGE_C;
5893 type_t *type = identify_new_type(ntype);
5895 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5896 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5897 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5898 entity->declaration.type = type;
5899 entity->declaration.implicit = true;
5901 if (current_scope != NULL)
5902 record_entity(entity, false);
5908 * Performs automatic type cast as described in §6.3.2.1.
5910 * @param orig_type the original type
5912 static type_t *automatic_type_conversion(type_t *orig_type)
5914 type_t *type = skip_typeref(orig_type);
5915 if (is_type_array(type)) {
5916 array_type_t *array_type = &type->array;
5917 type_t *element_type = array_type->element_type;
5918 unsigned qualifiers = array_type->base.qualifiers;
5920 return make_pointer_type(element_type, qualifiers);
5923 if (is_type_function(type)) {
5924 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5931 * reverts the automatic casts of array to pointer types and function
5932 * to function-pointer types as defined §6.3.2.1
5934 type_t *revert_automatic_type_conversion(const expression_t *expression)
5936 switch (expression->kind) {
5937 case EXPR_REFERENCE: {
5938 entity_t *entity = expression->reference.entity;
5939 if (is_declaration(entity)) {
5940 return entity->declaration.type;
5941 } else if (entity->kind == ENTITY_ENUM_VALUE) {
5942 return entity->enum_value.enum_type;
5944 panic("no declaration or enum in reference");
5949 entity_t *entity = expression->select.compound_entry;
5950 assert(is_declaration(entity));
5951 type_t *type = entity->declaration.type;
5952 return get_qualified_type(type, expression->base.type->base.qualifiers);
5955 case EXPR_UNARY_DEREFERENCE: {
5956 const expression_t *const value = expression->unary.value;
5957 type_t *const type = skip_typeref(value->base.type);
5958 if (!is_type_pointer(type))
5959 return type_error_type;
5960 return type->pointer.points_to;
5963 case EXPR_ARRAY_ACCESS: {
5964 const expression_t *array_ref = expression->array_access.array_ref;
5965 type_t *type_left = skip_typeref(array_ref->base.type);
5966 if (!is_type_pointer(type_left))
5967 return type_error_type;
5968 return type_left->pointer.points_to;
5971 case EXPR_STRING_LITERAL: {
5972 size_t const size = expression->string_literal.value.size + 1;
5973 type_t *const elem = get_unqualified_type(expression->base.type->pointer.points_to);
5974 return make_array_type(elem, size, TYPE_QUALIFIER_NONE);
5977 case EXPR_COMPOUND_LITERAL:
5978 return expression->compound_literal.type;
5983 return expression->base.type;
5987 * Find an entity matching a symbol in a scope.
5988 * Uses current scope if scope is NULL
5990 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
5991 namespace_tag_t namespc)
5993 if (scope == NULL) {
5994 return get_entity(symbol, namespc);
5997 /* we should optimize here, if scope grows above a certain size we should
5998 construct a hashmap here... */
5999 entity_t *entity = scope->entities;
6000 for ( ; entity != NULL; entity = entity->base.next) {
6001 if (entity->base.symbol == symbol
6002 && (namespace_tag_t)entity->base.namespc == namespc)
6009 static entity_t *parse_qualified_identifier(void)
6011 /* namespace containing the symbol */
6013 source_position_t pos;
6014 const scope_t *lookup_scope = NULL;
6016 if (next_if(T_COLONCOLON))
6017 lookup_scope = &unit->scope;
6021 symbol = expect_identifier("while parsing identifier", &pos);
6023 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6026 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6028 if (!next_if(T_COLONCOLON))
6031 switch (entity->kind) {
6032 case ENTITY_NAMESPACE:
6033 lookup_scope = &entity->namespacee.members;
6038 lookup_scope = &entity->compound.members;
6041 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6042 symbol, get_entity_kind_name(entity->kind));
6044 /* skip further qualifications */
6045 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6047 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6051 if (entity == NULL) {
6052 if (!strict_mode && token.kind == '(') {
6053 /* an implicitly declared function */
6054 entity = create_implicit_function(symbol, &pos);
6055 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6057 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6058 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6065 static expression_t *parse_reference(void)
6067 source_position_t const pos = *HERE;
6068 entity_t *const entity = parse_qualified_identifier();
6071 if (is_declaration(entity)) {
6072 orig_type = entity->declaration.type;
6073 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6074 orig_type = entity->enum_value.enum_type;
6076 panic("expected declaration or enum value in reference");
6079 /* we always do the auto-type conversions; the & and sizeof parser contains
6080 * code to revert this! */
6081 type_t *type = automatic_type_conversion(orig_type);
6083 expression_kind_t kind = EXPR_REFERENCE;
6084 if (entity->kind == ENTITY_ENUM_VALUE)
6085 kind = EXPR_ENUM_CONSTANT;
6087 expression_t *expression = allocate_expression_zero(kind);
6088 expression->base.source_position = pos;
6089 expression->base.type = type;
6090 expression->reference.entity = entity;
6092 /* this declaration is used */
6093 if (is_declaration(entity)) {
6094 entity->declaration.used = true;
6097 if (entity->base.parent_scope != file_scope
6098 && (current_function != NULL
6099 && entity->base.parent_scope->depth < current_function->parameters.depth)
6100 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6101 /* access of a variable from an outer function */
6102 entity->variable.address_taken = true;
6103 current_function->need_closure = true;
6106 check_deprecated(&pos, entity);
6111 static bool semantic_cast(expression_t *cast)
6113 expression_t *expression = cast->unary.value;
6114 type_t *orig_dest_type = cast->base.type;
6115 type_t *orig_type_right = expression->base.type;
6116 type_t const *dst_type = skip_typeref(orig_dest_type);
6117 type_t const *src_type = skip_typeref(orig_type_right);
6118 source_position_t const *pos = &cast->base.source_position;
6120 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6121 if (is_type_void(dst_type))
6124 /* only integer and pointer can be casted to pointer */
6125 if (is_type_pointer(dst_type) &&
6126 !is_type_pointer(src_type) &&
6127 !is_type_integer(src_type) &&
6128 is_type_valid(src_type)) {
6129 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6133 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6134 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6138 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6139 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6143 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6144 type_t *src = skip_typeref(src_type->pointer.points_to);
6145 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6146 unsigned missing_qualifiers =
6147 src->base.qualifiers & ~dst->base.qualifiers;
6148 if (missing_qualifiers != 0) {
6149 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6155 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6157 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6158 expression->base.source_position = *pos;
6160 parse_initializer_env_t env;
6163 env.must_be_constant = false;
6164 initializer_t *initializer = parse_initializer(&env);
6167 expression->compound_literal.initializer = initializer;
6168 expression->compound_literal.type = type;
6169 expression->base.type = automatic_type_conversion(type);
6175 * Parse a cast expression.
6177 static expression_t *parse_cast(void)
6179 source_position_t const pos = *HERE;
6182 add_anchor_token(')');
6184 type_t *type = parse_typename();
6186 rem_anchor_token(')');
6189 if (token.kind == '{') {
6190 return parse_compound_literal(&pos, type);
6193 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6194 cast->base.source_position = pos;
6196 expression_t *value = parse_subexpression(PREC_CAST);
6197 cast->base.type = type;
6198 cast->unary.value = value;
6200 if (! semantic_cast(cast)) {
6201 /* TODO: record the error in the AST. else it is impossible to detect it */
6208 * Parse a statement expression.
6210 static expression_t *parse_statement_expression(void)
6212 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6215 add_anchor_token(')');
6217 statement_t *statement = parse_compound_statement(true);
6218 statement->compound.stmt_expr = true;
6219 expression->statement.statement = statement;
6221 /* find last statement and use its type */
6222 type_t *type = type_void;
6223 const statement_t *stmt = statement->compound.statements;
6225 while (stmt->base.next != NULL)
6226 stmt = stmt->base.next;
6228 if (stmt->kind == STATEMENT_EXPRESSION) {
6229 type = stmt->expression.expression->base.type;
6232 source_position_t const *const pos = &expression->base.source_position;
6233 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6235 expression->base.type = type;
6237 rem_anchor_token(')');
6243 * Parse a parenthesized expression.
6245 static expression_t *parse_parenthesized_expression(void)
6247 token_t const* const la1 = look_ahead(1);
6248 switch (la1->kind) {
6250 /* gcc extension: a statement expression */
6251 return parse_statement_expression();
6254 if (is_typedef_symbol(la1->base.symbol)) {
6256 return parse_cast();
6261 add_anchor_token(')');
6262 expression_t *result = parse_expression();
6263 result->base.parenthesized = true;
6264 rem_anchor_token(')');
6270 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6272 if (current_function == NULL) {
6273 errorf(HERE, "'%K' used outside of a function", &token);
6276 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6277 expression->base.type = type_char_ptr;
6278 expression->funcname.kind = kind;
6285 static designator_t *parse_designator(void)
6287 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6288 result->symbol = expect_identifier("while parsing member designator", &result->source_position);
6289 if (!result->symbol)
6292 designator_t *last_designator = result;
6295 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6296 designator->symbol = expect_identifier("while parsing member designator", &designator->source_position);
6297 if (!designator->symbol)
6300 last_designator->next = designator;
6301 last_designator = designator;
6305 add_anchor_token(']');
6306 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6307 designator->source_position = *HERE;
6308 designator->array_index = parse_expression();
6309 rem_anchor_token(']');
6311 if (designator->array_index == NULL) {
6315 last_designator->next = designator;
6316 last_designator = designator;
6326 * Parse the __builtin_offsetof() expression.
6328 static expression_t *parse_offsetof(void)
6330 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6331 expression->base.type = type_size_t;
6333 eat(T___builtin_offsetof);
6335 add_anchor_token(')');
6336 add_anchor_token(',');
6338 type_t *type = parse_typename();
6339 rem_anchor_token(',');
6341 designator_t *designator = parse_designator();
6342 rem_anchor_token(')');
6345 expression->offsetofe.type = type;
6346 expression->offsetofe.designator = designator;
6349 memset(&path, 0, sizeof(path));
6350 path.top_type = type;
6351 path.path = NEW_ARR_F(type_path_entry_t, 0);
6353 descend_into_subtype(&path);
6355 if (!walk_designator(&path, designator, true)) {
6356 return create_error_expression();
6359 DEL_ARR_F(path.path);
6364 static bool is_last_parameter(expression_t *const param)
6366 if (param->kind == EXPR_REFERENCE) {
6367 entity_t *const entity = param->reference.entity;
6368 if (entity->kind == ENTITY_PARAMETER &&
6369 !entity->base.next &&
6370 entity->base.parent_scope == ¤t_function->parameters) {
6375 if (!is_type_valid(skip_typeref(param->base.type)))
6382 * Parses a __builtin_va_start() expression.
6384 static expression_t *parse_va_start(void)
6386 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6388 eat(T___builtin_va_start);
6390 add_anchor_token(')');
6391 add_anchor_token(',');
6393 expression->va_starte.ap = parse_assignment_expression();
6394 rem_anchor_token(',');
6396 expression_t *const param = parse_assignment_expression();
6397 expression->va_starte.parameter = param;
6398 rem_anchor_token(')');
6401 if (!current_function) {
6402 errorf(&expression->base.source_position, "'va_start' used outside of function");
6403 } else if (!current_function->base.type->function.variadic) {
6404 errorf(&expression->base.source_position, "'va_start' used in non-variadic function");
6405 } else if (!is_last_parameter(param)) {
6406 errorf(¶m->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
6413 * Parses a __builtin_va_arg() expression.
6415 static expression_t *parse_va_arg(void)
6417 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6419 eat(T___builtin_va_arg);
6421 add_anchor_token(')');
6422 add_anchor_token(',');
6425 ap.expression = parse_assignment_expression();
6426 expression->va_arge.ap = ap.expression;
6427 check_call_argument(type_valist, &ap, 1);
6429 rem_anchor_token(',');
6431 expression->base.type = parse_typename();
6432 rem_anchor_token(')');
6439 * Parses a __builtin_va_copy() expression.
6441 static expression_t *parse_va_copy(void)
6443 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6445 eat(T___builtin_va_copy);
6447 add_anchor_token(')');
6448 add_anchor_token(',');
6450 expression_t *dst = parse_assignment_expression();
6451 assign_error_t error = semantic_assign(type_valist, dst);
6452 report_assign_error(error, type_valist, dst, "call argument 1",
6453 &dst->base.source_position);
6454 expression->va_copye.dst = dst;
6456 rem_anchor_token(',');
6459 call_argument_t src;
6460 src.expression = parse_assignment_expression();
6461 check_call_argument(type_valist, &src, 2);
6462 expression->va_copye.src = src.expression;
6463 rem_anchor_token(')');
6470 * Parses a __builtin_constant_p() expression.
6472 static expression_t *parse_builtin_constant(void)
6474 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6476 eat(T___builtin_constant_p);
6478 add_anchor_token(')');
6480 expression->builtin_constant.value = parse_assignment_expression();
6481 rem_anchor_token(')');
6483 expression->base.type = type_int;
6489 * Parses a __builtin_types_compatible_p() expression.
6491 static expression_t *parse_builtin_types_compatible(void)
6493 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6495 eat(T___builtin_types_compatible_p);
6497 add_anchor_token(')');
6498 add_anchor_token(',');
6500 expression->builtin_types_compatible.left = parse_typename();
6501 rem_anchor_token(',');
6503 expression->builtin_types_compatible.right = parse_typename();
6504 rem_anchor_token(')');
6506 expression->base.type = type_int;
6512 * Parses a __builtin_is_*() compare expression.
6514 static expression_t *parse_compare_builtin(void)
6516 expression_kind_t kind;
6517 switch (token.kind) {
6518 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6519 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6520 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6521 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6522 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6523 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6524 default: internal_errorf(HERE, "invalid compare builtin found");
6526 expression_t *const expression = allocate_expression_zero(kind);
6529 add_anchor_token(')');
6530 add_anchor_token(',');
6532 expression->binary.left = parse_assignment_expression();
6533 rem_anchor_token(',');
6535 expression->binary.right = parse_assignment_expression();
6536 rem_anchor_token(')');
6539 type_t *const orig_type_left = expression->binary.left->base.type;
6540 type_t *const orig_type_right = expression->binary.right->base.type;
6542 type_t *const type_left = skip_typeref(orig_type_left);
6543 type_t *const type_right = skip_typeref(orig_type_right);
6544 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6545 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6546 type_error_incompatible("invalid operands in comparison",
6547 &expression->base.source_position, orig_type_left, orig_type_right);
6550 semantic_comparison(&expression->binary);
6557 * Parses a MS assume() expression.
6559 static expression_t *parse_assume(void)
6561 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6565 add_anchor_token(')');
6567 expression->unary.value = parse_assignment_expression();
6568 rem_anchor_token(')');
6571 expression->base.type = type_void;
6576 * Return the label for the current symbol or create a new one.
6578 static label_t *get_label(char const *const context)
6580 assert(current_function != NULL);
6582 symbol_t *const sym = expect_identifier(context, NULL);
6586 entity_t *label = get_entity(sym, NAMESPACE_LABEL);
6587 /* If we find a local label, we already created the declaration. */
6588 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6589 if (label->base.parent_scope != current_scope) {
6590 assert(label->base.parent_scope->depth < current_scope->depth);
6591 current_function->goto_to_outer = true;
6593 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6594 /* There is no matching label in the same function, so create a new one. */
6595 source_position_t const nowhere = { NULL, 0, 0, false };
6596 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym, &nowhere);
6600 return &label->label;
6604 * Parses a GNU && label address expression.
6606 static expression_t *parse_label_address(void)
6608 source_position_t const source_position = *HERE;
6611 label_t *const label = get_label("while parsing label address");
6613 return create_error_expression();
6616 label->address_taken = true;
6618 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6619 expression->base.source_position = source_position;
6621 /* label address is treated as a void pointer */
6622 expression->base.type = type_void_ptr;
6623 expression->label_address.label = label;
6628 * Parse a microsoft __noop expression.
6630 static expression_t *parse_noop_expression(void)
6632 /* the result is a (int)0 */
6633 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6634 literal->base.type = type_int;
6635 literal->literal.value.begin = "__noop";
6636 literal->literal.value.size = 6;
6640 if (token.kind == '(') {
6641 /* parse arguments */
6643 add_anchor_token(')');
6644 add_anchor_token(',');
6646 if (token.kind != ')') do {
6647 (void)parse_assignment_expression();
6648 } while (next_if(','));
6650 rem_anchor_token(',');
6651 rem_anchor_token(')');
6659 * Parses a primary expression.
6661 static expression_t *parse_primary_expression(void)
6663 switch (token.kind) {
6664 case T_false: return parse_boolean_literal(false);
6665 case T_true: return parse_boolean_literal(true);
6667 case T_FLOATINGPOINT: return parse_number_literal();
6668 case T_CHARACTER_CONSTANT: return parse_character_constant();
6669 case T_STRING_LITERAL: return parse_string_literal();
6670 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6671 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6672 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6673 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6674 case T___builtin_offsetof: return parse_offsetof();
6675 case T___builtin_va_start: return parse_va_start();
6676 case T___builtin_va_arg: return parse_va_arg();
6677 case T___builtin_va_copy: return parse_va_copy();
6678 case T___builtin_isgreater:
6679 case T___builtin_isgreaterequal:
6680 case T___builtin_isless:
6681 case T___builtin_islessequal:
6682 case T___builtin_islessgreater:
6683 case T___builtin_isunordered: return parse_compare_builtin();
6684 case T___builtin_constant_p: return parse_builtin_constant();
6685 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6686 case T__assume: return parse_assume();
6689 return parse_label_address();
6692 case '(': return parse_parenthesized_expression();
6693 case T___noop: return parse_noop_expression();
6695 /* Gracefully handle type names while parsing expressions. */
6697 return parse_reference();
6699 if (!is_typedef_symbol(token.base.symbol)) {
6700 return parse_reference();
6704 source_position_t const pos = *HERE;
6705 declaration_specifiers_t specifiers;
6706 parse_declaration_specifiers(&specifiers);
6707 type_t const *const type = parse_abstract_declarator(specifiers.type);
6708 errorf(&pos, "encountered type '%T' while parsing expression", type);
6709 return create_error_expression();
6713 errorf(HERE, "unexpected token %K, expected an expression", &token);
6715 return create_error_expression();
6718 static expression_t *parse_array_expression(expression_t *left)
6720 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6721 array_access_expression_t *const arr = &expr->array_access;
6724 add_anchor_token(']');
6726 expression_t *const inside = parse_expression();
6728 type_t *const orig_type_left = left->base.type;
6729 type_t *const orig_type_inside = inside->base.type;
6731 type_t *const type_left = skip_typeref(orig_type_left);
6732 type_t *const type_inside = skip_typeref(orig_type_inside);
6738 if (is_type_pointer(type_left)) {
6741 idx_type = type_inside;
6742 res_type = type_left->pointer.points_to;
6744 } else if (is_type_pointer(type_inside)) {
6745 arr->flipped = true;
6748 idx_type = type_left;
6749 res_type = type_inside->pointer.points_to;
6751 res_type = automatic_type_conversion(res_type);
6752 if (!is_type_integer(idx_type)) {
6753 errorf(&idx->base.source_position, "array subscript must have integer type");
6754 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6755 source_position_t const *const pos = &idx->base.source_position;
6756 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6759 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6760 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6762 res_type = type_error_type;
6767 arr->array_ref = ref;
6769 arr->base.type = res_type;
6771 rem_anchor_token(']');
6776 static bool is_bitfield(const expression_t *expression)
6778 return expression->kind == EXPR_SELECT
6779 && expression->select.compound_entry->compound_member.bitfield;
6782 static expression_t *parse_typeprop(expression_kind_t const kind)
6784 expression_t *tp_expression = allocate_expression_zero(kind);
6785 tp_expression->base.type = type_size_t;
6787 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
6790 expression_t *expression;
6791 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6792 source_position_t const pos = *HERE;
6794 add_anchor_token(')');
6795 orig_type = parse_typename();
6796 rem_anchor_token(')');
6799 if (token.kind == '{') {
6800 /* It was not sizeof(type) after all. It is sizeof of an expression
6801 * starting with a compound literal */
6802 expression = parse_compound_literal(&pos, orig_type);
6803 goto typeprop_expression;
6806 expression = parse_subexpression(PREC_UNARY);
6808 typeprop_expression:
6809 if (is_bitfield(expression)) {
6810 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6811 errorf(&tp_expression->base.source_position,
6812 "operand of %s expression must not be a bitfield", what);
6815 tp_expression->typeprop.tp_expression = expression;
6817 orig_type = revert_automatic_type_conversion(expression);
6818 expression->base.type = orig_type;
6821 tp_expression->typeprop.type = orig_type;
6822 type_t const* const type = skip_typeref(orig_type);
6823 char const* wrong_type = NULL;
6824 if (is_type_incomplete(type)) {
6825 if (!is_type_void(type) || !GNU_MODE)
6826 wrong_type = "incomplete";
6827 } else if (type->kind == TYPE_FUNCTION) {
6829 /* function types are allowed (and return 1) */
6830 source_position_t const *const pos = &tp_expression->base.source_position;
6831 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6832 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6834 wrong_type = "function";
6838 if (wrong_type != NULL) {
6839 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6840 errorf(&tp_expression->base.source_position,
6841 "operand of %s expression must not be of %s type '%T'",
6842 what, wrong_type, orig_type);
6845 return tp_expression;
6848 static expression_t *parse_sizeof(void)
6850 return parse_typeprop(EXPR_SIZEOF);
6853 static expression_t *parse_alignof(void)
6855 return parse_typeprop(EXPR_ALIGNOF);
6858 static expression_t *parse_select_expression(expression_t *addr)
6860 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6861 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6862 source_position_t const pos = *HERE;
6865 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6867 return create_error_expression();
6869 type_t *const orig_type = addr->base.type;
6870 type_t *const type = skip_typeref(orig_type);
6873 bool saw_error = false;
6874 if (is_type_pointer(type)) {
6875 if (!select_left_arrow) {
6877 "request for member '%Y' in something not a struct or union, but '%T'",
6881 type_left = skip_typeref(type->pointer.points_to);
6883 if (select_left_arrow && is_type_valid(type)) {
6884 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6890 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
6891 type_left->kind != TYPE_COMPOUND_UNION) {
6893 if (is_type_valid(type_left) && !saw_error) {
6895 "request for member '%Y' in something not a struct or union, but '%T'",
6898 return create_error_expression();
6901 compound_t *compound = type_left->compound.compound;
6902 if (!compound->complete) {
6903 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
6905 return create_error_expression();
6908 type_qualifiers_t qualifiers = type_left->base.qualifiers;
6909 expression_t *result =
6910 find_create_select(&pos, addr, qualifiers, compound, symbol);
6912 if (result == NULL) {
6913 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
6914 return create_error_expression();
6920 static void check_call_argument(type_t *expected_type,
6921 call_argument_t *argument, unsigned pos)
6923 type_t *expected_type_skip = skip_typeref(expected_type);
6924 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6925 expression_t *arg_expr = argument->expression;
6926 type_t *arg_type = skip_typeref(arg_expr->base.type);
6928 /* handle transparent union gnu extension */
6929 if (is_type_union(expected_type_skip)
6930 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
6931 compound_t *union_decl = expected_type_skip->compound.compound;
6932 type_t *best_type = NULL;
6933 entity_t *entry = union_decl->members.entities;
6934 for ( ; entry != NULL; entry = entry->base.next) {
6935 assert(is_declaration(entry));
6936 type_t *decl_type = entry->declaration.type;
6937 error = semantic_assign(decl_type, arg_expr);
6938 if (error == ASSIGN_ERROR_INCOMPATIBLE
6939 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6942 if (error == ASSIGN_SUCCESS) {
6943 best_type = decl_type;
6944 } else if (best_type == NULL) {
6945 best_type = decl_type;
6949 if (best_type != NULL) {
6950 expected_type = best_type;
6954 error = semantic_assign(expected_type, arg_expr);
6955 argument->expression = create_implicit_cast(arg_expr, expected_type);
6957 if (error != ASSIGN_SUCCESS) {
6958 /* report exact scope in error messages (like "in argument 3") */
6960 snprintf(buf, sizeof(buf), "call argument %u", pos);
6961 report_assign_error(error, expected_type, arg_expr, buf,
6962 &arg_expr->base.source_position);
6964 type_t *const promoted_type = get_default_promoted_type(arg_type);
6965 if (!types_compatible(expected_type_skip, promoted_type) &&
6966 !types_compatible(expected_type_skip, type_void_ptr) &&
6967 !types_compatible(type_void_ptr, promoted_type)) {
6968 /* Deliberately show the skipped types in this warning */
6969 source_position_t const *const apos = &arg_expr->base.source_position;
6970 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
6976 * Handle the semantic restrictions of builtin calls
6978 static void handle_builtin_argument_restrictions(call_expression_t *call)
6980 entity_t *entity = call->function->reference.entity;
6981 switch (entity->function.btk) {
6983 switch (entity->function.b.firm_builtin_kind) {
6984 case ir_bk_return_address:
6985 case ir_bk_frame_address: {
6986 /* argument must be constant */
6987 call_argument_t *argument = call->arguments;
6989 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
6990 errorf(&call->base.source_position,
6991 "argument of '%Y' must be a constant expression",
6992 call->function->reference.entity->base.symbol);
6996 case ir_bk_prefetch:
6997 /* second and third argument must be constant if existent */
6998 if (call->arguments == NULL)
7000 call_argument_t *rw = call->arguments->next;
7001 call_argument_t *locality = NULL;
7004 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7005 errorf(&call->base.source_position,
7006 "second argument of '%Y' must be a constant expression",
7007 call->function->reference.entity->base.symbol);
7009 locality = rw->next;
7011 if (locality != NULL) {
7012 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7013 errorf(&call->base.source_position,
7014 "third argument of '%Y' must be a constant expression",
7015 call->function->reference.entity->base.symbol);
7017 locality = rw->next;
7024 case BUILTIN_OBJECT_SIZE:
7025 if (call->arguments == NULL)
7028 call_argument_t *arg = call->arguments->next;
7029 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7030 errorf(&call->base.source_position,
7031 "second argument of '%Y' must be a constant expression",
7032 call->function->reference.entity->base.symbol);
7041 * Parse a call expression, ie. expression '( ... )'.
7043 * @param expression the function address
7045 static expression_t *parse_call_expression(expression_t *expression)
7047 expression_t *result = allocate_expression_zero(EXPR_CALL);
7048 call_expression_t *call = &result->call;
7049 call->function = expression;
7051 type_t *const orig_type = expression->base.type;
7052 type_t *const type = skip_typeref(orig_type);
7054 function_type_t *function_type = NULL;
7055 if (is_type_pointer(type)) {
7056 type_t *const to_type = skip_typeref(type->pointer.points_to);
7058 if (is_type_function(to_type)) {
7059 function_type = &to_type->function;
7060 call->base.type = function_type->return_type;
7064 if (function_type == NULL && is_type_valid(type)) {
7066 "called object '%E' (type '%T') is not a pointer to a function",
7067 expression, orig_type);
7070 /* parse arguments */
7072 add_anchor_token(')');
7073 add_anchor_token(',');
7075 if (token.kind != ')') {
7076 call_argument_t **anchor = &call->arguments;
7078 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7079 argument->expression = parse_assignment_expression();
7082 anchor = &argument->next;
7083 } while (next_if(','));
7085 rem_anchor_token(',');
7086 rem_anchor_token(')');
7089 if (function_type == NULL)
7092 /* check type and count of call arguments */
7093 function_parameter_t *parameter = function_type->parameters;
7094 call_argument_t *argument = call->arguments;
7095 if (!function_type->unspecified_parameters) {
7096 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7097 parameter = parameter->next, argument = argument->next) {
7098 check_call_argument(parameter->type, argument, ++pos);
7101 if (parameter != NULL) {
7102 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7103 } else if (argument != NULL && !function_type->variadic) {
7104 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7108 /* do default promotion for other arguments */
7109 for (; argument != NULL; argument = argument->next) {
7110 type_t *argument_type = argument->expression->base.type;
7111 if (!is_type_object(skip_typeref(argument_type))) {
7112 errorf(&argument->expression->base.source_position,
7113 "call argument '%E' must not be void", argument->expression);
7116 argument_type = get_default_promoted_type(argument_type);
7118 argument->expression
7119 = create_implicit_cast(argument->expression, argument_type);
7124 if (is_type_compound(skip_typeref(function_type->return_type))) {
7125 source_position_t const *const pos = &expression->base.source_position;
7126 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7129 if (expression->kind == EXPR_REFERENCE) {
7130 reference_expression_t *reference = &expression->reference;
7131 if (reference->entity->kind == ENTITY_FUNCTION &&
7132 reference->entity->function.btk != BUILTIN_NONE)
7133 handle_builtin_argument_restrictions(call);
7139 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7141 static bool same_compound_type(const type_t *type1, const type_t *type2)
7144 is_type_compound(type1) &&
7145 type1->kind == type2->kind &&
7146 type1->compound.compound == type2->compound.compound;
7149 static expression_t const *get_reference_address(expression_t const *expr)
7151 bool regular_take_address = true;
7153 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7154 expr = expr->unary.value;
7156 regular_take_address = false;
7159 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7162 expr = expr->unary.value;
7165 if (expr->kind != EXPR_REFERENCE)
7168 /* special case for functions which are automatically converted to a
7169 * pointer to function without an extra TAKE_ADDRESS operation */
7170 if (!regular_take_address &&
7171 expr->reference.entity->kind != ENTITY_FUNCTION) {
7178 static void warn_reference_address_as_bool(expression_t const* expr)
7180 expr = get_reference_address(expr);
7182 source_position_t const *const pos = &expr->base.source_position;
7183 entity_t const *const ent = expr->reference.entity;
7184 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7188 static void warn_assignment_in_condition(const expression_t *const expr)
7190 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7192 if (expr->base.parenthesized)
7194 source_position_t const *const pos = &expr->base.source_position;
7195 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7198 static void semantic_condition(expression_t const *const expr,
7199 char const *const context)
7201 type_t *const type = skip_typeref(expr->base.type);
7202 if (is_type_scalar(type)) {
7203 warn_reference_address_as_bool(expr);
7204 warn_assignment_in_condition(expr);
7205 } else if (is_type_valid(type)) {
7206 errorf(&expr->base.source_position,
7207 "%s must have scalar type", context);
7212 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7214 * @param expression the conditional expression
7216 static expression_t *parse_conditional_expression(expression_t *expression)
7218 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7220 conditional_expression_t *conditional = &result->conditional;
7221 conditional->condition = expression;
7224 add_anchor_token(':');
7226 /* §6.5.15:2 The first operand shall have scalar type. */
7227 semantic_condition(expression, "condition of conditional operator");
7229 expression_t *true_expression = expression;
7230 bool gnu_cond = false;
7231 if (GNU_MODE && token.kind == ':') {
7234 true_expression = parse_expression();
7236 rem_anchor_token(':');
7238 expression_t *false_expression =
7239 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7241 type_t *const orig_true_type = true_expression->base.type;
7242 type_t *const orig_false_type = false_expression->base.type;
7243 type_t *const true_type = skip_typeref(orig_true_type);
7244 type_t *const false_type = skip_typeref(orig_false_type);
7247 source_position_t const *const pos = &conditional->base.source_position;
7248 type_t *result_type;
7249 if (is_type_void(true_type) || is_type_void(false_type)) {
7250 /* ISO/IEC 14882:1998(E) §5.16:2 */
7251 if (true_expression->kind == EXPR_UNARY_THROW) {
7252 result_type = false_type;
7253 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7254 result_type = true_type;
7256 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7257 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7259 result_type = type_void;
7261 } else if (is_type_arithmetic(true_type)
7262 && is_type_arithmetic(false_type)) {
7263 result_type = semantic_arithmetic(true_type, false_type);
7264 } else if (same_compound_type(true_type, false_type)) {
7265 /* just take 1 of the 2 types */
7266 result_type = true_type;
7267 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7268 type_t *pointer_type;
7270 expression_t *other_expression;
7271 if (is_type_pointer(true_type) &&
7272 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7273 pointer_type = true_type;
7274 other_type = false_type;
7275 other_expression = false_expression;
7277 pointer_type = false_type;
7278 other_type = true_type;
7279 other_expression = true_expression;
7282 if (is_null_pointer_constant(other_expression)) {
7283 result_type = pointer_type;
7284 } else if (is_type_pointer(other_type)) {
7285 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7286 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7289 if (is_type_void(to1) || is_type_void(to2)) {
7291 } else if (types_compatible(get_unqualified_type(to1),
7292 get_unqualified_type(to2))) {
7295 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7299 type_t *const type =
7300 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7301 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7302 } else if (is_type_integer(other_type)) {
7303 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7304 result_type = pointer_type;
7306 goto types_incompatible;
7310 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7311 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7313 result_type = type_error_type;
7316 conditional->true_expression
7317 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7318 conditional->false_expression
7319 = create_implicit_cast(false_expression, result_type);
7320 conditional->base.type = result_type;
7325 * Parse an extension expression.
7327 static expression_t *parse_extension(void)
7330 expression_t *expression = parse_subexpression(PREC_UNARY);
7336 * Parse a __builtin_classify_type() expression.
7338 static expression_t *parse_builtin_classify_type(void)
7340 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7341 result->base.type = type_int;
7343 eat(T___builtin_classify_type);
7345 add_anchor_token(')');
7347 expression_t *expression = parse_expression();
7348 rem_anchor_token(')');
7350 result->classify_type.type_expression = expression;
7356 * Parse a delete expression
7357 * ISO/IEC 14882:1998(E) §5.3.5
7359 static expression_t *parse_delete(void)
7361 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7362 result->base.type = type_void;
7367 result->kind = EXPR_UNARY_DELETE_ARRAY;
7371 expression_t *const value = parse_subexpression(PREC_CAST);
7372 result->unary.value = value;
7374 type_t *const type = skip_typeref(value->base.type);
7375 if (!is_type_pointer(type)) {
7376 if (is_type_valid(type)) {
7377 errorf(&value->base.source_position,
7378 "operand of delete must have pointer type");
7380 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7381 source_position_t const *const pos = &value->base.source_position;
7382 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7389 * Parse a throw expression
7390 * ISO/IEC 14882:1998(E) §15:1
7392 static expression_t *parse_throw(void)
7394 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7395 result->base.type = type_void;
7399 expression_t *value = NULL;
7400 switch (token.kind) {
7402 value = parse_assignment_expression();
7403 /* ISO/IEC 14882:1998(E) §15.1:3 */
7404 type_t *const orig_type = value->base.type;
7405 type_t *const type = skip_typeref(orig_type);
7406 if (is_type_incomplete(type)) {
7407 errorf(&value->base.source_position,
7408 "cannot throw object of incomplete type '%T'", orig_type);
7409 } else if (is_type_pointer(type)) {
7410 type_t *const points_to = skip_typeref(type->pointer.points_to);
7411 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7412 errorf(&value->base.source_position,
7413 "cannot throw pointer to incomplete type '%T'", orig_type);
7421 result->unary.value = value;
7426 static bool check_pointer_arithmetic(const source_position_t *source_position,
7427 type_t *pointer_type,
7428 type_t *orig_pointer_type)
7430 type_t *points_to = pointer_type->pointer.points_to;
7431 points_to = skip_typeref(points_to);
7433 if (is_type_incomplete(points_to)) {
7434 if (!GNU_MODE || !is_type_void(points_to)) {
7435 errorf(source_position,
7436 "arithmetic with pointer to incomplete type '%T' not allowed",
7440 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7442 } else if (is_type_function(points_to)) {
7444 errorf(source_position,
7445 "arithmetic with pointer to function type '%T' not allowed",
7449 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7455 static bool is_lvalue(const expression_t *expression)
7457 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7458 switch (expression->kind) {
7459 case EXPR_ARRAY_ACCESS:
7460 case EXPR_COMPOUND_LITERAL:
7461 case EXPR_REFERENCE:
7463 case EXPR_UNARY_DEREFERENCE:
7467 type_t *type = skip_typeref(expression->base.type);
7469 /* ISO/IEC 14882:1998(E) §3.10:3 */
7470 is_type_reference(type) ||
7471 /* Claim it is an lvalue, if the type is invalid. There was a parse
7472 * error before, which maybe prevented properly recognizing it as
7474 !is_type_valid(type);
7479 static void semantic_incdec(unary_expression_t *expression)
7481 type_t *const orig_type = expression->value->base.type;
7482 type_t *const type = skip_typeref(orig_type);
7483 if (is_type_pointer(type)) {
7484 if (!check_pointer_arithmetic(&expression->base.source_position,
7488 } else if (!is_type_real(type) && is_type_valid(type)) {
7489 /* TODO: improve error message */
7490 errorf(&expression->base.source_position,
7491 "operation needs an arithmetic or pointer type");
7494 if (!is_lvalue(expression->value)) {
7495 /* TODO: improve error message */
7496 errorf(&expression->base.source_position, "lvalue required as operand");
7498 expression->base.type = orig_type;
7501 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7503 type_t *const res_type = promote_integer(type);
7504 expr->base.type = res_type;
7505 expr->value = create_implicit_cast(expr->value, res_type);
7508 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7510 type_t *const orig_type = expression->value->base.type;
7511 type_t *const type = skip_typeref(orig_type);
7512 if (!is_type_arithmetic(type)) {
7513 if (is_type_valid(type)) {
7514 /* TODO: improve error message */
7515 errorf(&expression->base.source_position,
7516 "operation needs an arithmetic type");
7519 } else if (is_type_integer(type)) {
7520 promote_unary_int_expr(expression, type);
7522 expression->base.type = orig_type;
7526 static void semantic_unexpr_plus(unary_expression_t *expression)
7528 semantic_unexpr_arithmetic(expression);
7529 source_position_t const *const pos = &expression->base.source_position;
7530 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7533 static void semantic_not(unary_expression_t *expression)
7535 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7536 semantic_condition(expression->value, "operand of !");
7537 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7540 static void semantic_unexpr_integer(unary_expression_t *expression)
7542 type_t *const orig_type = expression->value->base.type;
7543 type_t *const type = skip_typeref(orig_type);
7544 if (!is_type_integer(type)) {
7545 if (is_type_valid(type)) {
7546 errorf(&expression->base.source_position,
7547 "operand of ~ must be of integer type");
7552 promote_unary_int_expr(expression, type);
7555 static void semantic_dereference(unary_expression_t *expression)
7557 type_t *const orig_type = expression->value->base.type;
7558 type_t *const type = skip_typeref(orig_type);
7559 if (!is_type_pointer(type)) {
7560 if (is_type_valid(type)) {
7561 errorf(&expression->base.source_position,
7562 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7567 type_t *result_type = type->pointer.points_to;
7568 result_type = automatic_type_conversion(result_type);
7569 expression->base.type = result_type;
7573 * Record that an address is taken (expression represents an lvalue).
7575 * @param expression the expression
7576 * @param may_be_register if true, the expression might be an register
7578 static void set_address_taken(expression_t *expression, bool may_be_register)
7580 if (expression->kind != EXPR_REFERENCE)
7583 entity_t *const entity = expression->reference.entity;
7585 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7588 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7589 && !may_be_register) {
7590 source_position_t const *const pos = &expression->base.source_position;
7591 errorf(pos, "address of register '%N' requested", entity);
7594 entity->variable.address_taken = true;
7598 * Check the semantic of the address taken expression.
7600 static void semantic_take_addr(unary_expression_t *expression)
7602 expression_t *value = expression->value;
7603 value->base.type = revert_automatic_type_conversion(value);
7605 type_t *orig_type = value->base.type;
7606 type_t *type = skip_typeref(orig_type);
7607 if (!is_type_valid(type))
7611 if (!is_lvalue(value)) {
7612 errorf(&expression->base.source_position, "'&' requires an lvalue");
7614 if (is_bitfield(value)) {
7615 errorf(&expression->base.source_position,
7616 "'&' not allowed on bitfield");
7619 set_address_taken(value, false);
7621 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7624 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7625 static expression_t *parse_##unexpression_type(void) \
7627 expression_t *unary_expression \
7628 = allocate_expression_zero(unexpression_type); \
7630 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7632 sfunc(&unary_expression->unary); \
7634 return unary_expression; \
7637 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7638 semantic_unexpr_arithmetic)
7639 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7640 semantic_unexpr_plus)
7641 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7643 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7644 semantic_dereference)
7645 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7647 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7648 semantic_unexpr_integer)
7649 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7651 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7654 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7656 static expression_t *parse_##unexpression_type(expression_t *left) \
7658 expression_t *unary_expression \
7659 = allocate_expression_zero(unexpression_type); \
7661 unary_expression->unary.value = left; \
7663 sfunc(&unary_expression->unary); \
7665 return unary_expression; \
7668 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7669 EXPR_UNARY_POSTFIX_INCREMENT,
7671 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7672 EXPR_UNARY_POSTFIX_DECREMENT,
7675 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7677 /* TODO: handle complex + imaginary types */
7679 type_left = get_unqualified_type(type_left);
7680 type_right = get_unqualified_type(type_right);
7682 /* §6.3.1.8 Usual arithmetic conversions */
7683 if (type_left == type_long_double || type_right == type_long_double) {
7684 return type_long_double;
7685 } else if (type_left == type_double || type_right == type_double) {
7687 } else if (type_left == type_float || type_right == type_float) {
7691 type_left = promote_integer(type_left);
7692 type_right = promote_integer(type_right);
7694 if (type_left == type_right)
7697 bool const signed_left = is_type_signed(type_left);
7698 bool const signed_right = is_type_signed(type_right);
7699 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7700 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7702 if (signed_left == signed_right)
7703 return rank_left >= rank_right ? type_left : type_right;
7707 atomic_type_kind_t s_akind;
7708 atomic_type_kind_t u_akind;
7713 u_type = type_right;
7715 s_type = type_right;
7718 s_akind = get_akind(s_type);
7719 u_akind = get_akind(u_type);
7720 s_rank = get_akind_rank(s_akind);
7721 u_rank = get_akind_rank(u_akind);
7723 if (u_rank >= s_rank)
7726 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7730 case ATOMIC_TYPE_INT: return type_unsigned_int;
7731 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7732 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7734 default: panic("invalid atomic type");
7739 * Check the semantic restrictions for a binary expression.
7741 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7743 expression_t *const left = expression->left;
7744 expression_t *const right = expression->right;
7745 type_t *const orig_type_left = left->base.type;
7746 type_t *const orig_type_right = right->base.type;
7747 type_t *const type_left = skip_typeref(orig_type_left);
7748 type_t *const type_right = skip_typeref(orig_type_right);
7750 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7751 /* TODO: improve error message */
7752 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7753 errorf(&expression->base.source_position,
7754 "operation needs arithmetic types");
7759 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7760 expression->left = create_implicit_cast(left, arithmetic_type);
7761 expression->right = create_implicit_cast(right, arithmetic_type);
7762 expression->base.type = arithmetic_type;
7765 static void semantic_binexpr_integer(binary_expression_t *const expression)
7767 expression_t *const left = expression->left;
7768 expression_t *const right = expression->right;
7769 type_t *const orig_type_left = left->base.type;
7770 type_t *const orig_type_right = right->base.type;
7771 type_t *const type_left = skip_typeref(orig_type_left);
7772 type_t *const type_right = skip_typeref(orig_type_right);
7774 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7775 /* TODO: improve error message */
7776 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7777 errorf(&expression->base.source_position,
7778 "operation needs integer types");
7783 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7784 expression->left = create_implicit_cast(left, result_type);
7785 expression->right = create_implicit_cast(right, result_type);
7786 expression->base.type = result_type;
7789 static void warn_div_by_zero(binary_expression_t const *const expression)
7791 if (!is_type_integer(expression->base.type))
7794 expression_t const *const right = expression->right;
7795 /* The type of the right operand can be different for /= */
7796 if (is_type_integer(right->base.type) &&
7797 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7798 !fold_constant_to_bool(right)) {
7799 source_position_t const *const pos = &expression->base.source_position;
7800 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7805 * Check the semantic restrictions for a div/mod expression.
7807 static void semantic_divmod_arithmetic(binary_expression_t *expression)
7809 semantic_binexpr_arithmetic(expression);
7810 warn_div_by_zero(expression);
7813 static void warn_addsub_in_shift(const expression_t *const expr)
7815 if (expr->base.parenthesized)
7819 switch (expr->kind) {
7820 case EXPR_BINARY_ADD: op = '+'; break;
7821 case EXPR_BINARY_SUB: op = '-'; break;
7825 source_position_t const *const pos = &expr->base.source_position;
7826 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7829 static bool semantic_shift(binary_expression_t *expression)
7831 expression_t *const left = expression->left;
7832 expression_t *const right = expression->right;
7833 type_t *const orig_type_left = left->base.type;
7834 type_t *const orig_type_right = right->base.type;
7835 type_t * type_left = skip_typeref(orig_type_left);
7836 type_t * type_right = skip_typeref(orig_type_right);
7838 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7839 /* TODO: improve error message */
7840 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7841 errorf(&expression->base.source_position,
7842 "operands of shift operation must have integer types");
7847 type_left = promote_integer(type_left);
7849 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
7850 source_position_t const *const pos = &right->base.source_position;
7851 long const count = fold_constant_to_int(right);
7853 warningf(WARN_OTHER, pos, "shift count must be non-negative");
7854 } else if ((unsigned long)count >=
7855 get_atomic_type_size(type_left->atomic.akind) * 8) {
7856 warningf(WARN_OTHER, pos, "shift count must be less than type width");
7860 type_right = promote_integer(type_right);
7861 expression->right = create_implicit_cast(right, type_right);
7866 static void semantic_shift_op(binary_expression_t *expression)
7868 expression_t *const left = expression->left;
7869 expression_t *const right = expression->right;
7871 if (!semantic_shift(expression))
7874 warn_addsub_in_shift(left);
7875 warn_addsub_in_shift(right);
7877 type_t *const orig_type_left = left->base.type;
7878 type_t * type_left = skip_typeref(orig_type_left);
7880 type_left = promote_integer(type_left);
7881 expression->left = create_implicit_cast(left, type_left);
7882 expression->base.type = type_left;
7885 static void semantic_add(binary_expression_t *expression)
7887 expression_t *const left = expression->left;
7888 expression_t *const right = expression->right;
7889 type_t *const orig_type_left = left->base.type;
7890 type_t *const orig_type_right = right->base.type;
7891 type_t *const type_left = skip_typeref(orig_type_left);
7892 type_t *const type_right = skip_typeref(orig_type_right);
7895 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7896 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7897 expression->left = create_implicit_cast(left, arithmetic_type);
7898 expression->right = create_implicit_cast(right, arithmetic_type);
7899 expression->base.type = arithmetic_type;
7900 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7901 check_pointer_arithmetic(&expression->base.source_position,
7902 type_left, orig_type_left);
7903 expression->base.type = type_left;
7904 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7905 check_pointer_arithmetic(&expression->base.source_position,
7906 type_right, orig_type_right);
7907 expression->base.type = type_right;
7908 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7909 errorf(&expression->base.source_position,
7910 "invalid operands to binary + ('%T', '%T')",
7911 orig_type_left, orig_type_right);
7915 static void semantic_sub(binary_expression_t *expression)
7917 expression_t *const left = expression->left;
7918 expression_t *const right = expression->right;
7919 type_t *const orig_type_left = left->base.type;
7920 type_t *const orig_type_right = right->base.type;
7921 type_t *const type_left = skip_typeref(orig_type_left);
7922 type_t *const type_right = skip_typeref(orig_type_right);
7923 source_position_t const *const pos = &expression->base.source_position;
7926 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7927 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7928 expression->left = create_implicit_cast(left, arithmetic_type);
7929 expression->right = create_implicit_cast(right, arithmetic_type);
7930 expression->base.type = arithmetic_type;
7931 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7932 check_pointer_arithmetic(&expression->base.source_position,
7933 type_left, orig_type_left);
7934 expression->base.type = type_left;
7935 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7936 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7937 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7938 if (!types_compatible(unqual_left, unqual_right)) {
7940 "subtracting pointers to incompatible types '%T' and '%T'",
7941 orig_type_left, orig_type_right);
7942 } else if (!is_type_object(unqual_left)) {
7943 if (!is_type_void(unqual_left)) {
7944 errorf(pos, "subtracting pointers to non-object types '%T'",
7947 warningf(WARN_OTHER, pos, "subtracting pointers to void");
7950 expression->base.type = type_ptrdiff_t;
7951 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7952 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7953 orig_type_left, orig_type_right);
7957 static void warn_string_literal_address(expression_t const* expr)
7959 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7960 expr = expr->unary.value;
7961 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7963 expr = expr->unary.value;
7966 if (expr->kind == EXPR_STRING_LITERAL) {
7967 source_position_t const *const pos = &expr->base.source_position;
7968 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
7972 static bool maybe_negative(expression_t const *const expr)
7974 switch (is_constant_expression(expr)) {
7975 case EXPR_CLASS_ERROR: return false;
7976 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
7977 default: return true;
7981 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
7983 warn_string_literal_address(expr);
7985 expression_t const* const ref = get_reference_address(expr);
7986 if (ref != NULL && is_null_pointer_constant(other)) {
7987 entity_t const *const ent = ref->reference.entity;
7988 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
7991 if (!expr->base.parenthesized) {
7992 switch (expr->base.kind) {
7993 case EXPR_BINARY_LESS:
7994 case EXPR_BINARY_GREATER:
7995 case EXPR_BINARY_LESSEQUAL:
7996 case EXPR_BINARY_GREATEREQUAL:
7997 case EXPR_BINARY_NOTEQUAL:
7998 case EXPR_BINARY_EQUAL:
7999 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8008 * Check the semantics of comparison expressions.
8010 * @param expression The expression to check.
8012 static void semantic_comparison(binary_expression_t *expression)
8014 source_position_t const *const pos = &expression->base.source_position;
8015 expression_t *const left = expression->left;
8016 expression_t *const right = expression->right;
8018 warn_comparison(pos, left, right);
8019 warn_comparison(pos, right, left);
8021 type_t *orig_type_left = left->base.type;
8022 type_t *orig_type_right = right->base.type;
8023 type_t *type_left = skip_typeref(orig_type_left);
8024 type_t *type_right = skip_typeref(orig_type_right);
8026 /* TODO non-arithmetic types */
8027 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8028 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8030 /* test for signed vs unsigned compares */
8031 if (is_type_integer(arithmetic_type)) {
8032 bool const signed_left = is_type_signed(type_left);
8033 bool const signed_right = is_type_signed(type_right);
8034 if (signed_left != signed_right) {
8035 /* FIXME long long needs better const folding magic */
8036 /* TODO check whether constant value can be represented by other type */
8037 if ((signed_left && maybe_negative(left)) ||
8038 (signed_right && maybe_negative(right))) {
8039 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8044 expression->left = create_implicit_cast(left, arithmetic_type);
8045 expression->right = create_implicit_cast(right, arithmetic_type);
8046 expression->base.type = arithmetic_type;
8047 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8048 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8049 is_type_float(arithmetic_type)) {
8050 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8052 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8053 /* TODO check compatibility */
8054 } else if (is_type_pointer(type_left)) {
8055 expression->right = create_implicit_cast(right, type_left);
8056 } else if (is_type_pointer(type_right)) {
8057 expression->left = create_implicit_cast(left, type_right);
8058 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8059 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8061 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8065 * Checks if a compound type has constant fields.
8067 static bool has_const_fields(const compound_type_t *type)
8069 compound_t *compound = type->compound;
8070 entity_t *entry = compound->members.entities;
8072 for (; entry != NULL; entry = entry->base.next) {
8073 if (!is_declaration(entry))
8076 const type_t *decl_type = skip_typeref(entry->declaration.type);
8077 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8084 static bool is_valid_assignment_lhs(expression_t const* const left)
8086 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8087 type_t *const type_left = skip_typeref(orig_type_left);
8089 if (!is_lvalue(left)) {
8090 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8095 if (left->kind == EXPR_REFERENCE
8096 && left->reference.entity->kind == ENTITY_FUNCTION) {
8097 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8101 if (is_type_array(type_left)) {
8102 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8105 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8106 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8110 if (is_type_incomplete(type_left)) {
8111 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8112 left, orig_type_left);
8115 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8116 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8117 left, orig_type_left);
8124 static void semantic_arithmetic_assign(binary_expression_t *expression)
8126 expression_t *left = expression->left;
8127 expression_t *right = expression->right;
8128 type_t *orig_type_left = left->base.type;
8129 type_t *orig_type_right = right->base.type;
8131 if (!is_valid_assignment_lhs(left))
8134 type_t *type_left = skip_typeref(orig_type_left);
8135 type_t *type_right = skip_typeref(orig_type_right);
8137 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8138 /* TODO: improve error message */
8139 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8140 errorf(&expression->base.source_position,
8141 "operation needs arithmetic types");
8146 /* combined instructions are tricky. We can't create an implicit cast on
8147 * the left side, because we need the uncasted form for the store.
8148 * The ast2firm pass has to know that left_type must be right_type
8149 * for the arithmetic operation and create a cast by itself */
8150 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8151 expression->right = create_implicit_cast(right, arithmetic_type);
8152 expression->base.type = type_left;
8155 static void semantic_divmod_assign(binary_expression_t *expression)
8157 semantic_arithmetic_assign(expression);
8158 warn_div_by_zero(expression);
8161 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8163 expression_t *const left = expression->left;
8164 expression_t *const right = expression->right;
8165 type_t *const orig_type_left = left->base.type;
8166 type_t *const orig_type_right = right->base.type;
8167 type_t *const type_left = skip_typeref(orig_type_left);
8168 type_t *const type_right = skip_typeref(orig_type_right);
8170 if (!is_valid_assignment_lhs(left))
8173 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8174 /* combined instructions are tricky. We can't create an implicit cast on
8175 * the left side, because we need the uncasted form for the store.
8176 * The ast2firm pass has to know that left_type must be right_type
8177 * for the arithmetic operation and create a cast by itself */
8178 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8179 expression->right = create_implicit_cast(right, arithmetic_type);
8180 expression->base.type = type_left;
8181 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8182 check_pointer_arithmetic(&expression->base.source_position,
8183 type_left, orig_type_left);
8184 expression->base.type = type_left;
8185 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8186 errorf(&expression->base.source_position,
8187 "incompatible types '%T' and '%T' in assignment",
8188 orig_type_left, orig_type_right);
8192 static void semantic_integer_assign(binary_expression_t *expression)
8194 expression_t *left = expression->left;
8195 expression_t *right = expression->right;
8196 type_t *orig_type_left = left->base.type;
8197 type_t *orig_type_right = right->base.type;
8199 if (!is_valid_assignment_lhs(left))
8202 type_t *type_left = skip_typeref(orig_type_left);
8203 type_t *type_right = skip_typeref(orig_type_right);
8205 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8206 /* TODO: improve error message */
8207 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8208 errorf(&expression->base.source_position,
8209 "operation needs integer types");
8214 /* combined instructions are tricky. We can't create an implicit cast on
8215 * the left side, because we need the uncasted form for the store.
8216 * The ast2firm pass has to know that left_type must be right_type
8217 * for the arithmetic operation and create a cast by itself */
8218 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8219 expression->right = create_implicit_cast(right, arithmetic_type);
8220 expression->base.type = type_left;
8223 static void semantic_shift_assign(binary_expression_t *expression)
8225 expression_t *left = expression->left;
8227 if (!is_valid_assignment_lhs(left))
8230 if (!semantic_shift(expression))
8233 expression->base.type = skip_typeref(left->base.type);
8236 static void warn_logical_and_within_or(const expression_t *const expr)
8238 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8240 if (expr->base.parenthesized)
8242 source_position_t const *const pos = &expr->base.source_position;
8243 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8247 * Check the semantic restrictions of a logical expression.
8249 static void semantic_logical_op(binary_expression_t *expression)
8251 /* §6.5.13:2 Each of the operands shall have scalar type.
8252 * §6.5.14:2 Each of the operands shall have scalar type. */
8253 semantic_condition(expression->left, "left operand of logical operator");
8254 semantic_condition(expression->right, "right operand of logical operator");
8255 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8256 warn_logical_and_within_or(expression->left);
8257 warn_logical_and_within_or(expression->right);
8259 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8263 * Check the semantic restrictions of a binary assign expression.
8265 static void semantic_binexpr_assign(binary_expression_t *expression)
8267 expression_t *left = expression->left;
8268 type_t *orig_type_left = left->base.type;
8270 if (!is_valid_assignment_lhs(left))
8273 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8274 report_assign_error(error, orig_type_left, expression->right,
8275 "assignment", &left->base.source_position);
8276 expression->right = create_implicit_cast(expression->right, orig_type_left);
8277 expression->base.type = orig_type_left;
8281 * Determine if the outermost operation (or parts thereof) of the given
8282 * expression has no effect in order to generate a warning about this fact.
8283 * Therefore in some cases this only examines some of the operands of the
8284 * expression (see comments in the function and examples below).
8286 * f() + 23; // warning, because + has no effect
8287 * x || f(); // no warning, because x controls execution of f()
8288 * x ? y : f(); // warning, because y has no effect
8289 * (void)x; // no warning to be able to suppress the warning
8290 * This function can NOT be used for an "expression has definitely no effect"-
8292 static bool expression_has_effect(const expression_t *const expr)
8294 switch (expr->kind) {
8295 case EXPR_ERROR: return true; /* do NOT warn */
8296 case EXPR_REFERENCE: return false;
8297 case EXPR_ENUM_CONSTANT: return false;
8298 case EXPR_LABEL_ADDRESS: return false;
8300 /* suppress the warning for microsoft __noop operations */
8301 case EXPR_LITERAL_MS_NOOP: return true;
8302 case EXPR_LITERAL_BOOLEAN:
8303 case EXPR_LITERAL_CHARACTER:
8304 case EXPR_LITERAL_INTEGER:
8305 case EXPR_LITERAL_FLOATINGPOINT:
8306 case EXPR_STRING_LITERAL: return false;
8309 const call_expression_t *const call = &expr->call;
8310 if (call->function->kind != EXPR_REFERENCE)
8313 switch (call->function->reference.entity->function.btk) {
8314 /* FIXME: which builtins have no effect? */
8315 default: return true;
8319 /* Generate the warning if either the left or right hand side of a
8320 * conditional expression has no effect */
8321 case EXPR_CONDITIONAL: {
8322 conditional_expression_t const *const cond = &expr->conditional;
8323 expression_t const *const t = cond->true_expression;
8325 (t == NULL || expression_has_effect(t)) &&
8326 expression_has_effect(cond->false_expression);
8329 case EXPR_SELECT: return false;
8330 case EXPR_ARRAY_ACCESS: return false;
8331 case EXPR_SIZEOF: return false;
8332 case EXPR_CLASSIFY_TYPE: return false;
8333 case EXPR_ALIGNOF: return false;
8335 case EXPR_FUNCNAME: return false;
8336 case EXPR_BUILTIN_CONSTANT_P: return false;
8337 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8338 case EXPR_OFFSETOF: return false;
8339 case EXPR_VA_START: return true;
8340 case EXPR_VA_ARG: return true;
8341 case EXPR_VA_COPY: return true;
8342 case EXPR_STATEMENT: return true; // TODO
8343 case EXPR_COMPOUND_LITERAL: return false;
8345 case EXPR_UNARY_NEGATE: return false;
8346 case EXPR_UNARY_PLUS: return false;
8347 case EXPR_UNARY_BITWISE_NEGATE: return false;
8348 case EXPR_UNARY_NOT: return false;
8349 case EXPR_UNARY_DEREFERENCE: return false;
8350 case EXPR_UNARY_TAKE_ADDRESS: return false;
8351 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8352 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8353 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8354 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8356 /* Treat void casts as if they have an effect in order to being able to
8357 * suppress the warning */
8358 case EXPR_UNARY_CAST: {
8359 type_t *const type = skip_typeref(expr->base.type);
8360 return is_type_void(type);
8363 case EXPR_UNARY_ASSUME: return true;
8364 case EXPR_UNARY_DELETE: return true;
8365 case EXPR_UNARY_DELETE_ARRAY: return true;
8366 case EXPR_UNARY_THROW: return true;
8368 case EXPR_BINARY_ADD: return false;
8369 case EXPR_BINARY_SUB: return false;
8370 case EXPR_BINARY_MUL: return false;
8371 case EXPR_BINARY_DIV: return false;
8372 case EXPR_BINARY_MOD: return false;
8373 case EXPR_BINARY_EQUAL: return false;
8374 case EXPR_BINARY_NOTEQUAL: return false;
8375 case EXPR_BINARY_LESS: return false;
8376 case EXPR_BINARY_LESSEQUAL: return false;
8377 case EXPR_BINARY_GREATER: return false;
8378 case EXPR_BINARY_GREATEREQUAL: return false;
8379 case EXPR_BINARY_BITWISE_AND: return false;
8380 case EXPR_BINARY_BITWISE_OR: return false;
8381 case EXPR_BINARY_BITWISE_XOR: return false;
8382 case EXPR_BINARY_SHIFTLEFT: return false;
8383 case EXPR_BINARY_SHIFTRIGHT: return false;
8384 case EXPR_BINARY_ASSIGN: return true;
8385 case EXPR_BINARY_MUL_ASSIGN: return true;
8386 case EXPR_BINARY_DIV_ASSIGN: return true;
8387 case EXPR_BINARY_MOD_ASSIGN: return true;
8388 case EXPR_BINARY_ADD_ASSIGN: return true;
8389 case EXPR_BINARY_SUB_ASSIGN: return true;
8390 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8391 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8392 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8393 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8394 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8396 /* Only examine the right hand side of && and ||, because the left hand
8397 * side already has the effect of controlling the execution of the right
8399 case EXPR_BINARY_LOGICAL_AND:
8400 case EXPR_BINARY_LOGICAL_OR:
8401 /* Only examine the right hand side of a comma expression, because the left
8402 * hand side has a separate warning */
8403 case EXPR_BINARY_COMMA:
8404 return expression_has_effect(expr->binary.right);
8406 case EXPR_BINARY_ISGREATER: return false;
8407 case EXPR_BINARY_ISGREATEREQUAL: return false;
8408 case EXPR_BINARY_ISLESS: return false;
8409 case EXPR_BINARY_ISLESSEQUAL: return false;
8410 case EXPR_BINARY_ISLESSGREATER: return false;
8411 case EXPR_BINARY_ISUNORDERED: return false;
8414 internal_errorf(HERE, "unexpected expression");
8417 static void semantic_comma(binary_expression_t *expression)
8419 const expression_t *const left = expression->left;
8420 if (!expression_has_effect(left)) {
8421 source_position_t const *const pos = &left->base.source_position;
8422 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8424 expression->base.type = expression->right->base.type;
8428 * @param prec_r precedence of the right operand
8430 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8431 static expression_t *parse_##binexpression_type(expression_t *left) \
8433 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8434 binexpr->binary.left = left; \
8437 expression_t *right = parse_subexpression(prec_r); \
8439 binexpr->binary.right = right; \
8440 sfunc(&binexpr->binary); \
8445 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8446 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8447 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8448 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8449 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8450 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8451 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8452 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8453 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8454 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8455 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8456 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8457 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8458 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8459 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8460 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8461 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8462 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8463 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8464 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8465 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8466 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8467 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8468 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8469 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8470 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8471 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8472 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8473 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8474 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8477 static expression_t *parse_subexpression(precedence_t precedence)
8479 expression_parser_function_t *parser
8480 = &expression_parsers[token.kind];
8483 if (parser->parser != NULL) {
8484 left = parser->parser();
8486 left = parse_primary_expression();
8488 assert(left != NULL);
8491 parser = &expression_parsers[token.kind];
8492 if (parser->infix_parser == NULL)
8494 if (parser->infix_precedence < precedence)
8497 left = parser->infix_parser(left);
8499 assert(left != NULL);
8506 * Parse an expression.
8508 static expression_t *parse_expression(void)
8510 return parse_subexpression(PREC_EXPRESSION);
8514 * Register a parser for a prefix-like operator.
8516 * @param parser the parser function
8517 * @param token_kind the token type of the prefix token
8519 static void register_expression_parser(parse_expression_function parser,
8522 expression_parser_function_t *entry = &expression_parsers[token_kind];
8524 if (entry->parser != NULL) {
8525 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8526 panic("trying to register multiple expression parsers for a token");
8528 entry->parser = parser;
8532 * Register a parser for an infix operator with given precedence.
8534 * @param parser the parser function
8535 * @param token_kind the token type of the infix operator
8536 * @param precedence the precedence of the operator
8538 static void register_infix_parser(parse_expression_infix_function parser,
8539 int token_kind, precedence_t precedence)
8541 expression_parser_function_t *entry = &expression_parsers[token_kind];
8543 if (entry->infix_parser != NULL) {
8544 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8545 panic("trying to register multiple infix expression parsers for a "
8548 entry->infix_parser = parser;
8549 entry->infix_precedence = precedence;
8553 * Initialize the expression parsers.
8555 static void init_expression_parsers(void)
8557 memset(&expression_parsers, 0, sizeof(expression_parsers));
8559 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8560 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8561 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8562 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8563 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8564 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8565 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8566 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8567 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8568 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8569 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8570 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8571 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8572 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8573 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8574 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8575 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8576 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8577 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8578 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8579 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8580 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8581 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8582 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8583 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8584 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8585 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8586 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8587 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8588 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8589 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8590 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8591 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8592 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8593 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8594 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8595 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8597 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8598 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8599 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8600 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8601 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8602 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8603 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8604 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8605 register_expression_parser(parse_sizeof, T_sizeof);
8606 register_expression_parser(parse_alignof, T___alignof__);
8607 register_expression_parser(parse_extension, T___extension__);
8608 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8609 register_expression_parser(parse_delete, T_delete);
8610 register_expression_parser(parse_throw, T_throw);
8614 * Parse a asm statement arguments specification.
8616 static asm_argument_t *parse_asm_arguments(bool is_out)
8618 asm_argument_t *result = NULL;
8619 asm_argument_t **anchor = &result;
8621 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8622 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8625 add_anchor_token(']');
8626 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8627 rem_anchor_token(']');
8629 if (!argument->symbol)
8633 argument->constraints = parse_string_literals("asm argument");
8634 add_anchor_token(')');
8636 expression_t *expression = parse_expression();
8637 rem_anchor_token(')');
8639 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8640 * change size or type representation (e.g. int -> long is ok, but
8641 * int -> float is not) */
8642 if (expression->kind == EXPR_UNARY_CAST) {
8643 type_t *const type = expression->base.type;
8644 type_kind_t const kind = type->kind;
8645 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8648 if (kind == TYPE_ATOMIC) {
8649 atomic_type_kind_t const akind = type->atomic.akind;
8650 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8651 size = get_atomic_type_size(akind);
8653 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8654 size = get_type_size(type_void_ptr);
8658 expression_t *const value = expression->unary.value;
8659 type_t *const value_type = value->base.type;
8660 type_kind_t const value_kind = value_type->kind;
8662 unsigned value_flags;
8663 unsigned value_size;
8664 if (value_kind == TYPE_ATOMIC) {
8665 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8666 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8667 value_size = get_atomic_type_size(value_akind);
8668 } else if (value_kind == TYPE_POINTER) {
8669 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8670 value_size = get_type_size(type_void_ptr);
8675 if (value_flags != flags || value_size != size)
8679 } while (expression->kind == EXPR_UNARY_CAST);
8683 if (!is_lvalue(expression)) {
8684 errorf(&expression->base.source_position,
8685 "asm output argument is not an lvalue");
8688 if (argument->constraints.begin[0] == '=')
8689 determine_lhs_ent(expression, NULL);
8691 mark_vars_read(expression, NULL);
8693 mark_vars_read(expression, NULL);
8695 argument->expression = expression;
8698 set_address_taken(expression, true);
8701 anchor = &argument->next;
8711 * Parse a asm statement clobber specification.
8713 static asm_clobber_t *parse_asm_clobbers(void)
8715 asm_clobber_t *result = NULL;
8716 asm_clobber_t **anchor = &result;
8718 while (token.kind == T_STRING_LITERAL) {
8719 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8720 clobber->clobber = parse_string_literals(NULL);
8723 anchor = &clobber->next;
8733 * Parse an asm statement.
8735 static statement_t *parse_asm_statement(void)
8737 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8738 asm_statement_t *asm_statement = &statement->asms;
8741 add_anchor_token(')');
8742 add_anchor_token(':');
8743 add_anchor_token(T_STRING_LITERAL);
8745 if (next_if(T_volatile))
8746 asm_statement->is_volatile = true;
8749 rem_anchor_token(T_STRING_LITERAL);
8750 asm_statement->asm_text = parse_string_literals("asm statement");
8753 asm_statement->outputs = parse_asm_arguments(true);
8756 asm_statement->inputs = parse_asm_arguments(false);
8758 rem_anchor_token(':');
8760 asm_statement->clobbers = parse_asm_clobbers();
8762 rem_anchor_token(')');
8766 if (asm_statement->outputs == NULL) {
8767 /* GCC: An 'asm' instruction without any output operands will be treated
8768 * identically to a volatile 'asm' instruction. */
8769 asm_statement->is_volatile = true;
8775 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8777 statement_t *inner_stmt;
8778 switch (token.kind) {
8780 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
8781 inner_stmt = create_error_statement();
8785 if (label->kind == STATEMENT_LABEL) {
8786 /* Eat an empty statement here, to avoid the warning about an empty
8787 * statement after a label. label:; is commonly used to have a label
8788 * before a closing brace. */
8789 inner_stmt = create_empty_statement();
8796 inner_stmt = parse_statement();
8797 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8798 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8799 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8800 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
8808 * Parse a case statement.
8810 static statement_t *parse_case_statement(void)
8812 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8813 source_position_t *const pos = &statement->base.source_position;
8816 add_anchor_token(':');
8818 expression_t *expression = parse_expression();
8819 type_t *expression_type = expression->base.type;
8820 type_t *skipped = skip_typeref(expression_type);
8821 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8822 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8823 expression, expression_type);
8826 type_t *type = expression_type;
8827 if (current_switch != NULL) {
8828 type_t *switch_type = current_switch->expression->base.type;
8829 if (is_type_valid(switch_type)) {
8830 expression = create_implicit_cast(expression, switch_type);
8834 statement->case_label.expression = expression;
8835 expression_classification_t const expr_class = is_constant_expression(expression);
8836 if (expr_class != EXPR_CLASS_CONSTANT) {
8837 if (expr_class != EXPR_CLASS_ERROR) {
8838 errorf(pos, "case label does not reduce to an integer constant");
8840 statement->case_label.is_bad = true;
8842 long const val = fold_constant_to_int(expression);
8843 statement->case_label.first_case = val;
8844 statement->case_label.last_case = val;
8848 if (next_if(T_DOTDOTDOT)) {
8849 expression_t *end_range = parse_expression();
8850 expression_type = expression->base.type;
8851 skipped = skip_typeref(expression_type);
8852 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8853 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8854 expression, expression_type);
8857 end_range = create_implicit_cast(end_range, type);
8858 statement->case_label.end_range = end_range;
8859 expression_classification_t const end_class = is_constant_expression(end_range);
8860 if (end_class != EXPR_CLASS_CONSTANT) {
8861 if (end_class != EXPR_CLASS_ERROR) {
8862 errorf(pos, "case range does not reduce to an integer constant");
8864 statement->case_label.is_bad = true;
8866 long const val = fold_constant_to_int(end_range);
8867 statement->case_label.last_case = val;
8869 if (val < statement->case_label.first_case) {
8870 statement->case_label.is_empty_range = true;
8871 warningf(WARN_OTHER, pos, "empty range specified");
8877 PUSH_PARENT(statement);
8879 rem_anchor_token(':');
8882 if (current_switch != NULL) {
8883 if (! statement->case_label.is_bad) {
8884 /* Check for duplicate case values */
8885 case_label_statement_t *c = &statement->case_label;
8886 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8887 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8890 if (c->last_case < l->first_case || c->first_case > l->last_case)
8893 errorf(pos, "duplicate case value (previously used %P)",
8894 &l->base.source_position);
8898 /* link all cases into the switch statement */
8899 if (current_switch->last_case == NULL) {
8900 current_switch->first_case = &statement->case_label;
8902 current_switch->last_case->next = &statement->case_label;
8904 current_switch->last_case = &statement->case_label;
8906 errorf(pos, "case label not within a switch statement");
8909 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
8916 * Parse a default statement.
8918 static statement_t *parse_default_statement(void)
8920 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8924 PUSH_PARENT(statement);
8928 if (current_switch != NULL) {
8929 const case_label_statement_t *def_label = current_switch->default_label;
8930 if (def_label != NULL) {
8931 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
8933 current_switch->default_label = &statement->case_label;
8935 /* link all cases into the switch statement */
8936 if (current_switch->last_case == NULL) {
8937 current_switch->first_case = &statement->case_label;
8939 current_switch->last_case->next = &statement->case_label;
8941 current_switch->last_case = &statement->case_label;
8944 errorf(&statement->base.source_position,
8945 "'default' label not within a switch statement");
8948 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
8955 * Parse a label statement.
8957 static statement_t *parse_label_statement(void)
8959 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8960 label_t *const label = get_label(NULL /* Cannot fail, token is T_IDENTIFIER. */);
8961 statement->label.label = label;
8963 PUSH_PARENT(statement);
8965 /* if statement is already set then the label is defined twice,
8966 * otherwise it was just mentioned in a goto/local label declaration so far
8968 source_position_t const* const pos = &statement->base.source_position;
8969 if (label->statement != NULL) {
8970 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
8972 label->base.source_position = *pos;
8973 label->statement = statement;
8978 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
8979 parse_attributes(NULL); // TODO process attributes
8982 statement->label.statement = parse_label_inner_statement(statement, "label");
8984 /* remember the labels in a list for later checking */
8985 *label_anchor = &statement->label;
8986 label_anchor = &statement->label.next;
8992 static statement_t *parse_inner_statement(void)
8994 statement_t *const stmt = parse_statement();
8995 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8996 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8997 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8998 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9004 * Parse an expression in parentheses and mark its variables as read.
9006 static expression_t *parse_condition(void)
9008 add_anchor_token(')');
9010 expression_t *const expr = parse_expression();
9011 mark_vars_read(expr, NULL);
9012 rem_anchor_token(')');
9018 * Parse an if statement.
9020 static statement_t *parse_if(void)
9022 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9026 PUSH_PARENT(statement);
9027 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9029 add_anchor_token(T_else);
9031 expression_t *const expr = parse_condition();
9032 statement->ifs.condition = expr;
9033 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9035 semantic_condition(expr, "condition of 'if'-statment");
9037 statement_t *const true_stmt = parse_inner_statement();
9038 statement->ifs.true_statement = true_stmt;
9039 rem_anchor_token(T_else);
9041 if (true_stmt->kind == STATEMENT_EMPTY) {
9042 warningf(WARN_EMPTY_BODY, HERE,
9043 "suggest braces around empty body in an ‘if’ statement");
9046 if (next_if(T_else)) {
9047 statement->ifs.false_statement = parse_inner_statement();
9049 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9050 warningf(WARN_EMPTY_BODY, HERE,
9051 "suggest braces around empty body in an ‘if’ statement");
9053 } else if (true_stmt->kind == STATEMENT_IF &&
9054 true_stmt->ifs.false_statement != NULL) {
9055 source_position_t const *const pos = &true_stmt->base.source_position;
9056 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9065 * Check that all enums are handled in a switch.
9067 * @param statement the switch statement to check
9069 static void check_enum_cases(const switch_statement_t *statement)
9071 if (!is_warn_on(WARN_SWITCH_ENUM))
9073 const type_t *type = skip_typeref(statement->expression->base.type);
9074 if (! is_type_enum(type))
9076 const enum_type_t *enumt = &type->enumt;
9078 /* if we have a default, no warnings */
9079 if (statement->default_label != NULL)
9082 /* FIXME: calculation of value should be done while parsing */
9083 /* TODO: quadratic algorithm here. Change to an n log n one */
9084 long last_value = -1;
9085 const entity_t *entry = enumt->enume->base.next;
9086 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9087 entry = entry->base.next) {
9088 const expression_t *expression = entry->enum_value.value;
9089 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9091 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9092 if (l->expression == NULL)
9094 if (l->first_case <= value && value <= l->last_case) {
9100 source_position_t const *const pos = &statement->base.source_position;
9101 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9108 * Parse a switch statement.
9110 static statement_t *parse_switch(void)
9112 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9116 PUSH_PARENT(statement);
9117 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9119 expression_t *const expr = parse_condition();
9120 type_t * type = skip_typeref(expr->base.type);
9121 if (is_type_integer(type)) {
9122 type = promote_integer(type);
9123 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9124 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9126 } else if (is_type_valid(type)) {
9127 errorf(&expr->base.source_position,
9128 "switch quantity is not an integer, but '%T'", type);
9129 type = type_error_type;
9131 statement->switchs.expression = create_implicit_cast(expr, type);
9133 switch_statement_t *rem = current_switch;
9134 current_switch = &statement->switchs;
9135 statement->switchs.body = parse_inner_statement();
9136 current_switch = rem;
9138 if (statement->switchs.default_label == NULL) {
9139 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9141 check_enum_cases(&statement->switchs);
9148 static statement_t *parse_loop_body(statement_t *const loop)
9150 statement_t *const rem = current_loop;
9151 current_loop = loop;
9153 statement_t *const body = parse_inner_statement();
9160 * Parse a while statement.
9162 static statement_t *parse_while(void)
9164 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9168 PUSH_PARENT(statement);
9169 PUSH_SCOPE_STATEMENT(&statement->whiles.scope);
9171 expression_t *const cond = parse_condition();
9172 statement->whiles.condition = cond;
9173 /* §6.8.5:2 The controlling expression of an iteration statement shall
9174 * have scalar type. */
9175 semantic_condition(cond, "condition of 'while'-statement");
9177 statement->whiles.body = parse_loop_body(statement);
9185 * Parse a do statement.
9187 static statement_t *parse_do(void)
9189 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9193 PUSH_PARENT(statement);
9194 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9196 add_anchor_token(T_while);
9197 statement->do_while.body = parse_loop_body(statement);
9198 rem_anchor_token(T_while);
9201 expression_t *const cond = parse_condition();
9202 statement->do_while.condition = cond;
9203 /* §6.8.5:2 The controlling expression of an iteration statement shall
9204 * have scalar type. */
9205 semantic_condition(cond, "condition of 'do-while'-statement");
9214 * Parse a for statement.
9216 static statement_t *parse_for(void)
9218 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9222 PUSH_PARENT(statement);
9223 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9225 add_anchor_token(')');
9231 } else if (is_declaration_specifier(&token)) {
9232 parse_declaration(record_entity, DECL_FLAGS_NONE);
9234 add_anchor_token(';');
9235 expression_t *const init = parse_expression();
9236 statement->fors.initialisation = init;
9237 mark_vars_read(init, ENT_ANY);
9238 if (!expression_has_effect(init)) {
9239 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9241 rem_anchor_token(';');
9247 if (token.kind != ';') {
9248 add_anchor_token(';');
9249 expression_t *const cond = parse_expression();
9250 statement->fors.condition = cond;
9251 /* §6.8.5:2 The controlling expression of an iteration statement
9252 * shall have scalar type. */
9253 semantic_condition(cond, "condition of 'for'-statement");
9254 mark_vars_read(cond, NULL);
9255 rem_anchor_token(';');
9258 if (token.kind != ')') {
9259 expression_t *const step = parse_expression();
9260 statement->fors.step = step;
9261 mark_vars_read(step, ENT_ANY);
9262 if (!expression_has_effect(step)) {
9263 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9266 rem_anchor_token(')');
9268 statement->fors.body = parse_loop_body(statement);
9276 * Parse a goto statement.
9278 static statement_t *parse_goto(void)
9280 statement_t *statement;
9281 if (GNU_MODE && look_ahead(1)->kind == '*') {
9282 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9286 expression_t *expression = parse_expression();
9287 mark_vars_read(expression, NULL);
9289 /* Argh: although documentation says the expression must be of type void*,
9290 * gcc accepts anything that can be casted into void* without error */
9291 type_t *type = expression->base.type;
9293 if (type != type_error_type) {
9294 if (!is_type_pointer(type) && !is_type_integer(type)) {
9295 errorf(&expression->base.source_position,
9296 "cannot convert to a pointer type");
9297 } else if (type != type_void_ptr) {
9298 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9300 expression = create_implicit_cast(expression, type_void_ptr);
9303 statement->computed_goto.expression = expression;
9305 statement = allocate_statement_zero(STATEMENT_GOTO);
9308 label_t *const label = get_label("while parsing goto");
9311 statement->gotos.label = label;
9313 /* remember the goto's in a list for later checking */
9314 *goto_anchor = &statement->gotos;
9315 goto_anchor = &statement->gotos.next;
9317 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_source_position)->label;
9326 * Parse a continue statement.
9328 static statement_t *parse_continue(void)
9330 if (current_loop == NULL) {
9331 errorf(HERE, "continue statement not within loop");
9334 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9342 * Parse a break statement.
9344 static statement_t *parse_break(void)
9346 if (current_switch == NULL && current_loop == NULL) {
9347 errorf(HERE, "break statement not within loop or switch");
9350 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9358 * Parse a __leave statement.
9360 static statement_t *parse_leave_statement(void)
9362 if (current_try == NULL) {
9363 errorf(HERE, "__leave statement not within __try");
9366 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9374 * Check if a given entity represents a local variable.
9376 static bool is_local_variable(const entity_t *entity)
9378 if (entity->kind != ENTITY_VARIABLE)
9381 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9382 case STORAGE_CLASS_AUTO:
9383 case STORAGE_CLASS_REGISTER: {
9384 const type_t *type = skip_typeref(entity->declaration.type);
9385 if (is_type_function(type)) {
9397 * Check if a given expression represents a local variable.
9399 static bool expression_is_local_variable(const expression_t *expression)
9401 if (expression->base.kind != EXPR_REFERENCE) {
9404 const entity_t *entity = expression->reference.entity;
9405 return is_local_variable(entity);
9408 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9410 if (c_mode & _CXX || strict_mode) {
9413 warningf(WARN_OTHER, pos, msg);
9418 * Parse a return statement.
9420 static statement_t *parse_return(void)
9422 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9425 expression_t *return_value = NULL;
9426 if (token.kind != ';') {
9427 return_value = parse_expression();
9428 mark_vars_read(return_value, NULL);
9431 const type_t *const func_type = skip_typeref(current_function->base.type);
9432 assert(is_type_function(func_type));
9433 type_t *const return_type = skip_typeref(func_type->function.return_type);
9435 source_position_t const *const pos = &statement->base.source_position;
9436 if (return_value != NULL) {
9437 type_t *return_value_type = skip_typeref(return_value->base.type);
9439 if (is_type_void(return_type)) {
9440 if (!is_type_void(return_value_type)) {
9441 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9442 /* Only warn in C mode, because GCC does the same */
9443 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9444 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9445 /* Only warn in C mode, because GCC does the same */
9446 err_or_warn(pos, "'return' with expression in function returning 'void'");
9449 assign_error_t error = semantic_assign(return_type, return_value);
9450 report_assign_error(error, return_type, return_value, "'return'",
9453 return_value = create_implicit_cast(return_value, return_type);
9454 /* check for returning address of a local var */
9455 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9456 const expression_t *expression = return_value->unary.value;
9457 if (expression_is_local_variable(expression)) {
9458 warningf(WARN_OTHER, pos, "function returns address of local variable");
9461 } else if (!is_type_void(return_type)) {
9462 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9463 err_or_warn(pos, "'return' without value, in function returning non-void");
9465 statement->returns.value = return_value;
9472 * Parse a declaration statement.
9474 static statement_t *parse_declaration_statement(void)
9476 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9478 entity_t *before = current_scope->last_entity;
9480 parse_external_declaration();
9482 parse_declaration(record_entity, DECL_FLAGS_NONE);
9485 declaration_statement_t *const decl = &statement->declaration;
9486 entity_t *const begin =
9487 before != NULL ? before->base.next : current_scope->entities;
9488 decl->declarations_begin = begin;
9489 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9495 * Parse an expression statement, ie. expr ';'.
9497 static statement_t *parse_expression_statement(void)
9499 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9501 expression_t *const expr = parse_expression();
9502 statement->expression.expression = expr;
9503 mark_vars_read(expr, ENT_ANY);
9510 * Parse a microsoft __try { } __finally { } or
9511 * __try{ } __except() { }
9513 static statement_t *parse_ms_try_statment(void)
9515 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9518 PUSH_PARENT(statement);
9520 ms_try_statement_t *rem = current_try;
9521 current_try = &statement->ms_try;
9522 statement->ms_try.try_statement = parse_compound_statement(false);
9527 if (next_if(T___except)) {
9528 expression_t *const expr = parse_condition();
9529 type_t * type = skip_typeref(expr->base.type);
9530 if (is_type_integer(type)) {
9531 type = promote_integer(type);
9532 } else if (is_type_valid(type)) {
9533 errorf(&expr->base.source_position,
9534 "__expect expression is not an integer, but '%T'", type);
9535 type = type_error_type;
9537 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9538 } else if (!next_if(T__finally)) {
9539 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9541 statement->ms_try.final_statement = parse_compound_statement(false);
9545 static statement_t *parse_empty_statement(void)
9547 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9548 statement_t *const statement = create_empty_statement();
9553 static statement_t *parse_local_label_declaration(void)
9555 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9559 entity_t *begin = NULL;
9560 entity_t *end = NULL;
9561 entity_t **anchor = &begin;
9562 add_anchor_token(';');
9563 add_anchor_token(',');
9565 source_position_t pos;
9566 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9568 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9569 if (entity != NULL && entity->base.parent_scope == current_scope) {
9570 source_position_t const *const ppos = &entity->base.source_position;
9571 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9573 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9574 entity->base.parent_scope = current_scope;
9577 anchor = &entity->base.next;
9580 environment_push(entity);
9583 } while (next_if(','));
9584 rem_anchor_token(',');
9585 rem_anchor_token(';');
9587 statement->declaration.declarations_begin = begin;
9588 statement->declaration.declarations_end = end;
9592 static void parse_namespace_definition(void)
9596 entity_t *entity = NULL;
9597 symbol_t *symbol = NULL;
9599 if (token.kind == T_IDENTIFIER) {
9600 symbol = token.base.symbol;
9601 entity = get_entity(symbol, NAMESPACE_NORMAL);
9602 if (entity && entity->kind != ENTITY_NAMESPACE) {
9604 if (entity->base.parent_scope == current_scope && is_entity_valid(entity)) {
9605 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9611 if (entity == NULL) {
9612 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9613 entity->base.parent_scope = current_scope;
9616 if (token.kind == '=') {
9617 /* TODO: parse namespace alias */
9618 panic("namespace alias definition not supported yet");
9621 environment_push(entity);
9622 append_entity(current_scope, entity);
9624 PUSH_SCOPE(&entity->namespacee.members);
9625 PUSH_CURRENT_ENTITY(entity);
9627 add_anchor_token('}');
9630 rem_anchor_token('}');
9633 POP_CURRENT_ENTITY();
9638 * Parse a statement.
9639 * There's also parse_statement() which additionally checks for
9640 * "statement has no effect" warnings
9642 static statement_t *intern_parse_statement(void)
9644 /* declaration or statement */
9645 statement_t *statement;
9646 switch (token.kind) {
9647 case T_IDENTIFIER: {
9648 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9649 if (la1_type == ':') {
9650 statement = parse_label_statement();
9651 } else if (is_typedef_symbol(token.base.symbol)) {
9652 statement = parse_declaration_statement();
9654 /* it's an identifier, the grammar says this must be an
9655 * expression statement. However it is common that users mistype
9656 * declaration types, so we guess a bit here to improve robustness
9657 * for incorrect programs */
9661 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9663 statement = parse_expression_statement();
9667 statement = parse_declaration_statement();
9675 case T___extension__: {
9676 /* This can be a prefix to a declaration or an expression statement.
9677 * We simply eat it now and parse the rest with tail recursion. */
9679 statement = intern_parse_statement();
9685 statement = parse_declaration_statement();
9689 statement = parse_local_label_declaration();
9692 case ';': statement = parse_empty_statement(); break;
9693 case '{': statement = parse_compound_statement(false); break;
9694 case T___leave: statement = parse_leave_statement(); break;
9695 case T___try: statement = parse_ms_try_statment(); break;
9696 case T_asm: statement = parse_asm_statement(); break;
9697 case T_break: statement = parse_break(); break;
9698 case T_case: statement = parse_case_statement(); break;
9699 case T_continue: statement = parse_continue(); break;
9700 case T_default: statement = parse_default_statement(); break;
9701 case T_do: statement = parse_do(); break;
9702 case T_for: statement = parse_for(); break;
9703 case T_goto: statement = parse_goto(); break;
9704 case T_if: statement = parse_if(); break;
9705 case T_return: statement = parse_return(); break;
9706 case T_switch: statement = parse_switch(); break;
9707 case T_while: statement = parse_while(); break;
9710 statement = parse_expression_statement();
9714 errorf(HERE, "unexpected token %K while parsing statement", &token);
9715 statement = create_error_statement();
9724 * parse a statement and emits "statement has no effect" warning if needed
9725 * (This is really a wrapper around intern_parse_statement with check for 1
9726 * single warning. It is needed, because for statement expressions we have
9727 * to avoid the warning on the last statement)
9729 static statement_t *parse_statement(void)
9731 statement_t *statement = intern_parse_statement();
9733 if (statement->kind == STATEMENT_EXPRESSION) {
9734 expression_t *expression = statement->expression.expression;
9735 if (!expression_has_effect(expression)) {
9736 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9744 * Parse a compound statement.
9746 static statement_t *parse_compound_statement(bool inside_expression_statement)
9748 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9750 PUSH_PARENT(statement);
9751 PUSH_SCOPE(&statement->compound.scope);
9754 add_anchor_token('}');
9755 /* tokens, which can start a statement */
9756 /* TODO MS, __builtin_FOO */
9757 add_anchor_token('!');
9758 add_anchor_token('&');
9759 add_anchor_token('(');
9760 add_anchor_token('*');
9761 add_anchor_token('+');
9762 add_anchor_token('-');
9763 add_anchor_token(';');
9764 add_anchor_token('{');
9765 add_anchor_token('~');
9766 add_anchor_token(T_CHARACTER_CONSTANT);
9767 add_anchor_token(T_COLONCOLON);
9768 add_anchor_token(T_FLOATINGPOINT);
9769 add_anchor_token(T_IDENTIFIER);
9770 add_anchor_token(T_INTEGER);
9771 add_anchor_token(T_MINUSMINUS);
9772 add_anchor_token(T_PLUSPLUS);
9773 add_anchor_token(T_STRING_LITERAL);
9774 add_anchor_token(T__Bool);
9775 add_anchor_token(T__Complex);
9776 add_anchor_token(T__Imaginary);
9777 add_anchor_token(T___PRETTY_FUNCTION__);
9778 add_anchor_token(T___alignof__);
9779 add_anchor_token(T___attribute__);
9780 add_anchor_token(T___builtin_va_start);
9781 add_anchor_token(T___extension__);
9782 add_anchor_token(T___func__);
9783 add_anchor_token(T___imag__);
9784 add_anchor_token(T___label__);
9785 add_anchor_token(T___real__);
9786 add_anchor_token(T___thread);
9787 add_anchor_token(T_asm);
9788 add_anchor_token(T_auto);
9789 add_anchor_token(T_bool);
9790 add_anchor_token(T_break);
9791 add_anchor_token(T_case);
9792 add_anchor_token(T_char);
9793 add_anchor_token(T_class);
9794 add_anchor_token(T_const);
9795 add_anchor_token(T_const_cast);
9796 add_anchor_token(T_continue);
9797 add_anchor_token(T_default);
9798 add_anchor_token(T_delete);
9799 add_anchor_token(T_double);
9800 add_anchor_token(T_do);
9801 add_anchor_token(T_dynamic_cast);
9802 add_anchor_token(T_enum);
9803 add_anchor_token(T_extern);
9804 add_anchor_token(T_false);
9805 add_anchor_token(T_float);
9806 add_anchor_token(T_for);
9807 add_anchor_token(T_goto);
9808 add_anchor_token(T_if);
9809 add_anchor_token(T_inline);
9810 add_anchor_token(T_int);
9811 add_anchor_token(T_long);
9812 add_anchor_token(T_new);
9813 add_anchor_token(T_operator);
9814 add_anchor_token(T_register);
9815 add_anchor_token(T_reinterpret_cast);
9816 add_anchor_token(T_restrict);
9817 add_anchor_token(T_return);
9818 add_anchor_token(T_short);
9819 add_anchor_token(T_signed);
9820 add_anchor_token(T_sizeof);
9821 add_anchor_token(T_static);
9822 add_anchor_token(T_static_cast);
9823 add_anchor_token(T_struct);
9824 add_anchor_token(T_switch);
9825 add_anchor_token(T_template);
9826 add_anchor_token(T_this);
9827 add_anchor_token(T_throw);
9828 add_anchor_token(T_true);
9829 add_anchor_token(T_try);
9830 add_anchor_token(T_typedef);
9831 add_anchor_token(T_typeid);
9832 add_anchor_token(T_typename);
9833 add_anchor_token(T_typeof);
9834 add_anchor_token(T_union);
9835 add_anchor_token(T_unsigned);
9836 add_anchor_token(T_using);
9837 add_anchor_token(T_void);
9838 add_anchor_token(T_volatile);
9839 add_anchor_token(T_wchar_t);
9840 add_anchor_token(T_while);
9842 statement_t **anchor = &statement->compound.statements;
9843 bool only_decls_so_far = true;
9844 while (token.kind != '}' && token.kind != T_EOF) {
9845 statement_t *sub_statement = intern_parse_statement();
9846 if (sub_statement->kind == STATEMENT_ERROR) {
9850 if (sub_statement->kind != STATEMENT_DECLARATION) {
9851 only_decls_so_far = false;
9852 } else if (!only_decls_so_far) {
9853 source_position_t const *const pos = &sub_statement->base.source_position;
9854 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
9857 *anchor = sub_statement;
9858 anchor = &sub_statement->base.next;
9862 /* look over all statements again to produce no effect warnings */
9863 if (is_warn_on(WARN_UNUSED_VALUE)) {
9864 statement_t *sub_statement = statement->compound.statements;
9865 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9866 if (sub_statement->kind != STATEMENT_EXPRESSION)
9868 /* don't emit a warning for the last expression in an expression
9869 * statement as it has always an effect */
9870 if (inside_expression_statement && sub_statement->base.next == NULL)
9873 expression_t *expression = sub_statement->expression.expression;
9874 if (!expression_has_effect(expression)) {
9875 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9880 rem_anchor_token(T_while);
9881 rem_anchor_token(T_wchar_t);
9882 rem_anchor_token(T_volatile);
9883 rem_anchor_token(T_void);
9884 rem_anchor_token(T_using);
9885 rem_anchor_token(T_unsigned);
9886 rem_anchor_token(T_union);
9887 rem_anchor_token(T_typeof);
9888 rem_anchor_token(T_typename);
9889 rem_anchor_token(T_typeid);
9890 rem_anchor_token(T_typedef);
9891 rem_anchor_token(T_try);
9892 rem_anchor_token(T_true);
9893 rem_anchor_token(T_throw);
9894 rem_anchor_token(T_this);
9895 rem_anchor_token(T_template);
9896 rem_anchor_token(T_switch);
9897 rem_anchor_token(T_struct);
9898 rem_anchor_token(T_static_cast);
9899 rem_anchor_token(T_static);
9900 rem_anchor_token(T_sizeof);
9901 rem_anchor_token(T_signed);
9902 rem_anchor_token(T_short);
9903 rem_anchor_token(T_return);
9904 rem_anchor_token(T_restrict);
9905 rem_anchor_token(T_reinterpret_cast);
9906 rem_anchor_token(T_register);
9907 rem_anchor_token(T_operator);
9908 rem_anchor_token(T_new);
9909 rem_anchor_token(T_long);
9910 rem_anchor_token(T_int);
9911 rem_anchor_token(T_inline);
9912 rem_anchor_token(T_if);
9913 rem_anchor_token(T_goto);
9914 rem_anchor_token(T_for);
9915 rem_anchor_token(T_float);
9916 rem_anchor_token(T_false);
9917 rem_anchor_token(T_extern);
9918 rem_anchor_token(T_enum);
9919 rem_anchor_token(T_dynamic_cast);
9920 rem_anchor_token(T_do);
9921 rem_anchor_token(T_double);
9922 rem_anchor_token(T_delete);
9923 rem_anchor_token(T_default);
9924 rem_anchor_token(T_continue);
9925 rem_anchor_token(T_const_cast);
9926 rem_anchor_token(T_const);
9927 rem_anchor_token(T_class);
9928 rem_anchor_token(T_char);
9929 rem_anchor_token(T_case);
9930 rem_anchor_token(T_break);
9931 rem_anchor_token(T_bool);
9932 rem_anchor_token(T_auto);
9933 rem_anchor_token(T_asm);
9934 rem_anchor_token(T___thread);
9935 rem_anchor_token(T___real__);
9936 rem_anchor_token(T___label__);
9937 rem_anchor_token(T___imag__);
9938 rem_anchor_token(T___func__);
9939 rem_anchor_token(T___extension__);
9940 rem_anchor_token(T___builtin_va_start);
9941 rem_anchor_token(T___attribute__);
9942 rem_anchor_token(T___alignof__);
9943 rem_anchor_token(T___PRETTY_FUNCTION__);
9944 rem_anchor_token(T__Imaginary);
9945 rem_anchor_token(T__Complex);
9946 rem_anchor_token(T__Bool);
9947 rem_anchor_token(T_STRING_LITERAL);
9948 rem_anchor_token(T_PLUSPLUS);
9949 rem_anchor_token(T_MINUSMINUS);
9950 rem_anchor_token(T_INTEGER);
9951 rem_anchor_token(T_IDENTIFIER);
9952 rem_anchor_token(T_FLOATINGPOINT);
9953 rem_anchor_token(T_COLONCOLON);
9954 rem_anchor_token(T_CHARACTER_CONSTANT);
9955 rem_anchor_token('~');
9956 rem_anchor_token('{');
9957 rem_anchor_token(';');
9958 rem_anchor_token('-');
9959 rem_anchor_token('+');
9960 rem_anchor_token('*');
9961 rem_anchor_token('(');
9962 rem_anchor_token('&');
9963 rem_anchor_token('!');
9964 rem_anchor_token('}');
9972 * Check for unused global static functions and variables
9974 static void check_unused_globals(void)
9976 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
9979 for (const entity_t *entity = file_scope->entities; entity != NULL;
9980 entity = entity->base.next) {
9981 if (!is_declaration(entity))
9984 const declaration_t *declaration = &entity->declaration;
9985 if (declaration->used ||
9986 declaration->modifiers & DM_UNUSED ||
9987 declaration->modifiers & DM_USED ||
9988 declaration->storage_class != STORAGE_CLASS_STATIC)
9993 if (entity->kind == ENTITY_FUNCTION) {
9994 /* inhibit warning for static inline functions */
9995 if (entity->function.is_inline)
9998 why = WARN_UNUSED_FUNCTION;
9999 s = entity->function.statement != NULL ? "defined" : "declared";
10001 why = WARN_UNUSED_VARIABLE;
10005 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10009 static void parse_global_asm(void)
10011 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10014 add_anchor_token(';');
10015 add_anchor_token(')');
10016 add_anchor_token(T_STRING_LITERAL);
10019 rem_anchor_token(T_STRING_LITERAL);
10020 statement->asms.asm_text = parse_string_literals("global asm");
10021 statement->base.next = unit->global_asm;
10022 unit->global_asm = statement;
10024 rem_anchor_token(')');
10026 rem_anchor_token(';');
10030 static void parse_linkage_specification(void)
10034 source_position_t const pos = *HERE;
10035 char const *const linkage = parse_string_literals(NULL).begin;
10037 linkage_kind_t old_linkage = current_linkage;
10038 linkage_kind_t new_linkage;
10039 if (streq(linkage, "C")) {
10040 new_linkage = LINKAGE_C;
10041 } else if (streq(linkage, "C++")) {
10042 new_linkage = LINKAGE_CXX;
10044 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10045 new_linkage = LINKAGE_C;
10047 current_linkage = new_linkage;
10049 if (next_if('{')) {
10056 assert(current_linkage == new_linkage);
10057 current_linkage = old_linkage;
10060 static void parse_external(void)
10062 switch (token.kind) {
10064 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10065 parse_linkage_specification();
10067 DECLARATION_START_NO_EXTERN
10069 case T___extension__:
10070 /* tokens below are for implicit int */
10071 case '&': /* & x; -> int& x; (and error later, because C++ has no
10073 case '*': /* * x; -> int* x; */
10074 case '(': /* (x); -> int (x); */
10076 parse_external_declaration();
10082 parse_global_asm();
10086 parse_namespace_definition();
10090 if (!strict_mode) {
10091 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10098 errorf(HERE, "stray %K outside of function", &token);
10099 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10100 eat_until_matching_token(token.kind);
10106 static void parse_externals(void)
10108 add_anchor_token('}');
10109 add_anchor_token(T_EOF);
10112 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10113 unsigned short token_anchor_copy[T_LAST_TOKEN];
10114 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10117 while (token.kind != T_EOF && token.kind != '}') {
10119 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10120 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10122 /* the anchor set and its copy differs */
10123 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10126 if (in_gcc_extension) {
10127 /* an gcc extension scope was not closed */
10128 internal_errorf(HERE, "Leaked __extension__");
10135 rem_anchor_token(T_EOF);
10136 rem_anchor_token('}');
10140 * Parse a translation unit.
10142 static void parse_translation_unit(void)
10144 add_anchor_token(T_EOF);
10149 if (token.kind == T_EOF)
10152 errorf(HERE, "stray %K outside of function", &token);
10153 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10154 eat_until_matching_token(token.kind);
10159 void set_default_visibility(elf_visibility_tag_t visibility)
10161 default_visibility = visibility;
10167 * @return the translation unit or NULL if errors occurred.
10169 void start_parsing(void)
10171 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10172 label_stack = NEW_ARR_F(stack_entry_t, 0);
10176 print_to_file(stderr);
10178 assert(unit == NULL);
10179 unit = allocate_ast_zero(sizeof(unit[0]));
10181 assert(file_scope == NULL);
10182 file_scope = &unit->scope;
10184 assert(current_scope == NULL);
10185 scope_push(&unit->scope);
10187 create_gnu_builtins();
10189 create_microsoft_intrinsics();
10192 translation_unit_t *finish_parsing(void)
10194 assert(current_scope == &unit->scope);
10197 assert(file_scope == &unit->scope);
10198 check_unused_globals();
10201 DEL_ARR_F(environment_stack);
10202 DEL_ARR_F(label_stack);
10204 translation_unit_t *result = unit;
10209 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10210 * are given length one. */
10211 static void complete_incomplete_arrays(void)
10213 size_t n = ARR_LEN(incomplete_arrays);
10214 for (size_t i = 0; i != n; ++i) {
10215 declaration_t *const decl = incomplete_arrays[i];
10216 type_t *const type = skip_typeref(decl->type);
10218 if (!is_type_incomplete(type))
10221 source_position_t const *const pos = &decl->base.source_position;
10222 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10224 type_t *const new_type = duplicate_type(type);
10225 new_type->array.size_constant = true;
10226 new_type->array.has_implicit_size = true;
10227 new_type->array.size = 1;
10229 type_t *const result = identify_new_type(new_type);
10231 decl->type = result;
10235 static void prepare_main_collect2(entity_t *const entity)
10237 PUSH_SCOPE(&entity->function.statement->compound.scope);
10239 // create call to __main
10240 symbol_t *symbol = symbol_table_insert("__main");
10241 entity_t *subsubmain_ent
10242 = create_implicit_function(symbol, &builtin_source_position);
10244 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10245 type_t *ftype = subsubmain_ent->declaration.type;
10246 ref->base.source_position = builtin_source_position;
10247 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10248 ref->reference.entity = subsubmain_ent;
10250 expression_t *call = allocate_expression_zero(EXPR_CALL);
10251 call->base.source_position = builtin_source_position;
10252 call->base.type = type_void;
10253 call->call.function = ref;
10255 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10256 expr_statement->base.source_position = builtin_source_position;
10257 expr_statement->expression.expression = call;
10259 statement_t *statement = entity->function.statement;
10260 assert(statement->kind == STATEMENT_COMPOUND);
10261 compound_statement_t *compounds = &statement->compound;
10263 expr_statement->base.next = compounds->statements;
10264 compounds->statements = expr_statement;
10271 lookahead_bufpos = 0;
10272 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10275 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10276 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10277 parse_translation_unit();
10278 complete_incomplete_arrays();
10279 DEL_ARR_F(incomplete_arrays);
10280 incomplete_arrays = NULL;
10284 * Initialize the parser.
10286 void init_parser(void)
10288 sym_anonymous = symbol_table_insert("<anonymous>");
10290 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10292 init_expression_parsers();
10293 obstack_init(&temp_obst);
10297 * Terminate the parser.
10299 void exit_parser(void)
10301 obstack_free(&temp_obst, NULL);