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: \
231 case T_FLOATINGPOINT: \
232 case T_FLOATINGPOINT_HEXADECIMAL: \
234 case T_INTEGER_HEXADECIMAL: \
235 case T_INTEGER_OCTAL: \
238 case T_STRING_LITERAL: \
239 case T_WIDE_CHARACTER_CONSTANT: \
240 case T_WIDE_STRING_LITERAL: \
241 case T___FUNCDNAME__: \
242 case T___FUNCSIG__: \
243 case T___FUNCTION__: \
244 case T___PRETTY_FUNCTION__: \
245 case T___alignof__: \
246 case T___builtin_classify_type: \
247 case T___builtin_constant_p: \
248 case T___builtin_isgreater: \
249 case T___builtin_isgreaterequal: \
250 case T___builtin_isless: \
251 case T___builtin_islessequal: \
252 case T___builtin_islessgreater: \
253 case T___builtin_isunordered: \
254 case T___builtin_offsetof: \
255 case T___builtin_va_arg: \
256 case T___builtin_va_copy: \
257 case T___builtin_va_start: \
268 * Returns the size of a statement node.
270 * @param kind the statement kind
272 static size_t get_statement_struct_size(statement_kind_t kind)
274 static const size_t sizes[] = {
275 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
276 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
277 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
278 [STATEMENT_RETURN] = sizeof(return_statement_t),
279 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
280 [STATEMENT_IF] = sizeof(if_statement_t),
281 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
282 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
283 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
284 [STATEMENT_BREAK] = sizeof(statement_base_t),
285 [STATEMENT_GOTO] = sizeof(goto_statement_t),
286 [STATEMENT_LABEL] = sizeof(label_statement_t),
287 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
288 [STATEMENT_WHILE] = sizeof(while_statement_t),
289 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
290 [STATEMENT_FOR] = sizeof(for_statement_t),
291 [STATEMENT_ASM] = sizeof(asm_statement_t),
292 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
293 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
295 assert(kind < lengthof(sizes));
296 assert(sizes[kind] != 0);
301 * Returns the size of an expression node.
303 * @param kind the expression kind
305 static size_t get_expression_struct_size(expression_kind_t kind)
307 static const size_t sizes[] = {
308 [EXPR_INVALID] = sizeof(expression_base_t),
309 [EXPR_REFERENCE] = sizeof(reference_expression_t),
310 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
311 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
312 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
313 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
314 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
315 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
316 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
317 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
318 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
319 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
320 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
321 [EXPR_CALL] = sizeof(call_expression_t),
322 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
323 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
324 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
325 [EXPR_SELECT] = sizeof(select_expression_t),
326 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
327 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
328 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
329 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
330 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
331 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
332 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
333 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
334 [EXPR_VA_START] = sizeof(va_start_expression_t),
335 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
336 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
337 [EXPR_STATEMENT] = sizeof(statement_expression_t),
338 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
340 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
341 return sizes[EXPR_UNARY_FIRST];
343 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
344 return sizes[EXPR_BINARY_FIRST];
346 assert(kind < lengthof(sizes));
347 assert(sizes[kind] != 0);
352 * Allocate a statement node of given kind and initialize all
353 * fields with zero. Sets its source position to the position
354 * of the current token.
356 static statement_t *allocate_statement_zero(statement_kind_t kind)
358 size_t size = get_statement_struct_size(kind);
359 statement_t *res = allocate_ast_zero(size);
361 res->base.kind = kind;
362 res->base.parent = current_parent;
363 res->base.source_position = token.source_position;
368 * Allocate an expression node of given kind and initialize all
371 * @param kind the kind of the expression to allocate
373 static expression_t *allocate_expression_zero(expression_kind_t kind)
375 size_t size = get_expression_struct_size(kind);
376 expression_t *res = allocate_ast_zero(size);
378 res->base.kind = kind;
379 res->base.type = type_error_type;
380 res->base.source_position = token.source_position;
385 * Creates a new invalid expression at the source position
386 * of the current token.
388 static expression_t *create_invalid_expression(void)
390 return allocate_expression_zero(EXPR_INVALID);
394 * Creates a new invalid statement.
396 static statement_t *create_invalid_statement(void)
398 return allocate_statement_zero(STATEMENT_INVALID);
402 * Allocate a new empty statement.
404 static statement_t *create_empty_statement(void)
406 return allocate_statement_zero(STATEMENT_EMPTY);
409 static function_parameter_t *allocate_parameter(type_t *const type)
411 function_parameter_t *const param
412 = obstack_alloc(type_obst, sizeof(*param));
413 memset(param, 0, sizeof(*param));
419 * Returns the size of an initializer node.
421 * @param kind the initializer kind
423 static size_t get_initializer_size(initializer_kind_t kind)
425 static const size_t sizes[] = {
426 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
427 [INITIALIZER_STRING] = sizeof(initializer_string_t),
428 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
429 [INITIALIZER_LIST] = sizeof(initializer_list_t),
430 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
432 assert(kind < lengthof(sizes));
433 assert(sizes[kind] != 0);
438 * Allocate an initializer node of given kind and initialize all
441 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
443 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
450 * Returns the index of the top element of the environment stack.
452 static size_t environment_top(void)
454 return ARR_LEN(environment_stack);
458 * Returns the index of the top element of the global label stack.
460 static size_t label_top(void)
462 return ARR_LEN(label_stack);
466 * Return the next token.
468 static inline void next_token(void)
470 token = lookahead_buffer[lookahead_bufpos];
471 lookahead_buffer[lookahead_bufpos] = lexer_token;
474 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
477 print_token(stderr, &token);
478 fprintf(stderr, "\n");
482 static inline bool next_if(int const type)
484 if (token.type == type) {
493 * Return the next token with a given lookahead.
495 static inline const token_t *look_ahead(size_t num)
497 assert(0 < num && num <= MAX_LOOKAHEAD);
498 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
499 return &lookahead_buffer[pos];
503 * Adds a token type to the token type anchor set (a multi-set).
505 static void add_anchor_token(int token_type)
507 assert(0 <= token_type && token_type < T_LAST_TOKEN);
508 ++token_anchor_set[token_type];
512 * Set the number of tokens types of the given type
513 * to zero and return the old count.
515 static int save_and_reset_anchor_state(int token_type)
517 assert(0 <= token_type && token_type < T_LAST_TOKEN);
518 int count = token_anchor_set[token_type];
519 token_anchor_set[token_type] = 0;
524 * Restore the number of token types to the given count.
526 static void restore_anchor_state(int token_type, int count)
528 assert(0 <= token_type && token_type < T_LAST_TOKEN);
529 token_anchor_set[token_type] = count;
533 * Remove a token type from the token type anchor set (a multi-set).
535 static void rem_anchor_token(int token_type)
537 assert(0 <= token_type && token_type < T_LAST_TOKEN);
538 assert(token_anchor_set[token_type] != 0);
539 --token_anchor_set[token_type];
543 * Return true if the token type of the current token is
546 static bool at_anchor(void)
550 return token_anchor_set[token.type];
554 * Eat tokens until a matching token type is found.
556 static void eat_until_matching_token(int type)
560 case '(': end_token = ')'; break;
561 case '{': end_token = '}'; break;
562 case '[': end_token = ']'; break;
563 default: end_token = type; break;
566 unsigned parenthesis_count = 0;
567 unsigned brace_count = 0;
568 unsigned bracket_count = 0;
569 while (token.type != end_token ||
570 parenthesis_count != 0 ||
572 bracket_count != 0) {
573 switch (token.type) {
575 case '(': ++parenthesis_count; break;
576 case '{': ++brace_count; break;
577 case '[': ++bracket_count; break;
580 if (parenthesis_count > 0)
590 if (bracket_count > 0)
593 if (token.type == end_token &&
594 parenthesis_count == 0 &&
608 * Eat input tokens until an anchor is found.
610 static void eat_until_anchor(void)
612 while (token_anchor_set[token.type] == 0) {
613 if (token.type == '(' || token.type == '{' || token.type == '[')
614 eat_until_matching_token(token.type);
620 * Eat a whole block from input tokens.
622 static void eat_block(void)
624 eat_until_matching_token('{');
628 #define eat(token_type) (assert(token.type == (token_type)), next_token())
631 * Report a parse error because an expected token was not found.
634 #if defined __GNUC__ && __GNUC__ >= 4
635 __attribute__((sentinel))
637 void parse_error_expected(const char *message, ...)
639 if (message != NULL) {
640 errorf(HERE, "%s", message);
643 va_start(ap, message);
644 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
649 * Report an incompatible type.
651 static void type_error_incompatible(const char *msg,
652 const source_position_t *source_position, type_t *type1, type_t *type2)
654 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
659 * Expect the current token is the expected token.
660 * If not, generate an error, eat the current statement,
661 * and goto the 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' must 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_expression_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 = 0;
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)) {
2638 type = parse_typename();
2641 expression = parse_expression();
2642 type = revert_automatic_type_conversion(expression);
2646 in_type_prop = old_type_prop;
2647 in_gcc_extension = old_gcc_extension;
2649 rem_anchor_token(')');
2650 expect(')', end_error);
2652 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2653 typeof_type->typeoft.expression = expression;
2654 typeof_type->typeoft.typeof_type = type;
2661 typedef enum specifiers_t {
2662 SPECIFIER_SIGNED = 1 << 0,
2663 SPECIFIER_UNSIGNED = 1 << 1,
2664 SPECIFIER_LONG = 1 << 2,
2665 SPECIFIER_INT = 1 << 3,
2666 SPECIFIER_DOUBLE = 1 << 4,
2667 SPECIFIER_CHAR = 1 << 5,
2668 SPECIFIER_WCHAR_T = 1 << 6,
2669 SPECIFIER_SHORT = 1 << 7,
2670 SPECIFIER_LONG_LONG = 1 << 8,
2671 SPECIFIER_FLOAT = 1 << 9,
2672 SPECIFIER_BOOL = 1 << 10,
2673 SPECIFIER_VOID = 1 << 11,
2674 SPECIFIER_INT8 = 1 << 12,
2675 SPECIFIER_INT16 = 1 << 13,
2676 SPECIFIER_INT32 = 1 << 14,
2677 SPECIFIER_INT64 = 1 << 15,
2678 SPECIFIER_INT128 = 1 << 16,
2679 SPECIFIER_COMPLEX = 1 << 17,
2680 SPECIFIER_IMAGINARY = 1 << 18,
2683 static type_t *create_builtin_type(symbol_t *const symbol,
2684 type_t *const real_type)
2686 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2687 type->builtin.symbol = symbol;
2688 type->builtin.real_type = real_type;
2689 return identify_new_type(type);
2692 static type_t *get_typedef_type(symbol_t *symbol)
2694 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2695 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2698 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2699 type->typedeft.typedefe = &entity->typedefe;
2704 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2706 expect('(', end_error);
2708 attribute_property_argument_t *property
2709 = allocate_ast_zero(sizeof(*property));
2712 if (token.type != T_IDENTIFIER) {
2713 parse_error_expected("while parsing property declspec",
2714 T_IDENTIFIER, NULL);
2719 symbol_t *symbol = token.symbol;
2721 if (strcmp(symbol->string, "put") == 0) {
2723 } else if (strcmp(symbol->string, "get") == 0) {
2726 errorf(HERE, "expected put or get in property declspec");
2729 expect('=', end_error);
2730 if (token.type != T_IDENTIFIER) {
2731 parse_error_expected("while parsing property declspec",
2732 T_IDENTIFIER, NULL);
2736 property->put_symbol = token.symbol;
2738 property->get_symbol = token.symbol;
2741 } while (next_if(','));
2743 attribute->a.property = property;
2745 expect(')', end_error);
2751 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2753 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2754 if (next_if(T_restrict)) {
2755 kind = ATTRIBUTE_MS_RESTRICT;
2756 } else if (token.type == T_IDENTIFIER) {
2757 const char *name = token.symbol->string;
2759 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2761 const char *attribute_name = get_attribute_name(k);
2762 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2768 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2769 warningf(HERE, "unknown __declspec '%s' ignored", name);
2772 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2776 attribute_t *attribute = allocate_attribute_zero(kind);
2778 if (kind == ATTRIBUTE_MS_PROPERTY) {
2779 return parse_attribute_ms_property(attribute);
2782 /* parse arguments */
2784 attribute->a.arguments = parse_attribute_arguments();
2789 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2793 expect('(', end_error);
2798 add_anchor_token(')');
2800 attribute_t **anchor = &first;
2802 while (*anchor != NULL)
2803 anchor = &(*anchor)->next;
2805 attribute_t *attribute
2806 = parse_microsoft_extended_decl_modifier_single();
2807 if (attribute == NULL)
2810 *anchor = attribute;
2811 anchor = &attribute->next;
2812 } while (next_if(','));
2814 rem_anchor_token(')');
2815 expect(')', end_error);
2819 rem_anchor_token(')');
2823 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2825 entity_t *entity = allocate_entity_zero(kind);
2826 entity->base.source_position = *HERE;
2827 entity->base.symbol = symbol;
2828 if (is_declaration(entity)) {
2829 entity->declaration.type = type_error_type;
2830 entity->declaration.implicit = true;
2831 } else if (kind == ENTITY_TYPEDEF) {
2832 entity->typedefe.type = type_error_type;
2833 entity->typedefe.builtin = true;
2835 if (kind != ENTITY_COMPOUND_MEMBER)
2836 record_entity(entity, false);
2840 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2842 type_t *type = NULL;
2843 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2844 unsigned type_specifiers = 0;
2845 bool newtype = false;
2846 bool saw_error = false;
2847 bool old_gcc_extension = in_gcc_extension;
2849 specifiers->source_position = token.source_position;
2852 specifiers->attributes = parse_attributes(specifiers->attributes);
2854 switch (token.type) {
2856 #define MATCH_STORAGE_CLASS(token, class) \
2858 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2859 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2861 specifiers->storage_class = class; \
2862 if (specifiers->thread_local) \
2863 goto check_thread_storage_class; \
2867 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2868 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2869 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2870 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2871 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2874 specifiers->attributes
2875 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2879 if (specifiers->thread_local) {
2880 errorf(HERE, "duplicate '__thread'");
2882 specifiers->thread_local = true;
2883 check_thread_storage_class:
2884 switch (specifiers->storage_class) {
2885 case STORAGE_CLASS_EXTERN:
2886 case STORAGE_CLASS_NONE:
2887 case STORAGE_CLASS_STATIC:
2891 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
2892 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
2893 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
2894 wrong_thread_stoarge_class:
2895 errorf(HERE, "'__thread' used with '%s'", wrong);
2902 /* type qualifiers */
2903 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2905 qualifiers |= qualifier; \
2909 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2910 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2911 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2912 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2913 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2914 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2915 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2916 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2918 case T___extension__:
2920 in_gcc_extension = true;
2923 /* type specifiers */
2924 #define MATCH_SPECIFIER(token, specifier, name) \
2926 if (type_specifiers & specifier) { \
2927 errorf(HERE, "multiple " name " type specifiers given"); \
2929 type_specifiers |= specifier; \
2934 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2935 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2936 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2937 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2938 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2939 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2940 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2941 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2942 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2943 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2944 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2945 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2946 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2947 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2948 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2949 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2950 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2951 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2955 specifiers->is_inline = true;
2959 case T__forceinline:
2961 specifiers->modifiers |= DM_FORCEINLINE;
2966 if (type_specifiers & SPECIFIER_LONG_LONG) {
2967 errorf(HERE, "multiple type specifiers given");
2968 } else if (type_specifiers & SPECIFIER_LONG) {
2969 type_specifiers |= SPECIFIER_LONG_LONG;
2971 type_specifiers |= SPECIFIER_LONG;
2976 #define CHECK_DOUBLE_TYPE() \
2977 if ( type != NULL) \
2978 errorf(HERE, "multiple data types in declaration specifiers");
2981 CHECK_DOUBLE_TYPE();
2982 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2984 type->compound.compound = parse_compound_type_specifier(true);
2987 CHECK_DOUBLE_TYPE();
2988 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2989 type->compound.compound = parse_compound_type_specifier(false);
2992 CHECK_DOUBLE_TYPE();
2993 type = parse_enum_specifier();
2996 CHECK_DOUBLE_TYPE();
2997 type = parse_typeof();
2999 case T___builtin_va_list:
3000 CHECK_DOUBLE_TYPE();
3001 type = duplicate_type(type_valist);
3005 case T_IDENTIFIER: {
3006 /* only parse identifier if we haven't found a type yet */
3007 if (type != NULL || type_specifiers != 0) {
3008 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3009 * declaration, so it doesn't generate errors about expecting '(' or
3011 switch (look_ahead(1)->type) {
3018 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3022 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3027 goto finish_specifiers;
3031 type_t *const typedef_type = get_typedef_type(token.symbol);
3032 if (typedef_type == NULL) {
3033 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3034 * declaration, so it doesn't generate 'implicit int' followed by more
3035 * errors later on. */
3036 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3042 errorf(HERE, "%K does not name a type", &token);
3045 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3047 type = allocate_type_zero(TYPE_TYPEDEF);
3048 type->typedeft.typedefe = &entity->typedefe;
3052 if (la1_type == '&' || la1_type == '*')
3053 goto finish_specifiers;
3058 goto finish_specifiers;
3063 type = typedef_type;
3067 /* function specifier */
3069 goto finish_specifiers;
3074 specifiers->attributes = parse_attributes(specifiers->attributes);
3076 in_gcc_extension = old_gcc_extension;
3078 if (type == NULL || (saw_error && type_specifiers != 0)) {
3079 atomic_type_kind_t atomic_type;
3081 /* match valid basic types */
3082 switch (type_specifiers) {
3083 case SPECIFIER_VOID:
3084 atomic_type = ATOMIC_TYPE_VOID;
3086 case SPECIFIER_WCHAR_T:
3087 atomic_type = ATOMIC_TYPE_WCHAR_T;
3089 case SPECIFIER_CHAR:
3090 atomic_type = ATOMIC_TYPE_CHAR;
3092 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3093 atomic_type = ATOMIC_TYPE_SCHAR;
3095 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3096 atomic_type = ATOMIC_TYPE_UCHAR;
3098 case SPECIFIER_SHORT:
3099 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3100 case SPECIFIER_SHORT | SPECIFIER_INT:
3101 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3102 atomic_type = ATOMIC_TYPE_SHORT;
3104 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3105 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3106 atomic_type = ATOMIC_TYPE_USHORT;
3109 case SPECIFIER_SIGNED:
3110 case SPECIFIER_SIGNED | SPECIFIER_INT:
3111 atomic_type = ATOMIC_TYPE_INT;
3113 case SPECIFIER_UNSIGNED:
3114 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3115 atomic_type = ATOMIC_TYPE_UINT;
3117 case SPECIFIER_LONG:
3118 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3119 case SPECIFIER_LONG | SPECIFIER_INT:
3120 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3121 atomic_type = ATOMIC_TYPE_LONG;
3123 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3124 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3125 atomic_type = ATOMIC_TYPE_ULONG;
3128 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3129 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3130 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3131 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3133 atomic_type = ATOMIC_TYPE_LONGLONG;
3134 goto warn_about_long_long;
3136 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3137 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3139 atomic_type = ATOMIC_TYPE_ULONGLONG;
3140 warn_about_long_long:
3141 if (warning.long_long) {
3142 warningf(&specifiers->source_position,
3143 "ISO C90 does not support 'long long'");
3147 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3148 atomic_type = unsigned_int8_type_kind;
3151 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3152 atomic_type = unsigned_int16_type_kind;
3155 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3156 atomic_type = unsigned_int32_type_kind;
3159 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3160 atomic_type = unsigned_int64_type_kind;
3163 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3164 atomic_type = unsigned_int128_type_kind;
3167 case SPECIFIER_INT8:
3168 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3169 atomic_type = int8_type_kind;
3172 case SPECIFIER_INT16:
3173 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3174 atomic_type = int16_type_kind;
3177 case SPECIFIER_INT32:
3178 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3179 atomic_type = int32_type_kind;
3182 case SPECIFIER_INT64:
3183 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3184 atomic_type = int64_type_kind;
3187 case SPECIFIER_INT128:
3188 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3189 atomic_type = int128_type_kind;
3192 case SPECIFIER_FLOAT:
3193 atomic_type = ATOMIC_TYPE_FLOAT;
3195 case SPECIFIER_DOUBLE:
3196 atomic_type = ATOMIC_TYPE_DOUBLE;
3198 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3199 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3201 case SPECIFIER_BOOL:
3202 atomic_type = ATOMIC_TYPE_BOOL;
3204 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3205 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3206 atomic_type = ATOMIC_TYPE_FLOAT;
3208 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3209 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3210 atomic_type = ATOMIC_TYPE_DOUBLE;
3212 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3213 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3214 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3217 /* invalid specifier combination, give an error message */
3218 if (type_specifiers == 0) {
3222 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3223 if (!(c_mode & _CXX) && !strict_mode) {
3224 if (warning.implicit_int) {
3225 warningf(HERE, "no type specifiers in declaration, using 'int'");
3227 atomic_type = ATOMIC_TYPE_INT;
3230 errorf(HERE, "no type specifiers given in declaration");
3232 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3233 (type_specifiers & SPECIFIER_UNSIGNED)) {
3234 errorf(HERE, "signed and unsigned specifiers given");
3235 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3236 errorf(HERE, "only integer types can be signed or unsigned");
3238 errorf(HERE, "multiple datatypes in declaration");
3243 if (type_specifiers & SPECIFIER_COMPLEX) {
3244 type = allocate_type_zero(TYPE_COMPLEX);
3245 type->complex.akind = atomic_type;
3246 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3247 type = allocate_type_zero(TYPE_IMAGINARY);
3248 type->imaginary.akind = atomic_type;
3250 type = allocate_type_zero(TYPE_ATOMIC);
3251 type->atomic.akind = atomic_type;
3254 } else if (type_specifiers != 0) {
3255 errorf(HERE, "multiple datatypes in declaration");
3258 /* FIXME: check type qualifiers here */
3259 type->base.qualifiers = qualifiers;
3262 type = identify_new_type(type);
3264 type = typehash_insert(type);
3267 if (specifiers->attributes != NULL)
3268 type = handle_type_attributes(specifiers->attributes, type);
3269 specifiers->type = type;
3273 specifiers->type = type_error_type;
3276 static type_qualifiers_t parse_type_qualifiers(void)
3278 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3281 switch (token.type) {
3282 /* type qualifiers */
3283 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3284 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3285 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3286 /* microsoft extended type modifiers */
3287 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3288 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3289 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3290 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3291 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3300 * Parses an K&R identifier list
3302 static void parse_identifier_list(scope_t *scope)
3305 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3306 entity->base.source_position = token.source_position;
3307 entity->base.namespc = NAMESPACE_NORMAL;
3308 entity->base.symbol = token.symbol;
3309 /* a K&R parameter has no type, yet */
3313 append_entity(scope, entity);
3314 } while (next_if(',') && token.type == T_IDENTIFIER);
3317 static entity_t *parse_parameter(void)
3319 declaration_specifiers_t specifiers;
3320 memset(&specifiers, 0, sizeof(specifiers));
3322 parse_declaration_specifiers(&specifiers);
3324 entity_t *entity = parse_declarator(&specifiers,
3325 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3326 anonymous_entity = NULL;
3330 static void semantic_parameter_incomplete(const entity_t *entity)
3332 assert(entity->kind == ENTITY_PARAMETER);
3334 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3335 * list in a function declarator that is part of a
3336 * definition of that function shall not have
3337 * incomplete type. */
3338 type_t *type = skip_typeref(entity->declaration.type);
3339 if (is_type_incomplete(type)) {
3340 errorf(&entity->base.source_position,
3341 "parameter '%#T' has incomplete type",
3342 entity->declaration.type, entity->base.symbol);
3346 static bool has_parameters(void)
3348 /* func(void) is not a parameter */
3349 if (token.type == T_IDENTIFIER) {
3350 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3353 if (entity->kind != ENTITY_TYPEDEF)
3355 if (skip_typeref(entity->typedefe.type) != type_void)
3357 } else if (token.type != T_void) {
3360 if (look_ahead(1)->type != ')')
3367 * Parses function type parameters (and optionally creates variable_t entities
3368 * for them in a scope)
3370 static void parse_parameters(function_type_t *type, scope_t *scope)
3373 add_anchor_token(')');
3374 int saved_comma_state = save_and_reset_anchor_state(',');
3376 if (token.type == T_IDENTIFIER &&
3377 !is_typedef_symbol(token.symbol)) {
3378 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3379 if (la1_type == ',' || la1_type == ')') {
3380 type->kr_style_parameters = true;
3381 parse_identifier_list(scope);
3382 goto parameters_finished;
3386 if (token.type == ')') {
3387 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3388 if (!(c_mode & _CXX))
3389 type->unspecified_parameters = true;
3390 goto parameters_finished;
3393 if (has_parameters()) {
3394 function_parameter_t **anchor = &type->parameters;
3396 switch (token.type) {
3399 type->variadic = true;
3400 goto parameters_finished;
3403 case T___extension__:
3406 entity_t *entity = parse_parameter();
3407 if (entity->kind == ENTITY_TYPEDEF) {
3408 errorf(&entity->base.source_position,
3409 "typedef not allowed as function parameter");
3412 assert(is_declaration(entity));
3414 semantic_parameter_incomplete(entity);
3416 function_parameter_t *const parameter =
3417 allocate_parameter(entity->declaration.type);
3419 if (scope != NULL) {
3420 append_entity(scope, entity);
3423 *anchor = parameter;
3424 anchor = ¶meter->next;
3429 goto parameters_finished;
3431 } while (next_if(','));
3435 parameters_finished:
3436 rem_anchor_token(')');
3437 expect(')', end_error);
3440 restore_anchor_state(',', saved_comma_state);
3443 typedef enum construct_type_kind_t {
3446 CONSTRUCT_REFERENCE,
3449 } construct_type_kind_t;
3451 typedef union construct_type_t construct_type_t;
3453 typedef struct construct_type_base_t {
3454 construct_type_kind_t kind;
3455 construct_type_t *next;
3456 } construct_type_base_t;
3458 typedef struct parsed_pointer_t {
3459 construct_type_base_t base;
3460 type_qualifiers_t type_qualifiers;
3461 variable_t *base_variable; /**< MS __based extension. */
3464 typedef struct parsed_reference_t {
3465 construct_type_base_t base;
3466 } parsed_reference_t;
3468 typedef struct construct_function_type_t {
3469 construct_type_base_t base;
3470 type_t *function_type;
3471 } construct_function_type_t;
3473 typedef struct parsed_array_t {
3474 construct_type_base_t base;
3475 type_qualifiers_t type_qualifiers;
3481 union construct_type_t {
3482 construct_type_kind_t kind;
3483 construct_type_base_t base;
3484 parsed_pointer_t pointer;
3485 parsed_reference_t reference;
3486 construct_function_type_t function;
3487 parsed_array_t array;
3491 static construct_type_t *parse_pointer_declarator(void)
3495 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3496 memset(pointer, 0, sizeof(pointer[0]));
3497 pointer->base.kind = CONSTRUCT_POINTER;
3498 pointer->type_qualifiers = parse_type_qualifiers();
3499 //pointer->base_variable = base_variable;
3501 return (construct_type_t*) pointer;
3504 /* ISO/IEC 14882:1998(E) §8.3.2 */
3505 static construct_type_t *parse_reference_declarator(void)
3509 if (!(c_mode & _CXX))
3510 errorf(HERE, "references are only available for C++");
3512 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->reference));
3513 parsed_reference_t *reference = &cons->reference;
3514 memset(reference, 0, sizeof(*reference));
3515 cons->kind = CONSTRUCT_REFERENCE;
3521 static construct_type_t *parse_array_declarator(void)
3524 add_anchor_token(']');
3526 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->array));
3527 parsed_array_t *array = &cons->array;
3528 memset(array, 0, sizeof(*array));
3529 cons->kind = CONSTRUCT_ARRAY;
3531 bool is_static = next_if(T_static);
3533 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3536 is_static = next_if(T_static);
3538 array->type_qualifiers = type_qualifiers;
3539 array->is_static = is_static;
3541 expression_t *size = NULL;
3542 if (token.type == '*' && look_ahead(1)->type == ']') {
3543 array->is_variable = true;
3545 } else if (token.type != ']') {
3546 size = parse_assignment_expression();
3548 /* §6.7.5.2:1 Array size must have integer type */
3549 type_t *const orig_type = size->base.type;
3550 type_t *const type = skip_typeref(orig_type);
3551 if (!is_type_integer(type) && is_type_valid(type)) {
3552 errorf(&size->base.source_position,
3553 "array size '%E' must have integer type but has type '%T'",
3558 mark_vars_read(size, NULL);
3561 if (is_static && size == NULL)
3562 errorf(HERE, "static array parameters require a size");
3564 rem_anchor_token(']');
3565 expect(']', end_error);
3572 static construct_type_t *parse_function_declarator(scope_t *scope)
3574 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3575 function_type_t *ftype = &type->function;
3577 ftype->linkage = current_linkage;
3578 ftype->calling_convention = CC_DEFAULT;
3580 parse_parameters(ftype, scope);
3582 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->function));
3583 construct_function_type_t *function = &cons->function;
3584 memset(function, 0, sizeof(*function));
3585 cons->kind = CONSTRUCT_FUNCTION;
3586 function->function_type = type;
3591 typedef struct parse_declarator_env_t {
3592 bool may_be_abstract : 1;
3593 bool must_be_abstract : 1;
3594 decl_modifiers_t modifiers;
3596 source_position_t source_position;
3598 attribute_t *attributes;
3599 } parse_declarator_env_t;
3602 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3604 /* construct a single linked list of construct_type_t's which describe
3605 * how to construct the final declarator type */
3606 construct_type_t *first = NULL;
3607 construct_type_t **anchor = &first;
3609 env->attributes = parse_attributes(env->attributes);
3612 construct_type_t *type;
3613 //variable_t *based = NULL; /* MS __based extension */
3614 switch (token.type) {
3616 type = parse_reference_declarator();
3620 panic("based not supported anymore");
3625 type = parse_pointer_declarator();
3629 goto ptr_operator_end;
3633 anchor = &type->base.next;
3635 /* TODO: find out if this is correct */
3636 env->attributes = parse_attributes(env->attributes);
3640 construct_type_t *inner_types = NULL;
3642 switch (token.type) {
3644 if (env->must_be_abstract) {
3645 errorf(HERE, "no identifier expected in typename");
3647 env->symbol = token.symbol;
3648 env->source_position = token.source_position;
3653 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3654 * interpreted as ``function with no parameter specification'', rather
3655 * than redundant parentheses around the omitted identifier. */
3656 if (look_ahead(1)->type != ')') {
3658 add_anchor_token(')');
3659 inner_types = parse_inner_declarator(env);
3660 if (inner_types != NULL) {
3661 /* All later declarators only modify the return type */
3662 env->must_be_abstract = true;
3664 rem_anchor_token(')');
3665 expect(')', end_error);
3669 if (env->may_be_abstract)
3671 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3676 construct_type_t **const p = anchor;
3679 construct_type_t *type;
3680 switch (token.type) {
3682 scope_t *scope = NULL;
3683 if (!env->must_be_abstract) {
3684 scope = &env->parameters;
3687 type = parse_function_declarator(scope);
3691 type = parse_array_declarator();
3694 goto declarator_finished;
3697 /* insert in the middle of the list (at p) */
3698 type->base.next = *p;
3701 anchor = &type->base.next;
3704 declarator_finished:
3705 /* append inner_types at the end of the list, we don't to set anchor anymore
3706 * as it's not needed anymore */
3707 *anchor = inner_types;
3714 static type_t *construct_declarator_type(construct_type_t *construct_list,
3717 construct_type_t *iter = construct_list;
3718 for (; iter != NULL; iter = iter->base.next) {
3719 switch (iter->kind) {
3720 case CONSTRUCT_INVALID:
3722 case CONSTRUCT_FUNCTION: {
3723 construct_function_type_t *function = &iter->function;
3724 type_t *function_type = function->function_type;
3726 function_type->function.return_type = type;
3728 type_t *skipped_return_type = skip_typeref(type);
3730 if (is_type_function(skipped_return_type)) {
3731 errorf(HERE, "function returning function is not allowed");
3732 } else if (is_type_array(skipped_return_type)) {
3733 errorf(HERE, "function returning array is not allowed");
3735 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3737 "type qualifiers in return type of function type are meaningless");
3741 /* The function type was constructed earlier. Freeing it here will
3742 * destroy other types. */
3743 type = typehash_insert(function_type);
3747 case CONSTRUCT_POINTER: {
3748 if (is_type_reference(skip_typeref(type)))
3749 errorf(HERE, "cannot declare a pointer to reference");
3751 parsed_pointer_t *pointer = &iter->pointer;
3752 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3756 case CONSTRUCT_REFERENCE:
3757 if (is_type_reference(skip_typeref(type)))
3758 errorf(HERE, "cannot declare a reference to reference");
3760 type = make_reference_type(type);
3763 case CONSTRUCT_ARRAY: {
3764 if (is_type_reference(skip_typeref(type)))
3765 errorf(HERE, "cannot declare an array of references");
3767 parsed_array_t *array = &iter->array;
3768 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3770 expression_t *size_expression = array->size;
3771 if (size_expression != NULL) {
3773 = create_implicit_cast(size_expression, type_size_t);
3776 array_type->base.qualifiers = array->type_qualifiers;
3777 array_type->array.element_type = type;
3778 array_type->array.is_static = array->is_static;
3779 array_type->array.is_variable = array->is_variable;
3780 array_type->array.size_expression = size_expression;
3782 if (size_expression != NULL) {
3783 if (is_constant_expression(size_expression)) {
3785 = fold_constant_to_int(size_expression);
3786 array_type->array.size = size;
3787 array_type->array.size_constant = true;
3788 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3789 * have a value greater than zero. */
3791 if (size < 0 || !GNU_MODE) {
3792 errorf(&size_expression->base.source_position,
3793 "size of array must be greater than zero");
3794 } else if (warning.other) {
3795 warningf(&size_expression->base.source_position,
3796 "zero length arrays are a GCC extension");
3800 array_type->array.is_vla = true;
3804 type_t *skipped_type = skip_typeref(type);
3806 if (is_type_incomplete(skipped_type)) {
3807 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
3808 } else if (is_type_function(skipped_type)) {
3809 errorf(HERE, "array of functions is not allowed");
3811 type = identify_new_type(array_type);
3815 internal_errorf(HERE, "invalid type construction found");
3821 static type_t *automatic_type_conversion(type_t *orig_type);
3823 static type_t *semantic_parameter(const source_position_t *pos,
3825 const declaration_specifiers_t *specifiers,
3828 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3829 * shall be adjusted to ``qualified pointer to type'',
3831 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3832 * type'' shall be adjusted to ``pointer to function
3833 * returning type'', as in 6.3.2.1. */
3834 type = automatic_type_conversion(type);
3836 if (specifiers->is_inline && is_type_valid(type)) {
3837 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3840 /* §6.9.1:6 The declarations in the declaration list shall contain
3841 * no storage-class specifier other than register and no
3842 * initializations. */
3843 if (specifiers->thread_local || (
3844 specifiers->storage_class != STORAGE_CLASS_NONE &&
3845 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3847 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3850 /* delay test for incomplete type, because we might have (void)
3851 * which is legal but incomplete... */
3856 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3857 declarator_flags_t flags)
3859 parse_declarator_env_t env;
3860 memset(&env, 0, sizeof(env));
3861 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3863 construct_type_t *construct_type = parse_inner_declarator(&env);
3865 construct_declarator_type(construct_type, specifiers->type);
3866 type_t *type = skip_typeref(orig_type);
3868 if (construct_type != NULL) {
3869 obstack_free(&temp_obst, construct_type);
3872 attribute_t *attributes = parse_attributes(env.attributes);
3873 /* append (shared) specifier attribute behind attributes of this
3875 attribute_t **anchor = &attributes;
3876 while (*anchor != NULL)
3877 anchor = &(*anchor)->next;
3878 *anchor = specifiers->attributes;
3881 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3882 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3883 entity->base.symbol = env.symbol;
3884 entity->base.source_position = env.source_position;
3885 entity->typedefe.type = orig_type;
3887 if (anonymous_entity != NULL) {
3888 if (is_type_compound(type)) {
3889 assert(anonymous_entity->compound.alias == NULL);
3890 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3891 anonymous_entity->kind == ENTITY_UNION);
3892 anonymous_entity->compound.alias = entity;
3893 anonymous_entity = NULL;
3894 } else if (is_type_enum(type)) {
3895 assert(anonymous_entity->enume.alias == NULL);
3896 assert(anonymous_entity->kind == ENTITY_ENUM);
3897 anonymous_entity->enume.alias = entity;
3898 anonymous_entity = NULL;
3902 /* create a declaration type entity */
3903 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3904 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3906 if (env.symbol != NULL) {
3907 if (specifiers->is_inline && is_type_valid(type)) {
3908 errorf(&env.source_position,
3909 "compound member '%Y' declared 'inline'", env.symbol);
3912 if (specifiers->thread_local ||
3913 specifiers->storage_class != STORAGE_CLASS_NONE) {
3914 errorf(&env.source_position,
3915 "compound member '%Y' must have no storage class",
3919 } else if (flags & DECL_IS_PARAMETER) {
3920 orig_type = semantic_parameter(&env.source_position, orig_type,
3921 specifiers, env.symbol);
3923 entity = allocate_entity_zero(ENTITY_PARAMETER);
3924 } else if (is_type_function(type)) {
3925 entity = allocate_entity_zero(ENTITY_FUNCTION);
3927 entity->function.is_inline = specifiers->is_inline;
3928 entity->function.parameters = env.parameters;
3930 if (env.symbol != NULL) {
3931 /* this needs fixes for C++ */
3932 bool in_function_scope = current_function != NULL;
3934 if (specifiers->thread_local || (
3935 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3936 specifiers->storage_class != STORAGE_CLASS_NONE &&
3937 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3939 errorf(&env.source_position,
3940 "invalid storage class for function '%Y'", env.symbol);
3944 entity = allocate_entity_zero(ENTITY_VARIABLE);
3946 entity->variable.thread_local = specifiers->thread_local;
3948 if (env.symbol != NULL) {
3949 if (specifiers->is_inline && is_type_valid(type)) {
3950 errorf(&env.source_position,
3951 "variable '%Y' declared 'inline'", env.symbol);
3954 bool invalid_storage_class = false;
3955 if (current_scope == file_scope) {
3956 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3957 specifiers->storage_class != STORAGE_CLASS_NONE &&
3958 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3959 invalid_storage_class = true;
3962 if (specifiers->thread_local &&
3963 specifiers->storage_class == STORAGE_CLASS_NONE) {
3964 invalid_storage_class = true;
3967 if (invalid_storage_class) {
3968 errorf(&env.source_position,
3969 "invalid storage class for variable '%Y'", env.symbol);
3974 if (env.symbol != NULL) {
3975 entity->base.symbol = env.symbol;
3976 entity->base.source_position = env.source_position;
3978 entity->base.source_position = specifiers->source_position;
3980 entity->base.namespc = NAMESPACE_NORMAL;
3981 entity->declaration.type = orig_type;
3982 entity->declaration.alignment = get_type_alignment(orig_type);
3983 entity->declaration.modifiers = env.modifiers;
3984 entity->declaration.attributes = attributes;
3986 storage_class_t storage_class = specifiers->storage_class;
3987 entity->declaration.declared_storage_class = storage_class;
3989 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3990 storage_class = STORAGE_CLASS_AUTO;
3991 entity->declaration.storage_class = storage_class;
3994 if (attributes != NULL) {
3995 handle_entity_attributes(attributes, entity);
4001 static type_t *parse_abstract_declarator(type_t *base_type)
4003 parse_declarator_env_t env;
4004 memset(&env, 0, sizeof(env));
4005 env.may_be_abstract = true;
4006 env.must_be_abstract = true;
4008 construct_type_t *construct_type = parse_inner_declarator(&env);
4010 type_t *result = construct_declarator_type(construct_type, base_type);
4011 if (construct_type != NULL) {
4012 obstack_free(&temp_obst, construct_type);
4014 result = handle_type_attributes(env.attributes, result);
4020 * Check if the declaration of main is suspicious. main should be a
4021 * function with external linkage, returning int, taking either zero
4022 * arguments, two, or three arguments of appropriate types, ie.
4024 * int main([ int argc, char **argv [, char **env ] ]).
4026 * @param decl the declaration to check
4027 * @param type the function type of the declaration
4029 static void check_main(const entity_t *entity)
4031 const source_position_t *pos = &entity->base.source_position;
4032 if (entity->kind != ENTITY_FUNCTION) {
4033 warningf(pos, "'main' is not a function");
4037 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4038 warningf(pos, "'main' is normally a non-static function");
4041 type_t *type = skip_typeref(entity->declaration.type);
4042 assert(is_type_function(type));
4044 function_type_t *func_type = &type->function;
4045 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4046 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4047 func_type->return_type);
4049 const function_parameter_t *parm = func_type->parameters;
4051 type_t *const first_type = parm->type;
4052 if (!types_compatible(skip_typeref(first_type), type_int)) {
4054 "first argument of 'main' should be 'int', but is '%T'",
4059 type_t *const second_type = parm->type;
4060 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4061 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4065 type_t *const third_type = parm->type;
4066 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4067 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4071 goto warn_arg_count;
4075 warningf(pos, "'main' takes only zero, two or three arguments");
4081 * Check if a symbol is the equal to "main".
4083 static bool is_sym_main(const symbol_t *const sym)
4085 return strcmp(sym->string, "main") == 0;
4088 static void error_redefined_as_different_kind(const source_position_t *pos,
4089 const entity_t *old, entity_kind_t new_kind)
4091 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4092 get_entity_kind_name(old->kind), old->base.symbol,
4093 get_entity_kind_name(new_kind), &old->base.source_position);
4096 static bool is_error_entity(entity_t *const ent)
4098 if (is_declaration(ent)) {
4099 return is_type_valid(skip_typeref(ent->declaration.type));
4100 } else if (ent->kind == ENTITY_TYPEDEF) {
4101 return is_type_valid(skip_typeref(ent->typedefe.type));
4106 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4108 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4109 if (attributes_equal(tattr, attr))
4116 * test wether new_list contains any attributes not included in old_list
4118 static bool has_new_attributes(const attribute_t *old_list,
4119 const attribute_t *new_list)
4121 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4122 if (!contains_attribute(old_list, attr))
4129 * Merge in attributes from an attribute list (probably from a previous
4130 * declaration with the same name). Warning: destroys the old structure
4131 * of the attribute list - don't reuse attributes after this call.
4133 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4136 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4138 if (contains_attribute(decl->attributes, attr))
4141 /* move attribute to new declarations attributes list */
4142 attr->next = decl->attributes;
4143 decl->attributes = attr;
4148 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4149 * for various problems that occur for multiple definitions
4151 entity_t *record_entity(entity_t *entity, const bool is_definition)
4153 const symbol_t *const symbol = entity->base.symbol;
4154 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4155 const source_position_t *pos = &entity->base.source_position;
4157 /* can happen in error cases */
4161 entity_t *const previous_entity = get_entity(symbol, namespc);
4162 /* pushing the same entity twice will break the stack structure */
4163 assert(previous_entity != entity);
4165 if (entity->kind == ENTITY_FUNCTION) {
4166 type_t *const orig_type = entity->declaration.type;
4167 type_t *const type = skip_typeref(orig_type);
4169 assert(is_type_function(type));
4170 if (type->function.unspecified_parameters &&
4171 warning.strict_prototypes &&
4172 previous_entity == NULL) {
4173 warningf(pos, "function declaration '%#T' is not a prototype",
4177 if (warning.main && current_scope == file_scope
4178 && is_sym_main(symbol)) {
4183 if (is_declaration(entity) &&
4184 warning.nested_externs &&
4185 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4186 current_scope != file_scope) {
4187 warningf(pos, "nested extern declaration of '%#T'",
4188 entity->declaration.type, symbol);
4191 if (previous_entity != NULL) {
4192 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4193 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4194 assert(previous_entity->kind == ENTITY_PARAMETER);
4196 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4197 entity->declaration.type, symbol,
4198 previous_entity->declaration.type, symbol,
4199 &previous_entity->base.source_position);
4203 if (previous_entity->base.parent_scope == current_scope) {
4204 if (previous_entity->kind != entity->kind) {
4205 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
4206 error_redefined_as_different_kind(pos, previous_entity,
4211 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4212 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4213 symbol, &previous_entity->base.source_position);
4216 if (previous_entity->kind == ENTITY_TYPEDEF) {
4217 /* TODO: C++ allows this for exactly the same type */
4218 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4219 symbol, &previous_entity->base.source_position);
4223 /* at this point we should have only VARIABLES or FUNCTIONS */
4224 assert(is_declaration(previous_entity) && is_declaration(entity));
4226 declaration_t *const prev_decl = &previous_entity->declaration;
4227 declaration_t *const decl = &entity->declaration;
4229 /* can happen for K&R style declarations */
4230 if (prev_decl->type == NULL &&
4231 previous_entity->kind == ENTITY_PARAMETER &&
4232 entity->kind == ENTITY_PARAMETER) {
4233 prev_decl->type = decl->type;
4234 prev_decl->storage_class = decl->storage_class;
4235 prev_decl->declared_storage_class = decl->declared_storage_class;
4236 prev_decl->modifiers = decl->modifiers;
4237 return previous_entity;
4240 type_t *const orig_type = decl->type;
4241 assert(orig_type != NULL);
4242 type_t *const type = skip_typeref(orig_type);
4243 type_t *const prev_type = skip_typeref(prev_decl->type);
4245 if (!types_compatible(type, prev_type)) {
4247 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4248 orig_type, symbol, prev_decl->type, symbol,
4249 &previous_entity->base.source_position);
4251 unsigned old_storage_class = prev_decl->storage_class;
4253 if (warning.redundant_decls &&
4256 !(prev_decl->modifiers & DM_USED) &&
4257 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4258 warningf(&previous_entity->base.source_position,
4259 "unnecessary static forward declaration for '%#T'",
4260 prev_decl->type, symbol);
4263 storage_class_t new_storage_class = decl->storage_class;
4265 /* pretend no storage class means extern for function
4266 * declarations (except if the previous declaration is neither
4267 * none nor extern) */
4268 if (entity->kind == ENTITY_FUNCTION) {
4269 /* the previous declaration could have unspecified parameters or
4270 * be a typedef, so use the new type */
4271 if (prev_type->function.unspecified_parameters || is_definition)
4272 prev_decl->type = type;
4274 switch (old_storage_class) {
4275 case STORAGE_CLASS_NONE:
4276 old_storage_class = STORAGE_CLASS_EXTERN;
4279 case STORAGE_CLASS_EXTERN:
4280 if (is_definition) {
4281 if (warning.missing_prototypes &&
4282 prev_type->function.unspecified_parameters &&
4283 !is_sym_main(symbol)) {
4284 warningf(pos, "no previous prototype for '%#T'",
4287 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4288 new_storage_class = STORAGE_CLASS_EXTERN;
4295 } else if (is_type_incomplete(prev_type)) {
4296 prev_decl->type = type;
4299 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4300 new_storage_class == STORAGE_CLASS_EXTERN) {
4302 warn_redundant_declaration: ;
4304 = has_new_attributes(prev_decl->attributes,
4306 if (has_new_attrs) {
4307 merge_in_attributes(decl, prev_decl->attributes);
4308 } else if (!is_definition &&
4309 warning.redundant_decls &&
4310 is_type_valid(prev_type) &&
4311 strcmp(previous_entity->base.source_position.input_name,
4312 "<builtin>") != 0) {
4314 "redundant declaration for '%Y' (declared %P)",
4315 symbol, &previous_entity->base.source_position);
4317 } else if (current_function == NULL) {
4318 if (old_storage_class != STORAGE_CLASS_STATIC &&
4319 new_storage_class == STORAGE_CLASS_STATIC) {
4321 "static declaration of '%Y' follows non-static declaration (declared %P)",
4322 symbol, &previous_entity->base.source_position);
4323 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4324 prev_decl->storage_class = STORAGE_CLASS_NONE;
4325 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4327 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4329 goto error_redeclaration;
4330 goto warn_redundant_declaration;
4332 } else if (is_type_valid(prev_type)) {
4333 if (old_storage_class == new_storage_class) {
4334 error_redeclaration:
4335 errorf(pos, "redeclaration of '%Y' (declared %P)",
4336 symbol, &previous_entity->base.source_position);
4339 "redeclaration of '%Y' with different linkage (declared %P)",
4340 symbol, &previous_entity->base.source_position);
4345 prev_decl->modifiers |= decl->modifiers;
4346 if (entity->kind == ENTITY_FUNCTION) {
4347 previous_entity->function.is_inline |= entity->function.is_inline;
4349 return previous_entity;
4352 if (warning.shadow) {
4353 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4354 get_entity_kind_name(entity->kind), symbol,
4355 get_entity_kind_name(previous_entity->kind),
4356 &previous_entity->base.source_position);
4360 if (entity->kind == ENTITY_FUNCTION) {
4361 if (is_definition &&
4362 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4363 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4364 warningf(pos, "no previous prototype for '%#T'",
4365 entity->declaration.type, symbol);
4366 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4367 warningf(pos, "no previous declaration for '%#T'",
4368 entity->declaration.type, symbol);
4371 } else if (warning.missing_declarations &&
4372 entity->kind == ENTITY_VARIABLE &&
4373 current_scope == file_scope) {
4374 declaration_t *declaration = &entity->declaration;
4375 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4376 warningf(pos, "no previous declaration for '%#T'",
4377 declaration->type, symbol);
4382 assert(entity->base.parent_scope == NULL);
4383 assert(current_scope != NULL);
4385 entity->base.parent_scope = current_scope;
4386 entity->base.namespc = NAMESPACE_NORMAL;
4387 environment_push(entity);
4388 append_entity(current_scope, entity);
4393 static void parser_error_multiple_definition(entity_t *entity,
4394 const source_position_t *source_position)
4396 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4397 entity->base.symbol, &entity->base.source_position);
4400 static bool is_declaration_specifier(const token_t *token,
4401 bool only_specifiers_qualifiers)
4403 switch (token->type) {
4408 return is_typedef_symbol(token->symbol);
4410 case T___extension__:
4412 return !only_specifiers_qualifiers;
4419 static void parse_init_declarator_rest(entity_t *entity)
4421 assert(is_declaration(entity));
4422 declaration_t *const declaration = &entity->declaration;
4426 type_t *orig_type = declaration->type;
4427 type_t *type = skip_typeref(orig_type);
4429 if (entity->kind == ENTITY_VARIABLE
4430 && entity->variable.initializer != NULL) {
4431 parser_error_multiple_definition(entity, HERE);
4434 bool must_be_constant = false;
4435 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4436 entity->base.parent_scope == file_scope) {
4437 must_be_constant = true;
4440 if (is_type_function(type)) {
4441 errorf(&entity->base.source_position,
4442 "function '%#T' is initialized like a variable",
4443 orig_type, entity->base.symbol);
4444 orig_type = type_error_type;
4447 parse_initializer_env_t env;
4448 env.type = orig_type;
4449 env.must_be_constant = must_be_constant;
4450 env.entity = entity;
4451 current_init_decl = entity;
4453 initializer_t *initializer = parse_initializer(&env);
4454 current_init_decl = NULL;
4456 if (entity->kind == ENTITY_VARIABLE) {
4457 /* §6.7.5:22 array initializers for arrays with unknown size
4458 * determine the array type size */
4459 declaration->type = env.type;
4460 entity->variable.initializer = initializer;
4464 /* parse rest of a declaration without any declarator */
4465 static void parse_anonymous_declaration_rest(
4466 const declaration_specifiers_t *specifiers)
4469 anonymous_entity = NULL;
4471 if (warning.other) {
4472 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4473 specifiers->thread_local) {
4474 warningf(&specifiers->source_position,
4475 "useless storage class in empty declaration");
4478 type_t *type = specifiers->type;
4479 switch (type->kind) {
4480 case TYPE_COMPOUND_STRUCT:
4481 case TYPE_COMPOUND_UNION: {
4482 if (type->compound.compound->base.symbol == NULL) {
4483 warningf(&specifiers->source_position,
4484 "unnamed struct/union that defines no instances");
4493 warningf(&specifiers->source_position, "empty declaration");
4499 static void check_variable_type_complete(entity_t *ent)
4501 if (ent->kind != ENTITY_VARIABLE)
4504 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4505 * type for the object shall be complete [...] */
4506 declaration_t *decl = &ent->declaration;
4507 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4508 decl->storage_class == STORAGE_CLASS_STATIC)
4511 type_t *const orig_type = decl->type;
4512 type_t *const type = skip_typeref(orig_type);
4513 if (!is_type_incomplete(type))
4516 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4517 * are given length one. */
4518 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4519 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4523 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4524 orig_type, ent->base.symbol);
4528 static void parse_declaration_rest(entity_t *ndeclaration,
4529 const declaration_specifiers_t *specifiers,
4530 parsed_declaration_func finished_declaration,
4531 declarator_flags_t flags)
4533 add_anchor_token(';');
4534 add_anchor_token(',');
4536 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4538 if (token.type == '=') {
4539 parse_init_declarator_rest(entity);
4540 } else if (entity->kind == ENTITY_VARIABLE) {
4541 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4542 * [...] where the extern specifier is explicitly used. */
4543 declaration_t *decl = &entity->declaration;
4544 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4545 type_t *type = decl->type;
4546 if (is_type_reference(skip_typeref(type))) {
4547 errorf(&entity->base.source_position,
4548 "reference '%#T' must be initialized",
4549 type, entity->base.symbol);
4554 check_variable_type_complete(entity);
4559 add_anchor_token('=');
4560 ndeclaration = parse_declarator(specifiers, flags);
4561 rem_anchor_token('=');
4563 expect(';', end_error);
4566 anonymous_entity = NULL;
4567 rem_anchor_token(';');
4568 rem_anchor_token(',');
4571 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4573 symbol_t *symbol = entity->base.symbol;
4574 if (symbol == NULL) {
4575 errorf(HERE, "anonymous declaration not valid as function parameter");
4579 assert(entity->base.namespc == NAMESPACE_NORMAL);
4580 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4581 if (previous_entity == NULL
4582 || previous_entity->base.parent_scope != current_scope) {
4583 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4588 if (is_definition) {
4589 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4592 return record_entity(entity, false);
4595 static void parse_declaration(parsed_declaration_func finished_declaration,
4596 declarator_flags_t flags)
4598 declaration_specifiers_t specifiers;
4599 memset(&specifiers, 0, sizeof(specifiers));
4601 add_anchor_token(';');
4602 parse_declaration_specifiers(&specifiers);
4603 rem_anchor_token(';');
4605 if (token.type == ';') {
4606 parse_anonymous_declaration_rest(&specifiers);
4608 entity_t *entity = parse_declarator(&specifiers, flags);
4609 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4614 static type_t *get_default_promoted_type(type_t *orig_type)
4616 type_t *result = orig_type;
4618 type_t *type = skip_typeref(orig_type);
4619 if (is_type_integer(type)) {
4620 result = promote_integer(type);
4621 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4622 result = type_double;
4628 static void parse_kr_declaration_list(entity_t *entity)
4630 if (entity->kind != ENTITY_FUNCTION)
4633 type_t *type = skip_typeref(entity->declaration.type);
4634 assert(is_type_function(type));
4635 if (!type->function.kr_style_parameters)
4638 add_anchor_token('{');
4640 /* push function parameters */
4641 size_t const top = environment_top();
4642 scope_t *old_scope = scope_push(&entity->function.parameters);
4644 entity_t *parameter = entity->function.parameters.entities;
4645 for ( ; parameter != NULL; parameter = parameter->base.next) {
4646 assert(parameter->base.parent_scope == NULL);
4647 parameter->base.parent_scope = current_scope;
4648 environment_push(parameter);
4651 /* parse declaration list */
4653 switch (token.type) {
4655 case T___extension__:
4656 /* This covers symbols, which are no type, too, and results in
4657 * better error messages. The typical cases are misspelled type
4658 * names and missing includes. */
4660 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4668 /* pop function parameters */
4669 assert(current_scope == &entity->function.parameters);
4670 scope_pop(old_scope);
4671 environment_pop_to(top);
4673 /* update function type */
4674 type_t *new_type = duplicate_type(type);
4676 function_parameter_t *parameters = NULL;
4677 function_parameter_t **anchor = ¶meters;
4679 /* did we have an earlier prototype? */
4680 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4681 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4684 function_parameter_t *proto_parameter = NULL;
4685 if (proto_type != NULL) {
4686 type_t *proto_type_type = proto_type->declaration.type;
4687 proto_parameter = proto_type_type->function.parameters;
4688 /* If a K&R function definition has a variadic prototype earlier, then
4689 * make the function definition variadic, too. This should conform to
4690 * §6.7.5.3:15 and §6.9.1:8. */
4691 new_type->function.variadic = proto_type_type->function.variadic;
4693 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4695 new_type->function.unspecified_parameters = true;
4698 bool need_incompatible_warning = false;
4699 parameter = entity->function.parameters.entities;
4700 for (; parameter != NULL; parameter = parameter->base.next,
4702 proto_parameter == NULL ? NULL : proto_parameter->next) {
4703 if (parameter->kind != ENTITY_PARAMETER)
4706 type_t *parameter_type = parameter->declaration.type;
4707 if (parameter_type == NULL) {
4709 errorf(HERE, "no type specified for function parameter '%Y'",
4710 parameter->base.symbol);
4711 parameter_type = type_error_type;
4713 if (warning.implicit_int) {
4714 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4715 parameter->base.symbol);
4717 parameter_type = type_int;
4719 parameter->declaration.type = parameter_type;
4722 semantic_parameter_incomplete(parameter);
4724 /* we need the default promoted types for the function type */
4725 type_t *not_promoted = parameter_type;
4726 parameter_type = get_default_promoted_type(parameter_type);
4728 /* gcc special: if the type of the prototype matches the unpromoted
4729 * type don't promote */
4730 if (!strict_mode && proto_parameter != NULL) {
4731 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4732 type_t *promo_skip = skip_typeref(parameter_type);
4733 type_t *param_skip = skip_typeref(not_promoted);
4734 if (!types_compatible(proto_p_type, promo_skip)
4735 && types_compatible(proto_p_type, param_skip)) {
4737 need_incompatible_warning = true;
4738 parameter_type = not_promoted;
4741 function_parameter_t *const parameter
4742 = allocate_parameter(parameter_type);
4744 *anchor = parameter;
4745 anchor = ¶meter->next;
4748 new_type->function.parameters = parameters;
4749 new_type = identify_new_type(new_type);
4751 if (warning.other && need_incompatible_warning) {
4752 type_t *proto_type_type = proto_type->declaration.type;
4754 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4755 proto_type_type, proto_type->base.symbol,
4756 new_type, entity->base.symbol,
4757 &proto_type->base.source_position);
4760 entity->declaration.type = new_type;
4762 rem_anchor_token('{');
4765 static bool first_err = true;
4768 * When called with first_err set, prints the name of the current function,
4771 static void print_in_function(void)
4775 diagnosticf("%s: In function '%Y':\n",
4776 current_function->base.base.source_position.input_name,
4777 current_function->base.base.symbol);
4782 * Check if all labels are defined in the current function.
4783 * Check if all labels are used in the current function.
4785 static void check_labels(void)
4787 for (const goto_statement_t *goto_statement = goto_first;
4788 goto_statement != NULL;
4789 goto_statement = goto_statement->next) {
4790 /* skip computed gotos */
4791 if (goto_statement->expression != NULL)
4794 label_t *label = goto_statement->label;
4797 if (label->base.source_position.input_name == NULL) {
4798 print_in_function();
4799 errorf(&goto_statement->base.source_position,
4800 "label '%Y' used but not defined", label->base.symbol);
4804 if (warning.unused_label) {
4805 for (const label_statement_t *label_statement = label_first;
4806 label_statement != NULL;
4807 label_statement = label_statement->next) {
4808 label_t *label = label_statement->label;
4810 if (! label->used) {
4811 print_in_function();
4812 warningf(&label_statement->base.source_position,
4813 "label '%Y' defined but not used", label->base.symbol);
4819 static void warn_unused_entity(entity_t *entity, entity_t *last)
4821 entity_t const *const end = last != NULL ? last->base.next : NULL;
4822 for (; entity != end; entity = entity->base.next) {
4823 if (!is_declaration(entity))
4826 declaration_t *declaration = &entity->declaration;
4827 if (declaration->implicit)
4830 if (!declaration->used) {
4831 print_in_function();
4832 const char *what = get_entity_kind_name(entity->kind);
4833 warningf(&entity->base.source_position, "%s '%Y' is unused",
4834 what, entity->base.symbol);
4835 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4836 print_in_function();
4837 const char *what = get_entity_kind_name(entity->kind);
4838 warningf(&entity->base.source_position, "%s '%Y' is never read",
4839 what, entity->base.symbol);
4844 static void check_unused_variables(statement_t *const stmt, void *const env)
4848 switch (stmt->kind) {
4849 case STATEMENT_DECLARATION: {
4850 declaration_statement_t const *const decls = &stmt->declaration;
4851 warn_unused_entity(decls->declarations_begin,
4852 decls->declarations_end);
4857 warn_unused_entity(stmt->fors.scope.entities, NULL);
4866 * Check declarations of current_function for unused entities.
4868 static void check_declarations(void)
4870 if (warning.unused_parameter) {
4871 const scope_t *scope = ¤t_function->parameters;
4873 /* do not issue unused warnings for main */
4874 if (!is_sym_main(current_function->base.base.symbol)) {
4875 warn_unused_entity(scope->entities, NULL);
4878 if (warning.unused_variable) {
4879 walk_statements(current_function->statement, check_unused_variables,
4884 static int determine_truth(expression_t const* const cond)
4887 !is_constant_expression(cond) ? 0 :
4888 fold_constant_to_bool(cond) ? 1 :
4892 static void check_reachable(statement_t *);
4893 static bool reaches_end;
4895 static bool expression_returns(expression_t const *const expr)
4897 switch (expr->kind) {
4899 expression_t const *const func = expr->call.function;
4900 if (func->kind == EXPR_REFERENCE) {
4901 entity_t *entity = func->reference.entity;
4902 if (entity->kind == ENTITY_FUNCTION
4903 && entity->declaration.modifiers & DM_NORETURN)
4907 if (!expression_returns(func))
4910 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4911 if (!expression_returns(arg->expression))
4918 case EXPR_REFERENCE:
4919 case EXPR_REFERENCE_ENUM_VALUE:
4921 case EXPR_STRING_LITERAL:
4922 case EXPR_WIDE_STRING_LITERAL:
4923 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4924 case EXPR_LABEL_ADDRESS:
4925 case EXPR_CLASSIFY_TYPE:
4926 case EXPR_SIZEOF: // TODO handle obscure VLA case
4929 case EXPR_BUILTIN_CONSTANT_P:
4930 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4935 case EXPR_STATEMENT: {
4936 bool old_reaches_end = reaches_end;
4937 reaches_end = false;
4938 check_reachable(expr->statement.statement);
4939 bool returns = reaches_end;
4940 reaches_end = old_reaches_end;
4944 case EXPR_CONDITIONAL:
4945 // TODO handle constant expression
4947 if (!expression_returns(expr->conditional.condition))
4950 if (expr->conditional.true_expression != NULL
4951 && expression_returns(expr->conditional.true_expression))
4954 return expression_returns(expr->conditional.false_expression);
4957 return expression_returns(expr->select.compound);
4959 case EXPR_ARRAY_ACCESS:
4961 expression_returns(expr->array_access.array_ref) &&
4962 expression_returns(expr->array_access.index);
4965 return expression_returns(expr->va_starte.ap);
4968 return expression_returns(expr->va_arge.ap);
4971 return expression_returns(expr->va_copye.src);
4973 EXPR_UNARY_CASES_MANDATORY
4974 return expression_returns(expr->unary.value);
4976 case EXPR_UNARY_THROW:
4980 // TODO handle constant lhs of && and ||
4982 expression_returns(expr->binary.left) &&
4983 expression_returns(expr->binary.right);
4989 panic("unhandled expression");
4992 static bool initializer_returns(initializer_t const *const init)
4994 switch (init->kind) {
4995 case INITIALIZER_VALUE:
4996 return expression_returns(init->value.value);
4998 case INITIALIZER_LIST: {
4999 initializer_t * const* i = init->list.initializers;
5000 initializer_t * const* const end = i + init->list.len;
5001 bool returns = true;
5002 for (; i != end; ++i) {
5003 if (!initializer_returns(*i))
5009 case INITIALIZER_STRING:
5010 case INITIALIZER_WIDE_STRING:
5011 case INITIALIZER_DESIGNATOR: // designators have no payload
5014 panic("unhandled initializer");
5017 static bool noreturn_candidate;
5019 static void check_reachable(statement_t *const stmt)
5021 if (stmt->base.reachable)
5023 if (stmt->kind != STATEMENT_DO_WHILE)
5024 stmt->base.reachable = true;
5026 statement_t *last = stmt;
5028 switch (stmt->kind) {
5029 case STATEMENT_INVALID:
5030 case STATEMENT_EMPTY:
5032 next = stmt->base.next;
5035 case STATEMENT_DECLARATION: {
5036 declaration_statement_t const *const decl = &stmt->declaration;
5037 entity_t const * ent = decl->declarations_begin;
5038 entity_t const *const last = decl->declarations_end;
5040 for (;; ent = ent->base.next) {
5041 if (ent->kind == ENTITY_VARIABLE &&
5042 ent->variable.initializer != NULL &&
5043 !initializer_returns(ent->variable.initializer)) {
5050 next = stmt->base.next;
5054 case STATEMENT_COMPOUND:
5055 next = stmt->compound.statements;
5057 next = stmt->base.next;
5060 case STATEMENT_RETURN: {
5061 expression_t const *const val = stmt->returns.value;
5062 if (val == NULL || expression_returns(val))
5063 noreturn_candidate = false;
5067 case STATEMENT_IF: {
5068 if_statement_t const *const ifs = &stmt->ifs;
5069 expression_t const *const cond = ifs->condition;
5071 if (!expression_returns(cond))
5074 int const val = determine_truth(cond);
5077 check_reachable(ifs->true_statement);
5082 if (ifs->false_statement != NULL) {
5083 check_reachable(ifs->false_statement);
5087 next = stmt->base.next;
5091 case STATEMENT_SWITCH: {
5092 switch_statement_t const *const switchs = &stmt->switchs;
5093 expression_t const *const expr = switchs->expression;
5095 if (!expression_returns(expr))
5098 if (is_constant_expression(expr)) {
5099 long const val = fold_constant_to_int(expr);
5100 case_label_statement_t * defaults = NULL;
5101 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5102 if (i->expression == NULL) {
5107 if (i->first_case <= val && val <= i->last_case) {
5108 check_reachable((statement_t*)i);
5113 if (defaults != NULL) {
5114 check_reachable((statement_t*)defaults);
5118 bool has_default = false;
5119 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5120 if (i->expression == NULL)
5123 check_reachable((statement_t*)i);
5130 next = stmt->base.next;
5134 case STATEMENT_EXPRESSION: {
5135 /* Check for noreturn function call */
5136 expression_t const *const expr = stmt->expression.expression;
5137 if (!expression_returns(expr))
5140 next = stmt->base.next;
5144 case STATEMENT_CONTINUE:
5145 for (statement_t *parent = stmt;;) {
5146 parent = parent->base.parent;
5147 if (parent == NULL) /* continue not within loop */
5151 switch (parent->kind) {
5152 case STATEMENT_WHILE: goto continue_while;
5153 case STATEMENT_DO_WHILE: goto continue_do_while;
5154 case STATEMENT_FOR: goto continue_for;
5160 case STATEMENT_BREAK:
5161 for (statement_t *parent = stmt;;) {
5162 parent = parent->base.parent;
5163 if (parent == NULL) /* break not within loop/switch */
5166 switch (parent->kind) {
5167 case STATEMENT_SWITCH:
5168 case STATEMENT_WHILE:
5169 case STATEMENT_DO_WHILE:
5172 next = parent->base.next;
5173 goto found_break_parent;
5181 case STATEMENT_GOTO:
5182 if (stmt->gotos.expression) {
5183 if (!expression_returns(stmt->gotos.expression))
5186 statement_t *parent = stmt->base.parent;
5187 if (parent == NULL) /* top level goto */
5191 next = stmt->gotos.label->statement;
5192 if (next == NULL) /* missing label */
5197 case STATEMENT_LABEL:
5198 next = stmt->label.statement;
5201 case STATEMENT_CASE_LABEL:
5202 next = stmt->case_label.statement;
5205 case STATEMENT_WHILE: {
5206 while_statement_t const *const whiles = &stmt->whiles;
5207 expression_t const *const cond = whiles->condition;
5209 if (!expression_returns(cond))
5212 int const val = determine_truth(cond);
5215 check_reachable(whiles->body);
5220 next = stmt->base.next;
5224 case STATEMENT_DO_WHILE:
5225 next = stmt->do_while.body;
5228 case STATEMENT_FOR: {
5229 for_statement_t *const fors = &stmt->fors;
5231 if (fors->condition_reachable)
5233 fors->condition_reachable = true;
5235 expression_t const *const cond = fors->condition;
5240 } else if (expression_returns(cond)) {
5241 val = determine_truth(cond);
5247 check_reachable(fors->body);
5252 next = stmt->base.next;
5256 case STATEMENT_MS_TRY: {
5257 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5258 check_reachable(ms_try->try_statement);
5259 next = ms_try->final_statement;
5263 case STATEMENT_LEAVE: {
5264 statement_t *parent = stmt;
5266 parent = parent->base.parent;
5267 if (parent == NULL) /* __leave not within __try */
5270 if (parent->kind == STATEMENT_MS_TRY) {
5272 next = parent->ms_try.final_statement;
5280 panic("invalid statement kind");
5283 while (next == NULL) {
5284 next = last->base.parent;
5286 noreturn_candidate = false;
5288 type_t *const type = skip_typeref(current_function->base.type);
5289 assert(is_type_function(type));
5290 type_t *const ret = skip_typeref(type->function.return_type);
5291 if (warning.return_type &&
5292 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5293 is_type_valid(ret) &&
5294 !is_sym_main(current_function->base.base.symbol)) {
5295 warningf(&stmt->base.source_position,
5296 "control reaches end of non-void function");
5301 switch (next->kind) {
5302 case STATEMENT_INVALID:
5303 case STATEMENT_EMPTY:
5304 case STATEMENT_DECLARATION:
5305 case STATEMENT_EXPRESSION:
5307 case STATEMENT_RETURN:
5308 case STATEMENT_CONTINUE:
5309 case STATEMENT_BREAK:
5310 case STATEMENT_GOTO:
5311 case STATEMENT_LEAVE:
5312 panic("invalid control flow in function");
5314 case STATEMENT_COMPOUND:
5315 if (next->compound.stmt_expr) {
5321 case STATEMENT_SWITCH:
5322 case STATEMENT_LABEL:
5323 case STATEMENT_CASE_LABEL:
5325 next = next->base.next;
5328 case STATEMENT_WHILE: {
5330 if (next->base.reachable)
5332 next->base.reachable = true;
5334 while_statement_t const *const whiles = &next->whiles;
5335 expression_t const *const cond = whiles->condition;
5337 if (!expression_returns(cond))
5340 int const val = determine_truth(cond);
5343 check_reachable(whiles->body);
5349 next = next->base.next;
5353 case STATEMENT_DO_WHILE: {
5355 if (next->base.reachable)
5357 next->base.reachable = true;
5359 do_while_statement_t const *const dw = &next->do_while;
5360 expression_t const *const cond = dw->condition;
5362 if (!expression_returns(cond))
5365 int const val = determine_truth(cond);
5368 check_reachable(dw->body);
5374 next = next->base.next;
5378 case STATEMENT_FOR: {
5380 for_statement_t *const fors = &next->fors;
5382 fors->step_reachable = true;
5384 if (fors->condition_reachable)
5386 fors->condition_reachable = true;
5388 expression_t const *const cond = fors->condition;
5393 } else if (expression_returns(cond)) {
5394 val = determine_truth(cond);
5400 check_reachable(fors->body);
5406 next = next->base.next;
5410 case STATEMENT_MS_TRY:
5412 next = next->ms_try.final_statement;
5417 check_reachable(next);
5420 static void check_unreachable(statement_t* const stmt, void *const env)
5424 switch (stmt->kind) {
5425 case STATEMENT_DO_WHILE:
5426 if (!stmt->base.reachable) {
5427 expression_t const *const cond = stmt->do_while.condition;
5428 if (determine_truth(cond) >= 0) {
5429 warningf(&cond->base.source_position,
5430 "condition of do-while-loop is unreachable");
5435 case STATEMENT_FOR: {
5436 for_statement_t const* const fors = &stmt->fors;
5438 // if init and step are unreachable, cond is unreachable, too
5439 if (!stmt->base.reachable && !fors->step_reachable) {
5440 warningf(&stmt->base.source_position, "statement is unreachable");
5442 if (!stmt->base.reachable && fors->initialisation != NULL) {
5443 warningf(&fors->initialisation->base.source_position,
5444 "initialisation of for-statement is unreachable");
5447 if (!fors->condition_reachable && fors->condition != NULL) {
5448 warningf(&fors->condition->base.source_position,
5449 "condition of for-statement is unreachable");
5452 if (!fors->step_reachable && fors->step != NULL) {
5453 warningf(&fors->step->base.source_position,
5454 "step of for-statement is unreachable");
5460 case STATEMENT_COMPOUND:
5461 if (stmt->compound.statements != NULL)
5463 goto warn_unreachable;
5465 case STATEMENT_DECLARATION: {
5466 /* Only warn if there is at least one declarator with an initializer.
5467 * This typically occurs in switch statements. */
5468 declaration_statement_t const *const decl = &stmt->declaration;
5469 entity_t const * ent = decl->declarations_begin;
5470 entity_t const *const last = decl->declarations_end;
5472 for (;; ent = ent->base.next) {
5473 if (ent->kind == ENTITY_VARIABLE &&
5474 ent->variable.initializer != NULL) {
5475 goto warn_unreachable;
5485 if (!stmt->base.reachable)
5486 warningf(&stmt->base.source_position, "statement is unreachable");
5491 static void parse_external_declaration(void)
5493 /* function-definitions and declarations both start with declaration
5495 declaration_specifiers_t specifiers;
5496 memset(&specifiers, 0, sizeof(specifiers));
5498 add_anchor_token(';');
5499 parse_declaration_specifiers(&specifiers);
5500 rem_anchor_token(';');
5502 /* must be a declaration */
5503 if (token.type == ';') {
5504 parse_anonymous_declaration_rest(&specifiers);
5508 add_anchor_token(',');
5509 add_anchor_token('=');
5510 add_anchor_token(';');
5511 add_anchor_token('{');
5513 /* declarator is common to both function-definitions and declarations */
5514 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5516 rem_anchor_token('{');
5517 rem_anchor_token(';');
5518 rem_anchor_token('=');
5519 rem_anchor_token(',');
5521 /* must be a declaration */
5522 switch (token.type) {
5526 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5531 /* must be a function definition */
5532 parse_kr_declaration_list(ndeclaration);
5534 if (token.type != '{') {
5535 parse_error_expected("while parsing function definition", '{', NULL);
5536 eat_until_matching_token(';');
5540 assert(is_declaration(ndeclaration));
5541 type_t *const orig_type = ndeclaration->declaration.type;
5542 type_t * type = skip_typeref(orig_type);
5544 if (!is_type_function(type)) {
5545 if (is_type_valid(type)) {
5546 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5547 type, ndeclaration->base.symbol);
5551 } else if (is_typeref(orig_type)) {
5553 errorf(&ndeclaration->base.source_position,
5554 "type of function definition '%#T' is a typedef",
5555 orig_type, ndeclaration->base.symbol);
5558 if (warning.aggregate_return &&
5559 is_type_compound(skip_typeref(type->function.return_type))) {
5560 warningf(HERE, "function '%Y' returns an aggregate",
5561 ndeclaration->base.symbol);
5563 if (warning.traditional && !type->function.unspecified_parameters) {
5564 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5565 ndeclaration->base.symbol);
5567 if (warning.old_style_definition && type->function.unspecified_parameters) {
5568 warningf(HERE, "old-style function definition '%Y'",
5569 ndeclaration->base.symbol);
5572 /* §6.7.5.3:14 a function definition with () means no
5573 * parameters (and not unspecified parameters) */
5574 if (type->function.unspecified_parameters &&
5575 type->function.parameters == NULL) {
5576 type_t *copy = duplicate_type(type);
5577 copy->function.unspecified_parameters = false;
5578 type = identify_new_type(copy);
5580 ndeclaration->declaration.type = type;
5583 entity_t *const entity = record_entity(ndeclaration, true);
5584 assert(entity->kind == ENTITY_FUNCTION);
5585 assert(ndeclaration->kind == ENTITY_FUNCTION);
5587 function_t *function = &entity->function;
5588 if (ndeclaration != entity) {
5589 function->parameters = ndeclaration->function.parameters;
5591 assert(is_declaration(entity));
5592 type = skip_typeref(entity->declaration.type);
5594 /* push function parameters and switch scope */
5595 size_t const top = environment_top();
5596 scope_t *old_scope = scope_push(&function->parameters);
5598 entity_t *parameter = function->parameters.entities;
5599 for (; parameter != NULL; parameter = parameter->base.next) {
5600 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5601 parameter->base.parent_scope = current_scope;
5603 assert(parameter->base.parent_scope == NULL
5604 || parameter->base.parent_scope == current_scope);
5605 parameter->base.parent_scope = current_scope;
5606 if (parameter->base.symbol == NULL) {
5607 errorf(¶meter->base.source_position, "parameter name omitted");
5610 environment_push(parameter);
5613 if (function->statement != NULL) {
5614 parser_error_multiple_definition(entity, HERE);
5617 /* parse function body */
5618 int label_stack_top = label_top();
5619 function_t *old_current_function = current_function;
5620 entity_t *old_current_entity = current_entity;
5621 current_function = function;
5622 current_entity = (entity_t*) function;
5623 current_parent = NULL;
5626 goto_anchor = &goto_first;
5628 label_anchor = &label_first;
5630 statement_t *const body = parse_compound_statement(false);
5631 function->statement = body;
5634 check_declarations();
5635 if (warning.return_type ||
5636 warning.unreachable_code ||
5637 (warning.missing_noreturn
5638 && !(function->base.modifiers & DM_NORETURN))) {
5639 noreturn_candidate = true;
5640 check_reachable(body);
5641 if (warning.unreachable_code)
5642 walk_statements(body, check_unreachable, NULL);
5643 if (warning.missing_noreturn &&
5644 noreturn_candidate &&
5645 !(function->base.modifiers & DM_NORETURN)) {
5646 warningf(&body->base.source_position,
5647 "function '%#T' is candidate for attribute 'noreturn'",
5648 type, entity->base.symbol);
5652 assert(current_parent == NULL);
5653 assert(current_function == function);
5654 assert(current_entity == (entity_t*) function);
5655 current_entity = old_current_entity;
5656 current_function = old_current_function;
5657 label_pop_to(label_stack_top);
5660 assert(current_scope == &function->parameters);
5661 scope_pop(old_scope);
5662 environment_pop_to(top);
5665 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5666 source_position_t *source_position,
5667 const symbol_t *symbol)
5669 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5671 type->bitfield.base_type = base_type;
5672 type->bitfield.size_expression = size;
5675 type_t *skipped_type = skip_typeref(base_type);
5676 if (!is_type_integer(skipped_type)) {
5677 errorf(HERE, "bitfield base type '%T' is not an integer type",
5681 bit_size = get_type_size(base_type) * 8;
5684 if (is_constant_expression(size)) {
5685 long v = fold_constant_to_int(size);
5686 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5689 errorf(source_position, "negative width in bit-field '%Y'",
5691 } else if (v == 0 && symbol != NULL) {
5692 errorf(source_position, "zero width for bit-field '%Y'",
5694 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5695 errorf(source_position, "width of '%Y' exceeds its type",
5698 type->bitfield.bit_size = v;
5705 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5707 entity_t *iter = compound->members.entities;
5708 for (; iter != NULL; iter = iter->base.next) {
5709 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5712 if (iter->base.symbol == symbol) {
5714 } else if (iter->base.symbol == NULL) {
5715 /* search in anonymous structs and unions */
5716 type_t *type = skip_typeref(iter->declaration.type);
5717 if (is_type_compound(type)) {
5718 if (find_compound_entry(type->compound.compound, symbol)
5729 static void check_deprecated(const source_position_t *source_position,
5730 const entity_t *entity)
5732 if (!warning.deprecated_declarations)
5734 if (!is_declaration(entity))
5736 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5739 char const *const prefix = get_entity_kind_name(entity->kind);
5740 const char *deprecated_string
5741 = get_deprecated_string(entity->declaration.attributes);
5742 if (deprecated_string != NULL) {
5743 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5744 prefix, entity->base.symbol, &entity->base.source_position,
5747 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5748 entity->base.symbol, &entity->base.source_position);
5753 static expression_t *create_select(const source_position_t *pos,
5755 type_qualifiers_t qualifiers,
5758 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5760 check_deprecated(pos, entry);
5762 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5763 select->select.compound = addr;
5764 select->select.compound_entry = entry;
5766 type_t *entry_type = entry->declaration.type;
5767 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5769 /* we always do the auto-type conversions; the & and sizeof parser contains
5770 * code to revert this! */
5771 select->base.type = automatic_type_conversion(res_type);
5772 if (res_type->kind == TYPE_BITFIELD) {
5773 select->base.type = res_type->bitfield.base_type;
5780 * Find entry with symbol in compound. Search anonymous structs and unions and
5781 * creates implicit select expressions for them.
5782 * Returns the adress for the innermost compound.
5784 static expression_t *find_create_select(const source_position_t *pos,
5786 type_qualifiers_t qualifiers,
5787 compound_t *compound, symbol_t *symbol)
5789 entity_t *iter = compound->members.entities;
5790 for (; iter != NULL; iter = iter->base.next) {
5791 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5794 symbol_t *iter_symbol = iter->base.symbol;
5795 if (iter_symbol == NULL) {
5796 type_t *type = iter->declaration.type;
5797 if (type->kind != TYPE_COMPOUND_STRUCT
5798 && type->kind != TYPE_COMPOUND_UNION)
5801 compound_t *sub_compound = type->compound.compound;
5803 if (find_compound_entry(sub_compound, symbol) == NULL)
5806 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5807 sub_addr->base.source_position = *pos;
5808 sub_addr->select.implicit = true;
5809 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5813 if (iter_symbol == symbol) {
5814 return create_select(pos, addr, qualifiers, iter);
5821 static void parse_compound_declarators(compound_t *compound,
5822 const declaration_specifiers_t *specifiers)
5827 if (token.type == ':') {
5828 source_position_t source_position = *HERE;
5831 type_t *base_type = specifiers->type;
5832 expression_t *size = parse_constant_expression();
5834 type_t *type = make_bitfield_type(base_type, size,
5835 &source_position, NULL);
5837 attribute_t *attributes = parse_attributes(NULL);
5838 attribute_t **anchor = &attributes;
5839 while (*anchor != NULL)
5840 anchor = &(*anchor)->next;
5841 *anchor = specifiers->attributes;
5843 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5844 entity->base.namespc = NAMESPACE_NORMAL;
5845 entity->base.source_position = source_position;
5846 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5847 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5848 entity->declaration.type = type;
5849 entity->declaration.attributes = attributes;
5851 if (attributes != NULL) {
5852 handle_entity_attributes(attributes, entity);
5854 append_entity(&compound->members, entity);
5856 entity = parse_declarator(specifiers,
5857 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5858 if (entity->kind == ENTITY_TYPEDEF) {
5859 errorf(&entity->base.source_position,
5860 "typedef not allowed as compound member");
5862 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5864 /* make sure we don't define a symbol multiple times */
5865 symbol_t *symbol = entity->base.symbol;
5866 if (symbol != NULL) {
5867 entity_t *prev = find_compound_entry(compound, symbol);
5869 errorf(&entity->base.source_position,
5870 "multiple declarations of symbol '%Y' (declared %P)",
5871 symbol, &prev->base.source_position);
5875 if (token.type == ':') {
5876 source_position_t source_position = *HERE;
5878 expression_t *size = parse_constant_expression();
5880 type_t *type = entity->declaration.type;
5881 type_t *bitfield_type = make_bitfield_type(type, size,
5882 &source_position, entity->base.symbol);
5884 attribute_t *attributes = parse_attributes(NULL);
5885 entity->declaration.type = bitfield_type;
5886 handle_entity_attributes(attributes, entity);
5888 type_t *orig_type = entity->declaration.type;
5889 type_t *type = skip_typeref(orig_type);
5890 if (is_type_function(type)) {
5891 errorf(&entity->base.source_position,
5892 "compound member '%Y' must not have function type '%T'",
5893 entity->base.symbol, orig_type);
5894 } else if (is_type_incomplete(type)) {
5895 /* §6.7.2.1:16 flexible array member */
5896 if (!is_type_array(type) ||
5897 token.type != ';' ||
5898 look_ahead(1)->type != '}') {
5899 errorf(&entity->base.source_position,
5900 "compound member '%Y' has incomplete type '%T'",
5901 entity->base.symbol, orig_type);
5906 append_entity(&compound->members, entity);
5909 } while (next_if(','));
5910 expect(';', end_error);
5913 anonymous_entity = NULL;
5916 static void parse_compound_type_entries(compound_t *compound)
5919 add_anchor_token('}');
5921 while (token.type != '}') {
5922 if (token.type == T_EOF) {
5923 errorf(HERE, "EOF while parsing struct");
5926 declaration_specifiers_t specifiers;
5927 memset(&specifiers, 0, sizeof(specifiers));
5928 parse_declaration_specifiers(&specifiers);
5930 parse_compound_declarators(compound, &specifiers);
5932 rem_anchor_token('}');
5936 compound->complete = true;
5939 static type_t *parse_typename(void)
5941 declaration_specifiers_t specifiers;
5942 memset(&specifiers, 0, sizeof(specifiers));
5943 parse_declaration_specifiers(&specifiers);
5944 if (specifiers.storage_class != STORAGE_CLASS_NONE
5945 || specifiers.thread_local) {
5946 /* TODO: improve error message, user does probably not know what a
5947 * storage class is...
5949 errorf(HERE, "typename must not have a storage class");
5952 type_t *result = parse_abstract_declarator(specifiers.type);
5960 typedef expression_t* (*parse_expression_function)(void);
5961 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5963 typedef struct expression_parser_function_t expression_parser_function_t;
5964 struct expression_parser_function_t {
5965 parse_expression_function parser;
5966 precedence_t infix_precedence;
5967 parse_expression_infix_function infix_parser;
5970 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5973 * Prints an error message if an expression was expected but not read
5975 static expression_t *expected_expression_error(void)
5977 /* skip the error message if the error token was read */
5978 if (token.type != T_ERROR) {
5979 errorf(HERE, "expected expression, got token %K", &token);
5983 return create_invalid_expression();
5986 static type_t *get_string_type(void)
5988 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
5991 static type_t *get_wide_string_type(void)
5993 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5997 * Parse a string constant.
5999 static expression_t *parse_string_literal(void)
6001 source_position_t begin = token.source_position;
6002 string_t res = token.literal;
6003 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
6006 while (token.type == T_STRING_LITERAL
6007 || token.type == T_WIDE_STRING_LITERAL) {
6008 warn_string_concat(&token.source_position);
6009 res = concat_strings(&res, &token.literal);
6011 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6014 expression_t *literal;
6016 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6017 literal->base.type = get_wide_string_type();
6019 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6020 literal->base.type = get_string_type();
6022 literal->base.source_position = begin;
6023 literal->literal.value = res;
6029 * Parse a boolean constant.
6031 static expression_t *parse_boolean_literal(bool value)
6033 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6034 literal->base.source_position = token.source_position;
6035 literal->base.type = type_bool;
6036 literal->literal.value.begin = value ? "true" : "false";
6037 literal->literal.value.size = value ? 4 : 5;
6043 static void warn_traditional_suffix(void)
6045 if (!warning.traditional)
6047 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6051 static void check_integer_suffix(void)
6053 symbol_t *suffix = token.symbol;
6057 bool not_traditional = false;
6058 const char *c = suffix->string;
6059 if (*c == 'l' || *c == 'L') {
6062 not_traditional = true;
6064 if (*c == 'u' || *c == 'U') {
6067 } else if (*c == 'u' || *c == 'U') {
6068 not_traditional = true;
6071 } else if (*c == 'u' || *c == 'U') {
6072 not_traditional = true;
6074 if (*c == 'l' || *c == 'L') {
6082 errorf(&token.source_position,
6083 "invalid suffix '%s' on integer constant", suffix->string);
6084 } else if (not_traditional) {
6085 warn_traditional_suffix();
6089 static type_t *check_floatingpoint_suffix(void)
6091 symbol_t *suffix = token.symbol;
6092 type_t *type = type_double;
6096 bool not_traditional = false;
6097 const char *c = suffix->string;
6098 if (*c == 'f' || *c == 'F') {
6101 } else if (*c == 'l' || *c == 'L') {
6103 type = type_long_double;
6106 errorf(&token.source_position,
6107 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6108 } else if (not_traditional) {
6109 warn_traditional_suffix();
6116 * Parse an integer constant.
6118 static expression_t *parse_number_literal(void)
6120 expression_kind_t kind;
6123 switch (token.type) {
6125 kind = EXPR_LITERAL_INTEGER;
6126 check_integer_suffix();
6129 case T_INTEGER_OCTAL:
6130 kind = EXPR_LITERAL_INTEGER_OCTAL;
6131 check_integer_suffix();
6134 case T_INTEGER_HEXADECIMAL:
6135 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6136 check_integer_suffix();
6139 case T_FLOATINGPOINT:
6140 kind = EXPR_LITERAL_FLOATINGPOINT;
6141 type = check_floatingpoint_suffix();
6143 case T_FLOATINGPOINT_HEXADECIMAL:
6144 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6145 type = check_floatingpoint_suffix();
6148 panic("unexpected token type in parse_number_literal");
6151 expression_t *literal = allocate_expression_zero(kind);
6152 literal->base.source_position = token.source_position;
6153 literal->base.type = type;
6154 literal->literal.value = token.literal;
6155 literal->literal.suffix = token.symbol;
6158 /* integer type depends on the size of the number and the size
6159 * representable by the types. The backend/codegeneration has to determine
6162 determine_literal_type(&literal->literal);
6167 * Parse a character constant.
6169 static expression_t *parse_character_constant(void)
6171 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6172 literal->base.source_position = token.source_position;
6173 literal->base.type = c_mode & _CXX ? type_char : type_int;
6174 literal->literal.value = token.literal;
6176 size_t len = literal->literal.value.size;
6178 if (!GNU_MODE && !(c_mode & _C99)) {
6179 errorf(HERE, "more than 1 character in character constant");
6180 } else if (warning.multichar) {
6181 literal->base.type = type_int;
6182 warningf(HERE, "multi-character character constant");
6191 * Parse a wide character constant.
6193 static expression_t *parse_wide_character_constant(void)
6195 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6196 literal->base.source_position = token.source_position;
6197 literal->base.type = type_int;
6198 literal->literal.value = token.literal;
6200 size_t len = wstrlen(&literal->literal.value);
6202 warningf(HERE, "multi-character character constant");
6209 static entity_t *create_implicit_function(symbol_t *symbol,
6210 const source_position_t *source_position)
6212 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6213 ntype->function.return_type = type_int;
6214 ntype->function.unspecified_parameters = true;
6215 ntype->function.linkage = LINKAGE_C;
6216 type_t *type = identify_new_type(ntype);
6218 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6219 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6220 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6221 entity->declaration.type = type;
6222 entity->declaration.implicit = true;
6223 entity->base.symbol = symbol;
6224 entity->base.source_position = *source_position;
6226 if (current_scope != NULL) {
6227 bool strict_prototypes_old = warning.strict_prototypes;
6228 warning.strict_prototypes = false;
6229 record_entity(entity, false);
6230 warning.strict_prototypes = strict_prototypes_old;
6237 * Performs automatic type cast as described in §6.3.2.1.
6239 * @param orig_type the original type
6241 static type_t *automatic_type_conversion(type_t *orig_type)
6243 type_t *type = skip_typeref(orig_type);
6244 if (is_type_array(type)) {
6245 array_type_t *array_type = &type->array;
6246 type_t *element_type = array_type->element_type;
6247 unsigned qualifiers = array_type->base.qualifiers;
6249 return make_pointer_type(element_type, qualifiers);
6252 if (is_type_function(type)) {
6253 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6260 * reverts the automatic casts of array to pointer types and function
6261 * to function-pointer types as defined §6.3.2.1
6263 type_t *revert_automatic_type_conversion(const expression_t *expression)
6265 switch (expression->kind) {
6266 case EXPR_REFERENCE: {
6267 entity_t *entity = expression->reference.entity;
6268 if (is_declaration(entity)) {
6269 return entity->declaration.type;
6270 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6271 return entity->enum_value.enum_type;
6273 panic("no declaration or enum in reference");
6278 entity_t *entity = expression->select.compound_entry;
6279 assert(is_declaration(entity));
6280 type_t *type = entity->declaration.type;
6281 return get_qualified_type(type,
6282 expression->base.type->base.qualifiers);
6285 case EXPR_UNARY_DEREFERENCE: {
6286 const expression_t *const value = expression->unary.value;
6287 type_t *const type = skip_typeref(value->base.type);
6288 if (!is_type_pointer(type))
6289 return type_error_type;
6290 return type->pointer.points_to;
6293 case EXPR_ARRAY_ACCESS: {
6294 const expression_t *array_ref = expression->array_access.array_ref;
6295 type_t *type_left = skip_typeref(array_ref->base.type);
6296 if (!is_type_pointer(type_left))
6297 return type_error_type;
6298 return type_left->pointer.points_to;
6301 case EXPR_STRING_LITERAL: {
6302 size_t size = expression->string_literal.value.size;
6303 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6306 case EXPR_WIDE_STRING_LITERAL: {
6307 size_t size = wstrlen(&expression->string_literal.value);
6308 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6311 case EXPR_COMPOUND_LITERAL:
6312 return expression->compound_literal.type;
6317 return expression->base.type;
6321 * Find an entity matching a symbol in a scope.
6322 * Uses current scope if scope is NULL
6324 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6325 namespace_tag_t namespc)
6327 if (scope == NULL) {
6328 return get_entity(symbol, namespc);
6331 /* we should optimize here, if scope grows above a certain size we should
6332 construct a hashmap here... */
6333 entity_t *entity = scope->entities;
6334 for ( ; entity != NULL; entity = entity->base.next) {
6335 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6342 static entity_t *parse_qualified_identifier(void)
6344 /* namespace containing the symbol */
6346 source_position_t pos;
6347 const scope_t *lookup_scope = NULL;
6349 if (next_if(T_COLONCOLON))
6350 lookup_scope = &unit->scope;
6354 if (token.type != T_IDENTIFIER) {
6355 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6356 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6358 symbol = token.symbol;
6363 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6365 if (!next_if(T_COLONCOLON))
6368 switch (entity->kind) {
6369 case ENTITY_NAMESPACE:
6370 lookup_scope = &entity->namespacee.members;
6375 lookup_scope = &entity->compound.members;
6378 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6379 symbol, get_entity_kind_name(entity->kind));
6384 if (entity == NULL) {
6385 if (!strict_mode && token.type == '(') {
6386 /* an implicitly declared function */
6387 if (warning.error_implicit_function_declaration) {
6388 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6389 } else if (warning.implicit_function_declaration) {
6390 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6393 entity = create_implicit_function(symbol, &pos);
6395 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6396 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6403 /* skip further qualifications */
6404 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6406 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6409 static expression_t *parse_reference(void)
6411 entity_t *entity = parse_qualified_identifier();
6414 if (is_declaration(entity)) {
6415 orig_type = entity->declaration.type;
6416 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6417 orig_type = entity->enum_value.enum_type;
6419 panic("expected declaration or enum value in reference");
6422 /* we always do the auto-type conversions; the & and sizeof parser contains
6423 * code to revert this! */
6424 type_t *type = automatic_type_conversion(orig_type);
6426 expression_kind_t kind = EXPR_REFERENCE;
6427 if (entity->kind == ENTITY_ENUM_VALUE)
6428 kind = EXPR_REFERENCE_ENUM_VALUE;
6430 expression_t *expression = allocate_expression_zero(kind);
6431 expression->reference.entity = entity;
6432 expression->base.type = type;
6434 /* this declaration is used */
6435 if (is_declaration(entity)) {
6436 entity->declaration.used = true;
6439 if (entity->base.parent_scope != file_scope
6440 && (current_function != NULL
6441 && entity->base.parent_scope->depth < current_function->parameters.depth)
6442 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6443 if (entity->kind == ENTITY_VARIABLE) {
6444 /* access of a variable from an outer function */
6445 entity->variable.address_taken = true;
6446 } else if (entity->kind == ENTITY_PARAMETER) {
6447 entity->parameter.address_taken = true;
6449 current_function->need_closure = true;
6452 check_deprecated(HERE, entity);
6454 if (warning.init_self && entity == current_init_decl && !in_type_prop
6455 && entity->kind == ENTITY_VARIABLE) {
6456 current_init_decl = NULL;
6457 warningf(HERE, "variable '%#T' is initialized by itself",
6458 entity->declaration.type, entity->base.symbol);
6464 static bool semantic_cast(expression_t *cast)
6466 expression_t *expression = cast->unary.value;
6467 type_t *orig_dest_type = cast->base.type;
6468 type_t *orig_type_right = expression->base.type;
6469 type_t const *dst_type = skip_typeref(orig_dest_type);
6470 type_t const *src_type = skip_typeref(orig_type_right);
6471 source_position_t const *pos = &cast->base.source_position;
6473 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6474 if (dst_type == type_void)
6477 /* only integer and pointer can be casted to pointer */
6478 if (is_type_pointer(dst_type) &&
6479 !is_type_pointer(src_type) &&
6480 !is_type_integer(src_type) &&
6481 is_type_valid(src_type)) {
6482 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6486 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6487 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6491 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6492 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6496 if (warning.cast_qual &&
6497 is_type_pointer(src_type) &&
6498 is_type_pointer(dst_type)) {
6499 type_t *src = skip_typeref(src_type->pointer.points_to);
6500 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6501 unsigned missing_qualifiers =
6502 src->base.qualifiers & ~dst->base.qualifiers;
6503 if (missing_qualifiers != 0) {
6505 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6506 missing_qualifiers, orig_type_right);
6512 static expression_t *parse_compound_literal(type_t *type)
6514 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6516 parse_initializer_env_t env;
6519 env.must_be_constant = false;
6520 initializer_t *initializer = parse_initializer(&env);
6523 expression->compound_literal.initializer = initializer;
6524 expression->compound_literal.type = type;
6525 expression->base.type = automatic_type_conversion(type);
6531 * Parse a cast expression.
6533 static expression_t *parse_cast(void)
6535 add_anchor_token(')');
6537 source_position_t source_position = token.source_position;
6539 type_t *type = parse_typename();
6541 rem_anchor_token(')');
6542 expect(')', end_error);
6544 if (token.type == '{') {
6545 return parse_compound_literal(type);
6548 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6549 cast->base.source_position = source_position;
6551 expression_t *value = parse_sub_expression(PREC_CAST);
6552 cast->base.type = type;
6553 cast->unary.value = value;
6555 if (! semantic_cast(cast)) {
6556 /* TODO: record the error in the AST. else it is impossible to detect it */
6561 return create_invalid_expression();
6565 * Parse a statement expression.
6567 static expression_t *parse_statement_expression(void)
6569 add_anchor_token(')');
6571 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6573 statement_t *statement = parse_compound_statement(true);
6574 statement->compound.stmt_expr = true;
6575 expression->statement.statement = statement;
6577 /* find last statement and use its type */
6578 type_t *type = type_void;
6579 const statement_t *stmt = statement->compound.statements;
6581 while (stmt->base.next != NULL)
6582 stmt = stmt->base.next;
6584 if (stmt->kind == STATEMENT_EXPRESSION) {
6585 type = stmt->expression.expression->base.type;
6587 } else if (warning.other) {
6588 warningf(&expression->base.source_position, "empty statement expression ({})");
6590 expression->base.type = type;
6592 rem_anchor_token(')');
6593 expect(')', end_error);
6600 * Parse a parenthesized expression.
6602 static expression_t *parse_parenthesized_expression(void)
6606 switch (token.type) {
6608 /* gcc extension: a statement expression */
6609 return parse_statement_expression();
6613 return parse_cast();
6615 if (is_typedef_symbol(token.symbol)) {
6616 return parse_cast();
6620 add_anchor_token(')');
6621 expression_t *result = parse_expression();
6622 result->base.parenthesized = true;
6623 rem_anchor_token(')');
6624 expect(')', end_error);
6630 static expression_t *parse_function_keyword(void)
6634 if (current_function == NULL) {
6635 errorf(HERE, "'__func__' used outside of a function");
6638 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6639 expression->base.type = type_char_ptr;
6640 expression->funcname.kind = FUNCNAME_FUNCTION;
6647 static expression_t *parse_pretty_function_keyword(void)
6649 if (current_function == NULL) {
6650 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6653 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6654 expression->base.type = type_char_ptr;
6655 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6657 eat(T___PRETTY_FUNCTION__);
6662 static expression_t *parse_funcsig_keyword(void)
6664 if (current_function == NULL) {
6665 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6668 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6669 expression->base.type = type_char_ptr;
6670 expression->funcname.kind = FUNCNAME_FUNCSIG;
6677 static expression_t *parse_funcdname_keyword(void)
6679 if (current_function == NULL) {
6680 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6683 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6684 expression->base.type = type_char_ptr;
6685 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6687 eat(T___FUNCDNAME__);
6692 static designator_t *parse_designator(void)
6694 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6695 result->source_position = *HERE;
6697 if (token.type != T_IDENTIFIER) {
6698 parse_error_expected("while parsing member designator",
6699 T_IDENTIFIER, NULL);
6702 result->symbol = token.symbol;
6705 designator_t *last_designator = result;
6708 if (token.type != T_IDENTIFIER) {
6709 parse_error_expected("while parsing member designator",
6710 T_IDENTIFIER, NULL);
6713 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6714 designator->source_position = *HERE;
6715 designator->symbol = token.symbol;
6718 last_designator->next = designator;
6719 last_designator = designator;
6723 add_anchor_token(']');
6724 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6725 designator->source_position = *HERE;
6726 designator->array_index = parse_expression();
6727 rem_anchor_token(']');
6728 expect(']', end_error);
6729 if (designator->array_index == NULL) {
6733 last_designator->next = designator;
6734 last_designator = designator;
6746 * Parse the __builtin_offsetof() expression.
6748 static expression_t *parse_offsetof(void)
6750 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6751 expression->base.type = type_size_t;
6753 eat(T___builtin_offsetof);
6755 expect('(', end_error);
6756 add_anchor_token(',');
6757 type_t *type = parse_typename();
6758 rem_anchor_token(',');
6759 expect(',', end_error);
6760 add_anchor_token(')');
6761 designator_t *designator = parse_designator();
6762 rem_anchor_token(')');
6763 expect(')', end_error);
6765 expression->offsetofe.type = type;
6766 expression->offsetofe.designator = designator;
6769 memset(&path, 0, sizeof(path));
6770 path.top_type = type;
6771 path.path = NEW_ARR_F(type_path_entry_t, 0);
6773 descend_into_subtype(&path);
6775 if (!walk_designator(&path, designator, true)) {
6776 return create_invalid_expression();
6779 DEL_ARR_F(path.path);
6783 return create_invalid_expression();
6787 * Parses a _builtin_va_start() expression.
6789 static expression_t *parse_va_start(void)
6791 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6793 eat(T___builtin_va_start);
6795 expect('(', end_error);
6796 add_anchor_token(',');
6797 expression->va_starte.ap = parse_assignment_expression();
6798 rem_anchor_token(',');
6799 expect(',', end_error);
6800 expression_t *const expr = parse_assignment_expression();
6801 if (expr->kind == EXPR_REFERENCE) {
6802 entity_t *const entity = expr->reference.entity;
6803 if (!current_function->base.type->function.variadic) {
6804 errorf(&expr->base.source_position,
6805 "'va_start' used in non-variadic function");
6806 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6807 entity->base.next != NULL ||
6808 entity->kind != ENTITY_PARAMETER) {
6809 errorf(&expr->base.source_position,
6810 "second argument of 'va_start' must be last parameter of the current function");
6812 expression->va_starte.parameter = &entity->variable;
6814 expect(')', end_error);
6817 expect(')', end_error);
6819 return create_invalid_expression();
6823 * Parses a __builtin_va_arg() expression.
6825 static expression_t *parse_va_arg(void)
6827 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6829 eat(T___builtin_va_arg);
6831 expect('(', end_error);
6833 ap.expression = parse_assignment_expression();
6834 expression->va_arge.ap = ap.expression;
6835 check_call_argument(type_valist, &ap, 1);
6837 expect(',', end_error);
6838 expression->base.type = parse_typename();
6839 expect(')', end_error);
6843 return create_invalid_expression();
6847 * Parses a __builtin_va_copy() expression.
6849 static expression_t *parse_va_copy(void)
6851 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6853 eat(T___builtin_va_copy);
6855 expect('(', end_error);
6856 expression_t *dst = parse_assignment_expression();
6857 assign_error_t error = semantic_assign(type_valist, dst);
6858 report_assign_error(error, type_valist, dst, "call argument 1",
6859 &dst->base.source_position);
6860 expression->va_copye.dst = dst;
6862 expect(',', end_error);
6864 call_argument_t src;
6865 src.expression = parse_assignment_expression();
6866 check_call_argument(type_valist, &src, 2);
6867 expression->va_copye.src = src.expression;
6868 expect(')', end_error);
6872 return create_invalid_expression();
6876 * Parses a __builtin_constant_p() expression.
6878 static expression_t *parse_builtin_constant(void)
6880 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6882 eat(T___builtin_constant_p);
6884 expect('(', end_error);
6885 add_anchor_token(')');
6886 expression->builtin_constant.value = parse_assignment_expression();
6887 rem_anchor_token(')');
6888 expect(')', end_error);
6889 expression->base.type = type_int;
6893 return create_invalid_expression();
6897 * Parses a __builtin_types_compatible_p() expression.
6899 static expression_t *parse_builtin_types_compatible(void)
6901 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6903 eat(T___builtin_types_compatible_p);
6905 expect('(', end_error);
6906 add_anchor_token(')');
6907 add_anchor_token(',');
6908 expression->builtin_types_compatible.left = parse_typename();
6909 rem_anchor_token(',');
6910 expect(',', end_error);
6911 expression->builtin_types_compatible.right = parse_typename();
6912 rem_anchor_token(')');
6913 expect(')', end_error);
6914 expression->base.type = type_int;
6918 return create_invalid_expression();
6922 * Parses a __builtin_is_*() compare expression.
6924 static expression_t *parse_compare_builtin(void)
6926 expression_t *expression;
6928 switch (token.type) {
6929 case T___builtin_isgreater:
6930 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6932 case T___builtin_isgreaterequal:
6933 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6935 case T___builtin_isless:
6936 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6938 case T___builtin_islessequal:
6939 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6941 case T___builtin_islessgreater:
6942 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6944 case T___builtin_isunordered:
6945 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6948 internal_errorf(HERE, "invalid compare builtin found");
6950 expression->base.source_position = *HERE;
6953 expect('(', end_error);
6954 expression->binary.left = parse_assignment_expression();
6955 expect(',', end_error);
6956 expression->binary.right = parse_assignment_expression();
6957 expect(')', end_error);
6959 type_t *const orig_type_left = expression->binary.left->base.type;
6960 type_t *const orig_type_right = expression->binary.right->base.type;
6962 type_t *const type_left = skip_typeref(orig_type_left);
6963 type_t *const type_right = skip_typeref(orig_type_right);
6964 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6965 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6966 type_error_incompatible("invalid operands in comparison",
6967 &expression->base.source_position, orig_type_left, orig_type_right);
6970 semantic_comparison(&expression->binary);
6975 return create_invalid_expression();
6979 * Parses a MS assume() expression.
6981 static expression_t *parse_assume(void)
6983 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6987 expect('(', end_error);
6988 add_anchor_token(')');
6989 expression->unary.value = parse_assignment_expression();
6990 rem_anchor_token(')');
6991 expect(')', end_error);
6993 expression->base.type = type_void;
6996 return create_invalid_expression();
7000 * Return the declaration for a given label symbol or create a new one.
7002 * @param symbol the symbol of the label
7004 static label_t *get_label(symbol_t *symbol)
7007 assert(current_function != NULL);
7009 label = get_entity(symbol, NAMESPACE_LABEL);
7010 /* if we found a local label, we already created the declaration */
7011 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7012 if (label->base.parent_scope != current_scope) {
7013 assert(label->base.parent_scope->depth < current_scope->depth);
7014 current_function->goto_to_outer = true;
7016 return &label->label;
7019 label = get_entity(symbol, NAMESPACE_LABEL);
7020 /* if we found a label in the same function, then we already created the
7023 && label->base.parent_scope == ¤t_function->parameters) {
7024 return &label->label;
7027 /* otherwise we need to create a new one */
7028 label = allocate_entity_zero(ENTITY_LABEL);
7029 label->base.namespc = NAMESPACE_LABEL;
7030 label->base.symbol = symbol;
7034 return &label->label;
7038 * Parses a GNU && label address expression.
7040 static expression_t *parse_label_address(void)
7042 source_position_t source_position = token.source_position;
7044 if (token.type != T_IDENTIFIER) {
7045 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7048 symbol_t *symbol = token.symbol;
7051 label_t *label = get_label(symbol);
7053 label->address_taken = true;
7055 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7056 expression->base.source_position = source_position;
7058 /* label address is threaten as a void pointer */
7059 expression->base.type = type_void_ptr;
7060 expression->label_address.label = label;
7063 return create_invalid_expression();
7067 * Parse a microsoft __noop expression.
7069 static expression_t *parse_noop_expression(void)
7071 /* the result is a (int)0 */
7072 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7073 literal->base.type = type_int;
7074 literal->base.source_position = token.source_position;
7075 literal->literal.value.begin = "__noop";
7076 literal->literal.value.size = 6;
7080 if (token.type == '(') {
7081 /* parse arguments */
7083 add_anchor_token(')');
7084 add_anchor_token(',');
7086 if (token.type != ')') do {
7087 (void)parse_assignment_expression();
7088 } while (next_if(','));
7090 rem_anchor_token(',');
7091 rem_anchor_token(')');
7092 expect(')', end_error);
7099 * Parses a primary expression.
7101 static expression_t *parse_primary_expression(void)
7103 switch (token.type) {
7104 case T_false: return parse_boolean_literal(false);
7105 case T_true: return parse_boolean_literal(true);
7107 case T_INTEGER_OCTAL:
7108 case T_INTEGER_HEXADECIMAL:
7109 case T_FLOATINGPOINT:
7110 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7111 case T_CHARACTER_CONSTANT: return parse_character_constant();
7112 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7113 case T_STRING_LITERAL:
7114 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7115 case T___FUNCTION__:
7116 case T___func__: return parse_function_keyword();
7117 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7118 case T___FUNCSIG__: return parse_funcsig_keyword();
7119 case T___FUNCDNAME__: return parse_funcdname_keyword();
7120 case T___builtin_offsetof: return parse_offsetof();
7121 case T___builtin_va_start: return parse_va_start();
7122 case T___builtin_va_arg: return parse_va_arg();
7123 case T___builtin_va_copy: return parse_va_copy();
7124 case T___builtin_isgreater:
7125 case T___builtin_isgreaterequal:
7126 case T___builtin_isless:
7127 case T___builtin_islessequal:
7128 case T___builtin_islessgreater:
7129 case T___builtin_isunordered: return parse_compare_builtin();
7130 case T___builtin_constant_p: return parse_builtin_constant();
7131 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7132 case T__assume: return parse_assume();
7135 return parse_label_address();
7138 case '(': return parse_parenthesized_expression();
7139 case T___noop: return parse_noop_expression();
7141 /* Gracefully handle type names while parsing expressions. */
7143 return parse_reference();
7145 if (!is_typedef_symbol(token.symbol)) {
7146 return parse_reference();
7150 source_position_t const pos = *HERE;
7151 type_t const *const type = parse_typename();
7152 errorf(&pos, "encountered type '%T' while parsing expression", type);
7153 return create_invalid_expression();
7157 errorf(HERE, "unexpected token %K, expected an expression", &token);
7158 return create_invalid_expression();
7162 * Check if the expression has the character type and issue a warning then.
7164 static void check_for_char_index_type(const expression_t *expression)
7166 type_t *const type = expression->base.type;
7167 const type_t *const base_type = skip_typeref(type);
7169 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7170 warning.char_subscripts) {
7171 warningf(&expression->base.source_position,
7172 "array subscript has type '%T'", type);
7176 static expression_t *parse_array_expression(expression_t *left)
7178 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7181 add_anchor_token(']');
7183 expression_t *inside = parse_expression();
7185 type_t *const orig_type_left = left->base.type;
7186 type_t *const orig_type_inside = inside->base.type;
7188 type_t *const type_left = skip_typeref(orig_type_left);
7189 type_t *const type_inside = skip_typeref(orig_type_inside);
7191 type_t *return_type;
7192 array_access_expression_t *array_access = &expression->array_access;
7193 if (is_type_pointer(type_left)) {
7194 return_type = type_left->pointer.points_to;
7195 array_access->array_ref = left;
7196 array_access->index = inside;
7197 check_for_char_index_type(inside);
7198 } else if (is_type_pointer(type_inside)) {
7199 return_type = type_inside->pointer.points_to;
7200 array_access->array_ref = inside;
7201 array_access->index = left;
7202 array_access->flipped = true;
7203 check_for_char_index_type(left);
7205 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7207 "array access on object with non-pointer types '%T', '%T'",
7208 orig_type_left, orig_type_inside);
7210 return_type = type_error_type;
7211 array_access->array_ref = left;
7212 array_access->index = inside;
7215 expression->base.type = automatic_type_conversion(return_type);
7217 rem_anchor_token(']');
7218 expect(']', end_error);
7223 static expression_t *parse_typeprop(expression_kind_t const kind)
7225 expression_t *tp_expression = allocate_expression_zero(kind);
7226 tp_expression->base.type = type_size_t;
7228 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7230 /* we only refer to a type property, mark this case */
7231 bool old = in_type_prop;
7232 in_type_prop = true;
7235 expression_t *expression;
7236 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7238 add_anchor_token(')');
7239 orig_type = parse_typename();
7240 rem_anchor_token(')');
7241 expect(')', end_error);
7243 if (token.type == '{') {
7244 /* It was not sizeof(type) after all. It is sizeof of an expression
7245 * starting with a compound literal */
7246 expression = parse_compound_literal(orig_type);
7247 goto typeprop_expression;
7250 expression = parse_sub_expression(PREC_UNARY);
7252 typeprop_expression:
7253 tp_expression->typeprop.tp_expression = expression;
7255 orig_type = revert_automatic_type_conversion(expression);
7256 expression->base.type = orig_type;
7259 tp_expression->typeprop.type = orig_type;
7260 type_t const* const type = skip_typeref(orig_type);
7261 char const* const wrong_type =
7262 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7263 is_type_incomplete(type) ? "incomplete" :
7264 type->kind == TYPE_FUNCTION ? "function designator" :
7265 type->kind == TYPE_BITFIELD ? "bitfield" :
7267 if (wrong_type != NULL) {
7268 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7269 errorf(&tp_expression->base.source_position,
7270 "operand of %s expression must not be of %s type '%T'",
7271 what, wrong_type, orig_type);
7276 return tp_expression;
7279 static expression_t *parse_sizeof(void)
7281 return parse_typeprop(EXPR_SIZEOF);
7284 static expression_t *parse_alignof(void)
7286 return parse_typeprop(EXPR_ALIGNOF);
7289 static expression_t *parse_select_expression(expression_t *addr)
7291 assert(token.type == '.' || token.type == T_MINUSGREATER);
7292 bool select_left_arrow = (token.type == T_MINUSGREATER);
7295 if (token.type != T_IDENTIFIER) {
7296 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7297 return create_invalid_expression();
7299 symbol_t *symbol = token.symbol;
7302 type_t *const orig_type = addr->base.type;
7303 type_t *const type = skip_typeref(orig_type);
7306 bool saw_error = false;
7307 if (is_type_pointer(type)) {
7308 if (!select_left_arrow) {
7310 "request for member '%Y' in something not a struct or union, but '%T'",
7314 type_left = skip_typeref(type->pointer.points_to);
7316 if (select_left_arrow && is_type_valid(type)) {
7317 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7323 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7324 type_left->kind != TYPE_COMPOUND_UNION) {
7326 if (is_type_valid(type_left) && !saw_error) {
7328 "request for member '%Y' in something not a struct or union, but '%T'",
7331 return create_invalid_expression();
7334 compound_t *compound = type_left->compound.compound;
7335 if (!compound->complete) {
7336 errorf(HERE, "request for member '%Y' in incomplete type '%T'",
7338 return create_invalid_expression();
7341 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7342 expression_t *result
7343 = find_create_select(HERE, addr, qualifiers, compound, symbol);
7345 if (result == NULL) {
7346 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7347 return create_invalid_expression();
7353 static void check_call_argument(type_t *expected_type,
7354 call_argument_t *argument, unsigned pos)
7356 type_t *expected_type_skip = skip_typeref(expected_type);
7357 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7358 expression_t *arg_expr = argument->expression;
7359 type_t *arg_type = skip_typeref(arg_expr->base.type);
7361 /* handle transparent union gnu extension */
7362 if (is_type_union(expected_type_skip)
7363 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7364 compound_t *union_decl = expected_type_skip->compound.compound;
7365 type_t *best_type = NULL;
7366 entity_t *entry = union_decl->members.entities;
7367 for ( ; entry != NULL; entry = entry->base.next) {
7368 assert(is_declaration(entry));
7369 type_t *decl_type = entry->declaration.type;
7370 error = semantic_assign(decl_type, arg_expr);
7371 if (error == ASSIGN_ERROR_INCOMPATIBLE
7372 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7375 if (error == ASSIGN_SUCCESS) {
7376 best_type = decl_type;
7377 } else if (best_type == NULL) {
7378 best_type = decl_type;
7382 if (best_type != NULL) {
7383 expected_type = best_type;
7387 error = semantic_assign(expected_type, arg_expr);
7388 argument->expression = create_implicit_cast(arg_expr, expected_type);
7390 if (error != ASSIGN_SUCCESS) {
7391 /* report exact scope in error messages (like "in argument 3") */
7393 snprintf(buf, sizeof(buf), "call argument %u", pos);
7394 report_assign_error(error, expected_type, arg_expr, buf,
7395 &arg_expr->base.source_position);
7396 } else if (warning.traditional || warning.conversion) {
7397 type_t *const promoted_type = get_default_promoted_type(arg_type);
7398 if (!types_compatible(expected_type_skip, promoted_type) &&
7399 !types_compatible(expected_type_skip, type_void_ptr) &&
7400 !types_compatible(type_void_ptr, promoted_type)) {
7401 /* Deliberately show the skipped types in this warning */
7402 warningf(&arg_expr->base.source_position,
7403 "passing call argument %u as '%T' rather than '%T' due to prototype",
7404 pos, expected_type_skip, promoted_type);
7410 * Handle the semantic restrictions of builtin calls
7412 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7413 switch (call->function->reference.entity->function.btk) {
7414 case bk_gnu_builtin_return_address:
7415 case bk_gnu_builtin_frame_address: {
7416 /* argument must be constant */
7417 call_argument_t *argument = call->arguments;
7419 if (! is_constant_expression(argument->expression)) {
7420 errorf(&call->base.source_position,
7421 "argument of '%Y' must be a constant expression",
7422 call->function->reference.entity->base.symbol);
7426 case bk_gnu_builtin_prefetch: {
7427 /* second and third argument must be constant if existent */
7428 call_argument_t *rw = call->arguments->next;
7429 call_argument_t *locality = NULL;
7432 if (! is_constant_expression(rw->expression)) {
7433 errorf(&call->base.source_position,
7434 "second argument of '%Y' must be a constant expression",
7435 call->function->reference.entity->base.symbol);
7437 locality = rw->next;
7439 if (locality != NULL) {
7440 if (! is_constant_expression(locality->expression)) {
7441 errorf(&call->base.source_position,
7442 "third argument of '%Y' must be a constant expression",
7443 call->function->reference.entity->base.symbol);
7445 locality = rw->next;
7455 * Parse a call expression, ie. expression '( ... )'.
7457 * @param expression the function address
7459 static expression_t *parse_call_expression(expression_t *expression)
7461 expression_t *result = allocate_expression_zero(EXPR_CALL);
7462 call_expression_t *call = &result->call;
7463 call->function = expression;
7465 type_t *const orig_type = expression->base.type;
7466 type_t *const type = skip_typeref(orig_type);
7468 function_type_t *function_type = NULL;
7469 if (is_type_pointer(type)) {
7470 type_t *const to_type = skip_typeref(type->pointer.points_to);
7472 if (is_type_function(to_type)) {
7473 function_type = &to_type->function;
7474 call->base.type = function_type->return_type;
7478 if (function_type == NULL && is_type_valid(type)) {
7480 "called object '%E' (type '%T') is not a pointer to a function",
7481 expression, orig_type);
7484 /* parse arguments */
7486 add_anchor_token(')');
7487 add_anchor_token(',');
7489 if (token.type != ')') {
7490 call_argument_t **anchor = &call->arguments;
7492 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7493 argument->expression = parse_assignment_expression();
7496 anchor = &argument->next;
7497 } while (next_if(','));
7499 rem_anchor_token(',');
7500 rem_anchor_token(')');
7501 expect(')', end_error);
7503 if (function_type == NULL)
7506 /* check type and count of call arguments */
7507 function_parameter_t *parameter = function_type->parameters;
7508 call_argument_t *argument = call->arguments;
7509 if (!function_type->unspecified_parameters) {
7510 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7511 parameter = parameter->next, argument = argument->next) {
7512 check_call_argument(parameter->type, argument, ++pos);
7515 if (parameter != NULL) {
7516 errorf(HERE, "too few arguments to function '%E'", expression);
7517 } else if (argument != NULL && !function_type->variadic) {
7518 errorf(HERE, "too many arguments to function '%E'", expression);
7522 /* do default promotion for other arguments */
7523 for (; argument != NULL; argument = argument->next) {
7524 type_t *type = argument->expression->base.type;
7526 type = get_default_promoted_type(type);
7528 argument->expression
7529 = create_implicit_cast(argument->expression, type);
7532 check_format(&result->call);
7534 if (warning.aggregate_return &&
7535 is_type_compound(skip_typeref(function_type->return_type))) {
7536 warningf(&result->base.source_position,
7537 "function call has aggregate value");
7540 if (call->function->kind == EXPR_REFERENCE) {
7541 reference_expression_t *reference = &call->function->reference;
7542 if (reference->entity->kind == ENTITY_FUNCTION &&
7543 reference->entity->function.btk != bk_none)
7544 handle_builtin_argument_restrictions(call);
7551 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7553 static bool same_compound_type(const type_t *type1, const type_t *type2)
7556 is_type_compound(type1) &&
7557 type1->kind == type2->kind &&
7558 type1->compound.compound == type2->compound.compound;
7561 static expression_t const *get_reference_address(expression_t const *expr)
7563 bool regular_take_address = true;
7565 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7566 expr = expr->unary.value;
7568 regular_take_address = false;
7571 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7574 expr = expr->unary.value;
7577 if (expr->kind != EXPR_REFERENCE)
7580 /* special case for functions which are automatically converted to a
7581 * pointer to function without an extra TAKE_ADDRESS operation */
7582 if (!regular_take_address &&
7583 expr->reference.entity->kind != ENTITY_FUNCTION) {
7590 static void warn_reference_address_as_bool(expression_t const* expr)
7592 if (!warning.address)
7595 expr = get_reference_address(expr);
7597 warningf(&expr->base.source_position,
7598 "the address of '%Y' will always evaluate as 'true'",
7599 expr->reference.entity->base.symbol);
7603 static void warn_assignment_in_condition(const expression_t *const expr)
7605 if (!warning.parentheses)
7607 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7609 if (expr->base.parenthesized)
7611 warningf(&expr->base.source_position,
7612 "suggest parentheses around assignment used as truth value");
7615 static void semantic_condition(expression_t const *const expr,
7616 char const *const context)
7618 type_t *const type = skip_typeref(expr->base.type);
7619 if (is_type_scalar(type)) {
7620 warn_reference_address_as_bool(expr);
7621 warn_assignment_in_condition(expr);
7622 } else if (is_type_valid(type)) {
7623 errorf(&expr->base.source_position,
7624 "%s must have scalar type", context);
7629 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7631 * @param expression the conditional expression
7633 static expression_t *parse_conditional_expression(expression_t *expression)
7635 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7637 conditional_expression_t *conditional = &result->conditional;
7638 conditional->condition = expression;
7641 add_anchor_token(':');
7643 /* §6.5.15:2 The first operand shall have scalar type. */
7644 semantic_condition(expression, "condition of conditional operator");
7646 expression_t *true_expression = expression;
7647 bool gnu_cond = false;
7648 if (GNU_MODE && token.type == ':') {
7651 true_expression = parse_expression();
7653 rem_anchor_token(':');
7654 expect(':', end_error);
7656 expression_t *false_expression =
7657 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7659 type_t *const orig_true_type = true_expression->base.type;
7660 type_t *const orig_false_type = false_expression->base.type;
7661 type_t *const true_type = skip_typeref(orig_true_type);
7662 type_t *const false_type = skip_typeref(orig_false_type);
7665 type_t *result_type;
7666 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7667 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7668 /* ISO/IEC 14882:1998(E) §5.16:2 */
7669 if (true_expression->kind == EXPR_UNARY_THROW) {
7670 result_type = false_type;
7671 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7672 result_type = true_type;
7674 if (warning.other && (
7675 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7676 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7678 warningf(&conditional->base.source_position,
7679 "ISO C forbids conditional expression with only one void side");
7681 result_type = type_void;
7683 } else if (is_type_arithmetic(true_type)
7684 && is_type_arithmetic(false_type)) {
7685 result_type = semantic_arithmetic(true_type, false_type);
7687 true_expression = create_implicit_cast(true_expression, result_type);
7688 false_expression = create_implicit_cast(false_expression, result_type);
7690 conditional->true_expression = true_expression;
7691 conditional->false_expression = false_expression;
7692 conditional->base.type = result_type;
7693 } else if (same_compound_type(true_type, false_type)) {
7694 /* just take 1 of the 2 types */
7695 result_type = true_type;
7696 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7697 type_t *pointer_type;
7699 expression_t *other_expression;
7700 if (is_type_pointer(true_type) &&
7701 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7702 pointer_type = true_type;
7703 other_type = false_type;
7704 other_expression = false_expression;
7706 pointer_type = false_type;
7707 other_type = true_type;
7708 other_expression = true_expression;
7711 if (is_null_pointer_constant(other_expression)) {
7712 result_type = pointer_type;
7713 } else if (is_type_pointer(other_type)) {
7714 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7715 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7718 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7719 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7721 } else if (types_compatible(get_unqualified_type(to1),
7722 get_unqualified_type(to2))) {
7725 if (warning.other) {
7726 warningf(&conditional->base.source_position,
7727 "pointer types '%T' and '%T' in conditional expression are incompatible",
7728 true_type, false_type);
7733 type_t *const type =
7734 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7735 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7736 } else if (is_type_integer(other_type)) {
7737 if (warning.other) {
7738 warningf(&conditional->base.source_position,
7739 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7741 result_type = pointer_type;
7743 if (is_type_valid(other_type)) {
7744 type_error_incompatible("while parsing conditional",
7745 &expression->base.source_position, true_type, false_type);
7747 result_type = type_error_type;
7750 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7751 type_error_incompatible("while parsing conditional",
7752 &conditional->base.source_position, true_type,
7755 result_type = type_error_type;
7758 conditional->true_expression
7759 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7760 conditional->false_expression
7761 = create_implicit_cast(false_expression, result_type);
7762 conditional->base.type = result_type;
7767 * Parse an extension expression.
7769 static expression_t *parse_extension(void)
7771 eat(T___extension__);
7773 bool old_gcc_extension = in_gcc_extension;
7774 in_gcc_extension = true;
7775 expression_t *expression = parse_sub_expression(PREC_UNARY);
7776 in_gcc_extension = old_gcc_extension;
7781 * Parse a __builtin_classify_type() expression.
7783 static expression_t *parse_builtin_classify_type(void)
7785 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7786 result->base.type = type_int;
7788 eat(T___builtin_classify_type);
7790 expect('(', end_error);
7791 add_anchor_token(')');
7792 expression_t *expression = parse_expression();
7793 rem_anchor_token(')');
7794 expect(')', end_error);
7795 result->classify_type.type_expression = expression;
7799 return create_invalid_expression();
7803 * Parse a delete expression
7804 * ISO/IEC 14882:1998(E) §5.3.5
7806 static expression_t *parse_delete(void)
7808 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7809 result->base.type = type_void;
7814 result->kind = EXPR_UNARY_DELETE_ARRAY;
7815 expect(']', end_error);
7819 expression_t *const value = parse_sub_expression(PREC_CAST);
7820 result->unary.value = value;
7822 type_t *const type = skip_typeref(value->base.type);
7823 if (!is_type_pointer(type)) {
7824 if (is_type_valid(type)) {
7825 errorf(&value->base.source_position,
7826 "operand of delete must have pointer type");
7828 } else if (warning.other &&
7829 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7830 warningf(&value->base.source_position,
7831 "deleting 'void*' is undefined");
7838 * Parse a throw expression
7839 * ISO/IEC 14882:1998(E) §15:1
7841 static expression_t *parse_throw(void)
7843 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7844 result->base.type = type_void;
7848 expression_t *value = NULL;
7849 switch (token.type) {
7851 value = parse_assignment_expression();
7852 /* ISO/IEC 14882:1998(E) §15.1:3 */
7853 type_t *const orig_type = value->base.type;
7854 type_t *const type = skip_typeref(orig_type);
7855 if (is_type_incomplete(type)) {
7856 errorf(&value->base.source_position,
7857 "cannot throw object of incomplete type '%T'", orig_type);
7858 } else if (is_type_pointer(type)) {
7859 type_t *const points_to = skip_typeref(type->pointer.points_to);
7860 if (is_type_incomplete(points_to) &&
7861 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7862 errorf(&value->base.source_position,
7863 "cannot throw pointer to incomplete type '%T'", orig_type);
7871 result->unary.value = value;
7876 static bool check_pointer_arithmetic(const source_position_t *source_position,
7877 type_t *pointer_type,
7878 type_t *orig_pointer_type)
7880 type_t *points_to = pointer_type->pointer.points_to;
7881 points_to = skip_typeref(points_to);
7883 if (is_type_incomplete(points_to)) {
7884 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7885 errorf(source_position,
7886 "arithmetic with pointer to incomplete type '%T' not allowed",
7889 } else if (warning.pointer_arith) {
7890 warningf(source_position,
7891 "pointer of type '%T' used in arithmetic",
7894 } else if (is_type_function(points_to)) {
7896 errorf(source_position,
7897 "arithmetic with pointer to function type '%T' not allowed",
7900 } else if (warning.pointer_arith) {
7901 warningf(source_position,
7902 "pointer to a function '%T' used in arithmetic",
7909 static bool is_lvalue(const expression_t *expression)
7911 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7912 switch (expression->kind) {
7913 case EXPR_ARRAY_ACCESS:
7914 case EXPR_COMPOUND_LITERAL:
7915 case EXPR_REFERENCE:
7917 case EXPR_UNARY_DEREFERENCE:
7921 type_t *type = skip_typeref(expression->base.type);
7923 /* ISO/IEC 14882:1998(E) §3.10:3 */
7924 is_type_reference(type) ||
7925 /* Claim it is an lvalue, if the type is invalid. There was a parse
7926 * error before, which maybe prevented properly recognizing it as
7928 !is_type_valid(type);
7933 static void semantic_incdec(unary_expression_t *expression)
7935 type_t *const orig_type = expression->value->base.type;
7936 type_t *const type = skip_typeref(orig_type);
7937 if (is_type_pointer(type)) {
7938 if (!check_pointer_arithmetic(&expression->base.source_position,
7942 } else if (!is_type_real(type) && is_type_valid(type)) {
7943 /* TODO: improve error message */
7944 errorf(&expression->base.source_position,
7945 "operation needs an arithmetic or pointer type");
7948 if (!is_lvalue(expression->value)) {
7949 /* TODO: improve error message */
7950 errorf(&expression->base.source_position, "lvalue required as operand");
7952 expression->base.type = orig_type;
7955 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7957 type_t *const orig_type = expression->value->base.type;
7958 type_t *const type = skip_typeref(orig_type);
7959 if (!is_type_arithmetic(type)) {
7960 if (is_type_valid(type)) {
7961 /* TODO: improve error message */
7962 errorf(&expression->base.source_position,
7963 "operation needs an arithmetic type");
7968 expression->base.type = orig_type;
7971 static void semantic_unexpr_plus(unary_expression_t *expression)
7973 semantic_unexpr_arithmetic(expression);
7974 if (warning.traditional)
7975 warningf(&expression->base.source_position,
7976 "traditional C rejects the unary plus operator");
7979 static void semantic_not(unary_expression_t *expression)
7981 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7982 semantic_condition(expression->value, "operand of !");
7983 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7986 static void semantic_unexpr_integer(unary_expression_t *expression)
7988 type_t *const orig_type = expression->value->base.type;
7989 type_t *const type = skip_typeref(orig_type);
7990 if (!is_type_integer(type)) {
7991 if (is_type_valid(type)) {
7992 errorf(&expression->base.source_position,
7993 "operand of ~ must be of integer type");
7998 expression->base.type = orig_type;
8001 static void semantic_dereference(unary_expression_t *expression)
8003 type_t *const orig_type = expression->value->base.type;
8004 type_t *const type = skip_typeref(orig_type);
8005 if (!is_type_pointer(type)) {
8006 if (is_type_valid(type)) {
8007 errorf(&expression->base.source_position,
8008 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8013 type_t *result_type = type->pointer.points_to;
8014 result_type = automatic_type_conversion(result_type);
8015 expression->base.type = result_type;
8019 * Record that an address is taken (expression represents an lvalue).
8021 * @param expression the expression
8022 * @param may_be_register if true, the expression might be an register
8024 static void set_address_taken(expression_t *expression, bool may_be_register)
8026 if (expression->kind != EXPR_REFERENCE)
8029 entity_t *const entity = expression->reference.entity;
8031 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8034 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8035 && !may_be_register) {
8036 errorf(&expression->base.source_position,
8037 "address of register %s '%Y' requested",
8038 get_entity_kind_name(entity->kind), entity->base.symbol);
8041 if (entity->kind == ENTITY_VARIABLE) {
8042 entity->variable.address_taken = true;
8044 assert(entity->kind == ENTITY_PARAMETER);
8045 entity->parameter.address_taken = true;
8050 * Check the semantic of the address taken expression.
8052 static void semantic_take_addr(unary_expression_t *expression)
8054 expression_t *value = expression->value;
8055 value->base.type = revert_automatic_type_conversion(value);
8057 type_t *orig_type = value->base.type;
8058 type_t *type = skip_typeref(orig_type);
8059 if (!is_type_valid(type))
8063 if (!is_lvalue(value)) {
8064 errorf(&expression->base.source_position, "'&' requires an lvalue");
8066 if (type->kind == TYPE_BITFIELD) {
8067 errorf(&expression->base.source_position,
8068 "'&' not allowed on object with bitfield type '%T'",
8072 set_address_taken(value, false);
8074 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8077 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8078 static expression_t *parse_##unexpression_type(void) \
8080 expression_t *unary_expression \
8081 = allocate_expression_zero(unexpression_type); \
8083 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8085 sfunc(&unary_expression->unary); \
8087 return unary_expression; \
8090 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8091 semantic_unexpr_arithmetic)
8092 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8093 semantic_unexpr_plus)
8094 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8096 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8097 semantic_dereference)
8098 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8100 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8101 semantic_unexpr_integer)
8102 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8104 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8107 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8109 static expression_t *parse_##unexpression_type(expression_t *left) \
8111 expression_t *unary_expression \
8112 = allocate_expression_zero(unexpression_type); \
8114 unary_expression->unary.value = left; \
8116 sfunc(&unary_expression->unary); \
8118 return unary_expression; \
8121 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8122 EXPR_UNARY_POSTFIX_INCREMENT,
8124 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8125 EXPR_UNARY_POSTFIX_DECREMENT,
8128 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8130 /* TODO: handle complex + imaginary types */
8132 type_left = get_unqualified_type(type_left);
8133 type_right = get_unqualified_type(type_right);
8135 /* §6.3.1.8 Usual arithmetic conversions */
8136 if (type_left == type_long_double || type_right == type_long_double) {
8137 return type_long_double;
8138 } else if (type_left == type_double || type_right == type_double) {
8140 } else if (type_left == type_float || type_right == type_float) {
8144 type_left = promote_integer(type_left);
8145 type_right = promote_integer(type_right);
8147 if (type_left == type_right)
8150 bool const signed_left = is_type_signed(type_left);
8151 bool const signed_right = is_type_signed(type_right);
8152 int const rank_left = get_rank(type_left);
8153 int const rank_right = get_rank(type_right);
8155 if (signed_left == signed_right)
8156 return rank_left >= rank_right ? type_left : type_right;
8165 u_rank = rank_right;
8166 u_type = type_right;
8168 s_rank = rank_right;
8169 s_type = type_right;
8174 if (u_rank >= s_rank)
8177 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8179 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8180 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8184 case ATOMIC_TYPE_INT: return type_unsigned_int;
8185 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8186 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8188 default: panic("invalid atomic type");
8193 * Check the semantic restrictions for a binary expression.
8195 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8197 expression_t *const left = expression->left;
8198 expression_t *const right = expression->right;
8199 type_t *const orig_type_left = left->base.type;
8200 type_t *const orig_type_right = right->base.type;
8201 type_t *const type_left = skip_typeref(orig_type_left);
8202 type_t *const type_right = skip_typeref(orig_type_right);
8204 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8205 /* TODO: improve error message */
8206 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8207 errorf(&expression->base.source_position,
8208 "operation needs arithmetic types");
8213 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8214 expression->left = create_implicit_cast(left, arithmetic_type);
8215 expression->right = create_implicit_cast(right, arithmetic_type);
8216 expression->base.type = arithmetic_type;
8219 static void warn_div_by_zero(binary_expression_t const *const expression)
8221 if (!warning.div_by_zero ||
8222 !is_type_integer(expression->base.type))
8225 expression_t const *const right = expression->right;
8226 /* The type of the right operand can be different for /= */
8227 if (is_type_integer(right->base.type) &&
8228 is_constant_expression(right) &&
8229 !fold_constant_to_bool(right)) {
8230 warningf(&expression->base.source_position, "division by zero");
8235 * Check the semantic restrictions for a div/mod expression.
8237 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8239 semantic_binexpr_arithmetic(expression);
8240 warn_div_by_zero(expression);
8243 static void warn_addsub_in_shift(const expression_t *const expr)
8245 if (expr->base.parenthesized)
8249 switch (expr->kind) {
8250 case EXPR_BINARY_ADD: op = '+'; break;
8251 case EXPR_BINARY_SUB: op = '-'; break;
8255 warningf(&expr->base.source_position,
8256 "suggest parentheses around '%c' inside shift", op);
8259 static bool semantic_shift(binary_expression_t *expression)
8261 expression_t *const left = expression->left;
8262 expression_t *const right = expression->right;
8263 type_t *const orig_type_left = left->base.type;
8264 type_t *const orig_type_right = right->base.type;
8265 type_t * type_left = skip_typeref(orig_type_left);
8266 type_t * type_right = skip_typeref(orig_type_right);
8268 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8269 /* TODO: improve error message */
8270 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8271 errorf(&expression->base.source_position,
8272 "operands of shift operation must have integer types");
8277 type_left = promote_integer(type_left);
8279 if (is_constant_expression(right)) {
8280 long count = fold_constant_to_int(right);
8282 warningf(&right->base.source_position,
8283 "shift count must be non-negative");
8284 } else if ((unsigned long)count >=
8285 get_atomic_type_size(type_left->atomic.akind) * 8) {
8286 warningf(&right->base.source_position,
8287 "shift count must be less than type width");
8291 type_right = promote_integer(type_right);
8292 expression->right = create_implicit_cast(right, type_right);
8297 static void semantic_shift_op(binary_expression_t *expression)
8299 expression_t *const left = expression->left;
8300 expression_t *const right = expression->right;
8302 if (!semantic_shift(expression))
8305 if (warning.parentheses) {
8306 warn_addsub_in_shift(left);
8307 warn_addsub_in_shift(right);
8310 type_t *const orig_type_left = left->base.type;
8311 type_t * type_left = skip_typeref(orig_type_left);
8313 type_left = promote_integer(type_left);
8314 expression->left = create_implicit_cast(left, type_left);
8315 expression->base.type = type_left;
8318 static void semantic_add(binary_expression_t *expression)
8320 expression_t *const left = expression->left;
8321 expression_t *const right = expression->right;
8322 type_t *const orig_type_left = left->base.type;
8323 type_t *const orig_type_right = right->base.type;
8324 type_t *const type_left = skip_typeref(orig_type_left);
8325 type_t *const type_right = skip_typeref(orig_type_right);
8328 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8329 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8330 expression->left = create_implicit_cast(left, arithmetic_type);
8331 expression->right = create_implicit_cast(right, arithmetic_type);
8332 expression->base.type = arithmetic_type;
8333 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8334 check_pointer_arithmetic(&expression->base.source_position,
8335 type_left, orig_type_left);
8336 expression->base.type = type_left;
8337 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8338 check_pointer_arithmetic(&expression->base.source_position,
8339 type_right, orig_type_right);
8340 expression->base.type = type_right;
8341 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8342 errorf(&expression->base.source_position,
8343 "invalid operands to binary + ('%T', '%T')",
8344 orig_type_left, orig_type_right);
8348 static void semantic_sub(binary_expression_t *expression)
8350 expression_t *const left = expression->left;
8351 expression_t *const right = expression->right;
8352 type_t *const orig_type_left = left->base.type;
8353 type_t *const orig_type_right = right->base.type;
8354 type_t *const type_left = skip_typeref(orig_type_left);
8355 type_t *const type_right = skip_typeref(orig_type_right);
8356 source_position_t const *const pos = &expression->base.source_position;
8359 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8360 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8361 expression->left = create_implicit_cast(left, arithmetic_type);
8362 expression->right = create_implicit_cast(right, arithmetic_type);
8363 expression->base.type = arithmetic_type;
8364 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8365 check_pointer_arithmetic(&expression->base.source_position,
8366 type_left, orig_type_left);
8367 expression->base.type = type_left;
8368 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8369 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8370 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8371 if (!types_compatible(unqual_left, unqual_right)) {
8373 "subtracting pointers to incompatible types '%T' and '%T'",
8374 orig_type_left, orig_type_right);
8375 } else if (!is_type_object(unqual_left)) {
8376 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8377 errorf(pos, "subtracting pointers to non-object types '%T'",
8379 } else if (warning.other) {
8380 warningf(pos, "subtracting pointers to void");
8383 expression->base.type = type_ptrdiff_t;
8384 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8385 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8386 orig_type_left, orig_type_right);
8390 static void warn_string_literal_address(expression_t const* expr)
8392 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8393 expr = expr->unary.value;
8394 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8396 expr = expr->unary.value;
8399 if (expr->kind == EXPR_STRING_LITERAL
8400 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8401 warningf(&expr->base.source_position,
8402 "comparison with string literal results in unspecified behaviour");
8406 static void warn_comparison_in_comparison(const expression_t *const expr)
8408 if (expr->base.parenthesized)
8410 switch (expr->base.kind) {
8411 case EXPR_BINARY_LESS:
8412 case EXPR_BINARY_GREATER:
8413 case EXPR_BINARY_LESSEQUAL:
8414 case EXPR_BINARY_GREATEREQUAL:
8415 case EXPR_BINARY_NOTEQUAL:
8416 case EXPR_BINARY_EQUAL:
8417 warningf(&expr->base.source_position,
8418 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8425 static bool maybe_negative(expression_t const *const expr)
8428 !is_constant_expression(expr) ||
8429 fold_constant_to_int(expr) < 0;
8433 * Check the semantics of comparison expressions.
8435 * @param expression The expression to check.
8437 static void semantic_comparison(binary_expression_t *expression)
8439 expression_t *left = expression->left;
8440 expression_t *right = expression->right;
8442 if (warning.address) {
8443 warn_string_literal_address(left);
8444 warn_string_literal_address(right);
8446 expression_t const* const func_left = get_reference_address(left);
8447 if (func_left != NULL && is_null_pointer_constant(right)) {
8448 warningf(&expression->base.source_position,
8449 "the address of '%Y' will never be NULL",
8450 func_left->reference.entity->base.symbol);
8453 expression_t const* const func_right = get_reference_address(right);
8454 if (func_right != NULL && is_null_pointer_constant(right)) {
8455 warningf(&expression->base.source_position,
8456 "the address of '%Y' will never be NULL",
8457 func_right->reference.entity->base.symbol);
8461 if (warning.parentheses) {
8462 warn_comparison_in_comparison(left);
8463 warn_comparison_in_comparison(right);
8466 type_t *orig_type_left = left->base.type;
8467 type_t *orig_type_right = right->base.type;
8468 type_t *type_left = skip_typeref(orig_type_left);
8469 type_t *type_right = skip_typeref(orig_type_right);
8471 /* TODO non-arithmetic types */
8472 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8473 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8475 /* test for signed vs unsigned compares */
8476 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8477 bool const signed_left = is_type_signed(type_left);
8478 bool const signed_right = is_type_signed(type_right);
8479 if (signed_left != signed_right) {
8480 /* FIXME long long needs better const folding magic */
8481 /* TODO check whether constant value can be represented by other type */
8482 if ((signed_left && maybe_negative(left)) ||
8483 (signed_right && maybe_negative(right))) {
8484 warningf(&expression->base.source_position,
8485 "comparison between signed and unsigned");
8490 expression->left = create_implicit_cast(left, arithmetic_type);
8491 expression->right = create_implicit_cast(right, arithmetic_type);
8492 expression->base.type = arithmetic_type;
8493 if (warning.float_equal &&
8494 (expression->base.kind == EXPR_BINARY_EQUAL ||
8495 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8496 is_type_float(arithmetic_type)) {
8497 warningf(&expression->base.source_position,
8498 "comparing floating point with == or != is unsafe");
8500 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8501 /* TODO check compatibility */
8502 } else if (is_type_pointer(type_left)) {
8503 expression->right = create_implicit_cast(right, type_left);
8504 } else if (is_type_pointer(type_right)) {
8505 expression->left = create_implicit_cast(left, type_right);
8506 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8507 type_error_incompatible("invalid operands in comparison",
8508 &expression->base.source_position,
8509 type_left, type_right);
8511 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8515 * Checks if a compound type has constant fields.
8517 static bool has_const_fields(const compound_type_t *type)
8519 compound_t *compound = type->compound;
8520 entity_t *entry = compound->members.entities;
8522 for (; entry != NULL; entry = entry->base.next) {
8523 if (!is_declaration(entry))
8526 const type_t *decl_type = skip_typeref(entry->declaration.type);
8527 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8534 static bool is_valid_assignment_lhs(expression_t const* const left)
8536 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8537 type_t *const type_left = skip_typeref(orig_type_left);
8539 if (!is_lvalue(left)) {
8540 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8545 if (left->kind == EXPR_REFERENCE
8546 && left->reference.entity->kind == ENTITY_FUNCTION) {
8547 errorf(HERE, "cannot assign to function '%E'", left);
8551 if (is_type_array(type_left)) {
8552 errorf(HERE, "cannot assign to array '%E'", left);
8555 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8556 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8560 if (is_type_incomplete(type_left)) {
8561 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8562 left, orig_type_left);
8565 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8566 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8567 left, orig_type_left);
8574 static void semantic_arithmetic_assign(binary_expression_t *expression)
8576 expression_t *left = expression->left;
8577 expression_t *right = expression->right;
8578 type_t *orig_type_left = left->base.type;
8579 type_t *orig_type_right = right->base.type;
8581 if (!is_valid_assignment_lhs(left))
8584 type_t *type_left = skip_typeref(orig_type_left);
8585 type_t *type_right = skip_typeref(orig_type_right);
8587 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8588 /* TODO: improve error message */
8589 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8590 errorf(&expression->base.source_position,
8591 "operation needs arithmetic types");
8596 /* combined instructions are tricky. We can't create an implicit cast on
8597 * the left side, because we need the uncasted form for the store.
8598 * The ast2firm pass has to know that left_type must be right_type
8599 * for the arithmetic operation and create a cast by itself */
8600 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8601 expression->right = create_implicit_cast(right, arithmetic_type);
8602 expression->base.type = type_left;
8605 static void semantic_divmod_assign(binary_expression_t *expression)
8607 semantic_arithmetic_assign(expression);
8608 warn_div_by_zero(expression);
8611 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8613 expression_t *const left = expression->left;
8614 expression_t *const right = expression->right;
8615 type_t *const orig_type_left = left->base.type;
8616 type_t *const orig_type_right = right->base.type;
8617 type_t *const type_left = skip_typeref(orig_type_left);
8618 type_t *const type_right = skip_typeref(orig_type_right);
8620 if (!is_valid_assignment_lhs(left))
8623 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8624 /* combined instructions are tricky. We can't create an implicit cast on
8625 * the left side, because we need the uncasted form for the store.
8626 * The ast2firm pass has to know that left_type must be right_type
8627 * for the arithmetic operation and create a cast by itself */
8628 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8629 expression->right = create_implicit_cast(right, arithmetic_type);
8630 expression->base.type = type_left;
8631 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8632 check_pointer_arithmetic(&expression->base.source_position,
8633 type_left, orig_type_left);
8634 expression->base.type = type_left;
8635 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8636 errorf(&expression->base.source_position,
8637 "incompatible types '%T' and '%T' in assignment",
8638 orig_type_left, orig_type_right);
8642 static void semantic_integer_assign(binary_expression_t *expression)
8644 expression_t *left = expression->left;
8645 expression_t *right = expression->right;
8646 type_t *orig_type_left = left->base.type;
8647 type_t *orig_type_right = right->base.type;
8649 if (!is_valid_assignment_lhs(left))
8652 type_t *type_left = skip_typeref(orig_type_left);
8653 type_t *type_right = skip_typeref(orig_type_right);
8655 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8656 /* TODO: improve error message */
8657 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8658 errorf(&expression->base.source_position,
8659 "operation needs integer types");
8664 /* combined instructions are tricky. We can't create an implicit cast on
8665 * the left side, because we need the uncasted form for the store.
8666 * The ast2firm pass has to know that left_type must be right_type
8667 * for the arithmetic operation and create a cast by itself */
8668 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8669 expression->right = create_implicit_cast(right, arithmetic_type);
8670 expression->base.type = type_left;
8673 static void semantic_shift_assign(binary_expression_t *expression)
8675 expression_t *left = expression->left;
8677 if (!is_valid_assignment_lhs(left))
8680 if (!semantic_shift(expression))
8683 expression->base.type = skip_typeref(left->base.type);
8686 static void warn_logical_and_within_or(const expression_t *const expr)
8688 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8690 if (expr->base.parenthesized)
8692 warningf(&expr->base.source_position,
8693 "suggest parentheses around && within ||");
8697 * Check the semantic restrictions of a logical expression.
8699 static void semantic_logical_op(binary_expression_t *expression)
8701 /* §6.5.13:2 Each of the operands shall have scalar type.
8702 * §6.5.14:2 Each of the operands shall have scalar type. */
8703 semantic_condition(expression->left, "left operand of logical operator");
8704 semantic_condition(expression->right, "right operand of logical operator");
8705 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8706 warning.parentheses) {
8707 warn_logical_and_within_or(expression->left);
8708 warn_logical_and_within_or(expression->right);
8710 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8714 * Check the semantic restrictions of a binary assign expression.
8716 static void semantic_binexpr_assign(binary_expression_t *expression)
8718 expression_t *left = expression->left;
8719 type_t *orig_type_left = left->base.type;
8721 if (!is_valid_assignment_lhs(left))
8724 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8725 report_assign_error(error, orig_type_left, expression->right,
8726 "assignment", &left->base.source_position);
8727 expression->right = create_implicit_cast(expression->right, orig_type_left);
8728 expression->base.type = orig_type_left;
8732 * Determine if the outermost operation (or parts thereof) of the given
8733 * expression has no effect in order to generate a warning about this fact.
8734 * Therefore in some cases this only examines some of the operands of the
8735 * expression (see comments in the function and examples below).
8737 * f() + 23; // warning, because + has no effect
8738 * x || f(); // no warning, because x controls execution of f()
8739 * x ? y : f(); // warning, because y has no effect
8740 * (void)x; // no warning to be able to suppress the warning
8741 * This function can NOT be used for an "expression has definitely no effect"-
8743 static bool expression_has_effect(const expression_t *const expr)
8745 switch (expr->kind) {
8746 case EXPR_UNKNOWN: break;
8747 case EXPR_INVALID: return true; /* do NOT warn */
8748 case EXPR_REFERENCE: return false;
8749 case EXPR_REFERENCE_ENUM_VALUE: return false;
8750 case EXPR_LABEL_ADDRESS: return false;
8752 /* suppress the warning for microsoft __noop operations */
8753 case EXPR_LITERAL_MS_NOOP: return true;
8754 case EXPR_LITERAL_BOOLEAN:
8755 case EXPR_LITERAL_CHARACTER:
8756 case EXPR_LITERAL_WIDE_CHARACTER:
8757 case EXPR_LITERAL_INTEGER:
8758 case EXPR_LITERAL_INTEGER_OCTAL:
8759 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8760 case EXPR_LITERAL_FLOATINGPOINT:
8761 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8762 case EXPR_STRING_LITERAL: return false;
8763 case EXPR_WIDE_STRING_LITERAL: return false;
8766 const call_expression_t *const call = &expr->call;
8767 if (call->function->kind != EXPR_REFERENCE)
8770 switch (call->function->reference.entity->function.btk) {
8771 /* FIXME: which builtins have no effect? */
8772 default: return true;
8776 /* Generate the warning if either the left or right hand side of a
8777 * conditional expression has no effect */
8778 case EXPR_CONDITIONAL: {
8779 conditional_expression_t const *const cond = &expr->conditional;
8780 expression_t const *const t = cond->true_expression;
8782 (t == NULL || expression_has_effect(t)) &&
8783 expression_has_effect(cond->false_expression);
8786 case EXPR_SELECT: return false;
8787 case EXPR_ARRAY_ACCESS: return false;
8788 case EXPR_SIZEOF: return false;
8789 case EXPR_CLASSIFY_TYPE: return false;
8790 case EXPR_ALIGNOF: return false;
8792 case EXPR_FUNCNAME: return false;
8793 case EXPR_BUILTIN_CONSTANT_P: return false;
8794 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8795 case EXPR_OFFSETOF: return false;
8796 case EXPR_VA_START: return true;
8797 case EXPR_VA_ARG: return true;
8798 case EXPR_VA_COPY: return true;
8799 case EXPR_STATEMENT: return true; // TODO
8800 case EXPR_COMPOUND_LITERAL: return false;
8802 case EXPR_UNARY_NEGATE: return false;
8803 case EXPR_UNARY_PLUS: return false;
8804 case EXPR_UNARY_BITWISE_NEGATE: return false;
8805 case EXPR_UNARY_NOT: return false;
8806 case EXPR_UNARY_DEREFERENCE: return false;
8807 case EXPR_UNARY_TAKE_ADDRESS: return false;
8808 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8809 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8810 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8811 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8813 /* Treat void casts as if they have an effect in order to being able to
8814 * suppress the warning */
8815 case EXPR_UNARY_CAST: {
8816 type_t *const type = skip_typeref(expr->base.type);
8817 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8820 case EXPR_UNARY_CAST_IMPLICIT: return true;
8821 case EXPR_UNARY_ASSUME: return true;
8822 case EXPR_UNARY_DELETE: return true;
8823 case EXPR_UNARY_DELETE_ARRAY: return true;
8824 case EXPR_UNARY_THROW: return true;
8826 case EXPR_BINARY_ADD: return false;
8827 case EXPR_BINARY_SUB: return false;
8828 case EXPR_BINARY_MUL: return false;
8829 case EXPR_BINARY_DIV: return false;
8830 case EXPR_BINARY_MOD: return false;
8831 case EXPR_BINARY_EQUAL: return false;
8832 case EXPR_BINARY_NOTEQUAL: return false;
8833 case EXPR_BINARY_LESS: return false;
8834 case EXPR_BINARY_LESSEQUAL: return false;
8835 case EXPR_BINARY_GREATER: return false;
8836 case EXPR_BINARY_GREATEREQUAL: return false;
8837 case EXPR_BINARY_BITWISE_AND: return false;
8838 case EXPR_BINARY_BITWISE_OR: return false;
8839 case EXPR_BINARY_BITWISE_XOR: return false;
8840 case EXPR_BINARY_SHIFTLEFT: return false;
8841 case EXPR_BINARY_SHIFTRIGHT: return false;
8842 case EXPR_BINARY_ASSIGN: return true;
8843 case EXPR_BINARY_MUL_ASSIGN: return true;
8844 case EXPR_BINARY_DIV_ASSIGN: return true;
8845 case EXPR_BINARY_MOD_ASSIGN: return true;
8846 case EXPR_BINARY_ADD_ASSIGN: return true;
8847 case EXPR_BINARY_SUB_ASSIGN: return true;
8848 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8849 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8850 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8851 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8852 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8854 /* Only examine the right hand side of && and ||, because the left hand
8855 * side already has the effect of controlling the execution of the right
8857 case EXPR_BINARY_LOGICAL_AND:
8858 case EXPR_BINARY_LOGICAL_OR:
8859 /* Only examine the right hand side of a comma expression, because the left
8860 * hand side has a separate warning */
8861 case EXPR_BINARY_COMMA:
8862 return expression_has_effect(expr->binary.right);
8864 case EXPR_BINARY_ISGREATER: return false;
8865 case EXPR_BINARY_ISGREATEREQUAL: return false;
8866 case EXPR_BINARY_ISLESS: return false;
8867 case EXPR_BINARY_ISLESSEQUAL: return false;
8868 case EXPR_BINARY_ISLESSGREATER: return false;
8869 case EXPR_BINARY_ISUNORDERED: return false;
8872 internal_errorf(HERE, "unexpected expression");
8875 static void semantic_comma(binary_expression_t *expression)
8877 if (warning.unused_value) {
8878 const expression_t *const left = expression->left;
8879 if (!expression_has_effect(left)) {
8880 warningf(&left->base.source_position,
8881 "left-hand operand of comma expression has no effect");
8884 expression->base.type = expression->right->base.type;
8888 * @param prec_r precedence of the right operand
8890 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8891 static expression_t *parse_##binexpression_type(expression_t *left) \
8893 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8894 binexpr->binary.left = left; \
8897 expression_t *right = parse_sub_expression(prec_r); \
8899 binexpr->binary.right = right; \
8900 sfunc(&binexpr->binary); \
8905 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8906 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8907 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8908 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8909 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8910 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8911 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8912 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8913 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8914 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8915 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8916 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8917 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8918 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8919 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8920 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8921 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8922 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8923 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8924 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8925 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8926 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8927 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8928 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8929 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8930 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8931 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8932 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8933 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8934 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8937 static expression_t *parse_sub_expression(precedence_t precedence)
8939 if (token.type < 0) {
8940 return expected_expression_error();
8943 expression_parser_function_t *parser
8944 = &expression_parsers[token.type];
8945 source_position_t source_position = token.source_position;
8948 if (parser->parser != NULL) {
8949 left = parser->parser();
8951 left = parse_primary_expression();
8953 assert(left != NULL);
8954 left->base.source_position = source_position;
8957 if (token.type < 0) {
8958 return expected_expression_error();
8961 parser = &expression_parsers[token.type];
8962 if (parser->infix_parser == NULL)
8964 if (parser->infix_precedence < precedence)
8967 left = parser->infix_parser(left);
8969 assert(left != NULL);
8970 assert(left->kind != EXPR_UNKNOWN);
8971 left->base.source_position = source_position;
8978 * Parse an expression.
8980 static expression_t *parse_expression(void)
8982 return parse_sub_expression(PREC_EXPRESSION);
8986 * Register a parser for a prefix-like operator.
8988 * @param parser the parser function
8989 * @param token_type the token type of the prefix token
8991 static void register_expression_parser(parse_expression_function parser,
8994 expression_parser_function_t *entry = &expression_parsers[token_type];
8996 if (entry->parser != NULL) {
8997 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8998 panic("trying to register multiple expression parsers for a token");
9000 entry->parser = parser;
9004 * Register a parser for an infix operator with given precedence.
9006 * @param parser the parser function
9007 * @param token_type the token type of the infix operator
9008 * @param precedence the precedence of the operator
9010 static void register_infix_parser(parse_expression_infix_function parser,
9011 int token_type, precedence_t precedence)
9013 expression_parser_function_t *entry = &expression_parsers[token_type];
9015 if (entry->infix_parser != NULL) {
9016 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9017 panic("trying to register multiple infix expression parsers for a "
9020 entry->infix_parser = parser;
9021 entry->infix_precedence = precedence;
9025 * Initialize the expression parsers.
9027 static void init_expression_parsers(void)
9029 memset(&expression_parsers, 0, sizeof(expression_parsers));
9031 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9032 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9033 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9034 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9035 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9036 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9037 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9038 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9039 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9040 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9041 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9042 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9043 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9044 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9045 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9046 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9047 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9048 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9049 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9050 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9051 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9052 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9053 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9054 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9055 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9056 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9057 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9058 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9059 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9060 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9061 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9062 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9063 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9064 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9065 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9066 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9067 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9069 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9070 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9071 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9072 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9073 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9074 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9075 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9076 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9077 register_expression_parser(parse_sizeof, T_sizeof);
9078 register_expression_parser(parse_alignof, T___alignof__);
9079 register_expression_parser(parse_extension, T___extension__);
9080 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9081 register_expression_parser(parse_delete, T_delete);
9082 register_expression_parser(parse_throw, T_throw);
9086 * Parse a asm statement arguments specification.
9088 static asm_argument_t *parse_asm_arguments(bool is_out)
9090 asm_argument_t *result = NULL;
9091 asm_argument_t **anchor = &result;
9093 while (token.type == T_STRING_LITERAL || token.type == '[') {
9094 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9095 memset(argument, 0, sizeof(argument[0]));
9098 if (token.type != T_IDENTIFIER) {
9099 parse_error_expected("while parsing asm argument",
9100 T_IDENTIFIER, NULL);
9103 argument->symbol = token.symbol;
9105 expect(']', end_error);
9108 argument->constraints = parse_string_literals();
9109 expect('(', end_error);
9110 add_anchor_token(')');
9111 expression_t *expression = parse_expression();
9112 rem_anchor_token(')');
9114 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9115 * change size or type representation (e.g. int -> long is ok, but
9116 * int -> float is not) */
9117 if (expression->kind == EXPR_UNARY_CAST) {
9118 type_t *const type = expression->base.type;
9119 type_kind_t const kind = type->kind;
9120 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9123 if (kind == TYPE_ATOMIC) {
9124 atomic_type_kind_t const akind = type->atomic.akind;
9125 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9126 size = get_atomic_type_size(akind);
9128 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9129 size = get_atomic_type_size(get_intptr_kind());
9133 expression_t *const value = expression->unary.value;
9134 type_t *const value_type = value->base.type;
9135 type_kind_t const value_kind = value_type->kind;
9137 unsigned value_flags;
9138 unsigned value_size;
9139 if (value_kind == TYPE_ATOMIC) {
9140 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9141 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9142 value_size = get_atomic_type_size(value_akind);
9143 } else if (value_kind == TYPE_POINTER) {
9144 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9145 value_size = get_atomic_type_size(get_intptr_kind());
9150 if (value_flags != flags || value_size != size)
9154 } while (expression->kind == EXPR_UNARY_CAST);
9158 if (!is_lvalue(expression)) {
9159 errorf(&expression->base.source_position,
9160 "asm output argument is not an lvalue");
9163 if (argument->constraints.begin[0] == '=')
9164 determine_lhs_ent(expression, NULL);
9166 mark_vars_read(expression, NULL);
9168 mark_vars_read(expression, NULL);
9170 argument->expression = expression;
9171 expect(')', end_error);
9173 set_address_taken(expression, true);
9176 anchor = &argument->next;
9188 * Parse a asm statement clobber specification.
9190 static asm_clobber_t *parse_asm_clobbers(void)
9192 asm_clobber_t *result = NULL;
9193 asm_clobber_t **anchor = &result;
9195 while (token.type == T_STRING_LITERAL) {
9196 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9197 clobber->clobber = parse_string_literals();
9200 anchor = &clobber->next;
9210 * Parse an asm statement.
9212 static statement_t *parse_asm_statement(void)
9214 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9215 asm_statement_t *asm_statement = &statement->asms;
9219 if (next_if(T_volatile))
9220 asm_statement->is_volatile = true;
9222 expect('(', end_error);
9223 add_anchor_token(')');
9224 add_anchor_token(':');
9225 asm_statement->asm_text = parse_string_literals();
9227 if (!next_if(':')) {
9228 rem_anchor_token(':');
9232 asm_statement->outputs = parse_asm_arguments(true);
9233 if (!next_if(':')) {
9234 rem_anchor_token(':');
9238 asm_statement->inputs = parse_asm_arguments(false);
9239 if (!next_if(':')) {
9240 rem_anchor_token(':');
9243 rem_anchor_token(':');
9245 asm_statement->clobbers = parse_asm_clobbers();
9248 rem_anchor_token(')');
9249 expect(')', end_error);
9250 expect(';', end_error);
9252 if (asm_statement->outputs == NULL) {
9253 /* GCC: An 'asm' instruction without any output operands will be treated
9254 * identically to a volatile 'asm' instruction. */
9255 asm_statement->is_volatile = true;
9260 return create_invalid_statement();
9264 * Parse a case statement.
9266 static statement_t *parse_case_statement(void)
9268 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9269 source_position_t *const pos = &statement->base.source_position;
9273 expression_t *const expression = parse_expression();
9274 statement->case_label.expression = expression;
9275 if (!is_constant_expression(expression)) {
9276 /* This check does not prevent the error message in all cases of an
9277 * prior error while parsing the expression. At least it catches the
9278 * common case of a mistyped enum entry. */
9279 if (is_type_valid(skip_typeref(expression->base.type))) {
9280 errorf(pos, "case label does not reduce to an integer constant");
9282 statement->case_label.is_bad = true;
9284 long const val = fold_constant_to_int(expression);
9285 statement->case_label.first_case = val;
9286 statement->case_label.last_case = val;
9290 if (next_if(T_DOTDOTDOT)) {
9291 expression_t *const end_range = parse_expression();
9292 statement->case_label.end_range = end_range;
9293 if (!is_constant_expression(end_range)) {
9294 /* This check does not prevent the error message in all cases of an
9295 * prior error while parsing the expression. At least it catches the
9296 * common case of a mistyped enum entry. */
9297 if (is_type_valid(skip_typeref(end_range->base.type))) {
9298 errorf(pos, "case range does not reduce to an integer constant");
9300 statement->case_label.is_bad = true;
9302 long const val = fold_constant_to_int(end_range);
9303 statement->case_label.last_case = val;
9305 if (warning.other && val < statement->case_label.first_case) {
9306 statement->case_label.is_empty_range = true;
9307 warningf(pos, "empty range specified");
9313 PUSH_PARENT(statement);
9315 expect(':', end_error);
9318 if (current_switch != NULL) {
9319 if (! statement->case_label.is_bad) {
9320 /* Check for duplicate case values */
9321 case_label_statement_t *c = &statement->case_label;
9322 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9323 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9326 if (c->last_case < l->first_case || c->first_case > l->last_case)
9329 errorf(pos, "duplicate case value (previously used %P)",
9330 &l->base.source_position);
9334 /* link all cases into the switch statement */
9335 if (current_switch->last_case == NULL) {
9336 current_switch->first_case = &statement->case_label;
9338 current_switch->last_case->next = &statement->case_label;
9340 current_switch->last_case = &statement->case_label;
9342 errorf(pos, "case label not within a switch statement");
9345 statement_t *const inner_stmt = parse_statement();
9346 statement->case_label.statement = inner_stmt;
9347 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9348 errorf(&inner_stmt->base.source_position, "declaration after case label");
9356 * Parse a default statement.
9358 static statement_t *parse_default_statement(void)
9360 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9364 PUSH_PARENT(statement);
9366 expect(':', end_error);
9367 if (current_switch != NULL) {
9368 const case_label_statement_t *def_label = current_switch->default_label;
9369 if (def_label != NULL) {
9370 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9371 &def_label->base.source_position);
9373 current_switch->default_label = &statement->case_label;
9375 /* link all cases into the switch statement */
9376 if (current_switch->last_case == NULL) {
9377 current_switch->first_case = &statement->case_label;
9379 current_switch->last_case->next = &statement->case_label;
9381 current_switch->last_case = &statement->case_label;
9384 errorf(&statement->base.source_position,
9385 "'default' label not within a switch statement");
9388 statement_t *const inner_stmt = parse_statement();
9389 statement->case_label.statement = inner_stmt;
9390 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9391 errorf(&inner_stmt->base.source_position, "declaration after default label");
9398 return create_invalid_statement();
9402 * Parse a label statement.
9404 static statement_t *parse_label_statement(void)
9406 assert(token.type == T_IDENTIFIER);
9407 symbol_t *symbol = token.symbol;
9408 label_t *label = get_label(symbol);
9410 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9411 statement->label.label = label;
9415 PUSH_PARENT(statement);
9417 /* if statement is already set then the label is defined twice,
9418 * otherwise it was just mentioned in a goto/local label declaration so far
9420 if (label->statement != NULL) {
9421 errorf(HERE, "duplicate label '%Y' (declared %P)",
9422 symbol, &label->base.source_position);
9424 label->base.source_position = token.source_position;
9425 label->statement = statement;
9430 if (token.type == '}') {
9431 errorf(HERE, "label at end of compound statement");
9432 statement->label.statement = create_invalid_statement();
9433 } else if (token.type == ';') {
9434 /* Eat an empty statement here, to avoid the warning about an empty
9435 * statement after a label. label:; is commonly used to have a label
9436 * before a closing brace. */
9437 statement->label.statement = create_empty_statement();
9440 statement_t *const inner_stmt = parse_statement();
9441 statement->label.statement = inner_stmt;
9442 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9443 errorf(&inner_stmt->base.source_position, "declaration after label");
9447 /* remember the labels in a list for later checking */
9448 *label_anchor = &statement->label;
9449 label_anchor = &statement->label.next;
9456 * Parse an if statement.
9458 static statement_t *parse_if(void)
9460 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9464 PUSH_PARENT(statement);
9466 add_anchor_token('{');
9468 expect('(', end_error);
9469 add_anchor_token(')');
9470 expression_t *const expr = parse_expression();
9471 statement->ifs.condition = expr;
9472 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9474 semantic_condition(expr, "condition of 'if'-statment");
9475 mark_vars_read(expr, NULL);
9476 rem_anchor_token(')');
9477 expect(')', end_error);
9480 rem_anchor_token('{');
9482 add_anchor_token(T_else);
9483 statement_t *const true_stmt = parse_statement();
9484 statement->ifs.true_statement = true_stmt;
9485 rem_anchor_token(T_else);
9487 if (next_if(T_else)) {
9488 statement->ifs.false_statement = parse_statement();
9489 } else if (warning.parentheses &&
9490 true_stmt->kind == STATEMENT_IF &&
9491 true_stmt->ifs.false_statement != NULL) {
9492 warningf(&true_stmt->base.source_position,
9493 "suggest explicit braces to avoid ambiguous 'else'");
9501 * Check that all enums are handled in a switch.
9503 * @param statement the switch statement to check
9505 static void check_enum_cases(const switch_statement_t *statement)
9507 const type_t *type = skip_typeref(statement->expression->base.type);
9508 if (! is_type_enum(type))
9510 const enum_type_t *enumt = &type->enumt;
9512 /* if we have a default, no warnings */
9513 if (statement->default_label != NULL)
9516 /* FIXME: calculation of value should be done while parsing */
9517 /* TODO: quadratic algorithm here. Change to an n log n one */
9518 long last_value = -1;
9519 const entity_t *entry = enumt->enume->base.next;
9520 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9521 entry = entry->base.next) {
9522 const expression_t *expression = entry->enum_value.value;
9523 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9525 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9526 if (l->expression == NULL)
9528 if (l->first_case <= value && value <= l->last_case) {
9534 warningf(&statement->base.source_position,
9535 "enumeration value '%Y' not handled in switch",
9536 entry->base.symbol);
9543 * Parse a switch statement.
9545 static statement_t *parse_switch(void)
9547 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9551 PUSH_PARENT(statement);
9553 expect('(', end_error);
9554 add_anchor_token(')');
9555 expression_t *const expr = parse_expression();
9556 mark_vars_read(expr, NULL);
9557 type_t * type = skip_typeref(expr->base.type);
9558 if (is_type_integer(type)) {
9559 type = promote_integer(type);
9560 if (warning.traditional) {
9561 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9562 warningf(&expr->base.source_position,
9563 "'%T' switch expression not converted to '%T' in ISO C",
9567 } else if (is_type_valid(type)) {
9568 errorf(&expr->base.source_position,
9569 "switch quantity is not an integer, but '%T'", type);
9570 type = type_error_type;
9572 statement->switchs.expression = create_implicit_cast(expr, type);
9573 expect(')', end_error);
9574 rem_anchor_token(')');
9576 switch_statement_t *rem = current_switch;
9577 current_switch = &statement->switchs;
9578 statement->switchs.body = parse_statement();
9579 current_switch = rem;
9581 if (warning.switch_default &&
9582 statement->switchs.default_label == NULL) {
9583 warningf(&statement->base.source_position, "switch has no default case");
9585 if (warning.switch_enum)
9586 check_enum_cases(&statement->switchs);
9592 return create_invalid_statement();
9595 static statement_t *parse_loop_body(statement_t *const loop)
9597 statement_t *const rem = current_loop;
9598 current_loop = loop;
9600 statement_t *const body = parse_statement();
9607 * Parse a while statement.
9609 static statement_t *parse_while(void)
9611 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9615 PUSH_PARENT(statement);
9617 expect('(', end_error);
9618 add_anchor_token(')');
9619 expression_t *const cond = parse_expression();
9620 statement->whiles.condition = cond;
9621 /* §6.8.5:2 The controlling expression of an iteration statement shall
9622 * have scalar type. */
9623 semantic_condition(cond, "condition of 'while'-statement");
9624 mark_vars_read(cond, NULL);
9625 rem_anchor_token(')');
9626 expect(')', end_error);
9628 statement->whiles.body = parse_loop_body(statement);
9634 return create_invalid_statement();
9638 * Parse a do statement.
9640 static statement_t *parse_do(void)
9642 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9646 PUSH_PARENT(statement);
9648 add_anchor_token(T_while);
9649 statement->do_while.body = parse_loop_body(statement);
9650 rem_anchor_token(T_while);
9652 expect(T_while, end_error);
9653 expect('(', end_error);
9654 add_anchor_token(')');
9655 expression_t *const cond = parse_expression();
9656 statement->do_while.condition = cond;
9657 /* §6.8.5:2 The controlling expression of an iteration statement shall
9658 * have scalar type. */
9659 semantic_condition(cond, "condition of 'do-while'-statement");
9660 mark_vars_read(cond, NULL);
9661 rem_anchor_token(')');
9662 expect(')', end_error);
9663 expect(';', end_error);
9669 return create_invalid_statement();
9673 * Parse a for statement.
9675 static statement_t *parse_for(void)
9677 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9681 expect('(', end_error1);
9682 add_anchor_token(')');
9684 PUSH_PARENT(statement);
9686 size_t const top = environment_top();
9687 scope_t *old_scope = scope_push(&statement->fors.scope);
9689 bool old_gcc_extension = in_gcc_extension;
9690 while (next_if(T___extension__)) {
9691 in_gcc_extension = true;
9695 } else if (is_declaration_specifier(&token, false)) {
9696 parse_declaration(record_entity, DECL_FLAGS_NONE);
9698 add_anchor_token(';');
9699 expression_t *const init = parse_expression();
9700 statement->fors.initialisation = init;
9701 mark_vars_read(init, ENT_ANY);
9702 if (warning.unused_value && !expression_has_effect(init)) {
9703 warningf(&init->base.source_position,
9704 "initialisation of 'for'-statement has no effect");
9706 rem_anchor_token(';');
9707 expect(';', end_error2);
9709 in_gcc_extension = old_gcc_extension;
9711 if (token.type != ';') {
9712 add_anchor_token(';');
9713 expression_t *const cond = parse_expression();
9714 statement->fors.condition = cond;
9715 /* §6.8.5:2 The controlling expression of an iteration statement
9716 * shall have scalar type. */
9717 semantic_condition(cond, "condition of 'for'-statement");
9718 mark_vars_read(cond, NULL);
9719 rem_anchor_token(';');
9721 expect(';', end_error2);
9722 if (token.type != ')') {
9723 expression_t *const step = parse_expression();
9724 statement->fors.step = step;
9725 mark_vars_read(step, ENT_ANY);
9726 if (warning.unused_value && !expression_has_effect(step)) {
9727 warningf(&step->base.source_position,
9728 "step of 'for'-statement has no effect");
9731 expect(')', end_error2);
9732 rem_anchor_token(')');
9733 statement->fors.body = parse_loop_body(statement);
9735 assert(current_scope == &statement->fors.scope);
9736 scope_pop(old_scope);
9737 environment_pop_to(top);
9744 rem_anchor_token(')');
9745 assert(current_scope == &statement->fors.scope);
9746 scope_pop(old_scope);
9747 environment_pop_to(top);
9751 return create_invalid_statement();
9755 * Parse a goto statement.
9757 static statement_t *parse_goto(void)
9759 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9762 if (GNU_MODE && next_if('*')) {
9763 expression_t *expression = parse_expression();
9764 mark_vars_read(expression, NULL);
9766 /* Argh: although documentation says the expression must be of type void*,
9767 * gcc accepts anything that can be casted into void* without error */
9768 type_t *type = expression->base.type;
9770 if (type != type_error_type) {
9771 if (!is_type_pointer(type) && !is_type_integer(type)) {
9772 errorf(&expression->base.source_position,
9773 "cannot convert to a pointer type");
9774 } else if (warning.other && type != type_void_ptr) {
9775 warningf(&expression->base.source_position,
9776 "type of computed goto expression should be 'void*' not '%T'", type);
9778 expression = create_implicit_cast(expression, type_void_ptr);
9781 statement->gotos.expression = expression;
9782 } else if (token.type == T_IDENTIFIER) {
9783 symbol_t *symbol = token.symbol;
9785 statement->gotos.label = get_label(symbol);
9788 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9790 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9795 /* remember the goto's in a list for later checking */
9796 *goto_anchor = &statement->gotos;
9797 goto_anchor = &statement->gotos.next;
9799 expect(';', end_error);
9803 return create_invalid_statement();
9807 * Parse a continue statement.
9809 static statement_t *parse_continue(void)
9811 if (current_loop == NULL) {
9812 errorf(HERE, "continue statement not within loop");
9815 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9818 expect(';', end_error);
9825 * Parse a break statement.
9827 static statement_t *parse_break(void)
9829 if (current_switch == NULL && current_loop == NULL) {
9830 errorf(HERE, "break statement not within loop or switch");
9833 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9836 expect(';', end_error);
9843 * Parse a __leave statement.
9845 static statement_t *parse_leave_statement(void)
9847 if (current_try == NULL) {
9848 errorf(HERE, "__leave statement not within __try");
9851 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9854 expect(';', end_error);
9861 * Check if a given entity represents a local variable.
9863 static bool is_local_variable(const entity_t *entity)
9865 if (entity->kind != ENTITY_VARIABLE)
9868 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9869 case STORAGE_CLASS_AUTO:
9870 case STORAGE_CLASS_REGISTER: {
9871 const type_t *type = skip_typeref(entity->declaration.type);
9872 if (is_type_function(type)) {
9884 * Check if a given expression represents a local variable.
9886 static bool expression_is_local_variable(const expression_t *expression)
9888 if (expression->base.kind != EXPR_REFERENCE) {
9891 const entity_t *entity = expression->reference.entity;
9892 return is_local_variable(entity);
9896 * Check if a given expression represents a local variable and
9897 * return its declaration then, else return NULL.
9899 entity_t *expression_is_variable(const expression_t *expression)
9901 if (expression->base.kind != EXPR_REFERENCE) {
9904 entity_t *entity = expression->reference.entity;
9905 if (entity->kind != ENTITY_VARIABLE)
9912 * Parse a return statement.
9914 static statement_t *parse_return(void)
9918 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9920 expression_t *return_value = NULL;
9921 if (token.type != ';') {
9922 return_value = parse_expression();
9923 mark_vars_read(return_value, NULL);
9926 const type_t *const func_type = skip_typeref(current_function->base.type);
9927 assert(is_type_function(func_type));
9928 type_t *const return_type = skip_typeref(func_type->function.return_type);
9930 source_position_t const *const pos = &statement->base.source_position;
9931 if (return_value != NULL) {
9932 type_t *return_value_type = skip_typeref(return_value->base.type);
9934 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9935 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9936 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9937 /* Only warn in C mode, because GCC does the same */
9938 if (c_mode & _CXX || strict_mode) {
9940 "'return' with a value, in function returning 'void'");
9941 } else if (warning.other) {
9943 "'return' with a value, in function returning 'void'");
9945 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9946 /* Only warn in C mode, because GCC does the same */
9949 "'return' with expression in function returning 'void'");
9950 } else if (warning.other) {
9952 "'return' with expression in function returning 'void'");
9956 assign_error_t error = semantic_assign(return_type, return_value);
9957 report_assign_error(error, return_type, return_value, "'return'",
9960 return_value = create_implicit_cast(return_value, return_type);
9961 /* check for returning address of a local var */
9962 if (warning.other && return_value != NULL
9963 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9964 const expression_t *expression = return_value->unary.value;
9965 if (expression_is_local_variable(expression)) {
9966 warningf(pos, "function returns address of local variable");
9969 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9970 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9971 if (c_mode & _CXX || strict_mode) {
9973 "'return' without value, in function returning non-void");
9976 "'return' without value, in function returning non-void");
9979 statement->returns.value = return_value;
9981 expect(';', end_error);
9988 * Parse a declaration statement.
9990 static statement_t *parse_declaration_statement(void)
9992 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9994 entity_t *before = current_scope->last_entity;
9996 parse_external_declaration();
9998 parse_declaration(record_entity, DECL_FLAGS_NONE);
10001 declaration_statement_t *const decl = &statement->declaration;
10002 entity_t *const begin =
10003 before != NULL ? before->base.next : current_scope->entities;
10004 decl->declarations_begin = begin;
10005 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10011 * Parse an expression statement, ie. expr ';'.
10013 static statement_t *parse_expression_statement(void)
10015 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10017 expression_t *const expr = parse_expression();
10018 statement->expression.expression = expr;
10019 mark_vars_read(expr, ENT_ANY);
10021 expect(';', end_error);
10028 * Parse a microsoft __try { } __finally { } or
10029 * __try{ } __except() { }
10031 static statement_t *parse_ms_try_statment(void)
10033 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10036 PUSH_PARENT(statement);
10038 ms_try_statement_t *rem = current_try;
10039 current_try = &statement->ms_try;
10040 statement->ms_try.try_statement = parse_compound_statement(false);
10045 if (next_if(T___except)) {
10046 expect('(', end_error);
10047 add_anchor_token(')');
10048 expression_t *const expr = parse_expression();
10049 mark_vars_read(expr, NULL);
10050 type_t * type = skip_typeref(expr->base.type);
10051 if (is_type_integer(type)) {
10052 type = promote_integer(type);
10053 } else if (is_type_valid(type)) {
10054 errorf(&expr->base.source_position,
10055 "__expect expression is not an integer, but '%T'", type);
10056 type = type_error_type;
10058 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10059 rem_anchor_token(')');
10060 expect(')', end_error);
10061 statement->ms_try.final_statement = parse_compound_statement(false);
10062 } else if (next_if(T__finally)) {
10063 statement->ms_try.final_statement = parse_compound_statement(false);
10065 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10066 return create_invalid_statement();
10070 return create_invalid_statement();
10073 static statement_t *parse_empty_statement(void)
10075 if (warning.empty_statement) {
10076 warningf(HERE, "statement is empty");
10078 statement_t *const statement = create_empty_statement();
10083 static statement_t *parse_local_label_declaration(void)
10085 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10089 entity_t *begin = NULL, *end = NULL;
10092 if (token.type != T_IDENTIFIER) {
10093 parse_error_expected("while parsing local label declaration",
10094 T_IDENTIFIER, NULL);
10097 symbol_t *symbol = token.symbol;
10098 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10099 if (entity != NULL && entity->base.parent_scope == current_scope) {
10100 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10101 symbol, &entity->base.source_position);
10103 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10105 entity->base.parent_scope = current_scope;
10106 entity->base.namespc = NAMESPACE_LABEL;
10107 entity->base.source_position = token.source_position;
10108 entity->base.symbol = symbol;
10111 end->base.next = entity;
10116 environment_push(entity);
10119 } while (next_if(','));
10122 statement->declaration.declarations_begin = begin;
10123 statement->declaration.declarations_end = end;
10127 static void parse_namespace_definition(void)
10131 entity_t *entity = NULL;
10132 symbol_t *symbol = NULL;
10134 if (token.type == T_IDENTIFIER) {
10135 symbol = token.symbol;
10138 entity = get_entity(symbol, NAMESPACE_NORMAL);
10140 && entity->kind != ENTITY_NAMESPACE
10141 && entity->base.parent_scope == current_scope) {
10142 if (!is_error_entity(entity)) {
10143 error_redefined_as_different_kind(&token.source_position,
10144 entity, ENTITY_NAMESPACE);
10150 if (entity == NULL) {
10151 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10152 entity->base.symbol = symbol;
10153 entity->base.source_position = token.source_position;
10154 entity->base.namespc = NAMESPACE_NORMAL;
10155 entity->base.parent_scope = current_scope;
10158 if (token.type == '=') {
10159 /* TODO: parse namespace alias */
10160 panic("namespace alias definition not supported yet");
10163 environment_push(entity);
10164 append_entity(current_scope, entity);
10166 size_t const top = environment_top();
10167 scope_t *old_scope = scope_push(&entity->namespacee.members);
10169 entity_t *old_current_entity = current_entity;
10170 current_entity = entity;
10172 expect('{', end_error);
10174 expect('}', end_error);
10177 assert(current_scope == &entity->namespacee.members);
10178 assert(current_entity == entity);
10179 current_entity = old_current_entity;
10180 scope_pop(old_scope);
10181 environment_pop_to(top);
10185 * Parse a statement.
10186 * There's also parse_statement() which additionally checks for
10187 * "statement has no effect" warnings
10189 static statement_t *intern_parse_statement(void)
10191 statement_t *statement = NULL;
10193 /* declaration or statement */
10194 add_anchor_token(';');
10195 switch (token.type) {
10196 case T_IDENTIFIER: {
10197 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10198 if (la1_type == ':') {
10199 statement = parse_label_statement();
10200 } else if (is_typedef_symbol(token.symbol)) {
10201 statement = parse_declaration_statement();
10203 /* it's an identifier, the grammar says this must be an
10204 * expression statement. However it is common that users mistype
10205 * declaration types, so we guess a bit here to improve robustness
10206 * for incorrect programs */
10207 switch (la1_type) {
10210 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL)
10211 goto expression_statment;
10216 statement = parse_declaration_statement();
10220 expression_statment:
10221 statement = parse_expression_statement();
10228 case T___extension__:
10229 /* This can be a prefix to a declaration or an expression statement.
10230 * We simply eat it now and parse the rest with tail recursion. */
10231 while (next_if(T___extension__)) {}
10232 bool old_gcc_extension = in_gcc_extension;
10233 in_gcc_extension = true;
10234 statement = intern_parse_statement();
10235 in_gcc_extension = old_gcc_extension;
10239 statement = parse_declaration_statement();
10243 statement = parse_local_label_declaration();
10246 case ';': statement = parse_empty_statement(); break;
10247 case '{': statement = parse_compound_statement(false); break;
10248 case T___leave: statement = parse_leave_statement(); break;
10249 case T___try: statement = parse_ms_try_statment(); break;
10250 case T_asm: statement = parse_asm_statement(); break;
10251 case T_break: statement = parse_break(); break;
10252 case T_case: statement = parse_case_statement(); break;
10253 case T_continue: statement = parse_continue(); break;
10254 case T_default: statement = parse_default_statement(); break;
10255 case T_do: statement = parse_do(); break;
10256 case T_for: statement = parse_for(); break;
10257 case T_goto: statement = parse_goto(); break;
10258 case T_if: statement = parse_if(); break;
10259 case T_return: statement = parse_return(); break;
10260 case T_switch: statement = parse_switch(); break;
10261 case T_while: statement = parse_while(); break;
10264 statement = parse_expression_statement();
10268 errorf(HERE, "unexpected token %K while parsing statement", &token);
10269 statement = create_invalid_statement();
10274 rem_anchor_token(';');
10276 assert(statement != NULL
10277 && statement->base.source_position.input_name != NULL);
10283 * parse a statement and emits "statement has no effect" warning if needed
10284 * (This is really a wrapper around intern_parse_statement with check for 1
10285 * single warning. It is needed, because for statement expressions we have
10286 * to avoid the warning on the last statement)
10288 static statement_t *parse_statement(void)
10290 statement_t *statement = intern_parse_statement();
10292 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10293 expression_t *expression = statement->expression.expression;
10294 if (!expression_has_effect(expression)) {
10295 warningf(&expression->base.source_position,
10296 "statement has no effect");
10304 * Parse a compound statement.
10306 static statement_t *parse_compound_statement(bool inside_expression_statement)
10308 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10310 PUSH_PARENT(statement);
10313 add_anchor_token('}');
10314 /* tokens, which can start a statement */
10315 /* TODO MS, __builtin_FOO */
10316 add_anchor_token('!');
10317 add_anchor_token('&');
10318 add_anchor_token('(');
10319 add_anchor_token('*');
10320 add_anchor_token('+');
10321 add_anchor_token('-');
10322 add_anchor_token('{');
10323 add_anchor_token('~');
10324 add_anchor_token(T_CHARACTER_CONSTANT);
10325 add_anchor_token(T_COLONCOLON);
10326 add_anchor_token(T_FLOATINGPOINT);
10327 add_anchor_token(T_IDENTIFIER);
10328 add_anchor_token(T_INTEGER);
10329 add_anchor_token(T_MINUSMINUS);
10330 add_anchor_token(T_PLUSPLUS);
10331 add_anchor_token(T_STRING_LITERAL);
10332 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10333 add_anchor_token(T_WIDE_STRING_LITERAL);
10334 add_anchor_token(T__Bool);
10335 add_anchor_token(T__Complex);
10336 add_anchor_token(T__Imaginary);
10337 add_anchor_token(T___FUNCTION__);
10338 add_anchor_token(T___PRETTY_FUNCTION__);
10339 add_anchor_token(T___alignof__);
10340 add_anchor_token(T___attribute__);
10341 add_anchor_token(T___builtin_va_start);
10342 add_anchor_token(T___extension__);
10343 add_anchor_token(T___func__);
10344 add_anchor_token(T___imag__);
10345 add_anchor_token(T___label__);
10346 add_anchor_token(T___real__);
10347 add_anchor_token(T___thread);
10348 add_anchor_token(T_asm);
10349 add_anchor_token(T_auto);
10350 add_anchor_token(T_bool);
10351 add_anchor_token(T_break);
10352 add_anchor_token(T_case);
10353 add_anchor_token(T_char);
10354 add_anchor_token(T_class);
10355 add_anchor_token(T_const);
10356 add_anchor_token(T_const_cast);
10357 add_anchor_token(T_continue);
10358 add_anchor_token(T_default);
10359 add_anchor_token(T_delete);
10360 add_anchor_token(T_double);
10361 add_anchor_token(T_do);
10362 add_anchor_token(T_dynamic_cast);
10363 add_anchor_token(T_enum);
10364 add_anchor_token(T_extern);
10365 add_anchor_token(T_false);
10366 add_anchor_token(T_float);
10367 add_anchor_token(T_for);
10368 add_anchor_token(T_goto);
10369 add_anchor_token(T_if);
10370 add_anchor_token(T_inline);
10371 add_anchor_token(T_int);
10372 add_anchor_token(T_long);
10373 add_anchor_token(T_new);
10374 add_anchor_token(T_operator);
10375 add_anchor_token(T_register);
10376 add_anchor_token(T_reinterpret_cast);
10377 add_anchor_token(T_restrict);
10378 add_anchor_token(T_return);
10379 add_anchor_token(T_short);
10380 add_anchor_token(T_signed);
10381 add_anchor_token(T_sizeof);
10382 add_anchor_token(T_static);
10383 add_anchor_token(T_static_cast);
10384 add_anchor_token(T_struct);
10385 add_anchor_token(T_switch);
10386 add_anchor_token(T_template);
10387 add_anchor_token(T_this);
10388 add_anchor_token(T_throw);
10389 add_anchor_token(T_true);
10390 add_anchor_token(T_try);
10391 add_anchor_token(T_typedef);
10392 add_anchor_token(T_typeid);
10393 add_anchor_token(T_typename);
10394 add_anchor_token(T_typeof);
10395 add_anchor_token(T_union);
10396 add_anchor_token(T_unsigned);
10397 add_anchor_token(T_using);
10398 add_anchor_token(T_void);
10399 add_anchor_token(T_volatile);
10400 add_anchor_token(T_wchar_t);
10401 add_anchor_token(T_while);
10403 size_t const top = environment_top();
10404 scope_t *old_scope = scope_push(&statement->compound.scope);
10406 statement_t **anchor = &statement->compound.statements;
10407 bool only_decls_so_far = true;
10408 while (token.type != '}') {
10409 if (token.type == T_EOF) {
10410 errorf(&statement->base.source_position,
10411 "EOF while parsing compound statement");
10414 statement_t *sub_statement = intern_parse_statement();
10415 if (is_invalid_statement(sub_statement)) {
10416 /* an error occurred. if we are at an anchor, return */
10422 if (warning.declaration_after_statement) {
10423 if (sub_statement->kind != STATEMENT_DECLARATION) {
10424 only_decls_so_far = false;
10425 } else if (!only_decls_so_far) {
10426 warningf(&sub_statement->base.source_position,
10427 "ISO C90 forbids mixed declarations and code");
10431 *anchor = sub_statement;
10433 while (sub_statement->base.next != NULL)
10434 sub_statement = sub_statement->base.next;
10436 anchor = &sub_statement->base.next;
10440 /* look over all statements again to produce no effect warnings */
10441 if (warning.unused_value) {
10442 statement_t *sub_statement = statement->compound.statements;
10443 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10444 if (sub_statement->kind != STATEMENT_EXPRESSION)
10446 /* don't emit a warning for the last expression in an expression
10447 * statement as it has always an effect */
10448 if (inside_expression_statement && sub_statement->base.next == NULL)
10451 expression_t *expression = sub_statement->expression.expression;
10452 if (!expression_has_effect(expression)) {
10453 warningf(&expression->base.source_position,
10454 "statement has no effect");
10460 rem_anchor_token(T_while);
10461 rem_anchor_token(T_wchar_t);
10462 rem_anchor_token(T_volatile);
10463 rem_anchor_token(T_void);
10464 rem_anchor_token(T_using);
10465 rem_anchor_token(T_unsigned);
10466 rem_anchor_token(T_union);
10467 rem_anchor_token(T_typeof);
10468 rem_anchor_token(T_typename);
10469 rem_anchor_token(T_typeid);
10470 rem_anchor_token(T_typedef);
10471 rem_anchor_token(T_try);
10472 rem_anchor_token(T_true);
10473 rem_anchor_token(T_throw);
10474 rem_anchor_token(T_this);
10475 rem_anchor_token(T_template);
10476 rem_anchor_token(T_switch);
10477 rem_anchor_token(T_struct);
10478 rem_anchor_token(T_static_cast);
10479 rem_anchor_token(T_static);
10480 rem_anchor_token(T_sizeof);
10481 rem_anchor_token(T_signed);
10482 rem_anchor_token(T_short);
10483 rem_anchor_token(T_return);
10484 rem_anchor_token(T_restrict);
10485 rem_anchor_token(T_reinterpret_cast);
10486 rem_anchor_token(T_register);
10487 rem_anchor_token(T_operator);
10488 rem_anchor_token(T_new);
10489 rem_anchor_token(T_long);
10490 rem_anchor_token(T_int);
10491 rem_anchor_token(T_inline);
10492 rem_anchor_token(T_if);
10493 rem_anchor_token(T_goto);
10494 rem_anchor_token(T_for);
10495 rem_anchor_token(T_float);
10496 rem_anchor_token(T_false);
10497 rem_anchor_token(T_extern);
10498 rem_anchor_token(T_enum);
10499 rem_anchor_token(T_dynamic_cast);
10500 rem_anchor_token(T_do);
10501 rem_anchor_token(T_double);
10502 rem_anchor_token(T_delete);
10503 rem_anchor_token(T_default);
10504 rem_anchor_token(T_continue);
10505 rem_anchor_token(T_const_cast);
10506 rem_anchor_token(T_const);
10507 rem_anchor_token(T_class);
10508 rem_anchor_token(T_char);
10509 rem_anchor_token(T_case);
10510 rem_anchor_token(T_break);
10511 rem_anchor_token(T_bool);
10512 rem_anchor_token(T_auto);
10513 rem_anchor_token(T_asm);
10514 rem_anchor_token(T___thread);
10515 rem_anchor_token(T___real__);
10516 rem_anchor_token(T___label__);
10517 rem_anchor_token(T___imag__);
10518 rem_anchor_token(T___func__);
10519 rem_anchor_token(T___extension__);
10520 rem_anchor_token(T___builtin_va_start);
10521 rem_anchor_token(T___attribute__);
10522 rem_anchor_token(T___alignof__);
10523 rem_anchor_token(T___PRETTY_FUNCTION__);
10524 rem_anchor_token(T___FUNCTION__);
10525 rem_anchor_token(T__Imaginary);
10526 rem_anchor_token(T__Complex);
10527 rem_anchor_token(T__Bool);
10528 rem_anchor_token(T_WIDE_STRING_LITERAL);
10529 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10530 rem_anchor_token(T_STRING_LITERAL);
10531 rem_anchor_token(T_PLUSPLUS);
10532 rem_anchor_token(T_MINUSMINUS);
10533 rem_anchor_token(T_INTEGER);
10534 rem_anchor_token(T_IDENTIFIER);
10535 rem_anchor_token(T_FLOATINGPOINT);
10536 rem_anchor_token(T_COLONCOLON);
10537 rem_anchor_token(T_CHARACTER_CONSTANT);
10538 rem_anchor_token('~');
10539 rem_anchor_token('{');
10540 rem_anchor_token('-');
10541 rem_anchor_token('+');
10542 rem_anchor_token('*');
10543 rem_anchor_token('(');
10544 rem_anchor_token('&');
10545 rem_anchor_token('!');
10546 rem_anchor_token('}');
10547 assert(current_scope == &statement->compound.scope);
10548 scope_pop(old_scope);
10549 environment_pop_to(top);
10556 * Check for unused global static functions and variables
10558 static void check_unused_globals(void)
10560 if (!warning.unused_function && !warning.unused_variable)
10563 for (const entity_t *entity = file_scope->entities; entity != NULL;
10564 entity = entity->base.next) {
10565 if (!is_declaration(entity))
10568 const declaration_t *declaration = &entity->declaration;
10569 if (declaration->used ||
10570 declaration->modifiers & DM_UNUSED ||
10571 declaration->modifiers & DM_USED ||
10572 declaration->storage_class != STORAGE_CLASS_STATIC)
10575 type_t *const type = declaration->type;
10577 if (entity->kind == ENTITY_FUNCTION) {
10578 /* inhibit warning for static inline functions */
10579 if (entity->function.is_inline)
10582 s = entity->function.statement != NULL ? "defined" : "declared";
10587 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10588 type, declaration->base.symbol, s);
10592 static void parse_global_asm(void)
10594 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10597 expect('(', end_error);
10599 statement->asms.asm_text = parse_string_literals();
10600 statement->base.next = unit->global_asm;
10601 unit->global_asm = statement;
10603 expect(')', end_error);
10604 expect(';', end_error);
10609 static void parse_linkage_specification(void)
10612 assert(token.type == T_STRING_LITERAL);
10614 const char *linkage = parse_string_literals().begin;
10616 linkage_kind_t old_linkage = current_linkage;
10617 linkage_kind_t new_linkage;
10618 if (strcmp(linkage, "C") == 0) {
10619 new_linkage = LINKAGE_C;
10620 } else if (strcmp(linkage, "C++") == 0) {
10621 new_linkage = LINKAGE_CXX;
10623 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10624 new_linkage = LINKAGE_INVALID;
10626 current_linkage = new_linkage;
10628 if (next_if('{')) {
10630 expect('}', end_error);
10636 assert(current_linkage == new_linkage);
10637 current_linkage = old_linkage;
10640 static void parse_external(void)
10642 switch (token.type) {
10643 DECLARATION_START_NO_EXTERN
10645 case T___extension__:
10646 /* tokens below are for implicit int */
10647 case '&': /* & x; -> int& x; (and error later, because C++ has no
10649 case '*': /* * x; -> int* x; */
10650 case '(': /* (x); -> int (x); */
10651 parse_external_declaration();
10655 if (look_ahead(1)->type == T_STRING_LITERAL) {
10656 parse_linkage_specification();
10658 parse_external_declaration();
10663 parse_global_asm();
10667 parse_namespace_definition();
10671 if (!strict_mode) {
10673 warningf(HERE, "stray ';' outside of function");
10680 errorf(HERE, "stray %K outside of function", &token);
10681 if (token.type == '(' || token.type == '{' || token.type == '[')
10682 eat_until_matching_token(token.type);
10688 static void parse_externals(void)
10690 add_anchor_token('}');
10691 add_anchor_token(T_EOF);
10694 unsigned char token_anchor_copy[T_LAST_TOKEN];
10695 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10698 while (token.type != T_EOF && token.type != '}') {
10700 bool anchor_leak = false;
10701 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10702 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10704 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10705 anchor_leak = true;
10708 if (in_gcc_extension) {
10709 errorf(HERE, "Leaked __extension__");
10710 anchor_leak = true;
10720 rem_anchor_token(T_EOF);
10721 rem_anchor_token('}');
10725 * Parse a translation unit.
10727 static void parse_translation_unit(void)
10729 add_anchor_token(T_EOF);
10734 if (token.type == T_EOF)
10737 errorf(HERE, "stray %K outside of function", &token);
10738 if (token.type == '(' || token.type == '{' || token.type == '[')
10739 eat_until_matching_token(token.type);
10747 * @return the translation unit or NULL if errors occurred.
10749 void start_parsing(void)
10751 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10752 label_stack = NEW_ARR_F(stack_entry_t, 0);
10753 diagnostic_count = 0;
10757 print_to_file(stderr);
10759 assert(unit == NULL);
10760 unit = allocate_ast_zero(sizeof(unit[0]));
10762 assert(file_scope == NULL);
10763 file_scope = &unit->scope;
10765 assert(current_scope == NULL);
10766 scope_push(&unit->scope);
10768 create_gnu_builtins();
10770 create_microsoft_intrinsics();
10773 translation_unit_t *finish_parsing(void)
10775 assert(current_scope == &unit->scope);
10778 assert(file_scope == &unit->scope);
10779 check_unused_globals();
10782 DEL_ARR_F(environment_stack);
10783 DEL_ARR_F(label_stack);
10785 translation_unit_t *result = unit;
10790 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10791 * are given length one. */
10792 static void complete_incomplete_arrays(void)
10794 size_t n = ARR_LEN(incomplete_arrays);
10795 for (size_t i = 0; i != n; ++i) {
10796 declaration_t *const decl = incomplete_arrays[i];
10797 type_t *const orig_type = decl->type;
10798 type_t *const type = skip_typeref(orig_type);
10800 if (!is_type_incomplete(type))
10803 if (warning.other) {
10804 warningf(&decl->base.source_position,
10805 "array '%#T' assumed to have one element",
10806 orig_type, decl->base.symbol);
10809 type_t *const new_type = duplicate_type(type);
10810 new_type->array.size_constant = true;
10811 new_type->array.has_implicit_size = true;
10812 new_type->array.size = 1;
10814 type_t *const result = identify_new_type(new_type);
10816 decl->type = result;
10820 void prepare_main_collect2(entity_t *entity)
10822 // create call to __main
10823 symbol_t *symbol = symbol_table_insert("__main");
10824 entity_t *subsubmain_ent
10825 = create_implicit_function(symbol, &builtin_source_position);
10827 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10828 type_t *ftype = subsubmain_ent->declaration.type;
10829 ref->base.source_position = builtin_source_position;
10830 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10831 ref->reference.entity = subsubmain_ent;
10833 expression_t *call = allocate_expression_zero(EXPR_CALL);
10834 call->base.source_position = builtin_source_position;
10835 call->base.type = type_void;
10836 call->call.function = ref;
10838 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10839 expr_statement->base.source_position = builtin_source_position;
10840 expr_statement->expression.expression = call;
10842 statement_t *statement = entity->function.statement;
10843 assert(statement->kind == STATEMENT_COMPOUND);
10844 compound_statement_t *compounds = &statement->compound;
10846 expr_statement->base.next = compounds->statements;
10847 compounds->statements = expr_statement;
10852 lookahead_bufpos = 0;
10853 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10856 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10857 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10858 parse_translation_unit();
10859 complete_incomplete_arrays();
10860 DEL_ARR_F(incomplete_arrays);
10861 incomplete_arrays = NULL;
10865 * Initialize the parser.
10867 void init_parser(void)
10869 sym_anonymous = symbol_table_insert("<anonymous>");
10871 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10873 init_expression_parsers();
10874 obstack_init(&temp_obst);
10876 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10877 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10881 * Terminate the parser.
10883 void exit_parser(void)
10885 obstack_free(&temp_obst, NULL);