2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "attribute_t.h"
38 #include "lang_features.h"
39 #include "walk_statements.h"
42 #include "adt/bitfiddle.h"
43 #include "adt/error.h"
44 #include "adt/array.h"
46 //#define PRINT_TOKENS
47 #define MAX_LOOKAHEAD 1
52 entity_namespace_t namespc;
55 typedef struct declaration_specifiers_t declaration_specifiers_t;
56 struct declaration_specifiers_t {
57 source_position_t source_position;
58 storage_class_t storage_class;
59 unsigned char alignment; /**< Alignment, 0 if not set. */
61 bool thread_local : 1; /**< GCC __thread */
62 attribute_t *attributes; /**< list of attributes */
67 * An environment for parsing initializers (and compound literals).
69 typedef struct parse_initializer_env_t {
70 type_t *type; /**< the type of the initializer. In case of an
71 array type with unspecified size this gets
72 adjusted to the actual size. */
73 entity_t *entity; /**< the variable that is initialized if any */
74 bool must_be_constant;
75 } parse_initializer_env_t;
77 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
79 /** The current token. */
81 /** The lookahead ring-buffer. */
82 static token_t lookahead_buffer[MAX_LOOKAHEAD];
83 /** Position of the next token in the lookahead buffer. */
84 static size_t lookahead_bufpos;
85 static stack_entry_t *environment_stack = NULL;
86 static stack_entry_t *label_stack = NULL;
87 static scope_t *file_scope = NULL;
88 static scope_t *current_scope = NULL;
89 /** Point to the current function declaration if inside a function. */
90 static function_t *current_function = NULL;
91 static entity_t *current_entity = NULL;
92 static entity_t *current_init_decl = 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 = LINKAGE_INVALID;
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 a type property context (evaluation only for type) */
105 static bool in_type_prop = false;
106 /** true if we are in an __extension__ context. */
107 static bool in_gcc_extension = false;
108 static struct obstack temp_obst;
109 static entity_t *anonymous_entity;
110 static declaration_t **incomplete_arrays;
113 #define PUSH_PARENT(stmt) \
114 statement_t *const prev_parent = current_parent; \
115 ((void)(current_parent = (stmt)))
116 #define POP_PARENT ((void)(current_parent = prev_parent))
118 /** special symbol used for anonymous entities. */
119 static symbol_t *sym_anonymous = NULL;
121 /** The token anchor set */
122 static unsigned char token_anchor_set[T_LAST_TOKEN];
124 /** The current source position. */
125 #define HERE (&token.source_position)
127 /** true if we are in GCC mode. */
128 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
130 static statement_t *parse_compound_statement(bool inside_expression_statement);
131 static statement_t *parse_statement(void);
133 static expression_t *parse_subexpression(precedence_t);
134 static expression_t *parse_expression(void);
135 static type_t *parse_typename(void);
136 static void parse_externals(void);
137 static void parse_external(void);
139 static void parse_compound_type_entries(compound_t *compound_declaration);
141 static void check_call_argument(type_t *expected_type,
142 call_argument_t *argument, unsigned pos);
144 typedef enum declarator_flags_t {
146 DECL_MAY_BE_ABSTRACT = 1U << 0,
147 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
148 DECL_IS_PARAMETER = 1U << 2
149 } declarator_flags_t;
151 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
152 declarator_flags_t flags);
154 static void semantic_comparison(binary_expression_t *expression);
156 #define STORAGE_CLASSES \
157 STORAGE_CLASSES_NO_EXTERN \
160 #define STORAGE_CLASSES_NO_EXTERN \
167 #define TYPE_QUALIFIERS \
172 case T__forceinline: \
173 case T___attribute__:
175 #define COMPLEX_SPECIFIERS \
177 #define IMAGINARY_SPECIFIERS \
180 #define TYPE_SPECIFIERS \
182 case T___builtin_va_list: \
207 #define DECLARATION_START \
212 #define DECLARATION_START_NO_EXTERN \
213 STORAGE_CLASSES_NO_EXTERN \
217 #define TYPENAME_START \
221 #define EXPRESSION_START \
230 case T_CHARACTER_CONSTANT: \
231 case T_FLOATINGPOINT: \
232 case T_FLOATINGPOINT_HEXADECIMAL: \
234 case T_INTEGER_HEXADECIMAL: \
235 case T_INTEGER_OCTAL: \
238 case T_STRING_LITERAL: \
239 case T_WIDE_CHARACTER_CONSTANT: \
240 case T_WIDE_STRING_LITERAL: \
241 case T___FUNCDNAME__: \
242 case T___FUNCSIG__: \
243 case T___FUNCTION__: \
244 case T___PRETTY_FUNCTION__: \
245 case T___alignof__: \
246 case T___builtin_classify_type: \
247 case T___builtin_constant_p: \
248 case T___builtin_isgreater: \
249 case T___builtin_isgreaterequal: \
250 case T___builtin_isless: \
251 case T___builtin_islessequal: \
252 case T___builtin_islessgreater: \
253 case T___builtin_isunordered: \
254 case T___builtin_offsetof: \
255 case T___builtin_va_arg: \
256 case T___builtin_va_copy: \
257 case T___builtin_va_start: \
268 * Returns the size of a statement node.
270 * @param kind the statement kind
272 static size_t get_statement_struct_size(statement_kind_t kind)
274 static const size_t sizes[] = {
275 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
276 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
277 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
278 [STATEMENT_RETURN] = sizeof(return_statement_t),
279 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
280 [STATEMENT_IF] = sizeof(if_statement_t),
281 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
282 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
283 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
284 [STATEMENT_BREAK] = sizeof(statement_base_t),
285 [STATEMENT_GOTO] = sizeof(goto_statement_t),
286 [STATEMENT_LABEL] = sizeof(label_statement_t),
287 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
288 [STATEMENT_WHILE] = sizeof(while_statement_t),
289 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
290 [STATEMENT_FOR] = sizeof(for_statement_t),
291 [STATEMENT_ASM] = sizeof(asm_statement_t),
292 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
293 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
295 assert(kind < lengthof(sizes));
296 assert(sizes[kind] != 0);
301 * Returns the size of an expression node.
303 * @param kind the expression kind
305 static size_t get_expression_struct_size(expression_kind_t kind)
307 static const size_t sizes[] = {
308 [EXPR_INVALID] = sizeof(expression_base_t),
309 [EXPR_REFERENCE] = sizeof(reference_expression_t),
310 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
311 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
312 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
313 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
314 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
315 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
316 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
317 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
318 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
319 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
320 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
321 [EXPR_CALL] = sizeof(call_expression_t),
322 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
323 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
324 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
325 [EXPR_SELECT] = sizeof(select_expression_t),
326 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
327 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
328 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
329 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
330 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
331 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
332 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
333 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
334 [EXPR_VA_START] = sizeof(va_start_expression_t),
335 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
336 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
337 [EXPR_STATEMENT] = sizeof(statement_expression_t),
338 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
340 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
341 return sizes[EXPR_UNARY_FIRST];
343 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
344 return sizes[EXPR_BINARY_FIRST];
346 assert(kind < lengthof(sizes));
347 assert(sizes[kind] != 0);
352 * Allocate a statement node of given kind and initialize all
353 * fields with zero. Sets its source position to the position
354 * of the current token.
356 static statement_t *allocate_statement_zero(statement_kind_t kind)
358 size_t size = get_statement_struct_size(kind);
359 statement_t *res = allocate_ast_zero(size);
361 res->base.kind = kind;
362 res->base.parent = current_parent;
363 res->base.source_position = token.source_position;
368 * Allocate an expression node of given kind and initialize all
371 * @param kind the kind of the expression to allocate
373 static expression_t *allocate_expression_zero(expression_kind_t kind)
375 size_t size = get_expression_struct_size(kind);
376 expression_t *res = allocate_ast_zero(size);
378 res->base.kind = kind;
379 res->base.type = type_error_type;
380 res->base.source_position = token.source_position;
385 * Creates a new invalid expression at the source position
386 * of the current token.
388 static expression_t *create_invalid_expression(void)
390 return allocate_expression_zero(EXPR_INVALID);
394 * Creates a new invalid statement.
396 static statement_t *create_invalid_statement(void)
398 return allocate_statement_zero(STATEMENT_INVALID);
402 * Allocate a new empty statement.
404 static statement_t *create_empty_statement(void)
406 return allocate_statement_zero(STATEMENT_EMPTY);
409 static function_parameter_t *allocate_parameter(type_t *const type)
411 function_parameter_t *const param
412 = obstack_alloc(type_obst, sizeof(*param));
413 memset(param, 0, sizeof(*param));
419 * Returns the size of an initializer node.
421 * @param kind the initializer kind
423 static size_t get_initializer_size(initializer_kind_t kind)
425 static const size_t sizes[] = {
426 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
427 [INITIALIZER_STRING] = sizeof(initializer_string_t),
428 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
429 [INITIALIZER_LIST] = sizeof(initializer_list_t),
430 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
432 assert(kind < lengthof(sizes));
433 assert(sizes[kind] != 0);
438 * Allocate an initializer node of given kind and initialize all
441 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
443 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
450 * Returns the index of the top element of the environment stack.
452 static size_t environment_top(void)
454 return ARR_LEN(environment_stack);
458 * Returns the index of the top element of the global label stack.
460 static size_t label_top(void)
462 return ARR_LEN(label_stack);
466 * Return the next token.
468 static inline void next_token(void)
470 token = lookahead_buffer[lookahead_bufpos];
471 lookahead_buffer[lookahead_bufpos] = lexer_token;
474 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
477 print_token(stderr, &token);
478 fprintf(stderr, "\n");
482 static inline bool next_if(int const type)
484 if (token.type == type) {
493 * Return the next token with a given lookahead.
495 static inline const token_t *look_ahead(size_t num)
497 assert(0 < num && num <= MAX_LOOKAHEAD);
498 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
499 return &lookahead_buffer[pos];
503 * Adds a token type to the token type anchor set (a multi-set).
505 static void add_anchor_token(int token_type)
507 assert(0 <= token_type && token_type < T_LAST_TOKEN);
508 ++token_anchor_set[token_type];
512 * Set the number of tokens types of the given type
513 * to zero and return the old count.
515 static int save_and_reset_anchor_state(int token_type)
517 assert(0 <= token_type && token_type < T_LAST_TOKEN);
518 int count = token_anchor_set[token_type];
519 token_anchor_set[token_type] = 0;
524 * Restore the number of token types to the given count.
526 static void restore_anchor_state(int token_type, int count)
528 assert(0 <= token_type && token_type < T_LAST_TOKEN);
529 token_anchor_set[token_type] = count;
533 * Remove a token type from the token type anchor set (a multi-set).
535 static void rem_anchor_token(int token_type)
537 assert(0 <= token_type && token_type < T_LAST_TOKEN);
538 assert(token_anchor_set[token_type] != 0);
539 --token_anchor_set[token_type];
543 * Return true if the token type of the current token is
546 static bool at_anchor(void)
550 return token_anchor_set[token.type];
554 * Eat tokens until a matching token type is found.
556 static void eat_until_matching_token(int type)
560 case '(': end_token = ')'; break;
561 case '{': end_token = '}'; break;
562 case '[': end_token = ']'; break;
563 default: end_token = type; break;
566 unsigned parenthesis_count = 0;
567 unsigned brace_count = 0;
568 unsigned bracket_count = 0;
569 while (token.type != end_token ||
570 parenthesis_count != 0 ||
572 bracket_count != 0) {
573 switch (token.type) {
575 case '(': ++parenthesis_count; break;
576 case '{': ++brace_count; break;
577 case '[': ++bracket_count; break;
580 if (parenthesis_count > 0)
590 if (bracket_count > 0)
593 if (token.type == end_token &&
594 parenthesis_count == 0 &&
608 * Eat input tokens until an anchor is found.
610 static void eat_until_anchor(void)
612 while (token_anchor_set[token.type] == 0) {
613 if (token.type == '(' || token.type == '{' || token.type == '[')
614 eat_until_matching_token(token.type);
620 * Eat a whole block from input tokens.
622 static void eat_block(void)
624 eat_until_matching_token('{');
628 #define eat(token_type) (assert(token.type == (token_type)), next_token())
631 * Report a parse error because an expected token was not found.
634 #if defined __GNUC__ && __GNUC__ >= 4
635 __attribute__((sentinel))
637 void parse_error_expected(const char *message, ...)
639 if (message != NULL) {
640 errorf(HERE, "%s", message);
643 va_start(ap, message);
644 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
649 * Report an incompatible type.
651 static void type_error_incompatible(const char *msg,
652 const source_position_t *source_position, type_t *type1, type_t *type2)
654 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
659 * Expect the current token is the expected token.
660 * If not, generate an error, eat the current statement,
661 * and goto the error_label label.
663 #define expect(expected, error_label) \
665 if (UNLIKELY(token.type != (expected))) { \
666 parse_error_expected(NULL, (expected), NULL); \
667 add_anchor_token(expected); \
668 eat_until_anchor(); \
669 next_if((expected)); \
670 rem_anchor_token(expected); \
677 * Push a given scope on the scope stack and make it the
680 static scope_t *scope_push(scope_t *new_scope)
682 if (current_scope != NULL) {
683 new_scope->depth = current_scope->depth + 1;
686 scope_t *old_scope = current_scope;
687 current_scope = new_scope;
692 * Pop the current scope from the scope stack.
694 static void scope_pop(scope_t *old_scope)
696 current_scope = old_scope;
700 * Search an entity by its symbol in a given namespace.
702 static entity_t *get_entity(const symbol_t *const symbol,
703 namespace_tag_t namespc)
705 entity_t *entity = symbol->entity;
706 for (; entity != NULL; entity = entity->base.symbol_next) {
707 if (entity->base.namespc == namespc)
714 /* §6.2.3:1 24) There is only one name space for tags even though three are
716 static entity_t *get_tag(symbol_t const *const symbol,
717 entity_kind_tag_t const kind)
719 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
720 if (entity != NULL && entity->kind != kind) {
722 "'%Y' defined as wrong kind of tag (previous definition %P)",
723 symbol, &entity->base.source_position);
730 * pushs an entity on the environment stack and links the corresponding symbol
733 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
735 symbol_t *symbol = entity->base.symbol;
736 entity_namespace_t namespc = entity->base.namespc;
737 assert(namespc != NAMESPACE_INVALID);
739 /* replace/add entity into entity list of the symbol */
742 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
747 /* replace an entry? */
748 if (iter->base.namespc == namespc) {
749 entity->base.symbol_next = iter->base.symbol_next;
755 /* remember old declaration */
757 entry.symbol = symbol;
758 entry.old_entity = iter;
759 entry.namespc = namespc;
760 ARR_APP1(stack_entry_t, *stack_ptr, entry);
764 * Push an entity on the environment stack.
766 static void environment_push(entity_t *entity)
768 assert(entity->base.source_position.input_name != NULL);
769 assert(entity->base.parent_scope != NULL);
770 stack_push(&environment_stack, entity);
774 * Push a declaration on the global label stack.
776 * @param declaration the declaration
778 static void label_push(entity_t *label)
780 /* we abuse the parameters scope as parent for the labels */
781 label->base.parent_scope = ¤t_function->parameters;
782 stack_push(&label_stack, label);
786 * pops symbols from the environment stack until @p new_top is the top element
788 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
790 stack_entry_t *stack = *stack_ptr;
791 size_t top = ARR_LEN(stack);
794 assert(new_top <= top);
798 for (i = top; i > new_top; --i) {
799 stack_entry_t *entry = &stack[i - 1];
801 entity_t *old_entity = entry->old_entity;
802 symbol_t *symbol = entry->symbol;
803 entity_namespace_t namespc = entry->namespc;
805 /* replace with old_entity/remove */
808 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
810 assert(iter != NULL);
811 /* replace an entry? */
812 if (iter->base.namespc == namespc)
816 /* restore definition from outer scopes (if there was one) */
817 if (old_entity != NULL) {
818 old_entity->base.symbol_next = iter->base.symbol_next;
819 *anchor = old_entity;
821 /* remove entry from list */
822 *anchor = iter->base.symbol_next;
826 ARR_SHRINKLEN(*stack_ptr, new_top);
830 * Pop all entries from the environment stack until the new_top
833 * @param new_top the new stack top
835 static void environment_pop_to(size_t new_top)
837 stack_pop_to(&environment_stack, new_top);
841 * Pop all entries from the global label stack until the new_top
844 * @param new_top the new stack top
846 static void label_pop_to(size_t new_top)
848 stack_pop_to(&label_stack, new_top);
851 static int get_akind_rank(atomic_type_kind_t akind)
857 * Return the type rank for an atomic type.
859 static int get_rank(const type_t *type)
861 assert(!is_typeref(type));
862 if (type->kind == TYPE_ENUM)
863 return get_akind_rank(type->enumt.akind);
865 assert(type->kind == TYPE_ATOMIC);
866 return get_akind_rank(type->atomic.akind);
870 * §6.3.1.1:2 Do integer promotion for a given type.
872 * @param type the type to promote
873 * @return the promoted type
875 static type_t *promote_integer(type_t *type)
877 if (type->kind == TYPE_BITFIELD)
878 type = type->bitfield.base_type;
880 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
887 * Create a cast expression.
889 * @param expression the expression to cast
890 * @param dest_type the destination type
892 static expression_t *create_cast_expression(expression_t *expression,
895 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
897 cast->unary.value = expression;
898 cast->base.type = dest_type;
904 * Check if a given expression represents a null pointer constant.
906 * @param expression the expression to check
908 static bool is_null_pointer_constant(const expression_t *expression)
910 /* skip void* cast */
911 if (expression->kind == EXPR_UNARY_CAST ||
912 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
913 type_t *const type = skip_typeref(expression->base.type);
914 if (types_compatible(type, type_void_ptr))
915 expression = expression->unary.value;
918 type_t *const type = skip_typeref(expression->base.type);
920 is_type_integer(type) &&
921 is_constant_expression(expression) &&
922 !fold_constant_to_bool(expression);
926 * Create an implicit cast expression.
928 * @param expression the expression to cast
929 * @param dest_type the destination type
931 static expression_t *create_implicit_cast(expression_t *expression,
934 type_t *const source_type = expression->base.type;
936 if (source_type == dest_type)
939 return create_cast_expression(expression, dest_type);
942 typedef enum assign_error_t {
944 ASSIGN_ERROR_INCOMPATIBLE,
945 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
946 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
947 ASSIGN_WARNING_POINTER_FROM_INT,
948 ASSIGN_WARNING_INT_FROM_POINTER
951 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
952 const expression_t *const right,
954 const source_position_t *source_position)
956 type_t *const orig_type_right = right->base.type;
957 type_t *const type_left = skip_typeref(orig_type_left);
958 type_t *const type_right = skip_typeref(orig_type_right);
963 case ASSIGN_ERROR_INCOMPATIBLE:
964 errorf(source_position,
965 "destination type '%T' in %s is incompatible with type '%T'",
966 orig_type_left, context, orig_type_right);
969 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
971 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
972 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
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 warningf(source_position,
978 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
979 orig_type_left, context, orig_type_right, missing_qualifiers);
984 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
986 warningf(source_position,
987 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
988 orig_type_left, context, right, orig_type_right);
992 case ASSIGN_WARNING_POINTER_FROM_INT:
994 warningf(source_position,
995 "%s makes pointer '%T' from integer '%T' without a cast",
996 context, orig_type_left, orig_type_right);
1000 case ASSIGN_WARNING_INT_FROM_POINTER:
1001 if (warning.other) {
1002 warningf(source_position,
1003 "%s makes integer '%T' from pointer '%T' without a cast",
1004 context, orig_type_left, orig_type_right);
1009 panic("invalid error value");
1013 /** Implements the rules from §6.5.16.1 */
1014 static assign_error_t semantic_assign(type_t *orig_type_left,
1015 const expression_t *const right)
1017 type_t *const orig_type_right = right->base.type;
1018 type_t *const type_left = skip_typeref(orig_type_left);
1019 type_t *const type_right = skip_typeref(orig_type_right);
1021 if (is_type_pointer(type_left)) {
1022 if (is_null_pointer_constant(right)) {
1023 return ASSIGN_SUCCESS;
1024 } else if (is_type_pointer(type_right)) {
1025 type_t *points_to_left
1026 = skip_typeref(type_left->pointer.points_to);
1027 type_t *points_to_right
1028 = skip_typeref(type_right->pointer.points_to);
1029 assign_error_t res = ASSIGN_SUCCESS;
1031 /* the left type has all qualifiers from the right type */
1032 unsigned missing_qualifiers
1033 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1034 if (missing_qualifiers != 0) {
1035 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1038 points_to_left = get_unqualified_type(points_to_left);
1039 points_to_right = get_unqualified_type(points_to_right);
1041 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1044 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1045 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1046 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1049 if (!types_compatible(points_to_left, points_to_right)) {
1050 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1054 } else if (is_type_integer(type_right)) {
1055 return ASSIGN_WARNING_POINTER_FROM_INT;
1057 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1058 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1059 && is_type_pointer(type_right))) {
1060 return ASSIGN_SUCCESS;
1061 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1062 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1063 type_t *const unqual_type_left = get_unqualified_type(type_left);
1064 type_t *const unqual_type_right = get_unqualified_type(type_right);
1065 if (types_compatible(unqual_type_left, unqual_type_right)) {
1066 return ASSIGN_SUCCESS;
1068 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1069 return ASSIGN_WARNING_INT_FROM_POINTER;
1072 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1073 return ASSIGN_SUCCESS;
1075 return ASSIGN_ERROR_INCOMPATIBLE;
1078 static expression_t *parse_constant_expression(void)
1080 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1082 if (!is_constant_expression(result)) {
1083 errorf(&result->base.source_position,
1084 "expression '%E' is not constant", result);
1090 static expression_t *parse_assignment_expression(void)
1092 return parse_subexpression(PREC_ASSIGNMENT);
1095 static void warn_string_concat(const source_position_t *pos)
1097 if (warning.traditional) {
1098 warningf(pos, "traditional C rejects string constant concatenation");
1102 static string_t parse_string_literals(void)
1104 assert(token.type == T_STRING_LITERAL);
1105 string_t result = token.literal;
1109 while (token.type == T_STRING_LITERAL) {
1110 warn_string_concat(&token.source_position);
1111 result = concat_strings(&result, &token.literal);
1119 * compare two string, ignoring double underscores on the second.
1121 static int strcmp_underscore(const char *s1, const char *s2)
1123 if (s2[0] == '_' && s2[1] == '_') {
1124 size_t len2 = strlen(s2);
1125 size_t len1 = strlen(s1);
1126 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1127 return strncmp(s1, s2+2, len2-4);
1131 return strcmp(s1, s2);
1134 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1136 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1137 attribute->kind = kind;
1142 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1145 * __attribute__ ( ( attribute-list ) )
1149 * attribute_list , attrib
1154 * any-word ( identifier )
1155 * any-word ( identifier , nonempty-expr-list )
1156 * any-word ( expr-list )
1158 * where the "identifier" must not be declared as a type, and
1159 * "any-word" may be any identifier (including one declared as a
1160 * type), a reserved word storage class specifier, type specifier or
1161 * type qualifier. ??? This still leaves out most reserved keywords
1162 * (following the old parser), shouldn't we include them, and why not
1163 * allow identifiers declared as types to start the arguments?
1165 * Matze: this all looks confusing and little systematic, so we're even less
1166 * strict and parse any list of things which are identifiers or
1167 * (assignment-)expressions.
1169 static attribute_argument_t *parse_attribute_arguments(void)
1171 attribute_argument_t *first = NULL;
1172 attribute_argument_t **anchor = &first;
1173 if (token.type != ')') do {
1174 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1176 /* is it an identifier */
1177 if (token.type == T_IDENTIFIER
1178 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1179 symbol_t *symbol = token.symbol;
1180 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1181 argument->v.symbol = symbol;
1184 /* must be an expression */
1185 expression_t *expression = parse_assignment_expression();
1187 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1188 argument->v.expression = expression;
1191 /* append argument */
1193 anchor = &argument->next;
1194 } while (next_if(','));
1195 expect(')', end_error);
1204 static attribute_t *parse_attribute_asm(void)
1208 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1210 expect('(', end_error);
1211 attribute->a.arguments = parse_attribute_arguments();
1218 static symbol_t *get_symbol_from_token(void)
1220 switch(token.type) {
1222 return token.symbol;
1251 /* maybe we need more tokens ... add them on demand */
1252 return get_token_symbol(&token);
1258 static attribute_t *parse_attribute_gnu_single(void)
1260 /* parse "any-word" */
1261 symbol_t *symbol = get_symbol_from_token();
1262 if (symbol == NULL) {
1263 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1267 const char *name = symbol->string;
1270 attribute_kind_t kind;
1271 for (kind = ATTRIBUTE_GNU_FIRST; kind <= ATTRIBUTE_GNU_LAST; ++kind) {
1272 const char *attribute_name = get_attribute_name(kind);
1273 if (attribute_name != NULL
1274 && strcmp_underscore(attribute_name, name) == 0)
1278 if (kind >= ATTRIBUTE_GNU_LAST) {
1279 if (warning.attribute) {
1280 warningf(HERE, "unknown attribute '%s' ignored", name);
1282 /* TODO: we should still save the attribute in the list... */
1283 kind = ATTRIBUTE_UNKNOWN;
1286 attribute_t *attribute = allocate_attribute_zero(kind);
1288 /* parse arguments */
1290 attribute->a.arguments = parse_attribute_arguments();
1295 static attribute_t *parse_attribute_gnu(void)
1297 attribute_t *first = NULL;
1298 attribute_t **anchor = &first;
1300 eat(T___attribute__);
1301 expect('(', end_error);
1302 expect('(', end_error);
1304 if (token.type != ')') do {
1305 attribute_t *attribute = parse_attribute_gnu_single();
1306 if (attribute == NULL)
1309 *anchor = attribute;
1310 anchor = &attribute->next;
1311 } while (next_if(','));
1312 expect(')', end_error);
1313 expect(')', end_error);
1319 /** Parse attributes. */
1320 static attribute_t *parse_attributes(attribute_t *first)
1322 attribute_t **anchor = &first;
1324 while (*anchor != NULL)
1325 anchor = &(*anchor)->next;
1327 attribute_t *attribute;
1328 switch (token.type) {
1329 case T___attribute__:
1330 attribute = parse_attribute_gnu();
1334 attribute = parse_attribute_asm();
1339 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1344 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1347 case T__forceinline:
1349 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1354 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1359 /* TODO record modifier */
1361 warningf(HERE, "Ignoring declaration modifier %K", &token);
1362 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1369 *anchor = attribute;
1370 anchor = &attribute->next;
1374 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1376 static entity_t *determine_lhs_ent(expression_t *const expr,
1379 switch (expr->kind) {
1380 case EXPR_REFERENCE: {
1381 entity_t *const entity = expr->reference.entity;
1382 /* we should only find variables as lvalues... */
1383 if (entity->base.kind != ENTITY_VARIABLE
1384 && entity->base.kind != ENTITY_PARAMETER)
1390 case EXPR_ARRAY_ACCESS: {
1391 expression_t *const ref = expr->array_access.array_ref;
1392 entity_t * ent = NULL;
1393 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1394 ent = determine_lhs_ent(ref, lhs_ent);
1397 mark_vars_read(expr->select.compound, lhs_ent);
1399 mark_vars_read(expr->array_access.index, lhs_ent);
1404 if (is_type_compound(skip_typeref(expr->base.type))) {
1405 return determine_lhs_ent(expr->select.compound, lhs_ent);
1407 mark_vars_read(expr->select.compound, lhs_ent);
1412 case EXPR_UNARY_DEREFERENCE: {
1413 expression_t *const val = expr->unary.value;
1414 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1416 return determine_lhs_ent(val->unary.value, lhs_ent);
1418 mark_vars_read(val, NULL);
1424 mark_vars_read(expr, NULL);
1429 #define ENT_ANY ((entity_t*)-1)
1432 * Mark declarations, which are read. This is used to detect variables, which
1436 * x is not marked as "read", because it is only read to calculate its own new
1440 * x and y are not detected as "not read", because multiple variables are
1443 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1445 switch (expr->kind) {
1446 case EXPR_REFERENCE: {
1447 entity_t *const entity = expr->reference.entity;
1448 if (entity->kind != ENTITY_VARIABLE
1449 && entity->kind != ENTITY_PARAMETER)
1452 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1453 if (entity->kind == ENTITY_VARIABLE) {
1454 entity->variable.read = true;
1456 entity->parameter.read = true;
1463 // TODO respect pure/const
1464 mark_vars_read(expr->call.function, NULL);
1465 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1466 mark_vars_read(arg->expression, NULL);
1470 case EXPR_CONDITIONAL:
1471 // TODO lhs_decl should depend on whether true/false have an effect
1472 mark_vars_read(expr->conditional.condition, NULL);
1473 if (expr->conditional.true_expression != NULL)
1474 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1475 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1479 if (lhs_ent == ENT_ANY
1480 && !is_type_compound(skip_typeref(expr->base.type)))
1482 mark_vars_read(expr->select.compound, lhs_ent);
1485 case EXPR_ARRAY_ACCESS: {
1486 expression_t *const ref = expr->array_access.array_ref;
1487 mark_vars_read(ref, lhs_ent);
1488 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1489 mark_vars_read(expr->array_access.index, lhs_ent);
1494 mark_vars_read(expr->va_arge.ap, lhs_ent);
1498 mark_vars_read(expr->va_copye.src, lhs_ent);
1501 case EXPR_UNARY_CAST:
1502 /* Special case: Use void cast to mark a variable as "read" */
1503 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1508 case EXPR_UNARY_THROW:
1509 if (expr->unary.value == NULL)
1512 case EXPR_UNARY_DEREFERENCE:
1513 case EXPR_UNARY_DELETE:
1514 case EXPR_UNARY_DELETE_ARRAY:
1515 if (lhs_ent == ENT_ANY)
1519 case EXPR_UNARY_NEGATE:
1520 case EXPR_UNARY_PLUS:
1521 case EXPR_UNARY_BITWISE_NEGATE:
1522 case EXPR_UNARY_NOT:
1523 case EXPR_UNARY_TAKE_ADDRESS:
1524 case EXPR_UNARY_POSTFIX_INCREMENT:
1525 case EXPR_UNARY_POSTFIX_DECREMENT:
1526 case EXPR_UNARY_PREFIX_INCREMENT:
1527 case EXPR_UNARY_PREFIX_DECREMENT:
1528 case EXPR_UNARY_CAST_IMPLICIT:
1529 case EXPR_UNARY_ASSUME:
1531 mark_vars_read(expr->unary.value, lhs_ent);
1534 case EXPR_BINARY_ADD:
1535 case EXPR_BINARY_SUB:
1536 case EXPR_BINARY_MUL:
1537 case EXPR_BINARY_DIV:
1538 case EXPR_BINARY_MOD:
1539 case EXPR_BINARY_EQUAL:
1540 case EXPR_BINARY_NOTEQUAL:
1541 case EXPR_BINARY_LESS:
1542 case EXPR_BINARY_LESSEQUAL:
1543 case EXPR_BINARY_GREATER:
1544 case EXPR_BINARY_GREATEREQUAL:
1545 case EXPR_BINARY_BITWISE_AND:
1546 case EXPR_BINARY_BITWISE_OR:
1547 case EXPR_BINARY_BITWISE_XOR:
1548 case EXPR_BINARY_LOGICAL_AND:
1549 case EXPR_BINARY_LOGICAL_OR:
1550 case EXPR_BINARY_SHIFTLEFT:
1551 case EXPR_BINARY_SHIFTRIGHT:
1552 case EXPR_BINARY_COMMA:
1553 case EXPR_BINARY_ISGREATER:
1554 case EXPR_BINARY_ISGREATEREQUAL:
1555 case EXPR_BINARY_ISLESS:
1556 case EXPR_BINARY_ISLESSEQUAL:
1557 case EXPR_BINARY_ISLESSGREATER:
1558 case EXPR_BINARY_ISUNORDERED:
1559 mark_vars_read(expr->binary.left, lhs_ent);
1560 mark_vars_read(expr->binary.right, lhs_ent);
1563 case EXPR_BINARY_ASSIGN:
1564 case EXPR_BINARY_MUL_ASSIGN:
1565 case EXPR_BINARY_DIV_ASSIGN:
1566 case EXPR_BINARY_MOD_ASSIGN:
1567 case EXPR_BINARY_ADD_ASSIGN:
1568 case EXPR_BINARY_SUB_ASSIGN:
1569 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1570 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1571 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1572 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1573 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1574 if (lhs_ent == ENT_ANY)
1576 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1577 mark_vars_read(expr->binary.right, lhs_ent);
1582 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1588 case EXPR_STRING_LITERAL:
1589 case EXPR_WIDE_STRING_LITERAL:
1590 case EXPR_COMPOUND_LITERAL: // TODO init?
1592 case EXPR_CLASSIFY_TYPE:
1595 case EXPR_BUILTIN_CONSTANT_P:
1596 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1598 case EXPR_STATEMENT: // TODO
1599 case EXPR_LABEL_ADDRESS:
1600 case EXPR_REFERENCE_ENUM_VALUE:
1604 panic("unhandled expression");
1607 static designator_t *parse_designation(void)
1609 designator_t *result = NULL;
1610 designator_t **anchor = &result;
1613 designator_t *designator;
1614 switch (token.type) {
1616 designator = allocate_ast_zero(sizeof(designator[0]));
1617 designator->source_position = token.source_position;
1619 add_anchor_token(']');
1620 designator->array_index = parse_constant_expression();
1621 rem_anchor_token(']');
1622 expect(']', end_error);
1625 designator = allocate_ast_zero(sizeof(designator[0]));
1626 designator->source_position = token.source_position;
1628 if (token.type != T_IDENTIFIER) {
1629 parse_error_expected("while parsing designator",
1630 T_IDENTIFIER, NULL);
1633 designator->symbol = token.symbol;
1637 expect('=', end_error);
1641 assert(designator != NULL);
1642 *anchor = designator;
1643 anchor = &designator->next;
1649 static initializer_t *initializer_from_string(array_type_t *const type,
1650 const string_t *const string)
1652 /* TODO: check len vs. size of array type */
1655 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1656 initializer->string.string = *string;
1661 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1662 const string_t *const string)
1664 /* TODO: check len vs. size of array type */
1667 initializer_t *const initializer =
1668 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1669 initializer->wide_string.string = *string;
1675 * Build an initializer from a given expression.
1677 static initializer_t *initializer_from_expression(type_t *orig_type,
1678 expression_t *expression)
1680 /* TODO check that expression is a constant expression */
1682 /* §6.7.8.14/15 char array may be initialized by string literals */
1683 type_t *type = skip_typeref(orig_type);
1684 type_t *expr_type_orig = expression->base.type;
1685 type_t *expr_type = skip_typeref(expr_type_orig);
1687 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1688 array_type_t *const array_type = &type->array;
1689 type_t *const element_type = skip_typeref(array_type->element_type);
1691 if (element_type->kind == TYPE_ATOMIC) {
1692 atomic_type_kind_t akind = element_type->atomic.akind;
1693 switch (expression->kind) {
1694 case EXPR_STRING_LITERAL:
1695 if (akind == ATOMIC_TYPE_CHAR
1696 || akind == ATOMIC_TYPE_SCHAR
1697 || akind == ATOMIC_TYPE_UCHAR) {
1698 return initializer_from_string(array_type,
1699 &expression->string_literal.value);
1703 case EXPR_WIDE_STRING_LITERAL: {
1704 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1705 if (get_unqualified_type(element_type) == bare_wchar_type) {
1706 return initializer_from_wide_string(array_type,
1707 &expression->string_literal.value);
1718 assign_error_t error = semantic_assign(type, expression);
1719 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1721 report_assign_error(error, type, expression, "initializer",
1722 &expression->base.source_position);
1724 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1725 result->value.value = create_implicit_cast(expression, type);
1731 * Checks if a given expression can be used as an constant initializer.
1733 static bool is_initializer_constant(const expression_t *expression)
1735 return is_constant_expression(expression)
1736 || is_address_constant(expression);
1740 * Parses an scalar initializer.
1742 * §6.7.8.11; eat {} without warning
1744 static initializer_t *parse_scalar_initializer(type_t *type,
1745 bool must_be_constant)
1747 /* there might be extra {} hierarchies */
1751 warningf(HERE, "extra curly braces around scalar initializer");
1754 } while (next_if('{'));
1757 expression_t *expression = parse_assignment_expression();
1758 mark_vars_read(expression, NULL);
1759 if (must_be_constant && !is_initializer_constant(expression)) {
1760 errorf(&expression->base.source_position,
1761 "initialisation expression '%E' is not constant",
1765 initializer_t *initializer = initializer_from_expression(type, expression);
1767 if (initializer == NULL) {
1768 errorf(&expression->base.source_position,
1769 "expression '%E' (type '%T') doesn't match expected type '%T'",
1770 expression, expression->base.type, type);
1775 bool additional_warning_displayed = false;
1776 while (braces > 0) {
1778 if (token.type != '}') {
1779 if (!additional_warning_displayed && warning.other) {
1780 warningf(HERE, "additional elements in scalar initializer");
1781 additional_warning_displayed = true;
1792 * An entry in the type path.
1794 typedef struct type_path_entry_t type_path_entry_t;
1795 struct type_path_entry_t {
1796 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1798 size_t index; /**< For array types: the current index. */
1799 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1804 * A type path expression a position inside compound or array types.
1806 typedef struct type_path_t type_path_t;
1807 struct type_path_t {
1808 type_path_entry_t *path; /**< An flexible array containing the current path. */
1809 type_t *top_type; /**< type of the element the path points */
1810 size_t max_index; /**< largest index in outermost array */
1814 * Prints a type path for debugging.
1816 static __attribute__((unused)) void debug_print_type_path(
1817 const type_path_t *path)
1819 size_t len = ARR_LEN(path->path);
1821 for (size_t i = 0; i < len; ++i) {
1822 const type_path_entry_t *entry = & path->path[i];
1824 type_t *type = skip_typeref(entry->type);
1825 if (is_type_compound(type)) {
1826 /* in gcc mode structs can have no members */
1827 if (entry->v.compound_entry == NULL) {
1831 fprintf(stderr, ".%s",
1832 entry->v.compound_entry->base.symbol->string);
1833 } else if (is_type_array(type)) {
1834 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1836 fprintf(stderr, "-INVALID-");
1839 if (path->top_type != NULL) {
1840 fprintf(stderr, " (");
1841 print_type(path->top_type);
1842 fprintf(stderr, ")");
1847 * Return the top type path entry, ie. in a path
1848 * (type).a.b returns the b.
1850 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1852 size_t len = ARR_LEN(path->path);
1854 return &path->path[len-1];
1858 * Enlarge the type path by an (empty) element.
1860 static type_path_entry_t *append_to_type_path(type_path_t *path)
1862 size_t len = ARR_LEN(path->path);
1863 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1865 type_path_entry_t *result = & path->path[len];
1866 memset(result, 0, sizeof(result[0]));
1871 * Descending into a sub-type. Enter the scope of the current top_type.
1873 static void descend_into_subtype(type_path_t *path)
1875 type_t *orig_top_type = path->top_type;
1876 type_t *top_type = skip_typeref(orig_top_type);
1878 type_path_entry_t *top = append_to_type_path(path);
1879 top->type = top_type;
1881 if (is_type_compound(top_type)) {
1882 compound_t *compound = top_type->compound.compound;
1883 entity_t *entry = compound->members.entities;
1885 if (entry != NULL) {
1886 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1887 top->v.compound_entry = &entry->declaration;
1888 path->top_type = entry->declaration.type;
1890 path->top_type = NULL;
1892 } else if (is_type_array(top_type)) {
1894 path->top_type = top_type->array.element_type;
1896 assert(!is_type_valid(top_type));
1901 * Pop an entry from the given type path, ie. returning from
1902 * (type).a.b to (type).a
1904 static void ascend_from_subtype(type_path_t *path)
1906 type_path_entry_t *top = get_type_path_top(path);
1908 path->top_type = top->type;
1910 size_t len = ARR_LEN(path->path);
1911 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1915 * Pop entries from the given type path until the given
1916 * path level is reached.
1918 static void ascend_to(type_path_t *path, size_t top_path_level)
1920 size_t len = ARR_LEN(path->path);
1922 while (len > top_path_level) {
1923 ascend_from_subtype(path);
1924 len = ARR_LEN(path->path);
1928 static bool walk_designator(type_path_t *path, const designator_t *designator,
1929 bool used_in_offsetof)
1931 for (; designator != NULL; designator = designator->next) {
1932 type_path_entry_t *top = get_type_path_top(path);
1933 type_t *orig_type = top->type;
1935 type_t *type = skip_typeref(orig_type);
1937 if (designator->symbol != NULL) {
1938 symbol_t *symbol = designator->symbol;
1939 if (!is_type_compound(type)) {
1940 if (is_type_valid(type)) {
1941 errorf(&designator->source_position,
1942 "'.%Y' designator used for non-compound type '%T'",
1946 top->type = type_error_type;
1947 top->v.compound_entry = NULL;
1948 orig_type = type_error_type;
1950 compound_t *compound = type->compound.compound;
1951 entity_t *iter = compound->members.entities;
1952 for (; iter != NULL; iter = iter->base.next) {
1953 if (iter->base.symbol == symbol) {
1958 errorf(&designator->source_position,
1959 "'%T' has no member named '%Y'", orig_type, symbol);
1962 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1963 if (used_in_offsetof) {
1964 type_t *real_type = skip_typeref(iter->declaration.type);
1965 if (real_type->kind == TYPE_BITFIELD) {
1966 errorf(&designator->source_position,
1967 "offsetof designator '%Y' must not specify bitfield",
1973 top->type = orig_type;
1974 top->v.compound_entry = &iter->declaration;
1975 orig_type = iter->declaration.type;
1978 expression_t *array_index = designator->array_index;
1979 assert(designator->array_index != NULL);
1981 if (!is_type_array(type)) {
1982 if (is_type_valid(type)) {
1983 errorf(&designator->source_position,
1984 "[%E] designator used for non-array type '%T'",
1985 array_index, orig_type);
1990 long index = fold_constant_to_int(array_index);
1991 if (!used_in_offsetof) {
1993 errorf(&designator->source_position,
1994 "array index [%E] must be positive", array_index);
1995 } else if (type->array.size_constant) {
1996 long array_size = type->array.size;
1997 if (index >= array_size) {
1998 errorf(&designator->source_position,
1999 "designator [%E] (%d) exceeds array size %d",
2000 array_index, index, array_size);
2005 top->type = orig_type;
2006 top->v.index = (size_t) index;
2007 orig_type = type->array.element_type;
2009 path->top_type = orig_type;
2011 if (designator->next != NULL) {
2012 descend_into_subtype(path);
2021 static void advance_current_object(type_path_t *path, size_t top_path_level)
2023 type_path_entry_t *top = get_type_path_top(path);
2025 type_t *type = skip_typeref(top->type);
2026 if (is_type_union(type)) {
2027 /* in unions only the first element is initialized */
2028 top->v.compound_entry = NULL;
2029 } else if (is_type_struct(type)) {
2030 declaration_t *entry = top->v.compound_entry;
2032 entity_t *next_entity = entry->base.next;
2033 if (next_entity != NULL) {
2034 assert(is_declaration(next_entity));
2035 entry = &next_entity->declaration;
2040 top->v.compound_entry = entry;
2041 if (entry != NULL) {
2042 path->top_type = entry->type;
2045 } else if (is_type_array(type)) {
2046 assert(is_type_array(type));
2050 if (!type->array.size_constant || top->v.index < type->array.size) {
2054 assert(!is_type_valid(type));
2058 /* we're past the last member of the current sub-aggregate, try if we
2059 * can ascend in the type hierarchy and continue with another subobject */
2060 size_t len = ARR_LEN(path->path);
2062 if (len > top_path_level) {
2063 ascend_from_subtype(path);
2064 advance_current_object(path, top_path_level);
2066 path->top_type = NULL;
2071 * skip any {...} blocks until a closing bracket is reached.
2073 static void skip_initializers(void)
2077 while (token.type != '}') {
2078 if (token.type == T_EOF)
2080 if (token.type == '{') {
2088 static initializer_t *create_empty_initializer(void)
2090 static initializer_t empty_initializer
2091 = { .list = { { INITIALIZER_LIST }, 0 } };
2092 return &empty_initializer;
2096 * Parse a part of an initialiser for a struct or union,
2098 static initializer_t *parse_sub_initializer(type_path_t *path,
2099 type_t *outer_type, size_t top_path_level,
2100 parse_initializer_env_t *env)
2102 if (token.type == '}') {
2103 /* empty initializer */
2104 return create_empty_initializer();
2107 type_t *orig_type = path->top_type;
2108 type_t *type = NULL;
2110 if (orig_type == NULL) {
2111 /* We are initializing an empty compound. */
2113 type = skip_typeref(orig_type);
2116 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2119 designator_t *designator = NULL;
2120 if (token.type == '.' || token.type == '[') {
2121 designator = parse_designation();
2122 goto finish_designator;
2123 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2124 /* GNU-style designator ("identifier: value") */
2125 designator = allocate_ast_zero(sizeof(designator[0]));
2126 designator->source_position = token.source_position;
2127 designator->symbol = token.symbol;
2132 /* reset path to toplevel, evaluate designator from there */
2133 ascend_to(path, top_path_level);
2134 if (!walk_designator(path, designator, false)) {
2135 /* can't continue after designation error */
2139 initializer_t *designator_initializer
2140 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2141 designator_initializer->designator.designator = designator;
2142 ARR_APP1(initializer_t*, initializers, designator_initializer);
2144 orig_type = path->top_type;
2145 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2150 if (token.type == '{') {
2151 if (type != NULL && is_type_scalar(type)) {
2152 sub = parse_scalar_initializer(type, env->must_be_constant);
2156 if (env->entity != NULL) {
2158 "extra brace group at end of initializer for '%Y'",
2159 env->entity->base.symbol);
2161 errorf(HERE, "extra brace group at end of initializer");
2164 descend_into_subtype(path);
2166 add_anchor_token('}');
2167 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2169 rem_anchor_token('}');
2172 ascend_from_subtype(path);
2173 expect('}', end_error);
2175 expect('}', end_error);
2176 goto error_parse_next;
2180 /* must be an expression */
2181 expression_t *expression = parse_assignment_expression();
2182 mark_vars_read(expression, NULL);
2184 if (env->must_be_constant && !is_initializer_constant(expression)) {
2185 errorf(&expression->base.source_position,
2186 "Initialisation expression '%E' is not constant",
2191 /* we are already outside, ... */
2192 if (outer_type == NULL)
2193 goto error_parse_next;
2194 type_t *const outer_type_skip = skip_typeref(outer_type);
2195 if (is_type_compound(outer_type_skip) &&
2196 !outer_type_skip->compound.compound->complete) {
2197 goto error_parse_next;
2202 /* handle { "string" } special case */
2203 if ((expression->kind == EXPR_STRING_LITERAL
2204 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2205 && outer_type != NULL) {
2206 sub = initializer_from_expression(outer_type, expression);
2209 if (token.type != '}' && warning.other) {
2210 warningf(HERE, "excessive elements in initializer for type '%T'",
2213 /* TODO: eat , ... */
2218 /* descend into subtypes until expression matches type */
2220 orig_type = path->top_type;
2221 type = skip_typeref(orig_type);
2223 sub = initializer_from_expression(orig_type, expression);
2227 if (!is_type_valid(type)) {
2230 if (is_type_scalar(type)) {
2231 errorf(&expression->base.source_position,
2232 "expression '%E' doesn't match expected type '%T'",
2233 expression, orig_type);
2237 descend_into_subtype(path);
2241 /* update largest index of top array */
2242 const type_path_entry_t *first = &path->path[0];
2243 type_t *first_type = first->type;
2244 first_type = skip_typeref(first_type);
2245 if (is_type_array(first_type)) {
2246 size_t index = first->v.index;
2247 if (index > path->max_index)
2248 path->max_index = index;
2252 /* append to initializers list */
2253 ARR_APP1(initializer_t*, initializers, sub);
2256 if (warning.other) {
2257 if (env->entity != NULL) {
2258 warningf(HERE, "excess elements in initializer for '%Y'",
2259 env->entity->base.symbol);
2261 warningf(HERE, "excess elements in initializer");
2267 if (token.type == '}') {
2270 expect(',', end_error);
2271 if (token.type == '}') {
2276 /* advance to the next declaration if we are not at the end */
2277 advance_current_object(path, top_path_level);
2278 orig_type = path->top_type;
2279 if (orig_type != NULL)
2280 type = skip_typeref(orig_type);
2286 size_t len = ARR_LEN(initializers);
2287 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2288 initializer_t *result = allocate_ast_zero(size);
2289 result->kind = INITIALIZER_LIST;
2290 result->list.len = len;
2291 memcpy(&result->list.initializers, initializers,
2292 len * sizeof(initializers[0]));
2294 DEL_ARR_F(initializers);
2295 ascend_to(path, top_path_level+1);
2300 skip_initializers();
2301 DEL_ARR_F(initializers);
2302 ascend_to(path, top_path_level+1);
2306 static expression_t *make_size_literal(size_t value)
2308 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2309 literal->base.type = type_size_t;
2312 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2313 literal->literal.value = make_string(buf);
2319 * Parses an initializer. Parsers either a compound literal
2320 * (env->declaration == NULL) or an initializer of a declaration.
2322 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2324 type_t *type = skip_typeref(env->type);
2325 size_t max_index = 0;
2326 initializer_t *result;
2328 if (is_type_scalar(type)) {
2329 result = parse_scalar_initializer(type, env->must_be_constant);
2330 } else if (token.type == '{') {
2334 memset(&path, 0, sizeof(path));
2335 path.top_type = env->type;
2336 path.path = NEW_ARR_F(type_path_entry_t, 0);
2338 descend_into_subtype(&path);
2340 add_anchor_token('}');
2341 result = parse_sub_initializer(&path, env->type, 1, env);
2342 rem_anchor_token('}');
2344 max_index = path.max_index;
2345 DEL_ARR_F(path.path);
2347 expect('}', end_error);
2349 /* parse_scalar_initializer() also works in this case: we simply
2350 * have an expression without {} around it */
2351 result = parse_scalar_initializer(type, env->must_be_constant);
2354 /* §6.7.8:22 array initializers for arrays with unknown size determine
2355 * the array type size */
2356 if (is_type_array(type) && type->array.size_expression == NULL
2357 && result != NULL) {
2359 switch (result->kind) {
2360 case INITIALIZER_LIST:
2361 assert(max_index != 0xdeadbeaf);
2362 size = max_index + 1;
2365 case INITIALIZER_STRING:
2366 size = result->string.string.size;
2369 case INITIALIZER_WIDE_STRING:
2370 size = result->wide_string.string.size;
2373 case INITIALIZER_DESIGNATOR:
2374 case INITIALIZER_VALUE:
2375 /* can happen for parse errors */
2380 internal_errorf(HERE, "invalid initializer type");
2383 type_t *new_type = duplicate_type(type);
2385 new_type->array.size_expression = make_size_literal(size);
2386 new_type->array.size_constant = true;
2387 new_type->array.has_implicit_size = true;
2388 new_type->array.size = size;
2389 env->type = new_type;
2397 static void append_entity(scope_t *scope, entity_t *entity)
2399 if (scope->last_entity != NULL) {
2400 scope->last_entity->base.next = entity;
2402 scope->entities = entity;
2404 entity->base.parent_entity = current_entity;
2405 scope->last_entity = entity;
2409 static compound_t *parse_compound_type_specifier(bool is_struct)
2411 eat(is_struct ? T_struct : T_union);
2413 symbol_t *symbol = NULL;
2414 compound_t *compound = NULL;
2415 attribute_t *attributes = NULL;
2417 if (token.type == T___attribute__) {
2418 attributes = parse_attributes(NULL);
2421 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2422 if (token.type == T_IDENTIFIER) {
2423 /* the compound has a name, check if we have seen it already */
2424 symbol = token.symbol;
2427 entity_t *entity = get_tag(symbol, kind);
2428 if (entity != NULL) {
2429 compound = &entity->compound;
2430 if (compound->base.parent_scope != current_scope &&
2431 (token.type == '{' || token.type == ';')) {
2432 /* we're in an inner scope and have a definition. Shadow
2433 * existing definition in outer scope */
2435 } else if (compound->complete && token.type == '{') {
2436 assert(symbol != NULL);
2437 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2438 is_struct ? "struct" : "union", symbol,
2439 &compound->base.source_position);
2440 /* clear members in the hope to avoid further errors */
2441 compound->members.entities = NULL;
2444 } else if (token.type != '{') {
2446 parse_error_expected("while parsing struct type specifier",
2447 T_IDENTIFIER, '{', NULL);
2449 parse_error_expected("while parsing union type specifier",
2450 T_IDENTIFIER, '{', NULL);
2456 if (compound == NULL) {
2457 entity_t *entity = allocate_entity_zero(kind);
2458 compound = &entity->compound;
2460 compound->alignment = 1;
2461 compound->base.namespc = NAMESPACE_TAG;
2462 compound->base.source_position = token.source_position;
2463 compound->base.symbol = symbol;
2464 compound->base.parent_scope = current_scope;
2465 if (symbol != NULL) {
2466 environment_push(entity);
2468 append_entity(current_scope, entity);
2471 if (token.type == '{') {
2472 parse_compound_type_entries(compound);
2474 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2475 if (symbol == NULL) {
2476 assert(anonymous_entity == NULL);
2477 anonymous_entity = (entity_t*)compound;
2481 if (attributes != NULL) {
2482 handle_entity_attributes(attributes, (entity_t*) compound);
2488 static void parse_enum_entries(type_t *const enum_type)
2492 if (token.type == '}') {
2493 errorf(HERE, "empty enum not allowed");
2498 add_anchor_token('}');
2500 if (token.type != T_IDENTIFIER) {
2501 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2503 rem_anchor_token('}');
2507 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2508 entity->enum_value.enum_type = enum_type;
2509 entity->base.symbol = token.symbol;
2510 entity->base.source_position = token.source_position;
2514 expression_t *value = parse_constant_expression();
2516 value = create_implicit_cast(value, enum_type);
2517 entity->enum_value.value = value;
2522 record_entity(entity, false);
2523 } while (next_if(',') && token.type != '}');
2524 rem_anchor_token('}');
2526 expect('}', end_error);
2532 static type_t *parse_enum_specifier(void)
2538 switch (token.type) {
2540 symbol = token.symbol;
2543 entity = get_tag(symbol, ENTITY_ENUM);
2544 if (entity != NULL) {
2545 if (entity->base.parent_scope != current_scope &&
2546 (token.type == '{' || token.type == ';')) {
2547 /* we're in an inner scope and have a definition. Shadow
2548 * existing definition in outer scope */
2550 } else if (entity->enume.complete && token.type == '{') {
2551 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
2552 symbol, &entity->base.source_position);
2563 parse_error_expected("while parsing enum type specifier",
2564 T_IDENTIFIER, '{', NULL);
2568 if (entity == NULL) {
2569 entity = allocate_entity_zero(ENTITY_ENUM);
2570 entity->base.namespc = NAMESPACE_TAG;
2571 entity->base.source_position = token.source_position;
2572 entity->base.symbol = symbol;
2573 entity->base.parent_scope = current_scope;
2576 type_t *const type = allocate_type_zero(TYPE_ENUM);
2577 type->enumt.enume = &entity->enume;
2578 type->enumt.akind = ATOMIC_TYPE_INT;
2580 if (token.type == '{') {
2581 if (symbol != NULL) {
2582 environment_push(entity);
2584 append_entity(current_scope, entity);
2585 entity->enume.complete = true;
2587 parse_enum_entries(type);
2588 parse_attributes(NULL);
2590 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2591 if (symbol == NULL) {
2592 assert(anonymous_entity == NULL);
2593 anonymous_entity = entity;
2595 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2596 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2604 * if a symbol is a typedef to another type, return true
2606 static bool is_typedef_symbol(symbol_t *symbol)
2608 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2609 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2612 static type_t *parse_typeof(void)
2618 expect('(', end_error);
2619 add_anchor_token(')');
2621 expression_t *expression = NULL;
2623 bool old_type_prop = in_type_prop;
2624 bool old_gcc_extension = in_gcc_extension;
2625 in_type_prop = true;
2627 while (next_if(T___extension__)) {
2628 /* This can be a prefix to a typename or an expression. */
2629 in_gcc_extension = true;
2631 switch (token.type) {
2633 if (is_typedef_symbol(token.symbol)) {
2635 type = parse_typename();
2638 expression = parse_expression();
2639 type = revert_automatic_type_conversion(expression);
2643 in_type_prop = old_type_prop;
2644 in_gcc_extension = old_gcc_extension;
2646 rem_anchor_token(')');
2647 expect(')', end_error);
2649 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2650 typeof_type->typeoft.expression = expression;
2651 typeof_type->typeoft.typeof_type = type;
2658 typedef enum specifiers_t {
2659 SPECIFIER_SIGNED = 1 << 0,
2660 SPECIFIER_UNSIGNED = 1 << 1,
2661 SPECIFIER_LONG = 1 << 2,
2662 SPECIFIER_INT = 1 << 3,
2663 SPECIFIER_DOUBLE = 1 << 4,
2664 SPECIFIER_CHAR = 1 << 5,
2665 SPECIFIER_WCHAR_T = 1 << 6,
2666 SPECIFIER_SHORT = 1 << 7,
2667 SPECIFIER_LONG_LONG = 1 << 8,
2668 SPECIFIER_FLOAT = 1 << 9,
2669 SPECIFIER_BOOL = 1 << 10,
2670 SPECIFIER_VOID = 1 << 11,
2671 SPECIFIER_INT8 = 1 << 12,
2672 SPECIFIER_INT16 = 1 << 13,
2673 SPECIFIER_INT32 = 1 << 14,
2674 SPECIFIER_INT64 = 1 << 15,
2675 SPECIFIER_INT128 = 1 << 16,
2676 SPECIFIER_COMPLEX = 1 << 17,
2677 SPECIFIER_IMAGINARY = 1 << 18,
2680 static type_t *create_builtin_type(symbol_t *const symbol,
2681 type_t *const real_type)
2683 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2684 type->builtin.symbol = symbol;
2685 type->builtin.real_type = real_type;
2686 return identify_new_type(type);
2689 static type_t *get_typedef_type(symbol_t *symbol)
2691 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2692 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2695 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2696 type->typedeft.typedefe = &entity->typedefe;
2701 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2703 expect('(', end_error);
2705 attribute_property_argument_t *property
2706 = allocate_ast_zero(sizeof(*property));
2709 if (token.type != T_IDENTIFIER) {
2710 parse_error_expected("while parsing property declspec",
2711 T_IDENTIFIER, NULL);
2716 symbol_t *symbol = token.symbol;
2718 if (strcmp(symbol->string, "put") == 0) {
2720 } else if (strcmp(symbol->string, "get") == 0) {
2723 errorf(HERE, "expected put or get in property declspec");
2726 expect('=', end_error);
2727 if (token.type != T_IDENTIFIER) {
2728 parse_error_expected("while parsing property declspec",
2729 T_IDENTIFIER, NULL);
2733 property->put_symbol = token.symbol;
2735 property->get_symbol = token.symbol;
2738 } while (next_if(','));
2740 attribute->a.property = property;
2742 expect(')', end_error);
2748 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2750 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2751 if (next_if(T_restrict)) {
2752 kind = ATTRIBUTE_MS_RESTRICT;
2753 } else if (token.type == T_IDENTIFIER) {
2754 const char *name = token.symbol->string;
2756 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2758 const char *attribute_name = get_attribute_name(k);
2759 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2765 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2766 warningf(HERE, "unknown __declspec '%s' ignored", name);
2769 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2773 attribute_t *attribute = allocate_attribute_zero(kind);
2775 if (kind == ATTRIBUTE_MS_PROPERTY) {
2776 return parse_attribute_ms_property(attribute);
2779 /* parse arguments */
2781 attribute->a.arguments = parse_attribute_arguments();
2786 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2790 expect('(', end_error);
2795 add_anchor_token(')');
2797 attribute_t **anchor = &first;
2799 while (*anchor != NULL)
2800 anchor = &(*anchor)->next;
2802 attribute_t *attribute
2803 = parse_microsoft_extended_decl_modifier_single();
2804 if (attribute == NULL)
2807 *anchor = attribute;
2808 anchor = &attribute->next;
2809 } while (next_if(','));
2811 rem_anchor_token(')');
2812 expect(')', end_error);
2816 rem_anchor_token(')');
2820 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2822 entity_t *entity = allocate_entity_zero(kind);
2823 entity->base.source_position = *HERE;
2824 entity->base.symbol = symbol;
2825 if (is_declaration(entity)) {
2826 entity->declaration.type = type_error_type;
2827 entity->declaration.implicit = true;
2828 } else if (kind == ENTITY_TYPEDEF) {
2829 entity->typedefe.type = type_error_type;
2830 entity->typedefe.builtin = true;
2832 if (kind != ENTITY_COMPOUND_MEMBER)
2833 record_entity(entity, false);
2837 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2839 type_t *type = NULL;
2840 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2841 unsigned type_specifiers = 0;
2842 bool newtype = false;
2843 bool saw_error = false;
2844 bool old_gcc_extension = in_gcc_extension;
2846 specifiers->source_position = token.source_position;
2849 specifiers->attributes = parse_attributes(specifiers->attributes);
2851 switch (token.type) {
2853 #define MATCH_STORAGE_CLASS(token, class) \
2855 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2856 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2858 specifiers->storage_class = class; \
2859 if (specifiers->thread_local) \
2860 goto check_thread_storage_class; \
2864 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2865 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2866 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2867 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2868 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2871 specifiers->attributes
2872 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2876 if (specifiers->thread_local) {
2877 errorf(HERE, "duplicate '__thread'");
2879 specifiers->thread_local = true;
2880 check_thread_storage_class:
2881 switch (specifiers->storage_class) {
2882 case STORAGE_CLASS_EXTERN:
2883 case STORAGE_CLASS_NONE:
2884 case STORAGE_CLASS_STATIC:
2888 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2889 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2890 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2891 wrong_thread_storage_class:
2892 errorf(HERE, "'__thread' used with '%s'", wrong);
2899 /* type qualifiers */
2900 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2902 qualifiers |= qualifier; \
2906 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2907 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2908 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2909 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2910 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2911 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2912 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2913 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2915 case T___extension__:
2917 in_gcc_extension = true;
2920 /* type specifiers */
2921 #define MATCH_SPECIFIER(token, specifier, name) \
2923 if (type_specifiers & specifier) { \
2924 errorf(HERE, "multiple " name " type specifiers given"); \
2926 type_specifiers |= specifier; \
2931 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2932 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2933 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2934 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2935 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2936 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2937 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2938 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2939 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2940 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2941 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2942 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2943 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2944 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2945 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2946 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2947 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2948 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2952 specifiers->is_inline = true;
2956 case T__forceinline:
2958 specifiers->modifiers |= DM_FORCEINLINE;
2963 if (type_specifiers & SPECIFIER_LONG_LONG) {
2964 errorf(HERE, "multiple type specifiers given");
2965 } else if (type_specifiers & SPECIFIER_LONG) {
2966 type_specifiers |= SPECIFIER_LONG_LONG;
2968 type_specifiers |= SPECIFIER_LONG;
2973 #define CHECK_DOUBLE_TYPE() \
2974 if ( type != NULL) \
2975 errorf(HERE, "multiple data types in declaration specifiers");
2978 CHECK_DOUBLE_TYPE();
2979 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2981 type->compound.compound = parse_compound_type_specifier(true);
2984 CHECK_DOUBLE_TYPE();
2985 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2986 type->compound.compound = parse_compound_type_specifier(false);
2989 CHECK_DOUBLE_TYPE();
2990 type = parse_enum_specifier();
2993 CHECK_DOUBLE_TYPE();
2994 type = parse_typeof();
2996 case T___builtin_va_list:
2997 CHECK_DOUBLE_TYPE();
2998 type = duplicate_type(type_valist);
3002 case T_IDENTIFIER: {
3003 /* only parse identifier if we haven't found a type yet */
3004 if (type != NULL || type_specifiers != 0) {
3005 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3006 * declaration, so it doesn't generate errors about expecting '(' or
3008 switch (look_ahead(1)->type) {
3015 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3019 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3024 goto finish_specifiers;
3028 type_t *const typedef_type = get_typedef_type(token.symbol);
3029 if (typedef_type == NULL) {
3030 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3031 * declaration, so it doesn't generate 'implicit int' followed by more
3032 * errors later on. */
3033 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3039 errorf(HERE, "%K does not name a type", &token);
3042 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3044 type = allocate_type_zero(TYPE_TYPEDEF);
3045 type->typedeft.typedefe = &entity->typedefe;
3049 if (la1_type == '&' || la1_type == '*')
3050 goto finish_specifiers;
3055 goto finish_specifiers;
3060 type = typedef_type;
3064 /* function specifier */
3066 goto finish_specifiers;
3071 specifiers->attributes = parse_attributes(specifiers->attributes);
3073 in_gcc_extension = old_gcc_extension;
3075 if (type == NULL || (saw_error && type_specifiers != 0)) {
3076 atomic_type_kind_t atomic_type;
3078 /* match valid basic types */
3079 switch (type_specifiers) {
3080 case SPECIFIER_VOID:
3081 atomic_type = ATOMIC_TYPE_VOID;
3083 case SPECIFIER_WCHAR_T:
3084 atomic_type = ATOMIC_TYPE_WCHAR_T;
3086 case SPECIFIER_CHAR:
3087 atomic_type = ATOMIC_TYPE_CHAR;
3089 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3090 atomic_type = ATOMIC_TYPE_SCHAR;
3092 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3093 atomic_type = ATOMIC_TYPE_UCHAR;
3095 case SPECIFIER_SHORT:
3096 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3097 case SPECIFIER_SHORT | SPECIFIER_INT:
3098 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3099 atomic_type = ATOMIC_TYPE_SHORT;
3101 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3102 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3103 atomic_type = ATOMIC_TYPE_USHORT;
3106 case SPECIFIER_SIGNED:
3107 case SPECIFIER_SIGNED | SPECIFIER_INT:
3108 atomic_type = ATOMIC_TYPE_INT;
3110 case SPECIFIER_UNSIGNED:
3111 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3112 atomic_type = ATOMIC_TYPE_UINT;
3114 case SPECIFIER_LONG:
3115 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3116 case SPECIFIER_LONG | SPECIFIER_INT:
3117 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3118 atomic_type = ATOMIC_TYPE_LONG;
3120 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3121 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3122 atomic_type = ATOMIC_TYPE_ULONG;
3125 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3126 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3127 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3128 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3130 atomic_type = ATOMIC_TYPE_LONGLONG;
3131 goto warn_about_long_long;
3133 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3134 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3136 atomic_type = ATOMIC_TYPE_ULONGLONG;
3137 warn_about_long_long:
3138 if (warning.long_long) {
3139 warningf(&specifiers->source_position,
3140 "ISO C90 does not support 'long long'");
3144 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3145 atomic_type = unsigned_int8_type_kind;
3148 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3149 atomic_type = unsigned_int16_type_kind;
3152 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3153 atomic_type = unsigned_int32_type_kind;
3156 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3157 atomic_type = unsigned_int64_type_kind;
3160 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3161 atomic_type = unsigned_int128_type_kind;
3164 case SPECIFIER_INT8:
3165 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3166 atomic_type = int8_type_kind;
3169 case SPECIFIER_INT16:
3170 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3171 atomic_type = int16_type_kind;
3174 case SPECIFIER_INT32:
3175 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3176 atomic_type = int32_type_kind;
3179 case SPECIFIER_INT64:
3180 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3181 atomic_type = int64_type_kind;
3184 case SPECIFIER_INT128:
3185 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3186 atomic_type = int128_type_kind;
3189 case SPECIFIER_FLOAT:
3190 atomic_type = ATOMIC_TYPE_FLOAT;
3192 case SPECIFIER_DOUBLE:
3193 atomic_type = ATOMIC_TYPE_DOUBLE;
3195 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3196 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3198 case SPECIFIER_BOOL:
3199 atomic_type = ATOMIC_TYPE_BOOL;
3201 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3202 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3203 atomic_type = ATOMIC_TYPE_FLOAT;
3205 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3206 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3207 atomic_type = ATOMIC_TYPE_DOUBLE;
3209 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3210 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3211 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3214 /* invalid specifier combination, give an error message */
3215 if (type_specifiers == 0) {
3219 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3220 if (!(c_mode & _CXX) && !strict_mode) {
3221 if (warning.implicit_int) {
3222 warningf(HERE, "no type specifiers in declaration, using 'int'");
3224 atomic_type = ATOMIC_TYPE_INT;
3227 errorf(HERE, "no type specifiers given in declaration");
3229 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3230 (type_specifiers & SPECIFIER_UNSIGNED)) {
3231 errorf(HERE, "signed and unsigned specifiers given");
3232 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3233 errorf(HERE, "only integer types can be signed or unsigned");
3235 errorf(HERE, "multiple datatypes in declaration");
3240 if (type_specifiers & SPECIFIER_COMPLEX) {
3241 type = allocate_type_zero(TYPE_COMPLEX);
3242 type->complex.akind = atomic_type;
3243 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3244 type = allocate_type_zero(TYPE_IMAGINARY);
3245 type->imaginary.akind = atomic_type;
3247 type = allocate_type_zero(TYPE_ATOMIC);
3248 type->atomic.akind = atomic_type;
3251 } else if (type_specifiers != 0) {
3252 errorf(HERE, "multiple datatypes in declaration");
3255 /* FIXME: check type qualifiers here */
3256 type->base.qualifiers = qualifiers;
3259 type = identify_new_type(type);
3261 type = typehash_insert(type);
3264 if (specifiers->attributes != NULL)
3265 type = handle_type_attributes(specifiers->attributes, type);
3266 specifiers->type = type;
3270 specifiers->type = type_error_type;
3273 static type_qualifiers_t parse_type_qualifiers(void)
3275 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3278 switch (token.type) {
3279 /* type qualifiers */
3280 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3281 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3282 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3283 /* microsoft extended type modifiers */
3284 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3285 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3286 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3287 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3288 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3297 * Parses an K&R identifier list
3299 static void parse_identifier_list(scope_t *scope)
3302 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3303 entity->base.source_position = token.source_position;
3304 entity->base.namespc = NAMESPACE_NORMAL;
3305 entity->base.symbol = token.symbol;
3306 /* a K&R parameter has no type, yet */
3310 append_entity(scope, entity);
3311 } while (next_if(',') && token.type == T_IDENTIFIER);
3314 static entity_t *parse_parameter(void)
3316 declaration_specifiers_t specifiers;
3317 memset(&specifiers, 0, sizeof(specifiers));
3319 parse_declaration_specifiers(&specifiers);
3321 entity_t *entity = parse_declarator(&specifiers,
3322 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3323 anonymous_entity = NULL;
3327 static void semantic_parameter_incomplete(const entity_t *entity)
3329 assert(entity->kind == ENTITY_PARAMETER);
3331 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3332 * list in a function declarator that is part of a
3333 * definition of that function shall not have
3334 * incomplete type. */
3335 type_t *type = skip_typeref(entity->declaration.type);
3336 if (is_type_incomplete(type)) {
3337 errorf(&entity->base.source_position,
3338 "parameter '%#T' has incomplete type",
3339 entity->declaration.type, entity->base.symbol);
3343 static bool has_parameters(void)
3345 /* func(void) is not a parameter */
3346 if (token.type == T_IDENTIFIER) {
3347 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3350 if (entity->kind != ENTITY_TYPEDEF)
3352 if (skip_typeref(entity->typedefe.type) != type_void)
3354 } else if (token.type != T_void) {
3357 if (look_ahead(1)->type != ')')
3364 * Parses function type parameters (and optionally creates variable_t entities
3365 * for them in a scope)
3367 static void parse_parameters(function_type_t *type, scope_t *scope)
3370 add_anchor_token(')');
3371 int saved_comma_state = save_and_reset_anchor_state(',');
3373 if (token.type == T_IDENTIFIER &&
3374 !is_typedef_symbol(token.symbol)) {
3375 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3376 if (la1_type == ',' || la1_type == ')') {
3377 type->kr_style_parameters = true;
3378 parse_identifier_list(scope);
3379 goto parameters_finished;
3383 if (token.type == ')') {
3384 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3385 if (!(c_mode & _CXX))
3386 type->unspecified_parameters = true;
3387 goto parameters_finished;
3390 if (has_parameters()) {
3391 function_parameter_t **anchor = &type->parameters;
3393 switch (token.type) {
3396 type->variadic = true;
3397 goto parameters_finished;
3400 case T___extension__:
3403 entity_t *entity = parse_parameter();
3404 if (entity->kind == ENTITY_TYPEDEF) {
3405 errorf(&entity->base.source_position,
3406 "typedef not allowed as function parameter");
3409 assert(is_declaration(entity));
3411 semantic_parameter_incomplete(entity);
3413 function_parameter_t *const parameter =
3414 allocate_parameter(entity->declaration.type);
3416 if (scope != NULL) {
3417 append_entity(scope, entity);
3420 *anchor = parameter;
3421 anchor = ¶meter->next;
3426 goto parameters_finished;
3428 } while (next_if(','));
3432 parameters_finished:
3433 rem_anchor_token(')');
3434 expect(')', end_error);
3437 restore_anchor_state(',', saved_comma_state);
3440 typedef enum construct_type_kind_t {
3443 CONSTRUCT_REFERENCE,
3446 } construct_type_kind_t;
3448 typedef union construct_type_t construct_type_t;
3450 typedef struct construct_type_base_t {
3451 construct_type_kind_t kind;
3452 construct_type_t *next;
3453 } construct_type_base_t;
3455 typedef struct parsed_pointer_t {
3456 construct_type_base_t base;
3457 type_qualifiers_t type_qualifiers;
3458 variable_t *base_variable; /**< MS __based extension. */
3461 typedef struct parsed_reference_t {
3462 construct_type_base_t base;
3463 } parsed_reference_t;
3465 typedef struct construct_function_type_t {
3466 construct_type_base_t base;
3467 type_t *function_type;
3468 } construct_function_type_t;
3470 typedef struct parsed_array_t {
3471 construct_type_base_t base;
3472 type_qualifiers_t type_qualifiers;
3478 union construct_type_t {
3479 construct_type_kind_t kind;
3480 construct_type_base_t base;
3481 parsed_pointer_t pointer;
3482 parsed_reference_t reference;
3483 construct_function_type_t function;
3484 parsed_array_t array;
3487 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3489 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3490 memset(cons, 0, size);
3496 static construct_type_t *parse_pointer_declarator(void)
3500 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3501 cons->pointer.type_qualifiers = parse_type_qualifiers();
3502 //cons->pointer.base_variable = base_variable;
3507 /* ISO/IEC 14882:1998(E) §8.3.2 */
3508 static construct_type_t *parse_reference_declarator(void)
3512 if (!(c_mode & _CXX))
3513 errorf(HERE, "references are only available for C++");
3515 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3521 static construct_type_t *parse_array_declarator(void)
3524 add_anchor_token(']');
3526 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3527 parsed_array_t *const array = &cons->array;
3529 bool is_static = next_if(T_static);
3531 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3534 is_static = next_if(T_static);
3536 array->type_qualifiers = type_qualifiers;
3537 array->is_static = is_static;
3539 expression_t *size = NULL;
3540 if (token.type == '*' && look_ahead(1)->type == ']') {
3541 array->is_variable = true;
3543 } else if (token.type != ']') {
3544 size = parse_assignment_expression();
3546 /* §6.7.5.2:1 Array size must have integer type */
3547 type_t *const orig_type = size->base.type;
3548 type_t *const type = skip_typeref(orig_type);
3549 if (!is_type_integer(type) && is_type_valid(type)) {
3550 errorf(&size->base.source_position,
3551 "array size '%E' must have integer type but has type '%T'",
3556 mark_vars_read(size, NULL);
3559 if (is_static && size == NULL)
3560 errorf(HERE, "static array parameters require a size");
3562 rem_anchor_token(']');
3563 expect(']', end_error);
3570 static construct_type_t *parse_function_declarator(scope_t *scope)
3572 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3573 function_type_t *ftype = &type->function;
3575 ftype->linkage = current_linkage;
3576 ftype->calling_convention = CC_DEFAULT;
3578 parse_parameters(ftype, scope);
3580 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3581 cons->function.function_type = type;
3586 typedef struct parse_declarator_env_t {
3587 bool may_be_abstract : 1;
3588 bool must_be_abstract : 1;
3589 decl_modifiers_t modifiers;
3591 source_position_t source_position;
3593 attribute_t *attributes;
3594 } parse_declarator_env_t;
3597 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3599 /* construct a single linked list of construct_type_t's which describe
3600 * how to construct the final declarator type */
3601 construct_type_t *first = NULL;
3602 construct_type_t **anchor = &first;
3604 env->attributes = parse_attributes(env->attributes);
3607 construct_type_t *type;
3608 //variable_t *based = NULL; /* MS __based extension */
3609 switch (token.type) {
3611 type = parse_reference_declarator();
3615 panic("based not supported anymore");
3620 type = parse_pointer_declarator();
3624 goto ptr_operator_end;
3628 anchor = &type->base.next;
3630 /* TODO: find out if this is correct */
3631 env->attributes = parse_attributes(env->attributes);
3635 construct_type_t *inner_types = NULL;
3637 switch (token.type) {
3639 if (env->must_be_abstract) {
3640 errorf(HERE, "no identifier expected in typename");
3642 env->symbol = token.symbol;
3643 env->source_position = token.source_position;
3648 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3649 * interpreted as ``function with no parameter specification'', rather
3650 * than redundant parentheses around the omitted identifier. */
3651 if (look_ahead(1)->type != ')') {
3653 add_anchor_token(')');
3654 inner_types = parse_inner_declarator(env);
3655 if (inner_types != NULL) {
3656 /* All later declarators only modify the return type */
3657 env->must_be_abstract = true;
3659 rem_anchor_token(')');
3660 expect(')', end_error);
3661 } else if (!env->may_be_abstract) {
3662 errorf(HERE, "declarator must have a name");
3667 if (env->may_be_abstract)
3669 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3675 construct_type_t **const p = anchor;
3678 construct_type_t *type;
3679 switch (token.type) {
3681 scope_t *scope = NULL;
3682 if (!env->must_be_abstract) {
3683 scope = &env->parameters;
3686 type = parse_function_declarator(scope);
3690 type = parse_array_declarator();
3693 goto declarator_finished;
3696 /* insert in the middle of the list (at p) */
3697 type->base.next = *p;
3700 anchor = &type->base.next;
3703 declarator_finished:
3704 /* append inner_types at the end of the list, we don't to set anchor anymore
3705 * as it's not needed anymore */
3706 *anchor = inner_types;
3713 static type_t *construct_declarator_type(construct_type_t *construct_list,
3716 construct_type_t *iter = construct_list;
3717 for (; iter != NULL; iter = iter->base.next) {
3718 switch (iter->kind) {
3719 case CONSTRUCT_INVALID:
3721 case CONSTRUCT_FUNCTION: {
3722 construct_function_type_t *function = &iter->function;
3723 type_t *function_type = function->function_type;
3725 function_type->function.return_type = type;
3727 type_t *skipped_return_type = skip_typeref(type);
3729 if (is_type_function(skipped_return_type)) {
3730 errorf(HERE, "function returning function is not allowed");
3731 } else if (is_type_array(skipped_return_type)) {
3732 errorf(HERE, "function returning array is not allowed");
3734 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3736 "type qualifiers in return type of function type are meaningless");
3740 /* The function type was constructed earlier. Freeing it here will
3741 * destroy other types. */
3742 type = typehash_insert(function_type);
3746 case CONSTRUCT_POINTER: {
3747 if (is_type_reference(skip_typeref(type)))
3748 errorf(HERE, "cannot declare a pointer to reference");
3750 parsed_pointer_t *pointer = &iter->pointer;
3751 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3755 case CONSTRUCT_REFERENCE:
3756 if (is_type_reference(skip_typeref(type)))
3757 errorf(HERE, "cannot declare a reference to reference");
3759 type = make_reference_type(type);
3762 case CONSTRUCT_ARRAY: {
3763 if (is_type_reference(skip_typeref(type)))
3764 errorf(HERE, "cannot declare an array of references");
3766 parsed_array_t *array = &iter->array;
3767 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3769 expression_t *size_expression = array->size;
3770 if (size_expression != NULL) {
3772 = create_implicit_cast(size_expression, type_size_t);
3775 array_type->base.qualifiers = array->type_qualifiers;
3776 array_type->array.element_type = type;
3777 array_type->array.is_static = array->is_static;
3778 array_type->array.is_variable = array->is_variable;
3779 array_type->array.size_expression = size_expression;
3781 if (size_expression != NULL) {
3782 if (is_constant_expression(size_expression)) {
3784 = fold_constant_to_int(size_expression);
3785 array_type->array.size = size;
3786 array_type->array.size_constant = true;
3787 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3788 * have a value greater than zero. */
3790 if (size < 0 || !GNU_MODE) {
3791 errorf(&size_expression->base.source_position,
3792 "size of array must be greater than zero");
3793 } else if (warning.other) {
3794 warningf(&size_expression->base.source_position,
3795 "zero length arrays are a GCC extension");
3799 array_type->array.is_vla = true;
3803 type_t *skipped_type = skip_typeref(type);
3805 if (is_type_incomplete(skipped_type)) {
3806 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
3807 } else if (is_type_function(skipped_type)) {
3808 errorf(HERE, "array of functions is not allowed");
3810 type = identify_new_type(array_type);
3814 internal_errorf(HERE, "invalid type construction found");
3820 static type_t *automatic_type_conversion(type_t *orig_type);
3822 static type_t *semantic_parameter(const source_position_t *pos,
3824 const declaration_specifiers_t *specifiers,
3827 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3828 * shall be adjusted to ``qualified pointer to type'',
3830 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3831 * type'' shall be adjusted to ``pointer to function
3832 * returning type'', as in 6.3.2.1. */
3833 type = automatic_type_conversion(type);
3835 if (specifiers->is_inline && is_type_valid(type)) {
3836 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3839 /* §6.9.1:6 The declarations in the declaration list shall contain
3840 * no storage-class specifier other than register and no
3841 * initializations. */
3842 if (specifiers->thread_local || (
3843 specifiers->storage_class != STORAGE_CLASS_NONE &&
3844 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3846 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3849 /* delay test for incomplete type, because we might have (void)
3850 * which is legal but incomplete... */
3855 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3856 declarator_flags_t flags)
3858 parse_declarator_env_t env;
3859 memset(&env, 0, sizeof(env));
3860 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3862 construct_type_t *construct_type = parse_inner_declarator(&env);
3864 construct_declarator_type(construct_type, specifiers->type);
3865 type_t *type = skip_typeref(orig_type);
3867 if (construct_type != NULL) {
3868 obstack_free(&temp_obst, construct_type);
3871 attribute_t *attributes = parse_attributes(env.attributes);
3872 /* append (shared) specifier attribute behind attributes of this
3874 attribute_t **anchor = &attributes;
3875 while (*anchor != NULL)
3876 anchor = &(*anchor)->next;
3877 *anchor = specifiers->attributes;
3880 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3881 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3882 entity->base.symbol = env.symbol;
3883 entity->base.source_position = env.source_position;
3884 entity->typedefe.type = orig_type;
3886 if (anonymous_entity != NULL) {
3887 if (is_type_compound(type)) {
3888 assert(anonymous_entity->compound.alias == NULL);
3889 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3890 anonymous_entity->kind == ENTITY_UNION);
3891 anonymous_entity->compound.alias = entity;
3892 anonymous_entity = NULL;
3893 } else if (is_type_enum(type)) {
3894 assert(anonymous_entity->enume.alias == NULL);
3895 assert(anonymous_entity->kind == ENTITY_ENUM);
3896 anonymous_entity->enume.alias = entity;
3897 anonymous_entity = NULL;
3901 /* create a declaration type entity */
3902 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3903 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3905 if (env.symbol != NULL) {
3906 if (specifiers->is_inline && is_type_valid(type)) {
3907 errorf(&env.source_position,
3908 "compound member '%Y' declared 'inline'", env.symbol);
3911 if (specifiers->thread_local ||
3912 specifiers->storage_class != STORAGE_CLASS_NONE) {
3913 errorf(&env.source_position,
3914 "compound member '%Y' must have no storage class",
3918 } else if (flags & DECL_IS_PARAMETER) {
3919 orig_type = semantic_parameter(&env.source_position, orig_type,
3920 specifiers, env.symbol);
3922 entity = allocate_entity_zero(ENTITY_PARAMETER);
3923 } else if (is_type_function(type)) {
3924 entity = allocate_entity_zero(ENTITY_FUNCTION);
3926 entity->function.is_inline = specifiers->is_inline;
3927 entity->function.parameters = env.parameters;
3929 if (env.symbol != NULL) {
3930 /* this needs fixes for C++ */
3931 bool in_function_scope = current_function != NULL;
3933 if (specifiers->thread_local || (
3934 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3935 specifiers->storage_class != STORAGE_CLASS_NONE &&
3936 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3938 errorf(&env.source_position,
3939 "invalid storage class for function '%Y'", env.symbol);
3943 entity = allocate_entity_zero(ENTITY_VARIABLE);
3945 entity->variable.thread_local = specifiers->thread_local;
3947 if (env.symbol != NULL) {
3948 if (specifiers->is_inline && is_type_valid(type)) {
3949 errorf(&env.source_position,
3950 "variable '%Y' declared 'inline'", env.symbol);
3953 bool invalid_storage_class = false;
3954 if (current_scope == file_scope) {
3955 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3956 specifiers->storage_class != STORAGE_CLASS_NONE &&
3957 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3958 invalid_storage_class = true;
3961 if (specifiers->thread_local &&
3962 specifiers->storage_class == STORAGE_CLASS_NONE) {
3963 invalid_storage_class = true;
3966 if (invalid_storage_class) {
3967 errorf(&env.source_position,
3968 "invalid storage class for variable '%Y'", env.symbol);
3973 if (env.symbol != NULL) {
3974 entity->base.symbol = env.symbol;
3975 entity->base.source_position = env.source_position;
3977 entity->base.source_position = specifiers->source_position;
3979 entity->base.namespc = NAMESPACE_NORMAL;
3980 entity->declaration.type = orig_type;
3981 entity->declaration.alignment = get_type_alignment(orig_type);
3982 entity->declaration.modifiers = env.modifiers;
3983 entity->declaration.attributes = attributes;
3985 storage_class_t storage_class = specifiers->storage_class;
3986 entity->declaration.declared_storage_class = storage_class;
3988 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3989 storage_class = STORAGE_CLASS_AUTO;
3990 entity->declaration.storage_class = storage_class;
3993 if (attributes != NULL) {
3994 handle_entity_attributes(attributes, entity);
4000 static type_t *parse_abstract_declarator(type_t *base_type)
4002 parse_declarator_env_t env;
4003 memset(&env, 0, sizeof(env));
4004 env.may_be_abstract = true;
4005 env.must_be_abstract = true;
4007 construct_type_t *construct_type = parse_inner_declarator(&env);
4009 type_t *result = construct_declarator_type(construct_type, base_type);
4010 if (construct_type != NULL) {
4011 obstack_free(&temp_obst, construct_type);
4013 result = handle_type_attributes(env.attributes, result);
4019 * Check if the declaration of main is suspicious. main should be a
4020 * function with external linkage, returning int, taking either zero
4021 * arguments, two, or three arguments of appropriate types, ie.
4023 * int main([ int argc, char **argv [, char **env ] ]).
4025 * @param decl the declaration to check
4026 * @param type the function type of the declaration
4028 static void check_main(const entity_t *entity)
4030 const source_position_t *pos = &entity->base.source_position;
4031 if (entity->kind != ENTITY_FUNCTION) {
4032 warningf(pos, "'main' is not a function");
4036 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4037 warningf(pos, "'main' is normally a non-static function");
4040 type_t *type = skip_typeref(entity->declaration.type);
4041 assert(is_type_function(type));
4043 function_type_t *func_type = &type->function;
4044 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4045 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4046 func_type->return_type);
4048 const function_parameter_t *parm = func_type->parameters;
4050 type_t *const first_type = parm->type;
4051 if (!types_compatible(skip_typeref(first_type), type_int)) {
4053 "first argument of 'main' should be 'int', but is '%T'",
4058 type_t *const second_type = parm->type;
4059 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4060 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4064 type_t *const third_type = parm->type;
4065 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4066 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4070 goto warn_arg_count;
4074 warningf(pos, "'main' takes only zero, two or three arguments");
4080 * Check if a symbol is the equal to "main".
4082 static bool is_sym_main(const symbol_t *const sym)
4084 return strcmp(sym->string, "main") == 0;
4087 static void error_redefined_as_different_kind(const source_position_t *pos,
4088 const entity_t *old, entity_kind_t new_kind)
4090 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4091 get_entity_kind_name(old->kind), old->base.symbol,
4092 get_entity_kind_name(new_kind), &old->base.source_position);
4095 static bool is_error_entity(entity_t *const ent)
4097 if (is_declaration(ent)) {
4098 return is_type_valid(skip_typeref(ent->declaration.type));
4099 } else if (ent->kind == ENTITY_TYPEDEF) {
4100 return is_type_valid(skip_typeref(ent->typedefe.type));
4105 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4107 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4108 if (attributes_equal(tattr, attr))
4115 * test wether new_list contains any attributes not included in old_list
4117 static bool has_new_attributes(const attribute_t *old_list,
4118 const attribute_t *new_list)
4120 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4121 if (!contains_attribute(old_list, attr))
4128 * Merge in attributes from an attribute list (probably from a previous
4129 * declaration with the same name). Warning: destroys the old structure
4130 * of the attribute list - don't reuse attributes after this call.
4132 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4135 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4137 if (contains_attribute(decl->attributes, attr))
4140 /* move attribute to new declarations attributes list */
4141 attr->next = decl->attributes;
4142 decl->attributes = attr;
4147 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4148 * for various problems that occur for multiple definitions
4150 entity_t *record_entity(entity_t *entity, const bool is_definition)
4152 const symbol_t *const symbol = entity->base.symbol;
4153 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4154 const source_position_t *pos = &entity->base.source_position;
4156 /* can happen in error cases */
4160 entity_t *const previous_entity = get_entity(symbol, namespc);
4161 /* pushing the same entity twice will break the stack structure */
4162 assert(previous_entity != entity);
4164 if (entity->kind == ENTITY_FUNCTION) {
4165 type_t *const orig_type = entity->declaration.type;
4166 type_t *const type = skip_typeref(orig_type);
4168 assert(is_type_function(type));
4169 if (type->function.unspecified_parameters &&
4170 warning.strict_prototypes &&
4171 previous_entity == NULL) {
4172 warningf(pos, "function declaration '%#T' is not a prototype",
4176 if (warning.main && current_scope == file_scope
4177 && is_sym_main(symbol)) {
4182 if (is_declaration(entity) &&
4183 warning.nested_externs &&
4184 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4185 current_scope != file_scope) {
4186 warningf(pos, "nested extern declaration of '%#T'",
4187 entity->declaration.type, symbol);
4190 if (previous_entity != NULL) {
4191 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4192 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4193 assert(previous_entity->kind == ENTITY_PARAMETER);
4195 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4196 entity->declaration.type, symbol,
4197 previous_entity->declaration.type, symbol,
4198 &previous_entity->base.source_position);
4202 if (previous_entity->base.parent_scope == current_scope) {
4203 if (previous_entity->kind != entity->kind) {
4204 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
4205 error_redefined_as_different_kind(pos, previous_entity,
4210 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4211 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4212 symbol, &previous_entity->base.source_position);
4215 if (previous_entity->kind == ENTITY_TYPEDEF) {
4216 /* TODO: C++ allows this for exactly the same type */
4217 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4218 symbol, &previous_entity->base.source_position);
4222 /* at this point we should have only VARIABLES or FUNCTIONS */
4223 assert(is_declaration(previous_entity) && is_declaration(entity));
4225 declaration_t *const prev_decl = &previous_entity->declaration;
4226 declaration_t *const decl = &entity->declaration;
4228 /* can happen for K&R style declarations */
4229 if (prev_decl->type == NULL &&
4230 previous_entity->kind == ENTITY_PARAMETER &&
4231 entity->kind == ENTITY_PARAMETER) {
4232 prev_decl->type = decl->type;
4233 prev_decl->storage_class = decl->storage_class;
4234 prev_decl->declared_storage_class = decl->declared_storage_class;
4235 prev_decl->modifiers = decl->modifiers;
4236 return previous_entity;
4239 type_t *const orig_type = decl->type;
4240 assert(orig_type != NULL);
4241 type_t *const type = skip_typeref(orig_type);
4242 type_t *const prev_type = skip_typeref(prev_decl->type);
4244 if (!types_compatible(type, prev_type)) {
4246 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4247 orig_type, symbol, prev_decl->type, symbol,
4248 &previous_entity->base.source_position);
4250 unsigned old_storage_class = prev_decl->storage_class;
4252 if (warning.redundant_decls &&
4255 !(prev_decl->modifiers & DM_USED) &&
4256 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4257 warningf(&previous_entity->base.source_position,
4258 "unnecessary static forward declaration for '%#T'",
4259 prev_decl->type, symbol);
4262 storage_class_t new_storage_class = decl->storage_class;
4264 /* pretend no storage class means extern for function
4265 * declarations (except if the previous declaration is neither
4266 * none nor extern) */
4267 if (entity->kind == ENTITY_FUNCTION) {
4268 /* the previous declaration could have unspecified parameters or
4269 * be a typedef, so use the new type */
4270 if (prev_type->function.unspecified_parameters || is_definition)
4271 prev_decl->type = type;
4273 switch (old_storage_class) {
4274 case STORAGE_CLASS_NONE:
4275 old_storage_class = STORAGE_CLASS_EXTERN;
4278 case STORAGE_CLASS_EXTERN:
4279 if (is_definition) {
4280 if (warning.missing_prototypes &&
4281 prev_type->function.unspecified_parameters &&
4282 !is_sym_main(symbol)) {
4283 warningf(pos, "no previous prototype for '%#T'",
4286 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4287 new_storage_class = STORAGE_CLASS_EXTERN;
4294 } else if (is_type_incomplete(prev_type)) {
4295 prev_decl->type = type;
4298 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4299 new_storage_class == STORAGE_CLASS_EXTERN) {
4301 warn_redundant_declaration: ;
4303 = has_new_attributes(prev_decl->attributes,
4305 if (has_new_attrs) {
4306 merge_in_attributes(decl, prev_decl->attributes);
4307 } else if (!is_definition &&
4308 warning.redundant_decls &&
4309 is_type_valid(prev_type) &&
4310 strcmp(previous_entity->base.source_position.input_name,
4311 "<builtin>") != 0) {
4313 "redundant declaration for '%Y' (declared %P)",
4314 symbol, &previous_entity->base.source_position);
4316 } else if (current_function == NULL) {
4317 if (old_storage_class != STORAGE_CLASS_STATIC &&
4318 new_storage_class == STORAGE_CLASS_STATIC) {
4320 "static declaration of '%Y' follows non-static declaration (declared %P)",
4321 symbol, &previous_entity->base.source_position);
4322 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4323 prev_decl->storage_class = STORAGE_CLASS_NONE;
4324 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4326 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4328 goto error_redeclaration;
4329 goto warn_redundant_declaration;
4331 } else if (is_type_valid(prev_type)) {
4332 if (old_storage_class == new_storage_class) {
4333 error_redeclaration:
4334 errorf(pos, "redeclaration of '%Y' (declared %P)",
4335 symbol, &previous_entity->base.source_position);
4338 "redeclaration of '%Y' with different linkage (declared %P)",
4339 symbol, &previous_entity->base.source_position);
4344 prev_decl->modifiers |= decl->modifiers;
4345 if (entity->kind == ENTITY_FUNCTION) {
4346 previous_entity->function.is_inline |= entity->function.is_inline;
4348 return previous_entity;
4351 if (warning.shadow) {
4352 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4353 get_entity_kind_name(entity->kind), symbol,
4354 get_entity_kind_name(previous_entity->kind),
4355 &previous_entity->base.source_position);
4359 if (entity->kind == ENTITY_FUNCTION) {
4360 if (is_definition &&
4361 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4362 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4363 warningf(pos, "no previous prototype for '%#T'",
4364 entity->declaration.type, symbol);
4365 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4366 warningf(pos, "no previous declaration for '%#T'",
4367 entity->declaration.type, symbol);
4370 } else if (warning.missing_declarations &&
4371 entity->kind == ENTITY_VARIABLE &&
4372 current_scope == file_scope) {
4373 declaration_t *declaration = &entity->declaration;
4374 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4375 warningf(pos, "no previous declaration for '%#T'",
4376 declaration->type, symbol);
4381 assert(entity->base.parent_scope == NULL);
4382 assert(current_scope != NULL);
4384 entity->base.parent_scope = current_scope;
4385 entity->base.namespc = NAMESPACE_NORMAL;
4386 environment_push(entity);
4387 append_entity(current_scope, entity);
4392 static void parser_error_multiple_definition(entity_t *entity,
4393 const source_position_t *source_position)
4395 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4396 entity->base.symbol, &entity->base.source_position);
4399 static bool is_declaration_specifier(const token_t *token,
4400 bool only_specifiers_qualifiers)
4402 switch (token->type) {
4407 return is_typedef_symbol(token->symbol);
4409 case T___extension__:
4411 return !only_specifiers_qualifiers;
4418 static void parse_init_declarator_rest(entity_t *entity)
4420 assert(is_declaration(entity));
4421 declaration_t *const declaration = &entity->declaration;
4425 type_t *orig_type = declaration->type;
4426 type_t *type = skip_typeref(orig_type);
4428 if (entity->kind == ENTITY_VARIABLE
4429 && entity->variable.initializer != NULL) {
4430 parser_error_multiple_definition(entity, HERE);
4433 bool must_be_constant = false;
4434 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4435 entity->base.parent_scope == file_scope) {
4436 must_be_constant = true;
4439 if (is_type_function(type)) {
4440 errorf(&entity->base.source_position,
4441 "function '%#T' is initialized like a variable",
4442 orig_type, entity->base.symbol);
4443 orig_type = type_error_type;
4446 parse_initializer_env_t env;
4447 env.type = orig_type;
4448 env.must_be_constant = must_be_constant;
4449 env.entity = entity;
4450 current_init_decl = entity;
4452 initializer_t *initializer = parse_initializer(&env);
4453 current_init_decl = NULL;
4455 if (entity->kind == ENTITY_VARIABLE) {
4456 /* §6.7.5:22 array initializers for arrays with unknown size
4457 * determine the array type size */
4458 declaration->type = env.type;
4459 entity->variable.initializer = initializer;
4463 /* parse rest of a declaration without any declarator */
4464 static void parse_anonymous_declaration_rest(
4465 const declaration_specifiers_t *specifiers)
4468 anonymous_entity = NULL;
4470 if (warning.other) {
4471 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4472 specifiers->thread_local) {
4473 warningf(&specifiers->source_position,
4474 "useless storage class in empty declaration");
4477 type_t *type = specifiers->type;
4478 switch (type->kind) {
4479 case TYPE_COMPOUND_STRUCT:
4480 case TYPE_COMPOUND_UNION: {
4481 if (type->compound.compound->base.symbol == NULL) {
4482 warningf(&specifiers->source_position,
4483 "unnamed struct/union that defines no instances");
4492 warningf(&specifiers->source_position, "empty declaration");
4498 static void check_variable_type_complete(entity_t *ent)
4500 if (ent->kind != ENTITY_VARIABLE)
4503 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4504 * type for the object shall be complete [...] */
4505 declaration_t *decl = &ent->declaration;
4506 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4507 decl->storage_class == STORAGE_CLASS_STATIC)
4510 type_t *const orig_type = decl->type;
4511 type_t *const type = skip_typeref(orig_type);
4512 if (!is_type_incomplete(type))
4515 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4516 * are given length one. */
4517 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4518 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4522 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4523 orig_type, ent->base.symbol);
4527 static void parse_declaration_rest(entity_t *ndeclaration,
4528 const declaration_specifiers_t *specifiers,
4529 parsed_declaration_func finished_declaration,
4530 declarator_flags_t flags)
4532 add_anchor_token(';');
4533 add_anchor_token(',');
4535 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4537 if (token.type == '=') {
4538 parse_init_declarator_rest(entity);
4539 } else if (entity->kind == ENTITY_VARIABLE) {
4540 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4541 * [...] where the extern specifier is explicitly used. */
4542 declaration_t *decl = &entity->declaration;
4543 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4544 type_t *type = decl->type;
4545 if (is_type_reference(skip_typeref(type))) {
4546 errorf(&entity->base.source_position,
4547 "reference '%#T' must be initialized",
4548 type, entity->base.symbol);
4553 check_variable_type_complete(entity);
4558 add_anchor_token('=');
4559 ndeclaration = parse_declarator(specifiers, flags);
4560 rem_anchor_token('=');
4562 expect(';', end_error);
4565 anonymous_entity = NULL;
4566 rem_anchor_token(';');
4567 rem_anchor_token(',');
4570 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4572 symbol_t *symbol = entity->base.symbol;
4573 if (symbol == NULL) {
4574 errorf(HERE, "anonymous declaration not valid as function parameter");
4578 assert(entity->base.namespc == NAMESPACE_NORMAL);
4579 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4580 if (previous_entity == NULL
4581 || previous_entity->base.parent_scope != current_scope) {
4582 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4587 if (is_definition) {
4588 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4591 return record_entity(entity, false);
4594 static void parse_declaration(parsed_declaration_func finished_declaration,
4595 declarator_flags_t flags)
4597 declaration_specifiers_t specifiers;
4598 memset(&specifiers, 0, sizeof(specifiers));
4600 add_anchor_token(';');
4601 parse_declaration_specifiers(&specifiers);
4602 rem_anchor_token(';');
4604 if (token.type == ';') {
4605 parse_anonymous_declaration_rest(&specifiers);
4607 entity_t *entity = parse_declarator(&specifiers, flags);
4608 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4613 static type_t *get_default_promoted_type(type_t *orig_type)
4615 type_t *result = orig_type;
4617 type_t *type = skip_typeref(orig_type);
4618 if (is_type_integer(type)) {
4619 result = promote_integer(type);
4620 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4621 result = type_double;
4627 static void parse_kr_declaration_list(entity_t *entity)
4629 if (entity->kind != ENTITY_FUNCTION)
4632 type_t *type = skip_typeref(entity->declaration.type);
4633 assert(is_type_function(type));
4634 if (!type->function.kr_style_parameters)
4637 add_anchor_token('{');
4639 /* push function parameters */
4640 size_t const top = environment_top();
4641 scope_t *old_scope = scope_push(&entity->function.parameters);
4643 entity_t *parameter = entity->function.parameters.entities;
4644 for ( ; parameter != NULL; parameter = parameter->base.next) {
4645 assert(parameter->base.parent_scope == NULL);
4646 parameter->base.parent_scope = current_scope;
4647 environment_push(parameter);
4650 /* parse declaration list */
4652 switch (token.type) {
4654 case T___extension__:
4655 /* This covers symbols, which are no type, too, and results in
4656 * better error messages. The typical cases are misspelled type
4657 * names and missing includes. */
4659 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4667 /* pop function parameters */
4668 assert(current_scope == &entity->function.parameters);
4669 scope_pop(old_scope);
4670 environment_pop_to(top);
4672 /* update function type */
4673 type_t *new_type = duplicate_type(type);
4675 function_parameter_t *parameters = NULL;
4676 function_parameter_t **anchor = ¶meters;
4678 /* did we have an earlier prototype? */
4679 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4680 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4683 function_parameter_t *proto_parameter = NULL;
4684 if (proto_type != NULL) {
4685 type_t *proto_type_type = proto_type->declaration.type;
4686 proto_parameter = proto_type_type->function.parameters;
4687 /* If a K&R function definition has a variadic prototype earlier, then
4688 * make the function definition variadic, too. This should conform to
4689 * §6.7.5.3:15 and §6.9.1:8. */
4690 new_type->function.variadic = proto_type_type->function.variadic;
4692 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4694 new_type->function.unspecified_parameters = true;
4697 bool need_incompatible_warning = false;
4698 parameter = entity->function.parameters.entities;
4699 for (; parameter != NULL; parameter = parameter->base.next,
4701 proto_parameter == NULL ? NULL : proto_parameter->next) {
4702 if (parameter->kind != ENTITY_PARAMETER)
4705 type_t *parameter_type = parameter->declaration.type;
4706 if (parameter_type == NULL) {
4708 errorf(HERE, "no type specified for function parameter '%Y'",
4709 parameter->base.symbol);
4710 parameter_type = type_error_type;
4712 if (warning.implicit_int) {
4713 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4714 parameter->base.symbol);
4716 parameter_type = type_int;
4718 parameter->declaration.type = parameter_type;
4721 semantic_parameter_incomplete(parameter);
4723 /* we need the default promoted types for the function type */
4724 type_t *not_promoted = parameter_type;
4725 parameter_type = get_default_promoted_type(parameter_type);
4727 /* gcc special: if the type of the prototype matches the unpromoted
4728 * type don't promote */
4729 if (!strict_mode && proto_parameter != NULL) {
4730 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4731 type_t *promo_skip = skip_typeref(parameter_type);
4732 type_t *param_skip = skip_typeref(not_promoted);
4733 if (!types_compatible(proto_p_type, promo_skip)
4734 && types_compatible(proto_p_type, param_skip)) {
4736 need_incompatible_warning = true;
4737 parameter_type = not_promoted;
4740 function_parameter_t *const parameter
4741 = allocate_parameter(parameter_type);
4743 *anchor = parameter;
4744 anchor = ¶meter->next;
4747 new_type->function.parameters = parameters;
4748 new_type = identify_new_type(new_type);
4750 if (warning.other && need_incompatible_warning) {
4751 type_t *proto_type_type = proto_type->declaration.type;
4753 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4754 proto_type_type, proto_type->base.symbol,
4755 new_type, entity->base.symbol,
4756 &proto_type->base.source_position);
4759 entity->declaration.type = new_type;
4761 rem_anchor_token('{');
4764 static bool first_err = true;
4767 * When called with first_err set, prints the name of the current function,
4770 static void print_in_function(void)
4774 diagnosticf("%s: In function '%Y':\n",
4775 current_function->base.base.source_position.input_name,
4776 current_function->base.base.symbol);
4781 * Check if all labels are defined in the current function.
4782 * Check if all labels are used in the current function.
4784 static void check_labels(void)
4786 for (const goto_statement_t *goto_statement = goto_first;
4787 goto_statement != NULL;
4788 goto_statement = goto_statement->next) {
4789 /* skip computed gotos */
4790 if (goto_statement->expression != NULL)
4793 label_t *label = goto_statement->label;
4796 if (label->base.source_position.input_name == NULL) {
4797 print_in_function();
4798 errorf(&goto_statement->base.source_position,
4799 "label '%Y' used but not defined", label->base.symbol);
4803 if (warning.unused_label) {
4804 for (const label_statement_t *label_statement = label_first;
4805 label_statement != NULL;
4806 label_statement = label_statement->next) {
4807 label_t *label = label_statement->label;
4809 if (! label->used) {
4810 print_in_function();
4811 warningf(&label_statement->base.source_position,
4812 "label '%Y' defined but not used", label->base.symbol);
4818 static void warn_unused_entity(entity_t *entity, entity_t *last)
4820 entity_t const *const end = last != NULL ? last->base.next : NULL;
4821 for (; entity != end; entity = entity->base.next) {
4822 if (!is_declaration(entity))
4825 declaration_t *declaration = &entity->declaration;
4826 if (declaration->implicit)
4829 if (!declaration->used) {
4830 print_in_function();
4831 const char *what = get_entity_kind_name(entity->kind);
4832 warningf(&entity->base.source_position, "%s '%Y' is unused",
4833 what, entity->base.symbol);
4834 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4835 print_in_function();
4836 const char *what = get_entity_kind_name(entity->kind);
4837 warningf(&entity->base.source_position, "%s '%Y' is never read",
4838 what, entity->base.symbol);
4843 static void check_unused_variables(statement_t *const stmt, void *const env)
4847 switch (stmt->kind) {
4848 case STATEMENT_DECLARATION: {
4849 declaration_statement_t const *const decls = &stmt->declaration;
4850 warn_unused_entity(decls->declarations_begin,
4851 decls->declarations_end);
4856 warn_unused_entity(stmt->fors.scope.entities, NULL);
4865 * Check declarations of current_function for unused entities.
4867 static void check_declarations(void)
4869 if (warning.unused_parameter) {
4870 const scope_t *scope = ¤t_function->parameters;
4872 /* do not issue unused warnings for main */
4873 if (!is_sym_main(current_function->base.base.symbol)) {
4874 warn_unused_entity(scope->entities, NULL);
4877 if (warning.unused_variable) {
4878 walk_statements(current_function->statement, check_unused_variables,
4883 static int determine_truth(expression_t const* const cond)
4886 !is_constant_expression(cond) ? 0 :
4887 fold_constant_to_bool(cond) ? 1 :
4891 static void check_reachable(statement_t *);
4892 static bool reaches_end;
4894 static bool expression_returns(expression_t const *const expr)
4896 switch (expr->kind) {
4898 expression_t const *const func = expr->call.function;
4899 if (func->kind == EXPR_REFERENCE) {
4900 entity_t *entity = func->reference.entity;
4901 if (entity->kind == ENTITY_FUNCTION
4902 && entity->declaration.modifiers & DM_NORETURN)
4906 if (!expression_returns(func))
4909 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4910 if (!expression_returns(arg->expression))
4917 case EXPR_REFERENCE:
4918 case EXPR_REFERENCE_ENUM_VALUE:
4920 case EXPR_STRING_LITERAL:
4921 case EXPR_WIDE_STRING_LITERAL:
4922 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4923 case EXPR_LABEL_ADDRESS:
4924 case EXPR_CLASSIFY_TYPE:
4925 case EXPR_SIZEOF: // TODO handle obscure VLA case
4928 case EXPR_BUILTIN_CONSTANT_P:
4929 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4934 case EXPR_STATEMENT: {
4935 bool old_reaches_end = reaches_end;
4936 reaches_end = false;
4937 check_reachable(expr->statement.statement);
4938 bool returns = reaches_end;
4939 reaches_end = old_reaches_end;
4943 case EXPR_CONDITIONAL:
4944 // TODO handle constant expression
4946 if (!expression_returns(expr->conditional.condition))
4949 if (expr->conditional.true_expression != NULL
4950 && expression_returns(expr->conditional.true_expression))
4953 return expression_returns(expr->conditional.false_expression);
4956 return expression_returns(expr->select.compound);
4958 case EXPR_ARRAY_ACCESS:
4960 expression_returns(expr->array_access.array_ref) &&
4961 expression_returns(expr->array_access.index);
4964 return expression_returns(expr->va_starte.ap);
4967 return expression_returns(expr->va_arge.ap);
4970 return expression_returns(expr->va_copye.src);
4972 EXPR_UNARY_CASES_MANDATORY
4973 return expression_returns(expr->unary.value);
4975 case EXPR_UNARY_THROW:
4979 // TODO handle constant lhs of && and ||
4981 expression_returns(expr->binary.left) &&
4982 expression_returns(expr->binary.right);
4988 panic("unhandled expression");
4991 static bool initializer_returns(initializer_t const *const init)
4993 switch (init->kind) {
4994 case INITIALIZER_VALUE:
4995 return expression_returns(init->value.value);
4997 case INITIALIZER_LIST: {
4998 initializer_t * const* i = init->list.initializers;
4999 initializer_t * const* const end = i + init->list.len;
5000 bool returns = true;
5001 for (; i != end; ++i) {
5002 if (!initializer_returns(*i))
5008 case INITIALIZER_STRING:
5009 case INITIALIZER_WIDE_STRING:
5010 case INITIALIZER_DESIGNATOR: // designators have no payload
5013 panic("unhandled initializer");
5016 static bool noreturn_candidate;
5018 static void check_reachable(statement_t *const stmt)
5020 if (stmt->base.reachable)
5022 if (stmt->kind != STATEMENT_DO_WHILE)
5023 stmt->base.reachable = true;
5025 statement_t *last = stmt;
5027 switch (stmt->kind) {
5028 case STATEMENT_INVALID:
5029 case STATEMENT_EMPTY:
5031 next = stmt->base.next;
5034 case STATEMENT_DECLARATION: {
5035 declaration_statement_t const *const decl = &stmt->declaration;
5036 entity_t const * ent = decl->declarations_begin;
5037 entity_t const *const last = decl->declarations_end;
5039 for (;; ent = ent->base.next) {
5040 if (ent->kind == ENTITY_VARIABLE &&
5041 ent->variable.initializer != NULL &&
5042 !initializer_returns(ent->variable.initializer)) {
5049 next = stmt->base.next;
5053 case STATEMENT_COMPOUND:
5054 next = stmt->compound.statements;
5056 next = stmt->base.next;
5059 case STATEMENT_RETURN: {
5060 expression_t const *const val = stmt->returns.value;
5061 if (val == NULL || expression_returns(val))
5062 noreturn_candidate = false;
5066 case STATEMENT_IF: {
5067 if_statement_t const *const ifs = &stmt->ifs;
5068 expression_t const *const cond = ifs->condition;
5070 if (!expression_returns(cond))
5073 int const val = determine_truth(cond);
5076 check_reachable(ifs->true_statement);
5081 if (ifs->false_statement != NULL) {
5082 check_reachable(ifs->false_statement);
5086 next = stmt->base.next;
5090 case STATEMENT_SWITCH: {
5091 switch_statement_t const *const switchs = &stmt->switchs;
5092 expression_t const *const expr = switchs->expression;
5094 if (!expression_returns(expr))
5097 if (is_constant_expression(expr)) {
5098 long const val = fold_constant_to_int(expr);
5099 case_label_statement_t * defaults = NULL;
5100 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5101 if (i->expression == NULL) {
5106 if (i->first_case <= val && val <= i->last_case) {
5107 check_reachable((statement_t*)i);
5112 if (defaults != NULL) {
5113 check_reachable((statement_t*)defaults);
5117 bool has_default = false;
5118 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5119 if (i->expression == NULL)
5122 check_reachable((statement_t*)i);
5129 next = stmt->base.next;
5133 case STATEMENT_EXPRESSION: {
5134 /* Check for noreturn function call */
5135 expression_t const *const expr = stmt->expression.expression;
5136 if (!expression_returns(expr))
5139 next = stmt->base.next;
5143 case STATEMENT_CONTINUE:
5144 for (statement_t *parent = stmt;;) {
5145 parent = parent->base.parent;
5146 if (parent == NULL) /* continue not within loop */
5150 switch (parent->kind) {
5151 case STATEMENT_WHILE: goto continue_while;
5152 case STATEMENT_DO_WHILE: goto continue_do_while;
5153 case STATEMENT_FOR: goto continue_for;
5159 case STATEMENT_BREAK:
5160 for (statement_t *parent = stmt;;) {
5161 parent = parent->base.parent;
5162 if (parent == NULL) /* break not within loop/switch */
5165 switch (parent->kind) {
5166 case STATEMENT_SWITCH:
5167 case STATEMENT_WHILE:
5168 case STATEMENT_DO_WHILE:
5171 next = parent->base.next;
5172 goto found_break_parent;
5180 case STATEMENT_GOTO:
5181 if (stmt->gotos.expression) {
5182 if (!expression_returns(stmt->gotos.expression))
5185 statement_t *parent = stmt->base.parent;
5186 if (parent == NULL) /* top level goto */
5190 next = stmt->gotos.label->statement;
5191 if (next == NULL) /* missing label */
5196 case STATEMENT_LABEL:
5197 next = stmt->label.statement;
5200 case STATEMENT_CASE_LABEL:
5201 next = stmt->case_label.statement;
5204 case STATEMENT_WHILE: {
5205 while_statement_t const *const whiles = &stmt->whiles;
5206 expression_t const *const cond = whiles->condition;
5208 if (!expression_returns(cond))
5211 int const val = determine_truth(cond);
5214 check_reachable(whiles->body);
5219 next = stmt->base.next;
5223 case STATEMENT_DO_WHILE:
5224 next = stmt->do_while.body;
5227 case STATEMENT_FOR: {
5228 for_statement_t *const fors = &stmt->fors;
5230 if (fors->condition_reachable)
5232 fors->condition_reachable = true;
5234 expression_t const *const cond = fors->condition;
5239 } else if (expression_returns(cond)) {
5240 val = determine_truth(cond);
5246 check_reachable(fors->body);
5251 next = stmt->base.next;
5255 case STATEMENT_MS_TRY: {
5256 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5257 check_reachable(ms_try->try_statement);
5258 next = ms_try->final_statement;
5262 case STATEMENT_LEAVE: {
5263 statement_t *parent = stmt;
5265 parent = parent->base.parent;
5266 if (parent == NULL) /* __leave not within __try */
5269 if (parent->kind == STATEMENT_MS_TRY) {
5271 next = parent->ms_try.final_statement;
5279 panic("invalid statement kind");
5282 while (next == NULL) {
5283 next = last->base.parent;
5285 noreturn_candidate = false;
5287 type_t *const type = skip_typeref(current_function->base.type);
5288 assert(is_type_function(type));
5289 type_t *const ret = skip_typeref(type->function.return_type);
5290 if (warning.return_type &&
5291 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5292 is_type_valid(ret) &&
5293 !is_sym_main(current_function->base.base.symbol)) {
5294 warningf(&stmt->base.source_position,
5295 "control reaches end of non-void function");
5300 switch (next->kind) {
5301 case STATEMENT_INVALID:
5302 case STATEMENT_EMPTY:
5303 case STATEMENT_DECLARATION:
5304 case STATEMENT_EXPRESSION:
5306 case STATEMENT_RETURN:
5307 case STATEMENT_CONTINUE:
5308 case STATEMENT_BREAK:
5309 case STATEMENT_GOTO:
5310 case STATEMENT_LEAVE:
5311 panic("invalid control flow in function");
5313 case STATEMENT_COMPOUND:
5314 if (next->compound.stmt_expr) {
5320 case STATEMENT_SWITCH:
5321 case STATEMENT_LABEL:
5322 case STATEMENT_CASE_LABEL:
5324 next = next->base.next;
5327 case STATEMENT_WHILE: {
5329 if (next->base.reachable)
5331 next->base.reachable = true;
5333 while_statement_t const *const whiles = &next->whiles;
5334 expression_t const *const cond = whiles->condition;
5336 if (!expression_returns(cond))
5339 int const val = determine_truth(cond);
5342 check_reachable(whiles->body);
5348 next = next->base.next;
5352 case STATEMENT_DO_WHILE: {
5354 if (next->base.reachable)
5356 next->base.reachable = true;
5358 do_while_statement_t const *const dw = &next->do_while;
5359 expression_t const *const cond = dw->condition;
5361 if (!expression_returns(cond))
5364 int const val = determine_truth(cond);
5367 check_reachable(dw->body);
5373 next = next->base.next;
5377 case STATEMENT_FOR: {
5379 for_statement_t *const fors = &next->fors;
5381 fors->step_reachable = true;
5383 if (fors->condition_reachable)
5385 fors->condition_reachable = true;
5387 expression_t const *const cond = fors->condition;
5392 } else if (expression_returns(cond)) {
5393 val = determine_truth(cond);
5399 check_reachable(fors->body);
5405 next = next->base.next;
5409 case STATEMENT_MS_TRY:
5411 next = next->ms_try.final_statement;
5416 check_reachable(next);
5419 static void check_unreachable(statement_t* const stmt, void *const env)
5423 switch (stmt->kind) {
5424 case STATEMENT_DO_WHILE:
5425 if (!stmt->base.reachable) {
5426 expression_t const *const cond = stmt->do_while.condition;
5427 if (determine_truth(cond) >= 0) {
5428 warningf(&cond->base.source_position,
5429 "condition of do-while-loop is unreachable");
5434 case STATEMENT_FOR: {
5435 for_statement_t const* const fors = &stmt->fors;
5437 // if init and step are unreachable, cond is unreachable, too
5438 if (!stmt->base.reachable && !fors->step_reachable) {
5439 warningf(&stmt->base.source_position, "statement is unreachable");
5441 if (!stmt->base.reachable && fors->initialisation != NULL) {
5442 warningf(&fors->initialisation->base.source_position,
5443 "initialisation of for-statement is unreachable");
5446 if (!fors->condition_reachable && fors->condition != NULL) {
5447 warningf(&fors->condition->base.source_position,
5448 "condition of for-statement is unreachable");
5451 if (!fors->step_reachable && fors->step != NULL) {
5452 warningf(&fors->step->base.source_position,
5453 "step of for-statement is unreachable");
5459 case STATEMENT_COMPOUND:
5460 if (stmt->compound.statements != NULL)
5462 goto warn_unreachable;
5464 case STATEMENT_DECLARATION: {
5465 /* Only warn if there is at least one declarator with an initializer.
5466 * This typically occurs in switch statements. */
5467 declaration_statement_t const *const decl = &stmt->declaration;
5468 entity_t const * ent = decl->declarations_begin;
5469 entity_t const *const last = decl->declarations_end;
5471 for (;; ent = ent->base.next) {
5472 if (ent->kind == ENTITY_VARIABLE &&
5473 ent->variable.initializer != NULL) {
5474 goto warn_unreachable;
5484 if (!stmt->base.reachable)
5485 warningf(&stmt->base.source_position, "statement is unreachable");
5490 static void parse_external_declaration(void)
5492 /* function-definitions and declarations both start with declaration
5494 declaration_specifiers_t specifiers;
5495 memset(&specifiers, 0, sizeof(specifiers));
5497 add_anchor_token(';');
5498 parse_declaration_specifiers(&specifiers);
5499 rem_anchor_token(';');
5501 /* must be a declaration */
5502 if (token.type == ';') {
5503 parse_anonymous_declaration_rest(&specifiers);
5507 add_anchor_token(',');
5508 add_anchor_token('=');
5509 add_anchor_token(';');
5510 add_anchor_token('{');
5512 /* declarator is common to both function-definitions and declarations */
5513 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5515 rem_anchor_token('{');
5516 rem_anchor_token(';');
5517 rem_anchor_token('=');
5518 rem_anchor_token(',');
5520 /* must be a declaration */
5521 switch (token.type) {
5525 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5530 /* must be a function definition */
5531 parse_kr_declaration_list(ndeclaration);
5533 if (token.type != '{') {
5534 parse_error_expected("while parsing function definition", '{', NULL);
5535 eat_until_matching_token(';');
5539 assert(is_declaration(ndeclaration));
5540 type_t *const orig_type = ndeclaration->declaration.type;
5541 type_t * type = skip_typeref(orig_type);
5543 if (!is_type_function(type)) {
5544 if (is_type_valid(type)) {
5545 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5546 type, ndeclaration->base.symbol);
5550 } else if (is_typeref(orig_type)) {
5552 errorf(&ndeclaration->base.source_position,
5553 "type of function definition '%#T' is a typedef",
5554 orig_type, ndeclaration->base.symbol);
5557 if (warning.aggregate_return &&
5558 is_type_compound(skip_typeref(type->function.return_type))) {
5559 warningf(HERE, "function '%Y' returns an aggregate",
5560 ndeclaration->base.symbol);
5562 if (warning.traditional && !type->function.unspecified_parameters) {
5563 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5564 ndeclaration->base.symbol);
5566 if (warning.old_style_definition && type->function.unspecified_parameters) {
5567 warningf(HERE, "old-style function definition '%Y'",
5568 ndeclaration->base.symbol);
5571 /* §6.7.5.3:14 a function definition with () means no
5572 * parameters (and not unspecified parameters) */
5573 if (type->function.unspecified_parameters &&
5574 type->function.parameters == NULL) {
5575 type_t *copy = duplicate_type(type);
5576 copy->function.unspecified_parameters = false;
5577 type = identify_new_type(copy);
5579 ndeclaration->declaration.type = type;
5582 entity_t *const entity = record_entity(ndeclaration, true);
5583 assert(entity->kind == ENTITY_FUNCTION);
5584 assert(ndeclaration->kind == ENTITY_FUNCTION);
5586 function_t *function = &entity->function;
5587 if (ndeclaration != entity) {
5588 function->parameters = ndeclaration->function.parameters;
5590 assert(is_declaration(entity));
5591 type = skip_typeref(entity->declaration.type);
5593 /* push function parameters and switch scope */
5594 size_t const top = environment_top();
5595 scope_t *old_scope = scope_push(&function->parameters);
5597 entity_t *parameter = function->parameters.entities;
5598 for (; parameter != NULL; parameter = parameter->base.next) {
5599 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5600 parameter->base.parent_scope = current_scope;
5602 assert(parameter->base.parent_scope == NULL
5603 || parameter->base.parent_scope == current_scope);
5604 parameter->base.parent_scope = current_scope;
5605 if (parameter->base.symbol == NULL) {
5606 errorf(¶meter->base.source_position, "parameter name omitted");
5609 environment_push(parameter);
5612 if (function->statement != NULL) {
5613 parser_error_multiple_definition(entity, HERE);
5616 /* parse function body */
5617 int label_stack_top = label_top();
5618 function_t *old_current_function = current_function;
5619 entity_t *old_current_entity = current_entity;
5620 current_function = function;
5621 current_entity = (entity_t*) function;
5622 current_parent = NULL;
5625 goto_anchor = &goto_first;
5627 label_anchor = &label_first;
5629 statement_t *const body = parse_compound_statement(false);
5630 function->statement = body;
5633 check_declarations();
5634 if (warning.return_type ||
5635 warning.unreachable_code ||
5636 (warning.missing_noreturn
5637 && !(function->base.modifiers & DM_NORETURN))) {
5638 noreturn_candidate = true;
5639 check_reachable(body);
5640 if (warning.unreachable_code)
5641 walk_statements(body, check_unreachable, NULL);
5642 if (warning.missing_noreturn &&
5643 noreturn_candidate &&
5644 !(function->base.modifiers & DM_NORETURN)) {
5645 warningf(&body->base.source_position,
5646 "function '%#T' is candidate for attribute 'noreturn'",
5647 type, entity->base.symbol);
5651 assert(current_parent == NULL);
5652 assert(current_function == function);
5653 assert(current_entity == (entity_t*) function);
5654 current_entity = old_current_entity;
5655 current_function = old_current_function;
5656 label_pop_to(label_stack_top);
5659 assert(current_scope == &function->parameters);
5660 scope_pop(old_scope);
5661 environment_pop_to(top);
5664 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5665 source_position_t *source_position,
5666 const symbol_t *symbol)
5668 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5670 type->bitfield.base_type = base_type;
5671 type->bitfield.size_expression = size;
5674 type_t *skipped_type = skip_typeref(base_type);
5675 if (!is_type_integer(skipped_type)) {
5676 errorf(HERE, "bitfield base type '%T' is not an integer type",
5680 bit_size = get_type_size(base_type) * 8;
5683 if (is_constant_expression(size)) {
5684 long v = fold_constant_to_int(size);
5685 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5688 errorf(source_position, "negative width in bit-field '%Y'",
5690 } else if (v == 0 && symbol != NULL) {
5691 errorf(source_position, "zero width for bit-field '%Y'",
5693 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5694 errorf(source_position, "width of '%Y' exceeds its type",
5697 type->bitfield.bit_size = v;
5704 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5706 entity_t *iter = compound->members.entities;
5707 for (; iter != NULL; iter = iter->base.next) {
5708 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5711 if (iter->base.symbol == symbol) {
5713 } else if (iter->base.symbol == NULL) {
5714 /* search in anonymous structs and unions */
5715 type_t *type = skip_typeref(iter->declaration.type);
5716 if (is_type_compound(type)) {
5717 if (find_compound_entry(type->compound.compound, symbol)
5728 static void check_deprecated(const source_position_t *source_position,
5729 const entity_t *entity)
5731 if (!warning.deprecated_declarations)
5733 if (!is_declaration(entity))
5735 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5738 char const *const prefix = get_entity_kind_name(entity->kind);
5739 const char *deprecated_string
5740 = get_deprecated_string(entity->declaration.attributes);
5741 if (deprecated_string != NULL) {
5742 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5743 prefix, entity->base.symbol, &entity->base.source_position,
5746 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5747 entity->base.symbol, &entity->base.source_position);
5752 static expression_t *create_select(const source_position_t *pos,
5754 type_qualifiers_t qualifiers,
5757 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5759 check_deprecated(pos, entry);
5761 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5762 select->select.compound = addr;
5763 select->select.compound_entry = entry;
5765 type_t *entry_type = entry->declaration.type;
5766 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5768 /* we always do the auto-type conversions; the & and sizeof parser contains
5769 * code to revert this! */
5770 select->base.type = automatic_type_conversion(res_type);
5771 if (res_type->kind == TYPE_BITFIELD) {
5772 select->base.type = res_type->bitfield.base_type;
5779 * Find entry with symbol in compound. Search anonymous structs and unions and
5780 * creates implicit select expressions for them.
5781 * Returns the adress for the innermost compound.
5783 static expression_t *find_create_select(const source_position_t *pos,
5785 type_qualifiers_t qualifiers,
5786 compound_t *compound, symbol_t *symbol)
5788 entity_t *iter = compound->members.entities;
5789 for (; iter != NULL; iter = iter->base.next) {
5790 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5793 symbol_t *iter_symbol = iter->base.symbol;
5794 if (iter_symbol == NULL) {
5795 type_t *type = iter->declaration.type;
5796 if (type->kind != TYPE_COMPOUND_STRUCT
5797 && type->kind != TYPE_COMPOUND_UNION)
5800 compound_t *sub_compound = type->compound.compound;
5802 if (find_compound_entry(sub_compound, symbol) == NULL)
5805 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5806 sub_addr->base.source_position = *pos;
5807 sub_addr->select.implicit = true;
5808 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5812 if (iter_symbol == symbol) {
5813 return create_select(pos, addr, qualifiers, iter);
5820 static void parse_compound_declarators(compound_t *compound,
5821 const declaration_specifiers_t *specifiers)
5826 if (token.type == ':') {
5827 source_position_t source_position = *HERE;
5830 type_t *base_type = specifiers->type;
5831 expression_t *size = parse_constant_expression();
5833 type_t *type = make_bitfield_type(base_type, size,
5834 &source_position, NULL);
5836 attribute_t *attributes = parse_attributes(NULL);
5837 attribute_t **anchor = &attributes;
5838 while (*anchor != NULL)
5839 anchor = &(*anchor)->next;
5840 *anchor = specifiers->attributes;
5842 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5843 entity->base.namespc = NAMESPACE_NORMAL;
5844 entity->base.source_position = source_position;
5845 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5846 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5847 entity->declaration.type = type;
5848 entity->declaration.attributes = attributes;
5850 if (attributes != NULL) {
5851 handle_entity_attributes(attributes, entity);
5853 append_entity(&compound->members, entity);
5855 entity = parse_declarator(specifiers,
5856 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5857 if (entity->kind == ENTITY_TYPEDEF) {
5858 errorf(&entity->base.source_position,
5859 "typedef not allowed as compound member");
5861 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5863 /* make sure we don't define a symbol multiple times */
5864 symbol_t *symbol = entity->base.symbol;
5865 if (symbol != NULL) {
5866 entity_t *prev = find_compound_entry(compound, symbol);
5868 errorf(&entity->base.source_position,
5869 "multiple declarations of symbol '%Y' (declared %P)",
5870 symbol, &prev->base.source_position);
5874 if (token.type == ':') {
5875 source_position_t source_position = *HERE;
5877 expression_t *size = parse_constant_expression();
5879 type_t *type = entity->declaration.type;
5880 type_t *bitfield_type = make_bitfield_type(type, size,
5881 &source_position, entity->base.symbol);
5883 attribute_t *attributes = parse_attributes(NULL);
5884 entity->declaration.type = bitfield_type;
5885 handle_entity_attributes(attributes, entity);
5887 type_t *orig_type = entity->declaration.type;
5888 type_t *type = skip_typeref(orig_type);
5889 if (is_type_function(type)) {
5890 errorf(&entity->base.source_position,
5891 "compound member '%Y' must not have function type '%T'",
5892 entity->base.symbol, orig_type);
5893 } else if (is_type_incomplete(type)) {
5894 /* §6.7.2.1:16 flexible array member */
5895 if (!is_type_array(type) ||
5896 token.type != ';' ||
5897 look_ahead(1)->type != '}') {
5898 errorf(&entity->base.source_position,
5899 "compound member '%Y' has incomplete type '%T'",
5900 entity->base.symbol, orig_type);
5905 append_entity(&compound->members, entity);
5908 } while (next_if(','));
5909 expect(';', end_error);
5912 anonymous_entity = NULL;
5915 static void parse_compound_type_entries(compound_t *compound)
5918 add_anchor_token('}');
5920 while (token.type != '}') {
5921 if (token.type == T_EOF) {
5922 errorf(HERE, "EOF while parsing struct");
5925 declaration_specifiers_t specifiers;
5926 memset(&specifiers, 0, sizeof(specifiers));
5927 parse_declaration_specifiers(&specifiers);
5929 parse_compound_declarators(compound, &specifiers);
5931 rem_anchor_token('}');
5935 compound->complete = true;
5938 static type_t *parse_typename(void)
5940 declaration_specifiers_t specifiers;
5941 memset(&specifiers, 0, sizeof(specifiers));
5942 parse_declaration_specifiers(&specifiers);
5943 if (specifiers.storage_class != STORAGE_CLASS_NONE
5944 || specifiers.thread_local) {
5945 /* TODO: improve error message, user does probably not know what a
5946 * storage class is...
5948 errorf(HERE, "typename must not have a storage class");
5951 type_t *result = parse_abstract_declarator(specifiers.type);
5959 typedef expression_t* (*parse_expression_function)(void);
5960 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5962 typedef struct expression_parser_function_t expression_parser_function_t;
5963 struct expression_parser_function_t {
5964 parse_expression_function parser;
5965 precedence_t infix_precedence;
5966 parse_expression_infix_function infix_parser;
5969 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5972 * Prints an error message if an expression was expected but not read
5974 static expression_t *expected_expression_error(void)
5976 /* skip the error message if the error token was read */
5977 if (token.type != T_ERROR) {
5978 errorf(HERE, "expected expression, got token %K", &token);
5982 return create_invalid_expression();
5985 static type_t *get_string_type(void)
5987 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
5990 static type_t *get_wide_string_type(void)
5992 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5996 * Parse a string constant.
5998 static expression_t *parse_string_literal(void)
6000 source_position_t begin = token.source_position;
6001 string_t res = token.literal;
6002 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
6005 while (token.type == T_STRING_LITERAL
6006 || token.type == T_WIDE_STRING_LITERAL) {
6007 warn_string_concat(&token.source_position);
6008 res = concat_strings(&res, &token.literal);
6010 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6013 expression_t *literal;
6015 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6016 literal->base.type = get_wide_string_type();
6018 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6019 literal->base.type = get_string_type();
6021 literal->base.source_position = begin;
6022 literal->literal.value = res;
6028 * Parse a boolean constant.
6030 static expression_t *parse_boolean_literal(bool value)
6032 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6033 literal->base.source_position = token.source_position;
6034 literal->base.type = type_bool;
6035 literal->literal.value.begin = value ? "true" : "false";
6036 literal->literal.value.size = value ? 4 : 5;
6042 static void warn_traditional_suffix(void)
6044 if (!warning.traditional)
6046 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6050 static void check_integer_suffix(void)
6052 symbol_t *suffix = token.symbol;
6056 bool not_traditional = false;
6057 const char *c = suffix->string;
6058 if (*c == 'l' || *c == 'L') {
6061 not_traditional = true;
6063 if (*c == 'u' || *c == 'U') {
6066 } else if (*c == 'u' || *c == 'U') {
6067 not_traditional = true;
6070 } else if (*c == 'u' || *c == 'U') {
6071 not_traditional = true;
6073 if (*c == 'l' || *c == 'L') {
6081 errorf(&token.source_position,
6082 "invalid suffix '%s' on integer constant", suffix->string);
6083 } else if (not_traditional) {
6084 warn_traditional_suffix();
6088 static type_t *check_floatingpoint_suffix(void)
6090 symbol_t *suffix = token.symbol;
6091 type_t *type = type_double;
6095 bool not_traditional = false;
6096 const char *c = suffix->string;
6097 if (*c == 'f' || *c == 'F') {
6100 } else if (*c == 'l' || *c == 'L') {
6102 type = type_long_double;
6105 errorf(&token.source_position,
6106 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6107 } else if (not_traditional) {
6108 warn_traditional_suffix();
6115 * Parse an integer constant.
6117 static expression_t *parse_number_literal(void)
6119 expression_kind_t kind;
6122 switch (token.type) {
6124 kind = EXPR_LITERAL_INTEGER;
6125 check_integer_suffix();
6128 case T_INTEGER_OCTAL:
6129 kind = EXPR_LITERAL_INTEGER_OCTAL;
6130 check_integer_suffix();
6133 case T_INTEGER_HEXADECIMAL:
6134 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6135 check_integer_suffix();
6138 case T_FLOATINGPOINT:
6139 kind = EXPR_LITERAL_FLOATINGPOINT;
6140 type = check_floatingpoint_suffix();
6142 case T_FLOATINGPOINT_HEXADECIMAL:
6143 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6144 type = check_floatingpoint_suffix();
6147 panic("unexpected token type in parse_number_literal");
6150 expression_t *literal = allocate_expression_zero(kind);
6151 literal->base.source_position = token.source_position;
6152 literal->base.type = type;
6153 literal->literal.value = token.literal;
6154 literal->literal.suffix = token.symbol;
6157 /* integer type depends on the size of the number and the size
6158 * representable by the types. The backend/codegeneration has to determine
6161 determine_literal_type(&literal->literal);
6166 * Parse a character constant.
6168 static expression_t *parse_character_constant(void)
6170 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6171 literal->base.source_position = token.source_position;
6172 literal->base.type = c_mode & _CXX ? type_char : type_int;
6173 literal->literal.value = token.literal;
6175 size_t len = literal->literal.value.size;
6177 if (!GNU_MODE && !(c_mode & _C99)) {
6178 errorf(HERE, "more than 1 character in character constant");
6179 } else if (warning.multichar) {
6180 literal->base.type = type_int;
6181 warningf(HERE, "multi-character character constant");
6190 * Parse a wide character constant.
6192 static expression_t *parse_wide_character_constant(void)
6194 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6195 literal->base.source_position = token.source_position;
6196 literal->base.type = type_int;
6197 literal->literal.value = token.literal;
6199 size_t len = wstrlen(&literal->literal.value);
6201 warningf(HERE, "multi-character character constant");
6208 static entity_t *create_implicit_function(symbol_t *symbol,
6209 const source_position_t *source_position)
6211 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6212 ntype->function.return_type = type_int;
6213 ntype->function.unspecified_parameters = true;
6214 ntype->function.linkage = LINKAGE_C;
6215 type_t *type = identify_new_type(ntype);
6217 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6218 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6219 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6220 entity->declaration.type = type;
6221 entity->declaration.implicit = true;
6222 entity->base.symbol = symbol;
6223 entity->base.source_position = *source_position;
6225 if (current_scope != NULL) {
6226 bool strict_prototypes_old = warning.strict_prototypes;
6227 warning.strict_prototypes = false;
6228 record_entity(entity, false);
6229 warning.strict_prototypes = strict_prototypes_old;
6236 * Performs automatic type cast as described in §6.3.2.1.
6238 * @param orig_type the original type
6240 static type_t *automatic_type_conversion(type_t *orig_type)
6242 type_t *type = skip_typeref(orig_type);
6243 if (is_type_array(type)) {
6244 array_type_t *array_type = &type->array;
6245 type_t *element_type = array_type->element_type;
6246 unsigned qualifiers = array_type->base.qualifiers;
6248 return make_pointer_type(element_type, qualifiers);
6251 if (is_type_function(type)) {
6252 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6259 * reverts the automatic casts of array to pointer types and function
6260 * to function-pointer types as defined §6.3.2.1
6262 type_t *revert_automatic_type_conversion(const expression_t *expression)
6264 switch (expression->kind) {
6265 case EXPR_REFERENCE: {
6266 entity_t *entity = expression->reference.entity;
6267 if (is_declaration(entity)) {
6268 return entity->declaration.type;
6269 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6270 return entity->enum_value.enum_type;
6272 panic("no declaration or enum in reference");
6277 entity_t *entity = expression->select.compound_entry;
6278 assert(is_declaration(entity));
6279 type_t *type = entity->declaration.type;
6280 return get_qualified_type(type,
6281 expression->base.type->base.qualifiers);
6284 case EXPR_UNARY_DEREFERENCE: {
6285 const expression_t *const value = expression->unary.value;
6286 type_t *const type = skip_typeref(value->base.type);
6287 if (!is_type_pointer(type))
6288 return type_error_type;
6289 return type->pointer.points_to;
6292 case EXPR_ARRAY_ACCESS: {
6293 const expression_t *array_ref = expression->array_access.array_ref;
6294 type_t *type_left = skip_typeref(array_ref->base.type);
6295 if (!is_type_pointer(type_left))
6296 return type_error_type;
6297 return type_left->pointer.points_to;
6300 case EXPR_STRING_LITERAL: {
6301 size_t size = expression->string_literal.value.size;
6302 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6305 case EXPR_WIDE_STRING_LITERAL: {
6306 size_t size = wstrlen(&expression->string_literal.value);
6307 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6310 case EXPR_COMPOUND_LITERAL:
6311 return expression->compound_literal.type;
6316 return expression->base.type;
6320 * Find an entity matching a symbol in a scope.
6321 * Uses current scope if scope is NULL
6323 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6324 namespace_tag_t namespc)
6326 if (scope == NULL) {
6327 return get_entity(symbol, namespc);
6330 /* we should optimize here, if scope grows above a certain size we should
6331 construct a hashmap here... */
6332 entity_t *entity = scope->entities;
6333 for ( ; entity != NULL; entity = entity->base.next) {
6334 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6341 static entity_t *parse_qualified_identifier(void)
6343 /* namespace containing the symbol */
6345 source_position_t pos;
6346 const scope_t *lookup_scope = NULL;
6348 if (next_if(T_COLONCOLON))
6349 lookup_scope = &unit->scope;
6353 if (token.type != T_IDENTIFIER) {
6354 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6355 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6357 symbol = token.symbol;
6362 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6364 if (!next_if(T_COLONCOLON))
6367 switch (entity->kind) {
6368 case ENTITY_NAMESPACE:
6369 lookup_scope = &entity->namespacee.members;
6374 lookup_scope = &entity->compound.members;
6377 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6378 symbol, get_entity_kind_name(entity->kind));
6383 if (entity == NULL) {
6384 if (!strict_mode && token.type == '(') {
6385 /* an implicitly declared function */
6386 if (warning.error_implicit_function_declaration) {
6387 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6388 } else if (warning.implicit_function_declaration) {
6389 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6392 entity = create_implicit_function(symbol, &pos);
6394 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6395 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6402 /* skip further qualifications */
6403 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6405 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6408 static expression_t *parse_reference(void)
6410 entity_t *entity = parse_qualified_identifier();
6413 if (is_declaration(entity)) {
6414 orig_type = entity->declaration.type;
6415 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6416 orig_type = entity->enum_value.enum_type;
6418 panic("expected declaration or enum value in reference");
6421 /* we always do the auto-type conversions; the & and sizeof parser contains
6422 * code to revert this! */
6423 type_t *type = automatic_type_conversion(orig_type);
6425 expression_kind_t kind = EXPR_REFERENCE;
6426 if (entity->kind == ENTITY_ENUM_VALUE)
6427 kind = EXPR_REFERENCE_ENUM_VALUE;
6429 expression_t *expression = allocate_expression_zero(kind);
6430 expression->reference.entity = entity;
6431 expression->base.type = type;
6433 /* this declaration is used */
6434 if (is_declaration(entity)) {
6435 entity->declaration.used = true;
6438 if (entity->base.parent_scope != file_scope
6439 && (current_function != NULL
6440 && entity->base.parent_scope->depth < current_function->parameters.depth)
6441 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6442 if (entity->kind == ENTITY_VARIABLE) {
6443 /* access of a variable from an outer function */
6444 entity->variable.address_taken = true;
6445 } else if (entity->kind == ENTITY_PARAMETER) {
6446 entity->parameter.address_taken = true;
6448 current_function->need_closure = true;
6451 check_deprecated(HERE, entity);
6453 if (warning.init_self && entity == current_init_decl && !in_type_prop
6454 && entity->kind == ENTITY_VARIABLE) {
6455 current_init_decl = NULL;
6456 warningf(HERE, "variable '%#T' is initialized by itself",
6457 entity->declaration.type, entity->base.symbol);
6463 static bool semantic_cast(expression_t *cast)
6465 expression_t *expression = cast->unary.value;
6466 type_t *orig_dest_type = cast->base.type;
6467 type_t *orig_type_right = expression->base.type;
6468 type_t const *dst_type = skip_typeref(orig_dest_type);
6469 type_t const *src_type = skip_typeref(orig_type_right);
6470 source_position_t const *pos = &cast->base.source_position;
6472 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6473 if (dst_type == type_void)
6476 /* only integer and pointer can be casted to pointer */
6477 if (is_type_pointer(dst_type) &&
6478 !is_type_pointer(src_type) &&
6479 !is_type_integer(src_type) &&
6480 is_type_valid(src_type)) {
6481 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6485 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6486 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6490 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6491 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6495 if (warning.cast_qual &&
6496 is_type_pointer(src_type) &&
6497 is_type_pointer(dst_type)) {
6498 type_t *src = skip_typeref(src_type->pointer.points_to);
6499 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6500 unsigned missing_qualifiers =
6501 src->base.qualifiers & ~dst->base.qualifiers;
6502 if (missing_qualifiers != 0) {
6504 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6505 missing_qualifiers, orig_type_right);
6511 static expression_t *parse_compound_literal(type_t *type)
6513 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6515 parse_initializer_env_t env;
6518 env.must_be_constant = false;
6519 initializer_t *initializer = parse_initializer(&env);
6522 expression->compound_literal.initializer = initializer;
6523 expression->compound_literal.type = type;
6524 expression->base.type = automatic_type_conversion(type);
6530 * Parse a cast expression.
6532 static expression_t *parse_cast(void)
6534 add_anchor_token(')');
6536 source_position_t source_position = token.source_position;
6538 type_t *type = parse_typename();
6540 rem_anchor_token(')');
6541 expect(')', end_error);
6543 if (token.type == '{') {
6544 return parse_compound_literal(type);
6547 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6548 cast->base.source_position = source_position;
6550 expression_t *value = parse_subexpression(PREC_CAST);
6551 cast->base.type = type;
6552 cast->unary.value = value;
6554 if (! semantic_cast(cast)) {
6555 /* TODO: record the error in the AST. else it is impossible to detect it */
6560 return create_invalid_expression();
6564 * Parse a statement expression.
6566 static expression_t *parse_statement_expression(void)
6568 add_anchor_token(')');
6570 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6572 statement_t *statement = parse_compound_statement(true);
6573 statement->compound.stmt_expr = true;
6574 expression->statement.statement = statement;
6576 /* find last statement and use its type */
6577 type_t *type = type_void;
6578 const statement_t *stmt = statement->compound.statements;
6580 while (stmt->base.next != NULL)
6581 stmt = stmt->base.next;
6583 if (stmt->kind == STATEMENT_EXPRESSION) {
6584 type = stmt->expression.expression->base.type;
6586 } else if (warning.other) {
6587 warningf(&expression->base.source_position, "empty statement expression ({})");
6589 expression->base.type = type;
6591 rem_anchor_token(')');
6592 expect(')', end_error);
6599 * Parse a parenthesized expression.
6601 static expression_t *parse_parenthesized_expression(void)
6605 switch (token.type) {
6607 /* gcc extension: a statement expression */
6608 return parse_statement_expression();
6612 return parse_cast();
6614 if (is_typedef_symbol(token.symbol)) {
6615 return parse_cast();
6619 add_anchor_token(')');
6620 expression_t *result = parse_expression();
6621 result->base.parenthesized = true;
6622 rem_anchor_token(')');
6623 expect(')', end_error);
6629 static expression_t *parse_function_keyword(void)
6633 if (current_function == NULL) {
6634 errorf(HERE, "'__func__' used outside of a function");
6637 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6638 expression->base.type = type_char_ptr;
6639 expression->funcname.kind = FUNCNAME_FUNCTION;
6646 static expression_t *parse_pretty_function_keyword(void)
6648 if (current_function == NULL) {
6649 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6652 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6653 expression->base.type = type_char_ptr;
6654 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6656 eat(T___PRETTY_FUNCTION__);
6661 static expression_t *parse_funcsig_keyword(void)
6663 if (current_function == NULL) {
6664 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6667 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6668 expression->base.type = type_char_ptr;
6669 expression->funcname.kind = FUNCNAME_FUNCSIG;
6676 static expression_t *parse_funcdname_keyword(void)
6678 if (current_function == NULL) {
6679 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6682 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6683 expression->base.type = type_char_ptr;
6684 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6686 eat(T___FUNCDNAME__);
6691 static designator_t *parse_designator(void)
6693 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6694 result->source_position = *HERE;
6696 if (token.type != T_IDENTIFIER) {
6697 parse_error_expected("while parsing member designator",
6698 T_IDENTIFIER, NULL);
6701 result->symbol = token.symbol;
6704 designator_t *last_designator = result;
6707 if (token.type != T_IDENTIFIER) {
6708 parse_error_expected("while parsing member designator",
6709 T_IDENTIFIER, NULL);
6712 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6713 designator->source_position = *HERE;
6714 designator->symbol = token.symbol;
6717 last_designator->next = designator;
6718 last_designator = designator;
6722 add_anchor_token(']');
6723 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6724 designator->source_position = *HERE;
6725 designator->array_index = parse_expression();
6726 rem_anchor_token(']');
6727 expect(']', end_error);
6728 if (designator->array_index == NULL) {
6732 last_designator->next = designator;
6733 last_designator = designator;
6745 * Parse the __builtin_offsetof() expression.
6747 static expression_t *parse_offsetof(void)
6749 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6750 expression->base.type = type_size_t;
6752 eat(T___builtin_offsetof);
6754 expect('(', end_error);
6755 add_anchor_token(',');
6756 type_t *type = parse_typename();
6757 rem_anchor_token(',');
6758 expect(',', end_error);
6759 add_anchor_token(')');
6760 designator_t *designator = parse_designator();
6761 rem_anchor_token(')');
6762 expect(')', end_error);
6764 expression->offsetofe.type = type;
6765 expression->offsetofe.designator = designator;
6768 memset(&path, 0, sizeof(path));
6769 path.top_type = type;
6770 path.path = NEW_ARR_F(type_path_entry_t, 0);
6772 descend_into_subtype(&path);
6774 if (!walk_designator(&path, designator, true)) {
6775 return create_invalid_expression();
6778 DEL_ARR_F(path.path);
6782 return create_invalid_expression();
6786 * Parses a _builtin_va_start() expression.
6788 static expression_t *parse_va_start(void)
6790 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6792 eat(T___builtin_va_start);
6794 expect('(', end_error);
6795 add_anchor_token(',');
6796 expression->va_starte.ap = parse_assignment_expression();
6797 rem_anchor_token(',');
6798 expect(',', end_error);
6799 expression_t *const expr = parse_assignment_expression();
6800 if (expr->kind == EXPR_REFERENCE) {
6801 entity_t *const entity = expr->reference.entity;
6802 if (!current_function->base.type->function.variadic) {
6803 errorf(&expr->base.source_position,
6804 "'va_start' used in non-variadic function");
6805 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6806 entity->base.next != NULL ||
6807 entity->kind != ENTITY_PARAMETER) {
6808 errorf(&expr->base.source_position,
6809 "second argument of 'va_start' must be last parameter of the current function");
6811 expression->va_starte.parameter = &entity->variable;
6813 expect(')', end_error);
6816 expect(')', end_error);
6818 return create_invalid_expression();
6822 * Parses a __builtin_va_arg() expression.
6824 static expression_t *parse_va_arg(void)
6826 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6828 eat(T___builtin_va_arg);
6830 expect('(', end_error);
6832 ap.expression = parse_assignment_expression();
6833 expression->va_arge.ap = ap.expression;
6834 check_call_argument(type_valist, &ap, 1);
6836 expect(',', end_error);
6837 expression->base.type = parse_typename();
6838 expect(')', end_error);
6842 return create_invalid_expression();
6846 * Parses a __builtin_va_copy() expression.
6848 static expression_t *parse_va_copy(void)
6850 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6852 eat(T___builtin_va_copy);
6854 expect('(', end_error);
6855 expression_t *dst = parse_assignment_expression();
6856 assign_error_t error = semantic_assign(type_valist, dst);
6857 report_assign_error(error, type_valist, dst, "call argument 1",
6858 &dst->base.source_position);
6859 expression->va_copye.dst = dst;
6861 expect(',', end_error);
6863 call_argument_t src;
6864 src.expression = parse_assignment_expression();
6865 check_call_argument(type_valist, &src, 2);
6866 expression->va_copye.src = src.expression;
6867 expect(')', end_error);
6871 return create_invalid_expression();
6875 * Parses a __builtin_constant_p() expression.
6877 static expression_t *parse_builtin_constant(void)
6879 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6881 eat(T___builtin_constant_p);
6883 expect('(', end_error);
6884 add_anchor_token(')');
6885 expression->builtin_constant.value = parse_assignment_expression();
6886 rem_anchor_token(')');
6887 expect(')', end_error);
6888 expression->base.type = type_int;
6892 return create_invalid_expression();
6896 * Parses a __builtin_types_compatible_p() expression.
6898 static expression_t *parse_builtin_types_compatible(void)
6900 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6902 eat(T___builtin_types_compatible_p);
6904 expect('(', end_error);
6905 add_anchor_token(')');
6906 add_anchor_token(',');
6907 expression->builtin_types_compatible.left = parse_typename();
6908 rem_anchor_token(',');
6909 expect(',', end_error);
6910 expression->builtin_types_compatible.right = parse_typename();
6911 rem_anchor_token(')');
6912 expect(')', end_error);
6913 expression->base.type = type_int;
6917 return create_invalid_expression();
6921 * Parses a __builtin_is_*() compare expression.
6923 static expression_t *parse_compare_builtin(void)
6925 expression_t *expression;
6927 switch (token.type) {
6928 case T___builtin_isgreater:
6929 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6931 case T___builtin_isgreaterequal:
6932 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6934 case T___builtin_isless:
6935 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6937 case T___builtin_islessequal:
6938 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6940 case T___builtin_islessgreater:
6941 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6943 case T___builtin_isunordered:
6944 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6947 internal_errorf(HERE, "invalid compare builtin found");
6949 expression->base.source_position = *HERE;
6952 expect('(', end_error);
6953 expression->binary.left = parse_assignment_expression();
6954 expect(',', end_error);
6955 expression->binary.right = parse_assignment_expression();
6956 expect(')', end_error);
6958 type_t *const orig_type_left = expression->binary.left->base.type;
6959 type_t *const orig_type_right = expression->binary.right->base.type;
6961 type_t *const type_left = skip_typeref(orig_type_left);
6962 type_t *const type_right = skip_typeref(orig_type_right);
6963 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6964 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6965 type_error_incompatible("invalid operands in comparison",
6966 &expression->base.source_position, orig_type_left, orig_type_right);
6969 semantic_comparison(&expression->binary);
6974 return create_invalid_expression();
6978 * Parses a MS assume() expression.
6980 static expression_t *parse_assume(void)
6982 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6986 expect('(', end_error);
6987 add_anchor_token(')');
6988 expression->unary.value = parse_assignment_expression();
6989 rem_anchor_token(')');
6990 expect(')', end_error);
6992 expression->base.type = type_void;
6995 return create_invalid_expression();
6999 * Return the declaration for a given label symbol or create a new one.
7001 * @param symbol the symbol of the label
7003 static label_t *get_label(symbol_t *symbol)
7006 assert(current_function != NULL);
7008 label = get_entity(symbol, NAMESPACE_LABEL);
7009 /* if we found a local label, we already created the declaration */
7010 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7011 if (label->base.parent_scope != current_scope) {
7012 assert(label->base.parent_scope->depth < current_scope->depth);
7013 current_function->goto_to_outer = true;
7015 return &label->label;
7018 label = get_entity(symbol, NAMESPACE_LABEL);
7019 /* if we found a label in the same function, then we already created the
7022 && label->base.parent_scope == ¤t_function->parameters) {
7023 return &label->label;
7026 /* otherwise we need to create a new one */
7027 label = allocate_entity_zero(ENTITY_LABEL);
7028 label->base.namespc = NAMESPACE_LABEL;
7029 label->base.symbol = symbol;
7033 return &label->label;
7037 * Parses a GNU && label address expression.
7039 static expression_t *parse_label_address(void)
7041 source_position_t source_position = token.source_position;
7043 if (token.type != T_IDENTIFIER) {
7044 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7047 symbol_t *symbol = token.symbol;
7050 label_t *label = get_label(symbol);
7052 label->address_taken = true;
7054 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7055 expression->base.source_position = source_position;
7057 /* label address is threaten as a void pointer */
7058 expression->base.type = type_void_ptr;
7059 expression->label_address.label = label;
7062 return create_invalid_expression();
7066 * Parse a microsoft __noop expression.
7068 static expression_t *parse_noop_expression(void)
7070 /* the result is a (int)0 */
7071 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7072 literal->base.type = type_int;
7073 literal->base.source_position = token.source_position;
7074 literal->literal.value.begin = "__noop";
7075 literal->literal.value.size = 6;
7079 if (token.type == '(') {
7080 /* parse arguments */
7082 add_anchor_token(')');
7083 add_anchor_token(',');
7085 if (token.type != ')') do {
7086 (void)parse_assignment_expression();
7087 } while (next_if(','));
7089 rem_anchor_token(',');
7090 rem_anchor_token(')');
7091 expect(')', end_error);
7098 * Parses a primary expression.
7100 static expression_t *parse_primary_expression(void)
7102 switch (token.type) {
7103 case T_false: return parse_boolean_literal(false);
7104 case T_true: return parse_boolean_literal(true);
7106 case T_INTEGER_OCTAL:
7107 case T_INTEGER_HEXADECIMAL:
7108 case T_FLOATINGPOINT:
7109 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7110 case T_CHARACTER_CONSTANT: return parse_character_constant();
7111 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7112 case T_STRING_LITERAL:
7113 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7114 case T___FUNCTION__:
7115 case T___func__: return parse_function_keyword();
7116 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7117 case T___FUNCSIG__: return parse_funcsig_keyword();
7118 case T___FUNCDNAME__: return parse_funcdname_keyword();
7119 case T___builtin_offsetof: return parse_offsetof();
7120 case T___builtin_va_start: return parse_va_start();
7121 case T___builtin_va_arg: return parse_va_arg();
7122 case T___builtin_va_copy: return parse_va_copy();
7123 case T___builtin_isgreater:
7124 case T___builtin_isgreaterequal:
7125 case T___builtin_isless:
7126 case T___builtin_islessequal:
7127 case T___builtin_islessgreater:
7128 case T___builtin_isunordered: return parse_compare_builtin();
7129 case T___builtin_constant_p: return parse_builtin_constant();
7130 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7131 case T__assume: return parse_assume();
7134 return parse_label_address();
7137 case '(': return parse_parenthesized_expression();
7138 case T___noop: return parse_noop_expression();
7140 /* Gracefully handle type names while parsing expressions. */
7142 return parse_reference();
7144 if (!is_typedef_symbol(token.symbol)) {
7145 return parse_reference();
7149 source_position_t const pos = *HERE;
7150 type_t const *const type = parse_typename();
7151 errorf(&pos, "encountered type '%T' while parsing expression", type);
7152 return create_invalid_expression();
7156 errorf(HERE, "unexpected token %K, expected an expression", &token);
7158 return create_invalid_expression();
7162 * Check if the expression has the character type and issue a warning then.
7164 static void check_for_char_index_type(const expression_t *expression)
7166 type_t *const type = expression->base.type;
7167 const type_t *const base_type = skip_typeref(type);
7169 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7170 warning.char_subscripts) {
7171 warningf(&expression->base.source_position,
7172 "array subscript has type '%T'", type);
7176 static expression_t *parse_array_expression(expression_t *left)
7178 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7181 add_anchor_token(']');
7183 expression_t *inside = parse_expression();
7185 type_t *const orig_type_left = left->base.type;
7186 type_t *const orig_type_inside = inside->base.type;
7188 type_t *const type_left = skip_typeref(orig_type_left);
7189 type_t *const type_inside = skip_typeref(orig_type_inside);
7191 type_t *return_type;
7192 array_access_expression_t *array_access = &expression->array_access;
7193 if (is_type_pointer(type_left)) {
7194 return_type = type_left->pointer.points_to;
7195 array_access->array_ref = left;
7196 array_access->index = inside;
7197 check_for_char_index_type(inside);
7198 } else if (is_type_pointer(type_inside)) {
7199 return_type = type_inside->pointer.points_to;
7200 array_access->array_ref = inside;
7201 array_access->index = left;
7202 array_access->flipped = true;
7203 check_for_char_index_type(left);
7205 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7207 "array access on object with non-pointer types '%T', '%T'",
7208 orig_type_left, orig_type_inside);
7210 return_type = type_error_type;
7211 array_access->array_ref = left;
7212 array_access->index = inside;
7215 expression->base.type = automatic_type_conversion(return_type);
7217 rem_anchor_token(']');
7218 expect(']', end_error);
7223 static expression_t *parse_typeprop(expression_kind_t const kind)
7225 expression_t *tp_expression = allocate_expression_zero(kind);
7226 tp_expression->base.type = type_size_t;
7228 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7230 /* we only refer to a type property, mark this case */
7231 bool old = in_type_prop;
7232 in_type_prop = true;
7235 expression_t *expression;
7236 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7238 add_anchor_token(')');
7239 orig_type = parse_typename();
7240 rem_anchor_token(')');
7241 expect(')', end_error);
7243 if (token.type == '{') {
7244 /* It was not sizeof(type) after all. It is sizeof of an expression
7245 * starting with a compound literal */
7246 expression = parse_compound_literal(orig_type);
7247 goto typeprop_expression;
7250 expression = parse_subexpression(PREC_UNARY);
7252 typeprop_expression:
7253 tp_expression->typeprop.tp_expression = expression;
7255 orig_type = revert_automatic_type_conversion(expression);
7256 expression->base.type = orig_type;
7259 tp_expression->typeprop.type = orig_type;
7260 type_t const* const type = skip_typeref(orig_type);
7261 char const* const wrong_type =
7262 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7263 is_type_incomplete(type) ? "incomplete" :
7264 type->kind == TYPE_FUNCTION ? "function designator" :
7265 type->kind == TYPE_BITFIELD ? "bitfield" :
7267 if (wrong_type != NULL) {
7268 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7269 errorf(&tp_expression->base.source_position,
7270 "operand of %s expression must not be of %s type '%T'",
7271 what, wrong_type, orig_type);
7276 return tp_expression;
7279 static expression_t *parse_sizeof(void)
7281 return parse_typeprop(EXPR_SIZEOF);
7284 static expression_t *parse_alignof(void)
7286 return parse_typeprop(EXPR_ALIGNOF);
7289 static expression_t *parse_select_expression(expression_t *addr)
7291 assert(token.type == '.' || token.type == T_MINUSGREATER);
7292 bool select_left_arrow = (token.type == T_MINUSGREATER);
7295 if (token.type != T_IDENTIFIER) {
7296 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7297 return create_invalid_expression();
7299 symbol_t *symbol = token.symbol;
7302 type_t *const orig_type = addr->base.type;
7303 type_t *const type = skip_typeref(orig_type);
7306 bool saw_error = false;
7307 if (is_type_pointer(type)) {
7308 if (!select_left_arrow) {
7310 "request for member '%Y' in something not a struct or union, but '%T'",
7314 type_left = skip_typeref(type->pointer.points_to);
7316 if (select_left_arrow && is_type_valid(type)) {
7317 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7323 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7324 type_left->kind != TYPE_COMPOUND_UNION) {
7326 if (is_type_valid(type_left) && !saw_error) {
7328 "request for member '%Y' in something not a struct or union, but '%T'",
7331 return create_invalid_expression();
7334 compound_t *compound = type_left->compound.compound;
7335 if (!compound->complete) {
7336 errorf(HERE, "request for member '%Y' in incomplete type '%T'",
7338 return create_invalid_expression();
7341 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7342 expression_t *result
7343 = find_create_select(HERE, addr, qualifiers, compound, symbol);
7345 if (result == NULL) {
7346 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7347 return create_invalid_expression();
7353 static void check_call_argument(type_t *expected_type,
7354 call_argument_t *argument, unsigned pos)
7356 type_t *expected_type_skip = skip_typeref(expected_type);
7357 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7358 expression_t *arg_expr = argument->expression;
7359 type_t *arg_type = skip_typeref(arg_expr->base.type);
7361 /* handle transparent union gnu extension */
7362 if (is_type_union(expected_type_skip)
7363 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7364 compound_t *union_decl = expected_type_skip->compound.compound;
7365 type_t *best_type = NULL;
7366 entity_t *entry = union_decl->members.entities;
7367 for ( ; entry != NULL; entry = entry->base.next) {
7368 assert(is_declaration(entry));
7369 type_t *decl_type = entry->declaration.type;
7370 error = semantic_assign(decl_type, arg_expr);
7371 if (error == ASSIGN_ERROR_INCOMPATIBLE
7372 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7375 if (error == ASSIGN_SUCCESS) {
7376 best_type = decl_type;
7377 } else if (best_type == NULL) {
7378 best_type = decl_type;
7382 if (best_type != NULL) {
7383 expected_type = best_type;
7387 error = semantic_assign(expected_type, arg_expr);
7388 argument->expression = create_implicit_cast(arg_expr, expected_type);
7390 if (error != ASSIGN_SUCCESS) {
7391 /* report exact scope in error messages (like "in argument 3") */
7393 snprintf(buf, sizeof(buf), "call argument %u", pos);
7394 report_assign_error(error, expected_type, arg_expr, buf,
7395 &arg_expr->base.source_position);
7396 } else if (warning.traditional || warning.conversion) {
7397 type_t *const promoted_type = get_default_promoted_type(arg_type);
7398 if (!types_compatible(expected_type_skip, promoted_type) &&
7399 !types_compatible(expected_type_skip, type_void_ptr) &&
7400 !types_compatible(type_void_ptr, promoted_type)) {
7401 /* Deliberately show the skipped types in this warning */
7402 warningf(&arg_expr->base.source_position,
7403 "passing call argument %u as '%T' rather than '%T' due to prototype",
7404 pos, expected_type_skip, promoted_type);
7410 * Handle the semantic restrictions of builtin calls
7412 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7413 switch (call->function->reference.entity->function.btk) {
7414 case bk_gnu_builtin_return_address:
7415 case bk_gnu_builtin_frame_address: {
7416 /* argument must be constant */
7417 call_argument_t *argument = call->arguments;
7419 if (! is_constant_expression(argument->expression)) {
7420 errorf(&call->base.source_position,
7421 "argument of '%Y' must be a constant expression",
7422 call->function->reference.entity->base.symbol);
7426 case bk_gnu_builtin_object_size:
7427 if (call->arguments == NULL)
7430 call_argument_t *arg = call->arguments->next;
7431 if (arg != NULL && ! is_constant_expression(arg->expression)) {
7432 errorf(&call->base.source_position,
7433 "second argument of '%Y' must be a constant expression",
7434 call->function->reference.entity->base.symbol);
7437 case bk_gnu_builtin_prefetch:
7438 /* second and third argument must be constant if existent */
7439 if (call->arguments == NULL)
7441 call_argument_t *rw = call->arguments->next;
7442 call_argument_t *locality = NULL;
7445 if (! is_constant_expression(rw->expression)) {
7446 errorf(&call->base.source_position,
7447 "second argument of '%Y' must be a constant expression",
7448 call->function->reference.entity->base.symbol);
7450 locality = rw->next;
7452 if (locality != NULL) {
7453 if (! is_constant_expression(locality->expression)) {
7454 errorf(&call->base.source_position,
7455 "third argument of '%Y' must be a constant expression",
7456 call->function->reference.entity->base.symbol);
7458 locality = rw->next;
7467 * Parse a call expression, ie. expression '( ... )'.
7469 * @param expression the function address
7471 static expression_t *parse_call_expression(expression_t *expression)
7473 expression_t *result = allocate_expression_zero(EXPR_CALL);
7474 call_expression_t *call = &result->call;
7475 call->function = expression;
7477 type_t *const orig_type = expression->base.type;
7478 type_t *const type = skip_typeref(orig_type);
7480 function_type_t *function_type = NULL;
7481 if (is_type_pointer(type)) {
7482 type_t *const to_type = skip_typeref(type->pointer.points_to);
7484 if (is_type_function(to_type)) {
7485 function_type = &to_type->function;
7486 call->base.type = function_type->return_type;
7490 if (function_type == NULL && is_type_valid(type)) {
7492 "called object '%E' (type '%T') is not a pointer to a function",
7493 expression, orig_type);
7496 /* parse arguments */
7498 add_anchor_token(')');
7499 add_anchor_token(',');
7501 if (token.type != ')') {
7502 call_argument_t **anchor = &call->arguments;
7504 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7505 argument->expression = parse_assignment_expression();
7508 anchor = &argument->next;
7509 } while (next_if(','));
7511 rem_anchor_token(',');
7512 rem_anchor_token(')');
7513 expect(')', end_error);
7515 if (function_type == NULL)
7518 /* check type and count of call arguments */
7519 function_parameter_t *parameter = function_type->parameters;
7520 call_argument_t *argument = call->arguments;
7521 if (!function_type->unspecified_parameters) {
7522 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7523 parameter = parameter->next, argument = argument->next) {
7524 check_call_argument(parameter->type, argument, ++pos);
7527 if (parameter != NULL) {
7528 errorf(HERE, "too few arguments to function '%E'", expression);
7529 } else if (argument != NULL && !function_type->variadic) {
7530 errorf(HERE, "too many arguments to function '%E'", expression);
7534 /* do default promotion for other arguments */
7535 for (; argument != NULL; argument = argument->next) {
7536 type_t *type = argument->expression->base.type;
7537 if (!is_type_object(skip_typeref(type))) {
7538 errorf(&argument->expression->base.source_position,
7539 "call argument '%E' must not be void", argument->expression);
7542 type = get_default_promoted_type(type);
7544 argument->expression
7545 = create_implicit_cast(argument->expression, type);
7548 check_format(&result->call);
7550 if (warning.aggregate_return &&
7551 is_type_compound(skip_typeref(function_type->return_type))) {
7552 warningf(&result->base.source_position,
7553 "function call has aggregate value");
7556 if (call->function->kind == EXPR_REFERENCE) {
7557 reference_expression_t *reference = &call->function->reference;
7558 if (reference->entity->kind == ENTITY_FUNCTION &&
7559 reference->entity->function.btk != bk_none)
7560 handle_builtin_argument_restrictions(call);
7567 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7569 static bool same_compound_type(const type_t *type1, const type_t *type2)
7572 is_type_compound(type1) &&
7573 type1->kind == type2->kind &&
7574 type1->compound.compound == type2->compound.compound;
7577 static expression_t const *get_reference_address(expression_t const *expr)
7579 bool regular_take_address = true;
7581 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7582 expr = expr->unary.value;
7584 regular_take_address = false;
7587 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7590 expr = expr->unary.value;
7593 if (expr->kind != EXPR_REFERENCE)
7596 /* special case for functions which are automatically converted to a
7597 * pointer to function without an extra TAKE_ADDRESS operation */
7598 if (!regular_take_address &&
7599 expr->reference.entity->kind != ENTITY_FUNCTION) {
7606 static void warn_reference_address_as_bool(expression_t const* expr)
7608 if (!warning.address)
7611 expr = get_reference_address(expr);
7613 warningf(&expr->base.source_position,
7614 "the address of '%Y' will always evaluate as 'true'",
7615 expr->reference.entity->base.symbol);
7619 static void warn_assignment_in_condition(const expression_t *const expr)
7621 if (!warning.parentheses)
7623 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7625 if (expr->base.parenthesized)
7627 warningf(&expr->base.source_position,
7628 "suggest parentheses around assignment used as truth value");
7631 static void semantic_condition(expression_t const *const expr,
7632 char const *const context)
7634 type_t *const type = skip_typeref(expr->base.type);
7635 if (is_type_scalar(type)) {
7636 warn_reference_address_as_bool(expr);
7637 warn_assignment_in_condition(expr);
7638 } else if (is_type_valid(type)) {
7639 errorf(&expr->base.source_position,
7640 "%s must have scalar type", context);
7645 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7647 * @param expression the conditional expression
7649 static expression_t *parse_conditional_expression(expression_t *expression)
7651 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7653 conditional_expression_t *conditional = &result->conditional;
7654 conditional->condition = expression;
7657 add_anchor_token(':');
7659 /* §6.5.15:2 The first operand shall have scalar type. */
7660 semantic_condition(expression, "condition of conditional operator");
7662 expression_t *true_expression = expression;
7663 bool gnu_cond = false;
7664 if (GNU_MODE && token.type == ':') {
7667 true_expression = parse_expression();
7669 rem_anchor_token(':');
7670 expect(':', end_error);
7672 expression_t *false_expression =
7673 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7675 type_t *const orig_true_type = true_expression->base.type;
7676 type_t *const orig_false_type = false_expression->base.type;
7677 type_t *const true_type = skip_typeref(orig_true_type);
7678 type_t *const false_type = skip_typeref(orig_false_type);
7681 type_t *result_type;
7682 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7683 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7684 /* ISO/IEC 14882:1998(E) §5.16:2 */
7685 if (true_expression->kind == EXPR_UNARY_THROW) {
7686 result_type = false_type;
7687 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7688 result_type = true_type;
7690 if (warning.other && (
7691 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7692 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7694 warningf(&conditional->base.source_position,
7695 "ISO C forbids conditional expression with only one void side");
7697 result_type = type_void;
7699 } else if (is_type_arithmetic(true_type)
7700 && is_type_arithmetic(false_type)) {
7701 result_type = semantic_arithmetic(true_type, false_type);
7702 } else if (same_compound_type(true_type, false_type)) {
7703 /* just take 1 of the 2 types */
7704 result_type = true_type;
7705 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7706 type_t *pointer_type;
7708 expression_t *other_expression;
7709 if (is_type_pointer(true_type) &&
7710 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7711 pointer_type = true_type;
7712 other_type = false_type;
7713 other_expression = false_expression;
7715 pointer_type = false_type;
7716 other_type = true_type;
7717 other_expression = true_expression;
7720 if (is_null_pointer_constant(other_expression)) {
7721 result_type = pointer_type;
7722 } else if (is_type_pointer(other_type)) {
7723 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7724 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7727 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7728 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7730 } else if (types_compatible(get_unqualified_type(to1),
7731 get_unqualified_type(to2))) {
7734 if (warning.other) {
7735 warningf(&conditional->base.source_position,
7736 "pointer types '%T' and '%T' in conditional expression are incompatible",
7737 true_type, false_type);
7742 type_t *const type =
7743 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7744 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7745 } else if (is_type_integer(other_type)) {
7746 if (warning.other) {
7747 warningf(&conditional->base.source_position,
7748 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7750 result_type = pointer_type;
7752 if (is_type_valid(other_type)) {
7753 type_error_incompatible("while parsing conditional",
7754 &expression->base.source_position, true_type, false_type);
7756 result_type = type_error_type;
7759 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7760 type_error_incompatible("while parsing conditional",
7761 &conditional->base.source_position, true_type,
7764 result_type = type_error_type;
7767 conditional->true_expression
7768 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7769 conditional->false_expression
7770 = create_implicit_cast(false_expression, result_type);
7771 conditional->base.type = result_type;
7776 * Parse an extension expression.
7778 static expression_t *parse_extension(void)
7780 eat(T___extension__);
7782 bool old_gcc_extension = in_gcc_extension;
7783 in_gcc_extension = true;
7784 expression_t *expression = parse_subexpression(PREC_UNARY);
7785 in_gcc_extension = old_gcc_extension;
7790 * Parse a __builtin_classify_type() expression.
7792 static expression_t *parse_builtin_classify_type(void)
7794 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7795 result->base.type = type_int;
7797 eat(T___builtin_classify_type);
7799 expect('(', end_error);
7800 add_anchor_token(')');
7801 expression_t *expression = parse_expression();
7802 rem_anchor_token(')');
7803 expect(')', end_error);
7804 result->classify_type.type_expression = expression;
7808 return create_invalid_expression();
7812 * Parse a delete expression
7813 * ISO/IEC 14882:1998(E) §5.3.5
7815 static expression_t *parse_delete(void)
7817 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7818 result->base.type = type_void;
7823 result->kind = EXPR_UNARY_DELETE_ARRAY;
7824 expect(']', end_error);
7828 expression_t *const value = parse_subexpression(PREC_CAST);
7829 result->unary.value = value;
7831 type_t *const type = skip_typeref(value->base.type);
7832 if (!is_type_pointer(type)) {
7833 if (is_type_valid(type)) {
7834 errorf(&value->base.source_position,
7835 "operand of delete must have pointer type");
7837 } else if (warning.other &&
7838 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7839 warningf(&value->base.source_position,
7840 "deleting 'void*' is undefined");
7847 * Parse a throw expression
7848 * ISO/IEC 14882:1998(E) §15:1
7850 static expression_t *parse_throw(void)
7852 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7853 result->base.type = type_void;
7857 expression_t *value = NULL;
7858 switch (token.type) {
7860 value = parse_assignment_expression();
7861 /* ISO/IEC 14882:1998(E) §15.1:3 */
7862 type_t *const orig_type = value->base.type;
7863 type_t *const type = skip_typeref(orig_type);
7864 if (is_type_incomplete(type)) {
7865 errorf(&value->base.source_position,
7866 "cannot throw object of incomplete type '%T'", orig_type);
7867 } else if (is_type_pointer(type)) {
7868 type_t *const points_to = skip_typeref(type->pointer.points_to);
7869 if (is_type_incomplete(points_to) &&
7870 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7871 errorf(&value->base.source_position,
7872 "cannot throw pointer to incomplete type '%T'", orig_type);
7880 result->unary.value = value;
7885 static bool check_pointer_arithmetic(const source_position_t *source_position,
7886 type_t *pointer_type,
7887 type_t *orig_pointer_type)
7889 type_t *points_to = pointer_type->pointer.points_to;
7890 points_to = skip_typeref(points_to);
7892 if (is_type_incomplete(points_to)) {
7893 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7894 errorf(source_position,
7895 "arithmetic with pointer to incomplete type '%T' not allowed",
7898 } else if (warning.pointer_arith) {
7899 warningf(source_position,
7900 "pointer of type '%T' used in arithmetic",
7903 } else if (is_type_function(points_to)) {
7905 errorf(source_position,
7906 "arithmetic with pointer to function type '%T' not allowed",
7909 } else if (warning.pointer_arith) {
7910 warningf(source_position,
7911 "pointer to a function '%T' used in arithmetic",
7918 static bool is_lvalue(const expression_t *expression)
7920 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7921 switch (expression->kind) {
7922 case EXPR_ARRAY_ACCESS:
7923 case EXPR_COMPOUND_LITERAL:
7924 case EXPR_REFERENCE:
7926 case EXPR_UNARY_DEREFERENCE:
7930 type_t *type = skip_typeref(expression->base.type);
7932 /* ISO/IEC 14882:1998(E) §3.10:3 */
7933 is_type_reference(type) ||
7934 /* Claim it is an lvalue, if the type is invalid. There was a parse
7935 * error before, which maybe prevented properly recognizing it as
7937 !is_type_valid(type);
7942 static void semantic_incdec(unary_expression_t *expression)
7944 type_t *const orig_type = expression->value->base.type;
7945 type_t *const type = skip_typeref(orig_type);
7946 if (is_type_pointer(type)) {
7947 if (!check_pointer_arithmetic(&expression->base.source_position,
7951 } else if (!is_type_real(type) && is_type_valid(type)) {
7952 /* TODO: improve error message */
7953 errorf(&expression->base.source_position,
7954 "operation needs an arithmetic or pointer type");
7957 if (!is_lvalue(expression->value)) {
7958 /* TODO: improve error message */
7959 errorf(&expression->base.source_position, "lvalue required as operand");
7961 expression->base.type = orig_type;
7964 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7966 type_t *const orig_type = expression->value->base.type;
7967 type_t *const type = skip_typeref(orig_type);
7968 if (!is_type_arithmetic(type)) {
7969 if (is_type_valid(type)) {
7970 /* TODO: improve error message */
7971 errorf(&expression->base.source_position,
7972 "operation needs an arithmetic type");
7977 expression->base.type = orig_type;
7980 static void semantic_unexpr_plus(unary_expression_t *expression)
7982 semantic_unexpr_arithmetic(expression);
7983 if (warning.traditional)
7984 warningf(&expression->base.source_position,
7985 "traditional C rejects the unary plus operator");
7988 static void semantic_not(unary_expression_t *expression)
7990 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7991 semantic_condition(expression->value, "operand of !");
7992 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7995 static void semantic_unexpr_integer(unary_expression_t *expression)
7997 type_t *const orig_type = expression->value->base.type;
7998 type_t *const type = skip_typeref(orig_type);
7999 if (!is_type_integer(type)) {
8000 if (is_type_valid(type)) {
8001 errorf(&expression->base.source_position,
8002 "operand of ~ must be of integer type");
8007 expression->base.type = orig_type;
8010 static void semantic_dereference(unary_expression_t *expression)
8012 type_t *const orig_type = expression->value->base.type;
8013 type_t *const type = skip_typeref(orig_type);
8014 if (!is_type_pointer(type)) {
8015 if (is_type_valid(type)) {
8016 errorf(&expression->base.source_position,
8017 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8022 type_t *result_type = type->pointer.points_to;
8023 result_type = automatic_type_conversion(result_type);
8024 expression->base.type = result_type;
8028 * Record that an address is taken (expression represents an lvalue).
8030 * @param expression the expression
8031 * @param may_be_register if true, the expression might be an register
8033 static void set_address_taken(expression_t *expression, bool may_be_register)
8035 if (expression->kind != EXPR_REFERENCE)
8038 entity_t *const entity = expression->reference.entity;
8040 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8043 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8044 && !may_be_register) {
8045 errorf(&expression->base.source_position,
8046 "address of register %s '%Y' requested",
8047 get_entity_kind_name(entity->kind), entity->base.symbol);
8050 if (entity->kind == ENTITY_VARIABLE) {
8051 entity->variable.address_taken = true;
8053 assert(entity->kind == ENTITY_PARAMETER);
8054 entity->parameter.address_taken = true;
8059 * Check the semantic of the address taken expression.
8061 static void semantic_take_addr(unary_expression_t *expression)
8063 expression_t *value = expression->value;
8064 value->base.type = revert_automatic_type_conversion(value);
8066 type_t *orig_type = value->base.type;
8067 type_t *type = skip_typeref(orig_type);
8068 if (!is_type_valid(type))
8072 if (!is_lvalue(value)) {
8073 errorf(&expression->base.source_position, "'&' requires an lvalue");
8075 if (type->kind == TYPE_BITFIELD) {
8076 errorf(&expression->base.source_position,
8077 "'&' not allowed on object with bitfield type '%T'",
8081 set_address_taken(value, false);
8083 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8086 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8087 static expression_t *parse_##unexpression_type(void) \
8089 expression_t *unary_expression \
8090 = allocate_expression_zero(unexpression_type); \
8092 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8094 sfunc(&unary_expression->unary); \
8096 return unary_expression; \
8099 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8100 semantic_unexpr_arithmetic)
8101 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8102 semantic_unexpr_plus)
8103 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8105 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8106 semantic_dereference)
8107 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8109 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8110 semantic_unexpr_integer)
8111 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8113 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8116 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8118 static expression_t *parse_##unexpression_type(expression_t *left) \
8120 expression_t *unary_expression \
8121 = allocate_expression_zero(unexpression_type); \
8123 unary_expression->unary.value = left; \
8125 sfunc(&unary_expression->unary); \
8127 return unary_expression; \
8130 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8131 EXPR_UNARY_POSTFIX_INCREMENT,
8133 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8134 EXPR_UNARY_POSTFIX_DECREMENT,
8137 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8139 /* TODO: handle complex + imaginary types */
8141 type_left = get_unqualified_type(type_left);
8142 type_right = get_unqualified_type(type_right);
8144 /* §6.3.1.8 Usual arithmetic conversions */
8145 if (type_left == type_long_double || type_right == type_long_double) {
8146 return type_long_double;
8147 } else if (type_left == type_double || type_right == type_double) {
8149 } else if (type_left == type_float || type_right == type_float) {
8153 type_left = promote_integer(type_left);
8154 type_right = promote_integer(type_right);
8156 if (type_left == type_right)
8159 bool const signed_left = is_type_signed(type_left);
8160 bool const signed_right = is_type_signed(type_right);
8161 int const rank_left = get_rank(type_left);
8162 int const rank_right = get_rank(type_right);
8164 if (signed_left == signed_right)
8165 return rank_left >= rank_right ? type_left : type_right;
8174 u_rank = rank_right;
8175 u_type = type_right;
8177 s_rank = rank_right;
8178 s_type = type_right;
8183 if (u_rank >= s_rank)
8186 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8188 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8189 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8193 case ATOMIC_TYPE_INT: return type_unsigned_int;
8194 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8195 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8197 default: panic("invalid atomic type");
8202 * Check the semantic restrictions for a binary expression.
8204 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8206 expression_t *const left = expression->left;
8207 expression_t *const right = expression->right;
8208 type_t *const orig_type_left = left->base.type;
8209 type_t *const orig_type_right = right->base.type;
8210 type_t *const type_left = skip_typeref(orig_type_left);
8211 type_t *const type_right = skip_typeref(orig_type_right);
8213 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(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 arithmetic types");
8222 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8223 expression->left = create_implicit_cast(left, arithmetic_type);
8224 expression->right = create_implicit_cast(right, arithmetic_type);
8225 expression->base.type = arithmetic_type;
8228 static void warn_div_by_zero(binary_expression_t const *const expression)
8230 if (!warning.div_by_zero ||
8231 !is_type_integer(expression->base.type))
8234 expression_t const *const right = expression->right;
8235 /* The type of the right operand can be different for /= */
8236 if (is_type_integer(right->base.type) &&
8237 is_constant_expression(right) &&
8238 !fold_constant_to_bool(right)) {
8239 warningf(&expression->base.source_position, "division by zero");
8244 * Check the semantic restrictions for a div/mod expression.
8246 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8248 semantic_binexpr_arithmetic(expression);
8249 warn_div_by_zero(expression);
8252 static void warn_addsub_in_shift(const expression_t *const expr)
8254 if (expr->base.parenthesized)
8258 switch (expr->kind) {
8259 case EXPR_BINARY_ADD: op = '+'; break;
8260 case EXPR_BINARY_SUB: op = '-'; break;
8264 warningf(&expr->base.source_position,
8265 "suggest parentheses around '%c' inside shift", op);
8268 static bool semantic_shift(binary_expression_t *expression)
8270 expression_t *const left = expression->left;
8271 expression_t *const right = expression->right;
8272 type_t *const orig_type_left = left->base.type;
8273 type_t *const orig_type_right = right->base.type;
8274 type_t * type_left = skip_typeref(orig_type_left);
8275 type_t * type_right = skip_typeref(orig_type_right);
8277 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8278 /* TODO: improve error message */
8279 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8280 errorf(&expression->base.source_position,
8281 "operands of shift operation must have integer types");
8286 type_left = promote_integer(type_left);
8288 if (is_constant_expression(right)) {
8289 long count = fold_constant_to_int(right);
8291 warningf(&right->base.source_position,
8292 "shift count must be non-negative");
8293 } else if ((unsigned long)count >=
8294 get_atomic_type_size(type_left->atomic.akind) * 8) {
8295 warningf(&right->base.source_position,
8296 "shift count must be less than type width");
8300 type_right = promote_integer(type_right);
8301 expression->right = create_implicit_cast(right, type_right);
8306 static void semantic_shift_op(binary_expression_t *expression)
8308 expression_t *const left = expression->left;
8309 expression_t *const right = expression->right;
8311 if (!semantic_shift(expression))
8314 if (warning.parentheses) {
8315 warn_addsub_in_shift(left);
8316 warn_addsub_in_shift(right);
8319 type_t *const orig_type_left = left->base.type;
8320 type_t * type_left = skip_typeref(orig_type_left);
8322 type_left = promote_integer(type_left);
8323 expression->left = create_implicit_cast(left, type_left);
8324 expression->base.type = type_left;
8327 static void semantic_add(binary_expression_t *expression)
8329 expression_t *const left = expression->left;
8330 expression_t *const right = expression->right;
8331 type_t *const orig_type_left = left->base.type;
8332 type_t *const orig_type_right = right->base.type;
8333 type_t *const type_left = skip_typeref(orig_type_left);
8334 type_t *const type_right = skip_typeref(orig_type_right);
8337 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8338 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8339 expression->left = create_implicit_cast(left, arithmetic_type);
8340 expression->right = create_implicit_cast(right, arithmetic_type);
8341 expression->base.type = arithmetic_type;
8342 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8343 check_pointer_arithmetic(&expression->base.source_position,
8344 type_left, orig_type_left);
8345 expression->base.type = type_left;
8346 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8347 check_pointer_arithmetic(&expression->base.source_position,
8348 type_right, orig_type_right);
8349 expression->base.type = type_right;
8350 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8351 errorf(&expression->base.source_position,
8352 "invalid operands to binary + ('%T', '%T')",
8353 orig_type_left, orig_type_right);
8357 static void semantic_sub(binary_expression_t *expression)
8359 expression_t *const left = expression->left;
8360 expression_t *const right = expression->right;
8361 type_t *const orig_type_left = left->base.type;
8362 type_t *const orig_type_right = right->base.type;
8363 type_t *const type_left = skip_typeref(orig_type_left);
8364 type_t *const type_right = skip_typeref(orig_type_right);
8365 source_position_t const *const pos = &expression->base.source_position;
8368 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8369 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8370 expression->left = create_implicit_cast(left, arithmetic_type);
8371 expression->right = create_implicit_cast(right, arithmetic_type);
8372 expression->base.type = arithmetic_type;
8373 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8374 check_pointer_arithmetic(&expression->base.source_position,
8375 type_left, orig_type_left);
8376 expression->base.type = type_left;
8377 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8378 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8379 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8380 if (!types_compatible(unqual_left, unqual_right)) {
8382 "subtracting pointers to incompatible types '%T' and '%T'",
8383 orig_type_left, orig_type_right);
8384 } else if (!is_type_object(unqual_left)) {
8385 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8386 errorf(pos, "subtracting pointers to non-object types '%T'",
8388 } else if (warning.other) {
8389 warningf(pos, "subtracting pointers to void");
8392 expression->base.type = type_ptrdiff_t;
8393 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8394 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8395 orig_type_left, orig_type_right);
8399 static void warn_string_literal_address(expression_t const* expr)
8401 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8402 expr = expr->unary.value;
8403 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8405 expr = expr->unary.value;
8408 if (expr->kind == EXPR_STRING_LITERAL
8409 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8410 warningf(&expr->base.source_position,
8411 "comparison with string literal results in unspecified behaviour");
8415 static void warn_comparison_in_comparison(const expression_t *const expr)
8417 if (expr->base.parenthesized)
8419 switch (expr->base.kind) {
8420 case EXPR_BINARY_LESS:
8421 case EXPR_BINARY_GREATER:
8422 case EXPR_BINARY_LESSEQUAL:
8423 case EXPR_BINARY_GREATEREQUAL:
8424 case EXPR_BINARY_NOTEQUAL:
8425 case EXPR_BINARY_EQUAL:
8426 warningf(&expr->base.source_position,
8427 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8434 static bool maybe_negative(expression_t const *const expr)
8437 !is_constant_expression(expr) ||
8438 fold_constant_to_int(expr) < 0;
8442 * Check the semantics of comparison expressions.
8444 * @param expression The expression to check.
8446 static void semantic_comparison(binary_expression_t *expression)
8448 expression_t *left = expression->left;
8449 expression_t *right = expression->right;
8451 if (warning.address) {
8452 warn_string_literal_address(left);
8453 warn_string_literal_address(right);
8455 expression_t const* const func_left = get_reference_address(left);
8456 if (func_left != NULL && is_null_pointer_constant(right)) {
8457 warningf(&expression->base.source_position,
8458 "the address of '%Y' will never be NULL",
8459 func_left->reference.entity->base.symbol);
8462 expression_t const* const func_right = get_reference_address(right);
8463 if (func_right != NULL && is_null_pointer_constant(right)) {
8464 warningf(&expression->base.source_position,
8465 "the address of '%Y' will never be NULL",
8466 func_right->reference.entity->base.symbol);
8470 if (warning.parentheses) {
8471 warn_comparison_in_comparison(left);
8472 warn_comparison_in_comparison(right);
8475 type_t *orig_type_left = left->base.type;
8476 type_t *orig_type_right = right->base.type;
8477 type_t *type_left = skip_typeref(orig_type_left);
8478 type_t *type_right = skip_typeref(orig_type_right);
8480 /* TODO non-arithmetic types */
8481 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8482 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8484 /* test for signed vs unsigned compares */
8485 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8486 bool const signed_left = is_type_signed(type_left);
8487 bool const signed_right = is_type_signed(type_right);
8488 if (signed_left != signed_right) {
8489 /* FIXME long long needs better const folding magic */
8490 /* TODO check whether constant value can be represented by other type */
8491 if ((signed_left && maybe_negative(left)) ||
8492 (signed_right && maybe_negative(right))) {
8493 warningf(&expression->base.source_position,
8494 "comparison between signed and unsigned");
8499 expression->left = create_implicit_cast(left, arithmetic_type);
8500 expression->right = create_implicit_cast(right, arithmetic_type);
8501 expression->base.type = arithmetic_type;
8502 if (warning.float_equal &&
8503 (expression->base.kind == EXPR_BINARY_EQUAL ||
8504 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8505 is_type_float(arithmetic_type)) {
8506 warningf(&expression->base.source_position,
8507 "comparing floating point with == or != is unsafe");
8509 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8510 /* TODO check compatibility */
8511 } else if (is_type_pointer(type_left)) {
8512 expression->right = create_implicit_cast(right, type_left);
8513 } else if (is_type_pointer(type_right)) {
8514 expression->left = create_implicit_cast(left, type_right);
8515 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8516 type_error_incompatible("invalid operands in comparison",
8517 &expression->base.source_position,
8518 type_left, type_right);
8520 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8524 * Checks if a compound type has constant fields.
8526 static bool has_const_fields(const compound_type_t *type)
8528 compound_t *compound = type->compound;
8529 entity_t *entry = compound->members.entities;
8531 for (; entry != NULL; entry = entry->base.next) {
8532 if (!is_declaration(entry))
8535 const type_t *decl_type = skip_typeref(entry->declaration.type);
8536 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8543 static bool is_valid_assignment_lhs(expression_t const* const left)
8545 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8546 type_t *const type_left = skip_typeref(orig_type_left);
8548 if (!is_lvalue(left)) {
8549 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8554 if (left->kind == EXPR_REFERENCE
8555 && left->reference.entity->kind == ENTITY_FUNCTION) {
8556 errorf(HERE, "cannot assign to function '%E'", left);
8560 if (is_type_array(type_left)) {
8561 errorf(HERE, "cannot assign to array '%E'", left);
8564 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8565 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8569 if (is_type_incomplete(type_left)) {
8570 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8571 left, orig_type_left);
8574 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8575 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8576 left, orig_type_left);
8583 static void semantic_arithmetic_assign(binary_expression_t *expression)
8585 expression_t *left = expression->left;
8586 expression_t *right = expression->right;
8587 type_t *orig_type_left = left->base.type;
8588 type_t *orig_type_right = right->base.type;
8590 if (!is_valid_assignment_lhs(left))
8593 type_t *type_left = skip_typeref(orig_type_left);
8594 type_t *type_right = skip_typeref(orig_type_right);
8596 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8597 /* TODO: improve error message */
8598 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8599 errorf(&expression->base.source_position,
8600 "operation needs arithmetic types");
8605 /* combined instructions are tricky. We can't create an implicit cast on
8606 * the left side, because we need the uncasted form for the store.
8607 * The ast2firm pass has to know that left_type must be right_type
8608 * for the arithmetic operation and create a cast by itself */
8609 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8610 expression->right = create_implicit_cast(right, arithmetic_type);
8611 expression->base.type = type_left;
8614 static void semantic_divmod_assign(binary_expression_t *expression)
8616 semantic_arithmetic_assign(expression);
8617 warn_div_by_zero(expression);
8620 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8622 expression_t *const left = expression->left;
8623 expression_t *const right = expression->right;
8624 type_t *const orig_type_left = left->base.type;
8625 type_t *const orig_type_right = right->base.type;
8626 type_t *const type_left = skip_typeref(orig_type_left);
8627 type_t *const type_right = skip_typeref(orig_type_right);
8629 if (!is_valid_assignment_lhs(left))
8632 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8633 /* combined instructions are tricky. We can't create an implicit cast on
8634 * the left side, because we need the uncasted form for the store.
8635 * The ast2firm pass has to know that left_type must be right_type
8636 * for the arithmetic operation and create a cast by itself */
8637 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8638 expression->right = create_implicit_cast(right, arithmetic_type);
8639 expression->base.type = type_left;
8640 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8641 check_pointer_arithmetic(&expression->base.source_position,
8642 type_left, orig_type_left);
8643 expression->base.type = type_left;
8644 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8645 errorf(&expression->base.source_position,
8646 "incompatible types '%T' and '%T' in assignment",
8647 orig_type_left, orig_type_right);
8651 static void semantic_integer_assign(binary_expression_t *expression)
8653 expression_t *left = expression->left;
8654 expression_t *right = expression->right;
8655 type_t *orig_type_left = left->base.type;
8656 type_t *orig_type_right = right->base.type;
8658 if (!is_valid_assignment_lhs(left))
8661 type_t *type_left = skip_typeref(orig_type_left);
8662 type_t *type_right = skip_typeref(orig_type_right);
8664 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8665 /* TODO: improve error message */
8666 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8667 errorf(&expression->base.source_position,
8668 "operation needs integer types");
8673 /* combined instructions are tricky. We can't create an implicit cast on
8674 * the left side, because we need the uncasted form for the store.
8675 * The ast2firm pass has to know that left_type must be right_type
8676 * for the arithmetic operation and create a cast by itself */
8677 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8678 expression->right = create_implicit_cast(right, arithmetic_type);
8679 expression->base.type = type_left;
8682 static void semantic_shift_assign(binary_expression_t *expression)
8684 expression_t *left = expression->left;
8686 if (!is_valid_assignment_lhs(left))
8689 if (!semantic_shift(expression))
8692 expression->base.type = skip_typeref(left->base.type);
8695 static void warn_logical_and_within_or(const expression_t *const expr)
8697 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8699 if (expr->base.parenthesized)
8701 warningf(&expr->base.source_position,
8702 "suggest parentheses around && within ||");
8706 * Check the semantic restrictions of a logical expression.
8708 static void semantic_logical_op(binary_expression_t *expression)
8710 /* §6.5.13:2 Each of the operands shall have scalar type.
8711 * §6.5.14:2 Each of the operands shall have scalar type. */
8712 semantic_condition(expression->left, "left operand of logical operator");
8713 semantic_condition(expression->right, "right operand of logical operator");
8714 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8715 warning.parentheses) {
8716 warn_logical_and_within_or(expression->left);
8717 warn_logical_and_within_or(expression->right);
8719 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8723 * Check the semantic restrictions of a binary assign expression.
8725 static void semantic_binexpr_assign(binary_expression_t *expression)
8727 expression_t *left = expression->left;
8728 type_t *orig_type_left = left->base.type;
8730 if (!is_valid_assignment_lhs(left))
8733 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8734 report_assign_error(error, orig_type_left, expression->right,
8735 "assignment", &left->base.source_position);
8736 expression->right = create_implicit_cast(expression->right, orig_type_left);
8737 expression->base.type = orig_type_left;
8741 * Determine if the outermost operation (or parts thereof) of the given
8742 * expression has no effect in order to generate a warning about this fact.
8743 * Therefore in some cases this only examines some of the operands of the
8744 * expression (see comments in the function and examples below).
8746 * f() + 23; // warning, because + has no effect
8747 * x || f(); // no warning, because x controls execution of f()
8748 * x ? y : f(); // warning, because y has no effect
8749 * (void)x; // no warning to be able to suppress the warning
8750 * This function can NOT be used for an "expression has definitely no effect"-
8752 static bool expression_has_effect(const expression_t *const expr)
8754 switch (expr->kind) {
8755 case EXPR_UNKNOWN: break;
8756 case EXPR_INVALID: return true; /* do NOT warn */
8757 case EXPR_REFERENCE: return false;
8758 case EXPR_REFERENCE_ENUM_VALUE: return false;
8759 case EXPR_LABEL_ADDRESS: return false;
8761 /* suppress the warning for microsoft __noop operations */
8762 case EXPR_LITERAL_MS_NOOP: return true;
8763 case EXPR_LITERAL_BOOLEAN:
8764 case EXPR_LITERAL_CHARACTER:
8765 case EXPR_LITERAL_WIDE_CHARACTER:
8766 case EXPR_LITERAL_INTEGER:
8767 case EXPR_LITERAL_INTEGER_OCTAL:
8768 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8769 case EXPR_LITERAL_FLOATINGPOINT:
8770 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8771 case EXPR_STRING_LITERAL: return false;
8772 case EXPR_WIDE_STRING_LITERAL: return false;
8775 const call_expression_t *const call = &expr->call;
8776 if (call->function->kind != EXPR_REFERENCE)
8779 switch (call->function->reference.entity->function.btk) {
8780 /* FIXME: which builtins have no effect? */
8781 default: return true;
8785 /* Generate the warning if either the left or right hand side of a
8786 * conditional expression has no effect */
8787 case EXPR_CONDITIONAL: {
8788 conditional_expression_t const *const cond = &expr->conditional;
8789 expression_t const *const t = cond->true_expression;
8791 (t == NULL || expression_has_effect(t)) &&
8792 expression_has_effect(cond->false_expression);
8795 case EXPR_SELECT: return false;
8796 case EXPR_ARRAY_ACCESS: return false;
8797 case EXPR_SIZEOF: return false;
8798 case EXPR_CLASSIFY_TYPE: return false;
8799 case EXPR_ALIGNOF: return false;
8801 case EXPR_FUNCNAME: return false;
8802 case EXPR_BUILTIN_CONSTANT_P: return false;
8803 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8804 case EXPR_OFFSETOF: return false;
8805 case EXPR_VA_START: return true;
8806 case EXPR_VA_ARG: return true;
8807 case EXPR_VA_COPY: return true;
8808 case EXPR_STATEMENT: return true; // TODO
8809 case EXPR_COMPOUND_LITERAL: return false;
8811 case EXPR_UNARY_NEGATE: return false;
8812 case EXPR_UNARY_PLUS: return false;
8813 case EXPR_UNARY_BITWISE_NEGATE: return false;
8814 case EXPR_UNARY_NOT: return false;
8815 case EXPR_UNARY_DEREFERENCE: return false;
8816 case EXPR_UNARY_TAKE_ADDRESS: return false;
8817 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8818 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8819 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8820 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8822 /* Treat void casts as if they have an effect in order to being able to
8823 * suppress the warning */
8824 case EXPR_UNARY_CAST: {
8825 type_t *const type = skip_typeref(expr->base.type);
8826 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8829 case EXPR_UNARY_CAST_IMPLICIT: return true;
8830 case EXPR_UNARY_ASSUME: return true;
8831 case EXPR_UNARY_DELETE: return true;
8832 case EXPR_UNARY_DELETE_ARRAY: return true;
8833 case EXPR_UNARY_THROW: return true;
8835 case EXPR_BINARY_ADD: return false;
8836 case EXPR_BINARY_SUB: return false;
8837 case EXPR_BINARY_MUL: return false;
8838 case EXPR_BINARY_DIV: return false;
8839 case EXPR_BINARY_MOD: return false;
8840 case EXPR_BINARY_EQUAL: return false;
8841 case EXPR_BINARY_NOTEQUAL: return false;
8842 case EXPR_BINARY_LESS: return false;
8843 case EXPR_BINARY_LESSEQUAL: return false;
8844 case EXPR_BINARY_GREATER: return false;
8845 case EXPR_BINARY_GREATEREQUAL: return false;
8846 case EXPR_BINARY_BITWISE_AND: return false;
8847 case EXPR_BINARY_BITWISE_OR: return false;
8848 case EXPR_BINARY_BITWISE_XOR: return false;
8849 case EXPR_BINARY_SHIFTLEFT: return false;
8850 case EXPR_BINARY_SHIFTRIGHT: return false;
8851 case EXPR_BINARY_ASSIGN: return true;
8852 case EXPR_BINARY_MUL_ASSIGN: return true;
8853 case EXPR_BINARY_DIV_ASSIGN: return true;
8854 case EXPR_BINARY_MOD_ASSIGN: return true;
8855 case EXPR_BINARY_ADD_ASSIGN: return true;
8856 case EXPR_BINARY_SUB_ASSIGN: return true;
8857 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8858 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8859 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8860 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8861 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8863 /* Only examine the right hand side of && and ||, because the left hand
8864 * side already has the effect of controlling the execution of the right
8866 case EXPR_BINARY_LOGICAL_AND:
8867 case EXPR_BINARY_LOGICAL_OR:
8868 /* Only examine the right hand side of a comma expression, because the left
8869 * hand side has a separate warning */
8870 case EXPR_BINARY_COMMA:
8871 return expression_has_effect(expr->binary.right);
8873 case EXPR_BINARY_ISGREATER: return false;
8874 case EXPR_BINARY_ISGREATEREQUAL: return false;
8875 case EXPR_BINARY_ISLESS: return false;
8876 case EXPR_BINARY_ISLESSEQUAL: return false;
8877 case EXPR_BINARY_ISLESSGREATER: return false;
8878 case EXPR_BINARY_ISUNORDERED: return false;
8881 internal_errorf(HERE, "unexpected expression");
8884 static void semantic_comma(binary_expression_t *expression)
8886 if (warning.unused_value) {
8887 const expression_t *const left = expression->left;
8888 if (!expression_has_effect(left)) {
8889 warningf(&left->base.source_position,
8890 "left-hand operand of comma expression has no effect");
8893 expression->base.type = expression->right->base.type;
8897 * @param prec_r precedence of the right operand
8899 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8900 static expression_t *parse_##binexpression_type(expression_t *left) \
8902 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8903 binexpr->binary.left = left; \
8906 expression_t *right = parse_subexpression(prec_r); \
8908 binexpr->binary.right = right; \
8909 sfunc(&binexpr->binary); \
8914 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8915 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8916 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8917 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8918 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8919 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8920 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8921 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8922 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8923 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8924 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8925 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8926 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8927 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8928 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8929 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8930 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8931 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8932 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8933 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8934 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8935 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8936 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8937 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8938 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8939 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8940 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8941 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8942 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8943 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8946 static expression_t *parse_subexpression(precedence_t precedence)
8948 if (token.type < 0) {
8949 return expected_expression_error();
8952 expression_parser_function_t *parser
8953 = &expression_parsers[token.type];
8954 source_position_t source_position = token.source_position;
8957 if (parser->parser != NULL) {
8958 left = parser->parser();
8960 left = parse_primary_expression();
8962 assert(left != NULL);
8963 left->base.source_position = source_position;
8966 if (token.type < 0) {
8967 return expected_expression_error();
8970 parser = &expression_parsers[token.type];
8971 if (parser->infix_parser == NULL)
8973 if (parser->infix_precedence < precedence)
8976 left = parser->infix_parser(left);
8978 assert(left != NULL);
8979 assert(left->kind != EXPR_UNKNOWN);
8980 left->base.source_position = source_position;
8987 * Parse an expression.
8989 static expression_t *parse_expression(void)
8991 return parse_subexpression(PREC_EXPRESSION);
8995 * Register a parser for a prefix-like operator.
8997 * @param parser the parser function
8998 * @param token_type the token type of the prefix token
9000 static void register_expression_parser(parse_expression_function parser,
9003 expression_parser_function_t *entry = &expression_parsers[token_type];
9005 if (entry->parser != NULL) {
9006 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9007 panic("trying to register multiple expression parsers for a token");
9009 entry->parser = parser;
9013 * Register a parser for an infix operator with given precedence.
9015 * @param parser the parser function
9016 * @param token_type the token type of the infix operator
9017 * @param precedence the precedence of the operator
9019 static void register_infix_parser(parse_expression_infix_function parser,
9020 int token_type, precedence_t precedence)
9022 expression_parser_function_t *entry = &expression_parsers[token_type];
9024 if (entry->infix_parser != NULL) {
9025 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9026 panic("trying to register multiple infix expression parsers for a "
9029 entry->infix_parser = parser;
9030 entry->infix_precedence = precedence;
9034 * Initialize the expression parsers.
9036 static void init_expression_parsers(void)
9038 memset(&expression_parsers, 0, sizeof(expression_parsers));
9040 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9041 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9042 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9043 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9044 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9045 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9046 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9047 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9048 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9049 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9050 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9051 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9052 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9053 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9054 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9055 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9056 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9057 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9058 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9059 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9060 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9061 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9062 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9063 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9064 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9065 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9066 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9067 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9068 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9069 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9070 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9071 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9072 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9073 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9074 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9075 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9076 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9078 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9079 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9080 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9081 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9082 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9083 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9084 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9085 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9086 register_expression_parser(parse_sizeof, T_sizeof);
9087 register_expression_parser(parse_alignof, T___alignof__);
9088 register_expression_parser(parse_extension, T___extension__);
9089 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9090 register_expression_parser(parse_delete, T_delete);
9091 register_expression_parser(parse_throw, T_throw);
9095 * Parse a asm statement arguments specification.
9097 static asm_argument_t *parse_asm_arguments(bool is_out)
9099 asm_argument_t *result = NULL;
9100 asm_argument_t **anchor = &result;
9102 while (token.type == T_STRING_LITERAL || token.type == '[') {
9103 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9104 memset(argument, 0, sizeof(argument[0]));
9107 if (token.type != T_IDENTIFIER) {
9108 parse_error_expected("while parsing asm argument",
9109 T_IDENTIFIER, NULL);
9112 argument->symbol = token.symbol;
9114 expect(']', end_error);
9117 argument->constraints = parse_string_literals();
9118 expect('(', end_error);
9119 add_anchor_token(')');
9120 expression_t *expression = parse_expression();
9121 rem_anchor_token(')');
9123 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9124 * change size or type representation (e.g. int -> long is ok, but
9125 * int -> float is not) */
9126 if (expression->kind == EXPR_UNARY_CAST) {
9127 type_t *const type = expression->base.type;
9128 type_kind_t const kind = type->kind;
9129 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9132 if (kind == TYPE_ATOMIC) {
9133 atomic_type_kind_t const akind = type->atomic.akind;
9134 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9135 size = get_atomic_type_size(akind);
9137 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9138 size = get_atomic_type_size(get_intptr_kind());
9142 expression_t *const value = expression->unary.value;
9143 type_t *const value_type = value->base.type;
9144 type_kind_t const value_kind = value_type->kind;
9146 unsigned value_flags;
9147 unsigned value_size;
9148 if (value_kind == TYPE_ATOMIC) {
9149 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9150 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9151 value_size = get_atomic_type_size(value_akind);
9152 } else if (value_kind == TYPE_POINTER) {
9153 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9154 value_size = get_atomic_type_size(get_intptr_kind());
9159 if (value_flags != flags || value_size != size)
9163 } while (expression->kind == EXPR_UNARY_CAST);
9167 if (!is_lvalue(expression)) {
9168 errorf(&expression->base.source_position,
9169 "asm output argument is not an lvalue");
9172 if (argument->constraints.begin[0] == '=')
9173 determine_lhs_ent(expression, NULL);
9175 mark_vars_read(expression, NULL);
9177 mark_vars_read(expression, NULL);
9179 argument->expression = expression;
9180 expect(')', end_error);
9182 set_address_taken(expression, true);
9185 anchor = &argument->next;
9197 * Parse a asm statement clobber specification.
9199 static asm_clobber_t *parse_asm_clobbers(void)
9201 asm_clobber_t *result = NULL;
9202 asm_clobber_t **anchor = &result;
9204 while (token.type == T_STRING_LITERAL) {
9205 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9206 clobber->clobber = parse_string_literals();
9209 anchor = &clobber->next;
9219 * Parse an asm statement.
9221 static statement_t *parse_asm_statement(void)
9223 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9224 asm_statement_t *asm_statement = &statement->asms;
9228 if (next_if(T_volatile))
9229 asm_statement->is_volatile = true;
9231 expect('(', end_error);
9232 add_anchor_token(')');
9233 if (token.type != T_STRING_LITERAL) {
9234 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9237 asm_statement->asm_text = parse_string_literals();
9239 add_anchor_token(':');
9240 if (!next_if(':')) {
9241 rem_anchor_token(':');
9245 asm_statement->outputs = parse_asm_arguments(true);
9246 if (!next_if(':')) {
9247 rem_anchor_token(':');
9251 asm_statement->inputs = parse_asm_arguments(false);
9252 if (!next_if(':')) {
9253 rem_anchor_token(':');
9256 rem_anchor_token(':');
9258 asm_statement->clobbers = parse_asm_clobbers();
9261 rem_anchor_token(')');
9262 expect(')', end_error);
9263 expect(';', end_error);
9265 if (asm_statement->outputs == NULL) {
9266 /* GCC: An 'asm' instruction without any output operands will be treated
9267 * identically to a volatile 'asm' instruction. */
9268 asm_statement->is_volatile = true;
9273 return create_invalid_statement();
9276 static statement_t *parse_label_inner_statement(char const *const label, bool const eat_empty_stmt)
9278 statement_t *inner_stmt;
9279 switch (token.type) {
9281 errorf(HERE, "%s at end of compound statement", label);
9282 inner_stmt = create_invalid_statement();
9286 if (eat_empty_stmt) {
9287 /* Eat an empty statement here, to avoid the warning about an empty
9288 * statement after a label. label:; is commonly used to have a label
9289 * before a closing brace. */
9290 inner_stmt = create_empty_statement();
9297 inner_stmt = parse_statement();
9298 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9299 errorf(&inner_stmt->base.source_position, "declaration after %s", label);
9307 * Parse a case statement.
9309 static statement_t *parse_case_statement(void)
9311 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9312 source_position_t *const pos = &statement->base.source_position;
9316 expression_t *const expression = parse_expression();
9317 statement->case_label.expression = expression;
9318 if (!is_constant_expression(expression)) {
9319 /* This check does not prevent the error message in all cases of an
9320 * prior error while parsing the expression. At least it catches the
9321 * common case of a mistyped enum entry. */
9322 if (is_type_valid(skip_typeref(expression->base.type))) {
9323 errorf(pos, "case label does not reduce to an integer constant");
9325 statement->case_label.is_bad = true;
9327 long const val = fold_constant_to_int(expression);
9328 statement->case_label.first_case = val;
9329 statement->case_label.last_case = val;
9333 if (next_if(T_DOTDOTDOT)) {
9334 expression_t *const end_range = parse_expression();
9335 statement->case_label.end_range = end_range;
9336 if (!is_constant_expression(end_range)) {
9337 /* This check does not prevent the error message in all cases of an
9338 * prior error while parsing the expression. At least it catches the
9339 * common case of a mistyped enum entry. */
9340 if (is_type_valid(skip_typeref(end_range->base.type))) {
9341 errorf(pos, "case range does not reduce to an integer constant");
9343 statement->case_label.is_bad = true;
9345 long const val = fold_constant_to_int(end_range);
9346 statement->case_label.last_case = val;
9348 if (warning.other && val < statement->case_label.first_case) {
9349 statement->case_label.is_empty_range = true;
9350 warningf(pos, "empty range specified");
9356 PUSH_PARENT(statement);
9358 expect(':', end_error);
9361 if (current_switch != NULL) {
9362 if (! statement->case_label.is_bad) {
9363 /* Check for duplicate case values */
9364 case_label_statement_t *c = &statement->case_label;
9365 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9366 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9369 if (c->last_case < l->first_case || c->first_case > l->last_case)
9372 errorf(pos, "duplicate case value (previously used %P)",
9373 &l->base.source_position);
9377 /* link all cases into the switch statement */
9378 if (current_switch->last_case == NULL) {
9379 current_switch->first_case = &statement->case_label;
9381 current_switch->last_case->next = &statement->case_label;
9383 current_switch->last_case = &statement->case_label;
9385 errorf(pos, "case label not within a switch statement");
9388 statement->case_label.statement = parse_label_inner_statement("case label", false);
9395 * Parse a default statement.
9397 static statement_t *parse_default_statement(void)
9399 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9403 PUSH_PARENT(statement);
9405 expect(':', end_error);
9408 if (current_switch != NULL) {
9409 const case_label_statement_t *def_label = current_switch->default_label;
9410 if (def_label != NULL) {
9411 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9412 &def_label->base.source_position);
9414 current_switch->default_label = &statement->case_label;
9416 /* link all cases into the switch statement */
9417 if (current_switch->last_case == NULL) {
9418 current_switch->first_case = &statement->case_label;
9420 current_switch->last_case->next = &statement->case_label;
9422 current_switch->last_case = &statement->case_label;
9425 errorf(&statement->base.source_position,
9426 "'default' label not within a switch statement");
9429 statement->case_label.statement = parse_label_inner_statement("default label", false);
9436 * Parse a label statement.
9438 static statement_t *parse_label_statement(void)
9440 assert(token.type == T_IDENTIFIER);
9441 symbol_t *symbol = token.symbol;
9442 label_t *label = get_label(symbol);
9444 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9445 statement->label.label = label;
9449 PUSH_PARENT(statement);
9451 /* if statement is already set then the label is defined twice,
9452 * otherwise it was just mentioned in a goto/local label declaration so far
9454 if (label->statement != NULL) {
9455 errorf(HERE, "duplicate label '%Y' (declared %P)",
9456 symbol, &label->base.source_position);
9458 label->base.source_position = token.source_position;
9459 label->statement = statement;
9464 statement->label.statement = parse_label_inner_statement("label", true);
9466 /* remember the labels in a list for later checking */
9467 *label_anchor = &statement->label;
9468 label_anchor = &statement->label.next;
9475 * Parse an if statement.
9477 static statement_t *parse_if(void)
9479 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9483 PUSH_PARENT(statement);
9485 add_anchor_token('{');
9487 expect('(', end_error);
9488 add_anchor_token(')');
9489 expression_t *const expr = parse_expression();
9490 statement->ifs.condition = expr;
9491 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9493 semantic_condition(expr, "condition of 'if'-statment");
9494 mark_vars_read(expr, NULL);
9495 rem_anchor_token(')');
9496 expect(')', end_error);
9499 rem_anchor_token('{');
9501 add_anchor_token(T_else);
9502 statement_t *const true_stmt = parse_statement();
9503 statement->ifs.true_statement = true_stmt;
9504 rem_anchor_token(T_else);
9506 if (next_if(T_else)) {
9507 statement->ifs.false_statement = parse_statement();
9508 } else if (warning.parentheses &&
9509 true_stmt->kind == STATEMENT_IF &&
9510 true_stmt->ifs.false_statement != NULL) {
9511 warningf(&true_stmt->base.source_position,
9512 "suggest explicit braces to avoid ambiguous 'else'");
9520 * Check that all enums are handled in a switch.
9522 * @param statement the switch statement to check
9524 static void check_enum_cases(const switch_statement_t *statement)
9526 const type_t *type = skip_typeref(statement->expression->base.type);
9527 if (! is_type_enum(type))
9529 const enum_type_t *enumt = &type->enumt;
9531 /* if we have a default, no warnings */
9532 if (statement->default_label != NULL)
9535 /* FIXME: calculation of value should be done while parsing */
9536 /* TODO: quadratic algorithm here. Change to an n log n one */
9537 long last_value = -1;
9538 const entity_t *entry = enumt->enume->base.next;
9539 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9540 entry = entry->base.next) {
9541 const expression_t *expression = entry->enum_value.value;
9542 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9544 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9545 if (l->expression == NULL)
9547 if (l->first_case <= value && value <= l->last_case) {
9553 warningf(&statement->base.source_position,
9554 "enumeration value '%Y' not handled in switch",
9555 entry->base.symbol);
9562 * Parse a switch statement.
9564 static statement_t *parse_switch(void)
9566 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9570 PUSH_PARENT(statement);
9572 expect('(', end_error);
9573 add_anchor_token(')');
9574 expression_t *const expr = parse_expression();
9575 mark_vars_read(expr, NULL);
9576 type_t * type = skip_typeref(expr->base.type);
9577 if (is_type_integer(type)) {
9578 type = promote_integer(type);
9579 if (warning.traditional) {
9580 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9581 warningf(&expr->base.source_position,
9582 "'%T' switch expression not converted to '%T' in ISO C",
9586 } else if (is_type_valid(type)) {
9587 errorf(&expr->base.source_position,
9588 "switch quantity is not an integer, but '%T'", type);
9589 type = type_error_type;
9591 statement->switchs.expression = create_implicit_cast(expr, type);
9592 expect(')', end_error);
9593 rem_anchor_token(')');
9595 switch_statement_t *rem = current_switch;
9596 current_switch = &statement->switchs;
9597 statement->switchs.body = parse_statement();
9598 current_switch = rem;
9600 if (warning.switch_default &&
9601 statement->switchs.default_label == NULL) {
9602 warningf(&statement->base.source_position, "switch has no default case");
9604 if (warning.switch_enum)
9605 check_enum_cases(&statement->switchs);
9611 return create_invalid_statement();
9614 static statement_t *parse_loop_body(statement_t *const loop)
9616 statement_t *const rem = current_loop;
9617 current_loop = loop;
9619 statement_t *const body = parse_statement();
9626 * Parse a while statement.
9628 static statement_t *parse_while(void)
9630 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9634 PUSH_PARENT(statement);
9636 expect('(', end_error);
9637 add_anchor_token(')');
9638 expression_t *const cond = parse_expression();
9639 statement->whiles.condition = cond;
9640 /* §6.8.5:2 The controlling expression of an iteration statement shall
9641 * have scalar type. */
9642 semantic_condition(cond, "condition of 'while'-statement");
9643 mark_vars_read(cond, NULL);
9644 rem_anchor_token(')');
9645 expect(')', end_error);
9647 statement->whiles.body = parse_loop_body(statement);
9653 return create_invalid_statement();
9657 * Parse a do statement.
9659 static statement_t *parse_do(void)
9661 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9665 PUSH_PARENT(statement);
9667 add_anchor_token(T_while);
9668 statement->do_while.body = parse_loop_body(statement);
9669 rem_anchor_token(T_while);
9671 expect(T_while, end_error);
9672 expect('(', end_error);
9673 add_anchor_token(')');
9674 expression_t *const cond = parse_expression();
9675 statement->do_while.condition = cond;
9676 /* §6.8.5:2 The controlling expression of an iteration statement shall
9677 * have scalar type. */
9678 semantic_condition(cond, "condition of 'do-while'-statement");
9679 mark_vars_read(cond, NULL);
9680 rem_anchor_token(')');
9681 expect(')', end_error);
9682 expect(';', end_error);
9688 return create_invalid_statement();
9692 * Parse a for statement.
9694 static statement_t *parse_for(void)
9696 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9700 expect('(', end_error1);
9701 add_anchor_token(')');
9703 PUSH_PARENT(statement);
9705 size_t const top = environment_top();
9706 scope_t *old_scope = scope_push(&statement->fors.scope);
9708 bool old_gcc_extension = in_gcc_extension;
9709 while (next_if(T___extension__)) {
9710 in_gcc_extension = true;
9714 } else if (is_declaration_specifier(&token, false)) {
9715 parse_declaration(record_entity, DECL_FLAGS_NONE);
9717 add_anchor_token(';');
9718 expression_t *const init = parse_expression();
9719 statement->fors.initialisation = init;
9720 mark_vars_read(init, ENT_ANY);
9721 if (warning.unused_value && !expression_has_effect(init)) {
9722 warningf(&init->base.source_position,
9723 "initialisation of 'for'-statement has no effect");
9725 rem_anchor_token(';');
9726 expect(';', end_error2);
9728 in_gcc_extension = old_gcc_extension;
9730 if (token.type != ';') {
9731 add_anchor_token(';');
9732 expression_t *const cond = parse_expression();
9733 statement->fors.condition = cond;
9734 /* §6.8.5:2 The controlling expression of an iteration statement
9735 * shall have scalar type. */
9736 semantic_condition(cond, "condition of 'for'-statement");
9737 mark_vars_read(cond, NULL);
9738 rem_anchor_token(';');
9740 expect(';', end_error2);
9741 if (token.type != ')') {
9742 expression_t *const step = parse_expression();
9743 statement->fors.step = step;
9744 mark_vars_read(step, ENT_ANY);
9745 if (warning.unused_value && !expression_has_effect(step)) {
9746 warningf(&step->base.source_position,
9747 "step of 'for'-statement has no effect");
9750 expect(')', end_error2);
9751 rem_anchor_token(')');
9752 statement->fors.body = parse_loop_body(statement);
9754 assert(current_scope == &statement->fors.scope);
9755 scope_pop(old_scope);
9756 environment_pop_to(top);
9763 rem_anchor_token(')');
9764 assert(current_scope == &statement->fors.scope);
9765 scope_pop(old_scope);
9766 environment_pop_to(top);
9770 return create_invalid_statement();
9774 * Parse a goto statement.
9776 static statement_t *parse_goto(void)
9778 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9781 if (GNU_MODE && next_if('*')) {
9782 expression_t *expression = parse_expression();
9783 mark_vars_read(expression, NULL);
9785 /* Argh: although documentation says the expression must be of type void*,
9786 * gcc accepts anything that can be casted into void* without error */
9787 type_t *type = expression->base.type;
9789 if (type != type_error_type) {
9790 if (!is_type_pointer(type) && !is_type_integer(type)) {
9791 errorf(&expression->base.source_position,
9792 "cannot convert to a pointer type");
9793 } else if (warning.other && type != type_void_ptr) {
9794 warningf(&expression->base.source_position,
9795 "type of computed goto expression should be 'void*' not '%T'", type);
9797 expression = create_implicit_cast(expression, type_void_ptr);
9800 statement->gotos.expression = expression;
9801 } else if (token.type == T_IDENTIFIER) {
9802 symbol_t *symbol = token.symbol;
9804 statement->gotos.label = get_label(symbol);
9807 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9809 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9811 return create_invalid_statement();
9814 /* remember the goto's in a list for later checking */
9815 *goto_anchor = &statement->gotos;
9816 goto_anchor = &statement->gotos.next;
9818 expect(';', end_error);
9825 * Parse a continue statement.
9827 static statement_t *parse_continue(void)
9829 if (current_loop == NULL) {
9830 errorf(HERE, "continue statement not within loop");
9833 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9836 expect(';', end_error);
9843 * Parse a break statement.
9845 static statement_t *parse_break(void)
9847 if (current_switch == NULL && current_loop == NULL) {
9848 errorf(HERE, "break statement not within loop or switch");
9851 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9854 expect(';', end_error);
9861 * Parse a __leave statement.
9863 static statement_t *parse_leave_statement(void)
9865 if (current_try == NULL) {
9866 errorf(HERE, "__leave statement not within __try");
9869 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9872 expect(';', end_error);
9879 * Check if a given entity represents a local variable.
9881 static bool is_local_variable(const entity_t *entity)
9883 if (entity->kind != ENTITY_VARIABLE)
9886 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9887 case STORAGE_CLASS_AUTO:
9888 case STORAGE_CLASS_REGISTER: {
9889 const type_t *type = skip_typeref(entity->declaration.type);
9890 if (is_type_function(type)) {
9902 * Check if a given expression represents a local variable.
9904 static bool expression_is_local_variable(const expression_t *expression)
9906 if (expression->base.kind != EXPR_REFERENCE) {
9909 const entity_t *entity = expression->reference.entity;
9910 return is_local_variable(entity);
9914 * Check if a given expression represents a local variable and
9915 * return its declaration then, else return NULL.
9917 entity_t *expression_is_variable(const expression_t *expression)
9919 if (expression->base.kind != EXPR_REFERENCE) {
9922 entity_t *entity = expression->reference.entity;
9923 if (entity->kind != ENTITY_VARIABLE)
9930 * Parse a return statement.
9932 static statement_t *parse_return(void)
9936 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9938 expression_t *return_value = NULL;
9939 if (token.type != ';') {
9940 return_value = parse_expression();
9941 mark_vars_read(return_value, NULL);
9944 const type_t *const func_type = skip_typeref(current_function->base.type);
9945 assert(is_type_function(func_type));
9946 type_t *const return_type = skip_typeref(func_type->function.return_type);
9948 source_position_t const *const pos = &statement->base.source_position;
9949 if (return_value != NULL) {
9950 type_t *return_value_type = skip_typeref(return_value->base.type);
9952 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9953 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9954 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9955 /* Only warn in C mode, because GCC does the same */
9956 if (c_mode & _CXX || strict_mode) {
9958 "'return' with a value, in function returning 'void'");
9959 } else if (warning.other) {
9961 "'return' with a value, in function returning 'void'");
9963 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9964 /* Only warn in C mode, because GCC does the same */
9967 "'return' with expression in function returning 'void'");
9968 } else if (warning.other) {
9970 "'return' with expression in function returning 'void'");
9974 assign_error_t error = semantic_assign(return_type, return_value);
9975 report_assign_error(error, return_type, return_value, "'return'",
9978 return_value = create_implicit_cast(return_value, return_type);
9979 /* check for returning address of a local var */
9980 if (warning.other && return_value != NULL
9981 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9982 const expression_t *expression = return_value->unary.value;
9983 if (expression_is_local_variable(expression)) {
9984 warningf(pos, "function returns address of local variable");
9987 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9988 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9989 if (c_mode & _CXX || strict_mode) {
9991 "'return' without value, in function returning non-void");
9994 "'return' without value, in function returning non-void");
9997 statement->returns.value = return_value;
9999 expect(';', end_error);
10006 * Parse a declaration statement.
10008 static statement_t *parse_declaration_statement(void)
10010 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10012 entity_t *before = current_scope->last_entity;
10014 parse_external_declaration();
10016 parse_declaration(record_entity, DECL_FLAGS_NONE);
10019 declaration_statement_t *const decl = &statement->declaration;
10020 entity_t *const begin =
10021 before != NULL ? before->base.next : current_scope->entities;
10022 decl->declarations_begin = begin;
10023 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10029 * Parse an expression statement, ie. expr ';'.
10031 static statement_t *parse_expression_statement(void)
10033 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10035 expression_t *const expr = parse_expression();
10036 statement->expression.expression = expr;
10037 mark_vars_read(expr, ENT_ANY);
10039 expect(';', end_error);
10046 * Parse a microsoft __try { } __finally { } or
10047 * __try{ } __except() { }
10049 static statement_t *parse_ms_try_statment(void)
10051 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10054 PUSH_PARENT(statement);
10056 ms_try_statement_t *rem = current_try;
10057 current_try = &statement->ms_try;
10058 statement->ms_try.try_statement = parse_compound_statement(false);
10063 if (next_if(T___except)) {
10064 expect('(', end_error);
10065 add_anchor_token(')');
10066 expression_t *const expr = parse_expression();
10067 mark_vars_read(expr, NULL);
10068 type_t * type = skip_typeref(expr->base.type);
10069 if (is_type_integer(type)) {
10070 type = promote_integer(type);
10071 } else if (is_type_valid(type)) {
10072 errorf(&expr->base.source_position,
10073 "__expect expression is not an integer, but '%T'", type);
10074 type = type_error_type;
10076 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10077 rem_anchor_token(')');
10078 expect(')', end_error);
10079 statement->ms_try.final_statement = parse_compound_statement(false);
10080 } else if (next_if(T__finally)) {
10081 statement->ms_try.final_statement = parse_compound_statement(false);
10083 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10084 return create_invalid_statement();
10088 return create_invalid_statement();
10091 static statement_t *parse_empty_statement(void)
10093 if (warning.empty_statement) {
10094 warningf(HERE, "statement is empty");
10096 statement_t *const statement = create_empty_statement();
10101 static statement_t *parse_local_label_declaration(void)
10103 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10107 entity_t *begin = NULL;
10108 entity_t *end = NULL;
10109 entity_t **anchor = &begin;
10111 if (token.type != T_IDENTIFIER) {
10112 parse_error_expected("while parsing local label declaration",
10113 T_IDENTIFIER, NULL);
10116 symbol_t *symbol = token.symbol;
10117 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10118 if (entity != NULL && entity->base.parent_scope == current_scope) {
10119 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10120 symbol, &entity->base.source_position);
10122 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10124 entity->base.parent_scope = current_scope;
10125 entity->base.namespc = NAMESPACE_LABEL;
10126 entity->base.source_position = token.source_position;
10127 entity->base.symbol = symbol;
10130 anchor = &entity->base.next;
10133 environment_push(entity);
10136 } while (next_if(','));
10137 expect(';', end_error);
10139 statement->declaration.declarations_begin = begin;
10140 statement->declaration.declarations_end = end;
10144 static void parse_namespace_definition(void)
10148 entity_t *entity = NULL;
10149 symbol_t *symbol = NULL;
10151 if (token.type == T_IDENTIFIER) {
10152 symbol = token.symbol;
10155 entity = get_entity(symbol, NAMESPACE_NORMAL);
10157 && entity->kind != ENTITY_NAMESPACE
10158 && entity->base.parent_scope == current_scope) {
10159 if (!is_error_entity(entity)) {
10160 error_redefined_as_different_kind(&token.source_position,
10161 entity, ENTITY_NAMESPACE);
10167 if (entity == NULL) {
10168 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10169 entity->base.symbol = symbol;
10170 entity->base.source_position = token.source_position;
10171 entity->base.namespc = NAMESPACE_NORMAL;
10172 entity->base.parent_scope = current_scope;
10175 if (token.type == '=') {
10176 /* TODO: parse namespace alias */
10177 panic("namespace alias definition not supported yet");
10180 environment_push(entity);
10181 append_entity(current_scope, entity);
10183 size_t const top = environment_top();
10184 scope_t *old_scope = scope_push(&entity->namespacee.members);
10186 entity_t *old_current_entity = current_entity;
10187 current_entity = entity;
10189 expect('{', end_error);
10191 expect('}', end_error);
10194 assert(current_scope == &entity->namespacee.members);
10195 assert(current_entity == entity);
10196 current_entity = old_current_entity;
10197 scope_pop(old_scope);
10198 environment_pop_to(top);
10202 * Parse a statement.
10203 * There's also parse_statement() which additionally checks for
10204 * "statement has no effect" warnings
10206 static statement_t *intern_parse_statement(void)
10208 statement_t *statement = NULL;
10210 /* declaration or statement */
10211 add_anchor_token(';');
10212 switch (token.type) {
10213 case T_IDENTIFIER: {
10214 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10215 if (la1_type == ':') {
10216 statement = parse_label_statement();
10217 } else if (is_typedef_symbol(token.symbol)) {
10218 statement = parse_declaration_statement();
10220 /* it's an identifier, the grammar says this must be an
10221 * expression statement. However it is common that users mistype
10222 * declaration types, so we guess a bit here to improve robustness
10223 * for incorrect programs */
10224 switch (la1_type) {
10227 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10229 statement = parse_expression_statement();
10233 statement = parse_declaration_statement();
10241 case T___extension__:
10242 /* This can be a prefix to a declaration or an expression statement.
10243 * We simply eat it now and parse the rest with tail recursion. */
10244 while (next_if(T___extension__)) {}
10245 bool old_gcc_extension = in_gcc_extension;
10246 in_gcc_extension = true;
10247 statement = intern_parse_statement();
10248 in_gcc_extension = old_gcc_extension;
10252 statement = parse_declaration_statement();
10256 statement = parse_local_label_declaration();
10259 case ';': statement = parse_empty_statement(); break;
10260 case '{': statement = parse_compound_statement(false); break;
10261 case T___leave: statement = parse_leave_statement(); break;
10262 case T___try: statement = parse_ms_try_statment(); break;
10263 case T_asm: statement = parse_asm_statement(); break;
10264 case T_break: statement = parse_break(); break;
10265 case T_case: statement = parse_case_statement(); break;
10266 case T_continue: statement = parse_continue(); break;
10267 case T_default: statement = parse_default_statement(); break;
10268 case T_do: statement = parse_do(); break;
10269 case T_for: statement = parse_for(); break;
10270 case T_goto: statement = parse_goto(); break;
10271 case T_if: statement = parse_if(); break;
10272 case T_return: statement = parse_return(); break;
10273 case T_switch: statement = parse_switch(); break;
10274 case T_while: statement = parse_while(); break;
10277 statement = parse_expression_statement();
10281 errorf(HERE, "unexpected token %K while parsing statement", &token);
10282 statement = create_invalid_statement();
10287 rem_anchor_token(';');
10289 assert(statement != NULL
10290 && statement->base.source_position.input_name != NULL);
10296 * parse a statement and emits "statement has no effect" warning if needed
10297 * (This is really a wrapper around intern_parse_statement with check for 1
10298 * single warning. It is needed, because for statement expressions we have
10299 * to avoid the warning on the last statement)
10301 static statement_t *parse_statement(void)
10303 statement_t *statement = intern_parse_statement();
10305 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10306 expression_t *expression = statement->expression.expression;
10307 if (!expression_has_effect(expression)) {
10308 warningf(&expression->base.source_position,
10309 "statement has no effect");
10317 * Parse a compound statement.
10319 static statement_t *parse_compound_statement(bool inside_expression_statement)
10321 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10323 PUSH_PARENT(statement);
10326 add_anchor_token('}');
10327 /* tokens, which can start a statement */
10328 /* TODO MS, __builtin_FOO */
10329 add_anchor_token('!');
10330 add_anchor_token('&');
10331 add_anchor_token('(');
10332 add_anchor_token('*');
10333 add_anchor_token('+');
10334 add_anchor_token('-');
10335 add_anchor_token('{');
10336 add_anchor_token('~');
10337 add_anchor_token(T_CHARACTER_CONSTANT);
10338 add_anchor_token(T_COLONCOLON);
10339 add_anchor_token(T_FLOATINGPOINT);
10340 add_anchor_token(T_IDENTIFIER);
10341 add_anchor_token(T_INTEGER);
10342 add_anchor_token(T_MINUSMINUS);
10343 add_anchor_token(T_PLUSPLUS);
10344 add_anchor_token(T_STRING_LITERAL);
10345 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10346 add_anchor_token(T_WIDE_STRING_LITERAL);
10347 add_anchor_token(T__Bool);
10348 add_anchor_token(T__Complex);
10349 add_anchor_token(T__Imaginary);
10350 add_anchor_token(T___FUNCTION__);
10351 add_anchor_token(T___PRETTY_FUNCTION__);
10352 add_anchor_token(T___alignof__);
10353 add_anchor_token(T___attribute__);
10354 add_anchor_token(T___builtin_va_start);
10355 add_anchor_token(T___extension__);
10356 add_anchor_token(T___func__);
10357 add_anchor_token(T___imag__);
10358 add_anchor_token(T___label__);
10359 add_anchor_token(T___real__);
10360 add_anchor_token(T___thread);
10361 add_anchor_token(T_asm);
10362 add_anchor_token(T_auto);
10363 add_anchor_token(T_bool);
10364 add_anchor_token(T_break);
10365 add_anchor_token(T_case);
10366 add_anchor_token(T_char);
10367 add_anchor_token(T_class);
10368 add_anchor_token(T_const);
10369 add_anchor_token(T_const_cast);
10370 add_anchor_token(T_continue);
10371 add_anchor_token(T_default);
10372 add_anchor_token(T_delete);
10373 add_anchor_token(T_double);
10374 add_anchor_token(T_do);
10375 add_anchor_token(T_dynamic_cast);
10376 add_anchor_token(T_enum);
10377 add_anchor_token(T_extern);
10378 add_anchor_token(T_false);
10379 add_anchor_token(T_float);
10380 add_anchor_token(T_for);
10381 add_anchor_token(T_goto);
10382 add_anchor_token(T_if);
10383 add_anchor_token(T_inline);
10384 add_anchor_token(T_int);
10385 add_anchor_token(T_long);
10386 add_anchor_token(T_new);
10387 add_anchor_token(T_operator);
10388 add_anchor_token(T_register);
10389 add_anchor_token(T_reinterpret_cast);
10390 add_anchor_token(T_restrict);
10391 add_anchor_token(T_return);
10392 add_anchor_token(T_short);
10393 add_anchor_token(T_signed);
10394 add_anchor_token(T_sizeof);
10395 add_anchor_token(T_static);
10396 add_anchor_token(T_static_cast);
10397 add_anchor_token(T_struct);
10398 add_anchor_token(T_switch);
10399 add_anchor_token(T_template);
10400 add_anchor_token(T_this);
10401 add_anchor_token(T_throw);
10402 add_anchor_token(T_true);
10403 add_anchor_token(T_try);
10404 add_anchor_token(T_typedef);
10405 add_anchor_token(T_typeid);
10406 add_anchor_token(T_typename);
10407 add_anchor_token(T_typeof);
10408 add_anchor_token(T_union);
10409 add_anchor_token(T_unsigned);
10410 add_anchor_token(T_using);
10411 add_anchor_token(T_void);
10412 add_anchor_token(T_volatile);
10413 add_anchor_token(T_wchar_t);
10414 add_anchor_token(T_while);
10416 size_t const top = environment_top();
10417 scope_t *old_scope = scope_push(&statement->compound.scope);
10419 statement_t **anchor = &statement->compound.statements;
10420 bool only_decls_so_far = true;
10421 while (token.type != '}') {
10422 if (token.type == T_EOF) {
10423 errorf(&statement->base.source_position,
10424 "EOF while parsing compound statement");
10427 statement_t *sub_statement = intern_parse_statement();
10428 if (is_invalid_statement(sub_statement)) {
10429 /* an error occurred. if we are at an anchor, return */
10435 if (warning.declaration_after_statement) {
10436 if (sub_statement->kind != STATEMENT_DECLARATION) {
10437 only_decls_so_far = false;
10438 } else if (!only_decls_so_far) {
10439 warningf(&sub_statement->base.source_position,
10440 "ISO C90 forbids mixed declarations and code");
10444 *anchor = sub_statement;
10446 while (sub_statement->base.next != NULL)
10447 sub_statement = sub_statement->base.next;
10449 anchor = &sub_statement->base.next;
10453 /* look over all statements again to produce no effect warnings */
10454 if (warning.unused_value) {
10455 statement_t *sub_statement = statement->compound.statements;
10456 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10457 if (sub_statement->kind != STATEMENT_EXPRESSION)
10459 /* don't emit a warning for the last expression in an expression
10460 * statement as it has always an effect */
10461 if (inside_expression_statement && sub_statement->base.next == NULL)
10464 expression_t *expression = sub_statement->expression.expression;
10465 if (!expression_has_effect(expression)) {
10466 warningf(&expression->base.source_position,
10467 "statement has no effect");
10473 rem_anchor_token(T_while);
10474 rem_anchor_token(T_wchar_t);
10475 rem_anchor_token(T_volatile);
10476 rem_anchor_token(T_void);
10477 rem_anchor_token(T_using);
10478 rem_anchor_token(T_unsigned);
10479 rem_anchor_token(T_union);
10480 rem_anchor_token(T_typeof);
10481 rem_anchor_token(T_typename);
10482 rem_anchor_token(T_typeid);
10483 rem_anchor_token(T_typedef);
10484 rem_anchor_token(T_try);
10485 rem_anchor_token(T_true);
10486 rem_anchor_token(T_throw);
10487 rem_anchor_token(T_this);
10488 rem_anchor_token(T_template);
10489 rem_anchor_token(T_switch);
10490 rem_anchor_token(T_struct);
10491 rem_anchor_token(T_static_cast);
10492 rem_anchor_token(T_static);
10493 rem_anchor_token(T_sizeof);
10494 rem_anchor_token(T_signed);
10495 rem_anchor_token(T_short);
10496 rem_anchor_token(T_return);
10497 rem_anchor_token(T_restrict);
10498 rem_anchor_token(T_reinterpret_cast);
10499 rem_anchor_token(T_register);
10500 rem_anchor_token(T_operator);
10501 rem_anchor_token(T_new);
10502 rem_anchor_token(T_long);
10503 rem_anchor_token(T_int);
10504 rem_anchor_token(T_inline);
10505 rem_anchor_token(T_if);
10506 rem_anchor_token(T_goto);
10507 rem_anchor_token(T_for);
10508 rem_anchor_token(T_float);
10509 rem_anchor_token(T_false);
10510 rem_anchor_token(T_extern);
10511 rem_anchor_token(T_enum);
10512 rem_anchor_token(T_dynamic_cast);
10513 rem_anchor_token(T_do);
10514 rem_anchor_token(T_double);
10515 rem_anchor_token(T_delete);
10516 rem_anchor_token(T_default);
10517 rem_anchor_token(T_continue);
10518 rem_anchor_token(T_const_cast);
10519 rem_anchor_token(T_const);
10520 rem_anchor_token(T_class);
10521 rem_anchor_token(T_char);
10522 rem_anchor_token(T_case);
10523 rem_anchor_token(T_break);
10524 rem_anchor_token(T_bool);
10525 rem_anchor_token(T_auto);
10526 rem_anchor_token(T_asm);
10527 rem_anchor_token(T___thread);
10528 rem_anchor_token(T___real__);
10529 rem_anchor_token(T___label__);
10530 rem_anchor_token(T___imag__);
10531 rem_anchor_token(T___func__);
10532 rem_anchor_token(T___extension__);
10533 rem_anchor_token(T___builtin_va_start);
10534 rem_anchor_token(T___attribute__);
10535 rem_anchor_token(T___alignof__);
10536 rem_anchor_token(T___PRETTY_FUNCTION__);
10537 rem_anchor_token(T___FUNCTION__);
10538 rem_anchor_token(T__Imaginary);
10539 rem_anchor_token(T__Complex);
10540 rem_anchor_token(T__Bool);
10541 rem_anchor_token(T_WIDE_STRING_LITERAL);
10542 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10543 rem_anchor_token(T_STRING_LITERAL);
10544 rem_anchor_token(T_PLUSPLUS);
10545 rem_anchor_token(T_MINUSMINUS);
10546 rem_anchor_token(T_INTEGER);
10547 rem_anchor_token(T_IDENTIFIER);
10548 rem_anchor_token(T_FLOATINGPOINT);
10549 rem_anchor_token(T_COLONCOLON);
10550 rem_anchor_token(T_CHARACTER_CONSTANT);
10551 rem_anchor_token('~');
10552 rem_anchor_token('{');
10553 rem_anchor_token('-');
10554 rem_anchor_token('+');
10555 rem_anchor_token('*');
10556 rem_anchor_token('(');
10557 rem_anchor_token('&');
10558 rem_anchor_token('!');
10559 rem_anchor_token('}');
10560 assert(current_scope == &statement->compound.scope);
10561 scope_pop(old_scope);
10562 environment_pop_to(top);
10569 * Check for unused global static functions and variables
10571 static void check_unused_globals(void)
10573 if (!warning.unused_function && !warning.unused_variable)
10576 for (const entity_t *entity = file_scope->entities; entity != NULL;
10577 entity = entity->base.next) {
10578 if (!is_declaration(entity))
10581 const declaration_t *declaration = &entity->declaration;
10582 if (declaration->used ||
10583 declaration->modifiers & DM_UNUSED ||
10584 declaration->modifiers & DM_USED ||
10585 declaration->storage_class != STORAGE_CLASS_STATIC)
10588 type_t *const type = declaration->type;
10590 if (entity->kind == ENTITY_FUNCTION) {
10591 /* inhibit warning for static inline functions */
10592 if (entity->function.is_inline)
10595 s = entity->function.statement != NULL ? "defined" : "declared";
10600 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10601 type, declaration->base.symbol, s);
10605 static void parse_global_asm(void)
10607 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10610 expect('(', end_error);
10612 statement->asms.asm_text = parse_string_literals();
10613 statement->base.next = unit->global_asm;
10614 unit->global_asm = statement;
10616 expect(')', end_error);
10617 expect(';', end_error);
10622 static void parse_linkage_specification(void)
10625 assert(token.type == T_STRING_LITERAL);
10627 const char *linkage = parse_string_literals().begin;
10629 linkage_kind_t old_linkage = current_linkage;
10630 linkage_kind_t new_linkage;
10631 if (strcmp(linkage, "C") == 0) {
10632 new_linkage = LINKAGE_C;
10633 } else if (strcmp(linkage, "C++") == 0) {
10634 new_linkage = LINKAGE_CXX;
10636 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10637 new_linkage = LINKAGE_INVALID;
10639 current_linkage = new_linkage;
10641 if (next_if('{')) {
10643 expect('}', end_error);
10649 assert(current_linkage == new_linkage);
10650 current_linkage = old_linkage;
10653 static void parse_external(void)
10655 switch (token.type) {
10656 DECLARATION_START_NO_EXTERN
10658 case T___extension__:
10659 /* tokens below are for implicit int */
10660 case '&': /* & x; -> int& x; (and error later, because C++ has no
10662 case '*': /* * x; -> int* x; */
10663 case '(': /* (x); -> int (x); */
10664 parse_external_declaration();
10668 if (look_ahead(1)->type == T_STRING_LITERAL) {
10669 parse_linkage_specification();
10671 parse_external_declaration();
10676 parse_global_asm();
10680 parse_namespace_definition();
10684 if (!strict_mode) {
10686 warningf(HERE, "stray ';' outside of function");
10693 errorf(HERE, "stray %K outside of function", &token);
10694 if (token.type == '(' || token.type == '{' || token.type == '[')
10695 eat_until_matching_token(token.type);
10701 static void parse_externals(void)
10703 add_anchor_token('}');
10704 add_anchor_token(T_EOF);
10707 unsigned char token_anchor_copy[T_LAST_TOKEN];
10708 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10711 while (token.type != T_EOF && token.type != '}') {
10713 bool anchor_leak = false;
10714 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10715 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10717 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10718 anchor_leak = true;
10721 if (in_gcc_extension) {
10722 errorf(HERE, "Leaked __extension__");
10723 anchor_leak = true;
10733 rem_anchor_token(T_EOF);
10734 rem_anchor_token('}');
10738 * Parse a translation unit.
10740 static void parse_translation_unit(void)
10742 add_anchor_token(T_EOF);
10747 if (token.type == T_EOF)
10750 errorf(HERE, "stray %K outside of function", &token);
10751 if (token.type == '(' || token.type == '{' || token.type == '[')
10752 eat_until_matching_token(token.type);
10760 * @return the translation unit or NULL if errors occurred.
10762 void start_parsing(void)
10764 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10765 label_stack = NEW_ARR_F(stack_entry_t, 0);
10766 diagnostic_count = 0;
10770 print_to_file(stderr);
10772 assert(unit == NULL);
10773 unit = allocate_ast_zero(sizeof(unit[0]));
10775 assert(file_scope == NULL);
10776 file_scope = &unit->scope;
10778 assert(current_scope == NULL);
10779 scope_push(&unit->scope);
10781 create_gnu_builtins();
10783 create_microsoft_intrinsics();
10786 translation_unit_t *finish_parsing(void)
10788 assert(current_scope == &unit->scope);
10791 assert(file_scope == &unit->scope);
10792 check_unused_globals();
10795 DEL_ARR_F(environment_stack);
10796 DEL_ARR_F(label_stack);
10798 translation_unit_t *result = unit;
10803 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10804 * are given length one. */
10805 static void complete_incomplete_arrays(void)
10807 size_t n = ARR_LEN(incomplete_arrays);
10808 for (size_t i = 0; i != n; ++i) {
10809 declaration_t *const decl = incomplete_arrays[i];
10810 type_t *const orig_type = decl->type;
10811 type_t *const type = skip_typeref(orig_type);
10813 if (!is_type_incomplete(type))
10816 if (warning.other) {
10817 warningf(&decl->base.source_position,
10818 "array '%#T' assumed to have one element",
10819 orig_type, decl->base.symbol);
10822 type_t *const new_type = duplicate_type(type);
10823 new_type->array.size_constant = true;
10824 new_type->array.has_implicit_size = true;
10825 new_type->array.size = 1;
10827 type_t *const result = identify_new_type(new_type);
10829 decl->type = result;
10833 void prepare_main_collect2(entity_t *entity)
10835 // create call to __main
10836 symbol_t *symbol = symbol_table_insert("__main");
10837 entity_t *subsubmain_ent
10838 = create_implicit_function(symbol, &builtin_source_position);
10840 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10841 type_t *ftype = subsubmain_ent->declaration.type;
10842 ref->base.source_position = builtin_source_position;
10843 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10844 ref->reference.entity = subsubmain_ent;
10846 expression_t *call = allocate_expression_zero(EXPR_CALL);
10847 call->base.source_position = builtin_source_position;
10848 call->base.type = type_void;
10849 call->call.function = ref;
10851 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10852 expr_statement->base.source_position = builtin_source_position;
10853 expr_statement->expression.expression = call;
10855 statement_t *statement = entity->function.statement;
10856 assert(statement->kind == STATEMENT_COMPOUND);
10857 compound_statement_t *compounds = &statement->compound;
10859 expr_statement->base.next = compounds->statements;
10860 compounds->statements = expr_statement;
10865 lookahead_bufpos = 0;
10866 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10869 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10870 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10871 parse_translation_unit();
10872 complete_incomplete_arrays();
10873 DEL_ARR_F(incomplete_arrays);
10874 incomplete_arrays = NULL;
10878 * Initialize the parser.
10880 void init_parser(void)
10882 sym_anonymous = symbol_table_insert("<anonymous>");
10884 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10886 init_expression_parsers();
10887 obstack_init(&temp_obst);
10889 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10890 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10894 * Terminate the parser.
10896 void exit_parser(void)
10898 obstack_free(&temp_obst, NULL);