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___FUNCTION__: \
258 case T___PRETTY_FUNCTION__: \
259 case T___alignof__: \
260 case T___builtin_classify_type: \
261 case T___builtin_constant_p: \
262 case T___builtin_isgreater: \
263 case T___builtin_isgreaterequal: \
264 case T___builtin_isless: \
265 case T___builtin_islessequal: \
266 case T___builtin_islessgreater: \
267 case T___builtin_isunordered: \
268 case T___builtin_offsetof: \
269 case T___builtin_va_arg: \
270 case T___builtin_va_copy: \
271 case T___builtin_va_start: \
282 * Returns the size of a statement node.
284 * @param kind the statement kind
286 static size_t get_statement_struct_size(statement_kind_t kind)
288 static const size_t sizes[] = {
289 [STATEMENT_ERROR] = sizeof(statement_base_t),
290 [STATEMENT_EMPTY] = sizeof(statement_base_t),
291 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
292 [STATEMENT_RETURN] = sizeof(return_statement_t),
293 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
294 [STATEMENT_IF] = sizeof(if_statement_t),
295 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
296 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
297 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
298 [STATEMENT_BREAK] = sizeof(statement_base_t),
299 [STATEMENT_COMPUTED_GOTO] = sizeof(computed_goto_statement_t),
300 [STATEMENT_GOTO] = sizeof(goto_statement_t),
301 [STATEMENT_LABEL] = sizeof(label_statement_t),
302 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
303 [STATEMENT_WHILE] = sizeof(while_statement_t),
304 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
305 [STATEMENT_FOR] = sizeof(for_statement_t),
306 [STATEMENT_ASM] = sizeof(asm_statement_t),
307 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
308 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
310 assert((size_t)kind < lengthof(sizes));
311 assert(sizes[kind] != 0);
316 * Returns the size of an expression node.
318 * @param kind the expression kind
320 static size_t get_expression_struct_size(expression_kind_t kind)
322 static const size_t sizes[] = {
323 [EXPR_ERROR] = sizeof(expression_base_t),
324 [EXPR_REFERENCE] = sizeof(reference_expression_t),
325 [EXPR_ENUM_CONSTANT] = sizeof(reference_expression_t),
326 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
327 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
328 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
329 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
330 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
331 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
332 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
333 [EXPR_CALL] = sizeof(call_expression_t),
334 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
335 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
336 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
337 [EXPR_SELECT] = sizeof(select_expression_t),
338 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
339 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
340 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
341 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
342 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
343 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
344 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
345 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
346 [EXPR_VA_START] = sizeof(va_start_expression_t),
347 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
348 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
349 [EXPR_STATEMENT] = sizeof(statement_expression_t),
350 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
352 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
353 return sizes[EXPR_UNARY_FIRST];
355 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
356 return sizes[EXPR_BINARY_FIRST];
358 assert((size_t)kind < lengthof(sizes));
359 assert(sizes[kind] != 0);
364 * Allocate a statement node of given kind and initialize all
365 * fields with zero. Sets its source position to the position
366 * of the current token.
368 static statement_t *allocate_statement_zero(statement_kind_t kind)
370 size_t size = get_statement_struct_size(kind);
371 statement_t *res = allocate_ast_zero(size);
373 res->base.kind = kind;
374 res->base.parent = current_parent;
375 res->base.source_position = *HERE;
380 * Allocate an expression node of given kind and initialize all
383 * @param kind the kind of the expression to allocate
385 static expression_t *allocate_expression_zero(expression_kind_t kind)
387 size_t size = get_expression_struct_size(kind);
388 expression_t *res = allocate_ast_zero(size);
390 res->base.kind = kind;
391 res->base.type = type_error_type;
392 res->base.source_position = *HERE;
397 * Creates a new invalid expression at the source position
398 * of the current token.
400 static expression_t *create_error_expression(void)
402 expression_t *expression = allocate_expression_zero(EXPR_ERROR);
403 expression->base.type = type_error_type;
408 * Creates a new invalid statement.
410 static statement_t *create_error_statement(void)
412 return allocate_statement_zero(STATEMENT_ERROR);
416 * Allocate a new empty statement.
418 static statement_t *create_empty_statement(void)
420 return allocate_statement_zero(STATEMENT_EMPTY);
424 * Returns the size of an initializer node.
426 * @param kind the initializer kind
428 static size_t get_initializer_size(initializer_kind_t kind)
430 static const size_t sizes[] = {
431 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
432 [INITIALIZER_STRING] = sizeof(initializer_string_t),
433 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
434 [INITIALIZER_LIST] = sizeof(initializer_list_t),
435 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
437 assert((size_t)kind < lengthof(sizes));
438 assert(sizes[kind] != 0);
443 * Allocate an initializer node of given kind and initialize all
446 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
448 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
455 * Returns the index of the top element of the environment stack.
457 static size_t environment_top(void)
459 return ARR_LEN(environment_stack);
463 * Returns the index of the top element of the global label stack.
465 static size_t label_top(void)
467 return ARR_LEN(label_stack);
471 * Return the next token.
473 static inline void next_token(void)
475 token = lookahead_buffer[lookahead_bufpos];
476 lookahead_buffer[lookahead_bufpos] = lexer_token;
479 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
482 print_token(stderr, &token);
483 fprintf(stderr, "\n");
487 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
489 static inline bool next_if(token_kind_t const type)
491 if (token.kind == type) {
500 * Return the next token with a given lookahead.
502 static inline const token_t *look_ahead(size_t num)
504 assert(0 < num && num <= MAX_LOOKAHEAD);
505 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
506 return &lookahead_buffer[pos];
510 * Adds a token type to the token type anchor set (a multi-set).
512 static void add_anchor_token(token_kind_t const token_kind)
514 assert(token_kind < T_LAST_TOKEN);
515 ++token_anchor_set[token_kind];
519 * Remove a token type from the token type anchor set (a multi-set).
521 static void rem_anchor_token(token_kind_t const token_kind)
523 assert(token_kind < T_LAST_TOKEN);
524 assert(token_anchor_set[token_kind] != 0);
525 --token_anchor_set[token_kind];
529 * Eat tokens until a matching token type is found.
531 static void eat_until_matching_token(token_kind_t const type)
533 token_kind_t end_token;
535 case '(': end_token = ')'; break;
536 case '{': end_token = '}'; break;
537 case '[': end_token = ']'; break;
538 default: end_token = type; break;
541 unsigned parenthesis_count = 0;
542 unsigned brace_count = 0;
543 unsigned bracket_count = 0;
544 while (token.kind != end_token ||
545 parenthesis_count != 0 ||
547 bracket_count != 0) {
548 switch (token.kind) {
550 case '(': ++parenthesis_count; break;
551 case '{': ++brace_count; break;
552 case '[': ++bracket_count; break;
555 if (parenthesis_count > 0)
565 if (bracket_count > 0)
568 if (token.kind == end_token &&
569 parenthesis_count == 0 &&
583 * Eat input tokens until an anchor is found.
585 static void eat_until_anchor(void)
587 while (token_anchor_set[token.kind] == 0) {
588 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
589 eat_until_matching_token(token.kind);
595 * Eat a whole block from input tokens.
597 static void eat_block(void)
599 eat_until_matching_token('{');
604 * Report a parse error because an expected token was not found.
607 #if defined __GNUC__ && __GNUC__ >= 4
608 __attribute__((sentinel))
610 void parse_error_expected(const char *message, ...)
612 if (message != NULL) {
613 errorf(HERE, "%s", message);
616 va_start(ap, message);
617 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
622 * Report an incompatible type.
624 static void type_error_incompatible(const char *msg,
625 const source_position_t *source_position, type_t *type1, type_t *type2)
627 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
631 static bool skip_till(token_kind_t const expected, char const *const context)
633 if (UNLIKELY(token.kind != expected)) {
634 parse_error_expected(context, expected, NULL);
635 add_anchor_token(expected);
637 rem_anchor_token(expected);
638 if (token.kind != expected)
645 * Expect the current token is the expected token.
646 * If not, generate an error and skip until the next anchor.
648 static void expect(token_kind_t const expected)
650 if (skip_till(expected, NULL))
654 static symbol_t *expect_identifier(char const *const context, source_position_t *const pos)
656 if (!skip_till(T_IDENTIFIER, context))
658 symbol_t *const sym = token.base.symbol;
666 * Push a given scope on the scope stack and make it the
669 static scope_t *scope_push(scope_t *new_scope)
671 if (current_scope != NULL) {
672 new_scope->depth = current_scope->depth + 1;
675 scope_t *old_scope = current_scope;
676 current_scope = new_scope;
681 * Pop the current scope from the scope stack.
683 static void scope_pop(scope_t *old_scope)
685 current_scope = old_scope;
689 * Search an entity by its symbol in a given namespace.
691 static entity_t *get_entity(const symbol_t *const symbol,
692 namespace_tag_t namespc)
694 entity_t *entity = symbol->entity;
695 for (; entity != NULL; entity = entity->base.symbol_next) {
696 if ((namespace_tag_t)entity->base.namespc == namespc)
703 /* §6.2.3:1 24) There is only one name space for tags even though three are
705 static entity_t *get_tag(symbol_t const *const symbol,
706 entity_kind_tag_t const kind)
708 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
709 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
711 "'%Y' defined as wrong kind of tag (previous definition %P)",
712 symbol, &entity->base.source_position);
719 * pushs an entity on the environment stack and links the corresponding symbol
722 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
724 symbol_t *symbol = entity->base.symbol;
725 entity_namespace_t namespc = entity->base.namespc;
726 assert(namespc != 0);
728 /* replace/add entity into entity list of the symbol */
731 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
736 /* replace an entry? */
737 if (iter->base.namespc == namespc) {
738 entity->base.symbol_next = iter->base.symbol_next;
744 /* remember old declaration */
746 entry.symbol = symbol;
747 entry.old_entity = iter;
748 entry.namespc = namespc;
749 ARR_APP1(stack_entry_t, *stack_ptr, entry);
753 * Push an entity on the environment stack.
755 static void environment_push(entity_t *entity)
757 assert(entity->base.source_position.input_name != NULL);
758 assert(entity->base.parent_scope != NULL);
759 stack_push(&environment_stack, entity);
763 * Push a declaration on the global label stack.
765 * @param declaration the declaration
767 static void label_push(entity_t *label)
769 /* we abuse the parameters scope as parent for the labels */
770 label->base.parent_scope = ¤t_function->parameters;
771 stack_push(&label_stack, label);
775 * pops symbols from the environment stack until @p new_top is the top element
777 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
779 stack_entry_t *stack = *stack_ptr;
780 size_t top = ARR_LEN(stack);
783 assert(new_top <= top);
787 for (i = top; i > new_top; --i) {
788 stack_entry_t *entry = &stack[i - 1];
790 entity_t *old_entity = entry->old_entity;
791 symbol_t *symbol = entry->symbol;
792 entity_namespace_t namespc = entry->namespc;
794 /* replace with old_entity/remove */
797 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
799 assert(iter != NULL);
800 /* replace an entry? */
801 if (iter->base.namespc == namespc)
805 /* restore definition from outer scopes (if there was one) */
806 if (old_entity != NULL) {
807 old_entity->base.symbol_next = iter->base.symbol_next;
808 *anchor = old_entity;
810 /* remove entry from list */
811 *anchor = iter->base.symbol_next;
815 ARR_SHRINKLEN(*stack_ptr, new_top);
819 * Pop all entries from the environment stack until the new_top
822 * @param new_top the new stack top
824 static void environment_pop_to(size_t new_top)
826 stack_pop_to(&environment_stack, new_top);
830 * Pop all entries from the global label stack until the new_top
833 * @param new_top the new stack top
835 static void label_pop_to(size_t new_top)
837 stack_pop_to(&label_stack, new_top);
840 static atomic_type_kind_t get_akind(const type_t *type)
842 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
843 || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
844 return type->atomic.akind;
848 * §6.3.1.1:2 Do integer promotion for a given type.
850 * @param type the type to promote
851 * @return the promoted type
853 static type_t *promote_integer(type_t *type)
855 if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
862 * Check if a given expression represents a null pointer constant.
864 * @param expression the expression to check
866 static bool is_null_pointer_constant(const expression_t *expression)
868 /* skip void* cast */
869 if (expression->kind == EXPR_UNARY_CAST) {
870 type_t *const type = skip_typeref(expression->base.type);
871 if (types_compatible(type, type_void_ptr))
872 expression = expression->unary.value;
875 type_t *const type = skip_typeref(expression->base.type);
876 if (!is_type_integer(type))
878 switch (is_constant_expression(expression)) {
879 case EXPR_CLASS_ERROR: return true;
880 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
881 default: return false;
886 * Create an implicit cast expression.
888 * @param expression the expression to cast
889 * @param dest_type the destination type
891 static expression_t *create_implicit_cast(expression_t *expression,
894 type_t *const source_type = expression->base.type;
896 if (source_type == dest_type)
899 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
900 cast->unary.value = expression;
901 cast->base.type = dest_type;
902 cast->base.implicit = true;
907 typedef enum assign_error_t {
909 ASSIGN_ERROR_INCOMPATIBLE,
910 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
911 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
912 ASSIGN_WARNING_POINTER_FROM_INT,
913 ASSIGN_WARNING_INT_FROM_POINTER
916 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)
918 type_t *const orig_type_right = right->base.type;
919 type_t *const type_left = skip_typeref(orig_type_left);
920 type_t *const type_right = skip_typeref(orig_type_right);
925 case ASSIGN_ERROR_INCOMPATIBLE:
926 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
929 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
930 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
931 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
933 /* the left type has all qualifiers from the right type */
934 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
935 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);
939 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
940 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
943 case ASSIGN_WARNING_POINTER_FROM_INT:
944 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
947 case ASSIGN_WARNING_INT_FROM_POINTER:
948 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
952 panic("invalid error value");
956 /** Implements the rules from §6.5.16.1 */
957 static assign_error_t semantic_assign(type_t *orig_type_left,
958 const expression_t *const right)
960 type_t *const orig_type_right = right->base.type;
961 type_t *const type_left = skip_typeref(orig_type_left);
962 type_t *const type_right = skip_typeref(orig_type_right);
964 if (is_type_pointer(type_left)) {
965 if (is_null_pointer_constant(right)) {
966 return ASSIGN_SUCCESS;
967 } else if (is_type_pointer(type_right)) {
968 type_t *points_to_left
969 = skip_typeref(type_left->pointer.points_to);
970 type_t *points_to_right
971 = skip_typeref(type_right->pointer.points_to);
972 assign_error_t res = ASSIGN_SUCCESS;
974 /* the left type has all qualifiers from the right type */
975 unsigned missing_qualifiers
976 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
977 if (missing_qualifiers != 0) {
978 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
981 points_to_left = get_unqualified_type(points_to_left);
982 points_to_right = get_unqualified_type(points_to_right);
984 if (is_type_void(points_to_left))
987 if (is_type_void(points_to_right)) {
988 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
989 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
992 if (!types_compatible(points_to_left, points_to_right)) {
993 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
997 } else if (is_type_integer(type_right)) {
998 return ASSIGN_WARNING_POINTER_FROM_INT;
1000 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1001 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1002 && is_type_pointer(type_right))) {
1003 return ASSIGN_SUCCESS;
1004 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1005 type_t *const unqual_type_left = get_unqualified_type(type_left);
1006 type_t *const unqual_type_right = get_unqualified_type(type_right);
1007 if (types_compatible(unqual_type_left, unqual_type_right)) {
1008 return ASSIGN_SUCCESS;
1010 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1011 return ASSIGN_WARNING_INT_FROM_POINTER;
1014 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1015 return ASSIGN_SUCCESS;
1017 return ASSIGN_ERROR_INCOMPATIBLE;
1020 static expression_t *parse_constant_expression(void)
1022 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1024 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1025 errorf(&result->base.source_position,
1026 "expression '%E' is not constant", result);
1032 static expression_t *parse_assignment_expression(void)
1034 return parse_subexpression(PREC_ASSIGNMENT);
1037 static void append_string(string_t const *const s)
1039 /* FIXME Using the ast_obstack is a hack. Using the symbol_obstack is not
1040 * possible, because other tokens are grown there alongside. */
1041 obstack_grow(&ast_obstack, s->begin, s->size);
1044 static string_t finish_string(void)
1046 obstack_1grow(&ast_obstack, '\0');
1047 size_t const size = obstack_object_size(&ast_obstack) - 1;
1048 char const *const string = obstack_finish(&ast_obstack);
1049 return (string_t){ string, size };
1052 static string_t concat_string_literals(string_encoding_t *const out_enc)
1054 assert(token.kind == T_STRING_LITERAL);
1057 string_encoding_t enc = token.string.encoding;
1058 if (look_ahead(1)->kind == T_STRING_LITERAL) {
1059 append_string(&token.string.string);
1060 eat(T_STRING_LITERAL);
1061 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects string constant concatenation");
1063 if (token.string.encoding != STRING_ENCODING_CHAR) {
1064 enc = token.string.encoding;
1066 append_string(&token.string.string);
1067 eat(T_STRING_LITERAL);
1068 } while (token.kind == T_STRING_LITERAL);
1069 result = finish_string();
1071 result = token.string.string;
1072 eat(T_STRING_LITERAL);
1079 static string_t parse_string_literals(char const *const context)
1081 if (!skip_till(T_STRING_LITERAL, context))
1082 return (string_t){ "", 0 };
1084 string_encoding_t enc;
1085 source_position_t const pos = *HERE;
1086 string_t const res = concat_string_literals(&enc);
1088 if (enc != STRING_ENCODING_CHAR) {
1089 errorf(&pos, "expected plain string literal, got wide string literal");
1095 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1097 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1098 attribute->kind = kind;
1099 attribute->source_position = *HERE;
1104 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1107 * __attribute__ ( ( attribute-list ) )
1111 * attribute_list , attrib
1116 * any-word ( identifier )
1117 * any-word ( identifier , nonempty-expr-list )
1118 * any-word ( expr-list )
1120 * where the "identifier" must not be declared as a type, and
1121 * "any-word" may be any identifier (including one declared as a
1122 * type), a reserved word storage class specifier, type specifier or
1123 * type qualifier. ??? This still leaves out most reserved keywords
1124 * (following the old parser), shouldn't we include them, and why not
1125 * allow identifiers declared as types to start the arguments?
1127 * Matze: this all looks confusing and little systematic, so we're even less
1128 * strict and parse any list of things which are identifiers or
1129 * (assignment-)expressions.
1131 static attribute_argument_t *parse_attribute_arguments(void)
1133 attribute_argument_t *first = NULL;
1134 attribute_argument_t **anchor = &first;
1135 if (token.kind != ')') do {
1136 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1138 /* is it an identifier */
1139 if (token.kind == T_IDENTIFIER
1140 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1141 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1142 argument->v.symbol = token.base.symbol;
1145 /* must be an expression */
1146 expression_t *expression = parse_assignment_expression();
1148 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1149 argument->v.expression = expression;
1152 /* append argument */
1154 anchor = &argument->next;
1155 } while (next_if(','));
1160 static attribute_t *parse_attribute_asm(void)
1162 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1165 attribute->a.arguments = parse_attribute_arguments();
1169 static attribute_t *parse_attribute_gnu_single(void)
1171 /* parse "any-word" */
1172 symbol_t *const symbol = token.base.symbol;
1173 if (symbol == NULL) {
1174 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1178 attribute_kind_t kind;
1179 char const *const name = symbol->string;
1180 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1181 if (kind > ATTRIBUTE_GNU_LAST) {
1182 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1183 /* TODO: we should still save the attribute in the list... */
1184 kind = ATTRIBUTE_UNKNOWN;
1188 const char *attribute_name = get_attribute_name(kind);
1189 if (attribute_name != NULL && streq_underscore(attribute_name, name))
1193 attribute_t *attribute = allocate_attribute_zero(kind);
1196 /* parse arguments */
1198 attribute->a.arguments = parse_attribute_arguments();
1203 static attribute_t *parse_attribute_gnu(void)
1205 attribute_t *first = NULL;
1206 attribute_t **anchor = &first;
1208 eat(T___attribute__);
1209 add_anchor_token(')');
1210 add_anchor_token(',');
1214 if (token.kind != ')') do {
1215 attribute_t *attribute = parse_attribute_gnu_single();
1217 *anchor = attribute;
1218 anchor = &attribute->next;
1220 } while (next_if(','));
1221 rem_anchor_token(',');
1222 rem_anchor_token(')');
1229 /** Parse attributes. */
1230 static attribute_t *parse_attributes(attribute_t *first)
1232 attribute_t **anchor = &first;
1234 while (*anchor != NULL)
1235 anchor = &(*anchor)->next;
1237 attribute_t *attribute;
1238 switch (token.kind) {
1239 case T___attribute__:
1240 attribute = parse_attribute_gnu();
1241 if (attribute == NULL)
1246 attribute = parse_attribute_asm();
1250 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1255 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1259 case T__forceinline:
1260 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1261 eat(T__forceinline);
1265 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1270 /* TODO record modifier */
1271 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1272 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1280 *anchor = attribute;
1281 anchor = &attribute->next;
1285 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1287 static entity_t *determine_lhs_ent(expression_t *const expr,
1290 switch (expr->kind) {
1291 case EXPR_REFERENCE: {
1292 entity_t *const entity = expr->reference.entity;
1293 /* we should only find variables as lvalues... */
1294 if (entity->base.kind != ENTITY_VARIABLE
1295 && entity->base.kind != ENTITY_PARAMETER)
1301 case EXPR_ARRAY_ACCESS: {
1302 expression_t *const ref = expr->array_access.array_ref;
1303 entity_t * ent = NULL;
1304 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1305 ent = determine_lhs_ent(ref, lhs_ent);
1308 mark_vars_read(ref, lhs_ent);
1310 mark_vars_read(expr->array_access.index, lhs_ent);
1315 mark_vars_read(expr->select.compound, lhs_ent);
1316 if (is_type_compound(skip_typeref(expr->base.type)))
1317 return determine_lhs_ent(expr->select.compound, lhs_ent);
1321 case EXPR_UNARY_DEREFERENCE: {
1322 expression_t *const val = expr->unary.value;
1323 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1325 return determine_lhs_ent(val->unary.value, lhs_ent);
1327 mark_vars_read(val, NULL);
1333 mark_vars_read(expr, NULL);
1338 #define ENT_ANY ((entity_t*)-1)
1341 * Mark declarations, which are read. This is used to detect variables, which
1345 * x is not marked as "read", because it is only read to calculate its own new
1349 * x and y are not detected as "not read", because multiple variables are
1352 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1354 switch (expr->kind) {
1355 case EXPR_REFERENCE: {
1356 entity_t *const entity = expr->reference.entity;
1357 if (entity->kind != ENTITY_VARIABLE
1358 && entity->kind != ENTITY_PARAMETER)
1361 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1362 entity->variable.read = true;
1368 // TODO respect pure/const
1369 mark_vars_read(expr->call.function, NULL);
1370 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1371 mark_vars_read(arg->expression, NULL);
1375 case EXPR_CONDITIONAL:
1376 // TODO lhs_decl should depend on whether true/false have an effect
1377 mark_vars_read(expr->conditional.condition, NULL);
1378 if (expr->conditional.true_expression != NULL)
1379 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1380 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1384 if (lhs_ent == ENT_ANY
1385 && !is_type_compound(skip_typeref(expr->base.type)))
1387 mark_vars_read(expr->select.compound, lhs_ent);
1390 case EXPR_ARRAY_ACCESS: {
1391 mark_vars_read(expr->array_access.index, lhs_ent);
1392 expression_t *const ref = expr->array_access.array_ref;
1393 if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1394 if (lhs_ent == ENT_ANY)
1397 mark_vars_read(ref, lhs_ent);
1402 mark_vars_read(expr->va_arge.ap, lhs_ent);
1406 mark_vars_read(expr->va_copye.src, lhs_ent);
1409 case EXPR_UNARY_CAST:
1410 /* Special case: Use void cast to mark a variable as "read" */
1411 if (is_type_void(skip_typeref(expr->base.type)))
1416 case EXPR_UNARY_THROW:
1417 if (expr->unary.value == NULL)
1420 case EXPR_UNARY_DEREFERENCE:
1421 case EXPR_UNARY_DELETE:
1422 case EXPR_UNARY_DELETE_ARRAY:
1423 if (lhs_ent == ENT_ANY)
1427 case EXPR_UNARY_NEGATE:
1428 case EXPR_UNARY_PLUS:
1429 case EXPR_UNARY_BITWISE_NEGATE:
1430 case EXPR_UNARY_NOT:
1431 case EXPR_UNARY_TAKE_ADDRESS:
1432 case EXPR_UNARY_POSTFIX_INCREMENT:
1433 case EXPR_UNARY_POSTFIX_DECREMENT:
1434 case EXPR_UNARY_PREFIX_INCREMENT:
1435 case EXPR_UNARY_PREFIX_DECREMENT:
1436 case EXPR_UNARY_ASSUME:
1438 mark_vars_read(expr->unary.value, lhs_ent);
1441 case EXPR_BINARY_ADD:
1442 case EXPR_BINARY_SUB:
1443 case EXPR_BINARY_MUL:
1444 case EXPR_BINARY_DIV:
1445 case EXPR_BINARY_MOD:
1446 case EXPR_BINARY_EQUAL:
1447 case EXPR_BINARY_NOTEQUAL:
1448 case EXPR_BINARY_LESS:
1449 case EXPR_BINARY_LESSEQUAL:
1450 case EXPR_BINARY_GREATER:
1451 case EXPR_BINARY_GREATEREQUAL:
1452 case EXPR_BINARY_BITWISE_AND:
1453 case EXPR_BINARY_BITWISE_OR:
1454 case EXPR_BINARY_BITWISE_XOR:
1455 case EXPR_BINARY_LOGICAL_AND:
1456 case EXPR_BINARY_LOGICAL_OR:
1457 case EXPR_BINARY_SHIFTLEFT:
1458 case EXPR_BINARY_SHIFTRIGHT:
1459 case EXPR_BINARY_COMMA:
1460 case EXPR_BINARY_ISGREATER:
1461 case EXPR_BINARY_ISGREATEREQUAL:
1462 case EXPR_BINARY_ISLESS:
1463 case EXPR_BINARY_ISLESSEQUAL:
1464 case EXPR_BINARY_ISLESSGREATER:
1465 case EXPR_BINARY_ISUNORDERED:
1466 mark_vars_read(expr->binary.left, lhs_ent);
1467 mark_vars_read(expr->binary.right, lhs_ent);
1470 case EXPR_BINARY_ASSIGN:
1471 case EXPR_BINARY_MUL_ASSIGN:
1472 case EXPR_BINARY_DIV_ASSIGN:
1473 case EXPR_BINARY_MOD_ASSIGN:
1474 case EXPR_BINARY_ADD_ASSIGN:
1475 case EXPR_BINARY_SUB_ASSIGN:
1476 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1477 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1478 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1479 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1480 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1481 if (lhs_ent == ENT_ANY)
1483 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1484 mark_vars_read(expr->binary.right, lhs_ent);
1489 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1492 case EXPR_LITERAL_CASES:
1494 case EXPR_STRING_LITERAL:
1495 case EXPR_COMPOUND_LITERAL: // TODO init?
1497 case EXPR_CLASSIFY_TYPE:
1500 case EXPR_BUILTIN_CONSTANT_P:
1501 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1503 case EXPR_STATEMENT: // TODO
1504 case EXPR_LABEL_ADDRESS:
1505 case EXPR_ENUM_CONSTANT:
1509 panic("unhandled expression");
1512 static designator_t *parse_designation(void)
1514 designator_t *result = NULL;
1515 designator_t **anchor = &result;
1518 designator_t *designator;
1519 switch (token.kind) {
1521 designator = allocate_ast_zero(sizeof(designator[0]));
1522 designator->source_position = *HERE;
1524 add_anchor_token(']');
1525 designator->array_index = parse_constant_expression();
1526 rem_anchor_token(']');
1530 designator = allocate_ast_zero(sizeof(designator[0]));
1531 designator->source_position = *HERE;
1533 designator->symbol = expect_identifier("while parsing designator", NULL);
1534 if (!designator->symbol)
1542 assert(designator != NULL);
1543 *anchor = designator;
1544 anchor = &designator->next;
1548 static initializer_t *initializer_from_string(array_type_t *const type,
1549 const string_t *const string)
1551 /* TODO: check len vs. size of array type */
1554 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1555 initializer->string.string = *string;
1560 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1561 const string_t *const string)
1563 /* TODO: check len vs. size of array type */
1566 initializer_t *const initializer =
1567 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1568 initializer->wide_string.string = *string;
1574 * Build an initializer from a given expression.
1576 static initializer_t *initializer_from_expression(type_t *orig_type,
1577 expression_t *expression)
1579 /* TODO check that expression is a constant expression */
1581 /* §6.7.8.14/15 char array may be initialized by string literals */
1582 type_t *type = skip_typeref(orig_type);
1583 type_t *expr_type_orig = expression->base.type;
1584 type_t *expr_type = skip_typeref(expr_type_orig);
1586 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1587 array_type_t *const array_type = &type->array;
1588 type_t *const element_type = skip_typeref(array_type->element_type);
1590 if (element_type->kind == TYPE_ATOMIC && expression->kind == EXPR_STRING_LITERAL) {
1591 switch (expression->string_literal.encoding) {
1592 case STRING_ENCODING_CHAR: {
1593 atomic_type_kind_t const akind = element_type->atomic.akind;
1594 if (akind == ATOMIC_TYPE_CHAR
1595 || akind == ATOMIC_TYPE_SCHAR
1596 || akind == ATOMIC_TYPE_UCHAR) {
1597 return initializer_from_string(array_type,
1598 &expression->string_literal.value);
1603 case STRING_ENCODING_WIDE: {
1604 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1605 if (get_unqualified_type(element_type) == bare_wchar_type) {
1606 return initializer_from_wide_string(array_type,
1607 &expression->string_literal.value);
1615 assign_error_t error = semantic_assign(type, expression);
1616 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1618 report_assign_error(error, type, expression, "initializer",
1619 &expression->base.source_position);
1621 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1622 result->value.value = create_implicit_cast(expression, type);
1628 * Parses an scalar initializer.
1630 * §6.7.8.11; eat {} without warning
1632 static initializer_t *parse_scalar_initializer(type_t *type,
1633 bool must_be_constant)
1635 /* there might be extra {} hierarchies */
1637 if (token.kind == '{') {
1638 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1642 } while (token.kind == '{');
1645 expression_t *expression = parse_assignment_expression();
1646 mark_vars_read(expression, NULL);
1647 if (must_be_constant && !is_linker_constant(expression)) {
1648 errorf(&expression->base.source_position,
1649 "initialisation expression '%E' is not constant",
1653 initializer_t *initializer = initializer_from_expression(type, expression);
1655 if (initializer == NULL) {
1656 errorf(&expression->base.source_position,
1657 "expression '%E' (type '%T') doesn't match expected type '%T'",
1658 expression, expression->base.type, type);
1663 bool additional_warning_displayed = false;
1664 while (braces > 0) {
1666 if (token.kind != '}') {
1667 if (!additional_warning_displayed) {
1668 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1669 additional_warning_displayed = true;
1680 * An entry in the type path.
1682 typedef struct type_path_entry_t type_path_entry_t;
1683 struct type_path_entry_t {
1684 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1686 size_t index; /**< For array types: the current index. */
1687 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1692 * A type path expression a position inside compound or array types.
1694 typedef struct type_path_t type_path_t;
1695 struct type_path_t {
1696 type_path_entry_t *path; /**< An flexible array containing the current path. */
1697 type_t *top_type; /**< type of the element the path points */
1698 size_t max_index; /**< largest index in outermost array */
1702 * Prints a type path for debugging.
1704 static __attribute__((unused)) void debug_print_type_path(
1705 const type_path_t *path)
1707 size_t len = ARR_LEN(path->path);
1709 for (size_t i = 0; i < len; ++i) {
1710 const type_path_entry_t *entry = & path->path[i];
1712 type_t *type = skip_typeref(entry->type);
1713 if (is_type_compound(type)) {
1714 /* in gcc mode structs can have no members */
1715 if (entry->v.compound_entry == NULL) {
1719 fprintf(stderr, ".%s",
1720 entry->v.compound_entry->base.symbol->string);
1721 } else if (is_type_array(type)) {
1722 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1724 fprintf(stderr, "-INVALID-");
1727 if (path->top_type != NULL) {
1728 fprintf(stderr, " (");
1729 print_type(path->top_type);
1730 fprintf(stderr, ")");
1735 * Return the top type path entry, ie. in a path
1736 * (type).a.b returns the b.
1738 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1740 size_t len = ARR_LEN(path->path);
1742 return &path->path[len-1];
1746 * Enlarge the type path by an (empty) element.
1748 static type_path_entry_t *append_to_type_path(type_path_t *path)
1750 size_t len = ARR_LEN(path->path);
1751 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1753 type_path_entry_t *result = & path->path[len];
1754 memset(result, 0, sizeof(result[0]));
1759 * Descending into a sub-type. Enter the scope of the current top_type.
1761 static void descend_into_subtype(type_path_t *path)
1763 type_t *orig_top_type = path->top_type;
1764 type_t *top_type = skip_typeref(orig_top_type);
1766 type_path_entry_t *top = append_to_type_path(path);
1767 top->type = top_type;
1769 if (is_type_compound(top_type)) {
1770 compound_t *const compound = top_type->compound.compound;
1771 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
1773 if (entry != NULL) {
1774 top->v.compound_entry = &entry->declaration;
1775 path->top_type = entry->declaration.type;
1777 path->top_type = NULL;
1779 } else if (is_type_array(top_type)) {
1781 path->top_type = top_type->array.element_type;
1783 assert(!is_type_valid(top_type));
1788 * Pop an entry from the given type path, ie. returning from
1789 * (type).a.b to (type).a
1791 static void ascend_from_subtype(type_path_t *path)
1793 type_path_entry_t *top = get_type_path_top(path);
1795 path->top_type = top->type;
1797 size_t len = ARR_LEN(path->path);
1798 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1802 * Pop entries from the given type path until the given
1803 * path level is reached.
1805 static void ascend_to(type_path_t *path, size_t top_path_level)
1807 size_t len = ARR_LEN(path->path);
1809 while (len > top_path_level) {
1810 ascend_from_subtype(path);
1811 len = ARR_LEN(path->path);
1815 static bool walk_designator(type_path_t *path, const designator_t *designator,
1816 bool used_in_offsetof)
1818 for (; designator != NULL; designator = designator->next) {
1819 type_path_entry_t *top = get_type_path_top(path);
1820 type_t *orig_type = top->type;
1822 type_t *type = skip_typeref(orig_type);
1824 if (designator->symbol != NULL) {
1825 symbol_t *symbol = designator->symbol;
1826 if (!is_type_compound(type)) {
1827 if (is_type_valid(type)) {
1828 errorf(&designator->source_position,
1829 "'.%Y' designator used for non-compound type '%T'",
1833 top->type = type_error_type;
1834 top->v.compound_entry = NULL;
1835 orig_type = type_error_type;
1837 compound_t *compound = type->compound.compound;
1838 entity_t *iter = compound->members.entities;
1839 for (; iter != NULL; iter = iter->base.next) {
1840 if (iter->base.symbol == symbol) {
1845 errorf(&designator->source_position,
1846 "'%T' has no member named '%Y'", orig_type, symbol);
1849 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1850 if (used_in_offsetof && iter->compound_member.bitfield) {
1851 errorf(&designator->source_position,
1852 "offsetof designator '%Y' must not specify bitfield",
1857 top->type = orig_type;
1858 top->v.compound_entry = &iter->declaration;
1859 orig_type = iter->declaration.type;
1862 expression_t *array_index = designator->array_index;
1863 if (is_constant_expression(array_index) != EXPR_CLASS_CONSTANT)
1866 if (!is_type_array(type)) {
1867 if (is_type_valid(type)) {
1868 errorf(&designator->source_position,
1869 "[%E] designator used for non-array type '%T'",
1870 array_index, orig_type);
1875 long index = fold_constant_to_int(array_index);
1876 if (!used_in_offsetof) {
1878 errorf(&designator->source_position,
1879 "array index [%E] must be positive", array_index);
1880 } else if (type->array.size_constant) {
1881 long array_size = type->array.size;
1882 if (index >= array_size) {
1883 errorf(&designator->source_position,
1884 "designator [%E] (%d) exceeds array size %d",
1885 array_index, index, array_size);
1890 top->type = orig_type;
1891 top->v.index = (size_t) index;
1892 orig_type = type->array.element_type;
1894 path->top_type = orig_type;
1896 if (designator->next != NULL) {
1897 descend_into_subtype(path);
1903 static void advance_current_object(type_path_t *path, size_t top_path_level)
1905 type_path_entry_t *top = get_type_path_top(path);
1907 type_t *type = skip_typeref(top->type);
1908 if (is_type_union(type)) {
1909 /* in unions only the first element is initialized */
1910 top->v.compound_entry = NULL;
1911 } else if (is_type_struct(type)) {
1912 declaration_t *entry = top->v.compound_entry;
1914 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1915 if (next_entity != NULL) {
1916 assert(is_declaration(next_entity));
1917 entry = &next_entity->declaration;
1922 top->v.compound_entry = entry;
1923 if (entry != NULL) {
1924 path->top_type = entry->type;
1927 } else if (is_type_array(type)) {
1928 assert(is_type_array(type));
1932 if (!type->array.size_constant || top->v.index < type->array.size) {
1936 assert(!is_type_valid(type));
1940 /* we're past the last member of the current sub-aggregate, try if we
1941 * can ascend in the type hierarchy and continue with another subobject */
1942 size_t len = ARR_LEN(path->path);
1944 if (len > top_path_level) {
1945 ascend_from_subtype(path);
1946 advance_current_object(path, top_path_level);
1948 path->top_type = NULL;
1953 * skip any {...} blocks until a closing bracket is reached.
1955 static void skip_initializers(void)
1959 while (token.kind != '}') {
1960 if (token.kind == T_EOF)
1962 if (token.kind == '{') {
1970 static initializer_t *create_empty_initializer(void)
1972 static initializer_t empty_initializer
1973 = { .list = { { INITIALIZER_LIST }, 0 } };
1974 return &empty_initializer;
1978 * Parse a part of an initialiser for a struct or union,
1980 static initializer_t *parse_sub_initializer(type_path_t *path,
1981 type_t *outer_type, size_t top_path_level,
1982 parse_initializer_env_t *env)
1984 if (token.kind == '}') {
1985 /* empty initializer */
1986 return create_empty_initializer();
1989 type_t *orig_type = path->top_type;
1990 type_t *type = NULL;
1992 if (orig_type == NULL) {
1993 /* We are initializing an empty compound. */
1995 type = skip_typeref(orig_type);
1998 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2001 designator_t *designator = NULL;
2002 if (token.kind == '.' || token.kind == '[') {
2003 designator = parse_designation();
2004 goto finish_designator;
2005 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2006 /* GNU-style designator ("identifier: value") */
2007 designator = allocate_ast_zero(sizeof(designator[0]));
2008 designator->source_position = *HERE;
2009 designator->symbol = token.base.symbol;
2014 /* reset path to toplevel, evaluate designator from there */
2015 ascend_to(path, top_path_level);
2016 if (!walk_designator(path, designator, false)) {
2017 /* can't continue after designation error */
2021 initializer_t *designator_initializer
2022 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2023 designator_initializer->designator.designator = designator;
2024 ARR_APP1(initializer_t*, initializers, designator_initializer);
2026 orig_type = path->top_type;
2027 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2032 if (token.kind == '{') {
2033 if (type != NULL && is_type_scalar(type)) {
2034 sub = parse_scalar_initializer(type, env->must_be_constant);
2037 if (env->entity != NULL) {
2038 errorf(HERE, "extra brace group at end of initializer for '%N'", env->entity);
2040 errorf(HERE, "extra brace group at end of initializer");
2045 descend_into_subtype(path);
2048 add_anchor_token('}');
2049 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2051 rem_anchor_token('}');
2056 goto error_parse_next;
2058 ascend_from_subtype(path);
2061 /* must be an expression */
2062 expression_t *expression = parse_assignment_expression();
2063 mark_vars_read(expression, NULL);
2065 if (env->must_be_constant && !is_linker_constant(expression)) {
2066 errorf(&expression->base.source_position,
2067 "Initialisation expression '%E' is not constant",
2072 /* we are already outside, ... */
2073 if (outer_type == NULL)
2074 goto error_parse_next;
2075 type_t *const outer_type_skip = skip_typeref(outer_type);
2076 if (is_type_compound(outer_type_skip) &&
2077 !outer_type_skip->compound.compound->complete) {
2078 goto error_parse_next;
2081 source_position_t const* const pos = &expression->base.source_position;
2082 if (env->entity != NULL) {
2083 warningf(WARN_OTHER, pos, "excess elements in initializer for '%N'", env->entity);
2085 warningf(WARN_OTHER, pos, "excess elements in initializer");
2087 goto error_parse_next;
2090 /* handle { "string" } special case */
2091 if (expression->kind == EXPR_STRING_LITERAL && outer_type != NULL) {
2092 sub = initializer_from_expression(outer_type, expression);
2095 if (token.kind != '}') {
2096 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2098 /* TODO: eat , ... */
2103 /* descend into subtypes until expression matches type */
2105 orig_type = path->top_type;
2106 type = skip_typeref(orig_type);
2108 sub = initializer_from_expression(orig_type, expression);
2112 if (!is_type_valid(type)) {
2115 if (is_type_scalar(type)) {
2116 errorf(&expression->base.source_position,
2117 "expression '%E' doesn't match expected type '%T'",
2118 expression, orig_type);
2122 descend_into_subtype(path);
2126 /* update largest index of top array */
2127 const type_path_entry_t *first = &path->path[0];
2128 type_t *first_type = first->type;
2129 first_type = skip_typeref(first_type);
2130 if (is_type_array(first_type)) {
2131 size_t index = first->v.index;
2132 if (index > path->max_index)
2133 path->max_index = index;
2136 /* append to initializers list */
2137 ARR_APP1(initializer_t*, initializers, sub);
2140 if (token.kind == '}') {
2143 add_anchor_token('}');
2145 rem_anchor_token('}');
2146 if (token.kind == '}') {
2151 /* advance to the next declaration if we are not at the end */
2152 advance_current_object(path, top_path_level);
2153 orig_type = path->top_type;
2154 if (orig_type != NULL)
2155 type = skip_typeref(orig_type);
2161 size_t len = ARR_LEN(initializers);
2162 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2163 initializer_t *result = allocate_ast_zero(size);
2164 result->kind = INITIALIZER_LIST;
2165 result->list.len = len;
2166 memcpy(&result->list.initializers, initializers,
2167 len * sizeof(initializers[0]));
2169 DEL_ARR_F(initializers);
2170 ascend_to(path, top_path_level+1);
2175 skip_initializers();
2176 DEL_ARR_F(initializers);
2177 ascend_to(path, top_path_level+1);
2181 static expression_t *make_size_literal(size_t value)
2183 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2184 literal->base.type = type_size_t;
2187 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2188 literal->literal.value = make_string(buf);
2194 * Parses an initializer. Parsers either a compound literal
2195 * (env->declaration == NULL) or an initializer of a declaration.
2197 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2199 type_t *type = skip_typeref(env->type);
2200 size_t max_index = 0;
2201 initializer_t *result;
2203 if (is_type_scalar(type)) {
2204 result = parse_scalar_initializer(type, env->must_be_constant);
2205 } else if (token.kind == '{') {
2209 memset(&path, 0, sizeof(path));
2210 path.top_type = env->type;
2211 path.path = NEW_ARR_F(type_path_entry_t, 0);
2213 descend_into_subtype(&path);
2215 add_anchor_token('}');
2216 result = parse_sub_initializer(&path, env->type, 1, env);
2217 rem_anchor_token('}');
2219 max_index = path.max_index;
2220 DEL_ARR_F(path.path);
2224 /* parse_scalar_initializer() also works in this case: we simply
2225 * have an expression without {} around it */
2226 result = parse_scalar_initializer(type, env->must_be_constant);
2229 /* §6.7.8:22 array initializers for arrays with unknown size determine
2230 * the array type size */
2231 if (is_type_array(type) && type->array.size_expression == NULL
2232 && result != NULL) {
2234 switch (result->kind) {
2235 case INITIALIZER_LIST:
2236 assert(max_index != 0xdeadbeaf);
2237 size = max_index + 1;
2240 case INITIALIZER_STRING:
2241 size = result->string.string.size + 1;
2244 case INITIALIZER_WIDE_STRING:
2245 size = result->wide_string.string.size;
2248 case INITIALIZER_DESIGNATOR:
2249 case INITIALIZER_VALUE:
2250 /* can happen for parse errors */
2255 internal_errorf(HERE, "invalid initializer type");
2258 type_t *new_type = duplicate_type(type);
2260 new_type->array.size_expression = make_size_literal(size);
2261 new_type->array.size_constant = true;
2262 new_type->array.has_implicit_size = true;
2263 new_type->array.size = size;
2264 env->type = new_type;
2270 static void append_entity(scope_t *scope, entity_t *entity)
2272 if (scope->last_entity != NULL) {
2273 scope->last_entity->base.next = entity;
2275 scope->entities = entity;
2277 entity->base.parent_entity = current_entity;
2278 scope->last_entity = entity;
2282 static compound_t *parse_compound_type_specifier(bool is_struct)
2284 source_position_t const pos = *HERE;
2285 eat(is_struct ? T_struct : T_union);
2287 symbol_t *symbol = NULL;
2288 entity_t *entity = NULL;
2289 attribute_t *attributes = NULL;
2291 if (token.kind == T___attribute__) {
2292 attributes = parse_attributes(NULL);
2295 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2296 if (token.kind == T_IDENTIFIER) {
2297 /* the compound has a name, check if we have seen it already */
2298 symbol = token.base.symbol;
2299 entity = get_tag(symbol, kind);
2302 if (entity != NULL) {
2303 if (entity->base.parent_scope != current_scope &&
2304 (token.kind == '{' || token.kind == ';')) {
2305 /* we're in an inner scope and have a definition. Shadow
2306 * existing definition in outer scope */
2308 } else if (entity->compound.complete && token.kind == '{') {
2309 source_position_t const *const ppos = &entity->base.source_position;
2310 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2311 /* clear members in the hope to avoid further errors */
2312 entity->compound.members.entities = NULL;
2315 } else if (token.kind != '{') {
2316 char const *const msg =
2317 is_struct ? "while parsing struct type specifier" :
2318 "while parsing union type specifier";
2319 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2324 if (entity == NULL) {
2325 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol, &pos);
2326 entity->compound.alignment = 1;
2327 entity->base.parent_scope = current_scope;
2328 if (symbol != NULL) {
2329 environment_push(entity);
2331 append_entity(current_scope, entity);
2334 if (token.kind == '{') {
2335 parse_compound_type_entries(&entity->compound);
2337 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2338 if (symbol == NULL) {
2339 assert(anonymous_entity == NULL);
2340 anonymous_entity = entity;
2344 if (attributes != NULL) {
2345 handle_entity_attributes(attributes, entity);
2348 return &entity->compound;
2351 static void parse_enum_entries(type_t *const enum_type)
2355 if (token.kind == '}') {
2356 errorf(HERE, "empty enum not allowed");
2361 add_anchor_token('}');
2362 add_anchor_token(',');
2364 add_anchor_token('=');
2365 source_position_t pos;
2366 symbol_t *const symbol = expect_identifier("while parsing enum entry", &pos);
2367 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol, &pos);
2368 entity->enum_value.enum_type = enum_type;
2369 rem_anchor_token('=');
2372 expression_t *value = parse_constant_expression();
2374 value = create_implicit_cast(value, enum_type);
2375 entity->enum_value.value = value;
2380 record_entity(entity, false);
2381 } while (next_if(',') && token.kind != '}');
2382 rem_anchor_token(',');
2383 rem_anchor_token('}');
2388 static type_t *parse_enum_specifier(void)
2390 source_position_t const pos = *HERE;
2395 switch (token.kind) {
2397 symbol = token.base.symbol;
2398 entity = get_tag(symbol, ENTITY_ENUM);
2401 if (entity != NULL) {
2402 if (entity->base.parent_scope != current_scope &&
2403 (token.kind == '{' || token.kind == ';')) {
2404 /* we're in an inner scope and have a definition. Shadow
2405 * existing definition in outer scope */
2407 } else if (entity->enume.complete && token.kind == '{') {
2408 source_position_t const *const ppos = &entity->base.source_position;
2409 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2420 parse_error_expected("while parsing enum type specifier",
2421 T_IDENTIFIER, '{', NULL);
2425 if (entity == NULL) {
2426 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol, &pos);
2427 entity->base.parent_scope = current_scope;
2430 type_t *const type = allocate_type_zero(TYPE_ENUM);
2431 type->enumt.enume = &entity->enume;
2432 type->enumt.base.akind = ATOMIC_TYPE_INT;
2434 if (token.kind == '{') {
2435 if (symbol != NULL) {
2436 environment_push(entity);
2438 append_entity(current_scope, entity);
2439 entity->enume.complete = true;
2441 parse_enum_entries(type);
2442 parse_attributes(NULL);
2444 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2445 if (symbol == NULL) {
2446 assert(anonymous_entity == NULL);
2447 anonymous_entity = entity;
2449 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2450 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2457 * if a symbol is a typedef to another type, return true
2459 static bool is_typedef_symbol(symbol_t *symbol)
2461 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2462 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2465 static type_t *parse_typeof(void)
2471 add_anchor_token(')');
2474 expression_t *expression = NULL;
2476 switch (token.kind) {
2478 if (is_typedef_symbol(token.base.symbol)) {
2480 type = parse_typename();
2483 expression = parse_expression();
2484 type = revert_automatic_type_conversion(expression);
2489 rem_anchor_token(')');
2492 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2493 typeof_type->typeoft.expression = expression;
2494 typeof_type->typeoft.typeof_type = type;
2499 typedef enum specifiers_t {
2500 SPECIFIER_SIGNED = 1 << 0,
2501 SPECIFIER_UNSIGNED = 1 << 1,
2502 SPECIFIER_LONG = 1 << 2,
2503 SPECIFIER_INT = 1 << 3,
2504 SPECIFIER_DOUBLE = 1 << 4,
2505 SPECIFIER_CHAR = 1 << 5,
2506 SPECIFIER_WCHAR_T = 1 << 6,
2507 SPECIFIER_SHORT = 1 << 7,
2508 SPECIFIER_LONG_LONG = 1 << 8,
2509 SPECIFIER_FLOAT = 1 << 9,
2510 SPECIFIER_BOOL = 1 << 10,
2511 SPECIFIER_VOID = 1 << 11,
2512 SPECIFIER_INT8 = 1 << 12,
2513 SPECIFIER_INT16 = 1 << 13,
2514 SPECIFIER_INT32 = 1 << 14,
2515 SPECIFIER_INT64 = 1 << 15,
2516 SPECIFIER_INT128 = 1 << 16,
2517 SPECIFIER_COMPLEX = 1 << 17,
2518 SPECIFIER_IMAGINARY = 1 << 18,
2521 static type_t *get_typedef_type(symbol_t *symbol)
2523 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2524 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2527 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2528 type->typedeft.typedefe = &entity->typedefe;
2533 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2535 attribute_property_argument_t *const property = allocate_ast_zero(sizeof(*property));
2537 add_anchor_token(')');
2538 add_anchor_token(',');
2542 add_anchor_token('=');
2543 source_position_t pos;
2544 symbol_t *const prop_sym = expect_identifier("while parsing property declspec", &pos);
2545 rem_anchor_token('=');
2547 symbol_t **prop = NULL;
2549 if (streq(prop_sym->string, "put")) {
2550 prop = &property->put_symbol;
2551 } else if (streq(prop_sym->string, "get")) {
2552 prop = &property->get_symbol;
2554 errorf(&pos, "expected put or get in property declspec, but got '%Y'", prop_sym);
2558 add_anchor_token(T_IDENTIFIER);
2560 rem_anchor_token(T_IDENTIFIER);
2562 symbol_t *const sym = expect_identifier("while parsing property declspec", NULL);
2564 *prop = sym ? sym : sym_anonymous;
2565 } while (next_if(','));
2566 rem_anchor_token(',');
2567 rem_anchor_token(')');
2569 attribute->a.property = property;
2575 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2577 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2578 if (next_if(T_restrict)) {
2579 kind = ATTRIBUTE_MS_RESTRICT;
2580 } else if (token.kind == T_IDENTIFIER) {
2581 char const *const name = token.base.symbol->string;
2582 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2584 const char *attribute_name = get_attribute_name(k);
2585 if (attribute_name != NULL && streq(attribute_name, name)) {
2591 if (kind == ATTRIBUTE_UNKNOWN) {
2592 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2595 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2599 attribute_t *attribute = allocate_attribute_zero(kind);
2602 if (kind == ATTRIBUTE_MS_PROPERTY) {
2603 return parse_attribute_ms_property(attribute);
2606 /* parse arguments */
2608 attribute->a.arguments = parse_attribute_arguments();
2613 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2617 add_anchor_token(')');
2619 if (token.kind != ')') {
2620 attribute_t **anchor = &first;
2622 while (*anchor != NULL)
2623 anchor = &(*anchor)->next;
2625 attribute_t *attribute
2626 = parse_microsoft_extended_decl_modifier_single();
2627 if (attribute == NULL)
2630 *anchor = attribute;
2631 anchor = &attribute->next;
2632 } while (next_if(','));
2634 rem_anchor_token(')');
2639 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2641 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol, HERE);
2642 if (is_declaration(entity)) {
2643 entity->declaration.type = type_error_type;
2644 entity->declaration.implicit = true;
2645 } else if (kind == ENTITY_TYPEDEF) {
2646 entity->typedefe.type = type_error_type;
2647 entity->typedefe.builtin = true;
2649 if (kind != ENTITY_COMPOUND_MEMBER)
2650 record_entity(entity, false);
2654 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2656 type_t *type = NULL;
2657 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2658 unsigned type_specifiers = 0;
2659 bool newtype = false;
2660 bool saw_error = false;
2662 memset(specifiers, 0, sizeof(*specifiers));
2663 specifiers->source_position = *HERE;
2666 specifiers->attributes = parse_attributes(specifiers->attributes);
2668 switch (token.kind) {
2670 #define MATCH_STORAGE_CLASS(token, class) \
2672 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2673 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2675 specifiers->storage_class = class; \
2676 if (specifiers->thread_local) \
2677 goto check_thread_storage_class; \
2681 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2682 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2683 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2684 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2685 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2688 specifiers->attributes
2689 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2693 if (specifiers->thread_local) {
2694 errorf(HERE, "duplicate '__thread'");
2696 specifiers->thread_local = true;
2697 check_thread_storage_class:
2698 switch (specifiers->storage_class) {
2699 case STORAGE_CLASS_EXTERN:
2700 case STORAGE_CLASS_NONE:
2701 case STORAGE_CLASS_STATIC:
2705 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2706 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2707 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2708 wrong_thread_storage_class:
2709 errorf(HERE, "'__thread' used with '%s'", wrong);
2716 /* type qualifiers */
2717 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2719 qualifiers |= qualifier; \
2723 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2724 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2725 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2726 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2727 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2728 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2729 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2730 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2732 /* type specifiers */
2733 #define MATCH_SPECIFIER(token, specifier, name) \
2735 if (type_specifiers & specifier) { \
2736 errorf(HERE, "multiple " name " type specifiers given"); \
2738 type_specifiers |= specifier; \
2743 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2744 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2745 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2746 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2747 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2748 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2749 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2750 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2751 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2752 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2753 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2754 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2755 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2756 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2757 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2758 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2759 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2760 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2764 specifiers->is_inline = true;
2768 case T__forceinline:
2769 eat(T__forceinline);
2770 specifiers->modifiers |= DM_FORCEINLINE;
2775 if (type_specifiers & SPECIFIER_LONG_LONG) {
2776 errorf(HERE, "too many long type specifiers given");
2777 } else if (type_specifiers & SPECIFIER_LONG) {
2778 type_specifiers |= SPECIFIER_LONG_LONG;
2780 type_specifiers |= SPECIFIER_LONG;
2785 #define CHECK_DOUBLE_TYPE() \
2786 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2789 CHECK_DOUBLE_TYPE();
2790 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2792 type->compound.compound = parse_compound_type_specifier(true);
2795 CHECK_DOUBLE_TYPE();
2796 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2797 type->compound.compound = parse_compound_type_specifier(false);
2800 CHECK_DOUBLE_TYPE();
2801 type = parse_enum_specifier();
2804 CHECK_DOUBLE_TYPE();
2805 type = parse_typeof();
2807 case T___builtin_va_list:
2808 CHECK_DOUBLE_TYPE();
2809 type = duplicate_type(type_valist);
2810 eat(T___builtin_va_list);
2813 case T_IDENTIFIER: {
2814 /* only parse identifier if we haven't found a type yet */
2815 if (type != NULL || type_specifiers != 0) {
2816 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2817 * declaration, so it doesn't generate errors about expecting '(' or
2819 switch (look_ahead(1)->kind) {
2826 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2830 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2835 goto finish_specifiers;
2839 type_t *const typedef_type = get_typedef_type(token.base.symbol);
2840 if (typedef_type == NULL) {
2841 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2842 * declaration, so it doesn't generate 'implicit int' followed by more
2843 * errors later on. */
2844 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2850 errorf(HERE, "%K does not name a type", &token);
2852 entity_t *const entity = create_error_entity(token.base.symbol, ENTITY_TYPEDEF);
2854 type = allocate_type_zero(TYPE_TYPEDEF);
2855 type->typedeft.typedefe = &entity->typedefe;
2863 goto finish_specifiers;
2868 type = typedef_type;
2872 /* function specifier */
2874 goto finish_specifiers;
2879 specifiers->attributes = parse_attributes(specifiers->attributes);
2881 if (type == NULL || (saw_error && type_specifiers != 0)) {
2882 atomic_type_kind_t atomic_type;
2884 /* match valid basic types */
2885 switch (type_specifiers) {
2886 case SPECIFIER_VOID:
2887 atomic_type = ATOMIC_TYPE_VOID;
2889 case SPECIFIER_WCHAR_T:
2890 atomic_type = ATOMIC_TYPE_WCHAR_T;
2892 case SPECIFIER_CHAR:
2893 atomic_type = ATOMIC_TYPE_CHAR;
2895 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2896 atomic_type = ATOMIC_TYPE_SCHAR;
2898 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2899 atomic_type = ATOMIC_TYPE_UCHAR;
2901 case SPECIFIER_SHORT:
2902 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2903 case SPECIFIER_SHORT | SPECIFIER_INT:
2904 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2905 atomic_type = ATOMIC_TYPE_SHORT;
2907 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
2908 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2909 atomic_type = ATOMIC_TYPE_USHORT;
2912 case SPECIFIER_SIGNED:
2913 case SPECIFIER_SIGNED | SPECIFIER_INT:
2914 atomic_type = ATOMIC_TYPE_INT;
2916 case SPECIFIER_UNSIGNED:
2917 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
2918 atomic_type = ATOMIC_TYPE_UINT;
2920 case SPECIFIER_LONG:
2921 case SPECIFIER_SIGNED | SPECIFIER_LONG:
2922 case SPECIFIER_LONG | SPECIFIER_INT:
2923 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2924 atomic_type = ATOMIC_TYPE_LONG;
2926 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
2927 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
2928 atomic_type = ATOMIC_TYPE_ULONG;
2931 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2932 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2933 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
2934 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2936 atomic_type = ATOMIC_TYPE_LONGLONG;
2937 goto warn_about_long_long;
2939 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
2940 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
2942 atomic_type = ATOMIC_TYPE_ULONGLONG;
2943 warn_about_long_long:
2944 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
2947 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
2948 atomic_type = unsigned_int8_type_kind;
2951 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
2952 atomic_type = unsigned_int16_type_kind;
2955 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
2956 atomic_type = unsigned_int32_type_kind;
2959 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
2960 atomic_type = unsigned_int64_type_kind;
2963 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
2964 atomic_type = unsigned_int128_type_kind;
2967 case SPECIFIER_INT8:
2968 case SPECIFIER_SIGNED | SPECIFIER_INT8:
2969 atomic_type = int8_type_kind;
2972 case SPECIFIER_INT16:
2973 case SPECIFIER_SIGNED | SPECIFIER_INT16:
2974 atomic_type = int16_type_kind;
2977 case SPECIFIER_INT32:
2978 case SPECIFIER_SIGNED | SPECIFIER_INT32:
2979 atomic_type = int32_type_kind;
2982 case SPECIFIER_INT64:
2983 case SPECIFIER_SIGNED | SPECIFIER_INT64:
2984 atomic_type = int64_type_kind;
2987 case SPECIFIER_INT128:
2988 case SPECIFIER_SIGNED | SPECIFIER_INT128:
2989 atomic_type = int128_type_kind;
2992 case SPECIFIER_FLOAT:
2993 atomic_type = ATOMIC_TYPE_FLOAT;
2995 case SPECIFIER_DOUBLE:
2996 atomic_type = ATOMIC_TYPE_DOUBLE;
2998 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
2999 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3001 case SPECIFIER_BOOL:
3002 atomic_type = ATOMIC_TYPE_BOOL;
3004 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3005 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3006 atomic_type = ATOMIC_TYPE_FLOAT;
3008 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3009 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3010 atomic_type = ATOMIC_TYPE_DOUBLE;
3012 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3013 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3014 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3017 /* invalid specifier combination, give an error message */
3018 source_position_t const* const pos = &specifiers->source_position;
3019 if (type_specifiers == 0) {
3021 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3022 if (!(c_mode & _CXX) && !strict_mode) {
3023 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3024 atomic_type = ATOMIC_TYPE_INT;
3027 errorf(pos, "no type specifiers given in declaration");
3030 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3031 (type_specifiers & SPECIFIER_UNSIGNED)) {
3032 errorf(pos, "signed and unsigned specifiers given");
3033 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3034 errorf(pos, "only integer types can be signed or unsigned");
3036 errorf(pos, "multiple datatypes in declaration");
3042 if (type_specifiers & SPECIFIER_COMPLEX) {
3043 type = allocate_type_zero(TYPE_COMPLEX);
3044 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3045 type = allocate_type_zero(TYPE_IMAGINARY);
3047 type = allocate_type_zero(TYPE_ATOMIC);
3049 type->atomic.akind = atomic_type;
3051 } else if (type_specifiers != 0) {
3052 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3055 /* FIXME: check type qualifiers here */
3056 type->base.qualifiers = qualifiers;
3059 type = identify_new_type(type);
3061 type = typehash_insert(type);
3064 if (specifiers->attributes != NULL)
3065 type = handle_type_attributes(specifiers->attributes, type);
3066 specifiers->type = type;
3070 specifiers->type = type_error_type;
3073 static type_qualifiers_t parse_type_qualifiers(void)
3075 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3078 switch (token.kind) {
3079 /* type qualifiers */
3080 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3081 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3082 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3083 /* microsoft extended type modifiers */
3084 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3085 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3086 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3087 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3088 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3097 * Parses an K&R identifier list
3099 static void parse_identifier_list(scope_t *scope)
3101 assert(token.kind == T_IDENTIFIER);
3103 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.base.symbol, HERE);
3104 /* a K&R parameter has no type, yet */
3108 append_entity(scope, entity);
3109 } while (next_if(',') && token.kind == T_IDENTIFIER);
3112 static entity_t *parse_parameter(void)
3114 declaration_specifiers_t specifiers;
3115 parse_declaration_specifiers(&specifiers);
3117 entity_t *entity = parse_declarator(&specifiers,
3118 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3119 anonymous_entity = NULL;
3123 static void semantic_parameter_incomplete(const entity_t *entity)
3125 assert(entity->kind == ENTITY_PARAMETER);
3127 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3128 * list in a function declarator that is part of a
3129 * definition of that function shall not have
3130 * incomplete type. */
3131 type_t *type = skip_typeref(entity->declaration.type);
3132 if (is_type_incomplete(type)) {
3133 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3137 static bool has_parameters(void)
3139 /* func(void) is not a parameter */
3140 if (look_ahead(1)->kind != ')')
3142 if (token.kind == T_IDENTIFIER) {
3143 entity_t const *const entity = get_entity(token.base.symbol, NAMESPACE_NORMAL);
3146 if (entity->kind != ENTITY_TYPEDEF)
3148 type_t const *const type = skip_typeref(entity->typedefe.type);
3149 if (!is_type_void(type))
3151 if (c_mode & _CXX) {
3152 /* ISO/IEC 14882:1998(E) §8.3.5:2 It must be literally (void). A typedef
3153 * is not allowed. */
3154 errorf(HERE, "empty parameter list defined with a typedef of 'void' not allowed in C++");
3155 } else if (type->base.qualifiers != TYPE_QUALIFIER_NONE) {
3156 /* §6.7.5.3:10 Qualification is not allowed here. */
3157 errorf(HERE, "'void' as parameter must not have type qualifiers");
3159 } else if (token.kind != T_void) {
3167 * Parses function type parameters (and optionally creates variable_t entities
3168 * for them in a scope)
3170 static void parse_parameters(function_type_t *type, scope_t *scope)
3172 add_anchor_token(')');
3175 if (token.kind == T_IDENTIFIER &&
3176 !is_typedef_symbol(token.base.symbol) &&
3177 (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
3178 type->kr_style_parameters = true;
3179 parse_identifier_list(scope);
3180 } else if (token.kind == ')') {
3181 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3182 if (!(c_mode & _CXX))
3183 type->unspecified_parameters = true;
3184 } else if (has_parameters()) {
3185 function_parameter_t **anchor = &type->parameters;
3186 add_anchor_token(',');
3188 switch (token.kind) {
3191 type->variadic = true;
3192 goto parameters_finished;
3197 entity_t *entity = parse_parameter();
3198 if (entity->kind == ENTITY_TYPEDEF) {
3199 errorf(&entity->base.source_position,
3200 "typedef not allowed as function parameter");
3203 assert(is_declaration(entity));
3205 semantic_parameter_incomplete(entity);
3207 function_parameter_t *const parameter =
3208 allocate_parameter(entity->declaration.type);
3210 if (scope != NULL) {
3211 append_entity(scope, entity);
3214 *anchor = parameter;
3215 anchor = ¶meter->next;
3220 goto parameters_finished;
3222 } while (next_if(','));
3223 parameters_finished:
3224 rem_anchor_token(',');
3227 rem_anchor_token(')');
3231 typedef enum construct_type_kind_t {
3232 CONSTRUCT_POINTER = 1,
3233 CONSTRUCT_REFERENCE,
3236 } construct_type_kind_t;
3238 typedef union construct_type_t construct_type_t;
3240 typedef struct construct_type_base_t {
3241 construct_type_kind_t kind;
3242 source_position_t pos;
3243 construct_type_t *next;
3244 } construct_type_base_t;
3246 typedef struct parsed_pointer_t {
3247 construct_type_base_t base;
3248 type_qualifiers_t type_qualifiers;
3249 variable_t *base_variable; /**< MS __based extension. */
3252 typedef struct parsed_reference_t {
3253 construct_type_base_t base;
3254 } parsed_reference_t;
3256 typedef struct construct_function_type_t {
3257 construct_type_base_t base;
3258 type_t *function_type;
3259 } construct_function_type_t;
3261 typedef struct parsed_array_t {
3262 construct_type_base_t base;
3263 type_qualifiers_t type_qualifiers;
3269 union construct_type_t {
3270 construct_type_kind_t kind;
3271 construct_type_base_t base;
3272 parsed_pointer_t pointer;
3273 parsed_reference_t reference;
3274 construct_function_type_t function;
3275 parsed_array_t array;
3278 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3280 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3281 memset(cons, 0, size);
3283 cons->base.pos = *HERE;
3288 static construct_type_t *parse_pointer_declarator(void)
3290 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3292 cons->pointer.type_qualifiers = parse_type_qualifiers();
3293 //cons->pointer.base_variable = base_variable;
3298 /* ISO/IEC 14882:1998(E) §8.3.2 */
3299 static construct_type_t *parse_reference_declarator(void)
3301 if (!(c_mode & _CXX))
3302 errorf(HERE, "references are only available for C++");
3304 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3311 static construct_type_t *parse_array_declarator(void)
3313 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3314 parsed_array_t *const array = &cons->array;
3317 add_anchor_token(']');
3319 bool is_static = next_if(T_static);
3321 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3324 is_static = next_if(T_static);
3326 array->type_qualifiers = type_qualifiers;
3327 array->is_static = is_static;
3329 expression_t *size = NULL;
3330 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3331 array->is_variable = true;
3333 } else if (token.kind != ']') {
3334 size = parse_assignment_expression();
3336 /* §6.7.5.2:1 Array size must have integer type */
3337 type_t *const orig_type = size->base.type;
3338 type_t *const type = skip_typeref(orig_type);
3339 if (!is_type_integer(type) && is_type_valid(type)) {
3340 errorf(&size->base.source_position,
3341 "array size '%E' must have integer type but has type '%T'",
3346 mark_vars_read(size, NULL);
3349 if (is_static && size == NULL)
3350 errorf(&array->base.pos, "static array parameters require a size");
3352 rem_anchor_token(']');
3358 static construct_type_t *parse_function_declarator(scope_t *scope)
3360 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3362 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3363 function_type_t *ftype = &type->function;
3365 ftype->linkage = current_linkage;
3366 ftype->calling_convention = CC_DEFAULT;
3368 parse_parameters(ftype, scope);
3370 cons->function.function_type = type;
3375 typedef struct parse_declarator_env_t {
3376 bool may_be_abstract : 1;
3377 bool must_be_abstract : 1;
3378 decl_modifiers_t modifiers;
3380 source_position_t source_position;
3382 attribute_t *attributes;
3383 } parse_declarator_env_t;
3386 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3388 /* construct a single linked list of construct_type_t's which describe
3389 * how to construct the final declarator type */
3390 construct_type_t *first = NULL;
3391 construct_type_t **anchor = &first;
3393 env->attributes = parse_attributes(env->attributes);
3396 construct_type_t *type;
3397 //variable_t *based = NULL; /* MS __based extension */
3398 switch (token.kind) {
3400 type = parse_reference_declarator();
3404 panic("based not supported anymore");
3409 type = parse_pointer_declarator();
3413 goto ptr_operator_end;
3417 anchor = &type->base.next;
3419 /* TODO: find out if this is correct */
3420 env->attributes = parse_attributes(env->attributes);
3424 construct_type_t *inner_types = NULL;
3426 switch (token.kind) {
3428 if (env->must_be_abstract) {
3429 errorf(HERE, "no identifier expected in typename");
3431 env->symbol = token.base.symbol;
3432 env->source_position = *HERE;
3438 /* Parenthesized declarator or function declarator? */
3439 token_t const *const la1 = look_ahead(1);
3440 switch (la1->kind) {
3442 if (is_typedef_symbol(la1->base.symbol)) {
3444 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3445 * interpreted as ``function with no parameter specification'', rather
3446 * than redundant parentheses around the omitted identifier. */
3448 /* Function declarator. */
3449 if (!env->may_be_abstract) {
3450 errorf(HERE, "function declarator must have a name");
3457 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3458 /* Paranthesized declarator. */
3460 add_anchor_token(')');
3461 inner_types = parse_inner_declarator(env);
3462 if (inner_types != NULL) {
3463 /* All later declarators only modify the return type */
3464 env->must_be_abstract = true;
3466 rem_anchor_token(')');
3475 if (env->may_be_abstract)
3477 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3482 construct_type_t **const p = anchor;
3485 construct_type_t *type;
3486 switch (token.kind) {
3488 scope_t *scope = NULL;
3489 if (!env->must_be_abstract) {
3490 scope = &env->parameters;
3493 type = parse_function_declarator(scope);
3497 type = parse_array_declarator();
3500 goto declarator_finished;
3503 /* insert in the middle of the list (at p) */
3504 type->base.next = *p;
3507 anchor = &type->base.next;
3510 declarator_finished:
3511 /* append inner_types at the end of the list, we don't to set anchor anymore
3512 * as it's not needed anymore */
3513 *anchor = inner_types;
3518 static type_t *construct_declarator_type(construct_type_t *construct_list,
3521 construct_type_t *iter = construct_list;
3522 for (; iter != NULL; iter = iter->base.next) {
3523 source_position_t const* const pos = &iter->base.pos;
3524 switch (iter->kind) {
3525 case CONSTRUCT_FUNCTION: {
3526 construct_function_type_t *function = &iter->function;
3527 type_t *function_type = function->function_type;
3529 function_type->function.return_type = type;
3531 type_t *skipped_return_type = skip_typeref(type);
3533 if (is_type_function(skipped_return_type)) {
3534 errorf(pos, "function returning function is not allowed");
3535 } else if (is_type_array(skipped_return_type)) {
3536 errorf(pos, "function returning array is not allowed");
3538 if (skipped_return_type->base.qualifiers != 0) {
3539 warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3543 /* The function type was constructed earlier. Freeing it here will
3544 * destroy other types. */
3545 type = typehash_insert(function_type);
3549 case CONSTRUCT_POINTER: {
3550 if (is_type_reference(skip_typeref(type)))
3551 errorf(pos, "cannot declare a pointer to reference");
3553 parsed_pointer_t *pointer = &iter->pointer;
3554 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3558 case CONSTRUCT_REFERENCE:
3559 if (is_type_reference(skip_typeref(type)))
3560 errorf(pos, "cannot declare a reference to reference");
3562 type = make_reference_type(type);
3565 case CONSTRUCT_ARRAY: {
3566 if (is_type_reference(skip_typeref(type)))
3567 errorf(pos, "cannot declare an array of references");
3569 parsed_array_t *array = &iter->array;
3570 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3572 expression_t *size_expression = array->size;
3573 if (size_expression != NULL) {
3575 = create_implicit_cast(size_expression, type_size_t);
3578 array_type->base.qualifiers = array->type_qualifiers;
3579 array_type->array.element_type = type;
3580 array_type->array.is_static = array->is_static;
3581 array_type->array.is_variable = array->is_variable;
3582 array_type->array.size_expression = size_expression;
3584 if (size_expression != NULL) {
3585 switch (is_constant_expression(size_expression)) {
3586 case EXPR_CLASS_CONSTANT: {
3587 long const size = fold_constant_to_int(size_expression);
3588 array_type->array.size = size;
3589 array_type->array.size_constant = true;
3590 /* §6.7.5.2:1 If the expression is a constant expression,
3591 * it shall have a value greater than zero. */
3593 errorf(&size_expression->base.source_position,
3594 "size of array must be greater than zero");
3595 } else if (size == 0 && !GNU_MODE) {
3596 errorf(&size_expression->base.source_position,
3597 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3602 case EXPR_CLASS_VARIABLE:
3603 array_type->array.is_vla = true;
3606 case EXPR_CLASS_ERROR:
3611 type_t *skipped_type = skip_typeref(type);
3613 if (is_type_incomplete(skipped_type)) {
3614 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3615 } else if (is_type_function(skipped_type)) {
3616 errorf(pos, "array of functions is not allowed");
3618 type = identify_new_type(array_type);
3622 internal_errorf(pos, "invalid type construction found");
3628 static type_t *automatic_type_conversion(type_t *orig_type);
3630 static type_t *semantic_parameter(const source_position_t *pos,
3632 const declaration_specifiers_t *specifiers,
3633 entity_t const *const param)
3635 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3636 * shall be adjusted to ``qualified pointer to type'',
3638 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3639 * type'' shall be adjusted to ``pointer to function
3640 * returning type'', as in 6.3.2.1. */
3641 type = automatic_type_conversion(type);
3643 if (specifiers->is_inline && is_type_valid(type)) {
3644 errorf(pos, "'%N' declared 'inline'", param);
3647 /* §6.9.1:6 The declarations in the declaration list shall contain
3648 * no storage-class specifier other than register and no
3649 * initializations. */
3650 if (specifiers->thread_local || (
3651 specifiers->storage_class != STORAGE_CLASS_NONE &&
3652 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3654 errorf(pos, "invalid storage class for '%N'", param);
3657 /* delay test for incomplete type, because we might have (void)
3658 * which is legal but incomplete... */
3663 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3664 declarator_flags_t flags)
3666 parse_declarator_env_t env;
3667 memset(&env, 0, sizeof(env));
3668 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3670 construct_type_t *construct_type = parse_inner_declarator(&env);
3672 construct_declarator_type(construct_type, specifiers->type);
3673 type_t *type = skip_typeref(orig_type);
3675 if (construct_type != NULL) {
3676 obstack_free(&temp_obst, construct_type);
3679 attribute_t *attributes = parse_attributes(env.attributes);
3680 /* append (shared) specifier attribute behind attributes of this
3682 attribute_t **anchor = &attributes;
3683 while (*anchor != NULL)
3684 anchor = &(*anchor)->next;
3685 *anchor = specifiers->attributes;
3688 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3689 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol, &env.source_position);
3690 entity->typedefe.type = orig_type;
3692 if (anonymous_entity != NULL) {
3693 if (is_type_compound(type)) {
3694 assert(anonymous_entity->compound.alias == NULL);
3695 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3696 anonymous_entity->kind == ENTITY_UNION);
3697 anonymous_entity->compound.alias = entity;
3698 anonymous_entity = NULL;
3699 } else if (is_type_enum(type)) {
3700 assert(anonymous_entity->enume.alias == NULL);
3701 assert(anonymous_entity->kind == ENTITY_ENUM);
3702 anonymous_entity->enume.alias = entity;
3703 anonymous_entity = NULL;
3707 /* create a declaration type entity */
3708 source_position_t const *const pos = env.symbol ? &env.source_position : &specifiers->source_position;
3709 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3710 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol, pos);
3712 if (env.symbol != NULL) {
3713 if (specifiers->is_inline && is_type_valid(type)) {
3714 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3717 if (specifiers->thread_local ||
3718 specifiers->storage_class != STORAGE_CLASS_NONE) {
3719 errorf(&env.source_position, "'%N' must have no storage class", entity);
3722 } else if (flags & DECL_IS_PARAMETER) {
3723 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol, pos);
3724 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3725 } else if (is_type_function(type)) {
3726 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol, pos);
3727 entity->function.is_inline = specifiers->is_inline;
3728 entity->function.elf_visibility = default_visibility;
3729 entity->function.parameters = env.parameters;
3731 if (env.symbol != NULL) {
3732 /* this needs fixes for C++ */
3733 bool in_function_scope = current_function != NULL;
3735 if (specifiers->thread_local || (
3736 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3737 specifiers->storage_class != STORAGE_CLASS_NONE &&
3738 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3740 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3744 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol, pos);
3745 entity->variable.elf_visibility = default_visibility;
3746 entity->variable.thread_local = specifiers->thread_local;
3748 if (env.symbol != NULL) {
3749 if (specifiers->is_inline && is_type_valid(type)) {
3750 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3753 bool invalid_storage_class = false;
3754 if (current_scope == file_scope) {
3755 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3756 specifiers->storage_class != STORAGE_CLASS_NONE &&
3757 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3758 invalid_storage_class = true;
3761 if (specifiers->thread_local &&
3762 specifiers->storage_class == STORAGE_CLASS_NONE) {
3763 invalid_storage_class = true;
3766 if (invalid_storage_class) {
3767 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3772 entity->declaration.type = orig_type;
3773 entity->declaration.alignment = get_type_alignment(orig_type);
3774 entity->declaration.modifiers = env.modifiers;
3775 entity->declaration.attributes = attributes;
3777 storage_class_t storage_class = specifiers->storage_class;
3778 entity->declaration.declared_storage_class = storage_class;
3780 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3781 storage_class = STORAGE_CLASS_AUTO;
3782 entity->declaration.storage_class = storage_class;
3785 if (attributes != NULL) {
3786 handle_entity_attributes(attributes, entity);
3789 if (entity->kind == ENTITY_FUNCTION && !freestanding) {
3790 adapt_special_functions(&entity->function);
3796 static type_t *parse_abstract_declarator(type_t *base_type)
3798 parse_declarator_env_t env;
3799 memset(&env, 0, sizeof(env));
3800 env.may_be_abstract = true;
3801 env.must_be_abstract = true;
3803 construct_type_t *construct_type = parse_inner_declarator(&env);
3805 type_t *result = construct_declarator_type(construct_type, base_type);
3806 if (construct_type != NULL) {
3807 obstack_free(&temp_obst, construct_type);
3809 result = handle_type_attributes(env.attributes, result);
3815 * Check if the declaration of main is suspicious. main should be a
3816 * function with external linkage, returning int, taking either zero
3817 * arguments, two, or three arguments of appropriate types, ie.
3819 * int main([ int argc, char **argv [, char **env ] ]).
3821 * @param decl the declaration to check
3822 * @param type the function type of the declaration
3824 static void check_main(const entity_t *entity)
3826 const source_position_t *pos = &entity->base.source_position;
3827 if (entity->kind != ENTITY_FUNCTION) {
3828 warningf(WARN_MAIN, pos, "'main' is not a function");
3832 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3833 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3836 type_t *type = skip_typeref(entity->declaration.type);
3837 assert(is_type_function(type));
3839 function_type_t const *const func_type = &type->function;
3840 type_t *const ret_type = func_type->return_type;
3841 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3842 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3844 const function_parameter_t *parm = func_type->parameters;
3846 type_t *const first_type = skip_typeref(parm->type);
3847 type_t *const first_type_unqual = get_unqualified_type(first_type);
3848 if (!types_compatible(first_type_unqual, type_int)) {
3849 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3853 type_t *const second_type = skip_typeref(parm->type);
3854 type_t *const second_type_unqual
3855 = get_unqualified_type(second_type);
3856 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3857 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3861 type_t *const third_type = skip_typeref(parm->type);
3862 type_t *const third_type_unqual
3863 = get_unqualified_type(third_type);
3864 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3865 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3869 goto warn_arg_count;
3873 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3878 static void error_redefined_as_different_kind(const source_position_t *pos,
3879 const entity_t *old, entity_kind_t new_kind)
3881 char const *const what = get_entity_kind_name(new_kind);
3882 source_position_t const *const ppos = &old->base.source_position;
3883 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3886 static bool is_entity_valid(entity_t *const ent)
3888 if (is_declaration(ent)) {
3889 return is_type_valid(skip_typeref(ent->declaration.type));
3890 } else if (ent->kind == ENTITY_TYPEDEF) {
3891 return is_type_valid(skip_typeref(ent->typedefe.type));
3896 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
3898 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
3899 if (attributes_equal(tattr, attr))
3906 * test wether new_list contains any attributes not included in old_list
3908 static bool has_new_attributes(const attribute_t *old_list,
3909 const attribute_t *new_list)
3911 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
3912 if (!contains_attribute(old_list, attr))
3919 * Merge in attributes from an attribute list (probably from a previous
3920 * declaration with the same name). Warning: destroys the old structure
3921 * of the attribute list - don't reuse attributes after this call.
3923 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
3926 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
3928 if (contains_attribute(decl->attributes, attr))
3931 /* move attribute to new declarations attributes list */
3932 attr->next = decl->attributes;
3933 decl->attributes = attr;
3937 static bool is_main(entity_t*);
3940 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
3941 * for various problems that occur for multiple definitions
3943 entity_t *record_entity(entity_t *entity, const bool is_definition)
3945 const symbol_t *const symbol = entity->base.symbol;
3946 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
3947 const source_position_t *pos = &entity->base.source_position;
3949 /* can happen in error cases */
3953 assert(!entity->base.parent_scope);
3954 assert(current_scope);
3955 entity->base.parent_scope = current_scope;
3957 entity_t *const previous_entity = get_entity(symbol, namespc);
3958 /* pushing the same entity twice will break the stack structure */
3959 assert(previous_entity != entity);
3961 if (entity->kind == ENTITY_FUNCTION) {
3962 type_t *const orig_type = entity->declaration.type;
3963 type_t *const type = skip_typeref(orig_type);
3965 assert(is_type_function(type));
3966 if (type->function.unspecified_parameters &&
3967 previous_entity == NULL &&
3968 !entity->declaration.implicit) {
3969 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
3972 if (is_main(entity)) {
3977 if (is_declaration(entity) &&
3978 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
3979 current_scope != file_scope &&
3980 !entity->declaration.implicit) {
3981 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
3984 if (previous_entity != NULL) {
3985 source_position_t const *const ppos = &previous_entity->base.source_position;
3987 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
3988 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
3989 assert(previous_entity->kind == ENTITY_PARAMETER);
3990 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
3994 if (previous_entity->base.parent_scope == current_scope) {
3995 if (previous_entity->kind != entity->kind) {
3996 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
3997 error_redefined_as_different_kind(pos, previous_entity,
4002 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4003 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4006 if (previous_entity->kind == ENTITY_TYPEDEF) {
4007 type_t *const type = skip_typeref(entity->typedefe.type);
4008 type_t *const prev_type
4009 = skip_typeref(previous_entity->typedefe.type);
4010 if (c_mode & _CXX) {
4011 /* C++ allows double typedef if they are identical
4012 * (after skipping typedefs) */
4013 if (type == prev_type)
4016 /* GCC extension: redef in system headers is allowed */
4017 if ((pos->is_system_header || ppos->is_system_header) &&
4018 types_compatible(type, prev_type))
4021 errorf(pos, "redefinition of '%N' (declared %P)",
4026 /* at this point we should have only VARIABLES or FUNCTIONS */
4027 assert(is_declaration(previous_entity) && is_declaration(entity));
4029 declaration_t *const prev_decl = &previous_entity->declaration;
4030 declaration_t *const decl = &entity->declaration;
4032 /* can happen for K&R style declarations */
4033 if (prev_decl->type == NULL &&
4034 previous_entity->kind == ENTITY_PARAMETER &&
4035 entity->kind == ENTITY_PARAMETER) {
4036 prev_decl->type = decl->type;
4037 prev_decl->storage_class = decl->storage_class;
4038 prev_decl->declared_storage_class = decl->declared_storage_class;
4039 prev_decl->modifiers = decl->modifiers;
4040 return previous_entity;
4043 type_t *const type = skip_typeref(decl->type);
4044 type_t *const prev_type = skip_typeref(prev_decl->type);
4046 if (!types_compatible(type, prev_type)) {
4047 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4049 unsigned old_storage_class = prev_decl->storage_class;
4051 if (is_definition &&
4053 !(prev_decl->modifiers & DM_USED) &&
4054 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4055 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4058 storage_class_t new_storage_class = decl->storage_class;
4060 /* pretend no storage class means extern for function
4061 * declarations (except if the previous declaration is neither
4062 * none nor extern) */
4063 if (entity->kind == ENTITY_FUNCTION) {
4064 /* the previous declaration could have unspecified parameters or
4065 * be a typedef, so use the new type */
4066 if (prev_type->function.unspecified_parameters || is_definition)
4067 prev_decl->type = type;
4069 switch (old_storage_class) {
4070 case STORAGE_CLASS_NONE:
4071 old_storage_class = STORAGE_CLASS_EXTERN;
4074 case STORAGE_CLASS_EXTERN:
4075 if (is_definition) {
4076 if (prev_type->function.unspecified_parameters && !is_main(entity)) {
4077 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4079 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4080 new_storage_class = STORAGE_CLASS_EXTERN;
4087 } else if (is_type_incomplete(prev_type)) {
4088 prev_decl->type = type;
4091 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4092 new_storage_class == STORAGE_CLASS_EXTERN) {
4094 warn_redundant_declaration: ;
4096 = has_new_attributes(prev_decl->attributes,
4098 if (has_new_attrs) {
4099 merge_in_attributes(decl, prev_decl->attributes);
4100 } else if (!is_definition &&
4101 is_type_valid(prev_type) &&
4102 !pos->is_system_header) {
4103 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%N' (declared %P)", entity, ppos);
4105 } else if (current_function == NULL) {
4106 if (old_storage_class != STORAGE_CLASS_STATIC &&
4107 new_storage_class == STORAGE_CLASS_STATIC) {
4108 errorf(pos, "static declaration of '%N' follows non-static declaration (declared %P)", entity, ppos);
4109 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4110 prev_decl->storage_class = STORAGE_CLASS_NONE;
4111 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4113 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4115 goto error_redeclaration;
4116 goto warn_redundant_declaration;
4118 } else if (is_type_valid(prev_type)) {
4119 if (old_storage_class == new_storage_class) {
4120 error_redeclaration:
4121 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4123 errorf(pos, "redeclaration of '%N' with different linkage (declared %P)", entity, ppos);
4128 prev_decl->modifiers |= decl->modifiers;
4129 if (entity->kind == ENTITY_FUNCTION) {
4130 previous_entity->function.is_inline |= entity->function.is_inline;
4132 return previous_entity;
4136 if (is_warn_on(why = WARN_SHADOW) ||
4137 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4138 char const *const what = get_entity_kind_name(previous_entity->kind);
4139 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4143 if (entity->kind == ENTITY_FUNCTION) {
4144 if (is_definition &&
4145 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4147 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4148 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4150 goto warn_missing_declaration;
4153 } else if (entity->kind == ENTITY_VARIABLE) {
4154 if (current_scope == file_scope &&
4155 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4156 !entity->declaration.implicit) {
4157 warn_missing_declaration:
4158 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4163 environment_push(entity);
4164 append_entity(current_scope, entity);
4169 static void parser_error_multiple_definition(entity_t *entity,
4170 const source_position_t *source_position)
4172 errorf(source_position, "redefinition of '%N' (declared %P)", entity, &entity->base.source_position);
4175 static bool is_declaration_specifier(const token_t *token)
4177 switch (token->kind) {
4181 return is_typedef_symbol(token->base.symbol);
4188 static void parse_init_declarator_rest(entity_t *entity)
4190 type_t *orig_type = type_error_type;
4192 if (entity->base.kind == ENTITY_TYPEDEF) {
4193 source_position_t const *const pos = &entity->base.source_position;
4194 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4196 assert(is_declaration(entity));
4197 orig_type = entity->declaration.type;
4200 type_t *type = skip_typeref(orig_type);
4202 if (entity->kind == ENTITY_VARIABLE
4203 && entity->variable.initializer != NULL) {
4204 parser_error_multiple_definition(entity, HERE);
4208 declaration_t *const declaration = &entity->declaration;
4209 bool must_be_constant = false;
4210 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4211 entity->base.parent_scope == file_scope) {
4212 must_be_constant = true;
4215 if (is_type_function(type)) {
4216 source_position_t const *const pos = &entity->base.source_position;
4217 errorf(pos, "'%N' is initialized like a variable", entity);
4218 orig_type = type_error_type;
4221 parse_initializer_env_t env;
4222 env.type = orig_type;
4223 env.must_be_constant = must_be_constant;
4224 env.entity = entity;
4226 initializer_t *initializer = parse_initializer(&env);
4228 if (entity->kind == ENTITY_VARIABLE) {
4229 /* §6.7.5:22 array initializers for arrays with unknown size
4230 * determine the array type size */
4231 declaration->type = env.type;
4232 entity->variable.initializer = initializer;
4236 /* parse rest of a declaration without any declarator */
4237 static void parse_anonymous_declaration_rest(
4238 const declaration_specifiers_t *specifiers)
4241 anonymous_entity = NULL;
4243 source_position_t const *const pos = &specifiers->source_position;
4244 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4245 specifiers->thread_local) {
4246 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4249 type_t *type = specifiers->type;
4250 switch (type->kind) {
4251 case TYPE_COMPOUND_STRUCT:
4252 case TYPE_COMPOUND_UNION: {
4253 if (type->compound.compound->base.symbol == NULL) {
4254 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4263 warningf(WARN_OTHER, pos, "empty declaration");
4268 static void check_variable_type_complete(entity_t *ent)
4270 if (ent->kind != ENTITY_VARIABLE)
4273 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4274 * type for the object shall be complete [...] */
4275 declaration_t *decl = &ent->declaration;
4276 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4277 decl->storage_class == STORAGE_CLASS_STATIC)
4280 type_t *const type = skip_typeref(decl->type);
4281 if (!is_type_incomplete(type))
4284 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4285 * are given length one. */
4286 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4287 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4291 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4295 static void parse_declaration_rest(entity_t *ndeclaration,
4296 const declaration_specifiers_t *specifiers,
4297 parsed_declaration_func finished_declaration,
4298 declarator_flags_t flags)
4300 add_anchor_token(';');
4301 add_anchor_token(',');
4303 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4305 if (token.kind == '=') {
4306 parse_init_declarator_rest(entity);
4307 } else if (entity->kind == ENTITY_VARIABLE) {
4308 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4309 * [...] where the extern specifier is explicitly used. */
4310 declaration_t *decl = &entity->declaration;
4311 if (decl->storage_class != STORAGE_CLASS_EXTERN &&
4312 is_type_reference(skip_typeref(decl->type))) {
4313 source_position_t const *const pos = &entity->base.source_position;
4314 errorf(pos, "reference '%#N' must be initialized", entity);
4318 check_variable_type_complete(entity);
4323 add_anchor_token('=');
4324 ndeclaration = parse_declarator(specifiers, flags);
4325 rem_anchor_token('=');
4327 rem_anchor_token(',');
4328 rem_anchor_token(';');
4331 anonymous_entity = NULL;
4334 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4336 symbol_t *symbol = entity->base.symbol;
4340 assert(entity->base.namespc == NAMESPACE_NORMAL);
4341 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4342 if (previous_entity == NULL
4343 || previous_entity->base.parent_scope != current_scope) {
4344 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4349 if (is_definition) {
4350 errorf(HERE, "'%N' is initialised", entity);
4353 return record_entity(entity, false);
4356 static void parse_declaration(parsed_declaration_func finished_declaration,
4357 declarator_flags_t flags)
4359 add_anchor_token(';');
4360 declaration_specifiers_t specifiers;
4361 parse_declaration_specifiers(&specifiers);
4362 rem_anchor_token(';');
4364 if (token.kind == ';') {
4365 parse_anonymous_declaration_rest(&specifiers);
4367 entity_t *entity = parse_declarator(&specifiers, flags);
4368 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4373 static type_t *get_default_promoted_type(type_t *orig_type)
4375 type_t *result = orig_type;
4377 type_t *type = skip_typeref(orig_type);
4378 if (is_type_integer(type)) {
4379 result = promote_integer(type);
4380 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4381 result = type_double;
4387 static void parse_kr_declaration_list(entity_t *entity)
4389 if (entity->kind != ENTITY_FUNCTION)
4392 type_t *type = skip_typeref(entity->declaration.type);
4393 assert(is_type_function(type));
4394 if (!type->function.kr_style_parameters)
4397 add_anchor_token('{');
4399 PUSH_SCOPE(&entity->function.parameters);
4401 entity_t *parameter = entity->function.parameters.entities;
4402 for ( ; parameter != NULL; parameter = parameter->base.next) {
4403 assert(parameter->base.parent_scope == NULL);
4404 parameter->base.parent_scope = current_scope;
4405 environment_push(parameter);
4408 /* parse declaration list */
4410 switch (token.kind) {
4412 /* This covers symbols, which are no type, too, and results in
4413 * better error messages. The typical cases are misspelled type
4414 * names and missing includes. */
4416 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4426 /* update function type */
4427 type_t *new_type = duplicate_type(type);
4429 function_parameter_t *parameters = NULL;
4430 function_parameter_t **anchor = ¶meters;
4432 /* did we have an earlier prototype? */
4433 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4434 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4437 function_parameter_t *proto_parameter = NULL;
4438 if (proto_type != NULL) {
4439 type_t *proto_type_type = proto_type->declaration.type;
4440 proto_parameter = proto_type_type->function.parameters;
4441 /* If a K&R function definition has a variadic prototype earlier, then
4442 * make the function definition variadic, too. This should conform to
4443 * §6.7.5.3:15 and §6.9.1:8. */
4444 new_type->function.variadic = proto_type_type->function.variadic;
4446 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4448 new_type->function.unspecified_parameters = true;
4451 bool need_incompatible_warning = false;
4452 parameter = entity->function.parameters.entities;
4453 for (; parameter != NULL; parameter = parameter->base.next,
4455 proto_parameter == NULL ? NULL : proto_parameter->next) {
4456 if (parameter->kind != ENTITY_PARAMETER)
4459 type_t *parameter_type = parameter->declaration.type;
4460 if (parameter_type == NULL) {
4461 source_position_t const* const pos = ¶meter->base.source_position;
4463 errorf(pos, "no type specified for function '%N'", parameter);
4464 parameter_type = type_error_type;
4466 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4467 parameter_type = type_int;
4469 parameter->declaration.type = parameter_type;
4472 semantic_parameter_incomplete(parameter);
4474 /* we need the default promoted types for the function type */
4475 type_t *not_promoted = parameter_type;
4476 parameter_type = get_default_promoted_type(parameter_type);
4478 /* gcc special: if the type of the prototype matches the unpromoted
4479 * type don't promote */
4480 if (!strict_mode && proto_parameter != NULL) {
4481 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4482 type_t *promo_skip = skip_typeref(parameter_type);
4483 type_t *param_skip = skip_typeref(not_promoted);
4484 if (!types_compatible(proto_p_type, promo_skip)
4485 && types_compatible(proto_p_type, param_skip)) {
4487 need_incompatible_warning = true;
4488 parameter_type = not_promoted;
4491 function_parameter_t *const function_parameter
4492 = allocate_parameter(parameter_type);
4494 *anchor = function_parameter;
4495 anchor = &function_parameter->next;
4498 new_type->function.parameters = parameters;
4499 new_type = identify_new_type(new_type);
4501 if (need_incompatible_warning) {
4502 symbol_t const *const sym = entity->base.symbol;
4503 source_position_t const *const pos = &entity->base.source_position;
4504 source_position_t const *const ppos = &proto_type->base.source_position;
4505 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4507 entity->declaration.type = new_type;
4509 rem_anchor_token('{');
4512 static bool first_err = true;
4515 * When called with first_err set, prints the name of the current function,
4518 static void print_in_function(void)
4522 char const *const file = current_function->base.base.source_position.input_name;
4523 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4528 * Check if all labels are defined in the current function.
4529 * Check if all labels are used in the current function.
4531 static void check_labels(void)
4533 for (const goto_statement_t *goto_statement = goto_first;
4534 goto_statement != NULL;
4535 goto_statement = goto_statement->next) {
4536 label_t *label = goto_statement->label;
4537 if (label->base.source_position.input_name == NULL) {
4538 print_in_function();
4539 source_position_t const *const pos = &goto_statement->base.source_position;
4540 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4544 if (is_warn_on(WARN_UNUSED_LABEL)) {
4545 for (const label_statement_t *label_statement = label_first;
4546 label_statement != NULL;
4547 label_statement = label_statement->next) {
4548 label_t *label = label_statement->label;
4550 if (! label->used) {
4551 print_in_function();
4552 source_position_t const *const pos = &label_statement->base.source_position;
4553 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4559 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4561 entity_t const *const end = last != NULL ? last->base.next : NULL;
4562 for (; entity != end; entity = entity->base.next) {
4563 if (!is_declaration(entity))
4566 declaration_t *declaration = &entity->declaration;
4567 if (declaration->implicit)
4570 if (!declaration->used) {
4571 print_in_function();
4572 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4573 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4574 print_in_function();
4575 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4580 static void check_unused_variables(statement_t *const stmt, void *const env)
4584 switch (stmt->kind) {
4585 case STATEMENT_DECLARATION: {
4586 declaration_statement_t const *const decls = &stmt->declaration;
4587 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4592 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4601 * Check declarations of current_function for unused entities.
4603 static void check_declarations(void)
4605 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4606 const scope_t *scope = ¤t_function->parameters;
4607 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4609 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4610 walk_statements(current_function->statement, check_unused_variables,
4615 static int determine_truth(expression_t const* const cond)
4618 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4619 fold_constant_to_bool(cond) ? 1 :
4623 static void check_reachable(statement_t *);
4624 static bool reaches_end;
4626 static bool expression_returns(expression_t const *const expr)
4628 switch (expr->kind) {
4630 expression_t const *const func = expr->call.function;
4631 type_t const *const type = skip_typeref(func->base.type);
4632 if (type->kind == TYPE_POINTER) {
4633 type_t const *const points_to
4634 = skip_typeref(type->pointer.points_to);
4635 if (points_to->kind == TYPE_FUNCTION
4636 && points_to->function.modifiers & DM_NORETURN)
4640 if (!expression_returns(func))
4643 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4644 if (!expression_returns(arg->expression))
4651 case EXPR_REFERENCE:
4652 case EXPR_ENUM_CONSTANT:
4653 case EXPR_LITERAL_CASES:
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 *literal;
5859 switch (token.string.encoding) {
5860 case STRING_ENCODING_CHAR: {
5861 literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5862 literal->base.type = c_mode & _CXX ? type_char : type_int;
5863 literal->literal.value = token.string.string;
5865 size_t len = literal->literal.value.size;
5867 if (!GNU_MODE && !(c_mode & _C99)) {
5868 errorf(HERE, "more than 1 character in character constant");
5870 literal->base.type = type_int;
5871 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5877 case STRING_ENCODING_WIDE: {
5878 literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
5879 literal->base.type = type_int;
5880 literal->literal.value = token.string.string;
5882 size_t len = wstrlen(&literal->literal.value);
5884 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5890 eat(T_CHARACTER_CONSTANT);
5894 static entity_t *create_implicit_function(symbol_t *symbol, source_position_t const *const pos)
5896 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
5897 ntype->function.return_type = type_int;
5898 ntype->function.unspecified_parameters = true;
5899 ntype->function.linkage = LINKAGE_C;
5900 type_t *type = identify_new_type(ntype);
5902 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol, pos);
5903 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
5904 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
5905 entity->declaration.type = type;
5906 entity->declaration.implicit = true;
5908 if (current_scope != NULL)
5909 record_entity(entity, false);
5915 * Performs automatic type cast as described in §6.3.2.1.
5917 * @param orig_type the original type
5919 static type_t *automatic_type_conversion(type_t *orig_type)
5921 type_t *type = skip_typeref(orig_type);
5922 if (is_type_array(type)) {
5923 array_type_t *array_type = &type->array;
5924 type_t *element_type = array_type->element_type;
5925 unsigned qualifiers = array_type->base.qualifiers;
5927 return make_pointer_type(element_type, qualifiers);
5930 if (is_type_function(type)) {
5931 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5938 * reverts the automatic casts of array to pointer types and function
5939 * to function-pointer types as defined §6.3.2.1
5941 type_t *revert_automatic_type_conversion(const expression_t *expression)
5943 switch (expression->kind) {
5944 case EXPR_REFERENCE: {
5945 entity_t *entity = expression->reference.entity;
5946 if (is_declaration(entity)) {
5947 return entity->declaration.type;
5948 } else if (entity->kind == ENTITY_ENUM_VALUE) {
5949 return entity->enum_value.enum_type;
5951 panic("no declaration or enum in reference");
5956 entity_t *entity = expression->select.compound_entry;
5957 assert(is_declaration(entity));
5958 type_t *type = entity->declaration.type;
5959 return get_qualified_type(type, expression->base.type->base.qualifiers);
5962 case EXPR_UNARY_DEREFERENCE: {
5963 const expression_t *const value = expression->unary.value;
5964 type_t *const type = skip_typeref(value->base.type);
5965 if (!is_type_pointer(type))
5966 return type_error_type;
5967 return type->pointer.points_to;
5970 case EXPR_ARRAY_ACCESS: {
5971 const expression_t *array_ref = expression->array_access.array_ref;
5972 type_t *type_left = skip_typeref(array_ref->base.type);
5973 if (!is_type_pointer(type_left))
5974 return type_error_type;
5975 return type_left->pointer.points_to;
5978 case EXPR_STRING_LITERAL: {
5979 size_t const size = expression->string_literal.value.size + 1;
5980 type_t *const elem = get_unqualified_type(expression->base.type->pointer.points_to);
5981 return make_array_type(elem, size, TYPE_QUALIFIER_NONE);
5984 case EXPR_COMPOUND_LITERAL:
5985 return expression->compound_literal.type;
5990 return expression->base.type;
5994 * Find an entity matching a symbol in a scope.
5995 * Uses current scope if scope is NULL
5997 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
5998 namespace_tag_t namespc)
6000 if (scope == NULL) {
6001 return get_entity(symbol, namespc);
6004 /* we should optimize here, if scope grows above a certain size we should
6005 construct a hashmap here... */
6006 entity_t *entity = scope->entities;
6007 for ( ; entity != NULL; entity = entity->base.next) {
6008 if (entity->base.symbol == symbol
6009 && (namespace_tag_t)entity->base.namespc == namespc)
6016 static entity_t *parse_qualified_identifier(void)
6018 /* namespace containing the symbol */
6020 source_position_t pos;
6021 const scope_t *lookup_scope = NULL;
6023 if (next_if(T_COLONCOLON))
6024 lookup_scope = &unit->scope;
6028 symbol = expect_identifier("while parsing identifier", &pos);
6030 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6033 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6035 if (!next_if(T_COLONCOLON))
6038 switch (entity->kind) {
6039 case ENTITY_NAMESPACE:
6040 lookup_scope = &entity->namespacee.members;
6045 lookup_scope = &entity->compound.members;
6048 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6049 symbol, get_entity_kind_name(entity->kind));
6051 /* skip further qualifications */
6052 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6054 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6058 if (entity == NULL) {
6059 if (!strict_mode && token.kind == '(') {
6060 /* an implicitly declared function */
6061 entity = create_implicit_function(symbol, &pos);
6062 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of '%N'", entity);
6064 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6065 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6072 static expression_t *parse_reference(void)
6074 source_position_t const pos = *HERE;
6075 entity_t *const entity = parse_qualified_identifier();
6078 if (is_declaration(entity)) {
6079 orig_type = entity->declaration.type;
6080 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6081 orig_type = entity->enum_value.enum_type;
6083 panic("expected declaration or enum value in reference");
6086 /* we always do the auto-type conversions; the & and sizeof parser contains
6087 * code to revert this! */
6088 type_t *type = automatic_type_conversion(orig_type);
6090 expression_kind_t kind = EXPR_REFERENCE;
6091 if (entity->kind == ENTITY_ENUM_VALUE)
6092 kind = EXPR_ENUM_CONSTANT;
6094 expression_t *expression = allocate_expression_zero(kind);
6095 expression->base.source_position = pos;
6096 expression->base.type = type;
6097 expression->reference.entity = entity;
6099 /* this declaration is used */
6100 if (is_declaration(entity)) {
6101 entity->declaration.used = true;
6104 if (entity->base.parent_scope != file_scope
6105 && (current_function != NULL
6106 && entity->base.parent_scope->depth < current_function->parameters.depth)
6107 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6108 /* access of a variable from an outer function */
6109 entity->variable.address_taken = true;
6110 current_function->need_closure = true;
6113 check_deprecated(&pos, entity);
6118 static bool semantic_cast(expression_t *cast)
6120 expression_t *expression = cast->unary.value;
6121 type_t *orig_dest_type = cast->base.type;
6122 type_t *orig_type_right = expression->base.type;
6123 type_t const *dst_type = skip_typeref(orig_dest_type);
6124 type_t const *src_type = skip_typeref(orig_type_right);
6125 source_position_t const *pos = &cast->base.source_position;
6127 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6128 if (is_type_void(dst_type))
6131 /* only integer and pointer can be casted to pointer */
6132 if (is_type_pointer(dst_type) &&
6133 !is_type_pointer(src_type) &&
6134 !is_type_integer(src_type) &&
6135 is_type_valid(src_type)) {
6136 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6140 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6141 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6145 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6146 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6150 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6151 type_t *src = skip_typeref(src_type->pointer.points_to);
6152 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6153 unsigned missing_qualifiers =
6154 src->base.qualifiers & ~dst->base.qualifiers;
6155 if (missing_qualifiers != 0) {
6156 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6162 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6164 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6165 expression->base.source_position = *pos;
6167 parse_initializer_env_t env;
6170 env.must_be_constant = false;
6171 initializer_t *initializer = parse_initializer(&env);
6174 expression->compound_literal.initializer = initializer;
6175 expression->compound_literal.type = type;
6176 expression->base.type = automatic_type_conversion(type);
6182 * Parse a cast expression.
6184 static expression_t *parse_cast(void)
6186 source_position_t const pos = *HERE;
6189 add_anchor_token(')');
6191 type_t *type = parse_typename();
6193 rem_anchor_token(')');
6196 if (token.kind == '{') {
6197 return parse_compound_literal(&pos, type);
6200 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6201 cast->base.source_position = pos;
6203 expression_t *value = parse_subexpression(PREC_CAST);
6204 cast->base.type = type;
6205 cast->unary.value = value;
6207 if (! semantic_cast(cast)) {
6208 /* TODO: record the error in the AST. else it is impossible to detect it */
6215 * Parse a statement expression.
6217 static expression_t *parse_statement_expression(void)
6219 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6222 add_anchor_token(')');
6224 statement_t *statement = parse_compound_statement(true);
6225 statement->compound.stmt_expr = true;
6226 expression->statement.statement = statement;
6228 /* find last statement and use its type */
6229 type_t *type = type_void;
6230 const statement_t *stmt = statement->compound.statements;
6232 while (stmt->base.next != NULL)
6233 stmt = stmt->base.next;
6235 if (stmt->kind == STATEMENT_EXPRESSION) {
6236 type = stmt->expression.expression->base.type;
6239 source_position_t const *const pos = &expression->base.source_position;
6240 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6242 expression->base.type = type;
6244 rem_anchor_token(')');
6250 * Parse a parenthesized expression.
6252 static expression_t *parse_parenthesized_expression(void)
6254 token_t const* const la1 = look_ahead(1);
6255 switch (la1->kind) {
6257 /* gcc extension: a statement expression */
6258 return parse_statement_expression();
6261 if (is_typedef_symbol(la1->base.symbol)) {
6263 return parse_cast();
6268 add_anchor_token(')');
6269 expression_t *result = parse_expression();
6270 result->base.parenthesized = true;
6271 rem_anchor_token(')');
6277 static expression_t *parse_function_keyword(funcname_kind_t const kind)
6279 if (current_function == NULL) {
6280 errorf(HERE, "'%K' used outside of a function", &token);
6283 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6284 expression->base.type = type_char_ptr;
6285 expression->funcname.kind = kind;
6292 static designator_t *parse_designator(void)
6294 designator_t *const result = allocate_ast_zero(sizeof(result[0]));
6295 result->symbol = expect_identifier("while parsing member designator", &result->source_position);
6296 if (!result->symbol)
6299 designator_t *last_designator = result;
6302 designator_t *const designator = allocate_ast_zero(sizeof(result[0]));
6303 designator->symbol = expect_identifier("while parsing member designator", &designator->source_position);
6304 if (!designator->symbol)
6307 last_designator->next = designator;
6308 last_designator = designator;
6312 add_anchor_token(']');
6313 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6314 designator->source_position = *HERE;
6315 designator->array_index = parse_expression();
6316 rem_anchor_token(']');
6318 if (designator->array_index == NULL) {
6322 last_designator->next = designator;
6323 last_designator = designator;
6333 * Parse the __builtin_offsetof() expression.
6335 static expression_t *parse_offsetof(void)
6337 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6338 expression->base.type = type_size_t;
6340 eat(T___builtin_offsetof);
6342 add_anchor_token(')');
6343 add_anchor_token(',');
6345 type_t *type = parse_typename();
6346 rem_anchor_token(',');
6348 designator_t *designator = parse_designator();
6349 rem_anchor_token(')');
6352 expression->offsetofe.type = type;
6353 expression->offsetofe.designator = designator;
6356 memset(&path, 0, sizeof(path));
6357 path.top_type = type;
6358 path.path = NEW_ARR_F(type_path_entry_t, 0);
6360 descend_into_subtype(&path);
6362 if (!walk_designator(&path, designator, true)) {
6363 return create_error_expression();
6366 DEL_ARR_F(path.path);
6371 static bool is_last_parameter(expression_t *const param)
6373 if (param->kind == EXPR_REFERENCE) {
6374 entity_t *const entity = param->reference.entity;
6375 if (entity->kind == ENTITY_PARAMETER &&
6376 !entity->base.next &&
6377 entity->base.parent_scope == ¤t_function->parameters) {
6382 if (!is_type_valid(skip_typeref(param->base.type)))
6389 * Parses a __builtin_va_start() expression.
6391 static expression_t *parse_va_start(void)
6393 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6395 eat(T___builtin_va_start);
6397 add_anchor_token(')');
6398 add_anchor_token(',');
6400 expression->va_starte.ap = parse_assignment_expression();
6401 rem_anchor_token(',');
6403 expression_t *const param = parse_assignment_expression();
6404 expression->va_starte.parameter = param;
6405 rem_anchor_token(')');
6408 if (!current_function) {
6409 errorf(&expression->base.source_position, "'va_start' used outside of function");
6410 } else if (!current_function->base.type->function.variadic) {
6411 errorf(&expression->base.source_position, "'va_start' used in non-variadic function");
6412 } else if (!is_last_parameter(param)) {
6413 errorf(¶m->base.source_position, "second argument of 'va_start' must be last parameter of the current function");
6420 * Parses a __builtin_va_arg() expression.
6422 static expression_t *parse_va_arg(void)
6424 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6426 eat(T___builtin_va_arg);
6428 add_anchor_token(')');
6429 add_anchor_token(',');
6432 ap.expression = parse_assignment_expression();
6433 expression->va_arge.ap = ap.expression;
6434 check_call_argument(type_valist, &ap, 1);
6436 rem_anchor_token(',');
6438 expression->base.type = parse_typename();
6439 rem_anchor_token(')');
6446 * Parses a __builtin_va_copy() expression.
6448 static expression_t *parse_va_copy(void)
6450 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6452 eat(T___builtin_va_copy);
6454 add_anchor_token(')');
6455 add_anchor_token(',');
6457 expression_t *dst = parse_assignment_expression();
6458 assign_error_t error = semantic_assign(type_valist, dst);
6459 report_assign_error(error, type_valist, dst, "call argument 1",
6460 &dst->base.source_position);
6461 expression->va_copye.dst = dst;
6463 rem_anchor_token(',');
6466 call_argument_t src;
6467 src.expression = parse_assignment_expression();
6468 check_call_argument(type_valist, &src, 2);
6469 expression->va_copye.src = src.expression;
6470 rem_anchor_token(')');
6477 * Parses a __builtin_constant_p() expression.
6479 static expression_t *parse_builtin_constant(void)
6481 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6483 eat(T___builtin_constant_p);
6485 add_anchor_token(')');
6487 expression->builtin_constant.value = parse_assignment_expression();
6488 rem_anchor_token(')');
6490 expression->base.type = type_int;
6496 * Parses a __builtin_types_compatible_p() expression.
6498 static expression_t *parse_builtin_types_compatible(void)
6500 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6502 eat(T___builtin_types_compatible_p);
6504 add_anchor_token(')');
6505 add_anchor_token(',');
6507 expression->builtin_types_compatible.left = parse_typename();
6508 rem_anchor_token(',');
6510 expression->builtin_types_compatible.right = parse_typename();
6511 rem_anchor_token(')');
6513 expression->base.type = type_int;
6519 * Parses a __builtin_is_*() compare expression.
6521 static expression_t *parse_compare_builtin(void)
6523 expression_kind_t kind;
6524 switch (token.kind) {
6525 case T___builtin_isgreater: kind = EXPR_BINARY_ISGREATER; break;
6526 case T___builtin_isgreaterequal: kind = EXPR_BINARY_ISGREATEREQUAL; break;
6527 case T___builtin_isless: kind = EXPR_BINARY_ISLESS; break;
6528 case T___builtin_islessequal: kind = EXPR_BINARY_ISLESSEQUAL; break;
6529 case T___builtin_islessgreater: kind = EXPR_BINARY_ISLESSGREATER; break;
6530 case T___builtin_isunordered: kind = EXPR_BINARY_ISUNORDERED; break;
6531 default: internal_errorf(HERE, "invalid compare builtin found");
6533 expression_t *const expression = allocate_expression_zero(kind);
6536 add_anchor_token(')');
6537 add_anchor_token(',');
6539 expression->binary.left = parse_assignment_expression();
6540 rem_anchor_token(',');
6542 expression->binary.right = parse_assignment_expression();
6543 rem_anchor_token(')');
6546 type_t *const orig_type_left = expression->binary.left->base.type;
6547 type_t *const orig_type_right = expression->binary.right->base.type;
6549 type_t *const type_left = skip_typeref(orig_type_left);
6550 type_t *const type_right = skip_typeref(orig_type_right);
6551 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6552 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6553 type_error_incompatible("invalid operands in comparison",
6554 &expression->base.source_position, orig_type_left, orig_type_right);
6557 semantic_comparison(&expression->binary);
6564 * Parses a MS assume() expression.
6566 static expression_t *parse_assume(void)
6568 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6572 add_anchor_token(')');
6574 expression->unary.value = parse_assignment_expression();
6575 rem_anchor_token(')');
6578 expression->base.type = type_void;
6583 * Return the label for the current symbol or create a new one.
6585 static label_t *get_label(char const *const context)
6587 assert(current_function != NULL);
6589 symbol_t *const sym = expect_identifier(context, NULL);
6593 entity_t *label = get_entity(sym, NAMESPACE_LABEL);
6594 /* If we find a local label, we already created the declaration. */
6595 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6596 if (label->base.parent_scope != current_scope) {
6597 assert(label->base.parent_scope->depth < current_scope->depth);
6598 current_function->goto_to_outer = true;
6600 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6601 /* There is no matching label in the same function, so create a new one. */
6602 source_position_t const nowhere = { NULL, 0, 0, false };
6603 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym, &nowhere);
6607 return &label->label;
6611 * Parses a GNU && label address expression.
6613 static expression_t *parse_label_address(void)
6615 source_position_t const source_position = *HERE;
6618 label_t *const label = get_label("while parsing label address");
6620 return create_error_expression();
6623 label->address_taken = true;
6625 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6626 expression->base.source_position = source_position;
6628 /* label address is treated as a void pointer */
6629 expression->base.type = type_void_ptr;
6630 expression->label_address.label = label;
6635 * Parse a microsoft __noop expression.
6637 static expression_t *parse_noop_expression(void)
6639 /* the result is a (int)0 */
6640 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6641 literal->base.type = type_int;
6642 literal->literal.value.begin = "__noop";
6643 literal->literal.value.size = 6;
6647 if (token.kind == '(') {
6648 /* parse arguments */
6650 add_anchor_token(')');
6651 add_anchor_token(',');
6653 if (token.kind != ')') do {
6654 (void)parse_assignment_expression();
6655 } while (next_if(','));
6657 rem_anchor_token(',');
6658 rem_anchor_token(')');
6666 * Parses a primary expression.
6668 static expression_t *parse_primary_expression(void)
6670 switch (token.kind) {
6671 case T_false: return parse_boolean_literal(false);
6672 case T_true: return parse_boolean_literal(true);
6674 case T_FLOATINGPOINT: return parse_number_literal();
6675 case T_CHARACTER_CONSTANT: return parse_character_constant();
6676 case T_STRING_LITERAL: return parse_string_literal();
6677 case T___FUNCTION__:
6678 case T___func__: return parse_function_keyword(FUNCNAME_FUNCTION);
6679 case T___PRETTY_FUNCTION__: return parse_function_keyword(FUNCNAME_PRETTY_FUNCTION);
6680 case T___FUNCSIG__: return parse_function_keyword(FUNCNAME_FUNCSIG);
6681 case T___FUNCDNAME__: return parse_function_keyword(FUNCNAME_FUNCDNAME);
6682 case T___builtin_offsetof: return parse_offsetof();
6683 case T___builtin_va_start: return parse_va_start();
6684 case T___builtin_va_arg: return parse_va_arg();
6685 case T___builtin_va_copy: return parse_va_copy();
6686 case T___builtin_isgreater:
6687 case T___builtin_isgreaterequal:
6688 case T___builtin_isless:
6689 case T___builtin_islessequal:
6690 case T___builtin_islessgreater:
6691 case T___builtin_isunordered: return parse_compare_builtin();
6692 case T___builtin_constant_p: return parse_builtin_constant();
6693 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6694 case T__assume: return parse_assume();
6697 return parse_label_address();
6700 case '(': return parse_parenthesized_expression();
6701 case T___noop: return parse_noop_expression();
6703 /* Gracefully handle type names while parsing expressions. */
6705 return parse_reference();
6707 if (!is_typedef_symbol(token.base.symbol)) {
6708 return parse_reference();
6712 source_position_t const pos = *HERE;
6713 declaration_specifiers_t specifiers;
6714 parse_declaration_specifiers(&specifiers);
6715 type_t const *const type = parse_abstract_declarator(specifiers.type);
6716 errorf(&pos, "encountered type '%T' while parsing expression", type);
6717 return create_error_expression();
6721 errorf(HERE, "unexpected token %K, expected an expression", &token);
6723 return create_error_expression();
6726 static expression_t *parse_array_expression(expression_t *left)
6728 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6729 array_access_expression_t *const arr = &expr->array_access;
6732 add_anchor_token(']');
6734 expression_t *const inside = parse_expression();
6736 type_t *const orig_type_left = left->base.type;
6737 type_t *const orig_type_inside = inside->base.type;
6739 type_t *const type_left = skip_typeref(orig_type_left);
6740 type_t *const type_inside = skip_typeref(orig_type_inside);
6746 if (is_type_pointer(type_left)) {
6749 idx_type = type_inside;
6750 res_type = type_left->pointer.points_to;
6752 } else if (is_type_pointer(type_inside)) {
6753 arr->flipped = true;
6756 idx_type = type_left;
6757 res_type = type_inside->pointer.points_to;
6759 res_type = automatic_type_conversion(res_type);
6760 if (!is_type_integer(idx_type)) {
6761 errorf(&idx->base.source_position, "array subscript must have integer type");
6762 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6763 source_position_t const *const pos = &idx->base.source_position;
6764 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6767 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6768 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6770 res_type = type_error_type;
6775 arr->array_ref = ref;
6777 arr->base.type = res_type;
6779 rem_anchor_token(']');
6784 static bool is_bitfield(const expression_t *expression)
6786 return expression->kind == EXPR_SELECT
6787 && expression->select.compound_entry->compound_member.bitfield;
6790 static expression_t *parse_typeprop(expression_kind_t const kind)
6792 expression_t *tp_expression = allocate_expression_zero(kind);
6793 tp_expression->base.type = type_size_t;
6795 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
6798 expression_t *expression;
6799 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
6800 source_position_t const pos = *HERE;
6802 add_anchor_token(')');
6803 orig_type = parse_typename();
6804 rem_anchor_token(')');
6807 if (token.kind == '{') {
6808 /* It was not sizeof(type) after all. It is sizeof of an expression
6809 * starting with a compound literal */
6810 expression = parse_compound_literal(&pos, orig_type);
6811 goto typeprop_expression;
6814 expression = parse_subexpression(PREC_UNARY);
6816 typeprop_expression:
6817 if (is_bitfield(expression)) {
6818 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6819 errorf(&tp_expression->base.source_position,
6820 "operand of %s expression must not be a bitfield", what);
6823 tp_expression->typeprop.tp_expression = expression;
6825 orig_type = revert_automatic_type_conversion(expression);
6826 expression->base.type = orig_type;
6829 tp_expression->typeprop.type = orig_type;
6830 type_t const* const type = skip_typeref(orig_type);
6831 char const* wrong_type = NULL;
6832 if (is_type_incomplete(type)) {
6833 if (!is_type_void(type) || !GNU_MODE)
6834 wrong_type = "incomplete";
6835 } else if (type->kind == TYPE_FUNCTION) {
6837 /* function types are allowed (and return 1) */
6838 source_position_t const *const pos = &tp_expression->base.source_position;
6839 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6840 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
6842 wrong_type = "function";
6846 if (wrong_type != NULL) {
6847 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6848 errorf(&tp_expression->base.source_position,
6849 "operand of %s expression must not be of %s type '%T'",
6850 what, wrong_type, orig_type);
6853 return tp_expression;
6856 static expression_t *parse_sizeof(void)
6858 return parse_typeprop(EXPR_SIZEOF);
6861 static expression_t *parse_alignof(void)
6863 return parse_typeprop(EXPR_ALIGNOF);
6866 static expression_t *parse_select_expression(expression_t *addr)
6868 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
6869 bool select_left_arrow = (token.kind == T_MINUSGREATER);
6870 source_position_t const pos = *HERE;
6873 symbol_t *const symbol = expect_identifier("while parsing select", NULL);
6875 return create_error_expression();
6877 type_t *const orig_type = addr->base.type;
6878 type_t *const type = skip_typeref(orig_type);
6881 bool saw_error = false;
6882 if (is_type_pointer(type)) {
6883 if (!select_left_arrow) {
6885 "request for member '%Y' in something not a struct or union, but '%T'",
6889 type_left = skip_typeref(type->pointer.points_to);
6891 if (select_left_arrow && is_type_valid(type)) {
6892 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6898 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
6899 type_left->kind != TYPE_COMPOUND_UNION) {
6901 if (is_type_valid(type_left) && !saw_error) {
6903 "request for member '%Y' in something not a struct or union, but '%T'",
6906 return create_error_expression();
6909 compound_t *compound = type_left->compound.compound;
6910 if (!compound->complete) {
6911 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
6913 return create_error_expression();
6916 type_qualifiers_t qualifiers = type_left->base.qualifiers;
6917 expression_t *result =
6918 find_create_select(&pos, addr, qualifiers, compound, symbol);
6920 if (result == NULL) {
6921 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
6922 return create_error_expression();
6928 static void check_call_argument(type_t *expected_type,
6929 call_argument_t *argument, unsigned pos)
6931 type_t *expected_type_skip = skip_typeref(expected_type);
6932 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6933 expression_t *arg_expr = argument->expression;
6934 type_t *arg_type = skip_typeref(arg_expr->base.type);
6936 /* handle transparent union gnu extension */
6937 if (is_type_union(expected_type_skip)
6938 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
6939 compound_t *union_decl = expected_type_skip->compound.compound;
6940 type_t *best_type = NULL;
6941 entity_t *entry = union_decl->members.entities;
6942 for ( ; entry != NULL; entry = entry->base.next) {
6943 assert(is_declaration(entry));
6944 type_t *decl_type = entry->declaration.type;
6945 error = semantic_assign(decl_type, arg_expr);
6946 if (error == ASSIGN_ERROR_INCOMPATIBLE
6947 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6950 if (error == ASSIGN_SUCCESS) {
6951 best_type = decl_type;
6952 } else if (best_type == NULL) {
6953 best_type = decl_type;
6957 if (best_type != NULL) {
6958 expected_type = best_type;
6962 error = semantic_assign(expected_type, arg_expr);
6963 argument->expression = create_implicit_cast(arg_expr, expected_type);
6965 if (error != ASSIGN_SUCCESS) {
6966 /* report exact scope in error messages (like "in argument 3") */
6968 snprintf(buf, sizeof(buf), "call argument %u", pos);
6969 report_assign_error(error, expected_type, arg_expr, buf,
6970 &arg_expr->base.source_position);
6972 type_t *const promoted_type = get_default_promoted_type(arg_type);
6973 if (!types_compatible(expected_type_skip, promoted_type) &&
6974 !types_compatible(expected_type_skip, type_void_ptr) &&
6975 !types_compatible(type_void_ptr, promoted_type)) {
6976 /* Deliberately show the skipped types in this warning */
6977 source_position_t const *const apos = &arg_expr->base.source_position;
6978 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
6984 * Handle the semantic restrictions of builtin calls
6986 static void handle_builtin_argument_restrictions(call_expression_t *call)
6988 entity_t *entity = call->function->reference.entity;
6989 switch (entity->function.btk) {
6991 switch (entity->function.b.firm_builtin_kind) {
6992 case ir_bk_return_address:
6993 case ir_bk_frame_address: {
6994 /* argument must be constant */
6995 call_argument_t *argument = call->arguments;
6997 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
6998 errorf(&call->base.source_position,
6999 "argument of '%Y' must be a constant expression",
7000 call->function->reference.entity->base.symbol);
7004 case ir_bk_prefetch:
7005 /* second and third argument must be constant if existent */
7006 if (call->arguments == NULL)
7008 call_argument_t *rw = call->arguments->next;
7009 call_argument_t *locality = NULL;
7012 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7013 errorf(&call->base.source_position,
7014 "second argument of '%Y' must be a constant expression",
7015 call->function->reference.entity->base.symbol);
7017 locality = rw->next;
7019 if (locality != NULL) {
7020 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7021 errorf(&call->base.source_position,
7022 "third argument of '%Y' must be a constant expression",
7023 call->function->reference.entity->base.symbol);
7025 locality = rw->next;
7032 case BUILTIN_OBJECT_SIZE:
7033 if (call->arguments == NULL)
7036 call_argument_t *arg = call->arguments->next;
7037 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7038 errorf(&call->base.source_position,
7039 "second argument of '%Y' must be a constant expression",
7040 call->function->reference.entity->base.symbol);
7049 * Parse a call expression, ie. expression '( ... )'.
7051 * @param expression the function address
7053 static expression_t *parse_call_expression(expression_t *expression)
7055 expression_t *result = allocate_expression_zero(EXPR_CALL);
7056 call_expression_t *call = &result->call;
7057 call->function = expression;
7059 type_t *const orig_type = expression->base.type;
7060 type_t *const type = skip_typeref(orig_type);
7062 function_type_t *function_type = NULL;
7063 if (is_type_pointer(type)) {
7064 type_t *const to_type = skip_typeref(type->pointer.points_to);
7066 if (is_type_function(to_type)) {
7067 function_type = &to_type->function;
7068 call->base.type = function_type->return_type;
7072 if (function_type == NULL && is_type_valid(type)) {
7074 "called object '%E' (type '%T') is not a pointer to a function",
7075 expression, orig_type);
7078 /* parse arguments */
7080 add_anchor_token(')');
7081 add_anchor_token(',');
7083 if (token.kind != ')') {
7084 call_argument_t **anchor = &call->arguments;
7086 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7087 argument->expression = parse_assignment_expression();
7090 anchor = &argument->next;
7091 } while (next_if(','));
7093 rem_anchor_token(',');
7094 rem_anchor_token(')');
7097 if (function_type == NULL)
7100 /* check type and count of call arguments */
7101 function_parameter_t *parameter = function_type->parameters;
7102 call_argument_t *argument = call->arguments;
7103 if (!function_type->unspecified_parameters) {
7104 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7105 parameter = parameter->next, argument = argument->next) {
7106 check_call_argument(parameter->type, argument, ++pos);
7109 if (parameter != NULL) {
7110 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7111 } else if (argument != NULL && !function_type->variadic) {
7112 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7116 /* do default promotion for other arguments */
7117 for (; argument != NULL; argument = argument->next) {
7118 type_t *argument_type = argument->expression->base.type;
7119 if (!is_type_object(skip_typeref(argument_type))) {
7120 errorf(&argument->expression->base.source_position,
7121 "call argument '%E' must not be void", argument->expression);
7124 argument_type = get_default_promoted_type(argument_type);
7126 argument->expression
7127 = create_implicit_cast(argument->expression, argument_type);
7132 if (is_type_compound(skip_typeref(function_type->return_type))) {
7133 source_position_t const *const pos = &expression->base.source_position;
7134 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7137 if (expression->kind == EXPR_REFERENCE) {
7138 reference_expression_t *reference = &expression->reference;
7139 if (reference->entity->kind == ENTITY_FUNCTION &&
7140 reference->entity->function.btk != BUILTIN_NONE)
7141 handle_builtin_argument_restrictions(call);
7147 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7149 static bool same_compound_type(const type_t *type1, const type_t *type2)
7152 is_type_compound(type1) &&
7153 type1->kind == type2->kind &&
7154 type1->compound.compound == type2->compound.compound;
7157 static expression_t const *get_reference_address(expression_t const *expr)
7159 bool regular_take_address = true;
7161 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7162 expr = expr->unary.value;
7164 regular_take_address = false;
7167 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7170 expr = expr->unary.value;
7173 if (expr->kind != EXPR_REFERENCE)
7176 /* special case for functions which are automatically converted to a
7177 * pointer to function without an extra TAKE_ADDRESS operation */
7178 if (!regular_take_address &&
7179 expr->reference.entity->kind != ENTITY_FUNCTION) {
7186 static void warn_reference_address_as_bool(expression_t const* expr)
7188 expr = get_reference_address(expr);
7190 source_position_t const *const pos = &expr->base.source_position;
7191 entity_t const *const ent = expr->reference.entity;
7192 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7196 static void warn_assignment_in_condition(const expression_t *const expr)
7198 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7200 if (expr->base.parenthesized)
7202 source_position_t const *const pos = &expr->base.source_position;
7203 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7206 static void semantic_condition(expression_t const *const expr,
7207 char const *const context)
7209 type_t *const type = skip_typeref(expr->base.type);
7210 if (is_type_scalar(type)) {
7211 warn_reference_address_as_bool(expr);
7212 warn_assignment_in_condition(expr);
7213 } else if (is_type_valid(type)) {
7214 errorf(&expr->base.source_position,
7215 "%s must have scalar type", context);
7220 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7222 * @param expression the conditional expression
7224 static expression_t *parse_conditional_expression(expression_t *expression)
7226 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7228 conditional_expression_t *conditional = &result->conditional;
7229 conditional->condition = expression;
7232 add_anchor_token(':');
7234 /* §6.5.15:2 The first operand shall have scalar type. */
7235 semantic_condition(expression, "condition of conditional operator");
7237 expression_t *true_expression = expression;
7238 bool gnu_cond = false;
7239 if (GNU_MODE && token.kind == ':') {
7242 true_expression = parse_expression();
7244 rem_anchor_token(':');
7246 expression_t *false_expression =
7247 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7249 type_t *const orig_true_type = true_expression->base.type;
7250 type_t *const orig_false_type = false_expression->base.type;
7251 type_t *const true_type = skip_typeref(orig_true_type);
7252 type_t *const false_type = skip_typeref(orig_false_type);
7255 source_position_t const *const pos = &conditional->base.source_position;
7256 type_t *result_type;
7257 if (is_type_void(true_type) || is_type_void(false_type)) {
7258 /* ISO/IEC 14882:1998(E) §5.16:2 */
7259 if (true_expression->kind == EXPR_UNARY_THROW) {
7260 result_type = false_type;
7261 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7262 result_type = true_type;
7264 if (!is_type_void(true_type) || !is_type_void(false_type)) {
7265 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7267 result_type = type_void;
7269 } else if (is_type_arithmetic(true_type)
7270 && is_type_arithmetic(false_type)) {
7271 result_type = semantic_arithmetic(true_type, false_type);
7272 } else if (same_compound_type(true_type, false_type)) {
7273 /* just take 1 of the 2 types */
7274 result_type = true_type;
7275 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7276 type_t *pointer_type;
7278 expression_t *other_expression;
7279 if (is_type_pointer(true_type) &&
7280 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7281 pointer_type = true_type;
7282 other_type = false_type;
7283 other_expression = false_expression;
7285 pointer_type = false_type;
7286 other_type = true_type;
7287 other_expression = true_expression;
7290 if (is_null_pointer_constant(other_expression)) {
7291 result_type = pointer_type;
7292 } else if (is_type_pointer(other_type)) {
7293 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7294 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7297 if (is_type_void(to1) || is_type_void(to2)) {
7299 } else if (types_compatible(get_unqualified_type(to1),
7300 get_unqualified_type(to2))) {
7303 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7307 type_t *const type =
7308 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7309 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7310 } else if (is_type_integer(other_type)) {
7311 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7312 result_type = pointer_type;
7314 goto types_incompatible;
7318 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7319 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7321 result_type = type_error_type;
7324 conditional->true_expression
7325 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7326 conditional->false_expression
7327 = create_implicit_cast(false_expression, result_type);
7328 conditional->base.type = result_type;
7333 * Parse an extension expression.
7335 static expression_t *parse_extension(void)
7338 expression_t *expression = parse_subexpression(PREC_UNARY);
7344 * Parse a __builtin_classify_type() expression.
7346 static expression_t *parse_builtin_classify_type(void)
7348 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7349 result->base.type = type_int;
7351 eat(T___builtin_classify_type);
7353 add_anchor_token(')');
7355 expression_t *expression = parse_expression();
7356 rem_anchor_token(')');
7358 result->classify_type.type_expression = expression;
7364 * Parse a delete expression
7365 * ISO/IEC 14882:1998(E) §5.3.5
7367 static expression_t *parse_delete(void)
7369 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7370 result->base.type = type_void;
7375 result->kind = EXPR_UNARY_DELETE_ARRAY;
7379 expression_t *const value = parse_subexpression(PREC_CAST);
7380 result->unary.value = value;
7382 type_t *const type = skip_typeref(value->base.type);
7383 if (!is_type_pointer(type)) {
7384 if (is_type_valid(type)) {
7385 errorf(&value->base.source_position,
7386 "operand of delete must have pointer type");
7388 } else if (is_type_void(skip_typeref(type->pointer.points_to))) {
7389 source_position_t const *const pos = &value->base.source_position;
7390 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7397 * Parse a throw expression
7398 * ISO/IEC 14882:1998(E) §15:1
7400 static expression_t *parse_throw(void)
7402 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7403 result->base.type = type_void;
7407 expression_t *value = NULL;
7408 switch (token.kind) {
7410 value = parse_assignment_expression();
7411 /* ISO/IEC 14882:1998(E) §15.1:3 */
7412 type_t *const orig_type = value->base.type;
7413 type_t *const type = skip_typeref(orig_type);
7414 if (is_type_incomplete(type)) {
7415 errorf(&value->base.source_position,
7416 "cannot throw object of incomplete type '%T'", orig_type);
7417 } else if (is_type_pointer(type)) {
7418 type_t *const points_to = skip_typeref(type->pointer.points_to);
7419 if (is_type_incomplete(points_to) && !is_type_void(points_to)) {
7420 errorf(&value->base.source_position,
7421 "cannot throw pointer to incomplete type '%T'", orig_type);
7429 result->unary.value = value;
7434 static bool check_pointer_arithmetic(const source_position_t *source_position,
7435 type_t *pointer_type,
7436 type_t *orig_pointer_type)
7438 type_t *points_to = pointer_type->pointer.points_to;
7439 points_to = skip_typeref(points_to);
7441 if (is_type_incomplete(points_to)) {
7442 if (!GNU_MODE || !is_type_void(points_to)) {
7443 errorf(source_position,
7444 "arithmetic with pointer to incomplete type '%T' not allowed",
7448 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7450 } else if (is_type_function(points_to)) {
7452 errorf(source_position,
7453 "arithmetic with pointer to function type '%T' not allowed",
7457 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7463 static bool is_lvalue(const expression_t *expression)
7465 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7466 switch (expression->kind) {
7467 case EXPR_ARRAY_ACCESS:
7468 case EXPR_COMPOUND_LITERAL:
7469 case EXPR_REFERENCE:
7471 case EXPR_UNARY_DEREFERENCE:
7475 type_t *type = skip_typeref(expression->base.type);
7477 /* ISO/IEC 14882:1998(E) §3.10:3 */
7478 is_type_reference(type) ||
7479 /* Claim it is an lvalue, if the type is invalid. There was a parse
7480 * error before, which maybe prevented properly recognizing it as
7482 !is_type_valid(type);
7487 static void semantic_incdec(unary_expression_t *expression)
7489 type_t *const orig_type = expression->value->base.type;
7490 type_t *const type = skip_typeref(orig_type);
7491 if (is_type_pointer(type)) {
7492 if (!check_pointer_arithmetic(&expression->base.source_position,
7496 } else if (!is_type_real(type) && is_type_valid(type)) {
7497 /* TODO: improve error message */
7498 errorf(&expression->base.source_position,
7499 "operation needs an arithmetic or pointer type");
7502 if (!is_lvalue(expression->value)) {
7503 /* TODO: improve error message */
7504 errorf(&expression->base.source_position, "lvalue required as operand");
7506 expression->base.type = orig_type;
7509 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7511 type_t *const res_type = promote_integer(type);
7512 expr->base.type = res_type;
7513 expr->value = create_implicit_cast(expr->value, res_type);
7516 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7518 type_t *const orig_type = expression->value->base.type;
7519 type_t *const type = skip_typeref(orig_type);
7520 if (!is_type_arithmetic(type)) {
7521 if (is_type_valid(type)) {
7522 /* TODO: improve error message */
7523 errorf(&expression->base.source_position,
7524 "operation needs an arithmetic type");
7527 } else if (is_type_integer(type)) {
7528 promote_unary_int_expr(expression, type);
7530 expression->base.type = orig_type;
7534 static void semantic_unexpr_plus(unary_expression_t *expression)
7536 semantic_unexpr_arithmetic(expression);
7537 source_position_t const *const pos = &expression->base.source_position;
7538 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7541 static void semantic_not(unary_expression_t *expression)
7543 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7544 semantic_condition(expression->value, "operand of !");
7545 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7548 static void semantic_unexpr_integer(unary_expression_t *expression)
7550 type_t *const orig_type = expression->value->base.type;
7551 type_t *const type = skip_typeref(orig_type);
7552 if (!is_type_integer(type)) {
7553 if (is_type_valid(type)) {
7554 errorf(&expression->base.source_position,
7555 "operand of ~ must be of integer type");
7560 promote_unary_int_expr(expression, type);
7563 static void semantic_dereference(unary_expression_t *expression)
7565 type_t *const orig_type = expression->value->base.type;
7566 type_t *const type = skip_typeref(orig_type);
7567 if (!is_type_pointer(type)) {
7568 if (is_type_valid(type)) {
7569 errorf(&expression->base.source_position,
7570 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7575 type_t *result_type = type->pointer.points_to;
7576 result_type = automatic_type_conversion(result_type);
7577 expression->base.type = result_type;
7581 * Record that an address is taken (expression represents an lvalue).
7583 * @param expression the expression
7584 * @param may_be_register if true, the expression might be an register
7586 static void set_address_taken(expression_t *expression, bool may_be_register)
7588 if (expression->kind != EXPR_REFERENCE)
7591 entity_t *const entity = expression->reference.entity;
7593 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7596 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7597 && !may_be_register) {
7598 source_position_t const *const pos = &expression->base.source_position;
7599 errorf(pos, "address of register '%N' requested", entity);
7602 entity->variable.address_taken = true;
7606 * Check the semantic of the address taken expression.
7608 static void semantic_take_addr(unary_expression_t *expression)
7610 expression_t *value = expression->value;
7611 value->base.type = revert_automatic_type_conversion(value);
7613 type_t *orig_type = value->base.type;
7614 type_t *type = skip_typeref(orig_type);
7615 if (!is_type_valid(type))
7619 if (!is_lvalue(value)) {
7620 errorf(&expression->base.source_position, "'&' requires an lvalue");
7622 if (is_bitfield(value)) {
7623 errorf(&expression->base.source_position,
7624 "'&' not allowed on bitfield");
7627 set_address_taken(value, false);
7629 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7632 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7633 static expression_t *parse_##unexpression_type(void) \
7635 expression_t *unary_expression \
7636 = allocate_expression_zero(unexpression_type); \
7638 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7640 sfunc(&unary_expression->unary); \
7642 return unary_expression; \
7645 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7646 semantic_unexpr_arithmetic)
7647 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7648 semantic_unexpr_plus)
7649 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7651 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7652 semantic_dereference)
7653 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7655 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7656 semantic_unexpr_integer)
7657 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7659 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7662 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7664 static expression_t *parse_##unexpression_type(expression_t *left) \
7666 expression_t *unary_expression \
7667 = allocate_expression_zero(unexpression_type); \
7669 unary_expression->unary.value = left; \
7671 sfunc(&unary_expression->unary); \
7673 return unary_expression; \
7676 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7677 EXPR_UNARY_POSTFIX_INCREMENT,
7679 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7680 EXPR_UNARY_POSTFIX_DECREMENT,
7683 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7685 /* TODO: handle complex + imaginary types */
7687 type_left = get_unqualified_type(type_left);
7688 type_right = get_unqualified_type(type_right);
7690 /* §6.3.1.8 Usual arithmetic conversions */
7691 if (type_left == type_long_double || type_right == type_long_double) {
7692 return type_long_double;
7693 } else if (type_left == type_double || type_right == type_double) {
7695 } else if (type_left == type_float || type_right == type_float) {
7699 type_left = promote_integer(type_left);
7700 type_right = promote_integer(type_right);
7702 if (type_left == type_right)
7705 bool const signed_left = is_type_signed(type_left);
7706 bool const signed_right = is_type_signed(type_right);
7707 unsigned const rank_left = get_akind_rank(get_akind(type_left));
7708 unsigned const rank_right = get_akind_rank(get_akind(type_right));
7710 if (signed_left == signed_right)
7711 return rank_left >= rank_right ? type_left : type_right;
7715 atomic_type_kind_t s_akind;
7716 atomic_type_kind_t u_akind;
7721 u_type = type_right;
7723 s_type = type_right;
7726 s_akind = get_akind(s_type);
7727 u_akind = get_akind(u_type);
7728 s_rank = get_akind_rank(s_akind);
7729 u_rank = get_akind_rank(u_akind);
7731 if (u_rank >= s_rank)
7734 if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7738 case ATOMIC_TYPE_INT: return type_unsigned_int;
7739 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7740 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7742 default: panic("invalid atomic type");
7747 * Check the semantic restrictions for a binary expression.
7749 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7751 expression_t *const left = expression->left;
7752 expression_t *const right = expression->right;
7753 type_t *const orig_type_left = left->base.type;
7754 type_t *const orig_type_right = right->base.type;
7755 type_t *const type_left = skip_typeref(orig_type_left);
7756 type_t *const type_right = skip_typeref(orig_type_right);
7758 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7759 /* TODO: improve error message */
7760 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7761 errorf(&expression->base.source_position,
7762 "operation needs arithmetic types");
7767 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7768 expression->left = create_implicit_cast(left, arithmetic_type);
7769 expression->right = create_implicit_cast(right, arithmetic_type);
7770 expression->base.type = arithmetic_type;
7773 static void semantic_binexpr_integer(binary_expression_t *const expression)
7775 expression_t *const left = expression->left;
7776 expression_t *const right = expression->right;
7777 type_t *const orig_type_left = left->base.type;
7778 type_t *const orig_type_right = right->base.type;
7779 type_t *const type_left = skip_typeref(orig_type_left);
7780 type_t *const type_right = skip_typeref(orig_type_right);
7782 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7783 /* TODO: improve error message */
7784 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7785 errorf(&expression->base.source_position,
7786 "operation needs integer types");
7791 type_t *const result_type = semantic_arithmetic(type_left, type_right);
7792 expression->left = create_implicit_cast(left, result_type);
7793 expression->right = create_implicit_cast(right, result_type);
7794 expression->base.type = result_type;
7797 static void warn_div_by_zero(binary_expression_t const *const expression)
7799 if (!is_type_integer(expression->base.type))
7802 expression_t const *const right = expression->right;
7803 /* The type of the right operand can be different for /= */
7804 if (is_type_integer(right->base.type) &&
7805 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
7806 !fold_constant_to_bool(right)) {
7807 source_position_t const *const pos = &expression->base.source_position;
7808 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
7813 * Check the semantic restrictions for a div/mod expression.
7815 static void semantic_divmod_arithmetic(binary_expression_t *expression)
7817 semantic_binexpr_arithmetic(expression);
7818 warn_div_by_zero(expression);
7821 static void warn_addsub_in_shift(const expression_t *const expr)
7823 if (expr->base.parenthesized)
7827 switch (expr->kind) {
7828 case EXPR_BINARY_ADD: op = '+'; break;
7829 case EXPR_BINARY_SUB: op = '-'; break;
7833 source_position_t const *const pos = &expr->base.source_position;
7834 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
7837 static bool semantic_shift(binary_expression_t *expression)
7839 expression_t *const left = expression->left;
7840 expression_t *const right = expression->right;
7841 type_t *const orig_type_left = left->base.type;
7842 type_t *const orig_type_right = right->base.type;
7843 type_t * type_left = skip_typeref(orig_type_left);
7844 type_t * type_right = skip_typeref(orig_type_right);
7846 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7847 /* TODO: improve error message */
7848 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7849 errorf(&expression->base.source_position,
7850 "operands of shift operation must have integer types");
7855 type_left = promote_integer(type_left);
7857 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
7858 source_position_t const *const pos = &right->base.source_position;
7859 long const count = fold_constant_to_int(right);
7861 warningf(WARN_OTHER, pos, "shift count must be non-negative");
7862 } else if ((unsigned long)count >=
7863 get_atomic_type_size(type_left->atomic.akind) * 8) {
7864 warningf(WARN_OTHER, pos, "shift count must be less than type width");
7868 type_right = promote_integer(type_right);
7869 expression->right = create_implicit_cast(right, type_right);
7874 static void semantic_shift_op(binary_expression_t *expression)
7876 expression_t *const left = expression->left;
7877 expression_t *const right = expression->right;
7879 if (!semantic_shift(expression))
7882 warn_addsub_in_shift(left);
7883 warn_addsub_in_shift(right);
7885 type_t *const orig_type_left = left->base.type;
7886 type_t * type_left = skip_typeref(orig_type_left);
7888 type_left = promote_integer(type_left);
7889 expression->left = create_implicit_cast(left, type_left);
7890 expression->base.type = type_left;
7893 static void semantic_add(binary_expression_t *expression)
7895 expression_t *const left = expression->left;
7896 expression_t *const right = expression->right;
7897 type_t *const orig_type_left = left->base.type;
7898 type_t *const orig_type_right = right->base.type;
7899 type_t *const type_left = skip_typeref(orig_type_left);
7900 type_t *const type_right = skip_typeref(orig_type_right);
7903 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7904 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7905 expression->left = create_implicit_cast(left, arithmetic_type);
7906 expression->right = create_implicit_cast(right, arithmetic_type);
7907 expression->base.type = arithmetic_type;
7908 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7909 check_pointer_arithmetic(&expression->base.source_position,
7910 type_left, orig_type_left);
7911 expression->base.type = type_left;
7912 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7913 check_pointer_arithmetic(&expression->base.source_position,
7914 type_right, orig_type_right);
7915 expression->base.type = type_right;
7916 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7917 errorf(&expression->base.source_position,
7918 "invalid operands to binary + ('%T', '%T')",
7919 orig_type_left, orig_type_right);
7923 static void semantic_sub(binary_expression_t *expression)
7925 expression_t *const left = expression->left;
7926 expression_t *const right = expression->right;
7927 type_t *const orig_type_left = left->base.type;
7928 type_t *const orig_type_right = right->base.type;
7929 type_t *const type_left = skip_typeref(orig_type_left);
7930 type_t *const type_right = skip_typeref(orig_type_right);
7931 source_position_t const *const pos = &expression->base.source_position;
7934 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7935 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7936 expression->left = create_implicit_cast(left, arithmetic_type);
7937 expression->right = create_implicit_cast(right, arithmetic_type);
7938 expression->base.type = arithmetic_type;
7939 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7940 check_pointer_arithmetic(&expression->base.source_position,
7941 type_left, orig_type_left);
7942 expression->base.type = type_left;
7943 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7944 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7945 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7946 if (!types_compatible(unqual_left, unqual_right)) {
7948 "subtracting pointers to incompatible types '%T' and '%T'",
7949 orig_type_left, orig_type_right);
7950 } else if (!is_type_object(unqual_left)) {
7951 if (!is_type_void(unqual_left)) {
7952 errorf(pos, "subtracting pointers to non-object types '%T'",
7955 warningf(WARN_OTHER, pos, "subtracting pointers to void");
7958 expression->base.type = type_ptrdiff_t;
7959 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7960 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7961 orig_type_left, orig_type_right);
7965 static void warn_string_literal_address(expression_t const* expr)
7967 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7968 expr = expr->unary.value;
7969 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7971 expr = expr->unary.value;
7974 if (expr->kind == EXPR_STRING_LITERAL) {
7975 source_position_t const *const pos = &expr->base.source_position;
7976 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
7980 static bool maybe_negative(expression_t const *const expr)
7982 switch (is_constant_expression(expr)) {
7983 case EXPR_CLASS_ERROR: return false;
7984 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
7985 default: return true;
7989 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
7991 warn_string_literal_address(expr);
7993 expression_t const* const ref = get_reference_address(expr);
7994 if (ref != NULL && is_null_pointer_constant(other)) {
7995 entity_t const *const ent = ref->reference.entity;
7996 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
7999 if (!expr->base.parenthesized) {
8000 switch (expr->base.kind) {
8001 case EXPR_BINARY_LESS:
8002 case EXPR_BINARY_GREATER:
8003 case EXPR_BINARY_LESSEQUAL:
8004 case EXPR_BINARY_GREATEREQUAL:
8005 case EXPR_BINARY_NOTEQUAL:
8006 case EXPR_BINARY_EQUAL:
8007 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8016 * Check the semantics of comparison expressions.
8018 * @param expression The expression to check.
8020 static void semantic_comparison(binary_expression_t *expression)
8022 source_position_t const *const pos = &expression->base.source_position;
8023 expression_t *const left = expression->left;
8024 expression_t *const right = expression->right;
8026 warn_comparison(pos, left, right);
8027 warn_comparison(pos, right, left);
8029 type_t *orig_type_left = left->base.type;
8030 type_t *orig_type_right = right->base.type;
8031 type_t *type_left = skip_typeref(orig_type_left);
8032 type_t *type_right = skip_typeref(orig_type_right);
8034 /* TODO non-arithmetic types */
8035 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8036 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8038 /* test for signed vs unsigned compares */
8039 if (is_type_integer(arithmetic_type)) {
8040 bool const signed_left = is_type_signed(type_left);
8041 bool const signed_right = is_type_signed(type_right);
8042 if (signed_left != signed_right) {
8043 /* FIXME long long needs better const folding magic */
8044 /* TODO check whether constant value can be represented by other type */
8045 if ((signed_left && maybe_negative(left)) ||
8046 (signed_right && maybe_negative(right))) {
8047 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8052 expression->left = create_implicit_cast(left, arithmetic_type);
8053 expression->right = create_implicit_cast(right, arithmetic_type);
8054 expression->base.type = arithmetic_type;
8055 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8056 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8057 is_type_float(arithmetic_type)) {
8058 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8060 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8061 /* TODO check compatibility */
8062 } else if (is_type_pointer(type_left)) {
8063 expression->right = create_implicit_cast(right, type_left);
8064 } else if (is_type_pointer(type_right)) {
8065 expression->left = create_implicit_cast(left, type_right);
8066 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8067 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8069 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8073 * Checks if a compound type has constant fields.
8075 static bool has_const_fields(const compound_type_t *type)
8077 compound_t *compound = type->compound;
8078 entity_t *entry = compound->members.entities;
8080 for (; entry != NULL; entry = entry->base.next) {
8081 if (!is_declaration(entry))
8084 const type_t *decl_type = skip_typeref(entry->declaration.type);
8085 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8092 static bool is_valid_assignment_lhs(expression_t const* const left)
8094 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8095 type_t *const type_left = skip_typeref(orig_type_left);
8097 if (!is_lvalue(left)) {
8098 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8103 if (left->kind == EXPR_REFERENCE
8104 && left->reference.entity->kind == ENTITY_FUNCTION) {
8105 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8109 if (is_type_array(type_left)) {
8110 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8113 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8114 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8118 if (is_type_incomplete(type_left)) {
8119 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8120 left, orig_type_left);
8123 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8124 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8125 left, orig_type_left);
8132 static void semantic_arithmetic_assign(binary_expression_t *expression)
8134 expression_t *left = expression->left;
8135 expression_t *right = expression->right;
8136 type_t *orig_type_left = left->base.type;
8137 type_t *orig_type_right = right->base.type;
8139 if (!is_valid_assignment_lhs(left))
8142 type_t *type_left = skip_typeref(orig_type_left);
8143 type_t *type_right = skip_typeref(orig_type_right);
8145 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8146 /* TODO: improve error message */
8147 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8148 errorf(&expression->base.source_position,
8149 "operation needs arithmetic types");
8154 /* combined instructions are tricky. We can't create an implicit cast on
8155 * the left side, because we need the uncasted form for the store.
8156 * The ast2firm pass has to know that left_type must be right_type
8157 * for the arithmetic operation and create a cast by itself */
8158 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8159 expression->right = create_implicit_cast(right, arithmetic_type);
8160 expression->base.type = type_left;
8163 static void semantic_divmod_assign(binary_expression_t *expression)
8165 semantic_arithmetic_assign(expression);
8166 warn_div_by_zero(expression);
8169 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8171 expression_t *const left = expression->left;
8172 expression_t *const right = expression->right;
8173 type_t *const orig_type_left = left->base.type;
8174 type_t *const orig_type_right = right->base.type;
8175 type_t *const type_left = skip_typeref(orig_type_left);
8176 type_t *const type_right = skip_typeref(orig_type_right);
8178 if (!is_valid_assignment_lhs(left))
8181 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8182 /* combined instructions are tricky. We can't create an implicit cast on
8183 * the left side, because we need the uncasted form for the store.
8184 * The ast2firm pass has to know that left_type must be right_type
8185 * for the arithmetic operation and create a cast by itself */
8186 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8187 expression->right = create_implicit_cast(right, arithmetic_type);
8188 expression->base.type = type_left;
8189 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8190 check_pointer_arithmetic(&expression->base.source_position,
8191 type_left, orig_type_left);
8192 expression->base.type = type_left;
8193 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8194 errorf(&expression->base.source_position,
8195 "incompatible types '%T' and '%T' in assignment",
8196 orig_type_left, orig_type_right);
8200 static void semantic_integer_assign(binary_expression_t *expression)
8202 expression_t *left = expression->left;
8203 expression_t *right = expression->right;
8204 type_t *orig_type_left = left->base.type;
8205 type_t *orig_type_right = right->base.type;
8207 if (!is_valid_assignment_lhs(left))
8210 type_t *type_left = skip_typeref(orig_type_left);
8211 type_t *type_right = skip_typeref(orig_type_right);
8213 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8214 /* TODO: improve error message */
8215 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8216 errorf(&expression->base.source_position,
8217 "operation needs integer types");
8222 /* combined instructions are tricky. We can't create an implicit cast on
8223 * the left side, because we need the uncasted form for the store.
8224 * The ast2firm pass has to know that left_type must be right_type
8225 * for the arithmetic operation and create a cast by itself */
8226 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8227 expression->right = create_implicit_cast(right, arithmetic_type);
8228 expression->base.type = type_left;
8231 static void semantic_shift_assign(binary_expression_t *expression)
8233 expression_t *left = expression->left;
8235 if (!is_valid_assignment_lhs(left))
8238 if (!semantic_shift(expression))
8241 expression->base.type = skip_typeref(left->base.type);
8244 static void warn_logical_and_within_or(const expression_t *const expr)
8246 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8248 if (expr->base.parenthesized)
8250 source_position_t const *const pos = &expr->base.source_position;
8251 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8255 * Check the semantic restrictions of a logical expression.
8257 static void semantic_logical_op(binary_expression_t *expression)
8259 /* §6.5.13:2 Each of the operands shall have scalar type.
8260 * §6.5.14:2 Each of the operands shall have scalar type. */
8261 semantic_condition(expression->left, "left operand of logical operator");
8262 semantic_condition(expression->right, "right operand of logical operator");
8263 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8264 warn_logical_and_within_or(expression->left);
8265 warn_logical_and_within_or(expression->right);
8267 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8271 * Check the semantic restrictions of a binary assign expression.
8273 static void semantic_binexpr_assign(binary_expression_t *expression)
8275 expression_t *left = expression->left;
8276 type_t *orig_type_left = left->base.type;
8278 if (!is_valid_assignment_lhs(left))
8281 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8282 report_assign_error(error, orig_type_left, expression->right,
8283 "assignment", &left->base.source_position);
8284 expression->right = create_implicit_cast(expression->right, orig_type_left);
8285 expression->base.type = orig_type_left;
8289 * Determine if the outermost operation (or parts thereof) of the given
8290 * expression has no effect in order to generate a warning about this fact.
8291 * Therefore in some cases this only examines some of the operands of the
8292 * expression (see comments in the function and examples below).
8294 * f() + 23; // warning, because + has no effect
8295 * x || f(); // no warning, because x controls execution of f()
8296 * x ? y : f(); // warning, because y has no effect
8297 * (void)x; // no warning to be able to suppress the warning
8298 * This function can NOT be used for an "expression has definitely no effect"-
8300 static bool expression_has_effect(const expression_t *const expr)
8302 switch (expr->kind) {
8303 case EXPR_ERROR: return true; /* do NOT warn */
8304 case EXPR_REFERENCE: return false;
8305 case EXPR_ENUM_CONSTANT: return false;
8306 case EXPR_LABEL_ADDRESS: return false;
8308 /* suppress the warning for microsoft __noop operations */
8309 case EXPR_LITERAL_MS_NOOP: return true;
8310 case EXPR_LITERAL_BOOLEAN:
8311 case EXPR_LITERAL_CHARACTER:
8312 case EXPR_LITERAL_WIDE_CHARACTER:
8313 case EXPR_LITERAL_INTEGER:
8314 case EXPR_LITERAL_FLOATINGPOINT:
8315 case EXPR_STRING_LITERAL: return false;
8318 const call_expression_t *const call = &expr->call;
8319 if (call->function->kind != EXPR_REFERENCE)
8322 switch (call->function->reference.entity->function.btk) {
8323 /* FIXME: which builtins have no effect? */
8324 default: return true;
8328 /* Generate the warning if either the left or right hand side of a
8329 * conditional expression has no effect */
8330 case EXPR_CONDITIONAL: {
8331 conditional_expression_t const *const cond = &expr->conditional;
8332 expression_t const *const t = cond->true_expression;
8334 (t == NULL || expression_has_effect(t)) &&
8335 expression_has_effect(cond->false_expression);
8338 case EXPR_SELECT: return false;
8339 case EXPR_ARRAY_ACCESS: return false;
8340 case EXPR_SIZEOF: return false;
8341 case EXPR_CLASSIFY_TYPE: return false;
8342 case EXPR_ALIGNOF: return false;
8344 case EXPR_FUNCNAME: return false;
8345 case EXPR_BUILTIN_CONSTANT_P: return false;
8346 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8347 case EXPR_OFFSETOF: return false;
8348 case EXPR_VA_START: return true;
8349 case EXPR_VA_ARG: return true;
8350 case EXPR_VA_COPY: return true;
8351 case EXPR_STATEMENT: return true; // TODO
8352 case EXPR_COMPOUND_LITERAL: return false;
8354 case EXPR_UNARY_NEGATE: return false;
8355 case EXPR_UNARY_PLUS: return false;
8356 case EXPR_UNARY_BITWISE_NEGATE: return false;
8357 case EXPR_UNARY_NOT: return false;
8358 case EXPR_UNARY_DEREFERENCE: return false;
8359 case EXPR_UNARY_TAKE_ADDRESS: return false;
8360 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8361 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8362 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8363 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8365 /* Treat void casts as if they have an effect in order to being able to
8366 * suppress the warning */
8367 case EXPR_UNARY_CAST: {
8368 type_t *const type = skip_typeref(expr->base.type);
8369 return is_type_void(type);
8372 case EXPR_UNARY_ASSUME: return true;
8373 case EXPR_UNARY_DELETE: return true;
8374 case EXPR_UNARY_DELETE_ARRAY: return true;
8375 case EXPR_UNARY_THROW: return true;
8377 case EXPR_BINARY_ADD: return false;
8378 case EXPR_BINARY_SUB: return false;
8379 case EXPR_BINARY_MUL: return false;
8380 case EXPR_BINARY_DIV: return false;
8381 case EXPR_BINARY_MOD: return false;
8382 case EXPR_BINARY_EQUAL: return false;
8383 case EXPR_BINARY_NOTEQUAL: return false;
8384 case EXPR_BINARY_LESS: return false;
8385 case EXPR_BINARY_LESSEQUAL: return false;
8386 case EXPR_BINARY_GREATER: return false;
8387 case EXPR_BINARY_GREATEREQUAL: return false;
8388 case EXPR_BINARY_BITWISE_AND: return false;
8389 case EXPR_BINARY_BITWISE_OR: return false;
8390 case EXPR_BINARY_BITWISE_XOR: return false;
8391 case EXPR_BINARY_SHIFTLEFT: return false;
8392 case EXPR_BINARY_SHIFTRIGHT: return false;
8393 case EXPR_BINARY_ASSIGN: return true;
8394 case EXPR_BINARY_MUL_ASSIGN: return true;
8395 case EXPR_BINARY_DIV_ASSIGN: return true;
8396 case EXPR_BINARY_MOD_ASSIGN: return true;
8397 case EXPR_BINARY_ADD_ASSIGN: return true;
8398 case EXPR_BINARY_SUB_ASSIGN: return true;
8399 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8400 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8401 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8402 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8403 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8405 /* Only examine the right hand side of && and ||, because the left hand
8406 * side already has the effect of controlling the execution of the right
8408 case EXPR_BINARY_LOGICAL_AND:
8409 case EXPR_BINARY_LOGICAL_OR:
8410 /* Only examine the right hand side of a comma expression, because the left
8411 * hand side has a separate warning */
8412 case EXPR_BINARY_COMMA:
8413 return expression_has_effect(expr->binary.right);
8415 case EXPR_BINARY_ISGREATER: return false;
8416 case EXPR_BINARY_ISGREATEREQUAL: return false;
8417 case EXPR_BINARY_ISLESS: return false;
8418 case EXPR_BINARY_ISLESSEQUAL: return false;
8419 case EXPR_BINARY_ISLESSGREATER: return false;
8420 case EXPR_BINARY_ISUNORDERED: return false;
8423 internal_errorf(HERE, "unexpected expression");
8426 static void semantic_comma(binary_expression_t *expression)
8428 const expression_t *const left = expression->left;
8429 if (!expression_has_effect(left)) {
8430 source_position_t const *const pos = &left->base.source_position;
8431 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8433 expression->base.type = expression->right->base.type;
8437 * @param prec_r precedence of the right operand
8439 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8440 static expression_t *parse_##binexpression_type(expression_t *left) \
8442 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8443 binexpr->binary.left = left; \
8446 expression_t *right = parse_subexpression(prec_r); \
8448 binexpr->binary.right = right; \
8449 sfunc(&binexpr->binary); \
8454 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8455 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8456 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8457 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8458 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8459 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8460 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8461 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8462 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8463 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8464 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8465 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8466 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8467 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8468 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8469 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8470 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8471 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8472 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8473 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8474 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8475 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8476 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8477 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8478 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8479 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8480 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8481 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8482 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8483 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8486 static expression_t *parse_subexpression(precedence_t precedence)
8488 expression_parser_function_t *parser
8489 = &expression_parsers[token.kind];
8492 if (parser->parser != NULL) {
8493 left = parser->parser();
8495 left = parse_primary_expression();
8497 assert(left != NULL);
8500 parser = &expression_parsers[token.kind];
8501 if (parser->infix_parser == NULL)
8503 if (parser->infix_precedence < precedence)
8506 left = parser->infix_parser(left);
8508 assert(left != NULL);
8515 * Parse an expression.
8517 static expression_t *parse_expression(void)
8519 return parse_subexpression(PREC_EXPRESSION);
8523 * Register a parser for a prefix-like operator.
8525 * @param parser the parser function
8526 * @param token_kind the token type of the prefix token
8528 static void register_expression_parser(parse_expression_function parser,
8531 expression_parser_function_t *entry = &expression_parsers[token_kind];
8533 if (entry->parser != NULL) {
8534 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8535 panic("trying to register multiple expression parsers for a token");
8537 entry->parser = parser;
8541 * Register a parser for an infix operator with given precedence.
8543 * @param parser the parser function
8544 * @param token_kind the token type of the infix operator
8545 * @param precedence the precedence of the operator
8547 static void register_infix_parser(parse_expression_infix_function parser,
8548 int token_kind, precedence_t precedence)
8550 expression_parser_function_t *entry = &expression_parsers[token_kind];
8552 if (entry->infix_parser != NULL) {
8553 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8554 panic("trying to register multiple infix expression parsers for a "
8557 entry->infix_parser = parser;
8558 entry->infix_precedence = precedence;
8562 * Initialize the expression parsers.
8564 static void init_expression_parsers(void)
8566 memset(&expression_parsers, 0, sizeof(expression_parsers));
8568 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8569 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8570 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8571 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8572 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8573 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8574 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8575 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8576 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8577 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8578 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8579 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8580 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8581 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8582 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8583 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8584 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8585 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8586 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8587 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8588 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8589 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8590 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8591 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8592 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8593 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8594 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8595 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8596 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8597 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8598 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8599 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8600 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8601 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8602 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8603 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8604 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8606 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8607 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8608 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8609 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8610 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8611 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8612 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8613 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8614 register_expression_parser(parse_sizeof, T_sizeof);
8615 register_expression_parser(parse_alignof, T___alignof__);
8616 register_expression_parser(parse_extension, T___extension__);
8617 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8618 register_expression_parser(parse_delete, T_delete);
8619 register_expression_parser(parse_throw, T_throw);
8623 * Parse a asm statement arguments specification.
8625 static asm_argument_t *parse_asm_arguments(bool is_out)
8627 asm_argument_t *result = NULL;
8628 asm_argument_t **anchor = &result;
8630 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8631 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8634 add_anchor_token(']');
8635 argument->symbol = expect_identifier("while parsing asm argument", NULL);
8636 rem_anchor_token(']');
8638 if (!argument->symbol)
8642 argument->constraints = parse_string_literals("asm argument");
8643 add_anchor_token(')');
8645 expression_t *expression = parse_expression();
8646 rem_anchor_token(')');
8648 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8649 * change size or type representation (e.g. int -> long is ok, but
8650 * int -> float is not) */
8651 if (expression->kind == EXPR_UNARY_CAST) {
8652 type_t *const type = expression->base.type;
8653 type_kind_t const kind = type->kind;
8654 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8657 if (kind == TYPE_ATOMIC) {
8658 atomic_type_kind_t const akind = type->atomic.akind;
8659 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8660 size = get_atomic_type_size(akind);
8662 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8663 size = get_type_size(type_void_ptr);
8667 expression_t *const value = expression->unary.value;
8668 type_t *const value_type = value->base.type;
8669 type_kind_t const value_kind = value_type->kind;
8671 unsigned value_flags;
8672 unsigned value_size;
8673 if (value_kind == TYPE_ATOMIC) {
8674 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8675 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8676 value_size = get_atomic_type_size(value_akind);
8677 } else if (value_kind == TYPE_POINTER) {
8678 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8679 value_size = get_type_size(type_void_ptr);
8684 if (value_flags != flags || value_size != size)
8688 } while (expression->kind == EXPR_UNARY_CAST);
8692 if (!is_lvalue(expression)) {
8693 errorf(&expression->base.source_position,
8694 "asm output argument is not an lvalue");
8697 if (argument->constraints.begin[0] == '=')
8698 determine_lhs_ent(expression, NULL);
8700 mark_vars_read(expression, NULL);
8702 mark_vars_read(expression, NULL);
8704 argument->expression = expression;
8707 set_address_taken(expression, true);
8710 anchor = &argument->next;
8720 * Parse a asm statement clobber specification.
8722 static asm_clobber_t *parse_asm_clobbers(void)
8724 asm_clobber_t *result = NULL;
8725 asm_clobber_t **anchor = &result;
8727 while (token.kind == T_STRING_LITERAL) {
8728 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8729 clobber->clobber = parse_string_literals(NULL);
8732 anchor = &clobber->next;
8742 * Parse an asm statement.
8744 static statement_t *parse_asm_statement(void)
8746 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8747 asm_statement_t *asm_statement = &statement->asms;
8750 add_anchor_token(')');
8751 add_anchor_token(':');
8752 add_anchor_token(T_STRING_LITERAL);
8754 if (next_if(T_volatile))
8755 asm_statement->is_volatile = true;
8758 rem_anchor_token(T_STRING_LITERAL);
8759 asm_statement->asm_text = parse_string_literals("asm statement");
8762 asm_statement->outputs = parse_asm_arguments(true);
8765 asm_statement->inputs = parse_asm_arguments(false);
8767 rem_anchor_token(':');
8769 asm_statement->clobbers = parse_asm_clobbers();
8771 rem_anchor_token(')');
8775 if (asm_statement->outputs == NULL) {
8776 /* GCC: An 'asm' instruction without any output operands will be treated
8777 * identically to a volatile 'asm' instruction. */
8778 asm_statement->is_volatile = true;
8784 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
8786 statement_t *inner_stmt;
8787 switch (token.kind) {
8789 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
8790 inner_stmt = create_error_statement();
8794 if (label->kind == STATEMENT_LABEL) {
8795 /* Eat an empty statement here, to avoid the warning about an empty
8796 * statement after a label. label:; is commonly used to have a label
8797 * before a closing brace. */
8798 inner_stmt = create_empty_statement();
8805 inner_stmt = parse_statement();
8806 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
8807 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
8808 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
8809 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
8817 * Parse a case statement.
8819 static statement_t *parse_case_statement(void)
8821 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8822 source_position_t *const pos = &statement->base.source_position;
8825 add_anchor_token(':');
8827 expression_t *expression = parse_expression();
8828 type_t *expression_type = expression->base.type;
8829 type_t *skipped = skip_typeref(expression_type);
8830 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8831 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8832 expression, expression_type);
8835 type_t *type = expression_type;
8836 if (current_switch != NULL) {
8837 type_t *switch_type = current_switch->expression->base.type;
8838 if (is_type_valid(switch_type)) {
8839 expression = create_implicit_cast(expression, switch_type);
8843 statement->case_label.expression = expression;
8844 expression_classification_t const expr_class = is_constant_expression(expression);
8845 if (expr_class != EXPR_CLASS_CONSTANT) {
8846 if (expr_class != EXPR_CLASS_ERROR) {
8847 errorf(pos, "case label does not reduce to an integer constant");
8849 statement->case_label.is_bad = true;
8851 long const val = fold_constant_to_int(expression);
8852 statement->case_label.first_case = val;
8853 statement->case_label.last_case = val;
8857 if (next_if(T_DOTDOTDOT)) {
8858 expression_t *end_range = parse_expression();
8859 expression_type = expression->base.type;
8860 skipped = skip_typeref(expression_type);
8861 if (!is_type_integer(skipped) && is_type_valid(skipped)) {
8862 errorf(pos, "case expression '%E' must have integer type but has type '%T'",
8863 expression, expression_type);
8866 end_range = create_implicit_cast(end_range, type);
8867 statement->case_label.end_range = end_range;
8868 expression_classification_t const end_class = is_constant_expression(end_range);
8869 if (end_class != EXPR_CLASS_CONSTANT) {
8870 if (end_class != EXPR_CLASS_ERROR) {
8871 errorf(pos, "case range does not reduce to an integer constant");
8873 statement->case_label.is_bad = true;
8875 long const val = fold_constant_to_int(end_range);
8876 statement->case_label.last_case = val;
8878 if (val < statement->case_label.first_case) {
8879 statement->case_label.is_empty_range = true;
8880 warningf(WARN_OTHER, pos, "empty range specified");
8886 PUSH_PARENT(statement);
8888 rem_anchor_token(':');
8891 if (current_switch != NULL) {
8892 if (! statement->case_label.is_bad) {
8893 /* Check for duplicate case values */
8894 case_label_statement_t *c = &statement->case_label;
8895 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8896 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8899 if (c->last_case < l->first_case || c->first_case > l->last_case)
8902 errorf(pos, "duplicate case value (previously used %P)",
8903 &l->base.source_position);
8907 /* link all cases into the switch statement */
8908 if (current_switch->last_case == NULL) {
8909 current_switch->first_case = &statement->case_label;
8911 current_switch->last_case->next = &statement->case_label;
8913 current_switch->last_case = &statement->case_label;
8915 errorf(pos, "case label not within a switch statement");
8918 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
8925 * Parse a default statement.
8927 static statement_t *parse_default_statement(void)
8929 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8933 PUSH_PARENT(statement);
8937 if (current_switch != NULL) {
8938 const case_label_statement_t *def_label = current_switch->default_label;
8939 if (def_label != NULL) {
8940 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
8942 current_switch->default_label = &statement->case_label;
8944 /* link all cases into the switch statement */
8945 if (current_switch->last_case == NULL) {
8946 current_switch->first_case = &statement->case_label;
8948 current_switch->last_case->next = &statement->case_label;
8950 current_switch->last_case = &statement->case_label;
8953 errorf(&statement->base.source_position,
8954 "'default' label not within a switch statement");
8957 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
8964 * Parse a label statement.
8966 static statement_t *parse_label_statement(void)
8968 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8969 label_t *const label = get_label(NULL /* Cannot fail, token is T_IDENTIFIER. */);
8970 statement->label.label = label;
8972 PUSH_PARENT(statement);
8974 /* if statement is already set then the label is defined twice,
8975 * otherwise it was just mentioned in a goto/local label declaration so far
8977 source_position_t const* const pos = &statement->base.source_position;
8978 if (label->statement != NULL) {
8979 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
8981 label->base.source_position = *pos;
8982 label->statement = statement;
8987 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
8988 parse_attributes(NULL); // TODO process attributes
8991 statement->label.statement = parse_label_inner_statement(statement, "label");
8993 /* remember the labels in a list for later checking */
8994 *label_anchor = &statement->label;
8995 label_anchor = &statement->label.next;
9001 static statement_t *parse_inner_statement(void)
9003 statement_t *const stmt = parse_statement();
9004 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9005 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9006 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9007 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9013 * Parse an expression in parentheses and mark its variables as read.
9015 static expression_t *parse_condition(void)
9017 add_anchor_token(')');
9019 expression_t *const expr = parse_expression();
9020 mark_vars_read(expr, NULL);
9021 rem_anchor_token(')');
9027 * Parse an if statement.
9029 static statement_t *parse_if(void)
9031 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9035 PUSH_PARENT(statement);
9036 PUSH_SCOPE_STATEMENT(&statement->ifs.scope);
9038 add_anchor_token(T_else);
9040 expression_t *const expr = parse_condition();
9041 statement->ifs.condition = expr;
9042 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9044 semantic_condition(expr, "condition of 'if'-statment");
9046 statement_t *const true_stmt = parse_inner_statement();
9047 statement->ifs.true_statement = true_stmt;
9048 rem_anchor_token(T_else);
9050 if (true_stmt->kind == STATEMENT_EMPTY) {
9051 warningf(WARN_EMPTY_BODY, HERE,
9052 "suggest braces around empty body in an ‘if’ statement");
9055 if (next_if(T_else)) {
9056 statement->ifs.false_statement = parse_inner_statement();
9058 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9059 warningf(WARN_EMPTY_BODY, HERE,
9060 "suggest braces around empty body in an ‘if’ statement");
9062 } else if (true_stmt->kind == STATEMENT_IF &&
9063 true_stmt->ifs.false_statement != NULL) {
9064 source_position_t const *const pos = &true_stmt->base.source_position;
9065 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9074 * Check that all enums are handled in a switch.
9076 * @param statement the switch statement to check
9078 static void check_enum_cases(const switch_statement_t *statement)
9080 if (!is_warn_on(WARN_SWITCH_ENUM))
9082 const type_t *type = skip_typeref(statement->expression->base.type);
9083 if (! is_type_enum(type))
9085 const enum_type_t *enumt = &type->enumt;
9087 /* if we have a default, no warnings */
9088 if (statement->default_label != NULL)
9091 /* FIXME: calculation of value should be done while parsing */
9092 /* TODO: quadratic algorithm here. Change to an n log n one */
9093 long last_value = -1;
9094 const entity_t *entry = enumt->enume->base.next;
9095 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9096 entry = entry->base.next) {
9097 const expression_t *expression = entry->enum_value.value;
9098 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9100 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9101 if (l->expression == NULL)
9103 if (l->first_case <= value && value <= l->last_case) {
9109 source_position_t const *const pos = &statement->base.source_position;
9110 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9117 * Parse a switch statement.
9119 static statement_t *parse_switch(void)
9121 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9125 PUSH_PARENT(statement);
9126 PUSH_SCOPE_STATEMENT(&statement->switchs.scope);
9128 expression_t *const expr = parse_condition();
9129 type_t * type = skip_typeref(expr->base.type);
9130 if (is_type_integer(type)) {
9131 type = promote_integer(type);
9132 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9133 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9135 } else if (is_type_valid(type)) {
9136 errorf(&expr->base.source_position,
9137 "switch quantity is not an integer, but '%T'", type);
9138 type = type_error_type;
9140 statement->switchs.expression = create_implicit_cast(expr, type);
9142 switch_statement_t *rem = current_switch;
9143 current_switch = &statement->switchs;
9144 statement->switchs.body = parse_inner_statement();
9145 current_switch = rem;
9147 if (statement->switchs.default_label == NULL) {
9148 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9150 check_enum_cases(&statement->switchs);
9157 static statement_t *parse_loop_body(statement_t *const loop)
9159 statement_t *const rem = current_loop;
9160 current_loop = loop;
9162 statement_t *const body = parse_inner_statement();
9169 * Parse a while statement.
9171 static statement_t *parse_while(void)
9173 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9177 PUSH_PARENT(statement);
9178 PUSH_SCOPE_STATEMENT(&statement->whiles.scope);
9180 expression_t *const cond = parse_condition();
9181 statement->whiles.condition = cond;
9182 /* §6.8.5:2 The controlling expression of an iteration statement shall
9183 * have scalar type. */
9184 semantic_condition(cond, "condition of 'while'-statement");
9186 statement->whiles.body = parse_loop_body(statement);
9194 * Parse a do statement.
9196 static statement_t *parse_do(void)
9198 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9202 PUSH_PARENT(statement);
9203 PUSH_SCOPE_STATEMENT(&statement->do_while.scope);
9205 add_anchor_token(T_while);
9206 statement->do_while.body = parse_loop_body(statement);
9207 rem_anchor_token(T_while);
9210 expression_t *const cond = parse_condition();
9211 statement->do_while.condition = cond;
9212 /* §6.8.5:2 The controlling expression of an iteration statement shall
9213 * have scalar type. */
9214 semantic_condition(cond, "condition of 'do-while'-statement");
9223 * Parse a for statement.
9225 static statement_t *parse_for(void)
9227 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9231 PUSH_PARENT(statement);
9232 PUSH_SCOPE_STATEMENT(&statement->fors.scope);
9234 add_anchor_token(')');
9240 } else if (is_declaration_specifier(&token)) {
9241 parse_declaration(record_entity, DECL_FLAGS_NONE);
9243 add_anchor_token(';');
9244 expression_t *const init = parse_expression();
9245 statement->fors.initialisation = init;
9246 mark_vars_read(init, ENT_ANY);
9247 if (!expression_has_effect(init)) {
9248 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9250 rem_anchor_token(';');
9256 if (token.kind != ';') {
9257 add_anchor_token(';');
9258 expression_t *const cond = parse_expression();
9259 statement->fors.condition = cond;
9260 /* §6.8.5:2 The controlling expression of an iteration statement
9261 * shall have scalar type. */
9262 semantic_condition(cond, "condition of 'for'-statement");
9263 mark_vars_read(cond, NULL);
9264 rem_anchor_token(';');
9267 if (token.kind != ')') {
9268 expression_t *const step = parse_expression();
9269 statement->fors.step = step;
9270 mark_vars_read(step, ENT_ANY);
9271 if (!expression_has_effect(step)) {
9272 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9275 rem_anchor_token(')');
9277 statement->fors.body = parse_loop_body(statement);
9285 * Parse a goto statement.
9287 static statement_t *parse_goto(void)
9289 statement_t *statement;
9290 if (GNU_MODE && look_ahead(1)->kind == '*') {
9291 statement = allocate_statement_zero(STATEMENT_COMPUTED_GOTO);
9295 expression_t *expression = parse_expression();
9296 mark_vars_read(expression, NULL);
9298 /* Argh: although documentation says the expression must be of type void*,
9299 * gcc accepts anything that can be casted into void* without error */
9300 type_t *type = expression->base.type;
9302 if (type != type_error_type) {
9303 if (!is_type_pointer(type) && !is_type_integer(type)) {
9304 errorf(&expression->base.source_position,
9305 "cannot convert to a pointer type");
9306 } else if (type != type_void_ptr) {
9307 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9309 expression = create_implicit_cast(expression, type_void_ptr);
9312 statement->computed_goto.expression = expression;
9314 statement = allocate_statement_zero(STATEMENT_GOTO);
9317 label_t *const label = get_label("while parsing goto");
9320 statement->gotos.label = label;
9322 /* remember the goto's in a list for later checking */
9323 *goto_anchor = &statement->gotos;
9324 goto_anchor = &statement->gotos.next;
9326 statement->gotos.label = &allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, sym_anonymous, &builtin_source_position)->label;
9335 * Parse a continue statement.
9337 static statement_t *parse_continue(void)
9339 if (current_loop == NULL) {
9340 errorf(HERE, "continue statement not within loop");
9343 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9351 * Parse a break statement.
9353 static statement_t *parse_break(void)
9355 if (current_switch == NULL && current_loop == NULL) {
9356 errorf(HERE, "break statement not within loop or switch");
9359 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9367 * Parse a __leave statement.
9369 static statement_t *parse_leave_statement(void)
9371 if (current_try == NULL) {
9372 errorf(HERE, "__leave statement not within __try");
9375 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9383 * Check if a given entity represents a local variable.
9385 static bool is_local_variable(const entity_t *entity)
9387 if (entity->kind != ENTITY_VARIABLE)
9390 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9391 case STORAGE_CLASS_AUTO:
9392 case STORAGE_CLASS_REGISTER: {
9393 const type_t *type = skip_typeref(entity->declaration.type);
9394 if (is_type_function(type)) {
9406 * Check if a given expression represents a local variable.
9408 static bool expression_is_local_variable(const expression_t *expression)
9410 if (expression->base.kind != EXPR_REFERENCE) {
9413 const entity_t *entity = expression->reference.entity;
9414 return is_local_variable(entity);
9418 * Check if a given expression represents a local variable and
9419 * return its declaration then, else return NULL.
9421 entity_t *expression_is_variable(const expression_t *expression)
9423 if (expression->base.kind != EXPR_REFERENCE) {
9426 entity_t *entity = expression->reference.entity;
9427 if (entity->kind != ENTITY_VARIABLE)
9433 static void err_or_warn(source_position_t const *const pos, char const *const msg)
9435 if (c_mode & _CXX || strict_mode) {
9438 warningf(WARN_OTHER, pos, msg);
9443 * Parse a return statement.
9445 static statement_t *parse_return(void)
9447 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9450 expression_t *return_value = NULL;
9451 if (token.kind != ';') {
9452 return_value = parse_expression();
9453 mark_vars_read(return_value, NULL);
9456 const type_t *const func_type = skip_typeref(current_function->base.type);
9457 assert(is_type_function(func_type));
9458 type_t *const return_type = skip_typeref(func_type->function.return_type);
9460 source_position_t const *const pos = &statement->base.source_position;
9461 if (return_value != NULL) {
9462 type_t *return_value_type = skip_typeref(return_value->base.type);
9464 if (is_type_void(return_type)) {
9465 if (!is_type_void(return_value_type)) {
9466 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9467 /* Only warn in C mode, because GCC does the same */
9468 err_or_warn(pos, "'return' with a value, in function returning 'void'");
9469 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9470 /* Only warn in C mode, because GCC does the same */
9471 err_or_warn(pos, "'return' with expression in function returning 'void'");
9474 assign_error_t error = semantic_assign(return_type, return_value);
9475 report_assign_error(error, return_type, return_value, "'return'",
9478 return_value = create_implicit_cast(return_value, return_type);
9479 /* check for returning address of a local var */
9480 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9481 const expression_t *expression = return_value->unary.value;
9482 if (expression_is_local_variable(expression)) {
9483 warningf(WARN_OTHER, pos, "function returns address of local variable");
9486 } else if (!is_type_void(return_type)) {
9487 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9488 err_or_warn(pos, "'return' without value, in function returning non-void");
9490 statement->returns.value = return_value;
9497 * Parse a declaration statement.
9499 static statement_t *parse_declaration_statement(void)
9501 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9503 entity_t *before = current_scope->last_entity;
9505 parse_external_declaration();
9507 parse_declaration(record_entity, DECL_FLAGS_NONE);
9510 declaration_statement_t *const decl = &statement->declaration;
9511 entity_t *const begin =
9512 before != NULL ? before->base.next : current_scope->entities;
9513 decl->declarations_begin = begin;
9514 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9520 * Parse an expression statement, ie. expr ';'.
9522 static statement_t *parse_expression_statement(void)
9524 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9526 expression_t *const expr = parse_expression();
9527 statement->expression.expression = expr;
9528 mark_vars_read(expr, ENT_ANY);
9535 * Parse a microsoft __try { } __finally { } or
9536 * __try{ } __except() { }
9538 static statement_t *parse_ms_try_statment(void)
9540 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9543 PUSH_PARENT(statement);
9545 ms_try_statement_t *rem = current_try;
9546 current_try = &statement->ms_try;
9547 statement->ms_try.try_statement = parse_compound_statement(false);
9552 if (next_if(T___except)) {
9553 expression_t *const expr = parse_condition();
9554 type_t * type = skip_typeref(expr->base.type);
9555 if (is_type_integer(type)) {
9556 type = promote_integer(type);
9557 } else if (is_type_valid(type)) {
9558 errorf(&expr->base.source_position,
9559 "__expect expression is not an integer, but '%T'", type);
9560 type = type_error_type;
9562 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9563 } else if (!next_if(T__finally)) {
9564 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9566 statement->ms_try.final_statement = parse_compound_statement(false);
9570 static statement_t *parse_empty_statement(void)
9572 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9573 statement_t *const statement = create_empty_statement();
9578 static statement_t *parse_local_label_declaration(void)
9580 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9584 entity_t *begin = NULL;
9585 entity_t *end = NULL;
9586 entity_t **anchor = &begin;
9587 add_anchor_token(';');
9588 add_anchor_token(',');
9590 source_position_t pos;
9591 symbol_t *const symbol = expect_identifier("while parsing local label declaration", &pos);
9593 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9594 if (entity != NULL && entity->base.parent_scope == current_scope) {
9595 source_position_t const *const ppos = &entity->base.source_position;
9596 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9598 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol, &pos);
9599 entity->base.parent_scope = current_scope;
9602 anchor = &entity->base.next;
9605 environment_push(entity);
9608 } while (next_if(','));
9609 rem_anchor_token(',');
9610 rem_anchor_token(';');
9612 statement->declaration.declarations_begin = begin;
9613 statement->declaration.declarations_end = end;
9617 static void parse_namespace_definition(void)
9621 entity_t *entity = NULL;
9622 symbol_t *symbol = NULL;
9624 if (token.kind == T_IDENTIFIER) {
9625 symbol = token.base.symbol;
9626 entity = get_entity(symbol, NAMESPACE_NORMAL);
9627 if (entity && entity->kind != ENTITY_NAMESPACE) {
9629 if (entity->base.parent_scope == current_scope && is_entity_valid(entity)) {
9630 error_redefined_as_different_kind(HERE, entity, ENTITY_NAMESPACE);
9636 if (entity == NULL) {
9637 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol, HERE);
9638 entity->base.parent_scope = current_scope;
9641 if (token.kind == '=') {
9642 /* TODO: parse namespace alias */
9643 panic("namespace alias definition not supported yet");
9646 environment_push(entity);
9647 append_entity(current_scope, entity);
9649 PUSH_SCOPE(&entity->namespacee.members);
9650 PUSH_CURRENT_ENTITY(entity);
9652 add_anchor_token('}');
9655 rem_anchor_token('}');
9658 POP_CURRENT_ENTITY();
9663 * Parse a statement.
9664 * There's also parse_statement() which additionally checks for
9665 * "statement has no effect" warnings
9667 static statement_t *intern_parse_statement(void)
9669 /* declaration or statement */
9670 statement_t *statement;
9671 switch (token.kind) {
9672 case T_IDENTIFIER: {
9673 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9674 if (la1_type == ':') {
9675 statement = parse_label_statement();
9676 } else if (is_typedef_symbol(token.base.symbol)) {
9677 statement = parse_declaration_statement();
9679 /* it's an identifier, the grammar says this must be an
9680 * expression statement. However it is common that users mistype
9681 * declaration types, so we guess a bit here to improve robustness
9682 * for incorrect programs */
9686 if (get_entity(token.base.symbol, NAMESPACE_NORMAL) != NULL) {
9688 statement = parse_expression_statement();
9692 statement = parse_declaration_statement();
9700 case T___extension__: {
9701 /* This can be a prefix to a declaration or an expression statement.
9702 * We simply eat it now and parse the rest with tail recursion. */
9704 statement = intern_parse_statement();
9710 statement = parse_declaration_statement();
9714 statement = parse_local_label_declaration();
9717 case ';': statement = parse_empty_statement(); break;
9718 case '{': statement = parse_compound_statement(false); break;
9719 case T___leave: statement = parse_leave_statement(); break;
9720 case T___try: statement = parse_ms_try_statment(); break;
9721 case T_asm: statement = parse_asm_statement(); break;
9722 case T_break: statement = parse_break(); break;
9723 case T_case: statement = parse_case_statement(); break;
9724 case T_continue: statement = parse_continue(); break;
9725 case T_default: statement = parse_default_statement(); break;
9726 case T_do: statement = parse_do(); break;
9727 case T_for: statement = parse_for(); break;
9728 case T_goto: statement = parse_goto(); break;
9729 case T_if: statement = parse_if(); break;
9730 case T_return: statement = parse_return(); break;
9731 case T_switch: statement = parse_switch(); break;
9732 case T_while: statement = parse_while(); break;
9735 statement = parse_expression_statement();
9739 errorf(HERE, "unexpected token %K while parsing statement", &token);
9740 statement = create_error_statement();
9749 * parse a statement and emits "statement has no effect" warning if needed
9750 * (This is really a wrapper around intern_parse_statement with check for 1
9751 * single warning. It is needed, because for statement expressions we have
9752 * to avoid the warning on the last statement)
9754 static statement_t *parse_statement(void)
9756 statement_t *statement = intern_parse_statement();
9758 if (statement->kind == STATEMENT_EXPRESSION) {
9759 expression_t *expression = statement->expression.expression;
9760 if (!expression_has_effect(expression)) {
9761 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9769 * Parse a compound statement.
9771 static statement_t *parse_compound_statement(bool inside_expression_statement)
9773 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9775 PUSH_PARENT(statement);
9776 PUSH_SCOPE(&statement->compound.scope);
9779 add_anchor_token('}');
9780 /* tokens, which can start a statement */
9781 /* TODO MS, __builtin_FOO */
9782 add_anchor_token('!');
9783 add_anchor_token('&');
9784 add_anchor_token('(');
9785 add_anchor_token('*');
9786 add_anchor_token('+');
9787 add_anchor_token('-');
9788 add_anchor_token(';');
9789 add_anchor_token('{');
9790 add_anchor_token('~');
9791 add_anchor_token(T_CHARACTER_CONSTANT);
9792 add_anchor_token(T_COLONCOLON);
9793 add_anchor_token(T_FLOATINGPOINT);
9794 add_anchor_token(T_IDENTIFIER);
9795 add_anchor_token(T_INTEGER);
9796 add_anchor_token(T_MINUSMINUS);
9797 add_anchor_token(T_PLUSPLUS);
9798 add_anchor_token(T_STRING_LITERAL);
9799 add_anchor_token(T__Bool);
9800 add_anchor_token(T__Complex);
9801 add_anchor_token(T__Imaginary);
9802 add_anchor_token(T___FUNCTION__);
9803 add_anchor_token(T___PRETTY_FUNCTION__);
9804 add_anchor_token(T___alignof__);
9805 add_anchor_token(T___attribute__);
9806 add_anchor_token(T___builtin_va_start);
9807 add_anchor_token(T___extension__);
9808 add_anchor_token(T___func__);
9809 add_anchor_token(T___imag__);
9810 add_anchor_token(T___label__);
9811 add_anchor_token(T___real__);
9812 add_anchor_token(T___thread);
9813 add_anchor_token(T_asm);
9814 add_anchor_token(T_auto);
9815 add_anchor_token(T_bool);
9816 add_anchor_token(T_break);
9817 add_anchor_token(T_case);
9818 add_anchor_token(T_char);
9819 add_anchor_token(T_class);
9820 add_anchor_token(T_const);
9821 add_anchor_token(T_const_cast);
9822 add_anchor_token(T_continue);
9823 add_anchor_token(T_default);
9824 add_anchor_token(T_delete);
9825 add_anchor_token(T_double);
9826 add_anchor_token(T_do);
9827 add_anchor_token(T_dynamic_cast);
9828 add_anchor_token(T_enum);
9829 add_anchor_token(T_extern);
9830 add_anchor_token(T_false);
9831 add_anchor_token(T_float);
9832 add_anchor_token(T_for);
9833 add_anchor_token(T_goto);
9834 add_anchor_token(T_if);
9835 add_anchor_token(T_inline);
9836 add_anchor_token(T_int);
9837 add_anchor_token(T_long);
9838 add_anchor_token(T_new);
9839 add_anchor_token(T_operator);
9840 add_anchor_token(T_register);
9841 add_anchor_token(T_reinterpret_cast);
9842 add_anchor_token(T_restrict);
9843 add_anchor_token(T_return);
9844 add_anchor_token(T_short);
9845 add_anchor_token(T_signed);
9846 add_anchor_token(T_sizeof);
9847 add_anchor_token(T_static);
9848 add_anchor_token(T_static_cast);
9849 add_anchor_token(T_struct);
9850 add_anchor_token(T_switch);
9851 add_anchor_token(T_template);
9852 add_anchor_token(T_this);
9853 add_anchor_token(T_throw);
9854 add_anchor_token(T_true);
9855 add_anchor_token(T_try);
9856 add_anchor_token(T_typedef);
9857 add_anchor_token(T_typeid);
9858 add_anchor_token(T_typename);
9859 add_anchor_token(T_typeof);
9860 add_anchor_token(T_union);
9861 add_anchor_token(T_unsigned);
9862 add_anchor_token(T_using);
9863 add_anchor_token(T_void);
9864 add_anchor_token(T_volatile);
9865 add_anchor_token(T_wchar_t);
9866 add_anchor_token(T_while);
9868 statement_t **anchor = &statement->compound.statements;
9869 bool only_decls_so_far = true;
9870 while (token.kind != '}' && token.kind != T_EOF) {
9871 statement_t *sub_statement = intern_parse_statement();
9872 if (sub_statement->kind == STATEMENT_ERROR) {
9876 if (sub_statement->kind != STATEMENT_DECLARATION) {
9877 only_decls_so_far = false;
9878 } else if (!only_decls_so_far) {
9879 source_position_t const *const pos = &sub_statement->base.source_position;
9880 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
9883 *anchor = sub_statement;
9884 anchor = &sub_statement->base.next;
9888 /* look over all statements again to produce no effect warnings */
9889 if (is_warn_on(WARN_UNUSED_VALUE)) {
9890 statement_t *sub_statement = statement->compound.statements;
9891 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9892 if (sub_statement->kind != STATEMENT_EXPRESSION)
9894 /* don't emit a warning for the last expression in an expression
9895 * statement as it has always an effect */
9896 if (inside_expression_statement && sub_statement->base.next == NULL)
9899 expression_t *expression = sub_statement->expression.expression;
9900 if (!expression_has_effect(expression)) {
9901 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
9906 rem_anchor_token(T_while);
9907 rem_anchor_token(T_wchar_t);
9908 rem_anchor_token(T_volatile);
9909 rem_anchor_token(T_void);
9910 rem_anchor_token(T_using);
9911 rem_anchor_token(T_unsigned);
9912 rem_anchor_token(T_union);
9913 rem_anchor_token(T_typeof);
9914 rem_anchor_token(T_typename);
9915 rem_anchor_token(T_typeid);
9916 rem_anchor_token(T_typedef);
9917 rem_anchor_token(T_try);
9918 rem_anchor_token(T_true);
9919 rem_anchor_token(T_throw);
9920 rem_anchor_token(T_this);
9921 rem_anchor_token(T_template);
9922 rem_anchor_token(T_switch);
9923 rem_anchor_token(T_struct);
9924 rem_anchor_token(T_static_cast);
9925 rem_anchor_token(T_static);
9926 rem_anchor_token(T_sizeof);
9927 rem_anchor_token(T_signed);
9928 rem_anchor_token(T_short);
9929 rem_anchor_token(T_return);
9930 rem_anchor_token(T_restrict);
9931 rem_anchor_token(T_reinterpret_cast);
9932 rem_anchor_token(T_register);
9933 rem_anchor_token(T_operator);
9934 rem_anchor_token(T_new);
9935 rem_anchor_token(T_long);
9936 rem_anchor_token(T_int);
9937 rem_anchor_token(T_inline);
9938 rem_anchor_token(T_if);
9939 rem_anchor_token(T_goto);
9940 rem_anchor_token(T_for);
9941 rem_anchor_token(T_float);
9942 rem_anchor_token(T_false);
9943 rem_anchor_token(T_extern);
9944 rem_anchor_token(T_enum);
9945 rem_anchor_token(T_dynamic_cast);
9946 rem_anchor_token(T_do);
9947 rem_anchor_token(T_double);
9948 rem_anchor_token(T_delete);
9949 rem_anchor_token(T_default);
9950 rem_anchor_token(T_continue);
9951 rem_anchor_token(T_const_cast);
9952 rem_anchor_token(T_const);
9953 rem_anchor_token(T_class);
9954 rem_anchor_token(T_char);
9955 rem_anchor_token(T_case);
9956 rem_anchor_token(T_break);
9957 rem_anchor_token(T_bool);
9958 rem_anchor_token(T_auto);
9959 rem_anchor_token(T_asm);
9960 rem_anchor_token(T___thread);
9961 rem_anchor_token(T___real__);
9962 rem_anchor_token(T___label__);
9963 rem_anchor_token(T___imag__);
9964 rem_anchor_token(T___func__);
9965 rem_anchor_token(T___extension__);
9966 rem_anchor_token(T___builtin_va_start);
9967 rem_anchor_token(T___attribute__);
9968 rem_anchor_token(T___alignof__);
9969 rem_anchor_token(T___PRETTY_FUNCTION__);
9970 rem_anchor_token(T___FUNCTION__);
9971 rem_anchor_token(T__Imaginary);
9972 rem_anchor_token(T__Complex);
9973 rem_anchor_token(T__Bool);
9974 rem_anchor_token(T_STRING_LITERAL);
9975 rem_anchor_token(T_PLUSPLUS);
9976 rem_anchor_token(T_MINUSMINUS);
9977 rem_anchor_token(T_INTEGER);
9978 rem_anchor_token(T_IDENTIFIER);
9979 rem_anchor_token(T_FLOATINGPOINT);
9980 rem_anchor_token(T_COLONCOLON);
9981 rem_anchor_token(T_CHARACTER_CONSTANT);
9982 rem_anchor_token('~');
9983 rem_anchor_token('{');
9984 rem_anchor_token(';');
9985 rem_anchor_token('-');
9986 rem_anchor_token('+');
9987 rem_anchor_token('*');
9988 rem_anchor_token('(');
9989 rem_anchor_token('&');
9990 rem_anchor_token('!');
9991 rem_anchor_token('}');
9999 * Check for unused global static functions and variables
10001 static void check_unused_globals(void)
10003 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10006 for (const entity_t *entity = file_scope->entities; entity != NULL;
10007 entity = entity->base.next) {
10008 if (!is_declaration(entity))
10011 const declaration_t *declaration = &entity->declaration;
10012 if (declaration->used ||
10013 declaration->modifiers & DM_UNUSED ||
10014 declaration->modifiers & DM_USED ||
10015 declaration->storage_class != STORAGE_CLASS_STATIC)
10020 if (entity->kind == ENTITY_FUNCTION) {
10021 /* inhibit warning for static inline functions */
10022 if (entity->function.is_inline)
10025 why = WARN_UNUSED_FUNCTION;
10026 s = entity->function.statement != NULL ? "defined" : "declared";
10028 why = WARN_UNUSED_VARIABLE;
10032 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10036 static void parse_global_asm(void)
10038 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10041 add_anchor_token(';');
10042 add_anchor_token(')');
10043 add_anchor_token(T_STRING_LITERAL);
10046 rem_anchor_token(T_STRING_LITERAL);
10047 statement->asms.asm_text = parse_string_literals("global asm");
10048 statement->base.next = unit->global_asm;
10049 unit->global_asm = statement;
10051 rem_anchor_token(')');
10053 rem_anchor_token(';');
10057 static void parse_linkage_specification(void)
10061 source_position_t const pos = *HERE;
10062 char const *const linkage = parse_string_literals(NULL).begin;
10064 linkage_kind_t old_linkage = current_linkage;
10065 linkage_kind_t new_linkage;
10066 if (streq(linkage, "C")) {
10067 new_linkage = LINKAGE_C;
10068 } else if (streq(linkage, "C++")) {
10069 new_linkage = LINKAGE_CXX;
10071 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10072 new_linkage = LINKAGE_C;
10074 current_linkage = new_linkage;
10076 if (next_if('{')) {
10083 assert(current_linkage == new_linkage);
10084 current_linkage = old_linkage;
10087 static void parse_external(void)
10089 switch (token.kind) {
10091 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10092 parse_linkage_specification();
10094 DECLARATION_START_NO_EXTERN
10096 case T___extension__:
10097 /* tokens below are for implicit int */
10098 case '&': /* & x; -> int& x; (and error later, because C++ has no
10100 case '*': /* * x; -> int* x; */
10101 case '(': /* (x); -> int (x); */
10103 parse_external_declaration();
10109 parse_global_asm();
10113 parse_namespace_definition();
10117 if (!strict_mode) {
10118 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10125 errorf(HERE, "stray %K outside of function", &token);
10126 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10127 eat_until_matching_token(token.kind);
10133 static void parse_externals(void)
10135 add_anchor_token('}');
10136 add_anchor_token(T_EOF);
10139 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10140 unsigned short token_anchor_copy[T_LAST_TOKEN];
10141 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10144 while (token.kind != T_EOF && token.kind != '}') {
10146 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10147 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10149 /* the anchor set and its copy differs */
10150 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10153 if (in_gcc_extension) {
10154 /* an gcc extension scope was not closed */
10155 internal_errorf(HERE, "Leaked __extension__");
10162 rem_anchor_token(T_EOF);
10163 rem_anchor_token('}');
10167 * Parse a translation unit.
10169 static void parse_translation_unit(void)
10171 add_anchor_token(T_EOF);
10176 if (token.kind == T_EOF)
10179 errorf(HERE, "stray %K outside of function", &token);
10180 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10181 eat_until_matching_token(token.kind);
10186 void set_default_visibility(elf_visibility_tag_t visibility)
10188 default_visibility = visibility;
10194 * @return the translation unit or NULL if errors occurred.
10196 void start_parsing(void)
10198 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10199 label_stack = NEW_ARR_F(stack_entry_t, 0);
10200 diagnostic_count = 0;
10204 print_to_file(stderr);
10206 assert(unit == NULL);
10207 unit = allocate_ast_zero(sizeof(unit[0]));
10209 assert(file_scope == NULL);
10210 file_scope = &unit->scope;
10212 assert(current_scope == NULL);
10213 scope_push(&unit->scope);
10215 create_gnu_builtins();
10217 create_microsoft_intrinsics();
10220 translation_unit_t *finish_parsing(void)
10222 assert(current_scope == &unit->scope);
10225 assert(file_scope == &unit->scope);
10226 check_unused_globals();
10229 DEL_ARR_F(environment_stack);
10230 DEL_ARR_F(label_stack);
10232 translation_unit_t *result = unit;
10237 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10238 * are given length one. */
10239 static void complete_incomplete_arrays(void)
10241 size_t n = ARR_LEN(incomplete_arrays);
10242 for (size_t i = 0; i != n; ++i) {
10243 declaration_t *const decl = incomplete_arrays[i];
10244 type_t *const type = skip_typeref(decl->type);
10246 if (!is_type_incomplete(type))
10249 source_position_t const *const pos = &decl->base.source_position;
10250 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10252 type_t *const new_type = duplicate_type(type);
10253 new_type->array.size_constant = true;
10254 new_type->array.has_implicit_size = true;
10255 new_type->array.size = 1;
10257 type_t *const result = identify_new_type(new_type);
10259 decl->type = result;
10263 static void prepare_main_collect2(entity_t *const entity)
10265 PUSH_SCOPE(&entity->function.statement->compound.scope);
10267 // create call to __main
10268 symbol_t *symbol = symbol_table_insert("__main");
10269 entity_t *subsubmain_ent
10270 = create_implicit_function(symbol, &builtin_source_position);
10272 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10273 type_t *ftype = subsubmain_ent->declaration.type;
10274 ref->base.source_position = builtin_source_position;
10275 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10276 ref->reference.entity = subsubmain_ent;
10278 expression_t *call = allocate_expression_zero(EXPR_CALL);
10279 call->base.source_position = builtin_source_position;
10280 call->base.type = type_void;
10281 call->call.function = ref;
10283 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10284 expr_statement->base.source_position = builtin_source_position;
10285 expr_statement->expression.expression = call;
10287 statement_t *statement = entity->function.statement;
10288 assert(statement->kind == STATEMENT_COMPOUND);
10289 compound_statement_t *compounds = &statement->compound;
10291 expr_statement->base.next = compounds->statements;
10292 compounds->statements = expr_statement;
10299 lookahead_bufpos = 0;
10300 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10303 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10304 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10305 parse_translation_unit();
10306 complete_incomplete_arrays();
10307 DEL_ARR_F(incomplete_arrays);
10308 incomplete_arrays = NULL;
10312 * Initialize the parser.
10314 void init_parser(void)
10316 sym_anonymous = symbol_table_insert("<anonymous>");
10318 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10320 init_expression_parsers();
10321 obstack_init(&temp_obst);
10325 * Terminate the parser.
10327 void exit_parser(void)
10329 obstack_free(&temp_obst, NULL);