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)) {
2637 type = parse_typename();
2640 expression = parse_expression();
2641 type = revert_automatic_type_conversion(expression);
2646 type = parse_typename();
2649 in_type_prop = old_type_prop;
2650 in_gcc_extension = old_gcc_extension;
2652 rem_anchor_token(')');
2653 expect(')', end_error);
2655 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2656 typeof_type->typeoft.expression = expression;
2657 typeof_type->typeoft.typeof_type = type;
2664 typedef enum specifiers_t {
2665 SPECIFIER_SIGNED = 1 << 0,
2666 SPECIFIER_UNSIGNED = 1 << 1,
2667 SPECIFIER_LONG = 1 << 2,
2668 SPECIFIER_INT = 1 << 3,
2669 SPECIFIER_DOUBLE = 1 << 4,
2670 SPECIFIER_CHAR = 1 << 5,
2671 SPECIFIER_WCHAR_T = 1 << 6,
2672 SPECIFIER_SHORT = 1 << 7,
2673 SPECIFIER_LONG_LONG = 1 << 8,
2674 SPECIFIER_FLOAT = 1 << 9,
2675 SPECIFIER_BOOL = 1 << 10,
2676 SPECIFIER_VOID = 1 << 11,
2677 SPECIFIER_INT8 = 1 << 12,
2678 SPECIFIER_INT16 = 1 << 13,
2679 SPECIFIER_INT32 = 1 << 14,
2680 SPECIFIER_INT64 = 1 << 15,
2681 SPECIFIER_INT128 = 1 << 16,
2682 SPECIFIER_COMPLEX = 1 << 17,
2683 SPECIFIER_IMAGINARY = 1 << 18,
2686 static type_t *create_builtin_type(symbol_t *const symbol,
2687 type_t *const real_type)
2689 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2690 type->builtin.symbol = symbol;
2691 type->builtin.real_type = real_type;
2692 return identify_new_type(type);
2695 static type_t *get_typedef_type(symbol_t *symbol)
2697 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2698 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2701 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2702 type->typedeft.typedefe = &entity->typedefe;
2707 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2709 expect('(', end_error);
2711 attribute_property_argument_t *property
2712 = allocate_ast_zero(sizeof(*property));
2715 if (token.type != T_IDENTIFIER) {
2716 parse_error_expected("while parsing property declspec",
2717 T_IDENTIFIER, NULL);
2722 symbol_t *symbol = token.symbol;
2724 if (strcmp(symbol->string, "put") == 0) {
2726 } else if (strcmp(symbol->string, "get") == 0) {
2729 errorf(HERE, "expected put or get in property declspec");
2732 expect('=', end_error);
2733 if (token.type != T_IDENTIFIER) {
2734 parse_error_expected("while parsing property declspec",
2735 T_IDENTIFIER, NULL);
2739 property->put_symbol = token.symbol;
2741 property->get_symbol = token.symbol;
2744 } while (next_if(','));
2746 attribute->a.property = property;
2748 expect(')', end_error);
2754 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2756 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2757 if (next_if(T_restrict)) {
2758 kind = ATTRIBUTE_MS_RESTRICT;
2759 } else if (token.type == T_IDENTIFIER) {
2760 const char *name = token.symbol->string;
2762 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2764 const char *attribute_name = get_attribute_name(k);
2765 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2771 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2772 warningf(HERE, "unknown __declspec '%s' ignored", name);
2775 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2779 attribute_t *attribute = allocate_attribute_zero(kind);
2781 if (kind == ATTRIBUTE_MS_PROPERTY) {
2782 return parse_attribute_ms_property(attribute);
2785 /* parse arguments */
2787 attribute->a.arguments = parse_attribute_arguments();
2792 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2796 expect('(', end_error);
2801 add_anchor_token(')');
2803 attribute_t **anchor = &first;
2805 while (*anchor != NULL)
2806 anchor = &(*anchor)->next;
2808 attribute_t *attribute
2809 = parse_microsoft_extended_decl_modifier_single();
2810 if (attribute == NULL)
2813 *anchor = attribute;
2814 anchor = &attribute->next;
2815 } while (next_if(','));
2817 rem_anchor_token(')');
2818 expect(')', end_error);
2822 rem_anchor_token(')');
2826 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2828 entity_t *entity = allocate_entity_zero(kind);
2829 entity->base.source_position = *HERE;
2830 entity->base.symbol = symbol;
2831 if (is_declaration(entity)) {
2832 entity->declaration.type = type_error_type;
2833 entity->declaration.implicit = true;
2834 } else if (kind == ENTITY_TYPEDEF) {
2835 entity->typedefe.type = type_error_type;
2836 entity->typedefe.builtin = true;
2838 if (kind != ENTITY_COMPOUND_MEMBER)
2839 record_entity(entity, false);
2843 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2845 type_t *type = NULL;
2846 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2847 unsigned type_specifiers = 0;
2848 bool newtype = false;
2849 bool saw_error = false;
2850 bool old_gcc_extension = in_gcc_extension;
2852 specifiers->source_position = token.source_position;
2855 specifiers->attributes = parse_attributes(specifiers->attributes);
2857 switch (token.type) {
2859 #define MATCH_STORAGE_CLASS(token, class) \
2861 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2862 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2864 specifiers->storage_class = class; \
2865 if (specifiers->thread_local) \
2866 goto check_thread_storage_class; \
2870 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2871 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2872 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2873 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2874 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2877 specifiers->attributes
2878 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2882 if (specifiers->thread_local) {
2883 errorf(HERE, "duplicate '__thread'");
2885 specifiers->thread_local = true;
2886 check_thread_storage_class:
2887 switch (specifiers->storage_class) {
2888 case STORAGE_CLASS_EXTERN:
2889 case STORAGE_CLASS_NONE:
2890 case STORAGE_CLASS_STATIC:
2894 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
2895 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
2896 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
2897 wrong_thread_stoarge_class:
2898 errorf(HERE, "'__thread' used with '%s'", wrong);
2905 /* type qualifiers */
2906 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2908 qualifiers |= qualifier; \
2912 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2913 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2914 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2915 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2916 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2917 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2918 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2919 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2921 case T___extension__:
2923 in_gcc_extension = true;
2926 /* type specifiers */
2927 #define MATCH_SPECIFIER(token, specifier, name) \
2929 if (type_specifiers & specifier) { \
2930 errorf(HERE, "multiple " name " type specifiers given"); \
2932 type_specifiers |= specifier; \
2937 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2938 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2939 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2940 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2941 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2942 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2943 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2944 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2945 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2946 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2947 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2948 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2949 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2950 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2951 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2952 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2953 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2954 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2958 specifiers->is_inline = true;
2962 case T__forceinline:
2964 specifiers->modifiers |= DM_FORCEINLINE;
2969 if (type_specifiers & SPECIFIER_LONG_LONG) {
2970 errorf(HERE, "multiple type specifiers given");
2971 } else if (type_specifiers & SPECIFIER_LONG) {
2972 type_specifiers |= SPECIFIER_LONG_LONG;
2974 type_specifiers |= SPECIFIER_LONG;
2979 #define CHECK_DOUBLE_TYPE() \
2980 if ( type != NULL) \
2981 errorf(HERE, "multiple data types in declaration specifiers");
2984 CHECK_DOUBLE_TYPE();
2985 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2987 type->compound.compound = parse_compound_type_specifier(true);
2990 CHECK_DOUBLE_TYPE();
2991 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2992 type->compound.compound = parse_compound_type_specifier(false);
2995 CHECK_DOUBLE_TYPE();
2996 type = parse_enum_specifier();
2999 CHECK_DOUBLE_TYPE();
3000 type = parse_typeof();
3002 case T___builtin_va_list:
3003 CHECK_DOUBLE_TYPE();
3004 type = duplicate_type(type_valist);
3008 case T_IDENTIFIER: {
3009 /* only parse identifier if we haven't found a type yet */
3010 if (type != NULL || type_specifiers != 0) {
3011 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3012 * declaration, so it doesn't generate errors about expecting '(' or
3014 switch (look_ahead(1)->type) {
3021 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3025 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3030 goto finish_specifiers;
3034 type_t *const typedef_type = get_typedef_type(token.symbol);
3035 if (typedef_type == NULL) {
3036 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3037 * declaration, so it doesn't generate 'implicit int' followed by more
3038 * errors later on. */
3039 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3045 errorf(HERE, "%K does not name a type", &token);
3048 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3050 type = allocate_type_zero(TYPE_TYPEDEF);
3051 type->typedeft.typedefe = &entity->typedefe;
3055 if (la1_type == '&' || la1_type == '*')
3056 goto finish_specifiers;
3061 goto finish_specifiers;
3066 type = typedef_type;
3070 /* function specifier */
3072 goto finish_specifiers;
3077 specifiers->attributes = parse_attributes(specifiers->attributes);
3079 in_gcc_extension = old_gcc_extension;
3081 if (type == NULL || (saw_error && type_specifiers != 0)) {
3082 atomic_type_kind_t atomic_type;
3084 /* match valid basic types */
3085 switch (type_specifiers) {
3086 case SPECIFIER_VOID:
3087 atomic_type = ATOMIC_TYPE_VOID;
3089 case SPECIFIER_WCHAR_T:
3090 atomic_type = ATOMIC_TYPE_WCHAR_T;
3092 case SPECIFIER_CHAR:
3093 atomic_type = ATOMIC_TYPE_CHAR;
3095 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3096 atomic_type = ATOMIC_TYPE_SCHAR;
3098 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3099 atomic_type = ATOMIC_TYPE_UCHAR;
3101 case SPECIFIER_SHORT:
3102 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3103 case SPECIFIER_SHORT | SPECIFIER_INT:
3104 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3105 atomic_type = ATOMIC_TYPE_SHORT;
3107 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3108 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3109 atomic_type = ATOMIC_TYPE_USHORT;
3112 case SPECIFIER_SIGNED:
3113 case SPECIFIER_SIGNED | SPECIFIER_INT:
3114 atomic_type = ATOMIC_TYPE_INT;
3116 case SPECIFIER_UNSIGNED:
3117 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3118 atomic_type = ATOMIC_TYPE_UINT;
3120 case SPECIFIER_LONG:
3121 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3122 case SPECIFIER_LONG | SPECIFIER_INT:
3123 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3124 atomic_type = ATOMIC_TYPE_LONG;
3126 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3127 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3128 atomic_type = ATOMIC_TYPE_ULONG;
3131 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3132 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3133 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3134 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3136 atomic_type = ATOMIC_TYPE_LONGLONG;
3137 goto warn_about_long_long;
3139 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3140 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3142 atomic_type = ATOMIC_TYPE_ULONGLONG;
3143 warn_about_long_long:
3144 if (warning.long_long) {
3145 warningf(&specifiers->source_position,
3146 "ISO C90 does not support 'long long'");
3150 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3151 atomic_type = unsigned_int8_type_kind;
3154 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3155 atomic_type = unsigned_int16_type_kind;
3158 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3159 atomic_type = unsigned_int32_type_kind;
3162 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3163 atomic_type = unsigned_int64_type_kind;
3166 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3167 atomic_type = unsigned_int128_type_kind;
3170 case SPECIFIER_INT8:
3171 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3172 atomic_type = int8_type_kind;
3175 case SPECIFIER_INT16:
3176 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3177 atomic_type = int16_type_kind;
3180 case SPECIFIER_INT32:
3181 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3182 atomic_type = int32_type_kind;
3185 case SPECIFIER_INT64:
3186 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3187 atomic_type = int64_type_kind;
3190 case SPECIFIER_INT128:
3191 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3192 atomic_type = int128_type_kind;
3195 case SPECIFIER_FLOAT:
3196 atomic_type = ATOMIC_TYPE_FLOAT;
3198 case SPECIFIER_DOUBLE:
3199 atomic_type = ATOMIC_TYPE_DOUBLE;
3201 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3202 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3204 case SPECIFIER_BOOL:
3205 atomic_type = ATOMIC_TYPE_BOOL;
3207 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3208 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3209 atomic_type = ATOMIC_TYPE_FLOAT;
3211 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3212 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3213 atomic_type = ATOMIC_TYPE_DOUBLE;
3215 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3216 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3217 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3220 /* invalid specifier combination, give an error message */
3221 if (type_specifiers == 0) {
3225 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3226 if (!(c_mode & _CXX) && !strict_mode) {
3227 if (warning.implicit_int) {
3228 warningf(HERE, "no type specifiers in declaration, using 'int'");
3230 atomic_type = ATOMIC_TYPE_INT;
3233 errorf(HERE, "no type specifiers given in declaration");
3235 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3236 (type_specifiers & SPECIFIER_UNSIGNED)) {
3237 errorf(HERE, "signed and unsigned specifiers given");
3238 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3239 errorf(HERE, "only integer types can be signed or unsigned");
3241 errorf(HERE, "multiple datatypes in declaration");
3246 if (type_specifiers & SPECIFIER_COMPLEX) {
3247 type = allocate_type_zero(TYPE_COMPLEX);
3248 type->complex.akind = atomic_type;
3249 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3250 type = allocate_type_zero(TYPE_IMAGINARY);
3251 type->imaginary.akind = atomic_type;
3253 type = allocate_type_zero(TYPE_ATOMIC);
3254 type->atomic.akind = atomic_type;
3257 } else if (type_specifiers != 0) {
3258 errorf(HERE, "multiple datatypes in declaration");
3261 /* FIXME: check type qualifiers here */
3262 type->base.qualifiers = qualifiers;
3265 type = identify_new_type(type);
3267 type = typehash_insert(type);
3270 if (specifiers->attributes != NULL)
3271 type = handle_type_attributes(specifiers->attributes, type);
3272 specifiers->type = type;
3276 specifiers->type = type_error_type;
3279 static type_qualifiers_t parse_type_qualifiers(void)
3281 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3284 switch (token.type) {
3285 /* type qualifiers */
3286 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3287 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3288 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3289 /* microsoft extended type modifiers */
3290 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3291 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3292 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3293 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3294 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3303 * Parses an K&R identifier list
3305 static void parse_identifier_list(scope_t *scope)
3308 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3309 entity->base.source_position = token.source_position;
3310 entity->base.namespc = NAMESPACE_NORMAL;
3311 entity->base.symbol = token.symbol;
3312 /* a K&R parameter has no type, yet */
3316 append_entity(scope, entity);
3317 } while (next_if(',') && token.type == T_IDENTIFIER);
3320 static entity_t *parse_parameter(void)
3322 declaration_specifiers_t specifiers;
3323 memset(&specifiers, 0, sizeof(specifiers));
3325 parse_declaration_specifiers(&specifiers);
3327 entity_t *entity = parse_declarator(&specifiers,
3328 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3329 anonymous_entity = NULL;
3333 static void semantic_parameter_incomplete(const entity_t *entity)
3335 assert(entity->kind == ENTITY_PARAMETER);
3337 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3338 * list in a function declarator that is part of a
3339 * definition of that function shall not have
3340 * incomplete type. */
3341 type_t *type = skip_typeref(entity->declaration.type);
3342 if (is_type_incomplete(type)) {
3343 errorf(&entity->base.source_position,
3344 "parameter '%#T' has incomplete type",
3345 entity->declaration.type, entity->base.symbol);
3349 static bool has_parameters(void)
3351 /* func(void) is not a parameter */
3352 if (token.type == T_IDENTIFIER) {
3353 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3356 if (entity->kind != ENTITY_TYPEDEF)
3358 if (skip_typeref(entity->typedefe.type) != type_void)
3360 } else if (token.type != T_void) {
3363 if (look_ahead(1)->type != ')')
3370 * Parses function type parameters (and optionally creates variable_t entities
3371 * for them in a scope)
3373 static void parse_parameters(function_type_t *type, scope_t *scope)
3376 add_anchor_token(')');
3377 int saved_comma_state = save_and_reset_anchor_state(',');
3379 if (token.type == T_IDENTIFIER &&
3380 !is_typedef_symbol(token.symbol)) {
3381 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3382 if (la1_type == ',' || la1_type == ')') {
3383 type->kr_style_parameters = true;
3384 parse_identifier_list(scope);
3385 goto parameters_finished;
3389 if (token.type == ')') {
3390 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3391 if (!(c_mode & _CXX))
3392 type->unspecified_parameters = true;
3393 goto parameters_finished;
3396 if (has_parameters()) {
3397 function_parameter_t **anchor = &type->parameters;
3399 switch (token.type) {
3402 type->variadic = true;
3403 goto parameters_finished;
3406 case T___extension__:
3409 entity_t *entity = parse_parameter();
3410 if (entity->kind == ENTITY_TYPEDEF) {
3411 errorf(&entity->base.source_position,
3412 "typedef not allowed as function parameter");
3415 assert(is_declaration(entity));
3417 semantic_parameter_incomplete(entity);
3419 function_parameter_t *const parameter =
3420 allocate_parameter(entity->declaration.type);
3422 if (scope != NULL) {
3423 append_entity(scope, entity);
3426 *anchor = parameter;
3427 anchor = ¶meter->next;
3432 goto parameters_finished;
3434 } while (next_if(','));
3438 parameters_finished:
3439 rem_anchor_token(')');
3440 expect(')', end_error);
3443 restore_anchor_state(',', saved_comma_state);
3446 typedef enum construct_type_kind_t {
3449 CONSTRUCT_REFERENCE,
3452 } construct_type_kind_t;
3454 typedef union construct_type_t construct_type_t;
3456 typedef struct construct_type_base_t {
3457 construct_type_kind_t kind;
3458 construct_type_t *next;
3459 } construct_type_base_t;
3461 typedef struct parsed_pointer_t {
3462 construct_type_base_t base;
3463 type_qualifiers_t type_qualifiers;
3464 variable_t *base_variable; /**< MS __based extension. */
3467 typedef struct parsed_reference_t {
3468 construct_type_base_t base;
3469 } parsed_reference_t;
3471 typedef struct construct_function_type_t {
3472 construct_type_base_t base;
3473 type_t *function_type;
3474 } construct_function_type_t;
3476 typedef struct parsed_array_t {
3477 construct_type_base_t base;
3478 type_qualifiers_t type_qualifiers;
3484 union construct_type_t {
3485 construct_type_kind_t kind;
3486 construct_type_base_t base;
3487 parsed_pointer_t pointer;
3488 parsed_reference_t reference;
3489 construct_function_type_t function;
3490 parsed_array_t array;
3493 static construct_type_t *parse_pointer_declarator(void)
3497 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3498 memset(pointer, 0, sizeof(pointer[0]));
3499 pointer->base.kind = CONSTRUCT_POINTER;
3500 pointer->type_qualifiers = parse_type_qualifiers();
3501 //pointer->base_variable = base_variable;
3503 return (construct_type_t*) pointer;
3506 static construct_type_t *parse_reference_declarator(void)
3510 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->reference));
3511 parsed_reference_t *reference = &cons->reference;
3512 memset(reference, 0, sizeof(*reference));
3513 cons->kind = CONSTRUCT_REFERENCE;
3518 static construct_type_t *parse_array_declarator(void)
3521 add_anchor_token(']');
3523 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->array));
3524 parsed_array_t *array = &cons->array;
3525 memset(array, 0, sizeof(*array));
3526 cons->kind = CONSTRUCT_ARRAY;
3528 if (next_if(T_static))
3529 array->is_static = true;
3531 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3532 if (type_qualifiers != 0 && next_if(T_static))
3533 array->is_static = true;
3534 array->type_qualifiers = type_qualifiers;
3536 if (token.type == '*' && look_ahead(1)->type == ']') {
3537 array->is_variable = true;
3539 } else if (token.type != ']') {
3540 expression_t *const size = parse_assignment_expression();
3542 /* §6.7.5.2:1 Array size must have integer type */
3543 type_t *const orig_type = size->base.type;
3544 type_t *const type = skip_typeref(orig_type);
3545 if (!is_type_integer(type) && is_type_valid(type)) {
3546 errorf(&size->base.source_position,
3547 "array size '%E' must have integer type but has type '%T'",
3552 mark_vars_read(size, NULL);
3555 rem_anchor_token(']');
3556 expect(']', end_error);
3562 static construct_type_t *parse_function_declarator(scope_t *scope)
3564 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3565 function_type_t *ftype = &type->function;
3567 ftype->linkage = current_linkage;
3568 ftype->calling_convention = CC_DEFAULT;
3570 parse_parameters(ftype, scope);
3572 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->function));
3573 construct_function_type_t *function = &cons->function;
3574 memset(function, 0, sizeof(*function));
3575 cons->kind = CONSTRUCT_FUNCTION;
3576 function->function_type = type;
3581 typedef struct parse_declarator_env_t {
3582 bool may_be_abstract : 1;
3583 bool must_be_abstract : 1;
3584 decl_modifiers_t modifiers;
3586 source_position_t source_position;
3588 attribute_t *attributes;
3589 } parse_declarator_env_t;
3591 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3593 /* construct a single linked list of construct_type_t's which describe
3594 * how to construct the final declarator type */
3595 construct_type_t *first = NULL;
3596 construct_type_t **anchor = &first;
3598 env->attributes = parse_attributes(env->attributes);
3601 construct_type_t *type;
3602 //variable_t *based = NULL; /* MS __based extension */
3603 switch (token.type) {
3605 if (!(c_mode & _CXX))
3606 errorf(HERE, "references are only available for C++");
3607 type = parse_reference_declarator();
3611 panic("based not supported anymore");
3616 type = parse_pointer_declarator();
3620 goto ptr_operator_end;
3624 anchor = &type->base.next;
3626 /* TODO: find out if this is correct */
3627 env->attributes = parse_attributes(env->attributes);
3631 construct_type_t *inner_types = NULL;
3633 switch (token.type) {
3635 if (env->must_be_abstract) {
3636 errorf(HERE, "no identifier expected in typename");
3638 env->symbol = token.symbol;
3639 env->source_position = token.source_position;
3644 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3645 * interpreted as ``function with no parameter specification'', rather
3646 * than redundant parentheses around the omitted identifier. */
3647 if (look_ahead(1)->type != ')') {
3649 add_anchor_token(')');
3650 inner_types = parse_inner_declarator(env);
3651 if (inner_types != NULL) {
3652 /* All later declarators only modify the return type */
3653 env->must_be_abstract = true;
3655 rem_anchor_token(')');
3656 expect(')', end_error);
3660 if (env->may_be_abstract)
3662 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3667 construct_type_t **const p = anchor;
3670 construct_type_t *type;
3671 switch (token.type) {
3673 scope_t *scope = NULL;
3674 if (!env->must_be_abstract) {
3675 scope = &env->parameters;
3678 type = parse_function_declarator(scope);
3682 type = parse_array_declarator();
3685 goto declarator_finished;
3688 /* insert in the middle of the list (at p) */
3689 type->base.next = *p;
3692 anchor = &type->base.next;
3695 declarator_finished:
3696 /* append inner_types at the end of the list, we don't to set anchor anymore
3697 * as it's not needed anymore */
3698 *anchor = inner_types;
3705 static type_t *construct_declarator_type(construct_type_t *construct_list,
3708 construct_type_t *iter = construct_list;
3709 for (; iter != NULL; iter = iter->base.next) {
3710 switch (iter->kind) {
3711 case CONSTRUCT_INVALID:
3713 case CONSTRUCT_FUNCTION: {
3714 construct_function_type_t *function = &iter->function;
3715 type_t *function_type = function->function_type;
3717 function_type->function.return_type = type;
3719 type_t *skipped_return_type = skip_typeref(type);
3721 if (is_type_function(skipped_return_type)) {
3722 errorf(HERE, "function returning function is not allowed");
3723 } else if (is_type_array(skipped_return_type)) {
3724 errorf(HERE, "function returning array is not allowed");
3726 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3728 "type qualifiers in return type of function type are meaningless");
3732 /* The function type was constructed earlier. Freeing it here will
3733 * destroy other types. */
3734 type = typehash_insert(function_type);
3738 case CONSTRUCT_POINTER: {
3739 if (is_type_reference(skip_typeref(type)))
3740 errorf(HERE, "cannot declare a pointer to reference");
3742 parsed_pointer_t *pointer = &iter->pointer;
3743 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3747 case CONSTRUCT_REFERENCE:
3748 if (is_type_reference(skip_typeref(type)))
3749 errorf(HERE, "cannot declare a reference to reference");
3751 type = make_reference_type(type);
3754 case CONSTRUCT_ARRAY: {
3755 if (is_type_reference(skip_typeref(type)))
3756 errorf(HERE, "cannot declare an array of references");
3758 parsed_array_t *array = &iter->array;
3759 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3761 expression_t *size_expression = array->size;
3762 if (size_expression != NULL) {
3764 = create_implicit_cast(size_expression, type_size_t);
3767 array_type->base.qualifiers = array->type_qualifiers;
3768 array_type->array.element_type = type;
3769 array_type->array.is_static = array->is_static;
3770 array_type->array.is_variable = array->is_variable;
3771 array_type->array.size_expression = size_expression;
3773 if (size_expression != NULL) {
3774 if (is_constant_expression(size_expression)) {
3776 = fold_constant_to_int(size_expression);
3777 array_type->array.size = size;
3778 array_type->array.size_constant = true;
3779 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3780 * have a value greater than zero. */
3782 if (size < 0 || !GNU_MODE) {
3783 errorf(&size_expression->base.source_position,
3784 "size of array must be greater than zero");
3785 } else if (warning.other) {
3786 warningf(&size_expression->base.source_position,
3787 "zero length arrays are a GCC extension");
3791 array_type->array.is_vla = true;
3795 type_t *skipped_type = skip_typeref(type);
3797 if (is_type_incomplete(skipped_type)) {
3798 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
3799 } else if (is_type_function(skipped_type)) {
3800 errorf(HERE, "array of functions is not allowed");
3802 type = identify_new_type(array_type);
3806 internal_errorf(HERE, "invalid type construction found");
3812 static type_t *automatic_type_conversion(type_t *orig_type);
3814 static type_t *semantic_parameter(const source_position_t *pos,
3816 const declaration_specifiers_t *specifiers,
3819 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3820 * shall be adjusted to ``qualified pointer to type'',
3822 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3823 * type'' shall be adjusted to ``pointer to function
3824 * returning type'', as in 6.3.2.1. */
3825 type = automatic_type_conversion(type);
3827 if (specifiers->is_inline && is_type_valid(type)) {
3828 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3831 /* §6.9.1:6 The declarations in the declaration list shall contain
3832 * no storage-class specifier other than register and no
3833 * initializations. */
3834 if (specifiers->thread_local || (
3835 specifiers->storage_class != STORAGE_CLASS_NONE &&
3836 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3838 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3841 /* delay test for incomplete type, because we might have (void)
3842 * which is legal but incomplete... */
3847 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3848 declarator_flags_t flags)
3850 parse_declarator_env_t env;
3851 memset(&env, 0, sizeof(env));
3852 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3854 construct_type_t *construct_type = parse_inner_declarator(&env);
3856 construct_declarator_type(construct_type, specifiers->type);
3857 type_t *type = skip_typeref(orig_type);
3859 if (construct_type != NULL) {
3860 obstack_free(&temp_obst, construct_type);
3863 attribute_t *attributes = parse_attributes(env.attributes);
3864 /* append (shared) specifier attribute behind attributes of this
3866 attribute_t **anchor = &attributes;
3867 while (*anchor != NULL)
3868 anchor = &(*anchor)->next;
3869 *anchor = specifiers->attributes;
3872 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3873 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3874 entity->base.symbol = env.symbol;
3875 entity->base.source_position = env.source_position;
3876 entity->typedefe.type = orig_type;
3878 if (anonymous_entity != NULL) {
3879 if (is_type_compound(type)) {
3880 assert(anonymous_entity->compound.alias == NULL);
3881 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3882 anonymous_entity->kind == ENTITY_UNION);
3883 anonymous_entity->compound.alias = entity;
3884 anonymous_entity = NULL;
3885 } else if (is_type_enum(type)) {
3886 assert(anonymous_entity->enume.alias == NULL);
3887 assert(anonymous_entity->kind == ENTITY_ENUM);
3888 anonymous_entity->enume.alias = entity;
3889 anonymous_entity = NULL;
3893 /* create a declaration type entity */
3894 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3895 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3897 if (env.symbol != NULL) {
3898 if (specifiers->is_inline && is_type_valid(type)) {
3899 errorf(&env.source_position,
3900 "compound member '%Y' declared 'inline'", env.symbol);
3903 if (specifiers->thread_local ||
3904 specifiers->storage_class != STORAGE_CLASS_NONE) {
3905 errorf(&env.source_position,
3906 "compound member '%Y' must have no storage class",
3910 } else if (flags & DECL_IS_PARAMETER) {
3911 orig_type = semantic_parameter(&env.source_position, orig_type,
3912 specifiers, env.symbol);
3914 entity = allocate_entity_zero(ENTITY_PARAMETER);
3915 } else if (is_type_function(type)) {
3916 entity = allocate_entity_zero(ENTITY_FUNCTION);
3918 entity->function.is_inline = specifiers->is_inline;
3919 entity->function.parameters = env.parameters;
3921 if (env.symbol != NULL) {
3922 /* this needs fixes for C++ */
3923 bool in_function_scope = current_function != NULL;
3925 if (specifiers->thread_local || (
3926 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3927 specifiers->storage_class != STORAGE_CLASS_NONE &&
3928 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3930 errorf(&env.source_position,
3931 "invalid storage class for function '%Y'", env.symbol);
3935 entity = allocate_entity_zero(ENTITY_VARIABLE);
3937 entity->variable.thread_local = specifiers->thread_local;
3939 if (env.symbol != NULL) {
3940 if (specifiers->is_inline && is_type_valid(type)) {
3941 errorf(&env.source_position,
3942 "variable '%Y' declared 'inline'", env.symbol);
3945 bool invalid_storage_class = false;
3946 if (current_scope == file_scope) {
3947 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3948 specifiers->storage_class != STORAGE_CLASS_NONE &&
3949 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3950 invalid_storage_class = true;
3953 if (specifiers->thread_local &&
3954 specifiers->storage_class == STORAGE_CLASS_NONE) {
3955 invalid_storage_class = true;
3958 if (invalid_storage_class) {
3959 errorf(&env.source_position,
3960 "invalid storage class for variable '%Y'", env.symbol);
3965 if (env.symbol != NULL) {
3966 entity->base.symbol = env.symbol;
3967 entity->base.source_position = env.source_position;
3969 entity->base.source_position = specifiers->source_position;
3971 entity->base.namespc = NAMESPACE_NORMAL;
3972 entity->declaration.type = orig_type;
3973 entity->declaration.alignment = get_type_alignment(orig_type);
3974 entity->declaration.modifiers = env.modifiers;
3975 entity->declaration.attributes = attributes;
3977 storage_class_t storage_class = specifiers->storage_class;
3978 entity->declaration.declared_storage_class = storage_class;
3980 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3981 storage_class = STORAGE_CLASS_AUTO;
3982 entity->declaration.storage_class = storage_class;
3985 if (attributes != NULL) {
3986 handle_entity_attributes(attributes, entity);
3992 static type_t *parse_abstract_declarator(type_t *base_type)
3994 parse_declarator_env_t env;
3995 memset(&env, 0, sizeof(env));
3996 env.may_be_abstract = true;
3997 env.must_be_abstract = true;
3999 construct_type_t *construct_type = parse_inner_declarator(&env);
4001 type_t *result = construct_declarator_type(construct_type, base_type);
4002 if (construct_type != NULL) {
4003 obstack_free(&temp_obst, construct_type);
4005 result = handle_type_attributes(env.attributes, result);
4011 * Check if the declaration of main is suspicious. main should be a
4012 * function with external linkage, returning int, taking either zero
4013 * arguments, two, or three arguments of appropriate types, ie.
4015 * int main([ int argc, char **argv [, char **env ] ]).
4017 * @param decl the declaration to check
4018 * @param type the function type of the declaration
4020 static void check_main(const entity_t *entity)
4022 const source_position_t *pos = &entity->base.source_position;
4023 if (entity->kind != ENTITY_FUNCTION) {
4024 warningf(pos, "'main' is not a function");
4028 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4029 warningf(pos, "'main' is normally a non-static function");
4032 type_t *type = skip_typeref(entity->declaration.type);
4033 assert(is_type_function(type));
4035 function_type_t *func_type = &type->function;
4036 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4037 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4038 func_type->return_type);
4040 const function_parameter_t *parm = func_type->parameters;
4042 type_t *const first_type = parm->type;
4043 if (!types_compatible(skip_typeref(first_type), type_int)) {
4045 "first argument of 'main' should be 'int', but is '%T'",
4050 type_t *const second_type = parm->type;
4051 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4052 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4056 type_t *const third_type = parm->type;
4057 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4058 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4062 goto warn_arg_count;
4066 warningf(pos, "'main' takes only zero, two or three arguments");
4072 * Check if a symbol is the equal to "main".
4074 static bool is_sym_main(const symbol_t *const sym)
4076 return strcmp(sym->string, "main") == 0;
4079 static void error_redefined_as_different_kind(const source_position_t *pos,
4080 const entity_t *old, entity_kind_t new_kind)
4082 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4083 get_entity_kind_name(old->kind), old->base.symbol,
4084 get_entity_kind_name(new_kind), &old->base.source_position);
4087 static bool is_error_entity(entity_t *const ent)
4089 if (is_declaration(ent)) {
4090 return is_type_valid(skip_typeref(ent->declaration.type));
4091 } else if (ent->kind == ENTITY_TYPEDEF) {
4092 return is_type_valid(skip_typeref(ent->typedefe.type));
4097 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4099 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4100 if (attributes_equal(tattr, attr))
4107 * test wether new_list contains any attributes not included in old_list
4109 static bool has_new_attributes(const attribute_t *old_list,
4110 const attribute_t *new_list)
4112 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4113 if (!contains_attribute(old_list, attr))
4120 * Merge in attributes from an attribute list (probably from a previous
4121 * declaration with the same name). Warning: destroys the old structure
4122 * of the attribute list - don't reuse attributes after this call.
4124 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4127 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4129 if (contains_attribute(decl->attributes, attr))
4132 /* move attribute to new declarations attributes list */
4133 attr->next = decl->attributes;
4134 decl->attributes = attr;
4139 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4140 * for various problems that occur for multiple definitions
4142 entity_t *record_entity(entity_t *entity, const bool is_definition)
4144 const symbol_t *const symbol = entity->base.symbol;
4145 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4146 const source_position_t *pos = &entity->base.source_position;
4148 /* can happen in error cases */
4152 entity_t *const previous_entity = get_entity(symbol, namespc);
4153 /* pushing the same entity twice will break the stack structure */
4154 assert(previous_entity != entity);
4156 if (entity->kind == ENTITY_FUNCTION) {
4157 type_t *const orig_type = entity->declaration.type;
4158 type_t *const type = skip_typeref(orig_type);
4160 assert(is_type_function(type));
4161 if (type->function.unspecified_parameters &&
4162 warning.strict_prototypes &&
4163 previous_entity == NULL) {
4164 warningf(pos, "function declaration '%#T' is not a prototype",
4168 if (warning.main && current_scope == file_scope
4169 && is_sym_main(symbol)) {
4174 if (is_declaration(entity) &&
4175 warning.nested_externs &&
4176 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4177 current_scope != file_scope) {
4178 warningf(pos, "nested extern declaration of '%#T'",
4179 entity->declaration.type, symbol);
4182 if (previous_entity != NULL) {
4183 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4184 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4185 assert(previous_entity->kind == ENTITY_PARAMETER);
4187 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4188 entity->declaration.type, symbol,
4189 previous_entity->declaration.type, symbol,
4190 &previous_entity->base.source_position);
4194 if (previous_entity->base.parent_scope == current_scope) {
4195 if (previous_entity->kind != entity->kind) {
4196 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
4197 error_redefined_as_different_kind(pos, previous_entity,
4202 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4203 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4204 symbol, &previous_entity->base.source_position);
4207 if (previous_entity->kind == ENTITY_TYPEDEF) {
4208 /* TODO: C++ allows this for exactly the same type */
4209 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4210 symbol, &previous_entity->base.source_position);
4214 /* at this point we should have only VARIABLES or FUNCTIONS */
4215 assert(is_declaration(previous_entity) && is_declaration(entity));
4217 declaration_t *const prev_decl = &previous_entity->declaration;
4218 declaration_t *const decl = &entity->declaration;
4220 /* can happen for K&R style declarations */
4221 if (prev_decl->type == NULL &&
4222 previous_entity->kind == ENTITY_PARAMETER &&
4223 entity->kind == ENTITY_PARAMETER) {
4224 prev_decl->type = decl->type;
4225 prev_decl->storage_class = decl->storage_class;
4226 prev_decl->declared_storage_class = decl->declared_storage_class;
4227 prev_decl->modifiers = decl->modifiers;
4228 return previous_entity;
4231 type_t *const orig_type = decl->type;
4232 assert(orig_type != NULL);
4233 type_t *const type = skip_typeref(orig_type);
4234 type_t *const prev_type = skip_typeref(prev_decl->type);
4236 if (!types_compatible(type, prev_type)) {
4238 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4239 orig_type, symbol, prev_decl->type, symbol,
4240 &previous_entity->base.source_position);
4242 unsigned old_storage_class = prev_decl->storage_class;
4244 if (warning.redundant_decls &&
4247 !(prev_decl->modifiers & DM_USED) &&
4248 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4249 warningf(&previous_entity->base.source_position,
4250 "unnecessary static forward declaration for '%#T'",
4251 prev_decl->type, symbol);
4254 storage_class_t new_storage_class = decl->storage_class;
4256 /* pretend no storage class means extern for function
4257 * declarations (except if the previous declaration is neither
4258 * none nor extern) */
4259 if (entity->kind == ENTITY_FUNCTION) {
4260 /* the previous declaration could have unspecified parameters or
4261 * be a typedef, so use the new type */
4262 if (prev_type->function.unspecified_parameters || is_definition)
4263 prev_decl->type = type;
4265 switch (old_storage_class) {
4266 case STORAGE_CLASS_NONE:
4267 old_storage_class = STORAGE_CLASS_EXTERN;
4270 case STORAGE_CLASS_EXTERN:
4271 if (is_definition) {
4272 if (warning.missing_prototypes &&
4273 prev_type->function.unspecified_parameters &&
4274 !is_sym_main(symbol)) {
4275 warningf(pos, "no previous prototype for '%#T'",
4278 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4279 new_storage_class = STORAGE_CLASS_EXTERN;
4286 } else if (is_type_incomplete(prev_type)) {
4287 prev_decl->type = type;
4290 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4291 new_storage_class == STORAGE_CLASS_EXTERN) {
4293 warn_redundant_declaration: ;
4295 = has_new_attributes(prev_decl->attributes,
4297 if (has_new_attrs) {
4298 merge_in_attributes(decl, prev_decl->attributes);
4299 } else if (!is_definition &&
4300 warning.redundant_decls &&
4301 is_type_valid(prev_type) &&
4302 strcmp(previous_entity->base.source_position.input_name,
4303 "<builtin>") != 0) {
4305 "redundant declaration for '%Y' (declared %P)",
4306 symbol, &previous_entity->base.source_position);
4308 } else if (current_function == NULL) {
4309 if (old_storage_class != STORAGE_CLASS_STATIC &&
4310 new_storage_class == STORAGE_CLASS_STATIC) {
4312 "static declaration of '%Y' follows non-static declaration (declared %P)",
4313 symbol, &previous_entity->base.source_position);
4314 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4315 prev_decl->storage_class = STORAGE_CLASS_NONE;
4316 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4318 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4320 goto error_redeclaration;
4321 goto warn_redundant_declaration;
4323 } else if (is_type_valid(prev_type)) {
4324 if (old_storage_class == new_storage_class) {
4325 error_redeclaration:
4326 errorf(pos, "redeclaration of '%Y' (declared %P)",
4327 symbol, &previous_entity->base.source_position);
4330 "redeclaration of '%Y' with different linkage (declared %P)",
4331 symbol, &previous_entity->base.source_position);
4336 prev_decl->modifiers |= decl->modifiers;
4337 if (entity->kind == ENTITY_FUNCTION) {
4338 previous_entity->function.is_inline |= entity->function.is_inline;
4340 return previous_entity;
4343 if (warning.shadow) {
4344 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4345 get_entity_kind_name(entity->kind), symbol,
4346 get_entity_kind_name(previous_entity->kind),
4347 &previous_entity->base.source_position);
4351 if (entity->kind == ENTITY_FUNCTION) {
4352 if (is_definition &&
4353 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4354 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4355 warningf(pos, "no previous prototype for '%#T'",
4356 entity->declaration.type, symbol);
4357 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4358 warningf(pos, "no previous declaration for '%#T'",
4359 entity->declaration.type, symbol);
4362 } else if (warning.missing_declarations &&
4363 entity->kind == ENTITY_VARIABLE &&
4364 current_scope == file_scope) {
4365 declaration_t *declaration = &entity->declaration;
4366 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4367 warningf(pos, "no previous declaration for '%#T'",
4368 declaration->type, symbol);
4373 assert(entity->base.parent_scope == NULL);
4374 assert(current_scope != NULL);
4376 entity->base.parent_scope = current_scope;
4377 entity->base.namespc = NAMESPACE_NORMAL;
4378 environment_push(entity);
4379 append_entity(current_scope, entity);
4384 static void parser_error_multiple_definition(entity_t *entity,
4385 const source_position_t *source_position)
4387 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4388 entity->base.symbol, &entity->base.source_position);
4391 static bool is_declaration_specifier(const token_t *token,
4392 bool only_specifiers_qualifiers)
4394 switch (token->type) {
4399 return is_typedef_symbol(token->symbol);
4401 case T___extension__:
4403 return !only_specifiers_qualifiers;
4410 static void parse_init_declarator_rest(entity_t *entity)
4412 assert(is_declaration(entity));
4413 declaration_t *const declaration = &entity->declaration;
4417 type_t *orig_type = declaration->type;
4418 type_t *type = skip_typeref(orig_type);
4420 if (entity->kind == ENTITY_VARIABLE
4421 && entity->variable.initializer != NULL) {
4422 parser_error_multiple_definition(entity, HERE);
4425 bool must_be_constant = false;
4426 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4427 entity->base.parent_scope == file_scope) {
4428 must_be_constant = true;
4431 if (is_type_function(type)) {
4432 errorf(&entity->base.source_position,
4433 "function '%#T' is initialized like a variable",
4434 orig_type, entity->base.symbol);
4435 orig_type = type_error_type;
4438 parse_initializer_env_t env;
4439 env.type = orig_type;
4440 env.must_be_constant = must_be_constant;
4441 env.entity = entity;
4442 current_init_decl = entity;
4444 initializer_t *initializer = parse_initializer(&env);
4445 current_init_decl = NULL;
4447 if (entity->kind == ENTITY_VARIABLE) {
4448 /* §6.7.5:22 array initializers for arrays with unknown size
4449 * determine the array type size */
4450 declaration->type = env.type;
4451 entity->variable.initializer = initializer;
4455 /* parse rest of a declaration without any declarator */
4456 static void parse_anonymous_declaration_rest(
4457 const declaration_specifiers_t *specifiers)
4460 anonymous_entity = NULL;
4462 if (warning.other) {
4463 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4464 specifiers->thread_local) {
4465 warningf(&specifiers->source_position,
4466 "useless storage class in empty declaration");
4469 type_t *type = specifiers->type;
4470 switch (type->kind) {
4471 case TYPE_COMPOUND_STRUCT:
4472 case TYPE_COMPOUND_UNION: {
4473 if (type->compound.compound->base.symbol == NULL) {
4474 warningf(&specifiers->source_position,
4475 "unnamed struct/union that defines no instances");
4484 warningf(&specifiers->source_position, "empty declaration");
4490 static void check_variable_type_complete(entity_t *ent)
4492 if (ent->kind != ENTITY_VARIABLE)
4495 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4496 * type for the object shall be complete [...] */
4497 declaration_t *decl = &ent->declaration;
4498 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4499 decl->storage_class == STORAGE_CLASS_STATIC)
4502 type_t *const orig_type = decl->type;
4503 type_t *const type = skip_typeref(orig_type);
4504 if (!is_type_incomplete(type))
4507 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4508 * are given length one. */
4509 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4510 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4514 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4515 orig_type, ent->base.symbol);
4519 static void parse_declaration_rest(entity_t *ndeclaration,
4520 const declaration_specifiers_t *specifiers,
4521 parsed_declaration_func finished_declaration,
4522 declarator_flags_t flags)
4524 add_anchor_token(';');
4525 add_anchor_token(',');
4527 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4529 if (token.type == '=') {
4530 parse_init_declarator_rest(entity);
4531 } else if (entity->kind == ENTITY_VARIABLE) {
4532 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4533 * [...] where the extern specifier is explicitly used. */
4534 declaration_t *decl = &entity->declaration;
4535 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4536 type_t *type = decl->type;
4537 if (is_type_reference(skip_typeref(type))) {
4538 errorf(&entity->base.source_position,
4539 "reference '%#T' must be initialized",
4540 type, entity->base.symbol);
4545 check_variable_type_complete(entity);
4550 add_anchor_token('=');
4551 ndeclaration = parse_declarator(specifiers, flags);
4552 rem_anchor_token('=');
4554 expect(';', end_error);
4557 anonymous_entity = NULL;
4558 rem_anchor_token(';');
4559 rem_anchor_token(',');
4562 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4564 symbol_t *symbol = entity->base.symbol;
4565 if (symbol == NULL) {
4566 errorf(HERE, "anonymous declaration not valid as function parameter");
4570 assert(entity->base.namespc == NAMESPACE_NORMAL);
4571 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4572 if (previous_entity == NULL
4573 || previous_entity->base.parent_scope != current_scope) {
4574 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4579 if (is_definition) {
4580 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4583 return record_entity(entity, false);
4586 static void parse_declaration(parsed_declaration_func finished_declaration,
4587 declarator_flags_t flags)
4589 declaration_specifiers_t specifiers;
4590 memset(&specifiers, 0, sizeof(specifiers));
4592 add_anchor_token(';');
4593 parse_declaration_specifiers(&specifiers);
4594 rem_anchor_token(';');
4596 if (token.type == ';') {
4597 parse_anonymous_declaration_rest(&specifiers);
4599 entity_t *entity = parse_declarator(&specifiers, flags);
4600 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4605 static type_t *get_default_promoted_type(type_t *orig_type)
4607 type_t *result = orig_type;
4609 type_t *type = skip_typeref(orig_type);
4610 if (is_type_integer(type)) {
4611 result = promote_integer(type);
4612 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4613 result = type_double;
4619 static void parse_kr_declaration_list(entity_t *entity)
4621 if (entity->kind != ENTITY_FUNCTION)
4624 type_t *type = skip_typeref(entity->declaration.type);
4625 assert(is_type_function(type));
4626 if (!type->function.kr_style_parameters)
4629 add_anchor_token('{');
4631 /* push function parameters */
4632 size_t const top = environment_top();
4633 scope_t *old_scope = scope_push(&entity->function.parameters);
4635 entity_t *parameter = entity->function.parameters.entities;
4636 for ( ; parameter != NULL; parameter = parameter->base.next) {
4637 assert(parameter->base.parent_scope == NULL);
4638 parameter->base.parent_scope = current_scope;
4639 environment_push(parameter);
4642 /* parse declaration list */
4644 switch (token.type) {
4646 case T___extension__:
4647 /* This covers symbols, which are no type, too, and results in
4648 * better error messages. The typical cases are misspelled type
4649 * names and missing includes. */
4651 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4659 /* pop function parameters */
4660 assert(current_scope == &entity->function.parameters);
4661 scope_pop(old_scope);
4662 environment_pop_to(top);
4664 /* update function type */
4665 type_t *new_type = duplicate_type(type);
4667 function_parameter_t *parameters = NULL;
4668 function_parameter_t **anchor = ¶meters;
4670 /* did we have an earlier prototype? */
4671 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4672 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4675 function_parameter_t *proto_parameter = NULL;
4676 if (proto_type != NULL) {
4677 type_t *proto_type_type = proto_type->declaration.type;
4678 proto_parameter = proto_type_type->function.parameters;
4679 /* If a K&R function definition has a variadic prototype earlier, then
4680 * make the function definition variadic, too. This should conform to
4681 * §6.7.5.3:15 and §6.9.1:8. */
4682 new_type->function.variadic = proto_type_type->function.variadic;
4684 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4686 new_type->function.unspecified_parameters = true;
4689 bool need_incompatible_warning = false;
4690 parameter = entity->function.parameters.entities;
4691 for (; parameter != NULL; parameter = parameter->base.next,
4693 proto_parameter == NULL ? NULL : proto_parameter->next) {
4694 if (parameter->kind != ENTITY_PARAMETER)
4697 type_t *parameter_type = parameter->declaration.type;
4698 if (parameter_type == NULL) {
4700 errorf(HERE, "no type specified for function parameter '%Y'",
4701 parameter->base.symbol);
4702 parameter_type = type_error_type;
4704 if (warning.implicit_int) {
4705 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4706 parameter->base.symbol);
4708 parameter_type = type_int;
4710 parameter->declaration.type = parameter_type;
4713 semantic_parameter_incomplete(parameter);
4715 /* we need the default promoted types for the function type */
4716 type_t *not_promoted = parameter_type;
4717 parameter_type = get_default_promoted_type(parameter_type);
4719 /* gcc special: if the type of the prototype matches the unpromoted
4720 * type don't promote */
4721 if (!strict_mode && proto_parameter != NULL) {
4722 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4723 type_t *promo_skip = skip_typeref(parameter_type);
4724 type_t *param_skip = skip_typeref(not_promoted);
4725 if (!types_compatible(proto_p_type, promo_skip)
4726 && types_compatible(proto_p_type, param_skip)) {
4728 need_incompatible_warning = true;
4729 parameter_type = not_promoted;
4732 function_parameter_t *const parameter
4733 = allocate_parameter(parameter_type);
4735 *anchor = parameter;
4736 anchor = ¶meter->next;
4739 new_type->function.parameters = parameters;
4740 new_type = identify_new_type(new_type);
4742 if (warning.other && need_incompatible_warning) {
4743 type_t *proto_type_type = proto_type->declaration.type;
4745 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4746 proto_type_type, proto_type->base.symbol,
4747 new_type, entity->base.symbol,
4748 &proto_type->base.source_position);
4751 entity->declaration.type = new_type;
4753 rem_anchor_token('{');
4756 static bool first_err = true;
4759 * When called with first_err set, prints the name of the current function,
4762 static void print_in_function(void)
4766 diagnosticf("%s: In function '%Y':\n",
4767 current_function->base.base.source_position.input_name,
4768 current_function->base.base.symbol);
4773 * Check if all labels are defined in the current function.
4774 * Check if all labels are used in the current function.
4776 static void check_labels(void)
4778 for (const goto_statement_t *goto_statement = goto_first;
4779 goto_statement != NULL;
4780 goto_statement = goto_statement->next) {
4781 /* skip computed gotos */
4782 if (goto_statement->expression != NULL)
4785 label_t *label = goto_statement->label;
4788 if (label->base.source_position.input_name == NULL) {
4789 print_in_function();
4790 errorf(&goto_statement->base.source_position,
4791 "label '%Y' used but not defined", label->base.symbol);
4795 if (warning.unused_label) {
4796 for (const label_statement_t *label_statement = label_first;
4797 label_statement != NULL;
4798 label_statement = label_statement->next) {
4799 label_t *label = label_statement->label;
4801 if (! label->used) {
4802 print_in_function();
4803 warningf(&label_statement->base.source_position,
4804 "label '%Y' defined but not used", label->base.symbol);
4810 static void warn_unused_entity(entity_t *entity, entity_t *last)
4812 entity_t const *const end = last != NULL ? last->base.next : NULL;
4813 for (; entity != end; entity = entity->base.next) {
4814 if (!is_declaration(entity))
4817 declaration_t *declaration = &entity->declaration;
4818 if (declaration->implicit)
4821 if (!declaration->used) {
4822 print_in_function();
4823 const char *what = get_entity_kind_name(entity->kind);
4824 warningf(&entity->base.source_position, "%s '%Y' is unused",
4825 what, entity->base.symbol);
4826 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4827 print_in_function();
4828 const char *what = get_entity_kind_name(entity->kind);
4829 warningf(&entity->base.source_position, "%s '%Y' is never read",
4830 what, entity->base.symbol);
4835 static void check_unused_variables(statement_t *const stmt, void *const env)
4839 switch (stmt->kind) {
4840 case STATEMENT_DECLARATION: {
4841 declaration_statement_t const *const decls = &stmt->declaration;
4842 warn_unused_entity(decls->declarations_begin,
4843 decls->declarations_end);
4848 warn_unused_entity(stmt->fors.scope.entities, NULL);
4857 * Check declarations of current_function for unused entities.
4859 static void check_declarations(void)
4861 if (warning.unused_parameter) {
4862 const scope_t *scope = ¤t_function->parameters;
4864 /* do not issue unused warnings for main */
4865 if (!is_sym_main(current_function->base.base.symbol)) {
4866 warn_unused_entity(scope->entities, NULL);
4869 if (warning.unused_variable) {
4870 walk_statements(current_function->statement, check_unused_variables,
4875 static int determine_truth(expression_t const* const cond)
4878 !is_constant_expression(cond) ? 0 :
4879 fold_constant_to_bool(cond) ? 1 :
4883 static void check_reachable(statement_t *);
4884 static bool reaches_end;
4886 static bool expression_returns(expression_t const *const expr)
4888 switch (expr->kind) {
4890 expression_t const *const func = expr->call.function;
4891 if (func->kind == EXPR_REFERENCE) {
4892 entity_t *entity = func->reference.entity;
4893 if (entity->kind == ENTITY_FUNCTION
4894 && entity->declaration.modifiers & DM_NORETURN)
4898 if (!expression_returns(func))
4901 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4902 if (!expression_returns(arg->expression))
4909 case EXPR_REFERENCE:
4910 case EXPR_REFERENCE_ENUM_VALUE:
4912 case EXPR_STRING_LITERAL:
4913 case EXPR_WIDE_STRING_LITERAL:
4914 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4915 case EXPR_LABEL_ADDRESS:
4916 case EXPR_CLASSIFY_TYPE:
4917 case EXPR_SIZEOF: // TODO handle obscure VLA case
4920 case EXPR_BUILTIN_CONSTANT_P:
4921 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4926 case EXPR_STATEMENT: {
4927 bool old_reaches_end = reaches_end;
4928 reaches_end = false;
4929 check_reachable(expr->statement.statement);
4930 bool returns = reaches_end;
4931 reaches_end = old_reaches_end;
4935 case EXPR_CONDITIONAL:
4936 // TODO handle constant expression
4938 if (!expression_returns(expr->conditional.condition))
4941 if (expr->conditional.true_expression != NULL
4942 && expression_returns(expr->conditional.true_expression))
4945 return expression_returns(expr->conditional.false_expression);
4948 return expression_returns(expr->select.compound);
4950 case EXPR_ARRAY_ACCESS:
4952 expression_returns(expr->array_access.array_ref) &&
4953 expression_returns(expr->array_access.index);
4956 return expression_returns(expr->va_starte.ap);
4959 return expression_returns(expr->va_arge.ap);
4962 return expression_returns(expr->va_copye.src);
4964 EXPR_UNARY_CASES_MANDATORY
4965 return expression_returns(expr->unary.value);
4967 case EXPR_UNARY_THROW:
4971 // TODO handle constant lhs of && and ||
4973 expression_returns(expr->binary.left) &&
4974 expression_returns(expr->binary.right);
4980 panic("unhandled expression");
4983 static bool initializer_returns(initializer_t const *const init)
4985 switch (init->kind) {
4986 case INITIALIZER_VALUE:
4987 return expression_returns(init->value.value);
4989 case INITIALIZER_LIST: {
4990 initializer_t * const* i = init->list.initializers;
4991 initializer_t * const* const end = i + init->list.len;
4992 bool returns = true;
4993 for (; i != end; ++i) {
4994 if (!initializer_returns(*i))
5000 case INITIALIZER_STRING:
5001 case INITIALIZER_WIDE_STRING:
5002 case INITIALIZER_DESIGNATOR: // designators have no payload
5005 panic("unhandled initializer");
5008 static bool noreturn_candidate;
5010 static void check_reachable(statement_t *const stmt)
5012 if (stmt->base.reachable)
5014 if (stmt->kind != STATEMENT_DO_WHILE)
5015 stmt->base.reachable = true;
5017 statement_t *last = stmt;
5019 switch (stmt->kind) {
5020 case STATEMENT_INVALID:
5021 case STATEMENT_EMPTY:
5023 next = stmt->base.next;
5026 case STATEMENT_DECLARATION: {
5027 declaration_statement_t const *const decl = &stmt->declaration;
5028 entity_t const * ent = decl->declarations_begin;
5029 entity_t const *const last = decl->declarations_end;
5031 for (;; ent = ent->base.next) {
5032 if (ent->kind == ENTITY_VARIABLE &&
5033 ent->variable.initializer != NULL &&
5034 !initializer_returns(ent->variable.initializer)) {
5041 next = stmt->base.next;
5045 case STATEMENT_COMPOUND:
5046 next = stmt->compound.statements;
5048 next = stmt->base.next;
5051 case STATEMENT_RETURN: {
5052 expression_t const *const val = stmt->returns.value;
5053 if (val == NULL || expression_returns(val))
5054 noreturn_candidate = false;
5058 case STATEMENT_IF: {
5059 if_statement_t const *const ifs = &stmt->ifs;
5060 expression_t const *const cond = ifs->condition;
5062 if (!expression_returns(cond))
5065 int const val = determine_truth(cond);
5068 check_reachable(ifs->true_statement);
5073 if (ifs->false_statement != NULL) {
5074 check_reachable(ifs->false_statement);
5078 next = stmt->base.next;
5082 case STATEMENT_SWITCH: {
5083 switch_statement_t const *const switchs = &stmt->switchs;
5084 expression_t const *const expr = switchs->expression;
5086 if (!expression_returns(expr))
5089 if (is_constant_expression(expr)) {
5090 long const val = fold_constant_to_int(expr);
5091 case_label_statement_t * defaults = NULL;
5092 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5093 if (i->expression == NULL) {
5098 if (i->first_case <= val && val <= i->last_case) {
5099 check_reachable((statement_t*)i);
5104 if (defaults != NULL) {
5105 check_reachable((statement_t*)defaults);
5109 bool has_default = false;
5110 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5111 if (i->expression == NULL)
5114 check_reachable((statement_t*)i);
5121 next = stmt->base.next;
5125 case STATEMENT_EXPRESSION: {
5126 /* Check for noreturn function call */
5127 expression_t const *const expr = stmt->expression.expression;
5128 if (!expression_returns(expr))
5131 next = stmt->base.next;
5135 case STATEMENT_CONTINUE:
5136 for (statement_t *parent = stmt;;) {
5137 parent = parent->base.parent;
5138 if (parent == NULL) /* continue not within loop */
5142 switch (parent->kind) {
5143 case STATEMENT_WHILE: goto continue_while;
5144 case STATEMENT_DO_WHILE: goto continue_do_while;
5145 case STATEMENT_FOR: goto continue_for;
5151 case STATEMENT_BREAK:
5152 for (statement_t *parent = stmt;;) {
5153 parent = parent->base.parent;
5154 if (parent == NULL) /* break not within loop/switch */
5157 switch (parent->kind) {
5158 case STATEMENT_SWITCH:
5159 case STATEMENT_WHILE:
5160 case STATEMENT_DO_WHILE:
5163 next = parent->base.next;
5164 goto found_break_parent;
5172 case STATEMENT_GOTO:
5173 if (stmt->gotos.expression) {
5174 if (!expression_returns(stmt->gotos.expression))
5177 statement_t *parent = stmt->base.parent;
5178 if (parent == NULL) /* top level goto */
5182 next = stmt->gotos.label->statement;
5183 if (next == NULL) /* missing label */
5188 case STATEMENT_LABEL:
5189 next = stmt->label.statement;
5192 case STATEMENT_CASE_LABEL:
5193 next = stmt->case_label.statement;
5196 case STATEMENT_WHILE: {
5197 while_statement_t const *const whiles = &stmt->whiles;
5198 expression_t const *const cond = whiles->condition;
5200 if (!expression_returns(cond))
5203 int const val = determine_truth(cond);
5206 check_reachable(whiles->body);
5211 next = stmt->base.next;
5215 case STATEMENT_DO_WHILE:
5216 next = stmt->do_while.body;
5219 case STATEMENT_FOR: {
5220 for_statement_t *const fors = &stmt->fors;
5222 if (fors->condition_reachable)
5224 fors->condition_reachable = true;
5226 expression_t const *const cond = fors->condition;
5231 } else if (expression_returns(cond)) {
5232 val = determine_truth(cond);
5238 check_reachable(fors->body);
5243 next = stmt->base.next;
5247 case STATEMENT_MS_TRY: {
5248 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5249 check_reachable(ms_try->try_statement);
5250 next = ms_try->final_statement;
5254 case STATEMENT_LEAVE: {
5255 statement_t *parent = stmt;
5257 parent = parent->base.parent;
5258 if (parent == NULL) /* __leave not within __try */
5261 if (parent->kind == STATEMENT_MS_TRY) {
5263 next = parent->ms_try.final_statement;
5271 panic("invalid statement kind");
5274 while (next == NULL) {
5275 next = last->base.parent;
5277 noreturn_candidate = false;
5279 type_t *const type = skip_typeref(current_function->base.type);
5280 assert(is_type_function(type));
5281 type_t *const ret = skip_typeref(type->function.return_type);
5282 if (warning.return_type &&
5283 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5284 is_type_valid(ret) &&
5285 !is_sym_main(current_function->base.base.symbol)) {
5286 warningf(&stmt->base.source_position,
5287 "control reaches end of non-void function");
5292 switch (next->kind) {
5293 case STATEMENT_INVALID:
5294 case STATEMENT_EMPTY:
5295 case STATEMENT_DECLARATION:
5296 case STATEMENT_EXPRESSION:
5298 case STATEMENT_RETURN:
5299 case STATEMENT_CONTINUE:
5300 case STATEMENT_BREAK:
5301 case STATEMENT_GOTO:
5302 case STATEMENT_LEAVE:
5303 panic("invalid control flow in function");
5305 case STATEMENT_COMPOUND:
5306 if (next->compound.stmt_expr) {
5312 case STATEMENT_SWITCH:
5313 case STATEMENT_LABEL:
5314 case STATEMENT_CASE_LABEL:
5316 next = next->base.next;
5319 case STATEMENT_WHILE: {
5321 if (next->base.reachable)
5323 next->base.reachable = true;
5325 while_statement_t const *const whiles = &next->whiles;
5326 expression_t const *const cond = whiles->condition;
5328 if (!expression_returns(cond))
5331 int const val = determine_truth(cond);
5334 check_reachable(whiles->body);
5340 next = next->base.next;
5344 case STATEMENT_DO_WHILE: {
5346 if (next->base.reachable)
5348 next->base.reachable = true;
5350 do_while_statement_t const *const dw = &next->do_while;
5351 expression_t const *const cond = dw->condition;
5353 if (!expression_returns(cond))
5356 int const val = determine_truth(cond);
5359 check_reachable(dw->body);
5365 next = next->base.next;
5369 case STATEMENT_FOR: {
5371 for_statement_t *const fors = &next->fors;
5373 fors->step_reachable = true;
5375 if (fors->condition_reachable)
5377 fors->condition_reachable = true;
5379 expression_t const *const cond = fors->condition;
5384 } else if (expression_returns(cond)) {
5385 val = determine_truth(cond);
5391 check_reachable(fors->body);
5397 next = next->base.next;
5401 case STATEMENT_MS_TRY:
5403 next = next->ms_try.final_statement;
5408 check_reachable(next);
5411 static void check_unreachable(statement_t* const stmt, void *const env)
5415 switch (stmt->kind) {
5416 case STATEMENT_DO_WHILE:
5417 if (!stmt->base.reachable) {
5418 expression_t const *const cond = stmt->do_while.condition;
5419 if (determine_truth(cond) >= 0) {
5420 warningf(&cond->base.source_position,
5421 "condition of do-while-loop is unreachable");
5426 case STATEMENT_FOR: {
5427 for_statement_t const* const fors = &stmt->fors;
5429 // if init and step are unreachable, cond is unreachable, too
5430 if (!stmt->base.reachable && !fors->step_reachable) {
5431 warningf(&stmt->base.source_position, "statement is unreachable");
5433 if (!stmt->base.reachable && fors->initialisation != NULL) {
5434 warningf(&fors->initialisation->base.source_position,
5435 "initialisation of for-statement is unreachable");
5438 if (!fors->condition_reachable && fors->condition != NULL) {
5439 warningf(&fors->condition->base.source_position,
5440 "condition of for-statement is unreachable");
5443 if (!fors->step_reachable && fors->step != NULL) {
5444 warningf(&fors->step->base.source_position,
5445 "step of for-statement is unreachable");
5451 case STATEMENT_COMPOUND:
5452 if (stmt->compound.statements != NULL)
5454 goto warn_unreachable;
5456 case STATEMENT_DECLARATION: {
5457 /* Only warn if there is at least one declarator with an initializer.
5458 * This typically occurs in switch statements. */
5459 declaration_statement_t const *const decl = &stmt->declaration;
5460 entity_t const * ent = decl->declarations_begin;
5461 entity_t const *const last = decl->declarations_end;
5463 for (;; ent = ent->base.next) {
5464 if (ent->kind == ENTITY_VARIABLE &&
5465 ent->variable.initializer != NULL) {
5466 goto warn_unreachable;
5476 if (!stmt->base.reachable)
5477 warningf(&stmt->base.source_position, "statement is unreachable");
5482 static void parse_external_declaration(void)
5484 /* function-definitions and declarations both start with declaration
5486 declaration_specifiers_t specifiers;
5487 memset(&specifiers, 0, sizeof(specifiers));
5489 add_anchor_token(';');
5490 parse_declaration_specifiers(&specifiers);
5491 rem_anchor_token(';');
5493 /* must be a declaration */
5494 if (token.type == ';') {
5495 parse_anonymous_declaration_rest(&specifiers);
5499 add_anchor_token(',');
5500 add_anchor_token('=');
5501 add_anchor_token(';');
5502 add_anchor_token('{');
5504 /* declarator is common to both function-definitions and declarations */
5505 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5507 rem_anchor_token('{');
5508 rem_anchor_token(';');
5509 rem_anchor_token('=');
5510 rem_anchor_token(',');
5512 /* must be a declaration */
5513 switch (token.type) {
5517 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5522 /* must be a function definition */
5523 parse_kr_declaration_list(ndeclaration);
5525 if (token.type != '{') {
5526 parse_error_expected("while parsing function definition", '{', NULL);
5527 eat_until_matching_token(';');
5531 assert(is_declaration(ndeclaration));
5532 type_t *const orig_type = ndeclaration->declaration.type;
5533 type_t * type = skip_typeref(orig_type);
5535 if (!is_type_function(type)) {
5536 if (is_type_valid(type)) {
5537 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5538 type, ndeclaration->base.symbol);
5542 } else if (is_typeref(orig_type)) {
5544 errorf(&ndeclaration->base.source_position,
5545 "type of function definition '%#T' is a typedef",
5546 orig_type, ndeclaration->base.symbol);
5549 if (warning.aggregate_return &&
5550 is_type_compound(skip_typeref(type->function.return_type))) {
5551 warningf(HERE, "function '%Y' returns an aggregate",
5552 ndeclaration->base.symbol);
5554 if (warning.traditional && !type->function.unspecified_parameters) {
5555 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5556 ndeclaration->base.symbol);
5558 if (warning.old_style_definition && type->function.unspecified_parameters) {
5559 warningf(HERE, "old-style function definition '%Y'",
5560 ndeclaration->base.symbol);
5563 /* §6.7.5.3:14 a function definition with () means no
5564 * parameters (and not unspecified parameters) */
5565 if (type->function.unspecified_parameters &&
5566 type->function.parameters == NULL) {
5567 type_t *copy = duplicate_type(type);
5568 copy->function.unspecified_parameters = false;
5569 type = identify_new_type(copy);
5571 ndeclaration->declaration.type = type;
5574 entity_t *const entity = record_entity(ndeclaration, true);
5575 assert(entity->kind == ENTITY_FUNCTION);
5576 assert(ndeclaration->kind == ENTITY_FUNCTION);
5578 function_t *function = &entity->function;
5579 if (ndeclaration != entity) {
5580 function->parameters = ndeclaration->function.parameters;
5582 assert(is_declaration(entity));
5583 type = skip_typeref(entity->declaration.type);
5585 /* push function parameters and switch scope */
5586 size_t const top = environment_top();
5587 scope_t *old_scope = scope_push(&function->parameters);
5589 entity_t *parameter = function->parameters.entities;
5590 for (; parameter != NULL; parameter = parameter->base.next) {
5591 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5592 parameter->base.parent_scope = current_scope;
5594 assert(parameter->base.parent_scope == NULL
5595 || parameter->base.parent_scope == current_scope);
5596 parameter->base.parent_scope = current_scope;
5597 if (parameter->base.symbol == NULL) {
5598 errorf(¶meter->base.source_position, "parameter name omitted");
5601 environment_push(parameter);
5604 if (function->statement != NULL) {
5605 parser_error_multiple_definition(entity, HERE);
5608 /* parse function body */
5609 int label_stack_top = label_top();
5610 function_t *old_current_function = current_function;
5611 entity_t *old_current_entity = current_entity;
5612 current_function = function;
5613 current_entity = (entity_t*) function;
5614 current_parent = NULL;
5617 goto_anchor = &goto_first;
5619 label_anchor = &label_first;
5621 statement_t *const body = parse_compound_statement(false);
5622 function->statement = body;
5625 check_declarations();
5626 if (warning.return_type ||
5627 warning.unreachable_code ||
5628 (warning.missing_noreturn
5629 && !(function->base.modifiers & DM_NORETURN))) {
5630 noreturn_candidate = true;
5631 check_reachable(body);
5632 if (warning.unreachable_code)
5633 walk_statements(body, check_unreachable, NULL);
5634 if (warning.missing_noreturn &&
5635 noreturn_candidate &&
5636 !(function->base.modifiers & DM_NORETURN)) {
5637 warningf(&body->base.source_position,
5638 "function '%#T' is candidate for attribute 'noreturn'",
5639 type, entity->base.symbol);
5643 assert(current_parent == NULL);
5644 assert(current_function == function);
5645 assert(current_entity == (entity_t*) function);
5646 current_entity = old_current_entity;
5647 current_function = old_current_function;
5648 label_pop_to(label_stack_top);
5651 assert(current_scope == &function->parameters);
5652 scope_pop(old_scope);
5653 environment_pop_to(top);
5656 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5657 source_position_t *source_position,
5658 const symbol_t *symbol)
5660 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5662 type->bitfield.base_type = base_type;
5663 type->bitfield.size_expression = size;
5666 type_t *skipped_type = skip_typeref(base_type);
5667 if (!is_type_integer(skipped_type)) {
5668 errorf(HERE, "bitfield base type '%T' is not an integer type",
5672 bit_size = get_type_size(base_type) * 8;
5675 if (is_constant_expression(size)) {
5676 long v = fold_constant_to_int(size);
5677 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5680 errorf(source_position, "negative width in bit-field '%Y'",
5682 } else if (v == 0 && symbol != NULL) {
5683 errorf(source_position, "zero width for bit-field '%Y'",
5685 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5686 errorf(source_position, "width of '%Y' exceeds its type",
5689 type->bitfield.bit_size = v;
5696 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5698 entity_t *iter = compound->members.entities;
5699 for (; iter != NULL; iter = iter->base.next) {
5700 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5703 if (iter->base.symbol == symbol) {
5705 } else if (iter->base.symbol == NULL) {
5706 /* search in anonymous structs and unions */
5707 type_t *type = skip_typeref(iter->declaration.type);
5708 if (is_type_compound(type)) {
5709 if (find_compound_entry(type->compound.compound, symbol)
5720 static void check_deprecated(const source_position_t *source_position,
5721 const entity_t *entity)
5723 if (!warning.deprecated_declarations)
5725 if (!is_declaration(entity))
5727 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5730 char const *const prefix = get_entity_kind_name(entity->kind);
5731 const char *deprecated_string
5732 = get_deprecated_string(entity->declaration.attributes);
5733 if (deprecated_string != NULL) {
5734 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5735 prefix, entity->base.symbol, &entity->base.source_position,
5738 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5739 entity->base.symbol, &entity->base.source_position);
5744 static expression_t *create_select(const source_position_t *pos,
5746 type_qualifiers_t qualifiers,
5749 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5751 check_deprecated(pos, entry);
5753 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5754 select->select.compound = addr;
5755 select->select.compound_entry = entry;
5757 type_t *entry_type = entry->declaration.type;
5758 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5760 /* we always do the auto-type conversions; the & and sizeof parser contains
5761 * code to revert this! */
5762 select->base.type = automatic_type_conversion(res_type);
5763 if (res_type->kind == TYPE_BITFIELD) {
5764 select->base.type = res_type->bitfield.base_type;
5771 * Find entry with symbol in compound. Search anonymous structs and unions and
5772 * creates implicit select expressions for them.
5773 * Returns the adress for the innermost compound.
5775 static expression_t *find_create_select(const source_position_t *pos,
5777 type_qualifiers_t qualifiers,
5778 compound_t *compound, symbol_t *symbol)
5780 entity_t *iter = compound->members.entities;
5781 for (; iter != NULL; iter = iter->base.next) {
5782 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5785 symbol_t *iter_symbol = iter->base.symbol;
5786 if (iter_symbol == NULL) {
5787 type_t *type = iter->declaration.type;
5788 if (type->kind != TYPE_COMPOUND_STRUCT
5789 && type->kind != TYPE_COMPOUND_UNION)
5792 compound_t *sub_compound = type->compound.compound;
5794 if (find_compound_entry(sub_compound, symbol) == NULL)
5797 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5798 sub_addr->base.source_position = *pos;
5799 sub_addr->select.implicit = true;
5800 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5804 if (iter_symbol == symbol) {
5805 return create_select(pos, addr, qualifiers, iter);
5812 static void parse_compound_declarators(compound_t *compound,
5813 const declaration_specifiers_t *specifiers)
5818 if (token.type == ':') {
5819 source_position_t source_position = *HERE;
5822 type_t *base_type = specifiers->type;
5823 expression_t *size = parse_constant_expression();
5825 type_t *type = make_bitfield_type(base_type, size,
5826 &source_position, NULL);
5828 attribute_t *attributes = parse_attributes(NULL);
5829 attribute_t **anchor = &attributes;
5830 while (*anchor != NULL)
5831 anchor = &(*anchor)->next;
5832 *anchor = specifiers->attributes;
5834 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5835 entity->base.namespc = NAMESPACE_NORMAL;
5836 entity->base.source_position = source_position;
5837 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5838 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5839 entity->declaration.type = type;
5840 entity->declaration.attributes = attributes;
5842 if (attributes != NULL) {
5843 handle_entity_attributes(attributes, entity);
5845 append_entity(&compound->members, entity);
5847 entity = parse_declarator(specifiers,
5848 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5849 if (entity->kind == ENTITY_TYPEDEF) {
5850 errorf(&entity->base.source_position,
5851 "typedef not allowed as compound member");
5853 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5855 /* make sure we don't define a symbol multiple times */
5856 symbol_t *symbol = entity->base.symbol;
5857 if (symbol != NULL) {
5858 entity_t *prev = find_compound_entry(compound, symbol);
5860 errorf(&entity->base.source_position,
5861 "multiple declarations of symbol '%Y' (declared %P)",
5862 symbol, &prev->base.source_position);
5866 if (token.type == ':') {
5867 source_position_t source_position = *HERE;
5869 expression_t *size = parse_constant_expression();
5871 type_t *type = entity->declaration.type;
5872 type_t *bitfield_type = make_bitfield_type(type, size,
5873 &source_position, entity->base.symbol);
5875 attribute_t *attributes = parse_attributes(NULL);
5876 entity->declaration.type = bitfield_type;
5877 handle_entity_attributes(attributes, entity);
5879 type_t *orig_type = entity->declaration.type;
5880 type_t *type = skip_typeref(orig_type);
5881 if (is_type_function(type)) {
5882 errorf(&entity->base.source_position,
5883 "compound member '%Y' must not have function type '%T'",
5884 entity->base.symbol, orig_type);
5885 } else if (is_type_incomplete(type)) {
5886 /* §6.7.2.1:16 flexible array member */
5887 if (!is_type_array(type) ||
5888 token.type != ';' ||
5889 look_ahead(1)->type != '}') {
5890 errorf(&entity->base.source_position,
5891 "compound member '%Y' has incomplete type '%T'",
5892 entity->base.symbol, orig_type);
5897 append_entity(&compound->members, entity);
5900 } while (next_if(','));
5901 expect(';', end_error);
5904 anonymous_entity = NULL;
5907 static void parse_compound_type_entries(compound_t *compound)
5910 add_anchor_token('}');
5912 while (token.type != '}') {
5913 if (token.type == T_EOF) {
5914 errorf(HERE, "EOF while parsing struct");
5917 declaration_specifiers_t specifiers;
5918 memset(&specifiers, 0, sizeof(specifiers));
5919 parse_declaration_specifiers(&specifiers);
5921 parse_compound_declarators(compound, &specifiers);
5923 rem_anchor_token('}');
5927 compound->complete = true;
5930 static type_t *parse_typename(void)
5932 declaration_specifiers_t specifiers;
5933 memset(&specifiers, 0, sizeof(specifiers));
5934 parse_declaration_specifiers(&specifiers);
5935 if (specifiers.storage_class != STORAGE_CLASS_NONE
5936 || specifiers.thread_local) {
5937 /* TODO: improve error message, user does probably not know what a
5938 * storage class is...
5940 errorf(HERE, "typename must not have a storage class");
5943 type_t *result = parse_abstract_declarator(specifiers.type);
5951 typedef expression_t* (*parse_expression_function)(void);
5952 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5954 typedef struct expression_parser_function_t expression_parser_function_t;
5955 struct expression_parser_function_t {
5956 parse_expression_function parser;
5957 precedence_t infix_precedence;
5958 parse_expression_infix_function infix_parser;
5961 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5964 * Prints an error message if an expression was expected but not read
5966 static expression_t *expected_expression_error(void)
5968 /* skip the error message if the error token was read */
5969 if (token.type != T_ERROR) {
5970 errorf(HERE, "expected expression, got token %K", &token);
5974 return create_invalid_expression();
5977 static type_t *get_string_type(void)
5979 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
5982 static type_t *get_wide_string_type(void)
5984 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5988 * Parse a string constant.
5990 static expression_t *parse_string_literal(void)
5992 source_position_t begin = token.source_position;
5993 string_t res = token.literal;
5994 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
5997 while (token.type == T_STRING_LITERAL
5998 || token.type == T_WIDE_STRING_LITERAL) {
5999 warn_string_concat(&token.source_position);
6000 res = concat_strings(&res, &token.literal);
6002 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6005 expression_t *literal;
6007 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6008 literal->base.type = get_wide_string_type();
6010 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6011 literal->base.type = get_string_type();
6013 literal->base.source_position = begin;
6014 literal->literal.value = res;
6020 * Parse a boolean constant.
6022 static expression_t *parse_boolean_literal(bool value)
6024 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6025 literal->base.source_position = token.source_position;
6026 literal->base.type = type_bool;
6027 literal->literal.value.begin = value ? "true" : "false";
6028 literal->literal.value.size = value ? 4 : 5;
6034 static void warn_traditional_suffix(void)
6036 if (!warning.traditional)
6038 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6042 static void check_integer_suffix(void)
6044 symbol_t *suffix = token.symbol;
6048 bool not_traditional = false;
6049 const char *c = suffix->string;
6050 if (*c == 'l' || *c == 'L') {
6053 not_traditional = true;
6055 if (*c == 'u' || *c == 'U') {
6058 } else if (*c == 'u' || *c == 'U') {
6059 not_traditional = true;
6062 } else if (*c == 'u' || *c == 'U') {
6063 not_traditional = true;
6065 if (*c == 'l' || *c == 'L') {
6073 errorf(&token.source_position,
6074 "invalid suffix '%s' on integer constant", suffix->string);
6075 } else if (not_traditional) {
6076 warn_traditional_suffix();
6080 static type_t *check_floatingpoint_suffix(void)
6082 symbol_t *suffix = token.symbol;
6083 type_t *type = type_double;
6087 bool not_traditional = false;
6088 const char *c = suffix->string;
6089 if (*c == 'f' || *c == 'F') {
6092 } else if (*c == 'l' || *c == 'L') {
6094 type = type_long_double;
6097 errorf(&token.source_position,
6098 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6099 } else if (not_traditional) {
6100 warn_traditional_suffix();
6107 * Parse an integer constant.
6109 static expression_t *parse_number_literal(void)
6111 expression_kind_t kind;
6114 switch (token.type) {
6116 kind = EXPR_LITERAL_INTEGER;
6117 check_integer_suffix();
6120 case T_INTEGER_OCTAL:
6121 kind = EXPR_LITERAL_INTEGER_OCTAL;
6122 check_integer_suffix();
6125 case T_INTEGER_HEXADECIMAL:
6126 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6127 check_integer_suffix();
6130 case T_FLOATINGPOINT:
6131 kind = EXPR_LITERAL_FLOATINGPOINT;
6132 type = check_floatingpoint_suffix();
6134 case T_FLOATINGPOINT_HEXADECIMAL:
6135 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6136 type = check_floatingpoint_suffix();
6139 panic("unexpected token type in parse_number_literal");
6142 expression_t *literal = allocate_expression_zero(kind);
6143 literal->base.source_position = token.source_position;
6144 literal->base.type = type;
6145 literal->literal.value = token.literal;
6146 literal->literal.suffix = token.symbol;
6149 /* integer type depends on the size of the number and the size
6150 * representable by the types. The backend/codegeneration has to determine
6153 determine_literal_type(&literal->literal);
6158 * Parse a character constant.
6160 static expression_t *parse_character_constant(void)
6162 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6163 literal->base.source_position = token.source_position;
6164 literal->base.type = c_mode & _CXX ? type_char : type_int;
6165 literal->literal.value = token.literal;
6167 size_t len = literal->literal.value.size;
6169 if (!GNU_MODE && !(c_mode & _C99)) {
6170 errorf(HERE, "more than 1 character in character constant");
6171 } else if (warning.multichar) {
6172 literal->base.type = type_int;
6173 warningf(HERE, "multi-character character constant");
6182 * Parse a wide character constant.
6184 static expression_t *parse_wide_character_constant(void)
6186 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6187 literal->base.source_position = token.source_position;
6188 literal->base.type = type_int;
6189 literal->literal.value = token.literal;
6191 size_t len = wstrlen(&literal->literal.value);
6193 warningf(HERE, "multi-character character constant");
6200 static entity_t *create_implicit_function(symbol_t *symbol,
6201 const source_position_t *source_position)
6203 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6204 ntype->function.return_type = type_int;
6205 ntype->function.unspecified_parameters = true;
6206 ntype->function.linkage = LINKAGE_C;
6207 type_t *type = identify_new_type(ntype);
6209 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6210 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6211 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6212 entity->declaration.type = type;
6213 entity->declaration.implicit = true;
6214 entity->base.symbol = symbol;
6215 entity->base.source_position = *source_position;
6217 if (current_scope != NULL) {
6218 bool strict_prototypes_old = warning.strict_prototypes;
6219 warning.strict_prototypes = false;
6220 record_entity(entity, false);
6221 warning.strict_prototypes = strict_prototypes_old;
6228 * Performs automatic type cast as described in §6.3.2.1.
6230 * @param orig_type the original type
6232 static type_t *automatic_type_conversion(type_t *orig_type)
6234 type_t *type = skip_typeref(orig_type);
6235 if (is_type_array(type)) {
6236 array_type_t *array_type = &type->array;
6237 type_t *element_type = array_type->element_type;
6238 unsigned qualifiers = array_type->base.qualifiers;
6240 return make_pointer_type(element_type, qualifiers);
6243 if (is_type_function(type)) {
6244 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6251 * reverts the automatic casts of array to pointer types and function
6252 * to function-pointer types as defined §6.3.2.1
6254 type_t *revert_automatic_type_conversion(const expression_t *expression)
6256 switch (expression->kind) {
6257 case EXPR_REFERENCE: {
6258 entity_t *entity = expression->reference.entity;
6259 if (is_declaration(entity)) {
6260 return entity->declaration.type;
6261 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6262 return entity->enum_value.enum_type;
6264 panic("no declaration or enum in reference");
6269 entity_t *entity = expression->select.compound_entry;
6270 assert(is_declaration(entity));
6271 type_t *type = entity->declaration.type;
6272 return get_qualified_type(type,
6273 expression->base.type->base.qualifiers);
6276 case EXPR_UNARY_DEREFERENCE: {
6277 const expression_t *const value = expression->unary.value;
6278 type_t *const type = skip_typeref(value->base.type);
6279 if (!is_type_pointer(type))
6280 return type_error_type;
6281 return type->pointer.points_to;
6284 case EXPR_ARRAY_ACCESS: {
6285 const expression_t *array_ref = expression->array_access.array_ref;
6286 type_t *type_left = skip_typeref(array_ref->base.type);
6287 if (!is_type_pointer(type_left))
6288 return type_error_type;
6289 return type_left->pointer.points_to;
6292 case EXPR_STRING_LITERAL: {
6293 size_t size = expression->string_literal.value.size;
6294 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6297 case EXPR_WIDE_STRING_LITERAL: {
6298 size_t size = wstrlen(&expression->string_literal.value);
6299 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6302 case EXPR_COMPOUND_LITERAL:
6303 return expression->compound_literal.type;
6308 return expression->base.type;
6312 * Find an entity matching a symbol in a scope.
6313 * Uses current scope if scope is NULL
6315 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6316 namespace_tag_t namespc)
6318 if (scope == NULL) {
6319 return get_entity(symbol, namespc);
6322 /* we should optimize here, if scope grows above a certain size we should
6323 construct a hashmap here... */
6324 entity_t *entity = scope->entities;
6325 for ( ; entity != NULL; entity = entity->base.next) {
6326 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6333 static entity_t *parse_qualified_identifier(void)
6335 /* namespace containing the symbol */
6337 source_position_t pos;
6338 const scope_t *lookup_scope = NULL;
6340 if (next_if(T_COLONCOLON))
6341 lookup_scope = &unit->scope;
6345 if (token.type != T_IDENTIFIER) {
6346 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6347 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6349 symbol = token.symbol;
6354 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6356 if (!next_if(T_COLONCOLON))
6359 switch (entity->kind) {
6360 case ENTITY_NAMESPACE:
6361 lookup_scope = &entity->namespacee.members;
6366 lookup_scope = &entity->compound.members;
6369 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6370 symbol, get_entity_kind_name(entity->kind));
6375 if (entity == NULL) {
6376 if (!strict_mode && token.type == '(') {
6377 /* an implicitly declared function */
6378 if (warning.error_implicit_function_declaration) {
6379 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6380 } else if (warning.implicit_function_declaration) {
6381 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6384 entity = create_implicit_function(symbol, &pos);
6386 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6387 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6394 /* skip further qualifications */
6395 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6397 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6400 static expression_t *parse_reference(void)
6402 entity_t *entity = parse_qualified_identifier();
6405 if (is_declaration(entity)) {
6406 orig_type = entity->declaration.type;
6407 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6408 orig_type = entity->enum_value.enum_type;
6410 panic("expected declaration or enum value in reference");
6413 /* we always do the auto-type conversions; the & and sizeof parser contains
6414 * code to revert this! */
6415 type_t *type = automatic_type_conversion(orig_type);
6417 expression_kind_t kind = EXPR_REFERENCE;
6418 if (entity->kind == ENTITY_ENUM_VALUE)
6419 kind = EXPR_REFERENCE_ENUM_VALUE;
6421 expression_t *expression = allocate_expression_zero(kind);
6422 expression->reference.entity = entity;
6423 expression->base.type = type;
6425 /* this declaration is used */
6426 if (is_declaration(entity)) {
6427 entity->declaration.used = true;
6430 if (entity->base.parent_scope != file_scope
6431 && (current_function != NULL
6432 && entity->base.parent_scope->depth < current_function->parameters.depth)
6433 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6434 if (entity->kind == ENTITY_VARIABLE) {
6435 /* access of a variable from an outer function */
6436 entity->variable.address_taken = true;
6437 } else if (entity->kind == ENTITY_PARAMETER) {
6438 entity->parameter.address_taken = true;
6440 current_function->need_closure = true;
6443 check_deprecated(HERE, entity);
6445 if (warning.init_self && entity == current_init_decl && !in_type_prop
6446 && entity->kind == ENTITY_VARIABLE) {
6447 current_init_decl = NULL;
6448 warningf(HERE, "variable '%#T' is initialized by itself",
6449 entity->declaration.type, entity->base.symbol);
6455 static bool semantic_cast(expression_t *cast)
6457 expression_t *expression = cast->unary.value;
6458 type_t *orig_dest_type = cast->base.type;
6459 type_t *orig_type_right = expression->base.type;
6460 type_t const *dst_type = skip_typeref(orig_dest_type);
6461 type_t const *src_type = skip_typeref(orig_type_right);
6462 source_position_t const *pos = &cast->base.source_position;
6464 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6465 if (dst_type == type_void)
6468 /* only integer and pointer can be casted to pointer */
6469 if (is_type_pointer(dst_type) &&
6470 !is_type_pointer(src_type) &&
6471 !is_type_integer(src_type) &&
6472 is_type_valid(src_type)) {
6473 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6477 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6478 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6482 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6483 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6487 if (warning.cast_qual &&
6488 is_type_pointer(src_type) &&
6489 is_type_pointer(dst_type)) {
6490 type_t *src = skip_typeref(src_type->pointer.points_to);
6491 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6492 unsigned missing_qualifiers =
6493 src->base.qualifiers & ~dst->base.qualifiers;
6494 if (missing_qualifiers != 0) {
6496 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6497 missing_qualifiers, orig_type_right);
6503 static expression_t *parse_compound_literal(type_t *type)
6505 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6507 parse_initializer_env_t env;
6510 env.must_be_constant = false;
6511 initializer_t *initializer = parse_initializer(&env);
6514 expression->compound_literal.initializer = initializer;
6515 expression->compound_literal.type = type;
6516 expression->base.type = automatic_type_conversion(type);
6522 * Parse a cast expression.
6524 static expression_t *parse_cast(void)
6526 add_anchor_token(')');
6528 source_position_t source_position = token.source_position;
6530 type_t *type = parse_typename();
6532 rem_anchor_token(')');
6533 expect(')', end_error);
6535 if (token.type == '{') {
6536 return parse_compound_literal(type);
6539 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6540 cast->base.source_position = source_position;
6542 expression_t *value = parse_sub_expression(PREC_CAST);
6543 cast->base.type = type;
6544 cast->unary.value = value;
6546 if (! semantic_cast(cast)) {
6547 /* TODO: record the error in the AST. else it is impossible to detect it */
6552 return create_invalid_expression();
6556 * Parse a statement expression.
6558 static expression_t *parse_statement_expression(void)
6560 add_anchor_token(')');
6562 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6564 statement_t *statement = parse_compound_statement(true);
6565 statement->compound.stmt_expr = true;
6566 expression->statement.statement = statement;
6568 /* find last statement and use its type */
6569 type_t *type = type_void;
6570 const statement_t *stmt = statement->compound.statements;
6572 while (stmt->base.next != NULL)
6573 stmt = stmt->base.next;
6575 if (stmt->kind == STATEMENT_EXPRESSION) {
6576 type = stmt->expression.expression->base.type;
6578 } else if (warning.other) {
6579 warningf(&expression->base.source_position, "empty statement expression ({})");
6581 expression->base.type = type;
6583 rem_anchor_token(')');
6584 expect(')', end_error);
6591 * Parse a parenthesized expression.
6593 static expression_t *parse_parenthesized_expression(void)
6597 switch (token.type) {
6599 /* gcc extension: a statement expression */
6600 return parse_statement_expression();
6604 return parse_cast();
6606 if (is_typedef_symbol(token.symbol)) {
6607 return parse_cast();
6611 add_anchor_token(')');
6612 expression_t *result = parse_expression();
6613 result->base.parenthesized = true;
6614 rem_anchor_token(')');
6615 expect(')', end_error);
6621 static expression_t *parse_function_keyword(void)
6625 if (current_function == NULL) {
6626 errorf(HERE, "'__func__' used outside of a function");
6629 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6630 expression->base.type = type_char_ptr;
6631 expression->funcname.kind = FUNCNAME_FUNCTION;
6638 static expression_t *parse_pretty_function_keyword(void)
6640 if (current_function == NULL) {
6641 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6644 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6645 expression->base.type = type_char_ptr;
6646 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6648 eat(T___PRETTY_FUNCTION__);
6653 static expression_t *parse_funcsig_keyword(void)
6655 if (current_function == NULL) {
6656 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6659 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6660 expression->base.type = type_char_ptr;
6661 expression->funcname.kind = FUNCNAME_FUNCSIG;
6668 static expression_t *parse_funcdname_keyword(void)
6670 if (current_function == NULL) {
6671 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6674 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6675 expression->base.type = type_char_ptr;
6676 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6678 eat(T___FUNCDNAME__);
6683 static designator_t *parse_designator(void)
6685 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6686 result->source_position = *HERE;
6688 if (token.type != T_IDENTIFIER) {
6689 parse_error_expected("while parsing member designator",
6690 T_IDENTIFIER, NULL);
6693 result->symbol = token.symbol;
6696 designator_t *last_designator = result;
6699 if (token.type != T_IDENTIFIER) {
6700 parse_error_expected("while parsing member designator",
6701 T_IDENTIFIER, NULL);
6704 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6705 designator->source_position = *HERE;
6706 designator->symbol = token.symbol;
6709 last_designator->next = designator;
6710 last_designator = designator;
6714 add_anchor_token(']');
6715 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6716 designator->source_position = *HERE;
6717 designator->array_index = parse_expression();
6718 rem_anchor_token(']');
6719 expect(']', end_error);
6720 if (designator->array_index == NULL) {
6724 last_designator->next = designator;
6725 last_designator = designator;
6737 * Parse the __builtin_offsetof() expression.
6739 static expression_t *parse_offsetof(void)
6741 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6742 expression->base.type = type_size_t;
6744 eat(T___builtin_offsetof);
6746 expect('(', end_error);
6747 add_anchor_token(',');
6748 type_t *type = parse_typename();
6749 rem_anchor_token(',');
6750 expect(',', end_error);
6751 add_anchor_token(')');
6752 designator_t *designator = parse_designator();
6753 rem_anchor_token(')');
6754 expect(')', end_error);
6756 expression->offsetofe.type = type;
6757 expression->offsetofe.designator = designator;
6760 memset(&path, 0, sizeof(path));
6761 path.top_type = type;
6762 path.path = NEW_ARR_F(type_path_entry_t, 0);
6764 descend_into_subtype(&path);
6766 if (!walk_designator(&path, designator, true)) {
6767 return create_invalid_expression();
6770 DEL_ARR_F(path.path);
6774 return create_invalid_expression();
6778 * Parses a _builtin_va_start() expression.
6780 static expression_t *parse_va_start(void)
6782 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6784 eat(T___builtin_va_start);
6786 expect('(', end_error);
6787 add_anchor_token(',');
6788 expression->va_starte.ap = parse_assignment_expression();
6789 rem_anchor_token(',');
6790 expect(',', end_error);
6791 expression_t *const expr = parse_assignment_expression();
6792 if (expr->kind == EXPR_REFERENCE) {
6793 entity_t *const entity = expr->reference.entity;
6794 if (!current_function->base.type->function.variadic) {
6795 errorf(&expr->base.source_position,
6796 "'va_start' used in non-variadic function");
6797 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6798 entity->base.next != NULL ||
6799 entity->kind != ENTITY_PARAMETER) {
6800 errorf(&expr->base.source_position,
6801 "second argument of 'va_start' must be last parameter of the current function");
6803 expression->va_starte.parameter = &entity->variable;
6805 expect(')', end_error);
6808 expect(')', end_error);
6810 return create_invalid_expression();
6814 * Parses a __builtin_va_arg() expression.
6816 static expression_t *parse_va_arg(void)
6818 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6820 eat(T___builtin_va_arg);
6822 expect('(', end_error);
6824 ap.expression = parse_assignment_expression();
6825 expression->va_arge.ap = ap.expression;
6826 check_call_argument(type_valist, &ap, 1);
6828 expect(',', end_error);
6829 expression->base.type = parse_typename();
6830 expect(')', end_error);
6834 return create_invalid_expression();
6838 * Parses a __builtin_va_copy() expression.
6840 static expression_t *parse_va_copy(void)
6842 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6844 eat(T___builtin_va_copy);
6846 expect('(', end_error);
6847 expression_t *dst = parse_assignment_expression();
6848 assign_error_t error = semantic_assign(type_valist, dst);
6849 report_assign_error(error, type_valist, dst, "call argument 1",
6850 &dst->base.source_position);
6851 expression->va_copye.dst = dst;
6853 expect(',', end_error);
6855 call_argument_t src;
6856 src.expression = parse_assignment_expression();
6857 check_call_argument(type_valist, &src, 2);
6858 expression->va_copye.src = src.expression;
6859 expect(')', end_error);
6863 return create_invalid_expression();
6867 * Parses a __builtin_constant_p() expression.
6869 static expression_t *parse_builtin_constant(void)
6871 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6873 eat(T___builtin_constant_p);
6875 expect('(', end_error);
6876 add_anchor_token(')');
6877 expression->builtin_constant.value = parse_assignment_expression();
6878 rem_anchor_token(')');
6879 expect(')', end_error);
6880 expression->base.type = type_int;
6884 return create_invalid_expression();
6888 * Parses a __builtin_types_compatible_p() expression.
6890 static expression_t *parse_builtin_types_compatible(void)
6892 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6894 eat(T___builtin_types_compatible_p);
6896 expect('(', end_error);
6897 add_anchor_token(')');
6898 add_anchor_token(',');
6899 expression->builtin_types_compatible.left = parse_typename();
6900 rem_anchor_token(',');
6901 expect(',', end_error);
6902 expression->builtin_types_compatible.right = parse_typename();
6903 rem_anchor_token(')');
6904 expect(')', end_error);
6905 expression->base.type = type_int;
6909 return create_invalid_expression();
6913 * Parses a __builtin_is_*() compare expression.
6915 static expression_t *parse_compare_builtin(void)
6917 expression_t *expression;
6919 switch (token.type) {
6920 case T___builtin_isgreater:
6921 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6923 case T___builtin_isgreaterequal:
6924 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6926 case T___builtin_isless:
6927 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6929 case T___builtin_islessequal:
6930 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6932 case T___builtin_islessgreater:
6933 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6935 case T___builtin_isunordered:
6936 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6939 internal_errorf(HERE, "invalid compare builtin found");
6941 expression->base.source_position = *HERE;
6944 expect('(', end_error);
6945 expression->binary.left = parse_assignment_expression();
6946 expect(',', end_error);
6947 expression->binary.right = parse_assignment_expression();
6948 expect(')', end_error);
6950 type_t *const orig_type_left = expression->binary.left->base.type;
6951 type_t *const orig_type_right = expression->binary.right->base.type;
6953 type_t *const type_left = skip_typeref(orig_type_left);
6954 type_t *const type_right = skip_typeref(orig_type_right);
6955 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6956 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6957 type_error_incompatible("invalid operands in comparison",
6958 &expression->base.source_position, orig_type_left, orig_type_right);
6961 semantic_comparison(&expression->binary);
6966 return create_invalid_expression();
6970 * Parses a MS assume() expression.
6972 static expression_t *parse_assume(void)
6974 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6978 expect('(', end_error);
6979 add_anchor_token(')');
6980 expression->unary.value = parse_assignment_expression();
6981 rem_anchor_token(')');
6982 expect(')', end_error);
6984 expression->base.type = type_void;
6987 return create_invalid_expression();
6991 * Return the declaration for a given label symbol or create a new one.
6993 * @param symbol the symbol of the label
6995 static label_t *get_label(symbol_t *symbol)
6998 assert(current_function != NULL);
7000 label = get_entity(symbol, NAMESPACE_LABEL);
7001 /* if we found a local label, we already created the declaration */
7002 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7003 if (label->base.parent_scope != current_scope) {
7004 assert(label->base.parent_scope->depth < current_scope->depth);
7005 current_function->goto_to_outer = true;
7007 return &label->label;
7010 label = get_entity(symbol, NAMESPACE_LABEL);
7011 /* if we found a label in the same function, then we already created the
7014 && label->base.parent_scope == ¤t_function->parameters) {
7015 return &label->label;
7018 /* otherwise we need to create a new one */
7019 label = allocate_entity_zero(ENTITY_LABEL);
7020 label->base.namespc = NAMESPACE_LABEL;
7021 label->base.symbol = symbol;
7025 return &label->label;
7029 * Parses a GNU && label address expression.
7031 static expression_t *parse_label_address(void)
7033 source_position_t source_position = token.source_position;
7035 if (token.type != T_IDENTIFIER) {
7036 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7039 symbol_t *symbol = token.symbol;
7042 label_t *label = get_label(symbol);
7044 label->address_taken = true;
7046 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7047 expression->base.source_position = source_position;
7049 /* label address is threaten as a void pointer */
7050 expression->base.type = type_void_ptr;
7051 expression->label_address.label = label;
7054 return create_invalid_expression();
7058 * Parse a microsoft __noop expression.
7060 static expression_t *parse_noop_expression(void)
7062 /* the result is a (int)0 */
7063 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7064 literal->base.type = type_int;
7065 literal->base.source_position = token.source_position;
7066 literal->literal.value.begin = "__noop";
7067 literal->literal.value.size = 6;
7071 if (token.type == '(') {
7072 /* parse arguments */
7074 add_anchor_token(')');
7075 add_anchor_token(',');
7077 if (token.type != ')') do {
7078 (void)parse_assignment_expression();
7079 } while (next_if(','));
7081 rem_anchor_token(',');
7082 rem_anchor_token(')');
7083 expect(')', end_error);
7090 * Parses a primary expression.
7092 static expression_t *parse_primary_expression(void)
7094 switch (token.type) {
7095 case T_false: return parse_boolean_literal(false);
7096 case T_true: return parse_boolean_literal(true);
7098 case T_INTEGER_OCTAL:
7099 case T_INTEGER_HEXADECIMAL:
7100 case T_FLOATINGPOINT:
7101 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7102 case T_CHARACTER_CONSTANT: return parse_character_constant();
7103 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7104 case T_STRING_LITERAL:
7105 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7106 case T___FUNCTION__:
7107 case T___func__: return parse_function_keyword();
7108 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7109 case T___FUNCSIG__: return parse_funcsig_keyword();
7110 case T___FUNCDNAME__: return parse_funcdname_keyword();
7111 case T___builtin_offsetof: return parse_offsetof();
7112 case T___builtin_va_start: return parse_va_start();
7113 case T___builtin_va_arg: return parse_va_arg();
7114 case T___builtin_va_copy: return parse_va_copy();
7115 case T___builtin_isgreater:
7116 case T___builtin_isgreaterequal:
7117 case T___builtin_isless:
7118 case T___builtin_islessequal:
7119 case T___builtin_islessgreater:
7120 case T___builtin_isunordered: return parse_compare_builtin();
7121 case T___builtin_constant_p: return parse_builtin_constant();
7122 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7123 case T__assume: return parse_assume();
7126 return parse_label_address();
7129 case '(': return parse_parenthesized_expression();
7130 case T___noop: return parse_noop_expression();
7132 /* Gracefully handle type names while parsing expressions. */
7134 return parse_reference();
7136 if (!is_typedef_symbol(token.symbol)) {
7137 return parse_reference();
7141 source_position_t const pos = *HERE;
7142 type_t const *const type = parse_typename();
7143 errorf(&pos, "encountered type '%T' while parsing expression", type);
7144 return create_invalid_expression();
7148 errorf(HERE, "unexpected token %K, expected an expression", &token);
7149 return create_invalid_expression();
7153 * Check if the expression has the character type and issue a warning then.
7155 static void check_for_char_index_type(const expression_t *expression)
7157 type_t *const type = expression->base.type;
7158 const type_t *const base_type = skip_typeref(type);
7160 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7161 warning.char_subscripts) {
7162 warningf(&expression->base.source_position,
7163 "array subscript has type '%T'", type);
7167 static expression_t *parse_array_expression(expression_t *left)
7169 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7172 add_anchor_token(']');
7174 expression_t *inside = parse_expression();
7176 type_t *const orig_type_left = left->base.type;
7177 type_t *const orig_type_inside = inside->base.type;
7179 type_t *const type_left = skip_typeref(orig_type_left);
7180 type_t *const type_inside = skip_typeref(orig_type_inside);
7182 type_t *return_type;
7183 array_access_expression_t *array_access = &expression->array_access;
7184 if (is_type_pointer(type_left)) {
7185 return_type = type_left->pointer.points_to;
7186 array_access->array_ref = left;
7187 array_access->index = inside;
7188 check_for_char_index_type(inside);
7189 } else if (is_type_pointer(type_inside)) {
7190 return_type = type_inside->pointer.points_to;
7191 array_access->array_ref = inside;
7192 array_access->index = left;
7193 array_access->flipped = true;
7194 check_for_char_index_type(left);
7196 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7198 "array access on object with non-pointer types '%T', '%T'",
7199 orig_type_left, orig_type_inside);
7201 return_type = type_error_type;
7202 array_access->array_ref = left;
7203 array_access->index = inside;
7206 expression->base.type = automatic_type_conversion(return_type);
7208 rem_anchor_token(']');
7209 expect(']', end_error);
7214 static expression_t *parse_typeprop(expression_kind_t const kind)
7216 expression_t *tp_expression = allocate_expression_zero(kind);
7217 tp_expression->base.type = type_size_t;
7219 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7221 /* we only refer to a type property, mark this case */
7222 bool old = in_type_prop;
7223 in_type_prop = true;
7226 expression_t *expression;
7227 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7229 add_anchor_token(')');
7230 orig_type = parse_typename();
7231 rem_anchor_token(')');
7232 expect(')', end_error);
7234 if (token.type == '{') {
7235 /* It was not sizeof(type) after all. It is sizeof of an expression
7236 * starting with a compound literal */
7237 expression = parse_compound_literal(orig_type);
7238 goto typeprop_expression;
7241 expression = parse_sub_expression(PREC_UNARY);
7243 typeprop_expression:
7244 tp_expression->typeprop.tp_expression = expression;
7246 orig_type = revert_automatic_type_conversion(expression);
7247 expression->base.type = orig_type;
7250 tp_expression->typeprop.type = orig_type;
7251 type_t const* const type = skip_typeref(orig_type);
7252 char const* const wrong_type =
7253 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7254 is_type_incomplete(type) ? "incomplete" :
7255 type->kind == TYPE_FUNCTION ? "function designator" :
7256 type->kind == TYPE_BITFIELD ? "bitfield" :
7258 if (wrong_type != NULL) {
7259 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7260 errorf(&tp_expression->base.source_position,
7261 "operand of %s expression must not be of %s type '%T'",
7262 what, wrong_type, orig_type);
7267 return tp_expression;
7270 static expression_t *parse_sizeof(void)
7272 return parse_typeprop(EXPR_SIZEOF);
7275 static expression_t *parse_alignof(void)
7277 return parse_typeprop(EXPR_ALIGNOF);
7280 static expression_t *parse_select_expression(expression_t *addr)
7282 assert(token.type == '.' || token.type == T_MINUSGREATER);
7283 bool select_left_arrow = (token.type == T_MINUSGREATER);
7286 if (token.type != T_IDENTIFIER) {
7287 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7288 return create_invalid_expression();
7290 symbol_t *symbol = token.symbol;
7293 type_t *const orig_type = addr->base.type;
7294 type_t *const type = skip_typeref(orig_type);
7297 bool saw_error = false;
7298 if (is_type_pointer(type)) {
7299 if (!select_left_arrow) {
7301 "request for member '%Y' in something not a struct or union, but '%T'",
7305 type_left = skip_typeref(type->pointer.points_to);
7307 if (select_left_arrow && is_type_valid(type)) {
7308 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7314 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7315 type_left->kind != TYPE_COMPOUND_UNION) {
7317 if (is_type_valid(type_left) && !saw_error) {
7319 "request for member '%Y' in something not a struct or union, but '%T'",
7322 return create_invalid_expression();
7325 compound_t *compound = type_left->compound.compound;
7326 if (!compound->complete) {
7327 errorf(HERE, "request for member '%Y' in incomplete type '%T'",
7329 return create_invalid_expression();
7332 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7333 expression_t *result
7334 = find_create_select(HERE, addr, qualifiers, compound, symbol);
7336 if (result == NULL) {
7337 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7338 return create_invalid_expression();
7344 static void check_call_argument(type_t *expected_type,
7345 call_argument_t *argument, unsigned pos)
7347 type_t *expected_type_skip = skip_typeref(expected_type);
7348 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7349 expression_t *arg_expr = argument->expression;
7350 type_t *arg_type = skip_typeref(arg_expr->base.type);
7352 /* handle transparent union gnu extension */
7353 if (is_type_union(expected_type_skip)
7354 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7355 compound_t *union_decl = expected_type_skip->compound.compound;
7356 type_t *best_type = NULL;
7357 entity_t *entry = union_decl->members.entities;
7358 for ( ; entry != NULL; entry = entry->base.next) {
7359 assert(is_declaration(entry));
7360 type_t *decl_type = entry->declaration.type;
7361 error = semantic_assign(decl_type, arg_expr);
7362 if (error == ASSIGN_ERROR_INCOMPATIBLE
7363 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7366 if (error == ASSIGN_SUCCESS) {
7367 best_type = decl_type;
7368 } else if (best_type == NULL) {
7369 best_type = decl_type;
7373 if (best_type != NULL) {
7374 expected_type = best_type;
7378 error = semantic_assign(expected_type, arg_expr);
7379 argument->expression = create_implicit_cast(arg_expr, expected_type);
7381 if (error != ASSIGN_SUCCESS) {
7382 /* report exact scope in error messages (like "in argument 3") */
7384 snprintf(buf, sizeof(buf), "call argument %u", pos);
7385 report_assign_error(error, expected_type, arg_expr, buf,
7386 &arg_expr->base.source_position);
7387 } else if (warning.traditional || warning.conversion) {
7388 type_t *const promoted_type = get_default_promoted_type(arg_type);
7389 if (!types_compatible(expected_type_skip, promoted_type) &&
7390 !types_compatible(expected_type_skip, type_void_ptr) &&
7391 !types_compatible(type_void_ptr, promoted_type)) {
7392 /* Deliberately show the skipped types in this warning */
7393 warningf(&arg_expr->base.source_position,
7394 "passing call argument %u as '%T' rather than '%T' due to prototype",
7395 pos, expected_type_skip, promoted_type);
7401 * Handle the semantic restrictions of builtin calls
7403 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7404 switch (call->function->reference.entity->function.btk) {
7405 case bk_gnu_builtin_return_address:
7406 case bk_gnu_builtin_frame_address: {
7407 /* argument must be constant */
7408 call_argument_t *argument = call->arguments;
7410 if (! is_constant_expression(argument->expression)) {
7411 errorf(&call->base.source_position,
7412 "argument of '%Y' must be a constant expression",
7413 call->function->reference.entity->base.symbol);
7417 case bk_gnu_builtin_prefetch: {
7418 /* second and third argument must be constant if existent */
7419 call_argument_t *rw = call->arguments->next;
7420 call_argument_t *locality = NULL;
7423 if (! is_constant_expression(rw->expression)) {
7424 errorf(&call->base.source_position,
7425 "second argument of '%Y' must be a constant expression",
7426 call->function->reference.entity->base.symbol);
7428 locality = rw->next;
7430 if (locality != NULL) {
7431 if (! is_constant_expression(locality->expression)) {
7432 errorf(&call->base.source_position,
7433 "third argument of '%Y' must be a constant expression",
7434 call->function->reference.entity->base.symbol);
7436 locality = rw->next;
7446 * Parse a call expression, ie. expression '( ... )'.
7448 * @param expression the function address
7450 static expression_t *parse_call_expression(expression_t *expression)
7452 expression_t *result = allocate_expression_zero(EXPR_CALL);
7453 call_expression_t *call = &result->call;
7454 call->function = expression;
7456 type_t *const orig_type = expression->base.type;
7457 type_t *const type = skip_typeref(orig_type);
7459 function_type_t *function_type = NULL;
7460 if (is_type_pointer(type)) {
7461 type_t *const to_type = skip_typeref(type->pointer.points_to);
7463 if (is_type_function(to_type)) {
7464 function_type = &to_type->function;
7465 call->base.type = function_type->return_type;
7469 if (function_type == NULL && is_type_valid(type)) {
7471 "called object '%E' (type '%T') is not a pointer to a function",
7472 expression, orig_type);
7475 /* parse arguments */
7477 add_anchor_token(')');
7478 add_anchor_token(',');
7480 if (token.type != ')') {
7481 call_argument_t **anchor = &call->arguments;
7483 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7484 argument->expression = parse_assignment_expression();
7487 anchor = &argument->next;
7488 } while (next_if(','));
7490 rem_anchor_token(',');
7491 rem_anchor_token(')');
7492 expect(')', end_error);
7494 if (function_type == NULL)
7497 /* check type and count of call arguments */
7498 function_parameter_t *parameter = function_type->parameters;
7499 call_argument_t *argument = call->arguments;
7500 if (!function_type->unspecified_parameters) {
7501 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7502 parameter = parameter->next, argument = argument->next) {
7503 check_call_argument(parameter->type, argument, ++pos);
7506 if (parameter != NULL) {
7507 errorf(HERE, "too few arguments to function '%E'", expression);
7508 } else if (argument != NULL && !function_type->variadic) {
7509 errorf(HERE, "too many arguments to function '%E'", expression);
7513 /* do default promotion for other arguments */
7514 for (; argument != NULL; argument = argument->next) {
7515 type_t *type = argument->expression->base.type;
7517 type = get_default_promoted_type(type);
7519 argument->expression
7520 = create_implicit_cast(argument->expression, type);
7523 check_format(&result->call);
7525 if (warning.aggregate_return &&
7526 is_type_compound(skip_typeref(function_type->return_type))) {
7527 warningf(&result->base.source_position,
7528 "function call has aggregate value");
7531 if (call->function->kind == EXPR_REFERENCE) {
7532 reference_expression_t *reference = &call->function->reference;
7533 if (reference->entity->kind == ENTITY_FUNCTION &&
7534 reference->entity->function.btk != bk_none)
7535 handle_builtin_argument_restrictions(call);
7542 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7544 static bool same_compound_type(const type_t *type1, const type_t *type2)
7547 is_type_compound(type1) &&
7548 type1->kind == type2->kind &&
7549 type1->compound.compound == type2->compound.compound;
7552 static expression_t const *get_reference_address(expression_t const *expr)
7554 bool regular_take_address = true;
7556 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7557 expr = expr->unary.value;
7559 regular_take_address = false;
7562 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7565 expr = expr->unary.value;
7568 if (expr->kind != EXPR_REFERENCE)
7571 /* special case for functions which are automatically converted to a
7572 * pointer to function without an extra TAKE_ADDRESS operation */
7573 if (!regular_take_address &&
7574 expr->reference.entity->kind != ENTITY_FUNCTION) {
7581 static void warn_reference_address_as_bool(expression_t const* expr)
7583 if (!warning.address)
7586 expr = get_reference_address(expr);
7588 warningf(&expr->base.source_position,
7589 "the address of '%Y' will always evaluate as 'true'",
7590 expr->reference.entity->base.symbol);
7594 static void warn_assignment_in_condition(const expression_t *const expr)
7596 if (!warning.parentheses)
7598 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7600 if (expr->base.parenthesized)
7602 warningf(&expr->base.source_position,
7603 "suggest parentheses around assignment used as truth value");
7606 static void semantic_condition(expression_t const *const expr,
7607 char const *const context)
7609 type_t *const type = skip_typeref(expr->base.type);
7610 if (is_type_scalar(type)) {
7611 warn_reference_address_as_bool(expr);
7612 warn_assignment_in_condition(expr);
7613 } else if (is_type_valid(type)) {
7614 errorf(&expr->base.source_position,
7615 "%s must have scalar type", context);
7620 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7622 * @param expression the conditional expression
7624 static expression_t *parse_conditional_expression(expression_t *expression)
7626 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7628 conditional_expression_t *conditional = &result->conditional;
7629 conditional->condition = expression;
7632 add_anchor_token(':');
7634 /* §6.5.15:2 The first operand shall have scalar type. */
7635 semantic_condition(expression, "condition of conditional operator");
7637 expression_t *true_expression = expression;
7638 bool gnu_cond = false;
7639 if (GNU_MODE && token.type == ':') {
7642 true_expression = parse_expression();
7644 rem_anchor_token(':');
7645 expect(':', end_error);
7647 expression_t *false_expression =
7648 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7650 type_t *const orig_true_type = true_expression->base.type;
7651 type_t *const orig_false_type = false_expression->base.type;
7652 type_t *const true_type = skip_typeref(orig_true_type);
7653 type_t *const false_type = skip_typeref(orig_false_type);
7656 type_t *result_type;
7657 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7658 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7659 /* ISO/IEC 14882:1998(E) §5.16:2 */
7660 if (true_expression->kind == EXPR_UNARY_THROW) {
7661 result_type = false_type;
7662 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7663 result_type = true_type;
7665 if (warning.other && (
7666 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7667 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7669 warningf(&conditional->base.source_position,
7670 "ISO C forbids conditional expression with only one void side");
7672 result_type = type_void;
7674 } else if (is_type_arithmetic(true_type)
7675 && is_type_arithmetic(false_type)) {
7676 result_type = semantic_arithmetic(true_type, false_type);
7678 true_expression = create_implicit_cast(true_expression, result_type);
7679 false_expression = create_implicit_cast(false_expression, result_type);
7681 conditional->true_expression = true_expression;
7682 conditional->false_expression = false_expression;
7683 conditional->base.type = result_type;
7684 } else if (same_compound_type(true_type, false_type)) {
7685 /* just take 1 of the 2 types */
7686 result_type = true_type;
7687 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7688 type_t *pointer_type;
7690 expression_t *other_expression;
7691 if (is_type_pointer(true_type) &&
7692 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7693 pointer_type = true_type;
7694 other_type = false_type;
7695 other_expression = false_expression;
7697 pointer_type = false_type;
7698 other_type = true_type;
7699 other_expression = true_expression;
7702 if (is_null_pointer_constant(other_expression)) {
7703 result_type = pointer_type;
7704 } else if (is_type_pointer(other_type)) {
7705 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7706 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7709 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7710 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7712 } else if (types_compatible(get_unqualified_type(to1),
7713 get_unqualified_type(to2))) {
7716 if (warning.other) {
7717 warningf(&conditional->base.source_position,
7718 "pointer types '%T' and '%T' in conditional expression are incompatible",
7719 true_type, false_type);
7724 type_t *const type =
7725 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7726 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7727 } else if (is_type_integer(other_type)) {
7728 if (warning.other) {
7729 warningf(&conditional->base.source_position,
7730 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7732 result_type = pointer_type;
7734 if (is_type_valid(other_type)) {
7735 type_error_incompatible("while parsing conditional",
7736 &expression->base.source_position, true_type, false_type);
7738 result_type = type_error_type;
7741 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7742 type_error_incompatible("while parsing conditional",
7743 &conditional->base.source_position, true_type,
7746 result_type = type_error_type;
7749 conditional->true_expression
7750 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7751 conditional->false_expression
7752 = create_implicit_cast(false_expression, result_type);
7753 conditional->base.type = result_type;
7758 * Parse an extension expression.
7760 static expression_t *parse_extension(void)
7762 eat(T___extension__);
7764 bool old_gcc_extension = in_gcc_extension;
7765 in_gcc_extension = true;
7766 expression_t *expression = parse_sub_expression(PREC_UNARY);
7767 in_gcc_extension = old_gcc_extension;
7772 * Parse a __builtin_classify_type() expression.
7774 static expression_t *parse_builtin_classify_type(void)
7776 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7777 result->base.type = type_int;
7779 eat(T___builtin_classify_type);
7781 expect('(', end_error);
7782 add_anchor_token(')');
7783 expression_t *expression = parse_expression();
7784 rem_anchor_token(')');
7785 expect(')', end_error);
7786 result->classify_type.type_expression = expression;
7790 return create_invalid_expression();
7794 * Parse a delete expression
7795 * ISO/IEC 14882:1998(E) §5.3.5
7797 static expression_t *parse_delete(void)
7799 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7800 result->base.type = type_void;
7805 result->kind = EXPR_UNARY_DELETE_ARRAY;
7806 expect(']', end_error);
7810 expression_t *const value = parse_sub_expression(PREC_CAST);
7811 result->unary.value = value;
7813 type_t *const type = skip_typeref(value->base.type);
7814 if (!is_type_pointer(type)) {
7815 if (is_type_valid(type)) {
7816 errorf(&value->base.source_position,
7817 "operand of delete must have pointer type");
7819 } else if (warning.other &&
7820 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7821 warningf(&value->base.source_position,
7822 "deleting 'void*' is undefined");
7829 * Parse a throw expression
7830 * ISO/IEC 14882:1998(E) §15:1
7832 static expression_t *parse_throw(void)
7834 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7835 result->base.type = type_void;
7839 expression_t *value = NULL;
7840 switch (token.type) {
7842 value = parse_assignment_expression();
7843 /* ISO/IEC 14882:1998(E) §15.1:3 */
7844 type_t *const orig_type = value->base.type;
7845 type_t *const type = skip_typeref(orig_type);
7846 if (is_type_incomplete(type)) {
7847 errorf(&value->base.source_position,
7848 "cannot throw object of incomplete type '%T'", orig_type);
7849 } else if (is_type_pointer(type)) {
7850 type_t *const points_to = skip_typeref(type->pointer.points_to);
7851 if (is_type_incomplete(points_to) &&
7852 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7853 errorf(&value->base.source_position,
7854 "cannot throw pointer to incomplete type '%T'", orig_type);
7862 result->unary.value = value;
7867 static bool check_pointer_arithmetic(const source_position_t *source_position,
7868 type_t *pointer_type,
7869 type_t *orig_pointer_type)
7871 type_t *points_to = pointer_type->pointer.points_to;
7872 points_to = skip_typeref(points_to);
7874 if (is_type_incomplete(points_to)) {
7875 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7876 errorf(source_position,
7877 "arithmetic with pointer to incomplete type '%T' not allowed",
7880 } else if (warning.pointer_arith) {
7881 warningf(source_position,
7882 "pointer of type '%T' used in arithmetic",
7885 } else if (is_type_function(points_to)) {
7887 errorf(source_position,
7888 "arithmetic with pointer to function type '%T' not allowed",
7891 } else if (warning.pointer_arith) {
7892 warningf(source_position,
7893 "pointer to a function '%T' used in arithmetic",
7900 static bool is_lvalue(const expression_t *expression)
7902 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7903 switch (expression->kind) {
7904 case EXPR_ARRAY_ACCESS:
7905 case EXPR_COMPOUND_LITERAL:
7906 case EXPR_REFERENCE:
7908 case EXPR_UNARY_DEREFERENCE:
7912 type_t *type = skip_typeref(expression->base.type);
7914 /* ISO/IEC 14882:1998(E) §3.10:3 */
7915 is_type_reference(type) ||
7916 /* Claim it is an lvalue, if the type is invalid. There was a parse
7917 * error before, which maybe prevented properly recognizing it as
7919 !is_type_valid(type);
7924 static void semantic_incdec(unary_expression_t *expression)
7926 type_t *const orig_type = expression->value->base.type;
7927 type_t *const type = skip_typeref(orig_type);
7928 if (is_type_pointer(type)) {
7929 if (!check_pointer_arithmetic(&expression->base.source_position,
7933 } else if (!is_type_real(type) && is_type_valid(type)) {
7934 /* TODO: improve error message */
7935 errorf(&expression->base.source_position,
7936 "operation needs an arithmetic or pointer type");
7939 if (!is_lvalue(expression->value)) {
7940 /* TODO: improve error message */
7941 errorf(&expression->base.source_position, "lvalue required as operand");
7943 expression->base.type = orig_type;
7946 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7948 type_t *const orig_type = expression->value->base.type;
7949 type_t *const type = skip_typeref(orig_type);
7950 if (!is_type_arithmetic(type)) {
7951 if (is_type_valid(type)) {
7952 /* TODO: improve error message */
7953 errorf(&expression->base.source_position,
7954 "operation needs an arithmetic type");
7959 expression->base.type = orig_type;
7962 static void semantic_unexpr_plus(unary_expression_t *expression)
7964 semantic_unexpr_arithmetic(expression);
7965 if (warning.traditional)
7966 warningf(&expression->base.source_position,
7967 "traditional C rejects the unary plus operator");
7970 static void semantic_not(unary_expression_t *expression)
7972 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7973 semantic_condition(expression->value, "operand of !");
7974 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7977 static void semantic_unexpr_integer(unary_expression_t *expression)
7979 type_t *const orig_type = expression->value->base.type;
7980 type_t *const type = skip_typeref(orig_type);
7981 if (!is_type_integer(type)) {
7982 if (is_type_valid(type)) {
7983 errorf(&expression->base.source_position,
7984 "operand of ~ must be of integer type");
7989 expression->base.type = orig_type;
7992 static void semantic_dereference(unary_expression_t *expression)
7994 type_t *const orig_type = expression->value->base.type;
7995 type_t *const type = skip_typeref(orig_type);
7996 if (!is_type_pointer(type)) {
7997 if (is_type_valid(type)) {
7998 errorf(&expression->base.source_position,
7999 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8004 type_t *result_type = type->pointer.points_to;
8005 result_type = automatic_type_conversion(result_type);
8006 expression->base.type = result_type;
8010 * Record that an address is taken (expression represents an lvalue).
8012 * @param expression the expression
8013 * @param may_be_register if true, the expression might be an register
8015 static void set_address_taken(expression_t *expression, bool may_be_register)
8017 if (expression->kind != EXPR_REFERENCE)
8020 entity_t *const entity = expression->reference.entity;
8022 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8025 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8026 && !may_be_register) {
8027 errorf(&expression->base.source_position,
8028 "address of register %s '%Y' requested",
8029 get_entity_kind_name(entity->kind), entity->base.symbol);
8032 if (entity->kind == ENTITY_VARIABLE) {
8033 entity->variable.address_taken = true;
8035 assert(entity->kind == ENTITY_PARAMETER);
8036 entity->parameter.address_taken = true;
8041 * Check the semantic of the address taken expression.
8043 static void semantic_take_addr(unary_expression_t *expression)
8045 expression_t *value = expression->value;
8046 value->base.type = revert_automatic_type_conversion(value);
8048 type_t *orig_type = value->base.type;
8049 type_t *type = skip_typeref(orig_type);
8050 if (!is_type_valid(type))
8054 if (!is_lvalue(value)) {
8055 errorf(&expression->base.source_position, "'&' requires an lvalue");
8057 if (type->kind == TYPE_BITFIELD) {
8058 errorf(&expression->base.source_position,
8059 "'&' not allowed on object with bitfield type '%T'",
8063 set_address_taken(value, false);
8065 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8068 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8069 static expression_t *parse_##unexpression_type(void) \
8071 expression_t *unary_expression \
8072 = allocate_expression_zero(unexpression_type); \
8074 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8076 sfunc(&unary_expression->unary); \
8078 return unary_expression; \
8081 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8082 semantic_unexpr_arithmetic)
8083 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8084 semantic_unexpr_plus)
8085 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8087 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8088 semantic_dereference)
8089 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8091 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8092 semantic_unexpr_integer)
8093 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8095 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8098 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8100 static expression_t *parse_##unexpression_type(expression_t *left) \
8102 expression_t *unary_expression \
8103 = allocate_expression_zero(unexpression_type); \
8105 unary_expression->unary.value = left; \
8107 sfunc(&unary_expression->unary); \
8109 return unary_expression; \
8112 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8113 EXPR_UNARY_POSTFIX_INCREMENT,
8115 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8116 EXPR_UNARY_POSTFIX_DECREMENT,
8119 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8121 /* TODO: handle complex + imaginary types */
8123 type_left = get_unqualified_type(type_left);
8124 type_right = get_unqualified_type(type_right);
8126 /* §6.3.1.8 Usual arithmetic conversions */
8127 if (type_left == type_long_double || type_right == type_long_double) {
8128 return type_long_double;
8129 } else if (type_left == type_double || type_right == type_double) {
8131 } else if (type_left == type_float || type_right == type_float) {
8135 type_left = promote_integer(type_left);
8136 type_right = promote_integer(type_right);
8138 if (type_left == type_right)
8141 bool const signed_left = is_type_signed(type_left);
8142 bool const signed_right = is_type_signed(type_right);
8143 int const rank_left = get_rank(type_left);
8144 int const rank_right = get_rank(type_right);
8146 if (signed_left == signed_right)
8147 return rank_left >= rank_right ? type_left : type_right;
8156 u_rank = rank_right;
8157 u_type = type_right;
8159 s_rank = rank_right;
8160 s_type = type_right;
8165 if (u_rank >= s_rank)
8168 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8170 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8171 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8175 case ATOMIC_TYPE_INT: return type_unsigned_int;
8176 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8177 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8179 default: panic("invalid atomic type");
8184 * Check the semantic restrictions for a binary expression.
8186 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8188 expression_t *const left = expression->left;
8189 expression_t *const right = expression->right;
8190 type_t *const orig_type_left = left->base.type;
8191 type_t *const orig_type_right = right->base.type;
8192 type_t *const type_left = skip_typeref(orig_type_left);
8193 type_t *const type_right = skip_typeref(orig_type_right);
8195 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8196 /* TODO: improve error message */
8197 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8198 errorf(&expression->base.source_position,
8199 "operation needs arithmetic types");
8204 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8205 expression->left = create_implicit_cast(left, arithmetic_type);
8206 expression->right = create_implicit_cast(right, arithmetic_type);
8207 expression->base.type = arithmetic_type;
8210 static void warn_div_by_zero(binary_expression_t const *const expression)
8212 if (!warning.div_by_zero ||
8213 !is_type_integer(expression->base.type))
8216 expression_t const *const right = expression->right;
8217 /* The type of the right operand can be different for /= */
8218 if (is_type_integer(right->base.type) &&
8219 is_constant_expression(right) &&
8220 !fold_constant_to_bool(right)) {
8221 warningf(&expression->base.source_position, "division by zero");
8226 * Check the semantic restrictions for a div/mod expression.
8228 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8230 semantic_binexpr_arithmetic(expression);
8231 warn_div_by_zero(expression);
8234 static void warn_addsub_in_shift(const expression_t *const expr)
8236 if (expr->base.parenthesized)
8240 switch (expr->kind) {
8241 case EXPR_BINARY_ADD: op = '+'; break;
8242 case EXPR_BINARY_SUB: op = '-'; break;
8246 warningf(&expr->base.source_position,
8247 "suggest parentheses around '%c' inside shift", op);
8250 static bool semantic_shift(binary_expression_t *expression)
8252 expression_t *const left = expression->left;
8253 expression_t *const right = expression->right;
8254 type_t *const orig_type_left = left->base.type;
8255 type_t *const orig_type_right = right->base.type;
8256 type_t * type_left = skip_typeref(orig_type_left);
8257 type_t * type_right = skip_typeref(orig_type_right);
8259 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8260 /* TODO: improve error message */
8261 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8262 errorf(&expression->base.source_position,
8263 "operands of shift operation must have integer types");
8268 type_left = promote_integer(type_left);
8270 if (is_constant_expression(right)) {
8271 long count = fold_constant_to_int(right);
8273 warningf(&right->base.source_position,
8274 "shift count must be non-negative");
8275 } else if ((unsigned long)count >=
8276 get_atomic_type_size(type_left->atomic.akind) * 8) {
8277 warningf(&right->base.source_position,
8278 "shift count must be less than type width");
8282 type_right = promote_integer(type_right);
8283 expression->right = create_implicit_cast(right, type_right);
8288 static void semantic_shift_op(binary_expression_t *expression)
8290 expression_t *const left = expression->left;
8291 expression_t *const right = expression->right;
8293 if (!semantic_shift(expression))
8296 if (warning.parentheses) {
8297 warn_addsub_in_shift(left);
8298 warn_addsub_in_shift(right);
8301 type_t *const orig_type_left = left->base.type;
8302 type_t * type_left = skip_typeref(orig_type_left);
8304 type_left = promote_integer(type_left);
8305 expression->left = create_implicit_cast(left, type_left);
8306 expression->base.type = type_left;
8309 static void semantic_add(binary_expression_t *expression)
8311 expression_t *const left = expression->left;
8312 expression_t *const right = expression->right;
8313 type_t *const orig_type_left = left->base.type;
8314 type_t *const orig_type_right = right->base.type;
8315 type_t *const type_left = skip_typeref(orig_type_left);
8316 type_t *const type_right = skip_typeref(orig_type_right);
8319 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8320 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8321 expression->left = create_implicit_cast(left, arithmetic_type);
8322 expression->right = create_implicit_cast(right, arithmetic_type);
8323 expression->base.type = arithmetic_type;
8324 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8325 check_pointer_arithmetic(&expression->base.source_position,
8326 type_left, orig_type_left);
8327 expression->base.type = type_left;
8328 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8329 check_pointer_arithmetic(&expression->base.source_position,
8330 type_right, orig_type_right);
8331 expression->base.type = type_right;
8332 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8333 errorf(&expression->base.source_position,
8334 "invalid operands to binary + ('%T', '%T')",
8335 orig_type_left, orig_type_right);
8339 static void semantic_sub(binary_expression_t *expression)
8341 expression_t *const left = expression->left;
8342 expression_t *const right = expression->right;
8343 type_t *const orig_type_left = left->base.type;
8344 type_t *const orig_type_right = right->base.type;
8345 type_t *const type_left = skip_typeref(orig_type_left);
8346 type_t *const type_right = skip_typeref(orig_type_right);
8347 source_position_t const *const pos = &expression->base.source_position;
8350 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8351 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8352 expression->left = create_implicit_cast(left, arithmetic_type);
8353 expression->right = create_implicit_cast(right, arithmetic_type);
8354 expression->base.type = arithmetic_type;
8355 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8356 check_pointer_arithmetic(&expression->base.source_position,
8357 type_left, orig_type_left);
8358 expression->base.type = type_left;
8359 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8360 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8361 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8362 if (!types_compatible(unqual_left, unqual_right)) {
8364 "subtracting pointers to incompatible types '%T' and '%T'",
8365 orig_type_left, orig_type_right);
8366 } else if (!is_type_object(unqual_left)) {
8367 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8368 errorf(pos, "subtracting pointers to non-object types '%T'",
8370 } else if (warning.other) {
8371 warningf(pos, "subtracting pointers to void");
8374 expression->base.type = type_ptrdiff_t;
8375 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8376 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8377 orig_type_left, orig_type_right);
8381 static void warn_string_literal_address(expression_t const* expr)
8383 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8384 expr = expr->unary.value;
8385 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8387 expr = expr->unary.value;
8390 if (expr->kind == EXPR_STRING_LITERAL
8391 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8392 warningf(&expr->base.source_position,
8393 "comparison with string literal results in unspecified behaviour");
8397 static void warn_comparison_in_comparison(const expression_t *const expr)
8399 if (expr->base.parenthesized)
8401 switch (expr->base.kind) {
8402 case EXPR_BINARY_LESS:
8403 case EXPR_BINARY_GREATER:
8404 case EXPR_BINARY_LESSEQUAL:
8405 case EXPR_BINARY_GREATEREQUAL:
8406 case EXPR_BINARY_NOTEQUAL:
8407 case EXPR_BINARY_EQUAL:
8408 warningf(&expr->base.source_position,
8409 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8416 static bool maybe_negative(expression_t const *const expr)
8419 !is_constant_expression(expr) ||
8420 fold_constant_to_int(expr) < 0;
8424 * Check the semantics of comparison expressions.
8426 * @param expression The expression to check.
8428 static void semantic_comparison(binary_expression_t *expression)
8430 expression_t *left = expression->left;
8431 expression_t *right = expression->right;
8433 if (warning.address) {
8434 warn_string_literal_address(left);
8435 warn_string_literal_address(right);
8437 expression_t const* const func_left = get_reference_address(left);
8438 if (func_left != NULL && is_null_pointer_constant(right)) {
8439 warningf(&expression->base.source_position,
8440 "the address of '%Y' will never be NULL",
8441 func_left->reference.entity->base.symbol);
8444 expression_t const* const func_right = get_reference_address(right);
8445 if (func_right != NULL && is_null_pointer_constant(right)) {
8446 warningf(&expression->base.source_position,
8447 "the address of '%Y' will never be NULL",
8448 func_right->reference.entity->base.symbol);
8452 if (warning.parentheses) {
8453 warn_comparison_in_comparison(left);
8454 warn_comparison_in_comparison(right);
8457 type_t *orig_type_left = left->base.type;
8458 type_t *orig_type_right = right->base.type;
8459 type_t *type_left = skip_typeref(orig_type_left);
8460 type_t *type_right = skip_typeref(orig_type_right);
8462 /* TODO non-arithmetic types */
8463 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8464 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8466 /* test for signed vs unsigned compares */
8467 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8468 bool const signed_left = is_type_signed(type_left);
8469 bool const signed_right = is_type_signed(type_right);
8470 if (signed_left != signed_right) {
8471 /* FIXME long long needs better const folding magic */
8472 /* TODO check whether constant value can be represented by other type */
8473 if ((signed_left && maybe_negative(left)) ||
8474 (signed_right && maybe_negative(right))) {
8475 warningf(&expression->base.source_position,
8476 "comparison between signed and unsigned");
8481 expression->left = create_implicit_cast(left, arithmetic_type);
8482 expression->right = create_implicit_cast(right, arithmetic_type);
8483 expression->base.type = arithmetic_type;
8484 if (warning.float_equal &&
8485 (expression->base.kind == EXPR_BINARY_EQUAL ||
8486 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8487 is_type_float(arithmetic_type)) {
8488 warningf(&expression->base.source_position,
8489 "comparing floating point with == or != is unsafe");
8491 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8492 /* TODO check compatibility */
8493 } else if (is_type_pointer(type_left)) {
8494 expression->right = create_implicit_cast(right, type_left);
8495 } else if (is_type_pointer(type_right)) {
8496 expression->left = create_implicit_cast(left, type_right);
8497 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8498 type_error_incompatible("invalid operands in comparison",
8499 &expression->base.source_position,
8500 type_left, type_right);
8502 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8506 * Checks if a compound type has constant fields.
8508 static bool has_const_fields(const compound_type_t *type)
8510 compound_t *compound = type->compound;
8511 entity_t *entry = compound->members.entities;
8513 for (; entry != NULL; entry = entry->base.next) {
8514 if (!is_declaration(entry))
8517 const type_t *decl_type = skip_typeref(entry->declaration.type);
8518 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8525 static bool is_valid_assignment_lhs(expression_t const* const left)
8527 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8528 type_t *const type_left = skip_typeref(orig_type_left);
8530 if (!is_lvalue(left)) {
8531 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8536 if (left->kind == EXPR_REFERENCE
8537 && left->reference.entity->kind == ENTITY_FUNCTION) {
8538 errorf(HERE, "cannot assign to function '%E'", left);
8542 if (is_type_array(type_left)) {
8543 errorf(HERE, "cannot assign to array '%E'", left);
8546 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8547 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8551 if (is_type_incomplete(type_left)) {
8552 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8553 left, orig_type_left);
8556 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8557 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8558 left, orig_type_left);
8565 static void semantic_arithmetic_assign(binary_expression_t *expression)
8567 expression_t *left = expression->left;
8568 expression_t *right = expression->right;
8569 type_t *orig_type_left = left->base.type;
8570 type_t *orig_type_right = right->base.type;
8572 if (!is_valid_assignment_lhs(left))
8575 type_t *type_left = skip_typeref(orig_type_left);
8576 type_t *type_right = skip_typeref(orig_type_right);
8578 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8579 /* TODO: improve error message */
8580 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8581 errorf(&expression->base.source_position,
8582 "operation needs arithmetic types");
8587 /* combined instructions are tricky. We can't create an implicit cast on
8588 * the left side, because we need the uncasted form for the store.
8589 * The ast2firm pass has to know that left_type must be right_type
8590 * for the arithmetic operation and create a cast by itself */
8591 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8592 expression->right = create_implicit_cast(right, arithmetic_type);
8593 expression->base.type = type_left;
8596 static void semantic_divmod_assign(binary_expression_t *expression)
8598 semantic_arithmetic_assign(expression);
8599 warn_div_by_zero(expression);
8602 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8604 expression_t *const left = expression->left;
8605 expression_t *const right = expression->right;
8606 type_t *const orig_type_left = left->base.type;
8607 type_t *const orig_type_right = right->base.type;
8608 type_t *const type_left = skip_typeref(orig_type_left);
8609 type_t *const type_right = skip_typeref(orig_type_right);
8611 if (!is_valid_assignment_lhs(left))
8614 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8615 /* combined instructions are tricky. We can't create an implicit cast on
8616 * the left side, because we need the uncasted form for the store.
8617 * The ast2firm pass has to know that left_type must be right_type
8618 * for the arithmetic operation and create a cast by itself */
8619 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8620 expression->right = create_implicit_cast(right, arithmetic_type);
8621 expression->base.type = type_left;
8622 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8623 check_pointer_arithmetic(&expression->base.source_position,
8624 type_left, orig_type_left);
8625 expression->base.type = type_left;
8626 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8627 errorf(&expression->base.source_position,
8628 "incompatible types '%T' and '%T' in assignment",
8629 orig_type_left, orig_type_right);
8633 static void semantic_integer_assign(binary_expression_t *expression)
8635 expression_t *left = expression->left;
8636 expression_t *right = expression->right;
8637 type_t *orig_type_left = left->base.type;
8638 type_t *orig_type_right = right->base.type;
8640 if (!is_valid_assignment_lhs(left))
8643 type_t *type_left = skip_typeref(orig_type_left);
8644 type_t *type_right = skip_typeref(orig_type_right);
8646 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8647 /* TODO: improve error message */
8648 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8649 errorf(&expression->base.source_position,
8650 "operation needs integer types");
8655 /* combined instructions are tricky. We can't create an implicit cast on
8656 * the left side, because we need the uncasted form for the store.
8657 * The ast2firm pass has to know that left_type must be right_type
8658 * for the arithmetic operation and create a cast by itself */
8659 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8660 expression->right = create_implicit_cast(right, arithmetic_type);
8661 expression->base.type = type_left;
8664 static void semantic_shift_assign(binary_expression_t *expression)
8666 expression_t *left = expression->left;
8668 if (!is_valid_assignment_lhs(left))
8671 if (!semantic_shift(expression))
8674 expression->base.type = skip_typeref(left->base.type);
8677 static void warn_logical_and_within_or(const expression_t *const expr)
8679 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8681 if (expr->base.parenthesized)
8683 warningf(&expr->base.source_position,
8684 "suggest parentheses around && within ||");
8688 * Check the semantic restrictions of a logical expression.
8690 static void semantic_logical_op(binary_expression_t *expression)
8692 /* §6.5.13:2 Each of the operands shall have scalar type.
8693 * §6.5.14:2 Each of the operands shall have scalar type. */
8694 semantic_condition(expression->left, "left operand of logical operator");
8695 semantic_condition(expression->right, "right operand of logical operator");
8696 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8697 warning.parentheses) {
8698 warn_logical_and_within_or(expression->left);
8699 warn_logical_and_within_or(expression->right);
8701 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8705 * Check the semantic restrictions of a binary assign expression.
8707 static void semantic_binexpr_assign(binary_expression_t *expression)
8709 expression_t *left = expression->left;
8710 type_t *orig_type_left = left->base.type;
8712 if (!is_valid_assignment_lhs(left))
8715 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8716 report_assign_error(error, orig_type_left, expression->right,
8717 "assignment", &left->base.source_position);
8718 expression->right = create_implicit_cast(expression->right, orig_type_left);
8719 expression->base.type = orig_type_left;
8723 * Determine if the outermost operation (or parts thereof) of the given
8724 * expression has no effect in order to generate a warning about this fact.
8725 * Therefore in some cases this only examines some of the operands of the
8726 * expression (see comments in the function and examples below).
8728 * f() + 23; // warning, because + has no effect
8729 * x || f(); // no warning, because x controls execution of f()
8730 * x ? y : f(); // warning, because y has no effect
8731 * (void)x; // no warning to be able to suppress the warning
8732 * This function can NOT be used for an "expression has definitely no effect"-
8734 static bool expression_has_effect(const expression_t *const expr)
8736 switch (expr->kind) {
8737 case EXPR_UNKNOWN: break;
8738 case EXPR_INVALID: return true; /* do NOT warn */
8739 case EXPR_REFERENCE: return false;
8740 case EXPR_REFERENCE_ENUM_VALUE: return false;
8741 case EXPR_LABEL_ADDRESS: return false;
8743 /* suppress the warning for microsoft __noop operations */
8744 case EXPR_LITERAL_MS_NOOP: return true;
8745 case EXPR_LITERAL_BOOLEAN:
8746 case EXPR_LITERAL_CHARACTER:
8747 case EXPR_LITERAL_WIDE_CHARACTER:
8748 case EXPR_LITERAL_INTEGER:
8749 case EXPR_LITERAL_INTEGER_OCTAL:
8750 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8751 case EXPR_LITERAL_FLOATINGPOINT:
8752 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8753 case EXPR_STRING_LITERAL: return false;
8754 case EXPR_WIDE_STRING_LITERAL: return false;
8757 const call_expression_t *const call = &expr->call;
8758 if (call->function->kind != EXPR_REFERENCE)
8761 switch (call->function->reference.entity->function.btk) {
8762 /* FIXME: which builtins have no effect? */
8763 default: return true;
8767 /* Generate the warning if either the left or right hand side of a
8768 * conditional expression has no effect */
8769 case EXPR_CONDITIONAL: {
8770 conditional_expression_t const *const cond = &expr->conditional;
8771 expression_t const *const t = cond->true_expression;
8773 (t == NULL || expression_has_effect(t)) &&
8774 expression_has_effect(cond->false_expression);
8777 case EXPR_SELECT: return false;
8778 case EXPR_ARRAY_ACCESS: return false;
8779 case EXPR_SIZEOF: return false;
8780 case EXPR_CLASSIFY_TYPE: return false;
8781 case EXPR_ALIGNOF: return false;
8783 case EXPR_FUNCNAME: return false;
8784 case EXPR_BUILTIN_CONSTANT_P: return false;
8785 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8786 case EXPR_OFFSETOF: return false;
8787 case EXPR_VA_START: return true;
8788 case EXPR_VA_ARG: return true;
8789 case EXPR_VA_COPY: return true;
8790 case EXPR_STATEMENT: return true; // TODO
8791 case EXPR_COMPOUND_LITERAL: return false;
8793 case EXPR_UNARY_NEGATE: return false;
8794 case EXPR_UNARY_PLUS: return false;
8795 case EXPR_UNARY_BITWISE_NEGATE: return false;
8796 case EXPR_UNARY_NOT: return false;
8797 case EXPR_UNARY_DEREFERENCE: return false;
8798 case EXPR_UNARY_TAKE_ADDRESS: return false;
8799 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8800 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8801 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8802 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8804 /* Treat void casts as if they have an effect in order to being able to
8805 * suppress the warning */
8806 case EXPR_UNARY_CAST: {
8807 type_t *const type = skip_typeref(expr->base.type);
8808 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8811 case EXPR_UNARY_CAST_IMPLICIT: return true;
8812 case EXPR_UNARY_ASSUME: return true;
8813 case EXPR_UNARY_DELETE: return true;
8814 case EXPR_UNARY_DELETE_ARRAY: return true;
8815 case EXPR_UNARY_THROW: return true;
8817 case EXPR_BINARY_ADD: return false;
8818 case EXPR_BINARY_SUB: return false;
8819 case EXPR_BINARY_MUL: return false;
8820 case EXPR_BINARY_DIV: return false;
8821 case EXPR_BINARY_MOD: return false;
8822 case EXPR_BINARY_EQUAL: return false;
8823 case EXPR_BINARY_NOTEQUAL: return false;
8824 case EXPR_BINARY_LESS: return false;
8825 case EXPR_BINARY_LESSEQUAL: return false;
8826 case EXPR_BINARY_GREATER: return false;
8827 case EXPR_BINARY_GREATEREQUAL: return false;
8828 case EXPR_BINARY_BITWISE_AND: return false;
8829 case EXPR_BINARY_BITWISE_OR: return false;
8830 case EXPR_BINARY_BITWISE_XOR: return false;
8831 case EXPR_BINARY_SHIFTLEFT: return false;
8832 case EXPR_BINARY_SHIFTRIGHT: return false;
8833 case EXPR_BINARY_ASSIGN: return true;
8834 case EXPR_BINARY_MUL_ASSIGN: return true;
8835 case EXPR_BINARY_DIV_ASSIGN: return true;
8836 case EXPR_BINARY_MOD_ASSIGN: return true;
8837 case EXPR_BINARY_ADD_ASSIGN: return true;
8838 case EXPR_BINARY_SUB_ASSIGN: return true;
8839 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8840 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8841 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8842 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8843 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8845 /* Only examine the right hand side of && and ||, because the left hand
8846 * side already has the effect of controlling the execution of the right
8848 case EXPR_BINARY_LOGICAL_AND:
8849 case EXPR_BINARY_LOGICAL_OR:
8850 /* Only examine the right hand side of a comma expression, because the left
8851 * hand side has a separate warning */
8852 case EXPR_BINARY_COMMA:
8853 return expression_has_effect(expr->binary.right);
8855 case EXPR_BINARY_ISGREATER: return false;
8856 case EXPR_BINARY_ISGREATEREQUAL: return false;
8857 case EXPR_BINARY_ISLESS: return false;
8858 case EXPR_BINARY_ISLESSEQUAL: return false;
8859 case EXPR_BINARY_ISLESSGREATER: return false;
8860 case EXPR_BINARY_ISUNORDERED: return false;
8863 internal_errorf(HERE, "unexpected expression");
8866 static void semantic_comma(binary_expression_t *expression)
8868 if (warning.unused_value) {
8869 const expression_t *const left = expression->left;
8870 if (!expression_has_effect(left)) {
8871 warningf(&left->base.source_position,
8872 "left-hand operand of comma expression has no effect");
8875 expression->base.type = expression->right->base.type;
8879 * @param prec_r precedence of the right operand
8881 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8882 static expression_t *parse_##binexpression_type(expression_t *left) \
8884 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8885 binexpr->binary.left = left; \
8888 expression_t *right = parse_sub_expression(prec_r); \
8890 binexpr->binary.right = right; \
8891 sfunc(&binexpr->binary); \
8896 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8897 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8898 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8899 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8900 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8901 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8902 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8903 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8904 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8905 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8906 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8907 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8908 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8909 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8910 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8911 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8912 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8913 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8914 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8915 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8916 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8917 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8918 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8919 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8920 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8921 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8922 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8923 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8924 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8925 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8928 static expression_t *parse_sub_expression(precedence_t precedence)
8930 if (token.type < 0) {
8931 return expected_expression_error();
8934 expression_parser_function_t *parser
8935 = &expression_parsers[token.type];
8936 source_position_t source_position = token.source_position;
8939 if (parser->parser != NULL) {
8940 left = parser->parser();
8942 left = parse_primary_expression();
8944 assert(left != NULL);
8945 left->base.source_position = source_position;
8948 if (token.type < 0) {
8949 return expected_expression_error();
8952 parser = &expression_parsers[token.type];
8953 if (parser->infix_parser == NULL)
8955 if (parser->infix_precedence < precedence)
8958 left = parser->infix_parser(left);
8960 assert(left != NULL);
8961 assert(left->kind != EXPR_UNKNOWN);
8962 left->base.source_position = source_position;
8969 * Parse an expression.
8971 static expression_t *parse_expression(void)
8973 return parse_sub_expression(PREC_EXPRESSION);
8977 * Register a parser for a prefix-like operator.
8979 * @param parser the parser function
8980 * @param token_type the token type of the prefix token
8982 static void register_expression_parser(parse_expression_function parser,
8985 expression_parser_function_t *entry = &expression_parsers[token_type];
8987 if (entry->parser != NULL) {
8988 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8989 panic("trying to register multiple expression parsers for a token");
8991 entry->parser = parser;
8995 * Register a parser for an infix operator with given precedence.
8997 * @param parser the parser function
8998 * @param token_type the token type of the infix operator
8999 * @param precedence the precedence of the operator
9001 static void register_infix_parser(parse_expression_infix_function parser,
9002 int token_type, precedence_t precedence)
9004 expression_parser_function_t *entry = &expression_parsers[token_type];
9006 if (entry->infix_parser != NULL) {
9007 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9008 panic("trying to register multiple infix expression parsers for a "
9011 entry->infix_parser = parser;
9012 entry->infix_precedence = precedence;
9016 * Initialize the expression parsers.
9018 static void init_expression_parsers(void)
9020 memset(&expression_parsers, 0, sizeof(expression_parsers));
9022 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9023 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9024 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9025 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9026 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9027 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9028 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9029 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9030 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9031 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9032 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9033 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9034 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9035 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9036 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9037 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9038 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9039 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9040 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9041 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9042 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9043 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9044 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9045 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9046 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9047 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9048 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9049 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9050 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9051 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9052 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9053 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9054 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9055 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9056 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9057 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9058 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9060 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9061 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9062 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9063 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9064 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9065 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9066 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9067 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9068 register_expression_parser(parse_sizeof, T_sizeof);
9069 register_expression_parser(parse_alignof, T___alignof__);
9070 register_expression_parser(parse_extension, T___extension__);
9071 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9072 register_expression_parser(parse_delete, T_delete);
9073 register_expression_parser(parse_throw, T_throw);
9077 * Parse a asm statement arguments specification.
9079 static asm_argument_t *parse_asm_arguments(bool is_out)
9081 asm_argument_t *result = NULL;
9082 asm_argument_t **anchor = &result;
9084 while (token.type == T_STRING_LITERAL || token.type == '[') {
9085 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9086 memset(argument, 0, sizeof(argument[0]));
9089 if (token.type != T_IDENTIFIER) {
9090 parse_error_expected("while parsing asm argument",
9091 T_IDENTIFIER, NULL);
9094 argument->symbol = token.symbol;
9096 expect(']', end_error);
9099 argument->constraints = parse_string_literals();
9100 expect('(', end_error);
9101 add_anchor_token(')');
9102 expression_t *expression = parse_expression();
9103 rem_anchor_token(')');
9105 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9106 * change size or type representation (e.g. int -> long is ok, but
9107 * int -> float is not) */
9108 if (expression->kind == EXPR_UNARY_CAST) {
9109 type_t *const type = expression->base.type;
9110 type_kind_t const kind = type->kind;
9111 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9114 if (kind == TYPE_ATOMIC) {
9115 atomic_type_kind_t const akind = type->atomic.akind;
9116 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9117 size = get_atomic_type_size(akind);
9119 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9120 size = get_atomic_type_size(get_intptr_kind());
9124 expression_t *const value = expression->unary.value;
9125 type_t *const value_type = value->base.type;
9126 type_kind_t const value_kind = value_type->kind;
9128 unsigned value_flags;
9129 unsigned value_size;
9130 if (value_kind == TYPE_ATOMIC) {
9131 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9132 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9133 value_size = get_atomic_type_size(value_akind);
9134 } else if (value_kind == TYPE_POINTER) {
9135 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9136 value_size = get_atomic_type_size(get_intptr_kind());
9141 if (value_flags != flags || value_size != size)
9145 } while (expression->kind == EXPR_UNARY_CAST);
9149 if (!is_lvalue(expression)) {
9150 errorf(&expression->base.source_position,
9151 "asm output argument is not an lvalue");
9154 if (argument->constraints.begin[0] == '=')
9155 determine_lhs_ent(expression, NULL);
9157 mark_vars_read(expression, NULL);
9159 mark_vars_read(expression, NULL);
9161 argument->expression = expression;
9162 expect(')', end_error);
9164 set_address_taken(expression, true);
9167 anchor = &argument->next;
9179 * Parse a asm statement clobber specification.
9181 static asm_clobber_t *parse_asm_clobbers(void)
9183 asm_clobber_t *result = NULL;
9184 asm_clobber_t **anchor = &result;
9186 while (token.type == T_STRING_LITERAL) {
9187 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9188 clobber->clobber = parse_string_literals();
9191 anchor = &clobber->next;
9201 * Parse an asm statement.
9203 static statement_t *parse_asm_statement(void)
9205 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9206 asm_statement_t *asm_statement = &statement->asms;
9210 if (next_if(T_volatile))
9211 asm_statement->is_volatile = true;
9213 expect('(', end_error);
9214 add_anchor_token(')');
9215 add_anchor_token(':');
9216 asm_statement->asm_text = parse_string_literals();
9218 if (!next_if(':')) {
9219 rem_anchor_token(':');
9223 asm_statement->outputs = parse_asm_arguments(true);
9224 if (!next_if(':')) {
9225 rem_anchor_token(':');
9229 asm_statement->inputs = parse_asm_arguments(false);
9230 if (!next_if(':')) {
9231 rem_anchor_token(':');
9234 rem_anchor_token(':');
9236 asm_statement->clobbers = parse_asm_clobbers();
9239 rem_anchor_token(')');
9240 expect(')', end_error);
9241 expect(';', end_error);
9243 if (asm_statement->outputs == NULL) {
9244 /* GCC: An 'asm' instruction without any output operands will be treated
9245 * identically to a volatile 'asm' instruction. */
9246 asm_statement->is_volatile = true;
9251 return create_invalid_statement();
9255 * Parse a case statement.
9257 static statement_t *parse_case_statement(void)
9259 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9260 source_position_t *const pos = &statement->base.source_position;
9264 expression_t *const expression = parse_expression();
9265 statement->case_label.expression = expression;
9266 if (!is_constant_expression(expression)) {
9267 /* This check does not prevent the error message in all cases of an
9268 * prior error while parsing the expression. At least it catches the
9269 * common case of a mistyped enum entry. */
9270 if (is_type_valid(skip_typeref(expression->base.type))) {
9271 errorf(pos, "case label does not reduce to an integer constant");
9273 statement->case_label.is_bad = true;
9275 long const val = fold_constant_to_int(expression);
9276 statement->case_label.first_case = val;
9277 statement->case_label.last_case = val;
9281 if (next_if(T_DOTDOTDOT)) {
9282 expression_t *const end_range = parse_expression();
9283 statement->case_label.end_range = end_range;
9284 if (!is_constant_expression(end_range)) {
9285 /* This check does not prevent the error message in all cases of an
9286 * prior error while parsing the expression. At least it catches the
9287 * common case of a mistyped enum entry. */
9288 if (is_type_valid(skip_typeref(end_range->base.type))) {
9289 errorf(pos, "case range does not reduce to an integer constant");
9291 statement->case_label.is_bad = true;
9293 long const val = fold_constant_to_int(end_range);
9294 statement->case_label.last_case = val;
9296 if (warning.other && val < statement->case_label.first_case) {
9297 statement->case_label.is_empty_range = true;
9298 warningf(pos, "empty range specified");
9304 PUSH_PARENT(statement);
9306 expect(':', end_error);
9309 if (current_switch != NULL) {
9310 if (! statement->case_label.is_bad) {
9311 /* Check for duplicate case values */
9312 case_label_statement_t *c = &statement->case_label;
9313 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9314 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9317 if (c->last_case < l->first_case || c->first_case > l->last_case)
9320 errorf(pos, "duplicate case value (previously used %P)",
9321 &l->base.source_position);
9325 /* link all cases into the switch statement */
9326 if (current_switch->last_case == NULL) {
9327 current_switch->first_case = &statement->case_label;
9329 current_switch->last_case->next = &statement->case_label;
9331 current_switch->last_case = &statement->case_label;
9333 errorf(pos, "case label not within a switch statement");
9336 statement_t *const inner_stmt = parse_statement();
9337 statement->case_label.statement = inner_stmt;
9338 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9339 errorf(&inner_stmt->base.source_position, "declaration after case label");
9347 * Parse a default statement.
9349 static statement_t *parse_default_statement(void)
9351 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9355 PUSH_PARENT(statement);
9357 expect(':', end_error);
9358 if (current_switch != NULL) {
9359 const case_label_statement_t *def_label = current_switch->default_label;
9360 if (def_label != NULL) {
9361 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9362 &def_label->base.source_position);
9364 current_switch->default_label = &statement->case_label;
9366 /* link all cases into the switch statement */
9367 if (current_switch->last_case == NULL) {
9368 current_switch->first_case = &statement->case_label;
9370 current_switch->last_case->next = &statement->case_label;
9372 current_switch->last_case = &statement->case_label;
9375 errorf(&statement->base.source_position,
9376 "'default' label not within a switch statement");
9379 statement_t *const inner_stmt = parse_statement();
9380 statement->case_label.statement = inner_stmt;
9381 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9382 errorf(&inner_stmt->base.source_position, "declaration after default label");
9389 return create_invalid_statement();
9393 * Parse a label statement.
9395 static statement_t *parse_label_statement(void)
9397 assert(token.type == T_IDENTIFIER);
9398 symbol_t *symbol = token.symbol;
9399 label_t *label = get_label(symbol);
9401 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9402 statement->label.label = label;
9406 PUSH_PARENT(statement);
9408 /* if statement is already set then the label is defined twice,
9409 * otherwise it was just mentioned in a goto/local label declaration so far
9411 if (label->statement != NULL) {
9412 errorf(HERE, "duplicate label '%Y' (declared %P)",
9413 symbol, &label->base.source_position);
9415 label->base.source_position = token.source_position;
9416 label->statement = statement;
9421 if (token.type == '}') {
9422 errorf(HERE, "label at end of compound statement");
9423 statement->label.statement = create_invalid_statement();
9424 } else if (token.type == ';') {
9425 /* Eat an empty statement here, to avoid the warning about an empty
9426 * statement after a label. label:; is commonly used to have a label
9427 * before a closing brace. */
9428 statement->label.statement = create_empty_statement();
9431 statement_t *const inner_stmt = parse_statement();
9432 statement->label.statement = inner_stmt;
9433 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9434 errorf(&inner_stmt->base.source_position, "declaration after label");
9438 /* remember the labels in a list for later checking */
9439 *label_anchor = &statement->label;
9440 label_anchor = &statement->label.next;
9447 * Parse an if statement.
9449 static statement_t *parse_if(void)
9451 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9455 PUSH_PARENT(statement);
9457 add_anchor_token('{');
9459 expect('(', end_error);
9460 add_anchor_token(')');
9461 expression_t *const expr = parse_expression();
9462 statement->ifs.condition = expr;
9463 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9465 semantic_condition(expr, "condition of 'if'-statment");
9466 mark_vars_read(expr, NULL);
9467 rem_anchor_token(')');
9468 expect(')', end_error);
9471 rem_anchor_token('{');
9473 add_anchor_token(T_else);
9474 statement_t *const true_stmt = parse_statement();
9475 statement->ifs.true_statement = true_stmt;
9476 rem_anchor_token(T_else);
9478 if (next_if(T_else)) {
9479 statement->ifs.false_statement = parse_statement();
9480 } else if (warning.parentheses &&
9481 true_stmt->kind == STATEMENT_IF &&
9482 true_stmt->ifs.false_statement != NULL) {
9483 warningf(&true_stmt->base.source_position,
9484 "suggest explicit braces to avoid ambiguous 'else'");
9492 * Check that all enums are handled in a switch.
9494 * @param statement the switch statement to check
9496 static void check_enum_cases(const switch_statement_t *statement)
9498 const type_t *type = skip_typeref(statement->expression->base.type);
9499 if (! is_type_enum(type))
9501 const enum_type_t *enumt = &type->enumt;
9503 /* if we have a default, no warnings */
9504 if (statement->default_label != NULL)
9507 /* FIXME: calculation of value should be done while parsing */
9508 /* TODO: quadratic algorithm here. Change to an n log n one */
9509 long last_value = -1;
9510 const entity_t *entry = enumt->enume->base.next;
9511 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9512 entry = entry->base.next) {
9513 const expression_t *expression = entry->enum_value.value;
9514 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9516 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9517 if (l->expression == NULL)
9519 if (l->first_case <= value && value <= l->last_case) {
9525 warningf(&statement->base.source_position,
9526 "enumeration value '%Y' not handled in switch",
9527 entry->base.symbol);
9534 * Parse a switch statement.
9536 static statement_t *parse_switch(void)
9538 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9542 PUSH_PARENT(statement);
9544 expect('(', end_error);
9545 add_anchor_token(')');
9546 expression_t *const expr = parse_expression();
9547 mark_vars_read(expr, NULL);
9548 type_t * type = skip_typeref(expr->base.type);
9549 if (is_type_integer(type)) {
9550 type = promote_integer(type);
9551 if (warning.traditional) {
9552 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9553 warningf(&expr->base.source_position,
9554 "'%T' switch expression not converted to '%T' in ISO C",
9558 } else if (is_type_valid(type)) {
9559 errorf(&expr->base.source_position,
9560 "switch quantity is not an integer, but '%T'", type);
9561 type = type_error_type;
9563 statement->switchs.expression = create_implicit_cast(expr, type);
9564 expect(')', end_error);
9565 rem_anchor_token(')');
9567 switch_statement_t *rem = current_switch;
9568 current_switch = &statement->switchs;
9569 statement->switchs.body = parse_statement();
9570 current_switch = rem;
9572 if (warning.switch_default &&
9573 statement->switchs.default_label == NULL) {
9574 warningf(&statement->base.source_position, "switch has no default case");
9576 if (warning.switch_enum)
9577 check_enum_cases(&statement->switchs);
9583 return create_invalid_statement();
9586 static statement_t *parse_loop_body(statement_t *const loop)
9588 statement_t *const rem = current_loop;
9589 current_loop = loop;
9591 statement_t *const body = parse_statement();
9598 * Parse a while statement.
9600 static statement_t *parse_while(void)
9602 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9606 PUSH_PARENT(statement);
9608 expect('(', end_error);
9609 add_anchor_token(')');
9610 expression_t *const cond = parse_expression();
9611 statement->whiles.condition = cond;
9612 /* §6.8.5:2 The controlling expression of an iteration statement shall
9613 * have scalar type. */
9614 semantic_condition(cond, "condition of 'while'-statement");
9615 mark_vars_read(cond, NULL);
9616 rem_anchor_token(')');
9617 expect(')', end_error);
9619 statement->whiles.body = parse_loop_body(statement);
9625 return create_invalid_statement();
9629 * Parse a do statement.
9631 static statement_t *parse_do(void)
9633 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9637 PUSH_PARENT(statement);
9639 add_anchor_token(T_while);
9640 statement->do_while.body = parse_loop_body(statement);
9641 rem_anchor_token(T_while);
9643 expect(T_while, end_error);
9644 expect('(', end_error);
9645 add_anchor_token(')');
9646 expression_t *const cond = parse_expression();
9647 statement->do_while.condition = cond;
9648 /* §6.8.5:2 The controlling expression of an iteration statement shall
9649 * have scalar type. */
9650 semantic_condition(cond, "condition of 'do-while'-statement");
9651 mark_vars_read(cond, NULL);
9652 rem_anchor_token(')');
9653 expect(')', end_error);
9654 expect(';', end_error);
9660 return create_invalid_statement();
9664 * Parse a for statement.
9666 static statement_t *parse_for(void)
9668 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9672 expect('(', end_error1);
9673 add_anchor_token(')');
9675 PUSH_PARENT(statement);
9677 size_t const top = environment_top();
9678 scope_t *old_scope = scope_push(&statement->fors.scope);
9680 bool old_gcc_extension = in_gcc_extension;
9681 while (next_if(T___extension__)) {
9682 in_gcc_extension = true;
9686 } else if (is_declaration_specifier(&token, false)) {
9687 parse_declaration(record_entity, DECL_FLAGS_NONE);
9689 add_anchor_token(';');
9690 expression_t *const init = parse_expression();
9691 statement->fors.initialisation = init;
9692 mark_vars_read(init, ENT_ANY);
9693 if (warning.unused_value && !expression_has_effect(init)) {
9694 warningf(&init->base.source_position,
9695 "initialisation of 'for'-statement has no effect");
9697 rem_anchor_token(';');
9698 expect(';', end_error2);
9700 in_gcc_extension = old_gcc_extension;
9702 if (token.type != ';') {
9703 add_anchor_token(';');
9704 expression_t *const cond = parse_expression();
9705 statement->fors.condition = cond;
9706 /* §6.8.5:2 The controlling expression of an iteration statement
9707 * shall have scalar type. */
9708 semantic_condition(cond, "condition of 'for'-statement");
9709 mark_vars_read(cond, NULL);
9710 rem_anchor_token(';');
9712 expect(';', end_error2);
9713 if (token.type != ')') {
9714 expression_t *const step = parse_expression();
9715 statement->fors.step = step;
9716 mark_vars_read(step, ENT_ANY);
9717 if (warning.unused_value && !expression_has_effect(step)) {
9718 warningf(&step->base.source_position,
9719 "step of 'for'-statement has no effect");
9722 expect(')', end_error2);
9723 rem_anchor_token(')');
9724 statement->fors.body = parse_loop_body(statement);
9726 assert(current_scope == &statement->fors.scope);
9727 scope_pop(old_scope);
9728 environment_pop_to(top);
9735 rem_anchor_token(')');
9736 assert(current_scope == &statement->fors.scope);
9737 scope_pop(old_scope);
9738 environment_pop_to(top);
9742 return create_invalid_statement();
9746 * Parse a goto statement.
9748 static statement_t *parse_goto(void)
9750 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9753 if (GNU_MODE && next_if('*')) {
9754 expression_t *expression = parse_expression();
9755 mark_vars_read(expression, NULL);
9757 /* Argh: although documentation says the expression must be of type void*,
9758 * gcc accepts anything that can be casted into void* without error */
9759 type_t *type = expression->base.type;
9761 if (type != type_error_type) {
9762 if (!is_type_pointer(type) && !is_type_integer(type)) {
9763 errorf(&expression->base.source_position,
9764 "cannot convert to a pointer type");
9765 } else if (warning.other && type != type_void_ptr) {
9766 warningf(&expression->base.source_position,
9767 "type of computed goto expression should be 'void*' not '%T'", type);
9769 expression = create_implicit_cast(expression, type_void_ptr);
9772 statement->gotos.expression = expression;
9773 } else if (token.type == T_IDENTIFIER) {
9774 symbol_t *symbol = token.symbol;
9776 statement->gotos.label = get_label(symbol);
9779 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9781 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9786 /* remember the goto's in a list for later checking */
9787 *goto_anchor = &statement->gotos;
9788 goto_anchor = &statement->gotos.next;
9790 expect(';', end_error);
9794 return create_invalid_statement();
9798 * Parse a continue statement.
9800 static statement_t *parse_continue(void)
9802 if (current_loop == NULL) {
9803 errorf(HERE, "continue statement not within loop");
9806 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9809 expect(';', end_error);
9816 * Parse a break statement.
9818 static statement_t *parse_break(void)
9820 if (current_switch == NULL && current_loop == NULL) {
9821 errorf(HERE, "break statement not within loop or switch");
9824 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9827 expect(';', end_error);
9834 * Parse a __leave statement.
9836 static statement_t *parse_leave_statement(void)
9838 if (current_try == NULL) {
9839 errorf(HERE, "__leave statement not within __try");
9842 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9845 expect(';', end_error);
9852 * Check if a given entity represents a local variable.
9854 static bool is_local_variable(const entity_t *entity)
9856 if (entity->kind != ENTITY_VARIABLE)
9859 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9860 case STORAGE_CLASS_AUTO:
9861 case STORAGE_CLASS_REGISTER: {
9862 const type_t *type = skip_typeref(entity->declaration.type);
9863 if (is_type_function(type)) {
9875 * Check if a given expression represents a local variable.
9877 static bool expression_is_local_variable(const expression_t *expression)
9879 if (expression->base.kind != EXPR_REFERENCE) {
9882 const entity_t *entity = expression->reference.entity;
9883 return is_local_variable(entity);
9887 * Check if a given expression represents a local variable and
9888 * return its declaration then, else return NULL.
9890 entity_t *expression_is_variable(const expression_t *expression)
9892 if (expression->base.kind != EXPR_REFERENCE) {
9895 entity_t *entity = expression->reference.entity;
9896 if (entity->kind != ENTITY_VARIABLE)
9903 * Parse a return statement.
9905 static statement_t *parse_return(void)
9909 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9911 expression_t *return_value = NULL;
9912 if (token.type != ';') {
9913 return_value = parse_expression();
9914 mark_vars_read(return_value, NULL);
9917 const type_t *const func_type = skip_typeref(current_function->base.type);
9918 assert(is_type_function(func_type));
9919 type_t *const return_type = skip_typeref(func_type->function.return_type);
9921 source_position_t const *const pos = &statement->base.source_position;
9922 if (return_value != NULL) {
9923 type_t *return_value_type = skip_typeref(return_value->base.type);
9925 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9926 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9927 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9928 /* Only warn in C mode, because GCC does the same */
9929 if (c_mode & _CXX || strict_mode) {
9931 "'return' with a value, in function returning 'void'");
9932 } else if (warning.other) {
9934 "'return' with a value, in function returning 'void'");
9936 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9937 /* Only warn in C mode, because GCC does the same */
9940 "'return' with expression in function returning 'void'");
9941 } else if (warning.other) {
9943 "'return' with expression in function returning 'void'");
9947 assign_error_t error = semantic_assign(return_type, return_value);
9948 report_assign_error(error, return_type, return_value, "'return'",
9951 return_value = create_implicit_cast(return_value, return_type);
9952 /* check for returning address of a local var */
9953 if (warning.other && return_value != NULL
9954 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9955 const expression_t *expression = return_value->unary.value;
9956 if (expression_is_local_variable(expression)) {
9957 warningf(pos, "function returns address of local variable");
9960 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9961 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9962 if (c_mode & _CXX || strict_mode) {
9964 "'return' without value, in function returning non-void");
9967 "'return' without value, in function returning non-void");
9970 statement->returns.value = return_value;
9972 expect(';', end_error);
9979 * Parse a declaration statement.
9981 static statement_t *parse_declaration_statement(void)
9983 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9985 entity_t *before = current_scope->last_entity;
9987 parse_external_declaration();
9989 parse_declaration(record_entity, DECL_FLAGS_NONE);
9992 declaration_statement_t *const decl = &statement->declaration;
9993 entity_t *const begin =
9994 before != NULL ? before->base.next : current_scope->entities;
9995 decl->declarations_begin = begin;
9996 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10002 * Parse an expression statement, ie. expr ';'.
10004 static statement_t *parse_expression_statement(void)
10006 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10008 expression_t *const expr = parse_expression();
10009 statement->expression.expression = expr;
10010 mark_vars_read(expr, ENT_ANY);
10012 expect(';', end_error);
10019 * Parse a microsoft __try { } __finally { } or
10020 * __try{ } __except() { }
10022 static statement_t *parse_ms_try_statment(void)
10024 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10027 PUSH_PARENT(statement);
10029 ms_try_statement_t *rem = current_try;
10030 current_try = &statement->ms_try;
10031 statement->ms_try.try_statement = parse_compound_statement(false);
10036 if (next_if(T___except)) {
10037 expect('(', end_error);
10038 add_anchor_token(')');
10039 expression_t *const expr = parse_expression();
10040 mark_vars_read(expr, NULL);
10041 type_t * type = skip_typeref(expr->base.type);
10042 if (is_type_integer(type)) {
10043 type = promote_integer(type);
10044 } else if (is_type_valid(type)) {
10045 errorf(&expr->base.source_position,
10046 "__expect expression is not an integer, but '%T'", type);
10047 type = type_error_type;
10049 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10050 rem_anchor_token(')');
10051 expect(')', end_error);
10052 statement->ms_try.final_statement = parse_compound_statement(false);
10053 } else if (next_if(T__finally)) {
10054 statement->ms_try.final_statement = parse_compound_statement(false);
10056 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10057 return create_invalid_statement();
10061 return create_invalid_statement();
10064 static statement_t *parse_empty_statement(void)
10066 if (warning.empty_statement) {
10067 warningf(HERE, "statement is empty");
10069 statement_t *const statement = create_empty_statement();
10074 static statement_t *parse_local_label_declaration(void)
10076 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10080 entity_t *begin = NULL, *end = NULL;
10083 if (token.type != T_IDENTIFIER) {
10084 parse_error_expected("while parsing local label declaration",
10085 T_IDENTIFIER, NULL);
10088 symbol_t *symbol = token.symbol;
10089 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10090 if (entity != NULL && entity->base.parent_scope == current_scope) {
10091 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10092 symbol, &entity->base.source_position);
10094 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10096 entity->base.parent_scope = current_scope;
10097 entity->base.namespc = NAMESPACE_LABEL;
10098 entity->base.source_position = token.source_position;
10099 entity->base.symbol = symbol;
10102 end->base.next = entity;
10107 environment_push(entity);
10110 } while (next_if(','));
10113 statement->declaration.declarations_begin = begin;
10114 statement->declaration.declarations_end = end;
10118 static void parse_namespace_definition(void)
10122 entity_t *entity = NULL;
10123 symbol_t *symbol = NULL;
10125 if (token.type == T_IDENTIFIER) {
10126 symbol = token.symbol;
10129 entity = get_entity(symbol, NAMESPACE_NORMAL);
10131 && entity->kind != ENTITY_NAMESPACE
10132 && entity->base.parent_scope == current_scope) {
10133 if (!is_error_entity(entity)) {
10134 error_redefined_as_different_kind(&token.source_position,
10135 entity, ENTITY_NAMESPACE);
10141 if (entity == NULL) {
10142 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10143 entity->base.symbol = symbol;
10144 entity->base.source_position = token.source_position;
10145 entity->base.namespc = NAMESPACE_NORMAL;
10146 entity->base.parent_scope = current_scope;
10149 if (token.type == '=') {
10150 /* TODO: parse namespace alias */
10151 panic("namespace alias definition not supported yet");
10154 environment_push(entity);
10155 append_entity(current_scope, entity);
10157 size_t const top = environment_top();
10158 scope_t *old_scope = scope_push(&entity->namespacee.members);
10160 entity_t *old_current_entity = current_entity;
10161 current_entity = entity;
10163 expect('{', end_error);
10165 expect('}', end_error);
10168 assert(current_scope == &entity->namespacee.members);
10169 assert(current_entity == entity);
10170 current_entity = old_current_entity;
10171 scope_pop(old_scope);
10172 environment_pop_to(top);
10176 * Parse a statement.
10177 * There's also parse_statement() which additionally checks for
10178 * "statement has no effect" warnings
10180 static statement_t *intern_parse_statement(void)
10182 statement_t *statement = NULL;
10184 /* declaration or statement */
10185 add_anchor_token(';');
10186 switch (token.type) {
10187 case T_IDENTIFIER: {
10188 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10189 if (la1_type == ':') {
10190 statement = parse_label_statement();
10191 } else if (is_typedef_symbol(token.symbol)) {
10192 statement = parse_declaration_statement();
10194 /* it's an identifier, the grammar says this must be an
10195 * expression statement. However it is common that users mistype
10196 * declaration types, so we guess a bit here to improve robustness
10197 * for incorrect programs */
10198 switch (la1_type) {
10201 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL)
10202 goto expression_statment;
10207 statement = parse_declaration_statement();
10211 expression_statment:
10212 statement = parse_expression_statement();
10219 case T___extension__:
10220 /* This can be a prefix to a declaration or an expression statement.
10221 * We simply eat it now and parse the rest with tail recursion. */
10222 while (next_if(T___extension__)) {}
10223 bool old_gcc_extension = in_gcc_extension;
10224 in_gcc_extension = true;
10225 statement = intern_parse_statement();
10226 in_gcc_extension = old_gcc_extension;
10230 statement = parse_declaration_statement();
10234 statement = parse_local_label_declaration();
10237 case ';': statement = parse_empty_statement(); break;
10238 case '{': statement = parse_compound_statement(false); break;
10239 case T___leave: statement = parse_leave_statement(); break;
10240 case T___try: statement = parse_ms_try_statment(); break;
10241 case T_asm: statement = parse_asm_statement(); break;
10242 case T_break: statement = parse_break(); break;
10243 case T_case: statement = parse_case_statement(); break;
10244 case T_continue: statement = parse_continue(); break;
10245 case T_default: statement = parse_default_statement(); break;
10246 case T_do: statement = parse_do(); break;
10247 case T_for: statement = parse_for(); break;
10248 case T_goto: statement = parse_goto(); break;
10249 case T_if: statement = parse_if(); break;
10250 case T_return: statement = parse_return(); break;
10251 case T_switch: statement = parse_switch(); break;
10252 case T_while: statement = parse_while(); break;
10255 statement = parse_expression_statement();
10259 errorf(HERE, "unexpected token %K while parsing statement", &token);
10260 statement = create_invalid_statement();
10265 rem_anchor_token(';');
10267 assert(statement != NULL
10268 && statement->base.source_position.input_name != NULL);
10274 * parse a statement and emits "statement has no effect" warning if needed
10275 * (This is really a wrapper around intern_parse_statement with check for 1
10276 * single warning. It is needed, because for statement expressions we have
10277 * to avoid the warning on the last statement)
10279 static statement_t *parse_statement(void)
10281 statement_t *statement = intern_parse_statement();
10283 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10284 expression_t *expression = statement->expression.expression;
10285 if (!expression_has_effect(expression)) {
10286 warningf(&expression->base.source_position,
10287 "statement has no effect");
10295 * Parse a compound statement.
10297 static statement_t *parse_compound_statement(bool inside_expression_statement)
10299 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10301 PUSH_PARENT(statement);
10304 add_anchor_token('}');
10305 /* tokens, which can start a statement */
10306 /* TODO MS, __builtin_FOO */
10307 add_anchor_token('!');
10308 add_anchor_token('&');
10309 add_anchor_token('(');
10310 add_anchor_token('*');
10311 add_anchor_token('+');
10312 add_anchor_token('-');
10313 add_anchor_token('{');
10314 add_anchor_token('~');
10315 add_anchor_token(T_CHARACTER_CONSTANT);
10316 add_anchor_token(T_COLONCOLON);
10317 add_anchor_token(T_FLOATINGPOINT);
10318 add_anchor_token(T_IDENTIFIER);
10319 add_anchor_token(T_INTEGER);
10320 add_anchor_token(T_MINUSMINUS);
10321 add_anchor_token(T_PLUSPLUS);
10322 add_anchor_token(T_STRING_LITERAL);
10323 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10324 add_anchor_token(T_WIDE_STRING_LITERAL);
10325 add_anchor_token(T__Bool);
10326 add_anchor_token(T__Complex);
10327 add_anchor_token(T__Imaginary);
10328 add_anchor_token(T___FUNCTION__);
10329 add_anchor_token(T___PRETTY_FUNCTION__);
10330 add_anchor_token(T___alignof__);
10331 add_anchor_token(T___attribute__);
10332 add_anchor_token(T___builtin_va_start);
10333 add_anchor_token(T___extension__);
10334 add_anchor_token(T___func__);
10335 add_anchor_token(T___imag__);
10336 add_anchor_token(T___label__);
10337 add_anchor_token(T___real__);
10338 add_anchor_token(T___thread);
10339 add_anchor_token(T_asm);
10340 add_anchor_token(T_auto);
10341 add_anchor_token(T_bool);
10342 add_anchor_token(T_break);
10343 add_anchor_token(T_case);
10344 add_anchor_token(T_char);
10345 add_anchor_token(T_class);
10346 add_anchor_token(T_const);
10347 add_anchor_token(T_const_cast);
10348 add_anchor_token(T_continue);
10349 add_anchor_token(T_default);
10350 add_anchor_token(T_delete);
10351 add_anchor_token(T_double);
10352 add_anchor_token(T_do);
10353 add_anchor_token(T_dynamic_cast);
10354 add_anchor_token(T_enum);
10355 add_anchor_token(T_extern);
10356 add_anchor_token(T_false);
10357 add_anchor_token(T_float);
10358 add_anchor_token(T_for);
10359 add_anchor_token(T_goto);
10360 add_anchor_token(T_if);
10361 add_anchor_token(T_inline);
10362 add_anchor_token(T_int);
10363 add_anchor_token(T_long);
10364 add_anchor_token(T_new);
10365 add_anchor_token(T_operator);
10366 add_anchor_token(T_register);
10367 add_anchor_token(T_reinterpret_cast);
10368 add_anchor_token(T_restrict);
10369 add_anchor_token(T_return);
10370 add_anchor_token(T_short);
10371 add_anchor_token(T_signed);
10372 add_anchor_token(T_sizeof);
10373 add_anchor_token(T_static);
10374 add_anchor_token(T_static_cast);
10375 add_anchor_token(T_struct);
10376 add_anchor_token(T_switch);
10377 add_anchor_token(T_template);
10378 add_anchor_token(T_this);
10379 add_anchor_token(T_throw);
10380 add_anchor_token(T_true);
10381 add_anchor_token(T_try);
10382 add_anchor_token(T_typedef);
10383 add_anchor_token(T_typeid);
10384 add_anchor_token(T_typename);
10385 add_anchor_token(T_typeof);
10386 add_anchor_token(T_union);
10387 add_anchor_token(T_unsigned);
10388 add_anchor_token(T_using);
10389 add_anchor_token(T_void);
10390 add_anchor_token(T_volatile);
10391 add_anchor_token(T_wchar_t);
10392 add_anchor_token(T_while);
10394 size_t const top = environment_top();
10395 scope_t *old_scope = scope_push(&statement->compound.scope);
10397 statement_t **anchor = &statement->compound.statements;
10398 bool only_decls_so_far = true;
10399 while (token.type != '}') {
10400 if (token.type == T_EOF) {
10401 errorf(&statement->base.source_position,
10402 "EOF while parsing compound statement");
10405 statement_t *sub_statement = intern_parse_statement();
10406 if (is_invalid_statement(sub_statement)) {
10407 /* an error occurred. if we are at an anchor, return */
10413 if (warning.declaration_after_statement) {
10414 if (sub_statement->kind != STATEMENT_DECLARATION) {
10415 only_decls_so_far = false;
10416 } else if (!only_decls_so_far) {
10417 warningf(&sub_statement->base.source_position,
10418 "ISO C90 forbids mixed declarations and code");
10422 *anchor = sub_statement;
10424 while (sub_statement->base.next != NULL)
10425 sub_statement = sub_statement->base.next;
10427 anchor = &sub_statement->base.next;
10431 /* look over all statements again to produce no effect warnings */
10432 if (warning.unused_value) {
10433 statement_t *sub_statement = statement->compound.statements;
10434 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10435 if (sub_statement->kind != STATEMENT_EXPRESSION)
10437 /* don't emit a warning for the last expression in an expression
10438 * statement as it has always an effect */
10439 if (inside_expression_statement && sub_statement->base.next == NULL)
10442 expression_t *expression = sub_statement->expression.expression;
10443 if (!expression_has_effect(expression)) {
10444 warningf(&expression->base.source_position,
10445 "statement has no effect");
10451 rem_anchor_token(T_while);
10452 rem_anchor_token(T_wchar_t);
10453 rem_anchor_token(T_volatile);
10454 rem_anchor_token(T_void);
10455 rem_anchor_token(T_using);
10456 rem_anchor_token(T_unsigned);
10457 rem_anchor_token(T_union);
10458 rem_anchor_token(T_typeof);
10459 rem_anchor_token(T_typename);
10460 rem_anchor_token(T_typeid);
10461 rem_anchor_token(T_typedef);
10462 rem_anchor_token(T_try);
10463 rem_anchor_token(T_true);
10464 rem_anchor_token(T_throw);
10465 rem_anchor_token(T_this);
10466 rem_anchor_token(T_template);
10467 rem_anchor_token(T_switch);
10468 rem_anchor_token(T_struct);
10469 rem_anchor_token(T_static_cast);
10470 rem_anchor_token(T_static);
10471 rem_anchor_token(T_sizeof);
10472 rem_anchor_token(T_signed);
10473 rem_anchor_token(T_short);
10474 rem_anchor_token(T_return);
10475 rem_anchor_token(T_restrict);
10476 rem_anchor_token(T_reinterpret_cast);
10477 rem_anchor_token(T_register);
10478 rem_anchor_token(T_operator);
10479 rem_anchor_token(T_new);
10480 rem_anchor_token(T_long);
10481 rem_anchor_token(T_int);
10482 rem_anchor_token(T_inline);
10483 rem_anchor_token(T_if);
10484 rem_anchor_token(T_goto);
10485 rem_anchor_token(T_for);
10486 rem_anchor_token(T_float);
10487 rem_anchor_token(T_false);
10488 rem_anchor_token(T_extern);
10489 rem_anchor_token(T_enum);
10490 rem_anchor_token(T_dynamic_cast);
10491 rem_anchor_token(T_do);
10492 rem_anchor_token(T_double);
10493 rem_anchor_token(T_delete);
10494 rem_anchor_token(T_default);
10495 rem_anchor_token(T_continue);
10496 rem_anchor_token(T_const_cast);
10497 rem_anchor_token(T_const);
10498 rem_anchor_token(T_class);
10499 rem_anchor_token(T_char);
10500 rem_anchor_token(T_case);
10501 rem_anchor_token(T_break);
10502 rem_anchor_token(T_bool);
10503 rem_anchor_token(T_auto);
10504 rem_anchor_token(T_asm);
10505 rem_anchor_token(T___thread);
10506 rem_anchor_token(T___real__);
10507 rem_anchor_token(T___label__);
10508 rem_anchor_token(T___imag__);
10509 rem_anchor_token(T___func__);
10510 rem_anchor_token(T___extension__);
10511 rem_anchor_token(T___builtin_va_start);
10512 rem_anchor_token(T___attribute__);
10513 rem_anchor_token(T___alignof__);
10514 rem_anchor_token(T___PRETTY_FUNCTION__);
10515 rem_anchor_token(T___FUNCTION__);
10516 rem_anchor_token(T__Imaginary);
10517 rem_anchor_token(T__Complex);
10518 rem_anchor_token(T__Bool);
10519 rem_anchor_token(T_WIDE_STRING_LITERAL);
10520 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10521 rem_anchor_token(T_STRING_LITERAL);
10522 rem_anchor_token(T_PLUSPLUS);
10523 rem_anchor_token(T_MINUSMINUS);
10524 rem_anchor_token(T_INTEGER);
10525 rem_anchor_token(T_IDENTIFIER);
10526 rem_anchor_token(T_FLOATINGPOINT);
10527 rem_anchor_token(T_COLONCOLON);
10528 rem_anchor_token(T_CHARACTER_CONSTANT);
10529 rem_anchor_token('~');
10530 rem_anchor_token('{');
10531 rem_anchor_token('-');
10532 rem_anchor_token('+');
10533 rem_anchor_token('*');
10534 rem_anchor_token('(');
10535 rem_anchor_token('&');
10536 rem_anchor_token('!');
10537 rem_anchor_token('}');
10538 assert(current_scope == &statement->compound.scope);
10539 scope_pop(old_scope);
10540 environment_pop_to(top);
10547 * Check for unused global static functions and variables
10549 static void check_unused_globals(void)
10551 if (!warning.unused_function && !warning.unused_variable)
10554 for (const entity_t *entity = file_scope->entities; entity != NULL;
10555 entity = entity->base.next) {
10556 if (!is_declaration(entity))
10559 const declaration_t *declaration = &entity->declaration;
10560 if (declaration->used ||
10561 declaration->modifiers & DM_UNUSED ||
10562 declaration->modifiers & DM_USED ||
10563 declaration->storage_class != STORAGE_CLASS_STATIC)
10566 type_t *const type = declaration->type;
10568 if (entity->kind == ENTITY_FUNCTION) {
10569 /* inhibit warning for static inline functions */
10570 if (entity->function.is_inline)
10573 s = entity->function.statement != NULL ? "defined" : "declared";
10578 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10579 type, declaration->base.symbol, s);
10583 static void parse_global_asm(void)
10585 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10588 expect('(', end_error);
10590 statement->asms.asm_text = parse_string_literals();
10591 statement->base.next = unit->global_asm;
10592 unit->global_asm = statement;
10594 expect(')', end_error);
10595 expect(';', end_error);
10600 static void parse_linkage_specification(void)
10603 assert(token.type == T_STRING_LITERAL);
10605 const char *linkage = parse_string_literals().begin;
10607 linkage_kind_t old_linkage = current_linkage;
10608 linkage_kind_t new_linkage;
10609 if (strcmp(linkage, "C") == 0) {
10610 new_linkage = LINKAGE_C;
10611 } else if (strcmp(linkage, "C++") == 0) {
10612 new_linkage = LINKAGE_CXX;
10614 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10615 new_linkage = LINKAGE_INVALID;
10617 current_linkage = new_linkage;
10619 if (next_if('{')) {
10621 expect('}', end_error);
10627 assert(current_linkage == new_linkage);
10628 current_linkage = old_linkage;
10631 static void parse_external(void)
10633 switch (token.type) {
10634 DECLARATION_START_NO_EXTERN
10636 case T___extension__:
10637 /* tokens below are for implicit int */
10638 case '&': /* & x; -> int& x; (and error later, because C++ has no
10640 case '*': /* * x; -> int* x; */
10641 case '(': /* (x); -> int (x); */
10642 parse_external_declaration();
10646 if (look_ahead(1)->type == T_STRING_LITERAL) {
10647 parse_linkage_specification();
10649 parse_external_declaration();
10654 parse_global_asm();
10658 parse_namespace_definition();
10662 if (!strict_mode) {
10664 warningf(HERE, "stray ';' outside of function");
10671 errorf(HERE, "stray %K outside of function", &token);
10672 if (token.type == '(' || token.type == '{' || token.type == '[')
10673 eat_until_matching_token(token.type);
10679 static void parse_externals(void)
10681 add_anchor_token('}');
10682 add_anchor_token(T_EOF);
10685 unsigned char token_anchor_copy[T_LAST_TOKEN];
10686 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10689 while (token.type != T_EOF && token.type != '}') {
10691 bool anchor_leak = false;
10692 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10693 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10695 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10696 anchor_leak = true;
10699 if (in_gcc_extension) {
10700 errorf(HERE, "Leaked __extension__");
10701 anchor_leak = true;
10711 rem_anchor_token(T_EOF);
10712 rem_anchor_token('}');
10716 * Parse a translation unit.
10718 static void parse_translation_unit(void)
10720 add_anchor_token(T_EOF);
10725 if (token.type == T_EOF)
10728 errorf(HERE, "stray %K outside of function", &token);
10729 if (token.type == '(' || token.type == '{' || token.type == '[')
10730 eat_until_matching_token(token.type);
10738 * @return the translation unit or NULL if errors occurred.
10740 void start_parsing(void)
10742 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10743 label_stack = NEW_ARR_F(stack_entry_t, 0);
10744 diagnostic_count = 0;
10748 print_to_file(stderr);
10750 assert(unit == NULL);
10751 unit = allocate_ast_zero(sizeof(unit[0]));
10753 assert(file_scope == NULL);
10754 file_scope = &unit->scope;
10756 assert(current_scope == NULL);
10757 scope_push(&unit->scope);
10759 create_gnu_builtins();
10761 create_microsoft_intrinsics();
10764 translation_unit_t *finish_parsing(void)
10766 assert(current_scope == &unit->scope);
10769 assert(file_scope == &unit->scope);
10770 check_unused_globals();
10773 DEL_ARR_F(environment_stack);
10774 DEL_ARR_F(label_stack);
10776 translation_unit_t *result = unit;
10781 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10782 * are given length one. */
10783 static void complete_incomplete_arrays(void)
10785 size_t n = ARR_LEN(incomplete_arrays);
10786 for (size_t i = 0; i != n; ++i) {
10787 declaration_t *const decl = incomplete_arrays[i];
10788 type_t *const orig_type = decl->type;
10789 type_t *const type = skip_typeref(orig_type);
10791 if (!is_type_incomplete(type))
10794 if (warning.other) {
10795 warningf(&decl->base.source_position,
10796 "array '%#T' assumed to have one element",
10797 orig_type, decl->base.symbol);
10800 type_t *const new_type = duplicate_type(type);
10801 new_type->array.size_constant = true;
10802 new_type->array.has_implicit_size = true;
10803 new_type->array.size = 1;
10805 type_t *const result = identify_new_type(new_type);
10807 decl->type = result;
10811 void prepare_main_collect2(entity_t *entity)
10813 // create call to __main
10814 symbol_t *symbol = symbol_table_insert("__main");
10815 entity_t *subsubmain_ent
10816 = create_implicit_function(symbol, &builtin_source_position);
10818 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10819 type_t *ftype = subsubmain_ent->declaration.type;
10820 ref->base.source_position = builtin_source_position;
10821 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10822 ref->reference.entity = subsubmain_ent;
10824 expression_t *call = allocate_expression_zero(EXPR_CALL);
10825 call->base.source_position = builtin_source_position;
10826 call->base.type = type_void;
10827 call->call.function = ref;
10829 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10830 expr_statement->base.source_position = builtin_source_position;
10831 expr_statement->expression.expression = call;
10833 statement_t *statement = entity->function.statement;
10834 assert(statement->kind == STATEMENT_COMPOUND);
10835 compound_statement_t *compounds = &statement->compound;
10837 expr_statement->base.next = compounds->statements;
10838 compounds->statements = expr_statement;
10843 lookahead_bufpos = 0;
10844 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10847 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10848 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10849 parse_translation_unit();
10850 complete_incomplete_arrays();
10851 DEL_ARR_F(incomplete_arrays);
10852 incomplete_arrays = NULL;
10856 * Initialize the parser.
10858 void init_parser(void)
10860 sym_anonymous = symbol_table_insert("<anonymous>");
10862 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10864 init_expression_parsers();
10865 obstack_init(&temp_obst);
10867 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10868 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10872 * Terminate the parser.
10874 void exit_parser(void)
10876 obstack_free(&temp_obst, NULL);