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_sub_expression(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: \
232 case T_INTEGER_OCTAL: \
233 case T_INTEGER_HEXADECIMAL: \
234 case T_FLOATINGPOINT: \
235 case T_FLOATINGPOINT_HEXADECIMAL: \
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_start: \
257 case T___builtin_va_copy: \
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 end_error 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, (int) 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_sub_expression(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_sub_expression(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();
1298 static attribute_t *parse_attribute_gnu(void)
1300 attribute_t *first = NULL;
1301 attribute_t **anchor = &first;
1303 eat(T___attribute__);
1304 expect('(', end_error);
1305 expect('(', end_error);
1307 if (token.type != ')') do {
1308 attribute_t *attribute = parse_attribute_gnu_single();
1309 if (attribute == NULL)
1312 *anchor = attribute;
1313 anchor = &attribute->next;
1314 } while (next_if(','));
1315 expect(')', end_error);
1316 expect(')', end_error);
1322 /** Parse attributes. */
1323 static attribute_t *parse_attributes(attribute_t *first)
1325 attribute_t **anchor = &first;
1327 while (*anchor != NULL)
1328 anchor = &(*anchor)->next;
1330 attribute_t *attribute;
1331 switch (token.type) {
1332 case T___attribute__:
1333 attribute = parse_attribute_gnu();
1337 attribute = parse_attribute_asm();
1342 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1347 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1350 case T__forceinline:
1352 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1357 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1362 /* TODO record modifier */
1364 warningf(HERE, "Ignoring declaration modifier %K", &token);
1365 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1372 *anchor = attribute;
1373 anchor = &attribute->next;
1377 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1379 static entity_t *determine_lhs_ent(expression_t *const expr,
1382 switch (expr->kind) {
1383 case EXPR_REFERENCE: {
1384 entity_t *const entity = expr->reference.entity;
1385 /* we should only find variables as lvalues... */
1386 if (entity->base.kind != ENTITY_VARIABLE
1387 && entity->base.kind != ENTITY_PARAMETER)
1393 case EXPR_ARRAY_ACCESS: {
1394 expression_t *const ref = expr->array_access.array_ref;
1395 entity_t * ent = NULL;
1396 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1397 ent = determine_lhs_ent(ref, lhs_ent);
1400 mark_vars_read(expr->select.compound, lhs_ent);
1402 mark_vars_read(expr->array_access.index, lhs_ent);
1407 if (is_type_compound(skip_typeref(expr->base.type))) {
1408 return determine_lhs_ent(expr->select.compound, lhs_ent);
1410 mark_vars_read(expr->select.compound, lhs_ent);
1415 case EXPR_UNARY_DEREFERENCE: {
1416 expression_t *const val = expr->unary.value;
1417 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1419 return determine_lhs_ent(val->unary.value, lhs_ent);
1421 mark_vars_read(val, NULL);
1427 mark_vars_read(expr, NULL);
1432 #define ENT_ANY ((entity_t*)-1)
1435 * Mark declarations, which are read. This is used to detect variables, which
1439 * x is not marked as "read", because it is only read to calculate its own new
1443 * x and y are not detected as "not read", because multiple variables are
1446 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1448 switch (expr->kind) {
1449 case EXPR_REFERENCE: {
1450 entity_t *const entity = expr->reference.entity;
1451 if (entity->kind != ENTITY_VARIABLE
1452 && entity->kind != ENTITY_PARAMETER)
1455 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1456 if (entity->kind == ENTITY_VARIABLE) {
1457 entity->variable.read = true;
1459 entity->parameter.read = true;
1466 // TODO respect pure/const
1467 mark_vars_read(expr->call.function, NULL);
1468 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1469 mark_vars_read(arg->expression, NULL);
1473 case EXPR_CONDITIONAL:
1474 // TODO lhs_decl should depend on whether true/false have an effect
1475 mark_vars_read(expr->conditional.condition, NULL);
1476 if (expr->conditional.true_expression != NULL)
1477 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1478 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1482 if (lhs_ent == ENT_ANY
1483 && !is_type_compound(skip_typeref(expr->base.type)))
1485 mark_vars_read(expr->select.compound, lhs_ent);
1488 case EXPR_ARRAY_ACCESS: {
1489 expression_t *const ref = expr->array_access.array_ref;
1490 mark_vars_read(ref, lhs_ent);
1491 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1492 mark_vars_read(expr->array_access.index, lhs_ent);
1497 mark_vars_read(expr->va_arge.ap, lhs_ent);
1501 mark_vars_read(expr->va_copye.src, lhs_ent);
1504 case EXPR_UNARY_CAST:
1505 /* Special case: Use void cast to mark a variable as "read" */
1506 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1511 case EXPR_UNARY_THROW:
1512 if (expr->unary.value == NULL)
1515 case EXPR_UNARY_DEREFERENCE:
1516 case EXPR_UNARY_DELETE:
1517 case EXPR_UNARY_DELETE_ARRAY:
1518 if (lhs_ent == ENT_ANY)
1522 case EXPR_UNARY_NEGATE:
1523 case EXPR_UNARY_PLUS:
1524 case EXPR_UNARY_BITWISE_NEGATE:
1525 case EXPR_UNARY_NOT:
1526 case EXPR_UNARY_TAKE_ADDRESS:
1527 case EXPR_UNARY_POSTFIX_INCREMENT:
1528 case EXPR_UNARY_POSTFIX_DECREMENT:
1529 case EXPR_UNARY_PREFIX_INCREMENT:
1530 case EXPR_UNARY_PREFIX_DECREMENT:
1531 case EXPR_UNARY_CAST_IMPLICIT:
1532 case EXPR_UNARY_ASSUME:
1534 mark_vars_read(expr->unary.value, lhs_ent);
1537 case EXPR_BINARY_ADD:
1538 case EXPR_BINARY_SUB:
1539 case EXPR_BINARY_MUL:
1540 case EXPR_BINARY_DIV:
1541 case EXPR_BINARY_MOD:
1542 case EXPR_BINARY_EQUAL:
1543 case EXPR_BINARY_NOTEQUAL:
1544 case EXPR_BINARY_LESS:
1545 case EXPR_BINARY_LESSEQUAL:
1546 case EXPR_BINARY_GREATER:
1547 case EXPR_BINARY_GREATEREQUAL:
1548 case EXPR_BINARY_BITWISE_AND:
1549 case EXPR_BINARY_BITWISE_OR:
1550 case EXPR_BINARY_BITWISE_XOR:
1551 case EXPR_BINARY_LOGICAL_AND:
1552 case EXPR_BINARY_LOGICAL_OR:
1553 case EXPR_BINARY_SHIFTLEFT:
1554 case EXPR_BINARY_SHIFTRIGHT:
1555 case EXPR_BINARY_COMMA:
1556 case EXPR_BINARY_ISGREATER:
1557 case EXPR_BINARY_ISGREATEREQUAL:
1558 case EXPR_BINARY_ISLESS:
1559 case EXPR_BINARY_ISLESSEQUAL:
1560 case EXPR_BINARY_ISLESSGREATER:
1561 case EXPR_BINARY_ISUNORDERED:
1562 mark_vars_read(expr->binary.left, lhs_ent);
1563 mark_vars_read(expr->binary.right, lhs_ent);
1566 case EXPR_BINARY_ASSIGN:
1567 case EXPR_BINARY_MUL_ASSIGN:
1568 case EXPR_BINARY_DIV_ASSIGN:
1569 case EXPR_BINARY_MOD_ASSIGN:
1570 case EXPR_BINARY_ADD_ASSIGN:
1571 case EXPR_BINARY_SUB_ASSIGN:
1572 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1573 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1574 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1575 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1576 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1577 if (lhs_ent == ENT_ANY)
1579 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1580 mark_vars_read(expr->binary.right, lhs_ent);
1585 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1591 case EXPR_STRING_LITERAL:
1592 case EXPR_WIDE_STRING_LITERAL:
1593 case EXPR_COMPOUND_LITERAL: // TODO init?
1595 case EXPR_CLASSIFY_TYPE:
1598 case EXPR_BUILTIN_CONSTANT_P:
1599 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1601 case EXPR_STATEMENT: // TODO
1602 case EXPR_LABEL_ADDRESS:
1603 case EXPR_REFERENCE_ENUM_VALUE:
1607 panic("unhandled expression");
1610 static designator_t *parse_designation(void)
1612 designator_t *result = NULL;
1613 designator_t **anchor = &result;
1616 designator_t *designator;
1617 switch (token.type) {
1619 designator = allocate_ast_zero(sizeof(designator[0]));
1620 designator->source_position = token.source_position;
1622 add_anchor_token(']');
1623 designator->array_index = parse_constant_expression();
1624 rem_anchor_token(']');
1625 expect(']', end_error);
1628 designator = allocate_ast_zero(sizeof(designator[0]));
1629 designator->source_position = token.source_position;
1631 if (token.type != T_IDENTIFIER) {
1632 parse_error_expected("while parsing designator",
1633 T_IDENTIFIER, NULL);
1636 designator->symbol = token.symbol;
1640 expect('=', end_error);
1644 assert(designator != NULL);
1645 *anchor = designator;
1646 anchor = &designator->next;
1652 static initializer_t *initializer_from_string(array_type_t *const type,
1653 const string_t *const string)
1655 /* TODO: check len vs. size of array type */
1658 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1659 initializer->string.string = *string;
1664 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1665 const string_t *const string)
1667 /* TODO: check len vs. size of array type */
1670 initializer_t *const initializer =
1671 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1672 initializer->wide_string.string = *string;
1678 * Build an initializer from a given expression.
1680 static initializer_t *initializer_from_expression(type_t *orig_type,
1681 expression_t *expression)
1683 /* TODO check that expression is a constant expression */
1685 /* §6.7.8.14/15 char array may be initialized by string literals */
1686 type_t *type = skip_typeref(orig_type);
1687 type_t *expr_type_orig = expression->base.type;
1688 type_t *expr_type = skip_typeref(expr_type_orig);
1690 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1691 array_type_t *const array_type = &type->array;
1692 type_t *const element_type = skip_typeref(array_type->element_type);
1694 if (element_type->kind == TYPE_ATOMIC) {
1695 atomic_type_kind_t akind = element_type->atomic.akind;
1696 switch (expression->kind) {
1697 case EXPR_STRING_LITERAL:
1698 if (akind == ATOMIC_TYPE_CHAR
1699 || akind == ATOMIC_TYPE_SCHAR
1700 || akind == ATOMIC_TYPE_UCHAR) {
1701 return initializer_from_string(array_type,
1702 &expression->string_literal.value);
1706 case EXPR_WIDE_STRING_LITERAL: {
1707 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1708 if (get_unqualified_type(element_type) == bare_wchar_type) {
1709 return initializer_from_wide_string(array_type,
1710 &expression->string_literal.value);
1721 assign_error_t error = semantic_assign(type, expression);
1722 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1724 report_assign_error(error, type, expression, "initializer",
1725 &expression->base.source_position);
1727 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1728 result->value.value = create_implicit_cast(expression, type);
1734 * Checks if a given expression can be used as an constant initializer.
1736 static bool is_initializer_constant(const expression_t *expression)
1738 return is_constant_expression(expression)
1739 || is_address_constant(expression);
1743 * Parses an scalar initializer.
1745 * §6.7.8.11; eat {} without warning
1747 static initializer_t *parse_scalar_initializer(type_t *type,
1748 bool must_be_constant)
1750 /* there might be extra {} hierarchies */
1754 warningf(HERE, "extra curly braces around scalar initializer");
1757 } while (next_if('{'));
1760 expression_t *expression = parse_assignment_expression();
1761 mark_vars_read(expression, NULL);
1762 if (must_be_constant && !is_initializer_constant(expression)) {
1763 errorf(&expression->base.source_position,
1764 "initialisation expression '%E' is not constant",
1768 initializer_t *initializer = initializer_from_expression(type, expression);
1770 if (initializer == NULL) {
1771 errorf(&expression->base.source_position,
1772 "expression '%E' (type '%T') doesn't match expected type '%T'",
1773 expression, expression->base.type, type);
1778 bool additional_warning_displayed = false;
1779 while (braces > 0) {
1781 if (token.type != '}') {
1782 if (!additional_warning_displayed && warning.other) {
1783 warningf(HERE, "additional elements in scalar initializer");
1784 additional_warning_displayed = true;
1795 * An entry in the type path.
1797 typedef struct type_path_entry_t type_path_entry_t;
1798 struct type_path_entry_t {
1799 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1801 size_t index; /**< For array types: the current index. */
1802 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1807 * A type path expression a position inside compound or array types.
1809 typedef struct type_path_t type_path_t;
1810 struct type_path_t {
1811 type_path_entry_t *path; /**< An flexible array containing the current path. */
1812 type_t *top_type; /**< type of the element the path points */
1813 size_t max_index; /**< largest index in outermost array */
1817 * Prints a type path for debugging.
1819 static __attribute__((unused)) void debug_print_type_path(
1820 const type_path_t *path)
1822 size_t len = ARR_LEN(path->path);
1824 for (size_t i = 0; i < len; ++i) {
1825 const type_path_entry_t *entry = & path->path[i];
1827 type_t *type = skip_typeref(entry->type);
1828 if (is_type_compound(type)) {
1829 /* in gcc mode structs can have no members */
1830 if (entry->v.compound_entry == NULL) {
1834 fprintf(stderr, ".%s",
1835 entry->v.compound_entry->base.symbol->string);
1836 } else if (is_type_array(type)) {
1837 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1839 fprintf(stderr, "-INVALID-");
1842 if (path->top_type != NULL) {
1843 fprintf(stderr, " (");
1844 print_type(path->top_type);
1845 fprintf(stderr, ")");
1850 * Return the top type path entry, ie. in a path
1851 * (type).a.b returns the b.
1853 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1855 size_t len = ARR_LEN(path->path);
1857 return &path->path[len-1];
1861 * Enlarge the type path by an (empty) element.
1863 static type_path_entry_t *append_to_type_path(type_path_t *path)
1865 size_t len = ARR_LEN(path->path);
1866 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1868 type_path_entry_t *result = & path->path[len];
1869 memset(result, 0, sizeof(result[0]));
1874 * Descending into a sub-type. Enter the scope of the current top_type.
1876 static void descend_into_subtype(type_path_t *path)
1878 type_t *orig_top_type = path->top_type;
1879 type_t *top_type = skip_typeref(orig_top_type);
1881 type_path_entry_t *top = append_to_type_path(path);
1882 top->type = top_type;
1884 if (is_type_compound(top_type)) {
1885 compound_t *compound = top_type->compound.compound;
1886 entity_t *entry = compound->members.entities;
1888 if (entry != NULL) {
1889 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1890 top->v.compound_entry = &entry->declaration;
1891 path->top_type = entry->declaration.type;
1893 path->top_type = NULL;
1895 } else if (is_type_array(top_type)) {
1897 path->top_type = top_type->array.element_type;
1899 assert(!is_type_valid(top_type));
1904 * Pop an entry from the given type path, ie. returning from
1905 * (type).a.b to (type).a
1907 static void ascend_from_subtype(type_path_t *path)
1909 type_path_entry_t *top = get_type_path_top(path);
1911 path->top_type = top->type;
1913 size_t len = ARR_LEN(path->path);
1914 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1918 * Pop entries from the given type path until the given
1919 * path level is reached.
1921 static void ascend_to(type_path_t *path, size_t top_path_level)
1923 size_t len = ARR_LEN(path->path);
1925 while (len > top_path_level) {
1926 ascend_from_subtype(path);
1927 len = ARR_LEN(path->path);
1931 static bool walk_designator(type_path_t *path, const designator_t *designator,
1932 bool used_in_offsetof)
1934 for (; designator != NULL; designator = designator->next) {
1935 type_path_entry_t *top = get_type_path_top(path);
1936 type_t *orig_type = top->type;
1938 type_t *type = skip_typeref(orig_type);
1940 if (designator->symbol != NULL) {
1941 symbol_t *symbol = designator->symbol;
1942 if (!is_type_compound(type)) {
1943 if (is_type_valid(type)) {
1944 errorf(&designator->source_position,
1945 "'.%Y' designator used for non-compound type '%T'",
1949 top->type = type_error_type;
1950 top->v.compound_entry = NULL;
1951 orig_type = type_error_type;
1953 compound_t *compound = type->compound.compound;
1954 entity_t *iter = compound->members.entities;
1955 for (; iter != NULL; iter = iter->base.next) {
1956 if (iter->base.symbol == symbol) {
1961 errorf(&designator->source_position,
1962 "'%T' has no member named '%Y'", orig_type, symbol);
1965 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1966 if (used_in_offsetof) {
1967 type_t *real_type = skip_typeref(iter->declaration.type);
1968 if (real_type->kind == TYPE_BITFIELD) {
1969 errorf(&designator->source_position,
1970 "offsetof designator '%Y' may not specify bitfield",
1976 top->type = orig_type;
1977 top->v.compound_entry = &iter->declaration;
1978 orig_type = iter->declaration.type;
1981 expression_t *array_index = designator->array_index;
1982 assert(designator->array_index != NULL);
1984 if (!is_type_array(type)) {
1985 if (is_type_valid(type)) {
1986 errorf(&designator->source_position,
1987 "[%E] designator used for non-array type '%T'",
1988 array_index, orig_type);
1993 long index = fold_constant_to_int(array_index);
1994 if (!used_in_offsetof) {
1996 errorf(&designator->source_position,
1997 "array index [%E] must be positive", array_index);
1998 } else if (type->array.size_constant) {
1999 long array_size = type->array.size;
2000 if (index >= array_size) {
2001 errorf(&designator->source_position,
2002 "designator [%E] (%d) exceeds array size %d",
2003 array_index, index, array_size);
2008 top->type = orig_type;
2009 top->v.index = (size_t) index;
2010 orig_type = type->array.element_type;
2012 path->top_type = orig_type;
2014 if (designator->next != NULL) {
2015 descend_into_subtype(path);
2024 static void advance_current_object(type_path_t *path, size_t top_path_level)
2026 type_path_entry_t *top = get_type_path_top(path);
2028 type_t *type = skip_typeref(top->type);
2029 if (is_type_union(type)) {
2030 /* in unions only the first element is initialized */
2031 top->v.compound_entry = NULL;
2032 } else if (is_type_struct(type)) {
2033 declaration_t *entry = top->v.compound_entry;
2035 entity_t *next_entity = entry->base.next;
2036 if (next_entity != NULL) {
2037 assert(is_declaration(next_entity));
2038 entry = &next_entity->declaration;
2043 top->v.compound_entry = entry;
2044 if (entry != NULL) {
2045 path->top_type = entry->type;
2048 } else if (is_type_array(type)) {
2049 assert(is_type_array(type));
2053 if (!type->array.size_constant || top->v.index < type->array.size) {
2057 assert(!is_type_valid(type));
2061 /* we're past the last member of the current sub-aggregate, try if we
2062 * can ascend in the type hierarchy and continue with another subobject */
2063 size_t len = ARR_LEN(path->path);
2065 if (len > top_path_level) {
2066 ascend_from_subtype(path);
2067 advance_current_object(path, top_path_level);
2069 path->top_type = NULL;
2074 * skip any {...} blocks until a closing bracket is reached.
2076 static void skip_initializers(void)
2080 while (token.type != '}') {
2081 if (token.type == T_EOF)
2083 if (token.type == '{') {
2091 static initializer_t *create_empty_initializer(void)
2093 static initializer_t empty_initializer
2094 = { .list = { { INITIALIZER_LIST }, 0 } };
2095 return &empty_initializer;
2099 * Parse a part of an initialiser for a struct or union,
2101 static initializer_t *parse_sub_initializer(type_path_t *path,
2102 type_t *outer_type, size_t top_path_level,
2103 parse_initializer_env_t *env)
2105 if (token.type == '}') {
2106 /* empty initializer */
2107 return create_empty_initializer();
2110 type_t *orig_type = path->top_type;
2111 type_t *type = NULL;
2113 if (orig_type == NULL) {
2114 /* We are initializing an empty compound. */
2116 type = skip_typeref(orig_type);
2119 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2122 designator_t *designator = NULL;
2123 if (token.type == '.' || token.type == '[') {
2124 designator = parse_designation();
2125 goto finish_designator;
2126 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2127 /* GNU-style designator ("identifier: value") */
2128 designator = allocate_ast_zero(sizeof(designator[0]));
2129 designator->source_position = token.source_position;
2130 designator->symbol = token.symbol;
2135 /* reset path to toplevel, evaluate designator from there */
2136 ascend_to(path, top_path_level);
2137 if (!walk_designator(path, designator, false)) {
2138 /* can't continue after designation error */
2142 initializer_t *designator_initializer
2143 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2144 designator_initializer->designator.designator = designator;
2145 ARR_APP1(initializer_t*, initializers, designator_initializer);
2147 orig_type = path->top_type;
2148 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2153 if (token.type == '{') {
2154 if (type != NULL && is_type_scalar(type)) {
2155 sub = parse_scalar_initializer(type, env->must_be_constant);
2159 if (env->entity != NULL) {
2161 "extra brace group at end of initializer for '%Y'",
2162 env->entity->base.symbol);
2164 errorf(HERE, "extra brace group at end of initializer");
2167 descend_into_subtype(path);
2169 add_anchor_token('}');
2170 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2172 rem_anchor_token('}');
2175 ascend_from_subtype(path);
2176 expect('}', end_error);
2178 expect('}', end_error);
2179 goto error_parse_next;
2183 /* must be an expression */
2184 expression_t *expression = parse_assignment_expression();
2185 mark_vars_read(expression, NULL);
2187 if (env->must_be_constant && !is_initializer_constant(expression)) {
2188 errorf(&expression->base.source_position,
2189 "Initialisation expression '%E' is not constant",
2194 /* we are already outside, ... */
2195 if (outer_type == NULL)
2196 goto error_parse_next;
2197 type_t *const outer_type_skip = skip_typeref(outer_type);
2198 if (is_type_compound(outer_type_skip) &&
2199 !outer_type_skip->compound.compound->complete) {
2200 goto error_parse_next;
2205 /* handle { "string" } special case */
2206 if ((expression->kind == EXPR_STRING_LITERAL
2207 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2208 && outer_type != NULL) {
2209 sub = initializer_from_expression(outer_type, expression);
2212 if (token.type != '}' && warning.other) {
2213 warningf(HERE, "excessive elements in initializer for type '%T'",
2216 /* TODO: eat , ... */
2221 /* descend into subtypes until expression matches type */
2223 orig_type = path->top_type;
2224 type = skip_typeref(orig_type);
2226 sub = initializer_from_expression(orig_type, expression);
2230 if (!is_type_valid(type)) {
2233 if (is_type_scalar(type)) {
2234 errorf(&expression->base.source_position,
2235 "expression '%E' doesn't match expected type '%T'",
2236 expression, orig_type);
2240 descend_into_subtype(path);
2244 /* update largest index of top array */
2245 const type_path_entry_t *first = &path->path[0];
2246 type_t *first_type = first->type;
2247 first_type = skip_typeref(first_type);
2248 if (is_type_array(first_type)) {
2249 size_t index = first->v.index;
2250 if (index > path->max_index)
2251 path->max_index = index;
2255 /* append to initializers list */
2256 ARR_APP1(initializer_t*, initializers, sub);
2259 if (warning.other) {
2260 if (env->entity != NULL) {
2261 warningf(HERE, "excess elements in initializer for '%Y'",
2262 env->entity->base.symbol);
2264 warningf(HERE, "excess elements in initializer");
2270 if (token.type == '}') {
2273 expect(',', end_error);
2274 if (token.type == '}') {
2279 /* advance to the next declaration if we are not at the end */
2280 advance_current_object(path, top_path_level);
2281 orig_type = path->top_type;
2282 if (orig_type != NULL)
2283 type = skip_typeref(orig_type);
2289 size_t len = ARR_LEN(initializers);
2290 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2291 initializer_t *result = allocate_ast_zero(size);
2292 result->kind = INITIALIZER_LIST;
2293 result->list.len = len;
2294 memcpy(&result->list.initializers, initializers,
2295 len * sizeof(initializers[0]));
2297 DEL_ARR_F(initializers);
2298 ascend_to(path, top_path_level+1);
2303 skip_initializers();
2304 DEL_ARR_F(initializers);
2305 ascend_to(path, top_path_level+1);
2309 static expression_t *make_size_literal(size_t value)
2311 expression_t *literal = allocate_ast_zero(EXPR_LITERAL_INTEGER);
2312 literal->base.type = type_size_t;
2315 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2316 literal->literal.value = make_string(buf);
2322 * Parses an initializer. Parsers either a compound literal
2323 * (env->declaration == NULL) or an initializer of a declaration.
2325 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2327 type_t *type = skip_typeref(env->type);
2328 size_t max_index = 0xdeadbeaf; // TODO: Resolve this uninitialized variable problem
2329 initializer_t *result;
2331 if (is_type_scalar(type)) {
2332 result = parse_scalar_initializer(type, env->must_be_constant);
2333 } else if (token.type == '{') {
2337 memset(&path, 0, sizeof(path));
2338 path.top_type = env->type;
2339 path.path = NEW_ARR_F(type_path_entry_t, 0);
2341 descend_into_subtype(&path);
2343 add_anchor_token('}');
2344 result = parse_sub_initializer(&path, env->type, 1, env);
2345 rem_anchor_token('}');
2347 max_index = path.max_index;
2348 DEL_ARR_F(path.path);
2350 expect('}', end_error);
2352 /* parse_scalar_initializer() also works in this case: we simply
2353 * have an expression without {} around it */
2354 result = parse_scalar_initializer(type, env->must_be_constant);
2357 /* §6.7.8:22 array initializers for arrays with unknown size determine
2358 * the array type size */
2359 if (is_type_array(type) && type->array.size_expression == NULL
2360 && result != NULL) {
2362 switch (result->kind) {
2363 case INITIALIZER_LIST:
2364 assert(max_index != 0xdeadbeaf);
2365 size = max_index + 1;
2368 case INITIALIZER_STRING:
2369 size = result->string.string.size;
2372 case INITIALIZER_WIDE_STRING:
2373 size = result->wide_string.string.size;
2376 case INITIALIZER_DESIGNATOR:
2377 case INITIALIZER_VALUE:
2378 /* can happen for parse errors */
2383 internal_errorf(HERE, "invalid initializer type");
2386 type_t *new_type = duplicate_type(type);
2388 new_type->array.size_expression = make_size_literal(size);
2389 new_type->array.size_constant = true;
2390 new_type->array.has_implicit_size = true;
2391 new_type->array.size = size;
2392 env->type = new_type;
2400 static void append_entity(scope_t *scope, entity_t *entity)
2402 if (scope->last_entity != NULL) {
2403 scope->last_entity->base.next = entity;
2405 scope->entities = entity;
2407 entity->base.parent_entity = current_entity;
2408 scope->last_entity = entity;
2412 static compound_t *parse_compound_type_specifier(bool is_struct)
2414 eat(is_struct ? T_struct : T_union);
2416 symbol_t *symbol = NULL;
2417 compound_t *compound = NULL;
2418 attribute_t *attributes = NULL;
2420 if (token.type == T___attribute__) {
2421 attributes = parse_attributes(NULL);
2424 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2425 if (token.type == T_IDENTIFIER) {
2426 /* the compound has a name, check if we have seen it already */
2427 symbol = token.symbol;
2430 entity_t *entity = get_tag(symbol, kind);
2431 if (entity != NULL) {
2432 compound = &entity->compound;
2433 if (compound->base.parent_scope != current_scope &&
2434 (token.type == '{' || token.type == ';')) {
2435 /* we're in an inner scope and have a definition. Shadow
2436 * existing definition in outer scope */
2438 } else if (compound->complete && token.type == '{') {
2439 assert(symbol != NULL);
2440 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2441 is_struct ? "struct" : "union", symbol,
2442 &compound->base.source_position);
2443 /* clear members in the hope to avoid further errors */
2444 compound->members.entities = NULL;
2447 } else if (token.type != '{') {
2449 parse_error_expected("while parsing struct type specifier",
2450 T_IDENTIFIER, '{', NULL);
2452 parse_error_expected("while parsing union type specifier",
2453 T_IDENTIFIER, '{', NULL);
2459 if (compound == NULL) {
2460 entity_t *entity = allocate_entity_zero(kind);
2461 compound = &entity->compound;
2463 compound->alignment = 1;
2464 compound->base.namespc = NAMESPACE_TAG;
2465 compound->base.source_position = token.source_position;
2466 compound->base.symbol = symbol;
2467 compound->base.parent_scope = current_scope;
2468 if (symbol != NULL) {
2469 environment_push(entity);
2471 append_entity(current_scope, entity);
2474 if (token.type == '{') {
2475 parse_compound_type_entries(compound);
2477 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2478 if (symbol == NULL) {
2479 assert(anonymous_entity == NULL);
2480 anonymous_entity = (entity_t*)compound;
2484 if (attributes != NULL) {
2485 handle_entity_attributes(attributes, (entity_t*) compound);
2491 static void parse_enum_entries(type_t *const enum_type)
2495 if (token.type == '}') {
2496 errorf(HERE, "empty enum not allowed");
2501 add_anchor_token('}');
2503 if (token.type != T_IDENTIFIER) {
2504 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2506 rem_anchor_token('}');
2510 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2511 entity->enum_value.enum_type = enum_type;
2512 entity->base.symbol = token.symbol;
2513 entity->base.source_position = token.source_position;
2517 expression_t *value = parse_constant_expression();
2519 value = create_implicit_cast(value, enum_type);
2520 entity->enum_value.value = value;
2525 record_entity(entity, false);
2526 } while (next_if(',') && token.type != '}');
2527 rem_anchor_token('}');
2529 expect('}', end_error);
2535 static type_t *parse_enum_specifier(void)
2541 switch (token.type) {
2543 symbol = token.symbol;
2546 entity = get_tag(symbol, ENTITY_ENUM);
2547 if (entity != NULL) {
2548 if (entity->base.parent_scope != current_scope &&
2549 (token.type == '{' || token.type == ';')) {
2550 /* we're in an inner scope and have a definition. Shadow
2551 * existing definition in outer scope */
2553 } else if (entity->enume.complete && token.type == '{') {
2554 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
2555 symbol, &entity->base.source_position);
2566 parse_error_expected("while parsing enum type specifier",
2567 T_IDENTIFIER, '{', NULL);
2571 if (entity == NULL) {
2572 entity = allocate_entity_zero(ENTITY_ENUM);
2573 entity->base.namespc = NAMESPACE_TAG;
2574 entity->base.source_position = token.source_position;
2575 entity->base.symbol = symbol;
2576 entity->base.parent_scope = current_scope;
2579 type_t *const type = allocate_type_zero(TYPE_ENUM);
2580 type->enumt.enume = &entity->enume;
2581 type->enumt.akind = ATOMIC_TYPE_INT;
2583 if (token.type == '{') {
2584 if (symbol != NULL) {
2585 environment_push(entity);
2587 append_entity(current_scope, entity);
2588 entity->enume.complete = true;
2590 parse_enum_entries(type);
2591 parse_attributes(NULL);
2593 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2594 if (symbol == NULL) {
2595 assert(anonymous_entity == NULL);
2596 anonymous_entity = entity;
2598 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2599 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2607 * if a symbol is a typedef to another type, return true
2609 static bool is_typedef_symbol(symbol_t *symbol)
2611 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2612 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2615 static type_t *parse_typeof(void)
2621 expect('(', end_error);
2622 add_anchor_token(')');
2624 expression_t *expression = NULL;
2626 bool old_type_prop = in_type_prop;
2627 bool old_gcc_extension = in_gcc_extension;
2628 in_type_prop = true;
2630 while (next_if(T___extension__)) {
2631 /* This can be a prefix to a typename or an expression. */
2632 in_gcc_extension = true;
2634 switch (token.type) {
2636 if (is_typedef_symbol(token.symbol)) {
2637 type = parse_typename();
2639 expression = parse_expression();
2640 type = revert_automatic_type_conversion(expression);
2645 type = parse_typename();
2649 expression = parse_expression();
2650 type = expression->base.type;
2653 in_type_prop = old_type_prop;
2654 in_gcc_extension = old_gcc_extension;
2656 rem_anchor_token(')');
2657 expect(')', end_error);
2659 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2660 typeof_type->typeoft.expression = expression;
2661 typeof_type->typeoft.typeof_type = type;
2668 typedef enum specifiers_t {
2669 SPECIFIER_SIGNED = 1 << 0,
2670 SPECIFIER_UNSIGNED = 1 << 1,
2671 SPECIFIER_LONG = 1 << 2,
2672 SPECIFIER_INT = 1 << 3,
2673 SPECIFIER_DOUBLE = 1 << 4,
2674 SPECIFIER_CHAR = 1 << 5,
2675 SPECIFIER_WCHAR_T = 1 << 6,
2676 SPECIFIER_SHORT = 1 << 7,
2677 SPECIFIER_LONG_LONG = 1 << 8,
2678 SPECIFIER_FLOAT = 1 << 9,
2679 SPECIFIER_BOOL = 1 << 10,
2680 SPECIFIER_VOID = 1 << 11,
2681 SPECIFIER_INT8 = 1 << 12,
2682 SPECIFIER_INT16 = 1 << 13,
2683 SPECIFIER_INT32 = 1 << 14,
2684 SPECIFIER_INT64 = 1 << 15,
2685 SPECIFIER_INT128 = 1 << 16,
2686 SPECIFIER_COMPLEX = 1 << 17,
2687 SPECIFIER_IMAGINARY = 1 << 18,
2690 static type_t *create_builtin_type(symbol_t *const symbol,
2691 type_t *const real_type)
2693 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2694 type->builtin.symbol = symbol;
2695 type->builtin.real_type = real_type;
2696 return identify_new_type(type);
2699 static type_t *get_typedef_type(symbol_t *symbol)
2701 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2702 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2705 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2706 type->typedeft.typedefe = &entity->typedefe;
2711 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2713 expect('(', end_error);
2715 attribute_property_argument_t *property
2716 = allocate_ast_zero(sizeof(*property));
2719 if (token.type != T_IDENTIFIER) {
2720 parse_error_expected("while parsing property declspec",
2721 T_IDENTIFIER, NULL);
2726 symbol_t *symbol = token.symbol;
2728 if (strcmp(symbol->string, "put") == 0) {
2730 } else if (strcmp(symbol->string, "get") == 0) {
2733 errorf(HERE, "expected put or get in property declspec");
2736 expect('=', end_error);
2737 if (token.type != T_IDENTIFIER) {
2738 parse_error_expected("while parsing property declspec",
2739 T_IDENTIFIER, NULL);
2743 property->put_symbol = token.symbol;
2745 property->get_symbol = token.symbol;
2748 } while (next_if(','));
2750 attribute->a.property = property;
2752 expect(')', end_error);
2758 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2760 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2761 if (next_if(T_restrict)) {
2762 kind = ATTRIBUTE_MS_RESTRICT;
2763 } else if (token.type == T_IDENTIFIER) {
2764 const char *name = token.symbol->string;
2766 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2768 const char *attribute_name = get_attribute_name(k);
2769 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2775 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2776 warningf(HERE, "unknown __declspec '%s' ignored", name);
2779 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2783 attribute_t *attribute = allocate_attribute_zero(kind);
2785 if (kind == ATTRIBUTE_MS_PROPERTY) {
2786 return parse_attribute_ms_property(attribute);
2789 /* parse arguments */
2791 attribute->a.arguments = parse_attribute_arguments();
2796 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2800 expect('(', end_error);
2805 add_anchor_token(')');
2807 attribute_t **anchor = &first;
2809 while (*anchor != NULL)
2810 anchor = &(*anchor)->next;
2812 attribute_t *attribute
2813 = parse_microsoft_extended_decl_modifier_single();
2814 if (attribute == NULL)
2817 *anchor = attribute;
2818 anchor = &attribute->next;
2819 } while (next_if(','));
2821 rem_anchor_token(')');
2822 expect(')', end_error);
2826 rem_anchor_token(')');
2830 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2832 entity_t *entity = allocate_entity_zero(kind);
2833 entity->base.source_position = *HERE;
2834 entity->base.symbol = symbol;
2835 if (is_declaration(entity)) {
2836 entity->declaration.type = type_error_type;
2837 entity->declaration.implicit = true;
2838 } else if (kind == ENTITY_TYPEDEF) {
2839 entity->typedefe.type = type_error_type;
2840 entity->typedefe.builtin = true;
2842 if (kind != ENTITY_COMPOUND_MEMBER)
2843 record_entity(entity, false);
2847 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2849 type_t *type = NULL;
2850 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2851 unsigned type_specifiers = 0;
2852 bool newtype = false;
2853 bool saw_error = false;
2854 bool old_gcc_extension = in_gcc_extension;
2856 specifiers->source_position = token.source_position;
2859 specifiers->attributes = parse_attributes(specifiers->attributes);
2861 switch (token.type) {
2863 #define MATCH_STORAGE_CLASS(token, class) \
2865 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2866 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2868 specifiers->storage_class = class; \
2869 if (specifiers->thread_local) \
2870 goto check_thread_storage_class; \
2874 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2875 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2876 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2877 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2878 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2881 specifiers->attributes
2882 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2886 if (specifiers->thread_local) {
2887 errorf(HERE, "duplicate '__thread'");
2889 specifiers->thread_local = true;
2890 check_thread_storage_class:
2891 switch (specifiers->storage_class) {
2892 case STORAGE_CLASS_EXTERN:
2893 case STORAGE_CLASS_NONE:
2894 case STORAGE_CLASS_STATIC:
2898 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
2899 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
2900 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
2901 wrong_thread_stoarge_class:
2902 errorf(HERE, "'__thread' used with '%s'", wrong);
2909 /* type qualifiers */
2910 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2912 qualifiers |= qualifier; \
2916 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2917 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2918 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2919 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2920 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2921 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2922 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2923 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2925 case T___extension__:
2927 in_gcc_extension = true;
2930 /* type specifiers */
2931 #define MATCH_SPECIFIER(token, specifier, name) \
2933 if (type_specifiers & specifier) { \
2934 errorf(HERE, "multiple " name " type specifiers given"); \
2936 type_specifiers |= specifier; \
2941 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2942 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2943 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2944 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2945 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2946 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2947 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2948 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2949 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2950 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2951 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2952 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2953 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2954 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2955 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2956 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2957 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2958 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2962 specifiers->is_inline = true;
2966 case T__forceinline:
2968 specifiers->modifiers |= DM_FORCEINLINE;
2973 if (type_specifiers & SPECIFIER_LONG_LONG) {
2974 errorf(HERE, "multiple type specifiers given");
2975 } else if (type_specifiers & SPECIFIER_LONG) {
2976 type_specifiers |= SPECIFIER_LONG_LONG;
2978 type_specifiers |= SPECIFIER_LONG;
2983 #define CHECK_DOUBLE_TYPE() \
2984 if ( type != NULL) \
2985 errorf(HERE, "multiple data types in declaration specifiers");
2988 CHECK_DOUBLE_TYPE();
2989 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2991 type->compound.compound = parse_compound_type_specifier(true);
2994 CHECK_DOUBLE_TYPE();
2995 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2996 type->compound.compound = parse_compound_type_specifier(false);
2999 CHECK_DOUBLE_TYPE();
3000 type = parse_enum_specifier();
3003 CHECK_DOUBLE_TYPE();
3004 type = parse_typeof();
3006 case T___builtin_va_list:
3007 CHECK_DOUBLE_TYPE();
3008 type = duplicate_type(type_valist);
3012 case T_IDENTIFIER: {
3013 /* only parse identifier if we haven't found a type yet */
3014 if (type != NULL || type_specifiers != 0) {
3015 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3016 * declaration, so it doesn't generate errors about expecting '(' or
3018 switch (look_ahead(1)->type) {
3025 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3029 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3034 goto finish_specifiers;
3038 type_t *const typedef_type = get_typedef_type(token.symbol);
3039 if (typedef_type == NULL) {
3040 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3041 * declaration, so it doesn't generate 'implicit int' followed by more
3042 * errors later on. */
3043 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3049 errorf(HERE, "%K does not name a type", &token);
3052 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3054 type = allocate_type_zero(TYPE_TYPEDEF);
3055 type->typedeft.typedefe = &entity->typedefe;
3059 if (la1_type == '&' || la1_type == '*')
3060 goto finish_specifiers;
3065 goto finish_specifiers;
3070 type = typedef_type;
3074 /* function specifier */
3076 goto finish_specifiers;
3081 specifiers->attributes = parse_attributes(specifiers->attributes);
3083 in_gcc_extension = old_gcc_extension;
3085 if (type == NULL || (saw_error && type_specifiers != 0)) {
3086 atomic_type_kind_t atomic_type;
3088 /* match valid basic types */
3089 switch (type_specifiers) {
3090 case SPECIFIER_VOID:
3091 atomic_type = ATOMIC_TYPE_VOID;
3093 case SPECIFIER_WCHAR_T:
3094 atomic_type = ATOMIC_TYPE_WCHAR_T;
3096 case SPECIFIER_CHAR:
3097 atomic_type = ATOMIC_TYPE_CHAR;
3099 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3100 atomic_type = ATOMIC_TYPE_SCHAR;
3102 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3103 atomic_type = ATOMIC_TYPE_UCHAR;
3105 case SPECIFIER_SHORT:
3106 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3107 case SPECIFIER_SHORT | SPECIFIER_INT:
3108 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3109 atomic_type = ATOMIC_TYPE_SHORT;
3111 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3112 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3113 atomic_type = ATOMIC_TYPE_USHORT;
3116 case SPECIFIER_SIGNED:
3117 case SPECIFIER_SIGNED | SPECIFIER_INT:
3118 atomic_type = ATOMIC_TYPE_INT;
3120 case SPECIFIER_UNSIGNED:
3121 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3122 atomic_type = ATOMIC_TYPE_UINT;
3124 case SPECIFIER_LONG:
3125 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3126 case SPECIFIER_LONG | SPECIFIER_INT:
3127 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3128 atomic_type = ATOMIC_TYPE_LONG;
3130 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3131 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3132 atomic_type = ATOMIC_TYPE_ULONG;
3135 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3136 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3137 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3138 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3140 atomic_type = ATOMIC_TYPE_LONGLONG;
3141 goto warn_about_long_long;
3143 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3144 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3146 atomic_type = ATOMIC_TYPE_ULONGLONG;
3147 warn_about_long_long:
3148 if (warning.long_long) {
3149 warningf(&specifiers->source_position,
3150 "ISO C90 does not support 'long long'");
3154 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3155 atomic_type = unsigned_int8_type_kind;
3158 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3159 atomic_type = unsigned_int16_type_kind;
3162 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3163 atomic_type = unsigned_int32_type_kind;
3166 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3167 atomic_type = unsigned_int64_type_kind;
3170 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3171 atomic_type = unsigned_int128_type_kind;
3174 case SPECIFIER_INT8:
3175 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3176 atomic_type = int8_type_kind;
3179 case SPECIFIER_INT16:
3180 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3181 atomic_type = int16_type_kind;
3184 case SPECIFIER_INT32:
3185 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3186 atomic_type = int32_type_kind;
3189 case SPECIFIER_INT64:
3190 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3191 atomic_type = int64_type_kind;
3194 case SPECIFIER_INT128:
3195 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3196 atomic_type = int128_type_kind;
3199 case SPECIFIER_FLOAT:
3200 atomic_type = ATOMIC_TYPE_FLOAT;
3202 case SPECIFIER_DOUBLE:
3203 atomic_type = ATOMIC_TYPE_DOUBLE;
3205 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3206 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3208 case SPECIFIER_BOOL:
3209 atomic_type = ATOMIC_TYPE_BOOL;
3211 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3212 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3213 atomic_type = ATOMIC_TYPE_FLOAT;
3215 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3216 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3217 atomic_type = ATOMIC_TYPE_DOUBLE;
3219 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3220 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3221 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3224 /* invalid specifier combination, give an error message */
3225 if (type_specifiers == 0) {
3229 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3230 if (!(c_mode & _CXX) && !strict_mode) {
3231 if (warning.implicit_int) {
3232 warningf(HERE, "no type specifiers in declaration, using 'int'");
3234 atomic_type = ATOMIC_TYPE_INT;
3237 errorf(HERE, "no type specifiers given in declaration");
3239 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3240 (type_specifiers & SPECIFIER_UNSIGNED)) {
3241 errorf(HERE, "signed and unsigned specifiers given");
3242 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3243 errorf(HERE, "only integer types can be signed or unsigned");
3245 errorf(HERE, "multiple datatypes in declaration");
3250 if (type_specifiers & SPECIFIER_COMPLEX) {
3251 type = allocate_type_zero(TYPE_COMPLEX);
3252 type->complex.akind = atomic_type;
3253 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3254 type = allocate_type_zero(TYPE_IMAGINARY);
3255 type->imaginary.akind = atomic_type;
3257 type = allocate_type_zero(TYPE_ATOMIC);
3258 type->atomic.akind = atomic_type;
3261 } else if (type_specifiers != 0) {
3262 errorf(HERE, "multiple datatypes in declaration");
3265 /* FIXME: check type qualifiers here */
3266 type->base.qualifiers = qualifiers;
3269 type = identify_new_type(type);
3271 type = typehash_insert(type);
3274 if (specifiers->attributes != NULL)
3275 type = handle_type_attributes(specifiers->attributes, type);
3276 specifiers->type = type;
3280 specifiers->type = type_error_type;
3283 static type_qualifiers_t parse_type_qualifiers(void)
3285 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3288 switch (token.type) {
3289 /* type qualifiers */
3290 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3291 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3292 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3293 /* microsoft extended type modifiers */
3294 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3295 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3296 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3297 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3298 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3307 * Parses an K&R identifier list
3309 static void parse_identifier_list(scope_t *scope)
3312 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3313 entity->base.source_position = token.source_position;
3314 entity->base.namespc = NAMESPACE_NORMAL;
3315 entity->base.symbol = token.symbol;
3316 /* a K&R parameter has no type, yet */
3320 append_entity(scope, entity);
3321 } while (next_if(',') && token.type == T_IDENTIFIER);
3324 static entity_t *parse_parameter(void)
3326 declaration_specifiers_t specifiers;
3327 memset(&specifiers, 0, sizeof(specifiers));
3329 parse_declaration_specifiers(&specifiers);
3331 entity_t *entity = parse_declarator(&specifiers,
3332 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3333 anonymous_entity = NULL;
3337 static void semantic_parameter_incomplete(const entity_t *entity)
3339 assert(entity->kind == ENTITY_PARAMETER);
3341 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3342 * list in a function declarator that is part of a
3343 * definition of that function shall not have
3344 * incomplete type. */
3345 type_t *type = skip_typeref(entity->declaration.type);
3346 if (is_type_incomplete(type)) {
3347 errorf(&entity->base.source_position,
3348 "parameter '%#T' has incomplete type",
3349 entity->declaration.type, entity->base.symbol);
3353 static bool has_parameters(void)
3355 /* func(void) is not a parameter */
3356 if (token.type == T_IDENTIFIER) {
3357 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3360 if (entity->kind != ENTITY_TYPEDEF)
3362 if (skip_typeref(entity->typedefe.type) != type_void)
3364 } else if (token.type != T_void) {
3367 if (look_ahead(1)->type != ')')
3374 * Parses function type parameters (and optionally creates variable_t entities
3375 * for them in a scope)
3377 static void parse_parameters(function_type_t *type, scope_t *scope)
3380 add_anchor_token(')');
3381 int saved_comma_state = save_and_reset_anchor_state(',');
3383 if (token.type == T_IDENTIFIER &&
3384 !is_typedef_symbol(token.symbol)) {
3385 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3386 if (la1_type == ',' || la1_type == ')') {
3387 type->kr_style_parameters = true;
3388 parse_identifier_list(scope);
3389 goto parameters_finished;
3393 if (token.type == ')') {
3394 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3395 if (!(c_mode & _CXX))
3396 type->unspecified_parameters = true;
3397 goto parameters_finished;
3400 if (has_parameters()) {
3401 function_parameter_t **anchor = &type->parameters;
3403 switch (token.type) {
3406 type->variadic = true;
3407 goto parameters_finished;
3410 case T___extension__:
3413 entity_t *entity = parse_parameter();
3414 if (entity->kind == ENTITY_TYPEDEF) {
3415 errorf(&entity->base.source_position,
3416 "typedef not allowed as function parameter");
3419 assert(is_declaration(entity));
3421 semantic_parameter_incomplete(entity);
3423 function_parameter_t *const parameter =
3424 allocate_parameter(entity->declaration.type);
3426 if (scope != NULL) {
3427 append_entity(scope, entity);
3430 *anchor = parameter;
3431 anchor = ¶meter->next;
3436 goto parameters_finished;
3438 } while (next_if(','));
3442 parameters_finished:
3443 rem_anchor_token(')');
3444 expect(')', end_error);
3447 restore_anchor_state(',', saved_comma_state);
3450 typedef enum construct_type_kind_t {
3453 CONSTRUCT_REFERENCE,
3456 } construct_type_kind_t;
3458 typedef union construct_type_t construct_type_t;
3460 typedef struct construct_type_base_t {
3461 construct_type_kind_t kind;
3462 construct_type_t *next;
3463 } construct_type_base_t;
3465 typedef struct parsed_pointer_t {
3466 construct_type_base_t base;
3467 type_qualifiers_t type_qualifiers;
3468 variable_t *base_variable; /**< MS __based extension. */
3471 typedef struct parsed_reference_t {
3472 construct_type_base_t base;
3473 } parsed_reference_t;
3475 typedef struct construct_function_type_t {
3476 construct_type_base_t base;
3477 type_t *function_type;
3478 } construct_function_type_t;
3480 typedef struct parsed_array_t {
3481 construct_type_base_t base;
3482 type_qualifiers_t type_qualifiers;
3488 union construct_type_t {
3489 construct_type_kind_t kind;
3490 construct_type_base_t base;
3491 parsed_pointer_t pointer;
3492 parsed_reference_t reference;
3493 construct_function_type_t function;
3494 parsed_array_t array;
3497 static construct_type_t *parse_pointer_declarator(void)
3501 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3502 memset(pointer, 0, sizeof(pointer[0]));
3503 pointer->base.kind = CONSTRUCT_POINTER;
3504 pointer->type_qualifiers = parse_type_qualifiers();
3505 //pointer->base_variable = base_variable;
3507 return (construct_type_t*) pointer;
3510 static construct_type_t *parse_reference_declarator(void)
3514 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->reference));
3515 parsed_reference_t *reference = &cons->reference;
3516 memset(reference, 0, sizeof(*reference));
3517 cons->kind = CONSTRUCT_REFERENCE;
3522 static construct_type_t *parse_array_declarator(void)
3525 add_anchor_token(']');
3527 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->array));
3528 parsed_array_t *array = &cons->array;
3529 memset(array, 0, sizeof(*array));
3530 cons->kind = CONSTRUCT_ARRAY;
3532 if (next_if(T_static))
3533 array->is_static = true;
3535 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3536 if (type_qualifiers != 0 && next_if(T_static))
3537 array->is_static = true;
3538 array->type_qualifiers = type_qualifiers;
3540 if (token.type == '*' && look_ahead(1)->type == ']') {
3541 array->is_variable = true;
3543 } else if (token.type != ']') {
3544 expression_t *const 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 rem_anchor_token(']');
3560 expect(']', end_error);
3566 static construct_type_t *parse_function_declarator(scope_t *scope)
3568 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3569 function_type_t *ftype = &type->function;
3571 ftype->linkage = current_linkage;
3572 ftype->calling_convention = CC_DEFAULT;
3574 parse_parameters(ftype, scope);
3576 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->function));
3577 construct_function_type_t *function = &cons->function;
3578 memset(function, 0, sizeof(*function));
3579 cons->kind = CONSTRUCT_FUNCTION;
3580 function->function_type = type;
3585 typedef struct parse_declarator_env_t {
3586 bool may_be_abstract : 1;
3587 bool must_be_abstract : 1;
3588 decl_modifiers_t modifiers;
3590 source_position_t source_position;
3592 attribute_t *attributes;
3593 } parse_declarator_env_t;
3595 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3597 /* construct a single linked list of construct_type_t's which describe
3598 * how to construct the final declarator type */
3599 construct_type_t *first = NULL;
3600 construct_type_t **anchor = &first;
3602 env->attributes = parse_attributes(env->attributes);
3605 construct_type_t *type;
3606 //variable_t *based = NULL; /* MS __based extension */
3607 switch (token.type) {
3609 if (!(c_mode & _CXX))
3610 errorf(HERE, "references are only available for C++");
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);
3664 if (env->may_be_abstract)
3666 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3671 construct_type_t **const p = anchor;
3674 construct_type_t *type;
3675 switch (token.type) {
3677 scope_t *scope = NULL;
3678 if (!env->must_be_abstract) {
3679 scope = &env->parameters;
3682 type = parse_function_declarator(scope);
3686 type = parse_array_declarator();
3689 goto declarator_finished;
3692 /* insert in the middle of the list (at p) */
3693 type->base.next = *p;
3696 anchor = &type->base.next;
3699 declarator_finished:
3700 /* append inner_types at the end of the list, we don't to set anchor anymore
3701 * as it's not needed anymore */
3702 *anchor = inner_types;
3709 static type_t *construct_declarator_type(construct_type_t *construct_list,
3712 construct_type_t *iter = construct_list;
3713 for (; iter != NULL; iter = iter->base.next) {
3714 switch (iter->kind) {
3715 case CONSTRUCT_INVALID:
3717 case CONSTRUCT_FUNCTION: {
3718 construct_function_type_t *function = &iter->function;
3719 type_t *function_type = function->function_type;
3721 function_type->function.return_type = type;
3723 type_t *skipped_return_type = skip_typeref(type);
3725 if (is_type_function(skipped_return_type)) {
3726 errorf(HERE, "function returning function is not allowed");
3727 } else if (is_type_array(skipped_return_type)) {
3728 errorf(HERE, "function returning array is not allowed");
3730 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3732 "type qualifiers in return type of function type are meaningless");
3736 /* The function type was constructed earlier. Freeing it here will
3737 * destroy other types. */
3738 type = typehash_insert(function_type);
3742 case CONSTRUCT_POINTER: {
3743 if (is_type_reference(skip_typeref(type)))
3744 errorf(HERE, "cannot declare a pointer to reference");
3746 parsed_pointer_t *pointer = &iter->pointer;
3747 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3751 case CONSTRUCT_REFERENCE:
3752 if (is_type_reference(skip_typeref(type)))
3753 errorf(HERE, "cannot declare a reference to reference");
3755 type = make_reference_type(type);
3758 case CONSTRUCT_ARRAY: {
3759 if (is_type_reference(skip_typeref(type)))
3760 errorf(HERE, "cannot declare an array of references");
3762 parsed_array_t *array = &iter->array;
3763 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3765 expression_t *size_expression = array->size;
3766 if (size_expression != NULL) {
3768 = create_implicit_cast(size_expression, type_size_t);
3771 array_type->base.qualifiers = array->type_qualifiers;
3772 array_type->array.element_type = type;
3773 array_type->array.is_static = array->is_static;
3774 array_type->array.is_variable = array->is_variable;
3775 array_type->array.size_expression = size_expression;
3777 if (size_expression != NULL) {
3778 if (is_constant_expression(size_expression)) {
3780 = fold_constant_to_int(size_expression);
3781 array_type->array.size = size;
3782 array_type->array.size_constant = true;
3783 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3784 * have a value greater than zero. */
3786 if (size < 0 || !GNU_MODE) {
3787 errorf(&size_expression->base.source_position,
3788 "size of array must be greater than zero");
3789 } else if (warning.other) {
3790 warningf(&size_expression->base.source_position,
3791 "zero length arrays are a GCC extension");
3795 array_type->array.is_vla = true;
3799 type_t *skipped_type = skip_typeref(type);
3801 if (is_type_incomplete(skipped_type)) {
3802 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
3803 } else if (is_type_function(skipped_type)) {
3804 errorf(HERE, "array of functions is not allowed");
3806 type = identify_new_type(array_type);
3810 internal_errorf(HERE, "invalid type construction found");
3816 static type_t *automatic_type_conversion(type_t *orig_type);
3818 static type_t *semantic_parameter(const source_position_t *pos,
3820 const declaration_specifiers_t *specifiers,
3823 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3824 * shall be adjusted to ``qualified pointer to type'',
3826 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3827 * type'' shall be adjusted to ``pointer to function
3828 * returning type'', as in 6.3.2.1. */
3829 type = automatic_type_conversion(type);
3831 if (specifiers->is_inline && is_type_valid(type)) {
3832 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3835 /* §6.9.1:6 The declarations in the declaration list shall contain
3836 * no storage-class specifier other than register and no
3837 * initializations. */
3838 if (specifiers->thread_local || (
3839 specifiers->storage_class != STORAGE_CLASS_NONE &&
3840 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3842 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3845 /* delay test for incomplete type, because we might have (void)
3846 * which is legal but incomplete... */
3851 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3852 declarator_flags_t flags)
3854 parse_declarator_env_t env;
3855 memset(&env, 0, sizeof(env));
3856 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3858 construct_type_t *construct_type = parse_inner_declarator(&env);
3860 construct_declarator_type(construct_type, specifiers->type);
3861 type_t *type = skip_typeref(orig_type);
3863 if (construct_type != NULL) {
3864 obstack_free(&temp_obst, construct_type);
3867 attribute_t *attributes = parse_attributes(env.attributes);
3868 /* append (shared) specifier attribute behind attributes of this
3870 attribute_t **anchor = &attributes;
3871 while (*anchor != NULL)
3872 anchor = &(*anchor)->next;
3873 *anchor = specifiers->attributes;
3876 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3877 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3878 entity->base.symbol = env.symbol;
3879 entity->base.source_position = env.source_position;
3880 entity->typedefe.type = orig_type;
3882 if (anonymous_entity != NULL) {
3883 if (is_type_compound(type)) {
3884 assert(anonymous_entity->compound.alias == NULL);
3885 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3886 anonymous_entity->kind == ENTITY_UNION);
3887 anonymous_entity->compound.alias = entity;
3888 anonymous_entity = NULL;
3889 } else if (is_type_enum(type)) {
3890 assert(anonymous_entity->enume.alias == NULL);
3891 assert(anonymous_entity->kind == ENTITY_ENUM);
3892 anonymous_entity->enume.alias = entity;
3893 anonymous_entity = NULL;
3897 /* create a declaration type entity */
3898 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3899 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3901 if (env.symbol != NULL) {
3902 if (specifiers->is_inline && is_type_valid(type)) {
3903 errorf(&env.source_position,
3904 "compound member '%Y' declared 'inline'", env.symbol);
3907 if (specifiers->thread_local ||
3908 specifiers->storage_class != STORAGE_CLASS_NONE) {
3909 errorf(&env.source_position,
3910 "compound member '%Y' must have no storage class",
3914 } else if (flags & DECL_IS_PARAMETER) {
3915 orig_type = semantic_parameter(&env.source_position, orig_type,
3916 specifiers, env.symbol);
3918 entity = allocate_entity_zero(ENTITY_PARAMETER);
3919 } else if (is_type_function(type)) {
3920 entity = allocate_entity_zero(ENTITY_FUNCTION);
3922 entity->function.is_inline = specifiers->is_inline;
3923 entity->function.parameters = env.parameters;
3925 if (env.symbol != NULL) {
3926 /* this needs fixes for C++ */
3927 bool in_function_scope = current_function != NULL;
3929 if (specifiers->thread_local || (
3930 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3931 specifiers->storage_class != STORAGE_CLASS_NONE &&
3932 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3934 errorf(&env.source_position,
3935 "invalid storage class for function '%Y'", env.symbol);
3939 entity = allocate_entity_zero(ENTITY_VARIABLE);
3941 entity->variable.thread_local = specifiers->thread_local;
3943 if (env.symbol != NULL) {
3944 if (specifiers->is_inline && is_type_valid(type)) {
3945 errorf(&env.source_position,
3946 "variable '%Y' declared 'inline'", env.symbol);
3949 bool invalid_storage_class = false;
3950 if (current_scope == file_scope) {
3951 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3952 specifiers->storage_class != STORAGE_CLASS_NONE &&
3953 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3954 invalid_storage_class = true;
3957 if (specifiers->thread_local &&
3958 specifiers->storage_class == STORAGE_CLASS_NONE) {
3959 invalid_storage_class = true;
3962 if (invalid_storage_class) {
3963 errorf(&env.source_position,
3964 "invalid storage class for variable '%Y'", env.symbol);
3969 if (env.symbol != NULL) {
3970 entity->base.symbol = env.symbol;
3971 entity->base.source_position = env.source_position;
3973 entity->base.source_position = specifiers->source_position;
3975 entity->base.namespc = NAMESPACE_NORMAL;
3976 entity->declaration.type = orig_type;
3977 entity->declaration.alignment = get_type_alignment(orig_type);
3978 entity->declaration.modifiers = env.modifiers;
3979 entity->declaration.attributes = attributes;
3981 storage_class_t storage_class = specifiers->storage_class;
3982 entity->declaration.declared_storage_class = storage_class;
3984 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3985 storage_class = STORAGE_CLASS_AUTO;
3986 entity->declaration.storage_class = storage_class;
3989 if (attributes != NULL) {
3990 handle_entity_attributes(attributes, entity);
3996 static type_t *parse_abstract_declarator(type_t *base_type)
3998 parse_declarator_env_t env;
3999 memset(&env, 0, sizeof(env));
4000 env.may_be_abstract = true;
4001 env.must_be_abstract = true;
4003 construct_type_t *construct_type = parse_inner_declarator(&env);
4005 type_t *result = construct_declarator_type(construct_type, base_type);
4006 if (construct_type != NULL) {
4007 obstack_free(&temp_obst, construct_type);
4009 result = handle_type_attributes(env.attributes, result);
4015 * Check if the declaration of main is suspicious. main should be a
4016 * function with external linkage, returning int, taking either zero
4017 * arguments, two, or three arguments of appropriate types, ie.
4019 * int main([ int argc, char **argv [, char **env ] ]).
4021 * @param decl the declaration to check
4022 * @param type the function type of the declaration
4024 static void check_main(const entity_t *entity)
4026 const source_position_t *pos = &entity->base.source_position;
4027 if (entity->kind != ENTITY_FUNCTION) {
4028 warningf(pos, "'main' is not a function");
4032 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4033 warningf(pos, "'main' is normally a non-static function");
4036 type_t *type = skip_typeref(entity->declaration.type);
4037 assert(is_type_function(type));
4039 function_type_t *func_type = &type->function;
4040 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4041 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4042 func_type->return_type);
4044 const function_parameter_t *parm = func_type->parameters;
4046 type_t *const first_type = parm->type;
4047 if (!types_compatible(skip_typeref(first_type), type_int)) {
4049 "first argument of 'main' should be 'int', but is '%T'",
4054 type_t *const second_type = parm->type;
4055 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4056 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4060 type_t *const third_type = parm->type;
4061 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4062 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4066 goto warn_arg_count;
4070 warningf(pos, "'main' takes only zero, two or three arguments");
4076 * Check if a symbol is the equal to "main".
4078 static bool is_sym_main(const symbol_t *const sym)
4080 return strcmp(sym->string, "main") == 0;
4083 static void error_redefined_as_different_kind(const source_position_t *pos,
4084 const entity_t *old, entity_kind_t new_kind)
4086 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4087 get_entity_kind_name(old->kind), old->base.symbol,
4088 get_entity_kind_name(new_kind), &old->base.source_position);
4091 static bool is_error_entity(entity_t *const ent)
4093 if (is_declaration(ent)) {
4094 return is_type_valid(skip_typeref(ent->declaration.type));
4095 } else if (ent->kind == ENTITY_TYPEDEF) {
4096 return is_type_valid(skip_typeref(ent->typedefe.type));
4101 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4103 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4104 if (attributes_equal(tattr, attr))
4111 * test wether new_list contains any attributes not included in old_list
4113 static bool has_new_attributes(const attribute_t *old_list,
4114 const attribute_t *new_list)
4116 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4117 if (!contains_attribute(old_list, attr))
4124 * Merge in attributes from an attribute list (probably from a previous
4125 * declaration with the same name). Warning: destroys the old structure
4126 * of the attribute list - don't reuse attributes after this call.
4128 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4131 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4133 if (contains_attribute(decl->attributes, attr))
4136 /* move attribute to new declarations attributes list */
4137 attr->next = decl->attributes;
4138 decl->attributes = attr;
4143 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4144 * for various problems that occur for multiple definitions
4146 entity_t *record_entity(entity_t *entity, const bool is_definition)
4148 const symbol_t *const symbol = entity->base.symbol;
4149 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4150 const source_position_t *pos = &entity->base.source_position;
4152 /* can happen in error cases */
4156 entity_t *const previous_entity = get_entity(symbol, namespc);
4157 /* pushing the same entity twice will break the stack structure */
4158 assert(previous_entity != entity);
4160 if (entity->kind == ENTITY_FUNCTION) {
4161 type_t *const orig_type = entity->declaration.type;
4162 type_t *const type = skip_typeref(orig_type);
4164 assert(is_type_function(type));
4165 if (type->function.unspecified_parameters &&
4166 warning.strict_prototypes &&
4167 previous_entity == NULL) {
4168 warningf(pos, "function declaration '%#T' is not a prototype",
4172 if (warning.main && current_scope == file_scope
4173 && is_sym_main(symbol)) {
4178 if (is_declaration(entity) &&
4179 warning.nested_externs &&
4180 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4181 current_scope != file_scope) {
4182 warningf(pos, "nested extern declaration of '%#T'",
4183 entity->declaration.type, symbol);
4186 if (previous_entity != NULL) {
4187 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4188 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4189 assert(previous_entity->kind == ENTITY_PARAMETER);
4191 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4192 entity->declaration.type, symbol,
4193 previous_entity->declaration.type, symbol,
4194 &previous_entity->base.source_position);
4198 if (previous_entity->base.parent_scope == current_scope) {
4199 if (previous_entity->kind != entity->kind) {
4200 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
4201 error_redefined_as_different_kind(pos, previous_entity,
4206 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4207 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4208 symbol, &previous_entity->base.source_position);
4211 if (previous_entity->kind == ENTITY_TYPEDEF) {
4212 /* TODO: C++ allows this for exactly the same type */
4213 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4214 symbol, &previous_entity->base.source_position);
4218 /* at this point we should have only VARIABLES or FUNCTIONS */
4219 assert(is_declaration(previous_entity) && is_declaration(entity));
4221 declaration_t *const prev_decl = &previous_entity->declaration;
4222 declaration_t *const decl = &entity->declaration;
4224 /* can happen for K&R style declarations */
4225 if (prev_decl->type == NULL &&
4226 previous_entity->kind == ENTITY_PARAMETER &&
4227 entity->kind == ENTITY_PARAMETER) {
4228 prev_decl->type = decl->type;
4229 prev_decl->storage_class = decl->storage_class;
4230 prev_decl->declared_storage_class = decl->declared_storage_class;
4231 prev_decl->modifiers = decl->modifiers;
4232 return previous_entity;
4235 type_t *const orig_type = decl->type;
4236 assert(orig_type != NULL);
4237 type_t *const type = skip_typeref(orig_type);
4238 type_t *const prev_type = skip_typeref(prev_decl->type);
4240 if (!types_compatible(type, prev_type)) {
4242 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4243 orig_type, symbol, prev_decl->type, symbol,
4244 &previous_entity->base.source_position);
4246 unsigned old_storage_class = prev_decl->storage_class;
4248 if (warning.redundant_decls &&
4251 !(prev_decl->modifiers & DM_USED) &&
4252 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4253 warningf(&previous_entity->base.source_position,
4254 "unnecessary static forward declaration for '%#T'",
4255 prev_decl->type, symbol);
4258 storage_class_t new_storage_class = decl->storage_class;
4260 /* pretend no storage class means extern for function
4261 * declarations (except if the previous declaration is neither
4262 * none nor extern) */
4263 if (entity->kind == ENTITY_FUNCTION) {
4264 /* the previous declaration could have unspecified parameters or
4265 * be a typedef, so use the new type */
4266 if (prev_type->function.unspecified_parameters || is_definition)
4267 prev_decl->type = type;
4269 switch (old_storage_class) {
4270 case STORAGE_CLASS_NONE:
4271 old_storage_class = STORAGE_CLASS_EXTERN;
4274 case STORAGE_CLASS_EXTERN:
4275 if (is_definition) {
4276 if (warning.missing_prototypes &&
4277 prev_type->function.unspecified_parameters &&
4278 !is_sym_main(symbol)) {
4279 warningf(pos, "no previous prototype for '%#T'",
4282 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4283 new_storage_class = STORAGE_CLASS_EXTERN;
4290 } else if (is_type_incomplete(prev_type)) {
4291 prev_decl->type = type;
4294 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4295 new_storage_class == STORAGE_CLASS_EXTERN) {
4297 warn_redundant_declaration: ;
4299 = has_new_attributes(prev_decl->attributes,
4301 if (has_new_attrs) {
4302 merge_in_attributes(decl, prev_decl->attributes);
4303 } else if (!is_definition &&
4304 warning.redundant_decls &&
4305 is_type_valid(prev_type) &&
4306 strcmp(previous_entity->base.source_position.input_name,
4307 "<builtin>") != 0) {
4309 "redundant declaration for '%Y' (declared %P)",
4310 symbol, &previous_entity->base.source_position);
4312 } else if (current_function == NULL) {
4313 if (old_storage_class != STORAGE_CLASS_STATIC &&
4314 new_storage_class == STORAGE_CLASS_STATIC) {
4316 "static declaration of '%Y' follows non-static declaration (declared %P)",
4317 symbol, &previous_entity->base.source_position);
4318 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4319 prev_decl->storage_class = STORAGE_CLASS_NONE;
4320 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4322 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4324 goto error_redeclaration;
4325 goto warn_redundant_declaration;
4327 } else if (is_type_valid(prev_type)) {
4328 if (old_storage_class == new_storage_class) {
4329 error_redeclaration:
4330 errorf(pos, "redeclaration of '%Y' (declared %P)",
4331 symbol, &previous_entity->base.source_position);
4334 "redeclaration of '%Y' with different linkage (declared %P)",
4335 symbol, &previous_entity->base.source_position);
4340 prev_decl->modifiers |= decl->modifiers;
4341 if (entity->kind == ENTITY_FUNCTION) {
4342 previous_entity->function.is_inline |= entity->function.is_inline;
4344 return previous_entity;
4347 if (warning.shadow) {
4348 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4349 get_entity_kind_name(entity->kind), symbol,
4350 get_entity_kind_name(previous_entity->kind),
4351 &previous_entity->base.source_position);
4355 if (entity->kind == ENTITY_FUNCTION) {
4356 if (is_definition &&
4357 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4358 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4359 warningf(pos, "no previous prototype for '%#T'",
4360 entity->declaration.type, symbol);
4361 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4362 warningf(pos, "no previous declaration for '%#T'",
4363 entity->declaration.type, symbol);
4366 } else if (warning.missing_declarations &&
4367 entity->kind == ENTITY_VARIABLE &&
4368 current_scope == file_scope) {
4369 declaration_t *declaration = &entity->declaration;
4370 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4371 warningf(pos, "no previous declaration for '%#T'",
4372 declaration->type, symbol);
4377 assert(entity->base.parent_scope == NULL);
4378 assert(current_scope != NULL);
4380 entity->base.parent_scope = current_scope;
4381 entity->base.namespc = NAMESPACE_NORMAL;
4382 environment_push(entity);
4383 append_entity(current_scope, entity);
4388 static void parser_error_multiple_definition(entity_t *entity,
4389 const source_position_t *source_position)
4391 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4392 entity->base.symbol, &entity->base.source_position);
4395 static bool is_declaration_specifier(const token_t *token,
4396 bool only_specifiers_qualifiers)
4398 switch (token->type) {
4403 return is_typedef_symbol(token->symbol);
4405 case T___extension__:
4407 return !only_specifiers_qualifiers;
4414 static void parse_init_declarator_rest(entity_t *entity)
4416 assert(is_declaration(entity));
4417 declaration_t *const declaration = &entity->declaration;
4421 type_t *orig_type = declaration->type;
4422 type_t *type = skip_typeref(orig_type);
4424 if (entity->kind == ENTITY_VARIABLE
4425 && entity->variable.initializer != NULL) {
4426 parser_error_multiple_definition(entity, HERE);
4429 bool must_be_constant = false;
4430 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4431 entity->base.parent_scope == file_scope) {
4432 must_be_constant = true;
4435 if (is_type_function(type)) {
4436 errorf(&entity->base.source_position,
4437 "function '%#T' is initialized like a variable",
4438 orig_type, entity->base.symbol);
4439 orig_type = type_error_type;
4442 parse_initializer_env_t env;
4443 env.type = orig_type;
4444 env.must_be_constant = must_be_constant;
4445 env.entity = entity;
4446 current_init_decl = entity;
4448 initializer_t *initializer = parse_initializer(&env);
4449 current_init_decl = NULL;
4451 if (entity->kind == ENTITY_VARIABLE) {
4452 /* §6.7.5:22 array initializers for arrays with unknown size
4453 * determine the array type size */
4454 declaration->type = env.type;
4455 entity->variable.initializer = initializer;
4459 /* parse rest of a declaration without any declarator */
4460 static void parse_anonymous_declaration_rest(
4461 const declaration_specifiers_t *specifiers)
4464 anonymous_entity = NULL;
4466 if (warning.other) {
4467 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4468 specifiers->thread_local) {
4469 warningf(&specifiers->source_position,
4470 "useless storage class in empty declaration");
4473 type_t *type = specifiers->type;
4474 switch (type->kind) {
4475 case TYPE_COMPOUND_STRUCT:
4476 case TYPE_COMPOUND_UNION: {
4477 if (type->compound.compound->base.symbol == NULL) {
4478 warningf(&specifiers->source_position,
4479 "unnamed struct/union that defines no instances");
4488 warningf(&specifiers->source_position, "empty declaration");
4494 static void check_variable_type_complete(entity_t *ent)
4496 if (ent->kind != ENTITY_VARIABLE)
4499 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4500 * type for the object shall be complete [...] */
4501 declaration_t *decl = &ent->declaration;
4502 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4503 decl->storage_class == STORAGE_CLASS_STATIC)
4506 type_t *const orig_type = decl->type;
4507 type_t *const type = skip_typeref(orig_type);
4508 if (!is_type_incomplete(type))
4511 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4512 * are given length one. */
4513 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4514 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4518 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4519 orig_type, ent->base.symbol);
4523 static void parse_declaration_rest(entity_t *ndeclaration,
4524 const declaration_specifiers_t *specifiers,
4525 parsed_declaration_func finished_declaration,
4526 declarator_flags_t flags)
4528 add_anchor_token(';');
4529 add_anchor_token(',');
4531 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4533 if (token.type == '=') {
4534 parse_init_declarator_rest(entity);
4535 } else if (entity->kind == ENTITY_VARIABLE) {
4536 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4537 * [...] where the extern specifier is explicitly used. */
4538 declaration_t *decl = &entity->declaration;
4539 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4540 type_t *type = decl->type;
4541 if (is_type_reference(skip_typeref(type))) {
4542 errorf(&entity->base.source_position,
4543 "reference '%#T' must be initialized",
4544 type, entity->base.symbol);
4549 check_variable_type_complete(entity);
4554 add_anchor_token('=');
4555 ndeclaration = parse_declarator(specifiers, flags);
4556 rem_anchor_token('=');
4558 expect(';', end_error);
4561 anonymous_entity = NULL;
4562 rem_anchor_token(';');
4563 rem_anchor_token(',');
4566 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4568 symbol_t *symbol = entity->base.symbol;
4569 if (symbol == NULL) {
4570 errorf(HERE, "anonymous declaration not valid as function parameter");
4574 assert(entity->base.namespc == NAMESPACE_NORMAL);
4575 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4576 if (previous_entity == NULL
4577 || previous_entity->base.parent_scope != current_scope) {
4578 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4583 if (is_definition) {
4584 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4587 return record_entity(entity, false);
4590 static void parse_declaration(parsed_declaration_func finished_declaration,
4591 declarator_flags_t flags)
4593 declaration_specifiers_t specifiers;
4594 memset(&specifiers, 0, sizeof(specifiers));
4596 add_anchor_token(';');
4597 parse_declaration_specifiers(&specifiers);
4598 rem_anchor_token(';');
4600 if (token.type == ';') {
4601 parse_anonymous_declaration_rest(&specifiers);
4603 entity_t *entity = parse_declarator(&specifiers, flags);
4604 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4609 static type_t *get_default_promoted_type(type_t *orig_type)
4611 type_t *result = orig_type;
4613 type_t *type = skip_typeref(orig_type);
4614 if (is_type_integer(type)) {
4615 result = promote_integer(type);
4616 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4617 result = type_double;
4623 static void parse_kr_declaration_list(entity_t *entity)
4625 if (entity->kind != ENTITY_FUNCTION)
4628 type_t *type = skip_typeref(entity->declaration.type);
4629 assert(is_type_function(type));
4630 if (!type->function.kr_style_parameters)
4633 add_anchor_token('{');
4635 /* push function parameters */
4636 size_t const top = environment_top();
4637 scope_t *old_scope = scope_push(&entity->function.parameters);
4639 entity_t *parameter = entity->function.parameters.entities;
4640 for ( ; parameter != NULL; parameter = parameter->base.next) {
4641 assert(parameter->base.parent_scope == NULL);
4642 parameter->base.parent_scope = current_scope;
4643 environment_push(parameter);
4646 /* parse declaration list */
4648 switch (token.type) {
4650 case T___extension__:
4651 /* This covers symbols, which are no type, too, and results in
4652 * better error messages. The typical cases are misspelled type
4653 * names and missing includes. */
4655 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4663 /* pop function parameters */
4664 assert(current_scope == &entity->function.parameters);
4665 scope_pop(old_scope);
4666 environment_pop_to(top);
4668 /* update function type */
4669 type_t *new_type = duplicate_type(type);
4671 function_parameter_t *parameters = NULL;
4672 function_parameter_t **anchor = ¶meters;
4674 /* did we have an earlier prototype? */
4675 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4676 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4679 function_parameter_t *proto_parameter = NULL;
4680 if (proto_type != NULL) {
4681 type_t *proto_type_type = proto_type->declaration.type;
4682 proto_parameter = proto_type_type->function.parameters;
4683 /* If a K&R function definition has a variadic prototype earlier, then
4684 * make the function definition variadic, too. This should conform to
4685 * §6.7.5.3:15 and §6.9.1:8. */
4686 new_type->function.variadic = proto_type_type->function.variadic;
4688 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4690 new_type->function.unspecified_parameters = true;
4693 bool need_incompatible_warning = false;
4694 parameter = entity->function.parameters.entities;
4695 for (; parameter != NULL; parameter = parameter->base.next,
4697 proto_parameter == NULL ? NULL : proto_parameter->next) {
4698 if (parameter->kind != ENTITY_PARAMETER)
4701 type_t *parameter_type = parameter->declaration.type;
4702 if (parameter_type == NULL) {
4704 errorf(HERE, "no type specified for function parameter '%Y'",
4705 parameter->base.symbol);
4706 parameter_type = type_error_type;
4708 if (warning.implicit_int) {
4709 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4710 parameter->base.symbol);
4712 parameter_type = type_int;
4714 parameter->declaration.type = parameter_type;
4717 semantic_parameter_incomplete(parameter);
4719 /* we need the default promoted types for the function type */
4720 type_t *not_promoted = parameter_type;
4721 parameter_type = get_default_promoted_type(parameter_type);
4723 /* gcc special: if the type of the prototype matches the unpromoted
4724 * type don't promote */
4725 if (!strict_mode && proto_parameter != NULL) {
4726 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4727 type_t *promo_skip = skip_typeref(parameter_type);
4728 type_t *param_skip = skip_typeref(not_promoted);
4729 if (!types_compatible(proto_p_type, promo_skip)
4730 && types_compatible(proto_p_type, param_skip)) {
4732 need_incompatible_warning = true;
4733 parameter_type = not_promoted;
4736 function_parameter_t *const parameter
4737 = allocate_parameter(parameter_type);
4739 *anchor = parameter;
4740 anchor = ¶meter->next;
4743 new_type->function.parameters = parameters;
4744 new_type = identify_new_type(new_type);
4746 if (warning.other && need_incompatible_warning) {
4747 type_t *proto_type_type = proto_type->declaration.type;
4749 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4750 proto_type_type, proto_type->base.symbol,
4751 new_type, entity->base.symbol,
4752 &proto_type->base.source_position);
4755 entity->declaration.type = new_type;
4757 rem_anchor_token('{');
4760 static bool first_err = true;
4763 * When called with first_err set, prints the name of the current function,
4766 static void print_in_function(void)
4770 diagnosticf("%s: In function '%Y':\n",
4771 current_function->base.base.source_position.input_name,
4772 current_function->base.base.symbol);
4777 * Check if all labels are defined in the current function.
4778 * Check if all labels are used in the current function.
4780 static void check_labels(void)
4782 for (const goto_statement_t *goto_statement = goto_first;
4783 goto_statement != NULL;
4784 goto_statement = goto_statement->next) {
4785 /* skip computed gotos */
4786 if (goto_statement->expression != NULL)
4789 label_t *label = goto_statement->label;
4792 if (label->base.source_position.input_name == NULL) {
4793 print_in_function();
4794 errorf(&goto_statement->base.source_position,
4795 "label '%Y' used but not defined", label->base.symbol);
4799 if (warning.unused_label) {
4800 for (const label_statement_t *label_statement = label_first;
4801 label_statement != NULL;
4802 label_statement = label_statement->next) {
4803 label_t *label = label_statement->label;
4805 if (! label->used) {
4806 print_in_function();
4807 warningf(&label_statement->base.source_position,
4808 "label '%Y' defined but not used", label->base.symbol);
4814 static void warn_unused_entity(entity_t *entity, entity_t *last)
4816 entity_t const *const end = last != NULL ? last->base.next : NULL;
4817 for (; entity != end; entity = entity->base.next) {
4818 if (!is_declaration(entity))
4821 declaration_t *declaration = &entity->declaration;
4822 if (declaration->implicit)
4825 if (!declaration->used) {
4826 print_in_function();
4827 const char *what = get_entity_kind_name(entity->kind);
4828 warningf(&entity->base.source_position, "%s '%Y' is unused",
4829 what, entity->base.symbol);
4830 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4831 print_in_function();
4832 const char *what = get_entity_kind_name(entity->kind);
4833 warningf(&entity->base.source_position, "%s '%Y' is never read",
4834 what, entity->base.symbol);
4839 static void check_unused_variables(statement_t *const stmt, void *const env)
4843 switch (stmt->kind) {
4844 case STATEMENT_DECLARATION: {
4845 declaration_statement_t const *const decls = &stmt->declaration;
4846 warn_unused_entity(decls->declarations_begin,
4847 decls->declarations_end);
4852 warn_unused_entity(stmt->fors.scope.entities, NULL);
4861 * Check declarations of current_function for unused entities.
4863 static void check_declarations(void)
4865 if (warning.unused_parameter) {
4866 const scope_t *scope = ¤t_function->parameters;
4868 /* do not issue unused warnings for main */
4869 if (!is_sym_main(current_function->base.base.symbol)) {
4870 warn_unused_entity(scope->entities, NULL);
4873 if (warning.unused_variable) {
4874 walk_statements(current_function->statement, check_unused_variables,
4879 static int determine_truth(expression_t const* const cond)
4882 !is_constant_expression(cond) ? 0 :
4883 fold_constant_to_bool(cond) ? 1 :
4887 static void check_reachable(statement_t *);
4888 static bool reaches_end;
4890 static bool expression_returns(expression_t const *const expr)
4892 switch (expr->kind) {
4894 expression_t const *const func = expr->call.function;
4895 if (func->kind == EXPR_REFERENCE) {
4896 entity_t *entity = func->reference.entity;
4897 if (entity->kind == ENTITY_FUNCTION
4898 && entity->declaration.modifiers & DM_NORETURN)
4902 if (!expression_returns(func))
4905 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4906 if (!expression_returns(arg->expression))
4913 case EXPR_REFERENCE:
4914 case EXPR_REFERENCE_ENUM_VALUE:
4916 case EXPR_STRING_LITERAL:
4917 case EXPR_WIDE_STRING_LITERAL:
4918 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4919 case EXPR_LABEL_ADDRESS:
4920 case EXPR_CLASSIFY_TYPE:
4921 case EXPR_SIZEOF: // TODO handle obscure VLA case
4924 case EXPR_BUILTIN_CONSTANT_P:
4925 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4930 case EXPR_STATEMENT: {
4931 bool old_reaches_end = reaches_end;
4932 reaches_end = false;
4933 check_reachable(expr->statement.statement);
4934 bool returns = reaches_end;
4935 reaches_end = old_reaches_end;
4939 case EXPR_CONDITIONAL:
4940 // TODO handle constant expression
4942 if (!expression_returns(expr->conditional.condition))
4945 if (expr->conditional.true_expression != NULL
4946 && expression_returns(expr->conditional.true_expression))
4949 return expression_returns(expr->conditional.false_expression);
4952 return expression_returns(expr->select.compound);
4954 case EXPR_ARRAY_ACCESS:
4956 expression_returns(expr->array_access.array_ref) &&
4957 expression_returns(expr->array_access.index);
4960 return expression_returns(expr->va_starte.ap);
4963 return expression_returns(expr->va_arge.ap);
4966 return expression_returns(expr->va_copye.src);
4968 EXPR_UNARY_CASES_MANDATORY
4969 return expression_returns(expr->unary.value);
4971 case EXPR_UNARY_THROW:
4975 // TODO handle constant lhs of && and ||
4977 expression_returns(expr->binary.left) &&
4978 expression_returns(expr->binary.right);
4984 panic("unhandled expression");
4987 static bool initializer_returns(initializer_t const *const init)
4989 switch (init->kind) {
4990 case INITIALIZER_VALUE:
4991 return expression_returns(init->value.value);
4993 case INITIALIZER_LIST: {
4994 initializer_t * const* i = init->list.initializers;
4995 initializer_t * const* const end = i + init->list.len;
4996 bool returns = true;
4997 for (; i != end; ++i) {
4998 if (!initializer_returns(*i))
5004 case INITIALIZER_STRING:
5005 case INITIALIZER_WIDE_STRING:
5006 case INITIALIZER_DESIGNATOR: // designators have no payload
5009 panic("unhandled initializer");
5012 static bool noreturn_candidate;
5014 static void check_reachable(statement_t *const stmt)
5016 if (stmt->base.reachable)
5018 if (stmt->kind != STATEMENT_DO_WHILE)
5019 stmt->base.reachable = true;
5021 statement_t *last = stmt;
5023 switch (stmt->kind) {
5024 case STATEMENT_INVALID:
5025 case STATEMENT_EMPTY:
5027 next = stmt->base.next;
5030 case STATEMENT_DECLARATION: {
5031 declaration_statement_t const *const decl = &stmt->declaration;
5032 entity_t const * ent = decl->declarations_begin;
5033 entity_t const *const last = decl->declarations_end;
5035 for (;; ent = ent->base.next) {
5036 if (ent->kind == ENTITY_VARIABLE &&
5037 ent->variable.initializer != NULL &&
5038 !initializer_returns(ent->variable.initializer)) {
5045 next = stmt->base.next;
5049 case STATEMENT_COMPOUND:
5050 next = stmt->compound.statements;
5052 next = stmt->base.next;
5055 case STATEMENT_RETURN: {
5056 expression_t const *const val = stmt->returns.value;
5057 if (val == NULL || expression_returns(val))
5058 noreturn_candidate = false;
5062 case STATEMENT_IF: {
5063 if_statement_t const *const ifs = &stmt->ifs;
5064 expression_t const *const cond = ifs->condition;
5066 if (!expression_returns(cond))
5069 int const val = determine_truth(cond);
5072 check_reachable(ifs->true_statement);
5077 if (ifs->false_statement != NULL) {
5078 check_reachable(ifs->false_statement);
5082 next = stmt->base.next;
5086 case STATEMENT_SWITCH: {
5087 switch_statement_t const *const switchs = &stmt->switchs;
5088 expression_t const *const expr = switchs->expression;
5090 if (!expression_returns(expr))
5093 if (is_constant_expression(expr)) {
5094 long const val = fold_constant_to_int(expr);
5095 case_label_statement_t * defaults = NULL;
5096 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5097 if (i->expression == NULL) {
5102 if (i->first_case <= val && val <= i->last_case) {
5103 check_reachable((statement_t*)i);
5108 if (defaults != NULL) {
5109 check_reachable((statement_t*)defaults);
5113 bool has_default = false;
5114 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5115 if (i->expression == NULL)
5118 check_reachable((statement_t*)i);
5125 next = stmt->base.next;
5129 case STATEMENT_EXPRESSION: {
5130 /* Check for noreturn function call */
5131 expression_t const *const expr = stmt->expression.expression;
5132 if (!expression_returns(expr))
5135 next = stmt->base.next;
5139 case STATEMENT_CONTINUE:
5140 for (statement_t *parent = stmt;;) {
5141 parent = parent->base.parent;
5142 if (parent == NULL) /* continue not within loop */
5146 switch (parent->kind) {
5147 case STATEMENT_WHILE: goto continue_while;
5148 case STATEMENT_DO_WHILE: goto continue_do_while;
5149 case STATEMENT_FOR: goto continue_for;
5155 case STATEMENT_BREAK:
5156 for (statement_t *parent = stmt;;) {
5157 parent = parent->base.parent;
5158 if (parent == NULL) /* break not within loop/switch */
5161 switch (parent->kind) {
5162 case STATEMENT_SWITCH:
5163 case STATEMENT_WHILE:
5164 case STATEMENT_DO_WHILE:
5167 next = parent->base.next;
5168 goto found_break_parent;
5176 case STATEMENT_GOTO:
5177 if (stmt->gotos.expression) {
5178 if (!expression_returns(stmt->gotos.expression))
5181 statement_t *parent = stmt->base.parent;
5182 if (parent == NULL) /* top level goto */
5186 next = stmt->gotos.label->statement;
5187 if (next == NULL) /* missing label */
5192 case STATEMENT_LABEL:
5193 next = stmt->label.statement;
5196 case STATEMENT_CASE_LABEL:
5197 next = stmt->case_label.statement;
5200 case STATEMENT_WHILE: {
5201 while_statement_t const *const whiles = &stmt->whiles;
5202 expression_t const *const cond = whiles->condition;
5204 if (!expression_returns(cond))
5207 int const val = determine_truth(cond);
5210 check_reachable(whiles->body);
5215 next = stmt->base.next;
5219 case STATEMENT_DO_WHILE:
5220 next = stmt->do_while.body;
5223 case STATEMENT_FOR: {
5224 for_statement_t *const fors = &stmt->fors;
5226 if (fors->condition_reachable)
5228 fors->condition_reachable = true;
5230 expression_t const *const cond = fors->condition;
5235 } else if (expression_returns(cond)) {
5236 val = determine_truth(cond);
5242 check_reachable(fors->body);
5247 next = stmt->base.next;
5251 case STATEMENT_MS_TRY: {
5252 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5253 check_reachable(ms_try->try_statement);
5254 next = ms_try->final_statement;
5258 case STATEMENT_LEAVE: {
5259 statement_t *parent = stmt;
5261 parent = parent->base.parent;
5262 if (parent == NULL) /* __leave not within __try */
5265 if (parent->kind == STATEMENT_MS_TRY) {
5267 next = parent->ms_try.final_statement;
5275 panic("invalid statement kind");
5278 while (next == NULL) {
5279 next = last->base.parent;
5281 noreturn_candidate = false;
5283 type_t *const type = skip_typeref(current_function->base.type);
5284 assert(is_type_function(type));
5285 type_t *const ret = skip_typeref(type->function.return_type);
5286 if (warning.return_type &&
5287 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5288 is_type_valid(ret) &&
5289 !is_sym_main(current_function->base.base.symbol)) {
5290 warningf(&stmt->base.source_position,
5291 "control reaches end of non-void function");
5296 switch (next->kind) {
5297 case STATEMENT_INVALID:
5298 case STATEMENT_EMPTY:
5299 case STATEMENT_DECLARATION:
5300 case STATEMENT_EXPRESSION:
5302 case STATEMENT_RETURN:
5303 case STATEMENT_CONTINUE:
5304 case STATEMENT_BREAK:
5305 case STATEMENT_GOTO:
5306 case STATEMENT_LEAVE:
5307 panic("invalid control flow in function");
5309 case STATEMENT_COMPOUND:
5310 if (next->compound.stmt_expr) {
5316 case STATEMENT_SWITCH:
5317 case STATEMENT_LABEL:
5318 case STATEMENT_CASE_LABEL:
5320 next = next->base.next;
5323 case STATEMENT_WHILE: {
5325 if (next->base.reachable)
5327 next->base.reachable = true;
5329 while_statement_t const *const whiles = &next->whiles;
5330 expression_t const *const cond = whiles->condition;
5332 if (!expression_returns(cond))
5335 int const val = determine_truth(cond);
5338 check_reachable(whiles->body);
5344 next = next->base.next;
5348 case STATEMENT_DO_WHILE: {
5350 if (next->base.reachable)
5352 next->base.reachable = true;
5354 do_while_statement_t const *const dw = &next->do_while;
5355 expression_t const *const cond = dw->condition;
5357 if (!expression_returns(cond))
5360 int const val = determine_truth(cond);
5363 check_reachable(dw->body);
5369 next = next->base.next;
5373 case STATEMENT_FOR: {
5375 for_statement_t *const fors = &next->fors;
5377 fors->step_reachable = true;
5379 if (fors->condition_reachable)
5381 fors->condition_reachable = true;
5383 expression_t const *const cond = fors->condition;
5388 } else if (expression_returns(cond)) {
5389 val = determine_truth(cond);
5395 check_reachable(fors->body);
5401 next = next->base.next;
5405 case STATEMENT_MS_TRY:
5407 next = next->ms_try.final_statement;
5412 check_reachable(next);
5415 static void check_unreachable(statement_t* const stmt, void *const env)
5419 switch (stmt->kind) {
5420 case STATEMENT_DO_WHILE:
5421 if (!stmt->base.reachable) {
5422 expression_t const *const cond = stmt->do_while.condition;
5423 if (determine_truth(cond) >= 0) {
5424 warningf(&cond->base.source_position,
5425 "condition of do-while-loop is unreachable");
5430 case STATEMENT_FOR: {
5431 for_statement_t const* const fors = &stmt->fors;
5433 // if init and step are unreachable, cond is unreachable, too
5434 if (!stmt->base.reachable && !fors->step_reachable) {
5435 warningf(&stmt->base.source_position, "statement is unreachable");
5437 if (!stmt->base.reachable && fors->initialisation != NULL) {
5438 warningf(&fors->initialisation->base.source_position,
5439 "initialisation of for-statement is unreachable");
5442 if (!fors->condition_reachable && fors->condition != NULL) {
5443 warningf(&fors->condition->base.source_position,
5444 "condition of for-statement is unreachable");
5447 if (!fors->step_reachable && fors->step != NULL) {
5448 warningf(&fors->step->base.source_position,
5449 "step of for-statement is unreachable");
5455 case STATEMENT_COMPOUND:
5456 if (stmt->compound.statements != NULL)
5458 goto warn_unreachable;
5460 case STATEMENT_DECLARATION: {
5461 /* Only warn if there is at least one declarator with an initializer.
5462 * This typically occurs in switch statements. */
5463 declaration_statement_t const *const decl = &stmt->declaration;
5464 entity_t const * ent = decl->declarations_begin;
5465 entity_t const *const last = decl->declarations_end;
5467 for (;; ent = ent->base.next) {
5468 if (ent->kind == ENTITY_VARIABLE &&
5469 ent->variable.initializer != NULL) {
5470 goto warn_unreachable;
5480 if (!stmt->base.reachable)
5481 warningf(&stmt->base.source_position, "statement is unreachable");
5486 static void parse_external_declaration(void)
5488 /* function-definitions and declarations both start with declaration
5490 declaration_specifiers_t specifiers;
5491 memset(&specifiers, 0, sizeof(specifiers));
5493 add_anchor_token(';');
5494 parse_declaration_specifiers(&specifiers);
5495 rem_anchor_token(';');
5497 /* must be a declaration */
5498 if (token.type == ';') {
5499 parse_anonymous_declaration_rest(&specifiers);
5503 add_anchor_token(',');
5504 add_anchor_token('=');
5505 add_anchor_token(';');
5506 add_anchor_token('{');
5508 /* declarator is common to both function-definitions and declarations */
5509 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5511 rem_anchor_token('{');
5512 rem_anchor_token(';');
5513 rem_anchor_token('=');
5514 rem_anchor_token(',');
5516 /* must be a declaration */
5517 switch (token.type) {
5521 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5526 /* must be a function definition */
5527 parse_kr_declaration_list(ndeclaration);
5529 if (token.type != '{') {
5530 parse_error_expected("while parsing function definition", '{', NULL);
5531 eat_until_matching_token(';');
5535 assert(is_declaration(ndeclaration));
5536 type_t *const orig_type = ndeclaration->declaration.type;
5537 type_t * type = skip_typeref(orig_type);
5539 if (!is_type_function(type)) {
5540 if (is_type_valid(type)) {
5541 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5542 type, ndeclaration->base.symbol);
5546 } else if (is_typeref(orig_type)) {
5548 errorf(&ndeclaration->base.source_position,
5549 "type of function definition '%#T' is a typedef",
5550 orig_type, ndeclaration->base.symbol);
5553 if (warning.aggregate_return &&
5554 is_type_compound(skip_typeref(type->function.return_type))) {
5555 warningf(HERE, "function '%Y' returns an aggregate",
5556 ndeclaration->base.symbol);
5558 if (warning.traditional && !type->function.unspecified_parameters) {
5559 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5560 ndeclaration->base.symbol);
5562 if (warning.old_style_definition && type->function.unspecified_parameters) {
5563 warningf(HERE, "old-style function definition '%Y'",
5564 ndeclaration->base.symbol);
5567 /* §6.7.5.3:14 a function definition with () means no
5568 * parameters (and not unspecified parameters) */
5569 if (type->function.unspecified_parameters &&
5570 type->function.parameters == NULL) {
5571 type_t *copy = duplicate_type(type);
5572 copy->function.unspecified_parameters = false;
5573 type = identify_new_type(copy);
5575 ndeclaration->declaration.type = type;
5578 entity_t *const entity = record_entity(ndeclaration, true);
5579 assert(entity->kind == ENTITY_FUNCTION);
5580 assert(ndeclaration->kind == ENTITY_FUNCTION);
5582 function_t *function = &entity->function;
5583 if (ndeclaration != entity) {
5584 function->parameters = ndeclaration->function.parameters;
5586 assert(is_declaration(entity));
5587 type = skip_typeref(entity->declaration.type);
5589 /* push function parameters and switch scope */
5590 size_t const top = environment_top();
5591 scope_t *old_scope = scope_push(&function->parameters);
5593 entity_t *parameter = function->parameters.entities;
5594 for (; parameter != NULL; parameter = parameter->base.next) {
5595 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5596 parameter->base.parent_scope = current_scope;
5598 assert(parameter->base.parent_scope == NULL
5599 || parameter->base.parent_scope == current_scope);
5600 parameter->base.parent_scope = current_scope;
5601 if (parameter->base.symbol == NULL) {
5602 errorf(¶meter->base.source_position, "parameter name omitted");
5605 environment_push(parameter);
5608 if (function->statement != NULL) {
5609 parser_error_multiple_definition(entity, HERE);
5612 /* parse function body */
5613 int label_stack_top = label_top();
5614 function_t *old_current_function = current_function;
5615 entity_t *old_current_entity = current_entity;
5616 current_function = function;
5617 current_entity = (entity_t*) function;
5618 current_parent = NULL;
5621 goto_anchor = &goto_first;
5623 label_anchor = &label_first;
5625 statement_t *const body = parse_compound_statement(false);
5626 function->statement = body;
5629 check_declarations();
5630 if (warning.return_type ||
5631 warning.unreachable_code ||
5632 (warning.missing_noreturn
5633 && !(function->base.modifiers & DM_NORETURN))) {
5634 noreturn_candidate = true;
5635 check_reachable(body);
5636 if (warning.unreachable_code)
5637 walk_statements(body, check_unreachable, NULL);
5638 if (warning.missing_noreturn &&
5639 noreturn_candidate &&
5640 !(function->base.modifiers & DM_NORETURN)) {
5641 warningf(&body->base.source_position,
5642 "function '%#T' is candidate for attribute 'noreturn'",
5643 type, entity->base.symbol);
5647 assert(current_parent == NULL);
5648 assert(current_function == function);
5649 assert(current_entity == (entity_t*) function);
5650 current_entity = old_current_entity;
5651 current_function = old_current_function;
5652 label_pop_to(label_stack_top);
5655 assert(current_scope == &function->parameters);
5656 scope_pop(old_scope);
5657 environment_pop_to(top);
5660 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5661 source_position_t *source_position,
5662 const symbol_t *symbol)
5664 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5666 type->bitfield.base_type = base_type;
5667 type->bitfield.size_expression = size;
5670 type_t *skipped_type = skip_typeref(base_type);
5671 if (!is_type_integer(skipped_type)) {
5672 errorf(HERE, "bitfield base type '%T' is not an integer type",
5676 bit_size = get_type_size(base_type) * 8;
5679 if (is_constant_expression(size)) {
5680 long v = fold_constant_to_int(size);
5681 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5684 errorf(source_position, "negative width in bit-field '%Y'",
5686 } else if (v == 0 && symbol != NULL) {
5687 errorf(source_position, "zero width for bit-field '%Y'",
5689 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5690 errorf(source_position, "width of '%Y' exceeds its type",
5693 type->bitfield.bit_size = v;
5700 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5702 entity_t *iter = compound->members.entities;
5703 for (; iter != NULL; iter = iter->base.next) {
5704 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5707 if (iter->base.symbol == symbol) {
5709 } else if (iter->base.symbol == NULL) {
5710 /* search in anonymous structs and unions */
5711 type_t *type = skip_typeref(iter->declaration.type);
5712 if (is_type_compound(type)) {
5713 if (find_compound_entry(type->compound.compound, symbol)
5724 static void check_deprecated(const source_position_t *source_position,
5725 const entity_t *entity)
5727 if (!warning.deprecated_declarations)
5729 if (!is_declaration(entity))
5731 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5734 char const *const prefix = get_entity_kind_name(entity->kind);
5735 const char *deprecated_string
5736 = get_deprecated_string(entity->declaration.attributes);
5737 if (deprecated_string != NULL) {
5738 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5739 prefix, entity->base.symbol, &entity->base.source_position,
5742 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5743 entity->base.symbol, &entity->base.source_position);
5748 static expression_t *create_select(const source_position_t *pos,
5750 type_qualifiers_t qualifiers,
5753 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5755 check_deprecated(pos, entry);
5757 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5758 select->select.compound = addr;
5759 select->select.compound_entry = entry;
5761 type_t *entry_type = entry->declaration.type;
5762 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5764 /* we always do the auto-type conversions; the & and sizeof parser contains
5765 * code to revert this! */
5766 select->base.type = automatic_type_conversion(res_type);
5767 if (res_type->kind == TYPE_BITFIELD) {
5768 select->base.type = res_type->bitfield.base_type;
5775 * Find entry with symbol in compound. Search anonymous structs and unions and
5776 * creates implicit select expressions for them.
5777 * Returns the adress for the innermost compound.
5779 static expression_t *find_create_select(const source_position_t *pos,
5781 type_qualifiers_t qualifiers,
5782 compound_t *compound, symbol_t *symbol)
5784 entity_t *iter = compound->members.entities;
5785 for (; iter != NULL; iter = iter->base.next) {
5786 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5789 symbol_t *iter_symbol = iter->base.symbol;
5790 if (iter_symbol == NULL) {
5791 type_t *type = iter->declaration.type;
5792 if (type->kind != TYPE_COMPOUND_STRUCT
5793 && type->kind != TYPE_COMPOUND_UNION)
5796 compound_t *sub_compound = type->compound.compound;
5798 if (find_compound_entry(sub_compound, symbol) == NULL)
5801 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5802 sub_addr->base.source_position = *pos;
5803 sub_addr->select.implicit = true;
5804 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5808 if (iter_symbol == symbol) {
5809 return create_select(pos, addr, qualifiers, iter);
5816 static void parse_compound_declarators(compound_t *compound,
5817 const declaration_specifiers_t *specifiers)
5822 if (token.type == ':') {
5823 source_position_t source_position = *HERE;
5826 type_t *base_type = specifiers->type;
5827 expression_t *size = parse_constant_expression();
5829 type_t *type = make_bitfield_type(base_type, size,
5830 &source_position, NULL);
5832 attribute_t *attributes = parse_attributes(NULL);
5833 attribute_t **anchor = &attributes;
5834 while (*anchor != NULL)
5835 anchor = &(*anchor)->next;
5836 *anchor = specifiers->attributes;
5838 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5839 entity->base.namespc = NAMESPACE_NORMAL;
5840 entity->base.source_position = source_position;
5841 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5842 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5843 entity->declaration.type = type;
5844 entity->declaration.attributes = attributes;
5846 if (attributes != NULL) {
5847 handle_entity_attributes(attributes, entity);
5849 append_entity(&compound->members, entity);
5851 entity = parse_declarator(specifiers,
5852 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5853 if (entity->kind == ENTITY_TYPEDEF) {
5854 errorf(&entity->base.source_position,
5855 "typedef not allowed as compound member");
5857 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5859 /* make sure we don't define a symbol multiple times */
5860 symbol_t *symbol = entity->base.symbol;
5861 if (symbol != NULL) {
5862 entity_t *prev = find_compound_entry(compound, symbol);
5864 errorf(&entity->base.source_position,
5865 "multiple declarations of symbol '%Y' (declared %P)",
5866 symbol, &prev->base.source_position);
5870 if (token.type == ':') {
5871 source_position_t source_position = *HERE;
5873 expression_t *size = parse_constant_expression();
5875 type_t *type = entity->declaration.type;
5876 type_t *bitfield_type = make_bitfield_type(type, size,
5877 &source_position, entity->base.symbol);
5879 attribute_t *attributes = parse_attributes(NULL);
5880 entity->declaration.type = bitfield_type;
5881 handle_entity_attributes(attributes, entity);
5883 type_t *orig_type = entity->declaration.type;
5884 type_t *type = skip_typeref(orig_type);
5885 if (is_type_function(type)) {
5886 errorf(&entity->base.source_position,
5887 "compound member '%Y' must not have function type '%T'",
5888 entity->base.symbol, orig_type);
5889 } else if (is_type_incomplete(type)) {
5890 /* §6.7.2.1:16 flexible array member */
5891 if (!is_type_array(type) ||
5892 token.type != ';' ||
5893 look_ahead(1)->type != '}') {
5894 errorf(&entity->base.source_position,
5895 "compound member '%Y' has incomplete type '%T'",
5896 entity->base.symbol, orig_type);
5901 append_entity(&compound->members, entity);
5904 } while (next_if(','));
5905 expect(';', end_error);
5908 anonymous_entity = NULL;
5911 static void parse_compound_type_entries(compound_t *compound)
5914 add_anchor_token('}');
5916 while (token.type != '}') {
5917 if (token.type == T_EOF) {
5918 errorf(HERE, "EOF while parsing struct");
5921 declaration_specifiers_t specifiers;
5922 memset(&specifiers, 0, sizeof(specifiers));
5923 parse_declaration_specifiers(&specifiers);
5925 parse_compound_declarators(compound, &specifiers);
5927 rem_anchor_token('}');
5931 compound->complete = true;
5934 static type_t *parse_typename(void)
5936 declaration_specifiers_t specifiers;
5937 memset(&specifiers, 0, sizeof(specifiers));
5938 parse_declaration_specifiers(&specifiers);
5939 if (specifiers.storage_class != STORAGE_CLASS_NONE
5940 || specifiers.thread_local) {
5941 /* TODO: improve error message, user does probably not know what a
5942 * storage class is...
5944 errorf(HERE, "typename may not have a storage class");
5947 type_t *result = parse_abstract_declarator(specifiers.type);
5955 typedef expression_t* (*parse_expression_function)(void);
5956 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5958 typedef struct expression_parser_function_t expression_parser_function_t;
5959 struct expression_parser_function_t {
5960 parse_expression_function parser;
5961 precedence_t infix_precedence;
5962 parse_expression_infix_function infix_parser;
5965 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5968 * Prints an error message if an expression was expected but not read
5970 static expression_t *expected_expression_error(void)
5972 /* skip the error message if the error token was read */
5973 if (token.type != T_ERROR) {
5974 errorf(HERE, "expected expression, got token %K", &token);
5978 return create_invalid_expression();
5981 static type_t *get_string_type(void)
5983 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
5986 static type_t *get_wide_string_type(void)
5988 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5992 * Parse a string constant.
5994 static expression_t *parse_string_literal(void)
5996 source_position_t begin = token.source_position;
5997 string_t res = token.literal;
5998 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
6001 while (token.type == T_STRING_LITERAL
6002 || token.type == T_WIDE_STRING_LITERAL) {
6003 warn_string_concat(&token.source_position);
6004 res = concat_strings(&res, &token.literal);
6006 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6009 expression_t *literal;
6011 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6012 literal->base.type = get_wide_string_type();
6014 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6015 literal->base.type = get_string_type();
6017 literal->base.source_position = begin;
6018 literal->literal.value = res;
6024 * Parse a boolean constant.
6026 static expression_t *parse_boolean_literal(bool value)
6028 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6029 literal->base.source_position = token.source_position;
6030 literal->base.type = type_bool;
6031 literal->literal.value.begin = value ? "true" : "false";
6032 literal->literal.value.size = value ? 4 : 5;
6038 static void warn_traditional_suffix(void)
6040 if (!warning.traditional)
6042 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6046 static void check_integer_suffix(void)
6048 symbol_t *suffix = token.symbol;
6052 bool not_traditional = false;
6053 const char *c = suffix->string;
6054 if (*c == 'l' || *c == 'L') {
6057 not_traditional = true;
6059 if (*c == 'u' || *c == 'U') {
6062 } else if (*c == 'u' || *c == 'U') {
6063 not_traditional = true;
6066 } else if (*c == 'u' || *c == 'U') {
6067 not_traditional = true;
6069 if (*c == 'l' || *c == 'L') {
6077 errorf(&token.source_position,
6078 "invalid suffix '%s' on integer constant", suffix->string);
6079 } else if (not_traditional) {
6080 warn_traditional_suffix();
6084 static type_t *check_floatingpoint_suffix(void)
6086 symbol_t *suffix = token.symbol;
6087 type_t *type = type_double;
6091 bool not_traditional = false;
6092 const char *c = suffix->string;
6093 if (*c == 'f' || *c == 'F') {
6096 } else if (*c == 'l' || *c == 'L') {
6098 type = type_long_double;
6101 errorf(&token.source_position,
6102 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6103 } else if (not_traditional) {
6104 warn_traditional_suffix();
6111 * Parse an integer constant.
6113 static expression_t *parse_number_literal(void)
6115 expression_kind_t kind;
6118 switch (token.type) {
6120 kind = EXPR_LITERAL_INTEGER;
6121 check_integer_suffix();
6123 case T_INTEGER_OCTAL:
6124 kind = EXPR_LITERAL_INTEGER_OCTAL;
6125 check_integer_suffix();
6127 case T_INTEGER_HEXADECIMAL:
6128 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6129 check_integer_suffix();
6131 case T_FLOATINGPOINT:
6132 kind = EXPR_LITERAL_FLOATINGPOINT;
6133 type = check_floatingpoint_suffix();
6135 case T_FLOATINGPOINT_HEXADECIMAL:
6136 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6137 type = check_floatingpoint_suffix();
6140 panic("unexpected token type in parse_number_literal");
6143 expression_t *literal = allocate_expression_zero(kind);
6144 literal->base.source_position = token.source_position;
6145 literal->base.type = type;
6146 literal->literal.value = token.literal;
6147 literal->literal.suffix = token.symbol;
6150 /* integer type depends on the size of the number and the size
6151 * representable by the types. The backend/codegeneration has to determine
6154 determine_literal_type(&literal->literal);
6159 * Parse a character constant.
6161 static expression_t *parse_character_constant(void)
6163 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6164 literal->base.source_position = token.source_position;
6165 literal->base.type = c_mode & _CXX ? type_char : type_int;
6166 literal->literal.value = token.literal;
6168 size_t len = literal->literal.value.size;
6170 if (!GNU_MODE && !(c_mode & _C99)) {
6171 errorf(HERE, "more than 1 character in character constant");
6172 } else if (warning.multichar) {
6173 literal->base.type = type_int;
6174 warningf(HERE, "multi-character character constant");
6183 * Parse a wide character constant.
6185 static expression_t *parse_wide_character_constant(void)
6187 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6188 literal->base.source_position = token.source_position;
6189 literal->base.type = type_int;
6190 literal->literal.value = token.literal;
6192 size_t len = wstrlen(&literal->literal.value);
6194 warningf(HERE, "multi-character character constant");
6201 static entity_t *create_implicit_function(symbol_t *symbol,
6202 const source_position_t *source_position)
6204 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6205 ntype->function.return_type = type_int;
6206 ntype->function.unspecified_parameters = true;
6207 ntype->function.linkage = LINKAGE_C;
6208 type_t *type = identify_new_type(ntype);
6210 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6211 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6212 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6213 entity->declaration.type = type;
6214 entity->declaration.implicit = true;
6215 entity->base.symbol = symbol;
6216 entity->base.source_position = *source_position;
6218 if (current_scope != NULL) {
6219 bool strict_prototypes_old = warning.strict_prototypes;
6220 warning.strict_prototypes = false;
6221 record_entity(entity, false);
6222 warning.strict_prototypes = strict_prototypes_old;
6229 * Performs automatic type cast as described in §6.3.2.1.
6231 * @param orig_type the original type
6233 static type_t *automatic_type_conversion(type_t *orig_type)
6235 type_t *type = skip_typeref(orig_type);
6236 if (is_type_array(type)) {
6237 array_type_t *array_type = &type->array;
6238 type_t *element_type = array_type->element_type;
6239 unsigned qualifiers = array_type->base.qualifiers;
6241 return make_pointer_type(element_type, qualifiers);
6244 if (is_type_function(type)) {
6245 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6252 * reverts the automatic casts of array to pointer types and function
6253 * to function-pointer types as defined §6.3.2.1
6255 type_t *revert_automatic_type_conversion(const expression_t *expression)
6257 switch (expression->kind) {
6258 case EXPR_REFERENCE: {
6259 entity_t *entity = expression->reference.entity;
6260 if (is_declaration(entity)) {
6261 return entity->declaration.type;
6262 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6263 return entity->enum_value.enum_type;
6265 panic("no declaration or enum in reference");
6270 entity_t *entity = expression->select.compound_entry;
6271 assert(is_declaration(entity));
6272 type_t *type = entity->declaration.type;
6273 return get_qualified_type(type,
6274 expression->base.type->base.qualifiers);
6277 case EXPR_UNARY_DEREFERENCE: {
6278 const expression_t *const value = expression->unary.value;
6279 type_t *const type = skip_typeref(value->base.type);
6280 if (!is_type_pointer(type))
6281 return type_error_type;
6282 return type->pointer.points_to;
6285 case EXPR_ARRAY_ACCESS: {
6286 const expression_t *array_ref = expression->array_access.array_ref;
6287 type_t *type_left = skip_typeref(array_ref->base.type);
6288 if (!is_type_pointer(type_left))
6289 return type_error_type;
6290 return type_left->pointer.points_to;
6293 case EXPR_STRING_LITERAL: {
6294 size_t size = expression->string_literal.value.size;
6295 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6298 case EXPR_WIDE_STRING_LITERAL: {
6299 size_t size = wstrlen(&expression->string_literal.value);
6300 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6303 case EXPR_COMPOUND_LITERAL:
6304 return expression->compound_literal.type;
6309 return expression->base.type;
6313 * Find an entity matching a symbol in a scope.
6314 * Uses current scope if scope is NULL
6316 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6317 namespace_tag_t namespc)
6319 if (scope == NULL) {
6320 return get_entity(symbol, namespc);
6323 /* we should optimize here, if scope grows above a certain size we should
6324 construct a hashmap here... */
6325 entity_t *entity = scope->entities;
6326 for ( ; entity != NULL; entity = entity->base.next) {
6327 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6334 static entity_t *parse_qualified_identifier(void)
6336 /* namespace containing the symbol */
6338 source_position_t pos;
6339 const scope_t *lookup_scope = NULL;
6341 if (next_if(T_COLONCOLON))
6342 lookup_scope = &unit->scope;
6346 if (token.type != T_IDENTIFIER) {
6347 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6348 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6350 symbol = token.symbol;
6355 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6357 if (!next_if(T_COLONCOLON))
6360 switch (entity->kind) {
6361 case ENTITY_NAMESPACE:
6362 lookup_scope = &entity->namespacee.members;
6367 lookup_scope = &entity->compound.members;
6370 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6371 symbol, get_entity_kind_name(entity->kind));
6376 if (entity == NULL) {
6377 if (!strict_mode && token.type == '(') {
6378 /* an implicitly declared function */
6379 if (warning.error_implicit_function_declaration) {
6380 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6381 } else if (warning.implicit_function_declaration) {
6382 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6385 entity = create_implicit_function(symbol, &pos);
6387 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6388 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6395 /* skip further qualifications */
6396 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6398 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6401 static expression_t *parse_reference(void)
6403 entity_t *entity = parse_qualified_identifier();
6406 if (is_declaration(entity)) {
6407 orig_type = entity->declaration.type;
6408 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6409 orig_type = entity->enum_value.enum_type;
6411 panic("expected declaration or enum value in reference");
6414 /* we always do the auto-type conversions; the & and sizeof parser contains
6415 * code to revert this! */
6416 type_t *type = automatic_type_conversion(orig_type);
6418 expression_kind_t kind = EXPR_REFERENCE;
6419 if (entity->kind == ENTITY_ENUM_VALUE)
6420 kind = EXPR_REFERENCE_ENUM_VALUE;
6422 expression_t *expression = allocate_expression_zero(kind);
6423 expression->reference.entity = entity;
6424 expression->base.type = type;
6426 /* this declaration is used */
6427 if (is_declaration(entity)) {
6428 entity->declaration.used = true;
6431 if (entity->base.parent_scope != file_scope
6432 && (current_function != NULL
6433 && entity->base.parent_scope->depth < current_function->parameters.depth)
6434 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6435 if (entity->kind == ENTITY_VARIABLE) {
6436 /* access of a variable from an outer function */
6437 entity->variable.address_taken = true;
6438 } else if (entity->kind == ENTITY_PARAMETER) {
6439 entity->parameter.address_taken = true;
6441 current_function->need_closure = true;
6444 check_deprecated(HERE, entity);
6446 if (warning.init_self && entity == current_init_decl && !in_type_prop
6447 && entity->kind == ENTITY_VARIABLE) {
6448 current_init_decl = NULL;
6449 warningf(HERE, "variable '%#T' is initialized by itself",
6450 entity->declaration.type, entity->base.symbol);
6456 static bool semantic_cast(expression_t *cast)
6458 expression_t *expression = cast->unary.value;
6459 type_t *orig_dest_type = cast->base.type;
6460 type_t *orig_type_right = expression->base.type;
6461 type_t const *dst_type = skip_typeref(orig_dest_type);
6462 type_t const *src_type = skip_typeref(orig_type_right);
6463 source_position_t const *pos = &cast->base.source_position;
6465 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6466 if (dst_type == type_void)
6469 /* only integer and pointer can be casted to pointer */
6470 if (is_type_pointer(dst_type) &&
6471 !is_type_pointer(src_type) &&
6472 !is_type_integer(src_type) &&
6473 is_type_valid(src_type)) {
6474 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6478 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6479 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6483 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6484 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6488 if (warning.cast_qual &&
6489 is_type_pointer(src_type) &&
6490 is_type_pointer(dst_type)) {
6491 type_t *src = skip_typeref(src_type->pointer.points_to);
6492 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6493 unsigned missing_qualifiers =
6494 src->base.qualifiers & ~dst->base.qualifiers;
6495 if (missing_qualifiers != 0) {
6497 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6498 missing_qualifiers, orig_type_right);
6504 static expression_t *parse_compound_literal(type_t *type)
6506 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6508 parse_initializer_env_t env;
6511 env.must_be_constant = false;
6512 initializer_t *initializer = parse_initializer(&env);
6515 expression->compound_literal.initializer = initializer;
6516 expression->compound_literal.type = type;
6517 expression->base.type = automatic_type_conversion(type);
6523 * Parse a cast expression.
6525 static expression_t *parse_cast(void)
6527 add_anchor_token(')');
6529 source_position_t source_position = token.source_position;
6531 type_t *type = parse_typename();
6533 rem_anchor_token(')');
6534 expect(')', end_error);
6536 if (token.type == '{') {
6537 return parse_compound_literal(type);
6540 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6541 cast->base.source_position = source_position;
6543 expression_t *value = parse_sub_expression(PREC_CAST);
6544 cast->base.type = type;
6545 cast->unary.value = value;
6547 if (! semantic_cast(cast)) {
6548 /* TODO: record the error in the AST. else it is impossible to detect it */
6553 return create_invalid_expression();
6557 * Parse a statement expression.
6559 static expression_t *parse_statement_expression(void)
6561 add_anchor_token(')');
6563 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6565 statement_t *statement = parse_compound_statement(true);
6566 statement->compound.stmt_expr = true;
6567 expression->statement.statement = statement;
6569 /* find last statement and use its type */
6570 type_t *type = type_void;
6571 const statement_t *stmt = statement->compound.statements;
6573 while (stmt->base.next != NULL)
6574 stmt = stmt->base.next;
6576 if (stmt->kind == STATEMENT_EXPRESSION) {
6577 type = stmt->expression.expression->base.type;
6579 } else if (warning.other) {
6580 warningf(&expression->base.source_position, "empty statement expression ({})");
6582 expression->base.type = type;
6584 rem_anchor_token(')');
6585 expect(')', end_error);
6592 * Parse a parenthesized expression.
6594 static expression_t *parse_parenthesized_expression(void)
6598 switch (token.type) {
6600 /* gcc extension: a statement expression */
6601 return parse_statement_expression();
6605 return parse_cast();
6607 if (is_typedef_symbol(token.symbol)) {
6608 return parse_cast();
6612 add_anchor_token(')');
6613 expression_t *result = parse_expression();
6614 result->base.parenthesized = true;
6615 rem_anchor_token(')');
6616 expect(')', end_error);
6622 static expression_t *parse_function_keyword(void)
6626 if (current_function == NULL) {
6627 errorf(HERE, "'__func__' used outside of a function");
6630 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6631 expression->base.type = type_char_ptr;
6632 expression->funcname.kind = FUNCNAME_FUNCTION;
6639 static expression_t *parse_pretty_function_keyword(void)
6641 if (current_function == NULL) {
6642 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6645 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6646 expression->base.type = type_char_ptr;
6647 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6649 eat(T___PRETTY_FUNCTION__);
6654 static expression_t *parse_funcsig_keyword(void)
6656 if (current_function == NULL) {
6657 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6660 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6661 expression->base.type = type_char_ptr;
6662 expression->funcname.kind = FUNCNAME_FUNCSIG;
6669 static expression_t *parse_funcdname_keyword(void)
6671 if (current_function == NULL) {
6672 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6675 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6676 expression->base.type = type_char_ptr;
6677 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6679 eat(T___FUNCDNAME__);
6684 static designator_t *parse_designator(void)
6686 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6687 result->source_position = *HERE;
6689 if (token.type != T_IDENTIFIER) {
6690 parse_error_expected("while parsing member designator",
6691 T_IDENTIFIER, NULL);
6694 result->symbol = token.symbol;
6697 designator_t *last_designator = result;
6700 if (token.type != T_IDENTIFIER) {
6701 parse_error_expected("while parsing member designator",
6702 T_IDENTIFIER, NULL);
6705 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6706 designator->source_position = *HERE;
6707 designator->symbol = token.symbol;
6710 last_designator->next = designator;
6711 last_designator = designator;
6715 add_anchor_token(']');
6716 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6717 designator->source_position = *HERE;
6718 designator->array_index = parse_expression();
6719 rem_anchor_token(']');
6720 expect(']', end_error);
6721 if (designator->array_index == NULL) {
6725 last_designator->next = designator;
6726 last_designator = designator;
6738 * Parse the __builtin_offsetof() expression.
6740 static expression_t *parse_offsetof(void)
6742 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6743 expression->base.type = type_size_t;
6745 eat(T___builtin_offsetof);
6747 expect('(', end_error);
6748 add_anchor_token(',');
6749 type_t *type = parse_typename();
6750 rem_anchor_token(',');
6751 expect(',', end_error);
6752 add_anchor_token(')');
6753 designator_t *designator = parse_designator();
6754 rem_anchor_token(')');
6755 expect(')', end_error);
6757 expression->offsetofe.type = type;
6758 expression->offsetofe.designator = designator;
6761 memset(&path, 0, sizeof(path));
6762 path.top_type = type;
6763 path.path = NEW_ARR_F(type_path_entry_t, 0);
6765 descend_into_subtype(&path);
6767 if (!walk_designator(&path, designator, true)) {
6768 return create_invalid_expression();
6771 DEL_ARR_F(path.path);
6775 return create_invalid_expression();
6779 * Parses a _builtin_va_start() expression.
6781 static expression_t *parse_va_start(void)
6783 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6785 eat(T___builtin_va_start);
6787 expect('(', end_error);
6788 add_anchor_token(',');
6789 expression->va_starte.ap = parse_assignment_expression();
6790 rem_anchor_token(',');
6791 expect(',', end_error);
6792 expression_t *const expr = parse_assignment_expression();
6793 if (expr->kind == EXPR_REFERENCE) {
6794 entity_t *const entity = expr->reference.entity;
6795 if (!current_function->base.type->function.variadic) {
6796 errorf(&expr->base.source_position,
6797 "'va_start' used in non-variadic function");
6798 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6799 entity->base.next != NULL ||
6800 entity->kind != ENTITY_PARAMETER) {
6801 errorf(&expr->base.source_position,
6802 "second argument of 'va_start' must be last parameter of the current function");
6804 expression->va_starte.parameter = &entity->variable;
6806 expect(')', end_error);
6809 expect(')', end_error);
6811 return create_invalid_expression();
6815 * Parses a __builtin_va_arg() expression.
6817 static expression_t *parse_va_arg(void)
6819 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6821 eat(T___builtin_va_arg);
6823 expect('(', end_error);
6825 ap.expression = parse_assignment_expression();
6826 expression->va_arge.ap = ap.expression;
6827 check_call_argument(type_valist, &ap, 1);
6829 expect(',', end_error);
6830 expression->base.type = parse_typename();
6831 expect(')', end_error);
6835 return create_invalid_expression();
6839 * Parses a __builtin_va_copy() expression.
6841 static expression_t *parse_va_copy(void)
6843 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6845 eat(T___builtin_va_copy);
6847 expect('(', end_error);
6848 expression_t *dst = parse_assignment_expression();
6849 assign_error_t error = semantic_assign(type_valist, dst);
6850 report_assign_error(error, type_valist, dst, "call argument 1",
6851 &dst->base.source_position);
6852 expression->va_copye.dst = dst;
6854 expect(',', end_error);
6856 call_argument_t src;
6857 src.expression = parse_assignment_expression();
6858 check_call_argument(type_valist, &src, 2);
6859 expression->va_copye.src = src.expression;
6860 expect(')', end_error);
6864 return create_invalid_expression();
6868 * Parses a __builtin_constant_p() expression.
6870 static expression_t *parse_builtin_constant(void)
6872 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6874 eat(T___builtin_constant_p);
6876 expect('(', end_error);
6877 add_anchor_token(')');
6878 expression->builtin_constant.value = parse_assignment_expression();
6879 rem_anchor_token(')');
6880 expect(')', end_error);
6881 expression->base.type = type_int;
6885 return create_invalid_expression();
6889 * Parses a __builtin_types_compatible_p() expression.
6891 static expression_t *parse_builtin_types_compatible(void)
6893 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6895 eat(T___builtin_types_compatible_p);
6897 expect('(', end_error);
6898 add_anchor_token(')');
6899 add_anchor_token(',');
6900 expression->builtin_types_compatible.left = parse_typename();
6901 rem_anchor_token(',');
6902 expect(',', end_error);
6903 expression->builtin_types_compatible.right = parse_typename();
6904 rem_anchor_token(')');
6905 expect(')', end_error);
6906 expression->base.type = type_int;
6910 return create_invalid_expression();
6914 * Parses a __builtin_is_*() compare expression.
6916 static expression_t *parse_compare_builtin(void)
6918 expression_t *expression;
6920 switch (token.type) {
6921 case T___builtin_isgreater:
6922 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6924 case T___builtin_isgreaterequal:
6925 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6927 case T___builtin_isless:
6928 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6930 case T___builtin_islessequal:
6931 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6933 case T___builtin_islessgreater:
6934 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6936 case T___builtin_isunordered:
6937 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6940 internal_errorf(HERE, "invalid compare builtin found");
6942 expression->base.source_position = *HERE;
6945 expect('(', end_error);
6946 expression->binary.left = parse_assignment_expression();
6947 expect(',', end_error);
6948 expression->binary.right = parse_assignment_expression();
6949 expect(')', end_error);
6951 type_t *const orig_type_left = expression->binary.left->base.type;
6952 type_t *const orig_type_right = expression->binary.right->base.type;
6954 type_t *const type_left = skip_typeref(orig_type_left);
6955 type_t *const type_right = skip_typeref(orig_type_right);
6956 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6957 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6958 type_error_incompatible("invalid operands in comparison",
6959 &expression->base.source_position, orig_type_left, orig_type_right);
6962 semantic_comparison(&expression->binary);
6967 return create_invalid_expression();
6971 * Parses a MS assume() expression.
6973 static expression_t *parse_assume(void)
6975 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6979 expect('(', end_error);
6980 add_anchor_token(')');
6981 expression->unary.value = parse_assignment_expression();
6982 rem_anchor_token(')');
6983 expect(')', end_error);
6985 expression->base.type = type_void;
6988 return create_invalid_expression();
6992 * Return the declaration for a given label symbol or create a new one.
6994 * @param symbol the symbol of the label
6996 static label_t *get_label(symbol_t *symbol)
6999 assert(current_function != NULL);
7001 label = get_entity(symbol, NAMESPACE_LABEL);
7002 /* if we found a local label, we already created the declaration */
7003 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7004 if (label->base.parent_scope != current_scope) {
7005 assert(label->base.parent_scope->depth < current_scope->depth);
7006 current_function->goto_to_outer = true;
7008 return &label->label;
7011 label = get_entity(symbol, NAMESPACE_LABEL);
7012 /* if we found a label in the same function, then we already created the
7015 && label->base.parent_scope == ¤t_function->parameters) {
7016 return &label->label;
7019 /* otherwise we need to create a new one */
7020 label = allocate_entity_zero(ENTITY_LABEL);
7021 label->base.namespc = NAMESPACE_LABEL;
7022 label->base.symbol = symbol;
7026 return &label->label;
7030 * Parses a GNU && label address expression.
7032 static expression_t *parse_label_address(void)
7034 source_position_t source_position = token.source_position;
7036 if (token.type != T_IDENTIFIER) {
7037 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7040 symbol_t *symbol = token.symbol;
7043 label_t *label = get_label(symbol);
7045 label->address_taken = true;
7047 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7048 expression->base.source_position = source_position;
7050 /* label address is threaten as a void pointer */
7051 expression->base.type = type_void_ptr;
7052 expression->label_address.label = label;
7055 return create_invalid_expression();
7059 * Parse a microsoft __noop expression.
7061 static expression_t *parse_noop_expression(void)
7063 /* the result is a (int)0 */
7064 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7065 literal->base.type = type_int;
7066 literal->base.source_position = token.source_position;
7067 literal->literal.value.begin = "__noop";
7068 literal->literal.value.size = 6;
7072 if (token.type == '(') {
7073 /* parse arguments */
7075 add_anchor_token(')');
7076 add_anchor_token(',');
7078 if (token.type != ')') do {
7079 (void)parse_assignment_expression();
7080 } while (next_if(','));
7082 rem_anchor_token(',');
7083 rem_anchor_token(')');
7084 expect(')', end_error);
7091 * Parses a primary expression.
7093 static expression_t *parse_primary_expression(void)
7095 switch (token.type) {
7096 case T_false: return parse_boolean_literal(false);
7097 case T_true: return parse_boolean_literal(true);
7099 case T_INTEGER_OCTAL:
7100 case T_INTEGER_HEXADECIMAL:
7101 case T_FLOATINGPOINT:
7102 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7103 case T_CHARACTER_CONSTANT: return parse_character_constant();
7104 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7105 case T_STRING_LITERAL:
7106 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7107 case T___FUNCTION__:
7108 case T___func__: return parse_function_keyword();
7109 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7110 case T___FUNCSIG__: return parse_funcsig_keyword();
7111 case T___FUNCDNAME__: return parse_funcdname_keyword();
7112 case T___builtin_offsetof: return parse_offsetof();
7113 case T___builtin_va_start: return parse_va_start();
7114 case T___builtin_va_arg: return parse_va_arg();
7115 case T___builtin_va_copy: return parse_va_copy();
7116 case T___builtin_isgreater:
7117 case T___builtin_isgreaterequal:
7118 case T___builtin_isless:
7119 case T___builtin_islessequal:
7120 case T___builtin_islessgreater:
7121 case T___builtin_isunordered: return parse_compare_builtin();
7122 case T___builtin_constant_p: return parse_builtin_constant();
7123 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7124 case T__assume: return parse_assume();
7127 return parse_label_address();
7130 case '(': return parse_parenthesized_expression();
7131 case T___noop: return parse_noop_expression();
7133 /* Gracefully handle type names while parsing expressions. */
7135 return parse_reference();
7137 if (!is_typedef_symbol(token.symbol)) {
7138 return parse_reference();
7142 source_position_t const pos = *HERE;
7143 type_t const *const type = parse_typename();
7144 errorf(&pos, "encountered type '%T' while parsing expression", type);
7145 return create_invalid_expression();
7149 errorf(HERE, "unexpected token %K, expected an expression", &token);
7150 return create_invalid_expression();
7154 * Check if the expression has the character type and issue a warning then.
7156 static void check_for_char_index_type(const expression_t *expression)
7158 type_t *const type = expression->base.type;
7159 const type_t *const base_type = skip_typeref(type);
7161 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7162 warning.char_subscripts) {
7163 warningf(&expression->base.source_position,
7164 "array subscript has type '%T'", type);
7168 static expression_t *parse_array_expression(expression_t *left)
7170 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7173 add_anchor_token(']');
7175 expression_t *inside = parse_expression();
7177 type_t *const orig_type_left = left->base.type;
7178 type_t *const orig_type_inside = inside->base.type;
7180 type_t *const type_left = skip_typeref(orig_type_left);
7181 type_t *const type_inside = skip_typeref(orig_type_inside);
7183 type_t *return_type;
7184 array_access_expression_t *array_access = &expression->array_access;
7185 if (is_type_pointer(type_left)) {
7186 return_type = type_left->pointer.points_to;
7187 array_access->array_ref = left;
7188 array_access->index = inside;
7189 check_for_char_index_type(inside);
7190 } else if (is_type_pointer(type_inside)) {
7191 return_type = type_inside->pointer.points_to;
7192 array_access->array_ref = inside;
7193 array_access->index = left;
7194 array_access->flipped = true;
7195 check_for_char_index_type(left);
7197 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7199 "array access on object with non-pointer types '%T', '%T'",
7200 orig_type_left, orig_type_inside);
7202 return_type = type_error_type;
7203 array_access->array_ref = left;
7204 array_access->index = inside;
7207 expression->base.type = automatic_type_conversion(return_type);
7209 rem_anchor_token(']');
7210 expect(']', end_error);
7215 static expression_t *parse_typeprop(expression_kind_t const kind)
7217 expression_t *tp_expression = allocate_expression_zero(kind);
7218 tp_expression->base.type = type_size_t;
7220 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7222 /* we only refer to a type property, mark this case */
7223 bool old = in_type_prop;
7224 in_type_prop = true;
7227 expression_t *expression;
7228 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7230 add_anchor_token(')');
7231 orig_type = parse_typename();
7232 rem_anchor_token(')');
7233 expect(')', end_error);
7235 if (token.type == '{') {
7236 /* It was not sizeof(type) after all. It is sizeof of an expression
7237 * starting with a compound literal */
7238 expression = parse_compound_literal(orig_type);
7239 goto typeprop_expression;
7242 expression = parse_sub_expression(PREC_UNARY);
7244 typeprop_expression:
7245 tp_expression->typeprop.tp_expression = expression;
7247 orig_type = revert_automatic_type_conversion(expression);
7248 expression->base.type = orig_type;
7251 tp_expression->typeprop.type = orig_type;
7252 type_t const* const type = skip_typeref(orig_type);
7253 char const* const wrong_type =
7254 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7255 is_type_incomplete(type) ? "incomplete" :
7256 type->kind == TYPE_FUNCTION ? "function designator" :
7257 type->kind == TYPE_BITFIELD ? "bitfield" :
7259 if (wrong_type != NULL) {
7260 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7261 errorf(&tp_expression->base.source_position,
7262 "operand of %s expression must not be of %s type '%T'",
7263 what, wrong_type, orig_type);
7268 return tp_expression;
7271 static expression_t *parse_sizeof(void)
7273 return parse_typeprop(EXPR_SIZEOF);
7276 static expression_t *parse_alignof(void)
7278 return parse_typeprop(EXPR_ALIGNOF);
7281 static expression_t *parse_select_expression(expression_t *addr)
7283 assert(token.type == '.' || token.type == T_MINUSGREATER);
7284 bool select_left_arrow = (token.type == T_MINUSGREATER);
7287 if (token.type != T_IDENTIFIER) {
7288 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7289 return create_invalid_expression();
7291 symbol_t *symbol = token.symbol;
7294 type_t *const orig_type = addr->base.type;
7295 type_t *const type = skip_typeref(orig_type);
7298 bool saw_error = false;
7299 if (is_type_pointer(type)) {
7300 if (!select_left_arrow) {
7302 "request for member '%Y' in something not a struct or union, but '%T'",
7306 type_left = skip_typeref(type->pointer.points_to);
7308 if (select_left_arrow && is_type_valid(type)) {
7309 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7315 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7316 type_left->kind != TYPE_COMPOUND_UNION) {
7318 if (is_type_valid(type_left) && !saw_error) {
7320 "request for member '%Y' in something not a struct or union, but '%T'",
7323 return create_invalid_expression();
7326 compound_t *compound = type_left->compound.compound;
7327 if (!compound->complete) {
7328 errorf(HERE, "request for member '%Y' in incomplete type '%T'",
7330 return create_invalid_expression();
7333 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7334 expression_t *result
7335 = find_create_select(HERE, addr, qualifiers, compound, symbol);
7337 if (result == NULL) {
7338 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7339 return create_invalid_expression();
7345 static void check_call_argument(type_t *expected_type,
7346 call_argument_t *argument, unsigned pos)
7348 type_t *expected_type_skip = skip_typeref(expected_type);
7349 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7350 expression_t *arg_expr = argument->expression;
7351 type_t *arg_type = skip_typeref(arg_expr->base.type);
7353 /* handle transparent union gnu extension */
7354 if (is_type_union(expected_type_skip)
7355 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7356 compound_t *union_decl = expected_type_skip->compound.compound;
7357 type_t *best_type = NULL;
7358 entity_t *entry = union_decl->members.entities;
7359 for ( ; entry != NULL; entry = entry->base.next) {
7360 assert(is_declaration(entry));
7361 type_t *decl_type = entry->declaration.type;
7362 error = semantic_assign(decl_type, arg_expr);
7363 if (error == ASSIGN_ERROR_INCOMPATIBLE
7364 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7367 if (error == ASSIGN_SUCCESS) {
7368 best_type = decl_type;
7369 } else if (best_type == NULL) {
7370 best_type = decl_type;
7374 if (best_type != NULL) {
7375 expected_type = best_type;
7379 error = semantic_assign(expected_type, arg_expr);
7380 argument->expression = create_implicit_cast(arg_expr, expected_type);
7382 if (error != ASSIGN_SUCCESS) {
7383 /* report exact scope in error messages (like "in argument 3") */
7385 snprintf(buf, sizeof(buf), "call argument %u", pos);
7386 report_assign_error(error, expected_type, arg_expr, buf,
7387 &arg_expr->base.source_position);
7388 } else if (warning.traditional || warning.conversion) {
7389 type_t *const promoted_type = get_default_promoted_type(arg_type);
7390 if (!types_compatible(expected_type_skip, promoted_type) &&
7391 !types_compatible(expected_type_skip, type_void_ptr) &&
7392 !types_compatible(type_void_ptr, promoted_type)) {
7393 /* Deliberately show the skipped types in this warning */
7394 warningf(&arg_expr->base.source_position,
7395 "passing call argument %u as '%T' rather than '%T' due to prototype",
7396 pos, expected_type_skip, promoted_type);
7402 * Handle the semantic restrictions of builtin calls
7404 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7405 switch (call->function->reference.entity->function.btk) {
7406 case bk_gnu_builtin_return_address:
7407 case bk_gnu_builtin_frame_address: {
7408 /* argument must be constant */
7409 call_argument_t *argument = call->arguments;
7411 if (! is_constant_expression(argument->expression)) {
7412 errorf(&call->base.source_position,
7413 "argument of '%Y' must be a constant expression",
7414 call->function->reference.entity->base.symbol);
7418 case bk_gnu_builtin_prefetch: {
7419 /* second and third argument must be constant if existent */
7420 call_argument_t *rw = call->arguments->next;
7421 call_argument_t *locality = NULL;
7424 if (! is_constant_expression(rw->expression)) {
7425 errorf(&call->base.source_position,
7426 "second argument of '%Y' must be a constant expression",
7427 call->function->reference.entity->base.symbol);
7429 locality = rw->next;
7431 if (locality != NULL) {
7432 if (! is_constant_expression(locality->expression)) {
7433 errorf(&call->base.source_position,
7434 "third argument of '%Y' must be a constant expression",
7435 call->function->reference.entity->base.symbol);
7437 locality = rw->next;
7447 * Parse a call expression, ie. expression '( ... )'.
7449 * @param expression the function address
7451 static expression_t *parse_call_expression(expression_t *expression)
7453 expression_t *result = allocate_expression_zero(EXPR_CALL);
7454 call_expression_t *call = &result->call;
7455 call->function = expression;
7457 type_t *const orig_type = expression->base.type;
7458 type_t *const type = skip_typeref(orig_type);
7460 function_type_t *function_type = NULL;
7461 if (is_type_pointer(type)) {
7462 type_t *const to_type = skip_typeref(type->pointer.points_to);
7464 if (is_type_function(to_type)) {
7465 function_type = &to_type->function;
7466 call->base.type = function_type->return_type;
7470 if (function_type == NULL && is_type_valid(type)) {
7472 "called object '%E' (type '%T') is not a pointer to a function",
7473 expression, orig_type);
7476 /* parse arguments */
7478 add_anchor_token(')');
7479 add_anchor_token(',');
7481 if (token.type != ')') {
7482 call_argument_t **anchor = &call->arguments;
7484 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7485 argument->expression = parse_assignment_expression();
7488 anchor = &argument->next;
7489 } while (next_if(','));
7491 rem_anchor_token(',');
7492 rem_anchor_token(')');
7493 expect(')', end_error);
7495 if (function_type == NULL)
7498 /* check type and count of call arguments */
7499 function_parameter_t *parameter = function_type->parameters;
7500 call_argument_t *argument = call->arguments;
7501 if (!function_type->unspecified_parameters) {
7502 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7503 parameter = parameter->next, argument = argument->next) {
7504 check_call_argument(parameter->type, argument, ++pos);
7507 if (parameter != NULL) {
7508 errorf(HERE, "too few arguments to function '%E'", expression);
7509 } else if (argument != NULL && !function_type->variadic) {
7510 errorf(HERE, "too many arguments to function '%E'", expression);
7514 /* do default promotion for other arguments */
7515 for (; argument != NULL; argument = argument->next) {
7516 type_t *type = argument->expression->base.type;
7518 type = get_default_promoted_type(type);
7520 argument->expression
7521 = create_implicit_cast(argument->expression, type);
7524 check_format(&result->call);
7526 if (warning.aggregate_return &&
7527 is_type_compound(skip_typeref(function_type->return_type))) {
7528 warningf(&result->base.source_position,
7529 "function call has aggregate value");
7532 if (call->function->kind == EXPR_REFERENCE) {
7533 reference_expression_t *reference = &call->function->reference;
7534 if (reference->entity->kind == ENTITY_FUNCTION &&
7535 reference->entity->function.btk != bk_none)
7536 handle_builtin_argument_restrictions(call);
7543 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7545 static bool same_compound_type(const type_t *type1, const type_t *type2)
7548 is_type_compound(type1) &&
7549 type1->kind == type2->kind &&
7550 type1->compound.compound == type2->compound.compound;
7553 static expression_t const *get_reference_address(expression_t const *expr)
7555 bool regular_take_address = true;
7557 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7558 expr = expr->unary.value;
7560 regular_take_address = false;
7563 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7566 expr = expr->unary.value;
7569 if (expr->kind != EXPR_REFERENCE)
7572 /* special case for functions which are automatically converted to a
7573 * pointer to function without an extra TAKE_ADDRESS operation */
7574 if (!regular_take_address &&
7575 expr->reference.entity->kind != ENTITY_FUNCTION) {
7582 static void warn_reference_address_as_bool(expression_t const* expr)
7584 if (!warning.address)
7587 expr = get_reference_address(expr);
7589 warningf(&expr->base.source_position,
7590 "the address of '%Y' will always evaluate as 'true'",
7591 expr->reference.entity->base.symbol);
7595 static void warn_assignment_in_condition(const expression_t *const expr)
7597 if (!warning.parentheses)
7599 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7601 if (expr->base.parenthesized)
7603 warningf(&expr->base.source_position,
7604 "suggest parentheses around assignment used as truth value");
7607 static void semantic_condition(expression_t const *const expr,
7608 char const *const context)
7610 type_t *const type = skip_typeref(expr->base.type);
7611 if (is_type_scalar(type)) {
7612 warn_reference_address_as_bool(expr);
7613 warn_assignment_in_condition(expr);
7614 } else if (is_type_valid(type)) {
7615 errorf(&expr->base.source_position,
7616 "%s must have scalar type", context);
7621 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7623 * @param expression the conditional expression
7625 static expression_t *parse_conditional_expression(expression_t *expression)
7627 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7629 conditional_expression_t *conditional = &result->conditional;
7630 conditional->condition = expression;
7633 add_anchor_token(':');
7635 /* §6.5.15:2 The first operand shall have scalar type. */
7636 semantic_condition(expression, "condition of conditional operator");
7638 expression_t *true_expression = expression;
7639 bool gnu_cond = false;
7640 if (GNU_MODE && token.type == ':') {
7643 true_expression = parse_expression();
7645 rem_anchor_token(':');
7646 expect(':', end_error);
7648 expression_t *false_expression =
7649 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7651 type_t *const orig_true_type = true_expression->base.type;
7652 type_t *const orig_false_type = false_expression->base.type;
7653 type_t *const true_type = skip_typeref(orig_true_type);
7654 type_t *const false_type = skip_typeref(orig_false_type);
7657 type_t *result_type;
7658 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7659 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7660 /* ISO/IEC 14882:1998(E) §5.16:2 */
7661 if (true_expression->kind == EXPR_UNARY_THROW) {
7662 result_type = false_type;
7663 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7664 result_type = true_type;
7666 if (warning.other && (
7667 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7668 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7670 warningf(&conditional->base.source_position,
7671 "ISO C forbids conditional expression with only one void side");
7673 result_type = type_void;
7675 } else if (is_type_arithmetic(true_type)
7676 && is_type_arithmetic(false_type)) {
7677 result_type = semantic_arithmetic(true_type, false_type);
7679 true_expression = create_implicit_cast(true_expression, result_type);
7680 false_expression = create_implicit_cast(false_expression, result_type);
7682 conditional->true_expression = true_expression;
7683 conditional->false_expression = false_expression;
7684 conditional->base.type = result_type;
7685 } else if (same_compound_type(true_type, false_type)) {
7686 /* just take 1 of the 2 types */
7687 result_type = true_type;
7688 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7689 type_t *pointer_type;
7691 expression_t *other_expression;
7692 if (is_type_pointer(true_type) &&
7693 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7694 pointer_type = true_type;
7695 other_type = false_type;
7696 other_expression = false_expression;
7698 pointer_type = false_type;
7699 other_type = true_type;
7700 other_expression = true_expression;
7703 if (is_null_pointer_constant(other_expression)) {
7704 result_type = pointer_type;
7705 } else if (is_type_pointer(other_type)) {
7706 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7707 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7710 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7711 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7713 } else if (types_compatible(get_unqualified_type(to1),
7714 get_unqualified_type(to2))) {
7717 if (warning.other) {
7718 warningf(&conditional->base.source_position,
7719 "pointer types '%T' and '%T' in conditional expression are incompatible",
7720 true_type, false_type);
7725 type_t *const type =
7726 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7727 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7728 } else if (is_type_integer(other_type)) {
7729 if (warning.other) {
7730 warningf(&conditional->base.source_position,
7731 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7733 result_type = pointer_type;
7735 if (is_type_valid(other_type)) {
7736 type_error_incompatible("while parsing conditional",
7737 &expression->base.source_position, true_type, false_type);
7739 result_type = type_error_type;
7742 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7743 type_error_incompatible("while parsing conditional",
7744 &conditional->base.source_position, true_type,
7747 result_type = type_error_type;
7750 conditional->true_expression
7751 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7752 conditional->false_expression
7753 = create_implicit_cast(false_expression, result_type);
7754 conditional->base.type = result_type;
7759 * Parse an extension expression.
7761 static expression_t *parse_extension(void)
7763 eat(T___extension__);
7765 bool old_gcc_extension = in_gcc_extension;
7766 in_gcc_extension = true;
7767 expression_t *expression = parse_sub_expression(PREC_UNARY);
7768 in_gcc_extension = old_gcc_extension;
7773 * Parse a __builtin_classify_type() expression.
7775 static expression_t *parse_builtin_classify_type(void)
7777 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7778 result->base.type = type_int;
7780 eat(T___builtin_classify_type);
7782 expect('(', end_error);
7783 add_anchor_token(')');
7784 expression_t *expression = parse_expression();
7785 rem_anchor_token(')');
7786 expect(')', end_error);
7787 result->classify_type.type_expression = expression;
7791 return create_invalid_expression();
7795 * Parse a delete expression
7796 * ISO/IEC 14882:1998(E) §5.3.5
7798 static expression_t *parse_delete(void)
7800 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7801 result->base.type = type_void;
7806 result->kind = EXPR_UNARY_DELETE_ARRAY;
7807 expect(']', end_error);
7811 expression_t *const value = parse_sub_expression(PREC_CAST);
7812 result->unary.value = value;
7814 type_t *const type = skip_typeref(value->base.type);
7815 if (!is_type_pointer(type)) {
7816 if (is_type_valid(type)) {
7817 errorf(&value->base.source_position,
7818 "operand of delete must have pointer type");
7820 } else if (warning.other &&
7821 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7822 warningf(&value->base.source_position,
7823 "deleting 'void*' is undefined");
7830 * Parse a throw expression
7831 * ISO/IEC 14882:1998(E) §15:1
7833 static expression_t *parse_throw(void)
7835 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7836 result->base.type = type_void;
7840 expression_t *value = NULL;
7841 switch (token.type) {
7843 value = parse_assignment_expression();
7844 /* ISO/IEC 14882:1998(E) §15.1:3 */
7845 type_t *const orig_type = value->base.type;
7846 type_t *const type = skip_typeref(orig_type);
7847 if (is_type_incomplete(type)) {
7848 errorf(&value->base.source_position,
7849 "cannot throw object of incomplete type '%T'", orig_type);
7850 } else if (is_type_pointer(type)) {
7851 type_t *const points_to = skip_typeref(type->pointer.points_to);
7852 if (is_type_incomplete(points_to) &&
7853 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7854 errorf(&value->base.source_position,
7855 "cannot throw pointer to incomplete type '%T'", orig_type);
7863 result->unary.value = value;
7868 static bool check_pointer_arithmetic(const source_position_t *source_position,
7869 type_t *pointer_type,
7870 type_t *orig_pointer_type)
7872 type_t *points_to = pointer_type->pointer.points_to;
7873 points_to = skip_typeref(points_to);
7875 if (is_type_incomplete(points_to)) {
7876 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7877 errorf(source_position,
7878 "arithmetic with pointer to incomplete type '%T' not allowed",
7881 } else if (warning.pointer_arith) {
7882 warningf(source_position,
7883 "pointer of type '%T' used in arithmetic",
7886 } else if (is_type_function(points_to)) {
7888 errorf(source_position,
7889 "arithmetic with pointer to function type '%T' not allowed",
7892 } else if (warning.pointer_arith) {
7893 warningf(source_position,
7894 "pointer to a function '%T' used in arithmetic",
7901 static bool is_lvalue(const expression_t *expression)
7903 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7904 switch (expression->kind) {
7905 case EXPR_ARRAY_ACCESS:
7906 case EXPR_COMPOUND_LITERAL:
7907 case EXPR_REFERENCE:
7909 case EXPR_UNARY_DEREFERENCE:
7913 type_t *type = skip_typeref(expression->base.type);
7915 /* ISO/IEC 14882:1998(E) §3.10:3 */
7916 is_type_reference(type) ||
7917 /* Claim it is an lvalue, if the type is invalid. There was a parse
7918 * error before, which maybe prevented properly recognizing it as
7920 !is_type_valid(type);
7925 static void semantic_incdec(unary_expression_t *expression)
7927 type_t *const orig_type = expression->value->base.type;
7928 type_t *const type = skip_typeref(orig_type);
7929 if (is_type_pointer(type)) {
7930 if (!check_pointer_arithmetic(&expression->base.source_position,
7934 } else if (!is_type_real(type) && is_type_valid(type)) {
7935 /* TODO: improve error message */
7936 errorf(&expression->base.source_position,
7937 "operation needs an arithmetic or pointer type");
7940 if (!is_lvalue(expression->value)) {
7941 /* TODO: improve error message */
7942 errorf(&expression->base.source_position, "lvalue required as operand");
7944 expression->base.type = orig_type;
7947 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7949 type_t *const orig_type = expression->value->base.type;
7950 type_t *const type = skip_typeref(orig_type);
7951 if (!is_type_arithmetic(type)) {
7952 if (is_type_valid(type)) {
7953 /* TODO: improve error message */
7954 errorf(&expression->base.source_position,
7955 "operation needs an arithmetic type");
7960 expression->base.type = orig_type;
7963 static void semantic_unexpr_plus(unary_expression_t *expression)
7965 semantic_unexpr_arithmetic(expression);
7966 if (warning.traditional)
7967 warningf(&expression->base.source_position,
7968 "traditional C rejects the unary plus operator");
7971 static void semantic_not(unary_expression_t *expression)
7973 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7974 semantic_condition(expression->value, "operand of !");
7975 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7978 static void semantic_unexpr_integer(unary_expression_t *expression)
7980 type_t *const orig_type = expression->value->base.type;
7981 type_t *const type = skip_typeref(orig_type);
7982 if (!is_type_integer(type)) {
7983 if (is_type_valid(type)) {
7984 errorf(&expression->base.source_position,
7985 "operand of ~ must be of integer type");
7990 expression->base.type = orig_type;
7993 static void semantic_dereference(unary_expression_t *expression)
7995 type_t *const orig_type = expression->value->base.type;
7996 type_t *const type = skip_typeref(orig_type);
7997 if (!is_type_pointer(type)) {
7998 if (is_type_valid(type)) {
7999 errorf(&expression->base.source_position,
8000 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8005 type_t *result_type = type->pointer.points_to;
8006 result_type = automatic_type_conversion(result_type);
8007 expression->base.type = result_type;
8011 * Record that an address is taken (expression represents an lvalue).
8013 * @param expression the expression
8014 * @param may_be_register if true, the expression might be an register
8016 static void set_address_taken(expression_t *expression, bool may_be_register)
8018 if (expression->kind != EXPR_REFERENCE)
8021 entity_t *const entity = expression->reference.entity;
8023 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8026 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8027 && !may_be_register) {
8028 errorf(&expression->base.source_position,
8029 "address of register %s '%Y' requested",
8030 get_entity_kind_name(entity->kind), entity->base.symbol);
8033 if (entity->kind == ENTITY_VARIABLE) {
8034 entity->variable.address_taken = true;
8036 assert(entity->kind == ENTITY_PARAMETER);
8037 entity->parameter.address_taken = true;
8042 * Check the semantic of the address taken expression.
8044 static void semantic_take_addr(unary_expression_t *expression)
8046 expression_t *value = expression->value;
8047 value->base.type = revert_automatic_type_conversion(value);
8049 type_t *orig_type = value->base.type;
8050 type_t *type = skip_typeref(orig_type);
8051 if (!is_type_valid(type))
8055 if (!is_lvalue(value)) {
8056 errorf(&expression->base.source_position, "'&' requires an lvalue");
8058 if (type->kind == TYPE_BITFIELD) {
8059 errorf(&expression->base.source_position,
8060 "'&' not allowed on object with bitfield type '%T'",
8064 set_address_taken(value, false);
8066 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8069 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8070 static expression_t *parse_##unexpression_type(void) \
8072 expression_t *unary_expression \
8073 = allocate_expression_zero(unexpression_type); \
8075 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8077 sfunc(&unary_expression->unary); \
8079 return unary_expression; \
8082 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8083 semantic_unexpr_arithmetic)
8084 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8085 semantic_unexpr_plus)
8086 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8088 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8089 semantic_dereference)
8090 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8092 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8093 semantic_unexpr_integer)
8094 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8096 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8099 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8101 static expression_t *parse_##unexpression_type(expression_t *left) \
8103 expression_t *unary_expression \
8104 = allocate_expression_zero(unexpression_type); \
8106 unary_expression->unary.value = left; \
8108 sfunc(&unary_expression->unary); \
8110 return unary_expression; \
8113 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8114 EXPR_UNARY_POSTFIX_INCREMENT,
8116 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8117 EXPR_UNARY_POSTFIX_DECREMENT,
8120 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8122 /* TODO: handle complex + imaginary types */
8124 type_left = get_unqualified_type(type_left);
8125 type_right = get_unqualified_type(type_right);
8127 /* §6.3.1.8 Usual arithmetic conversions */
8128 if (type_left == type_long_double || type_right == type_long_double) {
8129 return type_long_double;
8130 } else if (type_left == type_double || type_right == type_double) {
8132 } else if (type_left == type_float || type_right == type_float) {
8136 type_left = promote_integer(type_left);
8137 type_right = promote_integer(type_right);
8139 if (type_left == type_right)
8142 bool const signed_left = is_type_signed(type_left);
8143 bool const signed_right = is_type_signed(type_right);
8144 int const rank_left = get_rank(type_left);
8145 int const rank_right = get_rank(type_right);
8147 if (signed_left == signed_right)
8148 return rank_left >= rank_right ? type_left : type_right;
8157 u_rank = rank_right;
8158 u_type = type_right;
8160 s_rank = rank_right;
8161 s_type = type_right;
8166 if (u_rank >= s_rank)
8169 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8171 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8172 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8176 case ATOMIC_TYPE_INT: return type_unsigned_int;
8177 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8178 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8180 default: panic("invalid atomic type");
8185 * Check the semantic restrictions for a binary expression.
8187 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8189 expression_t *const left = expression->left;
8190 expression_t *const right = expression->right;
8191 type_t *const orig_type_left = left->base.type;
8192 type_t *const orig_type_right = right->base.type;
8193 type_t *const type_left = skip_typeref(orig_type_left);
8194 type_t *const type_right = skip_typeref(orig_type_right);
8196 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8197 /* TODO: improve error message */
8198 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8199 errorf(&expression->base.source_position,
8200 "operation needs arithmetic types");
8205 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8206 expression->left = create_implicit_cast(left, arithmetic_type);
8207 expression->right = create_implicit_cast(right, arithmetic_type);
8208 expression->base.type = arithmetic_type;
8211 static void warn_div_by_zero(binary_expression_t const *const expression)
8213 if (!warning.div_by_zero ||
8214 !is_type_integer(expression->base.type))
8217 expression_t const *const right = expression->right;
8218 /* The type of the right operand can be different for /= */
8219 if (is_type_integer(right->base.type) &&
8220 is_constant_expression(right) &&
8221 !fold_constant_to_bool(right)) {
8222 warningf(&expression->base.source_position, "division by zero");
8227 * Check the semantic restrictions for a div/mod expression.
8229 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8231 semantic_binexpr_arithmetic(expression);
8232 warn_div_by_zero(expression);
8235 static void warn_addsub_in_shift(const expression_t *const expr)
8237 if (expr->base.parenthesized)
8241 switch (expr->kind) {
8242 case EXPR_BINARY_ADD: op = '+'; break;
8243 case EXPR_BINARY_SUB: op = '-'; break;
8247 warningf(&expr->base.source_position,
8248 "suggest parentheses around '%c' inside shift", op);
8251 static bool semantic_shift(binary_expression_t *expression)
8253 expression_t *const left = expression->left;
8254 expression_t *const right = expression->right;
8255 type_t *const orig_type_left = left->base.type;
8256 type_t *const orig_type_right = right->base.type;
8257 type_t * type_left = skip_typeref(orig_type_left);
8258 type_t * type_right = skip_typeref(orig_type_right);
8260 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8261 /* TODO: improve error message */
8262 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8263 errorf(&expression->base.source_position,
8264 "operands of shift operation must have integer types");
8269 type_left = promote_integer(type_left);
8271 if (is_constant_expression(right)) {
8272 long count = fold_constant_to_int(right);
8274 warningf(&right->base.source_position,
8275 "shift count must be non-negative");
8276 } else if ((unsigned long)count >=
8277 get_atomic_type_size(type_left->atomic.akind) * 8) {
8278 warningf(&right->base.source_position,
8279 "shift count must be less than type width");
8283 type_right = promote_integer(type_right);
8284 expression->right = create_implicit_cast(right, type_right);
8289 static void semantic_shift_op(binary_expression_t *expression)
8291 expression_t *const left = expression->left;
8292 expression_t *const right = expression->right;
8294 if (!semantic_shift(expression))
8297 if (warning.parentheses) {
8298 warn_addsub_in_shift(left);
8299 warn_addsub_in_shift(right);
8302 type_t *const orig_type_left = left->base.type;
8303 type_t * type_left = skip_typeref(orig_type_left);
8305 type_left = promote_integer(type_left);
8306 expression->left = create_implicit_cast(left, type_left);
8307 expression->base.type = type_left;
8310 static void semantic_add(binary_expression_t *expression)
8312 expression_t *const left = expression->left;
8313 expression_t *const right = expression->right;
8314 type_t *const orig_type_left = left->base.type;
8315 type_t *const orig_type_right = right->base.type;
8316 type_t *const type_left = skip_typeref(orig_type_left);
8317 type_t *const type_right = skip_typeref(orig_type_right);
8320 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8321 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8322 expression->left = create_implicit_cast(left, arithmetic_type);
8323 expression->right = create_implicit_cast(right, arithmetic_type);
8324 expression->base.type = arithmetic_type;
8325 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8326 check_pointer_arithmetic(&expression->base.source_position,
8327 type_left, orig_type_left);
8328 expression->base.type = type_left;
8329 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8330 check_pointer_arithmetic(&expression->base.source_position,
8331 type_right, orig_type_right);
8332 expression->base.type = type_right;
8333 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8334 errorf(&expression->base.source_position,
8335 "invalid operands to binary + ('%T', '%T')",
8336 orig_type_left, orig_type_right);
8340 static void semantic_sub(binary_expression_t *expression)
8342 expression_t *const left = expression->left;
8343 expression_t *const right = expression->right;
8344 type_t *const orig_type_left = left->base.type;
8345 type_t *const orig_type_right = right->base.type;
8346 type_t *const type_left = skip_typeref(orig_type_left);
8347 type_t *const type_right = skip_typeref(orig_type_right);
8348 source_position_t const *const pos = &expression->base.source_position;
8351 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8352 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8353 expression->left = create_implicit_cast(left, arithmetic_type);
8354 expression->right = create_implicit_cast(right, arithmetic_type);
8355 expression->base.type = arithmetic_type;
8356 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8357 check_pointer_arithmetic(&expression->base.source_position,
8358 type_left, orig_type_left);
8359 expression->base.type = type_left;
8360 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8361 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8362 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8363 if (!types_compatible(unqual_left, unqual_right)) {
8365 "subtracting pointers to incompatible types '%T' and '%T'",
8366 orig_type_left, orig_type_right);
8367 } else if (!is_type_object(unqual_left)) {
8368 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8369 errorf(pos, "subtracting pointers to non-object types '%T'",
8371 } else if (warning.other) {
8372 warningf(pos, "subtracting pointers to void");
8375 expression->base.type = type_ptrdiff_t;
8376 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8377 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8378 orig_type_left, orig_type_right);
8382 static void warn_string_literal_address(expression_t const* expr)
8384 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8385 expr = expr->unary.value;
8386 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8388 expr = expr->unary.value;
8391 if (expr->kind == EXPR_STRING_LITERAL
8392 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8393 warningf(&expr->base.source_position,
8394 "comparison with string literal results in unspecified behaviour");
8398 static void warn_comparison_in_comparison(const expression_t *const expr)
8400 if (expr->base.parenthesized)
8402 switch (expr->base.kind) {
8403 case EXPR_BINARY_LESS:
8404 case EXPR_BINARY_GREATER:
8405 case EXPR_BINARY_LESSEQUAL:
8406 case EXPR_BINARY_GREATEREQUAL:
8407 case EXPR_BINARY_NOTEQUAL:
8408 case EXPR_BINARY_EQUAL:
8409 warningf(&expr->base.source_position,
8410 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8417 static bool maybe_negative(expression_t const *const expr)
8420 !is_constant_expression(expr) ||
8421 fold_constant_to_int(expr) < 0;
8425 * Check the semantics of comparison expressions.
8427 * @param expression The expression to check.
8429 static void semantic_comparison(binary_expression_t *expression)
8431 expression_t *left = expression->left;
8432 expression_t *right = expression->right;
8434 if (warning.address) {
8435 warn_string_literal_address(left);
8436 warn_string_literal_address(right);
8438 expression_t const* const func_left = get_reference_address(left);
8439 if (func_left != NULL && is_null_pointer_constant(right)) {
8440 warningf(&expression->base.source_position,
8441 "the address of '%Y' will never be NULL",
8442 func_left->reference.entity->base.symbol);
8445 expression_t const* const func_right = get_reference_address(right);
8446 if (func_right != NULL && is_null_pointer_constant(right)) {
8447 warningf(&expression->base.source_position,
8448 "the address of '%Y' will never be NULL",
8449 func_right->reference.entity->base.symbol);
8453 if (warning.parentheses) {
8454 warn_comparison_in_comparison(left);
8455 warn_comparison_in_comparison(right);
8458 type_t *orig_type_left = left->base.type;
8459 type_t *orig_type_right = right->base.type;
8460 type_t *type_left = skip_typeref(orig_type_left);
8461 type_t *type_right = skip_typeref(orig_type_right);
8463 /* TODO non-arithmetic types */
8464 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8465 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8467 /* test for signed vs unsigned compares */
8468 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8469 bool const signed_left = is_type_signed(type_left);
8470 bool const signed_right = is_type_signed(type_right);
8471 if (signed_left != signed_right) {
8472 /* FIXME long long needs better const folding magic */
8473 /* TODO check whether constant value can be represented by other type */
8474 if ((signed_left && maybe_negative(left)) ||
8475 (signed_right && maybe_negative(right))) {
8476 warningf(&expression->base.source_position,
8477 "comparison between signed and unsigned");
8482 expression->left = create_implicit_cast(left, arithmetic_type);
8483 expression->right = create_implicit_cast(right, arithmetic_type);
8484 expression->base.type = arithmetic_type;
8485 if (warning.float_equal &&
8486 (expression->base.kind == EXPR_BINARY_EQUAL ||
8487 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8488 is_type_float(arithmetic_type)) {
8489 warningf(&expression->base.source_position,
8490 "comparing floating point with == or != is unsafe");
8492 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8493 /* TODO check compatibility */
8494 } else if (is_type_pointer(type_left)) {
8495 expression->right = create_implicit_cast(right, type_left);
8496 } else if (is_type_pointer(type_right)) {
8497 expression->left = create_implicit_cast(left, type_right);
8498 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8499 type_error_incompatible("invalid operands in comparison",
8500 &expression->base.source_position,
8501 type_left, type_right);
8503 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8507 * Checks if a compound type has constant fields.
8509 static bool has_const_fields(const compound_type_t *type)
8511 compound_t *compound = type->compound;
8512 entity_t *entry = compound->members.entities;
8514 for (; entry != NULL; entry = entry->base.next) {
8515 if (!is_declaration(entry))
8518 const type_t *decl_type = skip_typeref(entry->declaration.type);
8519 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8526 static bool is_valid_assignment_lhs(expression_t const* const left)
8528 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8529 type_t *const type_left = skip_typeref(orig_type_left);
8531 if (!is_lvalue(left)) {
8532 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8537 if (left->kind == EXPR_REFERENCE
8538 && left->reference.entity->kind == ENTITY_FUNCTION) {
8539 errorf(HERE, "cannot assign to function '%E'", left);
8543 if (is_type_array(type_left)) {
8544 errorf(HERE, "cannot assign to array '%E'", left);
8547 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8548 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8552 if (is_type_incomplete(type_left)) {
8553 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8554 left, orig_type_left);
8557 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8558 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8559 left, orig_type_left);
8566 static void semantic_arithmetic_assign(binary_expression_t *expression)
8568 expression_t *left = expression->left;
8569 expression_t *right = expression->right;
8570 type_t *orig_type_left = left->base.type;
8571 type_t *orig_type_right = right->base.type;
8573 if (!is_valid_assignment_lhs(left))
8576 type_t *type_left = skip_typeref(orig_type_left);
8577 type_t *type_right = skip_typeref(orig_type_right);
8579 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8580 /* TODO: improve error message */
8581 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8582 errorf(&expression->base.source_position,
8583 "operation needs arithmetic types");
8588 /* combined instructions are tricky. We can't create an implicit cast on
8589 * the left side, because we need the uncasted form for the store.
8590 * The ast2firm pass has to know that left_type must be right_type
8591 * for the arithmetic operation and create a cast by itself */
8592 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8593 expression->right = create_implicit_cast(right, arithmetic_type);
8594 expression->base.type = type_left;
8597 static void semantic_divmod_assign(binary_expression_t *expression)
8599 semantic_arithmetic_assign(expression);
8600 warn_div_by_zero(expression);
8603 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8605 expression_t *const left = expression->left;
8606 expression_t *const right = expression->right;
8607 type_t *const orig_type_left = left->base.type;
8608 type_t *const orig_type_right = right->base.type;
8609 type_t *const type_left = skip_typeref(orig_type_left);
8610 type_t *const type_right = skip_typeref(orig_type_right);
8612 if (!is_valid_assignment_lhs(left))
8615 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8616 /* combined instructions are tricky. We can't create an implicit cast on
8617 * the left side, because we need the uncasted form for the store.
8618 * The ast2firm pass has to know that left_type must be right_type
8619 * for the arithmetic operation and create a cast by itself */
8620 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8621 expression->right = create_implicit_cast(right, arithmetic_type);
8622 expression->base.type = type_left;
8623 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8624 check_pointer_arithmetic(&expression->base.source_position,
8625 type_left, orig_type_left);
8626 expression->base.type = type_left;
8627 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8628 errorf(&expression->base.source_position,
8629 "incompatible types '%T' and '%T' in assignment",
8630 orig_type_left, orig_type_right);
8634 static void semantic_integer_assign(binary_expression_t *expression)
8636 expression_t *left = expression->left;
8637 expression_t *right = expression->right;
8638 type_t *orig_type_left = left->base.type;
8639 type_t *orig_type_right = right->base.type;
8641 if (!is_valid_assignment_lhs(left))
8644 type_t *type_left = skip_typeref(orig_type_left);
8645 type_t *type_right = skip_typeref(orig_type_right);
8647 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8648 /* TODO: improve error message */
8649 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8650 errorf(&expression->base.source_position,
8651 "operation needs integer types");
8656 /* combined instructions are tricky. We can't create an implicit cast on
8657 * the left side, because we need the uncasted form for the store.
8658 * The ast2firm pass has to know that left_type must be right_type
8659 * for the arithmetic operation and create a cast by itself */
8660 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8661 expression->right = create_implicit_cast(right, arithmetic_type);
8662 expression->base.type = type_left;
8665 static void semantic_shift_assign(binary_expression_t *expression)
8667 expression_t *left = expression->left;
8669 if (!is_valid_assignment_lhs(left))
8672 if (!semantic_shift(expression))
8675 expression->base.type = skip_typeref(left->base.type);
8678 static void warn_logical_and_within_or(const expression_t *const expr)
8680 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8682 if (expr->base.parenthesized)
8684 warningf(&expr->base.source_position,
8685 "suggest parentheses around && within ||");
8689 * Check the semantic restrictions of a logical expression.
8691 static void semantic_logical_op(binary_expression_t *expression)
8693 /* §6.5.13:2 Each of the operands shall have scalar type.
8694 * §6.5.14:2 Each of the operands shall have scalar type. */
8695 semantic_condition(expression->left, "left operand of logical operator");
8696 semantic_condition(expression->right, "right operand of logical operator");
8697 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8698 warning.parentheses) {
8699 warn_logical_and_within_or(expression->left);
8700 warn_logical_and_within_or(expression->right);
8702 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8706 * Check the semantic restrictions of a binary assign expression.
8708 static void semantic_binexpr_assign(binary_expression_t *expression)
8710 expression_t *left = expression->left;
8711 type_t *orig_type_left = left->base.type;
8713 if (!is_valid_assignment_lhs(left))
8716 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8717 report_assign_error(error, orig_type_left, expression->right,
8718 "assignment", &left->base.source_position);
8719 expression->right = create_implicit_cast(expression->right, orig_type_left);
8720 expression->base.type = orig_type_left;
8724 * Determine if the outermost operation (or parts thereof) of the given
8725 * expression has no effect in order to generate a warning about this fact.
8726 * Therefore in some cases this only examines some of the operands of the
8727 * expression (see comments in the function and examples below).
8729 * f() + 23; // warning, because + has no effect
8730 * x || f(); // no warning, because x controls execution of f()
8731 * x ? y : f(); // warning, because y has no effect
8732 * (void)x; // no warning to be able to suppress the warning
8733 * This function can NOT be used for an "expression has definitely no effect"-
8735 static bool expression_has_effect(const expression_t *const expr)
8737 switch (expr->kind) {
8738 case EXPR_UNKNOWN: break;
8739 case EXPR_INVALID: return true; /* do NOT warn */
8740 case EXPR_REFERENCE: return false;
8741 case EXPR_REFERENCE_ENUM_VALUE: return false;
8742 case EXPR_LABEL_ADDRESS: return false;
8744 /* suppress the warning for microsoft __noop operations */
8745 case EXPR_LITERAL_MS_NOOP: return true;
8746 case EXPR_LITERAL_BOOLEAN:
8747 case EXPR_LITERAL_CHARACTER:
8748 case EXPR_LITERAL_WIDE_CHARACTER:
8749 case EXPR_LITERAL_INTEGER:
8750 case EXPR_LITERAL_INTEGER_OCTAL:
8751 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8752 case EXPR_LITERAL_FLOATINGPOINT:
8753 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8754 case EXPR_STRING_LITERAL: return false;
8755 case EXPR_WIDE_STRING_LITERAL: return false;
8758 const call_expression_t *const call = &expr->call;
8759 if (call->function->kind != EXPR_REFERENCE)
8762 switch (call->function->reference.entity->function.btk) {
8763 /* FIXME: which builtins have no effect? */
8764 default: return true;
8768 /* Generate the warning if either the left or right hand side of a
8769 * conditional expression has no effect */
8770 case EXPR_CONDITIONAL: {
8771 conditional_expression_t const *const cond = &expr->conditional;
8772 expression_t const *const t = cond->true_expression;
8774 (t == NULL || expression_has_effect(t)) &&
8775 expression_has_effect(cond->false_expression);
8778 case EXPR_SELECT: return false;
8779 case EXPR_ARRAY_ACCESS: return false;
8780 case EXPR_SIZEOF: return false;
8781 case EXPR_CLASSIFY_TYPE: return false;
8782 case EXPR_ALIGNOF: return false;
8784 case EXPR_FUNCNAME: return false;
8785 case EXPR_BUILTIN_CONSTANT_P: return false;
8786 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8787 case EXPR_OFFSETOF: return false;
8788 case EXPR_VA_START: return true;
8789 case EXPR_VA_ARG: return true;
8790 case EXPR_VA_COPY: return true;
8791 case EXPR_STATEMENT: return true; // TODO
8792 case EXPR_COMPOUND_LITERAL: return false;
8794 case EXPR_UNARY_NEGATE: return false;
8795 case EXPR_UNARY_PLUS: return false;
8796 case EXPR_UNARY_BITWISE_NEGATE: return false;
8797 case EXPR_UNARY_NOT: return false;
8798 case EXPR_UNARY_DEREFERENCE: return false;
8799 case EXPR_UNARY_TAKE_ADDRESS: return false;
8800 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8801 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8802 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8803 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8805 /* Treat void casts as if they have an effect in order to being able to
8806 * suppress the warning */
8807 case EXPR_UNARY_CAST: {
8808 type_t *const type = skip_typeref(expr->base.type);
8809 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8812 case EXPR_UNARY_CAST_IMPLICIT: return true;
8813 case EXPR_UNARY_ASSUME: return true;
8814 case EXPR_UNARY_DELETE: return true;
8815 case EXPR_UNARY_DELETE_ARRAY: return true;
8816 case EXPR_UNARY_THROW: return true;
8818 case EXPR_BINARY_ADD: return false;
8819 case EXPR_BINARY_SUB: return false;
8820 case EXPR_BINARY_MUL: return false;
8821 case EXPR_BINARY_DIV: return false;
8822 case EXPR_BINARY_MOD: return false;
8823 case EXPR_BINARY_EQUAL: return false;
8824 case EXPR_BINARY_NOTEQUAL: return false;
8825 case EXPR_BINARY_LESS: return false;
8826 case EXPR_BINARY_LESSEQUAL: return false;
8827 case EXPR_BINARY_GREATER: return false;
8828 case EXPR_BINARY_GREATEREQUAL: return false;
8829 case EXPR_BINARY_BITWISE_AND: return false;
8830 case EXPR_BINARY_BITWISE_OR: return false;
8831 case EXPR_BINARY_BITWISE_XOR: return false;
8832 case EXPR_BINARY_SHIFTLEFT: return false;
8833 case EXPR_BINARY_SHIFTRIGHT: return false;
8834 case EXPR_BINARY_ASSIGN: return true;
8835 case EXPR_BINARY_MUL_ASSIGN: return true;
8836 case EXPR_BINARY_DIV_ASSIGN: return true;
8837 case EXPR_BINARY_MOD_ASSIGN: return true;
8838 case EXPR_BINARY_ADD_ASSIGN: return true;
8839 case EXPR_BINARY_SUB_ASSIGN: return true;
8840 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8841 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8842 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8843 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8844 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8846 /* Only examine the right hand side of && and ||, because the left hand
8847 * side already has the effect of controlling the execution of the right
8849 case EXPR_BINARY_LOGICAL_AND:
8850 case EXPR_BINARY_LOGICAL_OR:
8851 /* Only examine the right hand side of a comma expression, because the left
8852 * hand side has a separate warning */
8853 case EXPR_BINARY_COMMA:
8854 return expression_has_effect(expr->binary.right);
8856 case EXPR_BINARY_ISGREATER: return false;
8857 case EXPR_BINARY_ISGREATEREQUAL: return false;
8858 case EXPR_BINARY_ISLESS: return false;
8859 case EXPR_BINARY_ISLESSEQUAL: return false;
8860 case EXPR_BINARY_ISLESSGREATER: return false;
8861 case EXPR_BINARY_ISUNORDERED: return false;
8864 internal_errorf(HERE, "unexpected expression");
8867 static void semantic_comma(binary_expression_t *expression)
8869 if (warning.unused_value) {
8870 const expression_t *const left = expression->left;
8871 if (!expression_has_effect(left)) {
8872 warningf(&left->base.source_position,
8873 "left-hand operand of comma expression has no effect");
8876 expression->base.type = expression->right->base.type;
8880 * @param prec_r precedence of the right operand
8882 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8883 static expression_t *parse_##binexpression_type(expression_t *left) \
8885 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8886 binexpr->binary.left = left; \
8889 expression_t *right = parse_sub_expression(prec_r); \
8891 binexpr->binary.right = right; \
8892 sfunc(&binexpr->binary); \
8897 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8898 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8899 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8900 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8901 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8902 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8903 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8904 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8905 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8906 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8907 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8908 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8909 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8910 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8911 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8912 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8913 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8914 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8915 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8916 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8917 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8918 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8919 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8920 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8921 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8922 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8923 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8924 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8925 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8926 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8929 static expression_t *parse_sub_expression(precedence_t precedence)
8931 if (token.type < 0) {
8932 return expected_expression_error();
8935 expression_parser_function_t *parser
8936 = &expression_parsers[token.type];
8937 source_position_t source_position = token.source_position;
8940 if (parser->parser != NULL) {
8941 left = parser->parser();
8943 left = parse_primary_expression();
8945 assert(left != NULL);
8946 left->base.source_position = source_position;
8949 if (token.type < 0) {
8950 return expected_expression_error();
8953 parser = &expression_parsers[token.type];
8954 if (parser->infix_parser == NULL)
8956 if (parser->infix_precedence < precedence)
8959 left = parser->infix_parser(left);
8961 assert(left != NULL);
8962 assert(left->kind != EXPR_UNKNOWN);
8963 left->base.source_position = source_position;
8970 * Parse an expression.
8972 static expression_t *parse_expression(void)
8974 return parse_sub_expression(PREC_EXPRESSION);
8978 * Register a parser for a prefix-like operator.
8980 * @param parser the parser function
8981 * @param token_type the token type of the prefix token
8983 static void register_expression_parser(parse_expression_function parser,
8986 expression_parser_function_t *entry = &expression_parsers[token_type];
8988 if (entry->parser != NULL) {
8989 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8990 panic("trying to register multiple expression parsers for a token");
8992 entry->parser = parser;
8996 * Register a parser for an infix operator with given precedence.
8998 * @param parser the parser function
8999 * @param token_type the token type of the infix operator
9000 * @param precedence the precedence of the operator
9002 static void register_infix_parser(parse_expression_infix_function parser,
9003 int token_type, precedence_t precedence)
9005 expression_parser_function_t *entry = &expression_parsers[token_type];
9007 if (entry->infix_parser != NULL) {
9008 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9009 panic("trying to register multiple infix expression parsers for a "
9012 entry->infix_parser = parser;
9013 entry->infix_precedence = precedence;
9017 * Initialize the expression parsers.
9019 static void init_expression_parsers(void)
9021 memset(&expression_parsers, 0, sizeof(expression_parsers));
9023 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9024 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9025 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9026 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9027 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9028 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9029 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9030 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9031 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9032 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9033 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9034 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9035 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9036 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9037 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9038 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9039 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9040 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9041 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9042 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9043 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9044 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9045 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9046 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9047 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9048 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9049 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9050 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9051 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9052 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9053 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9054 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9055 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9056 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9057 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9058 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9059 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9061 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9062 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9063 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9064 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9065 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9066 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9067 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9068 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9069 register_expression_parser(parse_sizeof, T_sizeof);
9070 register_expression_parser(parse_alignof, T___alignof__);
9071 register_expression_parser(parse_extension, T___extension__);
9072 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9073 register_expression_parser(parse_delete, T_delete);
9074 register_expression_parser(parse_throw, T_throw);
9078 * Parse a asm statement arguments specification.
9080 static asm_argument_t *parse_asm_arguments(bool is_out)
9082 asm_argument_t *result = NULL;
9083 asm_argument_t **anchor = &result;
9085 while (token.type == T_STRING_LITERAL || token.type == '[') {
9086 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9087 memset(argument, 0, sizeof(argument[0]));
9090 if (token.type != T_IDENTIFIER) {
9091 parse_error_expected("while parsing asm argument",
9092 T_IDENTIFIER, NULL);
9095 argument->symbol = token.symbol;
9097 expect(']', end_error);
9100 argument->constraints = parse_string_literals();
9101 expect('(', end_error);
9102 add_anchor_token(')');
9103 expression_t *expression = parse_expression();
9104 rem_anchor_token(')');
9106 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9107 * change size or type representation (e.g. int -> long is ok, but
9108 * int -> float is not) */
9109 if (expression->kind == EXPR_UNARY_CAST) {
9110 type_t *const type = expression->base.type;
9111 type_kind_t const kind = type->kind;
9112 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9115 if (kind == TYPE_ATOMIC) {
9116 atomic_type_kind_t const akind = type->atomic.akind;
9117 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9118 size = get_atomic_type_size(akind);
9120 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9121 size = get_atomic_type_size(get_intptr_kind());
9125 expression_t *const value = expression->unary.value;
9126 type_t *const value_type = value->base.type;
9127 type_kind_t const value_kind = value_type->kind;
9129 unsigned value_flags;
9130 unsigned value_size;
9131 if (value_kind == TYPE_ATOMIC) {
9132 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9133 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9134 value_size = get_atomic_type_size(value_akind);
9135 } else if (value_kind == TYPE_POINTER) {
9136 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9137 value_size = get_atomic_type_size(get_intptr_kind());
9142 if (value_flags != flags || value_size != size)
9146 } while (expression->kind == EXPR_UNARY_CAST);
9150 if (!is_lvalue(expression)) {
9151 errorf(&expression->base.source_position,
9152 "asm output argument is not an lvalue");
9155 if (argument->constraints.begin[0] == '+')
9156 mark_vars_read(expression, NULL);
9158 mark_vars_read(expression, NULL);
9160 argument->expression = expression;
9161 expect(')', end_error);
9163 set_address_taken(expression, true);
9166 anchor = &argument->next;
9178 * Parse a asm statement clobber specification.
9180 static asm_clobber_t *parse_asm_clobbers(void)
9182 asm_clobber_t *result = NULL;
9183 asm_clobber_t **anchor = &result;
9185 while (token.type == T_STRING_LITERAL) {
9186 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9187 clobber->clobber = parse_string_literals();
9190 anchor = &clobber->next;
9200 * Parse an asm statement.
9202 static statement_t *parse_asm_statement(void)
9204 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9205 asm_statement_t *asm_statement = &statement->asms;
9209 if (next_if(T_volatile))
9210 asm_statement->is_volatile = true;
9212 expect('(', end_error);
9213 add_anchor_token(')');
9214 add_anchor_token(':');
9215 asm_statement->asm_text = parse_string_literals();
9217 if (!next_if(':')) {
9218 rem_anchor_token(':');
9222 asm_statement->outputs = parse_asm_arguments(true);
9223 if (!next_if(':')) {
9224 rem_anchor_token(':');
9228 asm_statement->inputs = parse_asm_arguments(false);
9229 if (!next_if(':')) {
9230 rem_anchor_token(':');
9233 rem_anchor_token(':');
9235 asm_statement->clobbers = parse_asm_clobbers();
9238 rem_anchor_token(')');
9239 expect(')', end_error);
9240 expect(';', end_error);
9242 if (asm_statement->outputs == NULL) {
9243 /* GCC: An 'asm' instruction without any output operands will be treated
9244 * identically to a volatile 'asm' instruction. */
9245 asm_statement->is_volatile = true;
9250 return create_invalid_statement();
9254 * Parse a case statement.
9256 static statement_t *parse_case_statement(void)
9258 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9259 source_position_t *const pos = &statement->base.source_position;
9263 expression_t *const expression = parse_expression();
9264 statement->case_label.expression = expression;
9265 if (!is_constant_expression(expression)) {
9266 /* This check does not prevent the error message in all cases of an
9267 * prior error while parsing the expression. At least it catches the
9268 * common case of a mistyped enum entry. */
9269 if (is_type_valid(skip_typeref(expression->base.type))) {
9270 errorf(pos, "case label does not reduce to an integer constant");
9272 statement->case_label.is_bad = true;
9274 long const val = fold_constant_to_int(expression);
9275 statement->case_label.first_case = val;
9276 statement->case_label.last_case = val;
9280 if (next_if(T_DOTDOTDOT)) {
9281 expression_t *const end_range = parse_expression();
9282 statement->case_label.end_range = end_range;
9283 if (!is_constant_expression(end_range)) {
9284 /* This check does not prevent the error message in all cases of an
9285 * prior error while parsing the expression. At least it catches the
9286 * common case of a mistyped enum entry. */
9287 if (is_type_valid(skip_typeref(end_range->base.type))) {
9288 errorf(pos, "case range does not reduce to an integer constant");
9290 statement->case_label.is_bad = true;
9292 long const val = fold_constant_to_int(end_range);
9293 statement->case_label.last_case = val;
9295 if (warning.other && val < statement->case_label.first_case) {
9296 statement->case_label.is_empty_range = true;
9297 warningf(pos, "empty range specified");
9303 PUSH_PARENT(statement);
9305 expect(':', end_error);
9308 if (current_switch != NULL) {
9309 if (! statement->case_label.is_bad) {
9310 /* Check for duplicate case values */
9311 case_label_statement_t *c = &statement->case_label;
9312 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9313 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9316 if (c->last_case < l->first_case || c->first_case > l->last_case)
9319 errorf(pos, "duplicate case value (previously used %P)",
9320 &l->base.source_position);
9324 /* link all cases into the switch statement */
9325 if (current_switch->last_case == NULL) {
9326 current_switch->first_case = &statement->case_label;
9328 current_switch->last_case->next = &statement->case_label;
9330 current_switch->last_case = &statement->case_label;
9332 errorf(pos, "case label not within a switch statement");
9335 statement_t *const inner_stmt = parse_statement();
9336 statement->case_label.statement = inner_stmt;
9337 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9338 errorf(&inner_stmt->base.source_position, "declaration after case label");
9346 * Parse a default statement.
9348 static statement_t *parse_default_statement(void)
9350 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9354 PUSH_PARENT(statement);
9356 expect(':', end_error);
9357 if (current_switch != NULL) {
9358 const case_label_statement_t *def_label = current_switch->default_label;
9359 if (def_label != NULL) {
9360 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9361 &def_label->base.source_position);
9363 current_switch->default_label = &statement->case_label;
9365 /* link all cases into the switch statement */
9366 if (current_switch->last_case == NULL) {
9367 current_switch->first_case = &statement->case_label;
9369 current_switch->last_case->next = &statement->case_label;
9371 current_switch->last_case = &statement->case_label;
9374 errorf(&statement->base.source_position,
9375 "'default' label not within a switch statement");
9378 statement_t *const inner_stmt = parse_statement();
9379 statement->case_label.statement = inner_stmt;
9380 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9381 errorf(&inner_stmt->base.source_position, "declaration after default label");
9388 return create_invalid_statement();
9392 * Parse a label statement.
9394 static statement_t *parse_label_statement(void)
9396 assert(token.type == T_IDENTIFIER);
9397 symbol_t *symbol = token.symbol;
9398 label_t *label = get_label(symbol);
9400 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9401 statement->label.label = label;
9405 PUSH_PARENT(statement);
9407 /* if statement is already set then the label is defined twice,
9408 * otherwise it was just mentioned in a goto/local label declaration so far
9410 if (label->statement != NULL) {
9411 errorf(HERE, "duplicate label '%Y' (declared %P)",
9412 symbol, &label->base.source_position);
9414 label->base.source_position = token.source_position;
9415 label->statement = statement;
9420 if (token.type == '}') {
9421 /* TODO only warn? */
9422 if (warning.other && false) {
9423 warningf(HERE, "label at end of compound statement");
9424 statement->label.statement = create_empty_statement();
9426 errorf(HERE, "label at end of compound statement");
9427 statement->label.statement = create_invalid_statement();
9429 } else if (token.type == ';') {
9430 /* Eat an empty statement here, to avoid the warning about an empty
9431 * statement after a label. label:; is commonly used to have a label
9432 * before a closing brace. */
9433 statement->label.statement = create_empty_statement();
9436 statement_t *const inner_stmt = parse_statement();
9437 statement->label.statement = inner_stmt;
9438 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9439 errorf(&inner_stmt->base.source_position, "declaration after label");
9443 /* remember the labels in a list for later checking */
9444 *label_anchor = &statement->label;
9445 label_anchor = &statement->label.next;
9452 * Parse an if statement.
9454 static statement_t *parse_if(void)
9456 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9460 PUSH_PARENT(statement);
9462 add_anchor_token('{');
9464 expect('(', end_error);
9465 add_anchor_token(')');
9466 expression_t *const expr = parse_expression();
9467 statement->ifs.condition = expr;
9468 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9470 semantic_condition(expr, "condition of 'if'-statment");
9471 mark_vars_read(expr, NULL);
9472 rem_anchor_token(')');
9473 expect(')', end_error);
9476 rem_anchor_token('{');
9478 add_anchor_token(T_else);
9479 statement_t *const true_stmt = parse_statement();
9480 statement->ifs.true_statement = true_stmt;
9481 rem_anchor_token(T_else);
9483 if (next_if(T_else)) {
9484 statement->ifs.false_statement = parse_statement();
9485 } else if (warning.parentheses &&
9486 true_stmt->kind == STATEMENT_IF &&
9487 true_stmt->ifs.false_statement != NULL) {
9488 warningf(&true_stmt->base.source_position,
9489 "suggest explicit braces to avoid ambiguous 'else'");
9497 * Check that all enums are handled in a switch.
9499 * @param statement the switch statement to check
9501 static void check_enum_cases(const switch_statement_t *statement)
9503 const type_t *type = skip_typeref(statement->expression->base.type);
9504 if (! is_type_enum(type))
9506 const enum_type_t *enumt = &type->enumt;
9508 /* if we have a default, no warnings */
9509 if (statement->default_label != NULL)
9512 /* FIXME: calculation of value should be done while parsing */
9513 /* TODO: quadratic algorithm here. Change to an n log n one */
9514 long last_value = -1;
9515 const entity_t *entry = enumt->enume->base.next;
9516 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9517 entry = entry->base.next) {
9518 const expression_t *expression = entry->enum_value.value;
9519 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9521 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9522 if (l->expression == NULL)
9524 if (l->first_case <= value && value <= l->last_case) {
9530 warningf(&statement->base.source_position,
9531 "enumeration value '%Y' not handled in switch",
9532 entry->base.symbol);
9539 * Parse a switch statement.
9541 static statement_t *parse_switch(void)
9543 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9547 PUSH_PARENT(statement);
9549 expect('(', end_error);
9550 add_anchor_token(')');
9551 expression_t *const expr = parse_expression();
9552 mark_vars_read(expr, NULL);
9553 type_t * type = skip_typeref(expr->base.type);
9554 if (is_type_integer(type)) {
9555 type = promote_integer(type);
9556 if (warning.traditional) {
9557 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9558 warningf(&expr->base.source_position,
9559 "'%T' switch expression not converted to '%T' in ISO C",
9563 } else if (is_type_valid(type)) {
9564 errorf(&expr->base.source_position,
9565 "switch quantity is not an integer, but '%T'", type);
9566 type = type_error_type;
9568 statement->switchs.expression = create_implicit_cast(expr, type);
9569 expect(')', end_error);
9570 rem_anchor_token(')');
9572 switch_statement_t *rem = current_switch;
9573 current_switch = &statement->switchs;
9574 statement->switchs.body = parse_statement();
9575 current_switch = rem;
9577 if (warning.switch_default &&
9578 statement->switchs.default_label == NULL) {
9579 warningf(&statement->base.source_position, "switch has no default case");
9581 if (warning.switch_enum)
9582 check_enum_cases(&statement->switchs);
9588 return create_invalid_statement();
9591 static statement_t *parse_loop_body(statement_t *const loop)
9593 statement_t *const rem = current_loop;
9594 current_loop = loop;
9596 statement_t *const body = parse_statement();
9603 * Parse a while statement.
9605 static statement_t *parse_while(void)
9607 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9611 PUSH_PARENT(statement);
9613 expect('(', end_error);
9614 add_anchor_token(')');
9615 expression_t *const cond = parse_expression();
9616 statement->whiles.condition = cond;
9617 /* §6.8.5:2 The controlling expression of an iteration statement shall
9618 * have scalar type. */
9619 semantic_condition(cond, "condition of 'while'-statement");
9620 mark_vars_read(cond, NULL);
9621 rem_anchor_token(')');
9622 expect(')', end_error);
9624 statement->whiles.body = parse_loop_body(statement);
9630 return create_invalid_statement();
9634 * Parse a do statement.
9636 static statement_t *parse_do(void)
9638 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9642 PUSH_PARENT(statement);
9644 add_anchor_token(T_while);
9645 statement->do_while.body = parse_loop_body(statement);
9646 rem_anchor_token(T_while);
9648 expect(T_while, end_error);
9649 expect('(', end_error);
9650 add_anchor_token(')');
9651 expression_t *const cond = parse_expression();
9652 statement->do_while.condition = cond;
9653 /* §6.8.5:2 The controlling expression of an iteration statement shall
9654 * have scalar type. */
9655 semantic_condition(cond, "condition of 'do-while'-statement");
9656 mark_vars_read(cond, NULL);
9657 rem_anchor_token(')');
9658 expect(')', end_error);
9659 expect(';', end_error);
9665 return create_invalid_statement();
9669 * Parse a for statement.
9671 static statement_t *parse_for(void)
9673 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9677 expect('(', end_error1);
9678 add_anchor_token(')');
9680 PUSH_PARENT(statement);
9682 size_t const top = environment_top();
9683 scope_t *old_scope = scope_push(&statement->fors.scope);
9685 bool old_gcc_extension = in_gcc_extension;
9686 while (next_if(T___extension__)) {
9687 in_gcc_extension = true;
9691 } else if (is_declaration_specifier(&token, false)) {
9692 parse_declaration(record_entity, DECL_FLAGS_NONE);
9694 add_anchor_token(';');
9695 expression_t *const init = parse_expression();
9696 statement->fors.initialisation = init;
9697 mark_vars_read(init, ENT_ANY);
9698 if (warning.unused_value && !expression_has_effect(init)) {
9699 warningf(&init->base.source_position,
9700 "initialisation of 'for'-statement has no effect");
9702 rem_anchor_token(';');
9703 expect(';', end_error2);
9705 in_gcc_extension = old_gcc_extension;
9707 if (token.type != ';') {
9708 add_anchor_token(';');
9709 expression_t *const cond = parse_expression();
9710 statement->fors.condition = cond;
9711 /* §6.8.5:2 The controlling expression of an iteration statement
9712 * shall have scalar type. */
9713 semantic_condition(cond, "condition of 'for'-statement");
9714 mark_vars_read(cond, NULL);
9715 rem_anchor_token(';');
9717 expect(';', end_error2);
9718 if (token.type != ')') {
9719 expression_t *const step = parse_expression();
9720 statement->fors.step = step;
9721 mark_vars_read(step, ENT_ANY);
9722 if (warning.unused_value && !expression_has_effect(step)) {
9723 warningf(&step->base.source_position,
9724 "step of 'for'-statement has no effect");
9727 expect(')', end_error2);
9728 rem_anchor_token(')');
9729 statement->fors.body = parse_loop_body(statement);
9731 assert(current_scope == &statement->fors.scope);
9732 scope_pop(old_scope);
9733 environment_pop_to(top);
9740 rem_anchor_token(')');
9741 assert(current_scope == &statement->fors.scope);
9742 scope_pop(old_scope);
9743 environment_pop_to(top);
9747 return create_invalid_statement();
9751 * Parse a goto statement.
9753 static statement_t *parse_goto(void)
9755 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9758 if (GNU_MODE && next_if('*')) {
9759 expression_t *expression = parse_expression();
9760 mark_vars_read(expression, NULL);
9762 /* Argh: although documentation says the expression must be of type void*,
9763 * gcc accepts anything that can be casted into void* without error */
9764 type_t *type = expression->base.type;
9766 if (type != type_error_type) {
9767 if (!is_type_pointer(type) && !is_type_integer(type)) {
9768 errorf(&expression->base.source_position,
9769 "cannot convert to a pointer type");
9770 } else if (warning.other && type != type_void_ptr) {
9771 warningf(&expression->base.source_position,
9772 "type of computed goto expression should be 'void*' not '%T'", type);
9774 expression = create_implicit_cast(expression, type_void_ptr);
9777 statement->gotos.expression = expression;
9778 } else if (token.type == T_IDENTIFIER) {
9779 symbol_t *symbol = token.symbol;
9781 statement->gotos.label = get_label(symbol);
9784 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9786 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9791 /* remember the goto's in a list for later checking */
9792 *goto_anchor = &statement->gotos;
9793 goto_anchor = &statement->gotos.next;
9795 expect(';', end_error);
9799 return create_invalid_statement();
9803 * Parse a continue statement.
9805 static statement_t *parse_continue(void)
9807 if (current_loop == NULL) {
9808 errorf(HERE, "continue statement not within loop");
9811 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9814 expect(';', end_error);
9821 * Parse a break statement.
9823 static statement_t *parse_break(void)
9825 if (current_switch == NULL && current_loop == NULL) {
9826 errorf(HERE, "break statement not within loop or switch");
9829 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9832 expect(';', end_error);
9839 * Parse a __leave statement.
9841 static statement_t *parse_leave_statement(void)
9843 if (current_try == NULL) {
9844 errorf(HERE, "__leave statement not within __try");
9847 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9850 expect(';', end_error);
9857 * Check if a given entity represents a local variable.
9859 static bool is_local_variable(const entity_t *entity)
9861 if (entity->kind != ENTITY_VARIABLE)
9864 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9865 case STORAGE_CLASS_AUTO:
9866 case STORAGE_CLASS_REGISTER: {
9867 const type_t *type = skip_typeref(entity->declaration.type);
9868 if (is_type_function(type)) {
9880 * Check if a given expression represents a local variable.
9882 static bool expression_is_local_variable(const expression_t *expression)
9884 if (expression->base.kind != EXPR_REFERENCE) {
9887 const entity_t *entity = expression->reference.entity;
9888 return is_local_variable(entity);
9892 * Check if a given expression represents a local variable and
9893 * return its declaration then, else return NULL.
9895 entity_t *expression_is_variable(const expression_t *expression)
9897 if (expression->base.kind != EXPR_REFERENCE) {
9900 entity_t *entity = expression->reference.entity;
9901 if (entity->kind != ENTITY_VARIABLE)
9908 * Parse a return statement.
9910 static statement_t *parse_return(void)
9914 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9916 expression_t *return_value = NULL;
9917 if (token.type != ';') {
9918 return_value = parse_expression();
9919 mark_vars_read(return_value, NULL);
9922 const type_t *const func_type = skip_typeref(current_function->base.type);
9923 assert(is_type_function(func_type));
9924 type_t *const return_type = skip_typeref(func_type->function.return_type);
9926 source_position_t const *const pos = &statement->base.source_position;
9927 if (return_value != NULL) {
9928 type_t *return_value_type = skip_typeref(return_value->base.type);
9930 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9931 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9932 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9933 /* Only warn in C mode, because GCC does the same */
9934 if (c_mode & _CXX || strict_mode) {
9936 "'return' with a value, in function returning 'void'");
9937 } else if (warning.other) {
9939 "'return' with a value, in function returning 'void'");
9941 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9942 /* Only warn in C mode, because GCC does the same */
9945 "'return' with expression in function returning 'void'");
9946 } else if (warning.other) {
9948 "'return' with expression in function returning 'void'");
9952 assign_error_t error = semantic_assign(return_type, return_value);
9953 report_assign_error(error, return_type, return_value, "'return'",
9956 return_value = create_implicit_cast(return_value, return_type);
9957 /* check for returning address of a local var */
9958 if (warning.other && return_value != NULL
9959 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9960 const expression_t *expression = return_value->unary.value;
9961 if (expression_is_local_variable(expression)) {
9962 warningf(pos, "function returns address of local variable");
9965 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9966 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9967 if (c_mode & _CXX || strict_mode) {
9969 "'return' without value, in function returning non-void");
9972 "'return' without value, in function returning non-void");
9975 statement->returns.value = return_value;
9977 expect(';', end_error);
9984 * Parse a declaration statement.
9986 static statement_t *parse_declaration_statement(void)
9988 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9990 entity_t *before = current_scope->last_entity;
9992 parse_external_declaration();
9994 parse_declaration(record_entity, DECL_FLAGS_NONE);
9997 declaration_statement_t *const decl = &statement->declaration;
9998 entity_t *const begin =
9999 before != NULL ? before->base.next : current_scope->entities;
10000 decl->declarations_begin = begin;
10001 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10007 * Parse an expression statement, ie. expr ';'.
10009 static statement_t *parse_expression_statement(void)
10011 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10013 expression_t *const expr = parse_expression();
10014 statement->expression.expression = expr;
10015 mark_vars_read(expr, ENT_ANY);
10017 expect(';', end_error);
10024 * Parse a microsoft __try { } __finally { } or
10025 * __try{ } __except() { }
10027 static statement_t *parse_ms_try_statment(void)
10029 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10032 PUSH_PARENT(statement);
10034 ms_try_statement_t *rem = current_try;
10035 current_try = &statement->ms_try;
10036 statement->ms_try.try_statement = parse_compound_statement(false);
10041 if (next_if(T___except)) {
10042 expect('(', end_error);
10043 add_anchor_token(')');
10044 expression_t *const expr = parse_expression();
10045 mark_vars_read(expr, NULL);
10046 type_t * type = skip_typeref(expr->base.type);
10047 if (is_type_integer(type)) {
10048 type = promote_integer(type);
10049 } else if (is_type_valid(type)) {
10050 errorf(&expr->base.source_position,
10051 "__expect expression is not an integer, but '%T'", type);
10052 type = type_error_type;
10054 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10055 rem_anchor_token(')');
10056 expect(')', end_error);
10057 statement->ms_try.final_statement = parse_compound_statement(false);
10058 } else if (next_if(T__finally)) {
10059 statement->ms_try.final_statement = parse_compound_statement(false);
10061 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10062 return create_invalid_statement();
10066 return create_invalid_statement();
10069 static statement_t *parse_empty_statement(void)
10071 if (warning.empty_statement) {
10072 warningf(HERE, "statement is empty");
10074 statement_t *const statement = create_empty_statement();
10079 static statement_t *parse_local_label_declaration(void)
10081 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10085 entity_t *begin = NULL, *end = NULL;
10088 if (token.type != T_IDENTIFIER) {
10089 parse_error_expected("while parsing local label declaration",
10090 T_IDENTIFIER, NULL);
10093 symbol_t *symbol = token.symbol;
10094 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10095 if (entity != NULL && entity->base.parent_scope == current_scope) {
10096 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10097 symbol, &entity->base.source_position);
10099 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10101 entity->base.parent_scope = current_scope;
10102 entity->base.namespc = NAMESPACE_LABEL;
10103 entity->base.source_position = token.source_position;
10104 entity->base.symbol = symbol;
10107 end->base.next = entity;
10112 environment_push(entity);
10115 } while (next_if(','));
10118 statement->declaration.declarations_begin = begin;
10119 statement->declaration.declarations_end = end;
10123 static void parse_namespace_definition(void)
10127 entity_t *entity = NULL;
10128 symbol_t *symbol = NULL;
10130 if (token.type == T_IDENTIFIER) {
10131 symbol = token.symbol;
10134 entity = get_entity(symbol, NAMESPACE_NORMAL);
10136 && entity->kind != ENTITY_NAMESPACE
10137 && entity->base.parent_scope == current_scope) {
10138 if (!is_error_entity(entity)) {
10139 error_redefined_as_different_kind(&token.source_position,
10140 entity, ENTITY_NAMESPACE);
10146 if (entity == NULL) {
10147 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10148 entity->base.symbol = symbol;
10149 entity->base.source_position = token.source_position;
10150 entity->base.namespc = NAMESPACE_NORMAL;
10151 entity->base.parent_scope = current_scope;
10154 if (token.type == '=') {
10155 /* TODO: parse namespace alias */
10156 panic("namespace alias definition not supported yet");
10159 environment_push(entity);
10160 append_entity(current_scope, entity);
10162 size_t const top = environment_top();
10163 scope_t *old_scope = scope_push(&entity->namespacee.members);
10165 entity_t *old_current_entity = current_entity;
10166 current_entity = entity;
10168 expect('{', end_error);
10170 expect('}', end_error);
10173 assert(current_scope == &entity->namespacee.members);
10174 assert(current_entity == entity);
10175 current_entity = old_current_entity;
10176 scope_pop(old_scope);
10177 environment_pop_to(top);
10181 * Parse a statement.
10182 * There's also parse_statement() which additionally checks for
10183 * "statement has no effect" warnings
10185 static statement_t *intern_parse_statement(void)
10187 statement_t *statement = NULL;
10189 /* declaration or statement */
10190 add_anchor_token(';');
10191 switch (token.type) {
10192 case T_IDENTIFIER: {
10193 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10194 if (la1_type == ':') {
10195 statement = parse_label_statement();
10196 } else if (is_typedef_symbol(token.symbol)) {
10197 statement = parse_declaration_statement();
10199 /* it's an identifier, the grammar says this must be an
10200 * expression statement. However it is common that users mistype
10201 * declaration types, so we guess a bit here to improve robustness
10202 * for incorrect programs */
10203 switch (la1_type) {
10206 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL)
10207 goto expression_statment;
10212 statement = parse_declaration_statement();
10216 expression_statment:
10217 statement = parse_expression_statement();
10224 case T___extension__:
10225 /* This can be a prefix to a declaration or an expression statement.
10226 * We simply eat it now and parse the rest with tail recursion. */
10227 while (next_if(T___extension__)) {}
10228 bool old_gcc_extension = in_gcc_extension;
10229 in_gcc_extension = true;
10230 statement = intern_parse_statement();
10231 in_gcc_extension = old_gcc_extension;
10235 statement = parse_declaration_statement();
10239 statement = parse_local_label_declaration();
10242 case ';': statement = parse_empty_statement(); break;
10243 case '{': statement = parse_compound_statement(false); break;
10244 case T___leave: statement = parse_leave_statement(); break;
10245 case T___try: statement = parse_ms_try_statment(); break;
10246 case T_asm: statement = parse_asm_statement(); break;
10247 case T_break: statement = parse_break(); break;
10248 case T_case: statement = parse_case_statement(); break;
10249 case T_continue: statement = parse_continue(); break;
10250 case T_default: statement = parse_default_statement(); break;
10251 case T_do: statement = parse_do(); break;
10252 case T_for: statement = parse_for(); break;
10253 case T_goto: statement = parse_goto(); break;
10254 case T_if: statement = parse_if(); break;
10255 case T_return: statement = parse_return(); break;
10256 case T_switch: statement = parse_switch(); break;
10257 case T_while: statement = parse_while(); break;
10260 statement = parse_expression_statement();
10264 errorf(HERE, "unexpected token %K while parsing statement", &token);
10265 statement = create_invalid_statement();
10270 rem_anchor_token(';');
10272 assert(statement != NULL
10273 && statement->base.source_position.input_name != NULL);
10279 * parse a statement and emits "statement has no effect" warning if needed
10280 * (This is really a wrapper around intern_parse_statement with check for 1
10281 * single warning. It is needed, because for statement expressions we have
10282 * to avoid the warning on the last statement)
10284 static statement_t *parse_statement(void)
10286 statement_t *statement = intern_parse_statement();
10288 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10289 expression_t *expression = statement->expression.expression;
10290 if (!expression_has_effect(expression)) {
10291 warningf(&expression->base.source_position,
10292 "statement has no effect");
10300 * Parse a compound statement.
10302 static statement_t *parse_compound_statement(bool inside_expression_statement)
10304 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10306 PUSH_PARENT(statement);
10309 add_anchor_token('}');
10310 /* tokens, which can start a statement */
10311 /* TODO MS, __builtin_FOO */
10312 add_anchor_token('!');
10313 add_anchor_token('&');
10314 add_anchor_token('(');
10315 add_anchor_token('*');
10316 add_anchor_token('+');
10317 add_anchor_token('-');
10318 add_anchor_token('{');
10319 add_anchor_token('~');
10320 add_anchor_token(T_CHARACTER_CONSTANT);
10321 add_anchor_token(T_COLONCOLON);
10322 add_anchor_token(T_FLOATINGPOINT);
10323 add_anchor_token(T_IDENTIFIER);
10324 add_anchor_token(T_INTEGER);
10325 add_anchor_token(T_MINUSMINUS);
10326 add_anchor_token(T_PLUSPLUS);
10327 add_anchor_token(T_STRING_LITERAL);
10328 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10329 add_anchor_token(T_WIDE_STRING_LITERAL);
10330 add_anchor_token(T__Bool);
10331 add_anchor_token(T__Complex);
10332 add_anchor_token(T__Imaginary);
10333 add_anchor_token(T___FUNCTION__);
10334 add_anchor_token(T___PRETTY_FUNCTION__);
10335 add_anchor_token(T___alignof__);
10336 add_anchor_token(T___attribute__);
10337 add_anchor_token(T___builtin_va_start);
10338 add_anchor_token(T___extension__);
10339 add_anchor_token(T___func__);
10340 add_anchor_token(T___imag__);
10341 add_anchor_token(T___label__);
10342 add_anchor_token(T___real__);
10343 add_anchor_token(T___thread);
10344 add_anchor_token(T_asm);
10345 add_anchor_token(T_auto);
10346 add_anchor_token(T_bool);
10347 add_anchor_token(T_break);
10348 add_anchor_token(T_case);
10349 add_anchor_token(T_char);
10350 add_anchor_token(T_class);
10351 add_anchor_token(T_const);
10352 add_anchor_token(T_const_cast);
10353 add_anchor_token(T_continue);
10354 add_anchor_token(T_default);
10355 add_anchor_token(T_delete);
10356 add_anchor_token(T_double);
10357 add_anchor_token(T_do);
10358 add_anchor_token(T_dynamic_cast);
10359 add_anchor_token(T_enum);
10360 add_anchor_token(T_extern);
10361 add_anchor_token(T_false);
10362 add_anchor_token(T_float);
10363 add_anchor_token(T_for);
10364 add_anchor_token(T_goto);
10365 add_anchor_token(T_if);
10366 add_anchor_token(T_inline);
10367 add_anchor_token(T_int);
10368 add_anchor_token(T_long);
10369 add_anchor_token(T_new);
10370 add_anchor_token(T_operator);
10371 add_anchor_token(T_register);
10372 add_anchor_token(T_reinterpret_cast);
10373 add_anchor_token(T_restrict);
10374 add_anchor_token(T_return);
10375 add_anchor_token(T_short);
10376 add_anchor_token(T_signed);
10377 add_anchor_token(T_sizeof);
10378 add_anchor_token(T_static);
10379 add_anchor_token(T_static_cast);
10380 add_anchor_token(T_struct);
10381 add_anchor_token(T_switch);
10382 add_anchor_token(T_template);
10383 add_anchor_token(T_this);
10384 add_anchor_token(T_throw);
10385 add_anchor_token(T_true);
10386 add_anchor_token(T_try);
10387 add_anchor_token(T_typedef);
10388 add_anchor_token(T_typeid);
10389 add_anchor_token(T_typename);
10390 add_anchor_token(T_typeof);
10391 add_anchor_token(T_union);
10392 add_anchor_token(T_unsigned);
10393 add_anchor_token(T_using);
10394 add_anchor_token(T_void);
10395 add_anchor_token(T_volatile);
10396 add_anchor_token(T_wchar_t);
10397 add_anchor_token(T_while);
10399 size_t const top = environment_top();
10400 scope_t *old_scope = scope_push(&statement->compound.scope);
10402 statement_t **anchor = &statement->compound.statements;
10403 bool only_decls_so_far = true;
10404 while (token.type != '}') {
10405 if (token.type == T_EOF) {
10406 errorf(&statement->base.source_position,
10407 "EOF while parsing compound statement");
10410 statement_t *sub_statement = intern_parse_statement();
10411 if (is_invalid_statement(sub_statement)) {
10412 /* an error occurred. if we are at an anchor, return */
10418 if (warning.declaration_after_statement) {
10419 if (sub_statement->kind != STATEMENT_DECLARATION) {
10420 only_decls_so_far = false;
10421 } else if (!only_decls_so_far) {
10422 warningf(&sub_statement->base.source_position,
10423 "ISO C90 forbids mixed declarations and code");
10427 *anchor = sub_statement;
10429 while (sub_statement->base.next != NULL)
10430 sub_statement = sub_statement->base.next;
10432 anchor = &sub_statement->base.next;
10436 /* look over all statements again to produce no effect warnings */
10437 if (warning.unused_value) {
10438 statement_t *sub_statement = statement->compound.statements;
10439 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10440 if (sub_statement->kind != STATEMENT_EXPRESSION)
10442 /* don't emit a warning for the last expression in an expression
10443 * statement as it has always an effect */
10444 if (inside_expression_statement && sub_statement->base.next == NULL)
10447 expression_t *expression = sub_statement->expression.expression;
10448 if (!expression_has_effect(expression)) {
10449 warningf(&expression->base.source_position,
10450 "statement has no effect");
10456 rem_anchor_token(T_while);
10457 rem_anchor_token(T_wchar_t);
10458 rem_anchor_token(T_volatile);
10459 rem_anchor_token(T_void);
10460 rem_anchor_token(T_using);
10461 rem_anchor_token(T_unsigned);
10462 rem_anchor_token(T_union);
10463 rem_anchor_token(T_typeof);
10464 rem_anchor_token(T_typename);
10465 rem_anchor_token(T_typeid);
10466 rem_anchor_token(T_typedef);
10467 rem_anchor_token(T_try);
10468 rem_anchor_token(T_true);
10469 rem_anchor_token(T_throw);
10470 rem_anchor_token(T_this);
10471 rem_anchor_token(T_template);
10472 rem_anchor_token(T_switch);
10473 rem_anchor_token(T_struct);
10474 rem_anchor_token(T_static_cast);
10475 rem_anchor_token(T_static);
10476 rem_anchor_token(T_sizeof);
10477 rem_anchor_token(T_signed);
10478 rem_anchor_token(T_short);
10479 rem_anchor_token(T_return);
10480 rem_anchor_token(T_restrict);
10481 rem_anchor_token(T_reinterpret_cast);
10482 rem_anchor_token(T_register);
10483 rem_anchor_token(T_operator);
10484 rem_anchor_token(T_new);
10485 rem_anchor_token(T_long);
10486 rem_anchor_token(T_int);
10487 rem_anchor_token(T_inline);
10488 rem_anchor_token(T_if);
10489 rem_anchor_token(T_goto);
10490 rem_anchor_token(T_for);
10491 rem_anchor_token(T_float);
10492 rem_anchor_token(T_false);
10493 rem_anchor_token(T_extern);
10494 rem_anchor_token(T_enum);
10495 rem_anchor_token(T_dynamic_cast);
10496 rem_anchor_token(T_do);
10497 rem_anchor_token(T_double);
10498 rem_anchor_token(T_delete);
10499 rem_anchor_token(T_default);
10500 rem_anchor_token(T_continue);
10501 rem_anchor_token(T_const_cast);
10502 rem_anchor_token(T_const);
10503 rem_anchor_token(T_class);
10504 rem_anchor_token(T_char);
10505 rem_anchor_token(T_case);
10506 rem_anchor_token(T_break);
10507 rem_anchor_token(T_bool);
10508 rem_anchor_token(T_auto);
10509 rem_anchor_token(T_asm);
10510 rem_anchor_token(T___thread);
10511 rem_anchor_token(T___real__);
10512 rem_anchor_token(T___label__);
10513 rem_anchor_token(T___imag__);
10514 rem_anchor_token(T___func__);
10515 rem_anchor_token(T___extension__);
10516 rem_anchor_token(T___builtin_va_start);
10517 rem_anchor_token(T___attribute__);
10518 rem_anchor_token(T___alignof__);
10519 rem_anchor_token(T___PRETTY_FUNCTION__);
10520 rem_anchor_token(T___FUNCTION__);
10521 rem_anchor_token(T__Imaginary);
10522 rem_anchor_token(T__Complex);
10523 rem_anchor_token(T__Bool);
10524 rem_anchor_token(T_WIDE_STRING_LITERAL);
10525 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10526 rem_anchor_token(T_STRING_LITERAL);
10527 rem_anchor_token(T_PLUSPLUS);
10528 rem_anchor_token(T_MINUSMINUS);
10529 rem_anchor_token(T_INTEGER);
10530 rem_anchor_token(T_IDENTIFIER);
10531 rem_anchor_token(T_FLOATINGPOINT);
10532 rem_anchor_token(T_COLONCOLON);
10533 rem_anchor_token(T_CHARACTER_CONSTANT);
10534 rem_anchor_token('~');
10535 rem_anchor_token('{');
10536 rem_anchor_token('-');
10537 rem_anchor_token('+');
10538 rem_anchor_token('*');
10539 rem_anchor_token('(');
10540 rem_anchor_token('&');
10541 rem_anchor_token('!');
10542 rem_anchor_token('}');
10543 assert(current_scope == &statement->compound.scope);
10544 scope_pop(old_scope);
10545 environment_pop_to(top);
10552 * Check for unused global static functions and variables
10554 static void check_unused_globals(void)
10556 if (!warning.unused_function && !warning.unused_variable)
10559 for (const entity_t *entity = file_scope->entities; entity != NULL;
10560 entity = entity->base.next) {
10561 if (!is_declaration(entity))
10564 const declaration_t *declaration = &entity->declaration;
10565 if (declaration->used ||
10566 declaration->modifiers & DM_UNUSED ||
10567 declaration->modifiers & DM_USED ||
10568 declaration->storage_class != STORAGE_CLASS_STATIC)
10571 type_t *const type = declaration->type;
10573 if (entity->kind == ENTITY_FUNCTION) {
10574 /* inhibit warning for static inline functions */
10575 if (entity->function.is_inline)
10578 s = entity->function.statement != NULL ? "defined" : "declared";
10583 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10584 type, declaration->base.symbol, s);
10588 static void parse_global_asm(void)
10590 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10593 expect('(', end_error);
10595 statement->asms.asm_text = parse_string_literals();
10596 statement->base.next = unit->global_asm;
10597 unit->global_asm = statement;
10599 expect(')', end_error);
10600 expect(';', end_error);
10605 static void parse_linkage_specification(void)
10608 assert(token.type == T_STRING_LITERAL);
10610 const char *linkage = parse_string_literals().begin;
10612 linkage_kind_t old_linkage = current_linkage;
10613 linkage_kind_t new_linkage;
10614 if (strcmp(linkage, "C") == 0) {
10615 new_linkage = LINKAGE_C;
10616 } else if (strcmp(linkage, "C++") == 0) {
10617 new_linkage = LINKAGE_CXX;
10619 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10620 new_linkage = LINKAGE_INVALID;
10622 current_linkage = new_linkage;
10624 if (next_if('{')) {
10626 expect('}', end_error);
10632 assert(current_linkage == new_linkage);
10633 current_linkage = old_linkage;
10636 static void parse_external(void)
10638 switch (token.type) {
10639 DECLARATION_START_NO_EXTERN
10641 case T___extension__:
10642 /* tokens below are for implicit int */
10643 case '&': /* & x; -> int& x; (and error later, because C++ has no
10645 case '*': /* * x; -> int* x; */
10646 case '(': /* (x); -> int (x); */
10647 parse_external_declaration();
10651 if (look_ahead(1)->type == T_STRING_LITERAL) {
10652 parse_linkage_specification();
10654 parse_external_declaration();
10659 parse_global_asm();
10663 parse_namespace_definition();
10667 if (!strict_mode) {
10669 warningf(HERE, "stray ';' outside of function");
10676 errorf(HERE, "stray %K outside of function", &token);
10677 if (token.type == '(' || token.type == '{' || token.type == '[')
10678 eat_until_matching_token(token.type);
10684 static void parse_externals(void)
10686 add_anchor_token('}');
10687 add_anchor_token(T_EOF);
10690 unsigned char token_anchor_copy[T_LAST_TOKEN];
10691 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10694 while (token.type != T_EOF && token.type != '}') {
10696 bool anchor_leak = false;
10697 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10698 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10700 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10701 anchor_leak = true;
10704 if (in_gcc_extension) {
10705 errorf(HERE, "Leaked __extension__");
10706 anchor_leak = true;
10716 rem_anchor_token(T_EOF);
10717 rem_anchor_token('}');
10721 * Parse a translation unit.
10723 static void parse_translation_unit(void)
10725 add_anchor_token(T_EOF);
10730 if (token.type == T_EOF)
10733 errorf(HERE, "stray %K outside of function", &token);
10734 if (token.type == '(' || token.type == '{' || token.type == '[')
10735 eat_until_matching_token(token.type);
10743 * @return the translation unit or NULL if errors occurred.
10745 void start_parsing(void)
10747 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10748 label_stack = NEW_ARR_F(stack_entry_t, 0);
10749 diagnostic_count = 0;
10753 print_to_file(stderr);
10755 assert(unit == NULL);
10756 unit = allocate_ast_zero(sizeof(unit[0]));
10758 assert(file_scope == NULL);
10759 file_scope = &unit->scope;
10761 assert(current_scope == NULL);
10762 scope_push(&unit->scope);
10764 create_gnu_builtins();
10766 create_microsoft_intrinsics();
10769 translation_unit_t *finish_parsing(void)
10771 assert(current_scope == &unit->scope);
10774 assert(file_scope == &unit->scope);
10775 check_unused_globals();
10778 DEL_ARR_F(environment_stack);
10779 DEL_ARR_F(label_stack);
10781 translation_unit_t *result = unit;
10786 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10787 * are given length one. */
10788 static void complete_incomplete_arrays(void)
10790 size_t n = ARR_LEN(incomplete_arrays);
10791 for (size_t i = 0; i != n; ++i) {
10792 declaration_t *const decl = incomplete_arrays[i];
10793 type_t *const orig_type = decl->type;
10794 type_t *const type = skip_typeref(orig_type);
10796 if (!is_type_incomplete(type))
10799 if (warning.other) {
10800 warningf(&decl->base.source_position,
10801 "array '%#T' assumed to have one element",
10802 orig_type, decl->base.symbol);
10805 type_t *const new_type = duplicate_type(type);
10806 new_type->array.size_constant = true;
10807 new_type->array.has_implicit_size = true;
10808 new_type->array.size = 1;
10810 type_t *const result = identify_new_type(new_type);
10812 decl->type = result;
10816 void prepare_main_collect2(entity_t *entity)
10818 // create call to __main
10819 symbol_t *symbol = symbol_table_insert("__main");
10820 entity_t *subsubmain_ent
10821 = create_implicit_function(symbol, &builtin_source_position);
10823 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10824 type_t *ftype = subsubmain_ent->declaration.type;
10825 ref->base.source_position = builtin_source_position;
10826 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10827 ref->reference.entity = subsubmain_ent;
10829 expression_t *call = allocate_expression_zero(EXPR_CALL);
10830 call->base.source_position = builtin_source_position;
10831 call->base.type = type_void;
10832 call->call.function = ref;
10834 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10835 expr_statement->base.source_position = builtin_source_position;
10836 expr_statement->expression.expression = call;
10838 statement_t *statement = entity->function.statement;
10839 assert(statement->kind == STATEMENT_COMPOUND);
10840 compound_statement_t *compounds = &statement->compound;
10842 expr_statement->base.next = compounds->statements;
10843 compounds->statements = expr_statement;
10848 lookahead_bufpos = 0;
10849 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10852 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10853 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10854 parse_translation_unit();
10855 complete_incomplete_arrays();
10856 DEL_ARR_F(incomplete_arrays);
10857 incomplete_arrays = NULL;
10861 * Initialize the parser.
10863 void init_parser(void)
10865 sym_anonymous = symbol_table_insert("<anonymous>");
10867 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10869 init_expression_parsers();
10870 obstack_init(&temp_obst);
10872 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10873 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10877 * Terminate the parser.
10879 void exit_parser(void)
10881 obstack_free(&temp_obst, NULL);