2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "attribute_t.h"
38 #include "lang_features.h"
39 #include "walk_statements.h"
42 #include "adt/bitfiddle.h"
43 #include "adt/error.h"
44 #include "adt/array.h"
46 //#define PRINT_TOKENS
47 #define MAX_LOOKAHEAD 1
52 entity_namespace_t namespc;
55 typedef struct declaration_specifiers_t declaration_specifiers_t;
56 struct declaration_specifiers_t {
57 source_position_t source_position;
58 storage_class_t storage_class;
59 unsigned char alignment; /**< Alignment, 0 if not set. */
61 bool thread_local : 1; /**< GCC __thread */
62 attribute_t *attributes; /**< list of attributes */
67 * An environment for parsing initializers (and compound literals).
69 typedef struct parse_initializer_env_t {
70 type_t *type; /**< the type of the initializer. In case of an
71 array type with unspecified size this gets
72 adjusted to the actual size. */
73 entity_t *entity; /**< the variable that is initialized if any */
74 bool must_be_constant;
75 } parse_initializer_env_t;
77 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
79 /** The current token. */
81 /** The lookahead ring-buffer. */
82 static token_t lookahead_buffer[MAX_LOOKAHEAD];
83 /** Position of the next token in the lookahead buffer. */
84 static size_t lookahead_bufpos;
85 static stack_entry_t *environment_stack = NULL;
86 static stack_entry_t *label_stack = NULL;
87 static scope_t *file_scope = NULL;
88 static scope_t *current_scope = NULL;
89 /** Point to the current function declaration if inside a function. */
90 static function_t *current_function = NULL;
91 static entity_t *current_entity = NULL;
92 static entity_t *current_init_decl = NULL;
93 static switch_statement_t *current_switch = NULL;
94 static statement_t *current_loop = NULL;
95 static statement_t *current_parent = NULL;
96 static ms_try_statement_t *current_try = NULL;
97 static linkage_kind_t current_linkage = LINKAGE_INVALID;
98 static goto_statement_t *goto_first = NULL;
99 static goto_statement_t **goto_anchor = NULL;
100 static label_statement_t *label_first = NULL;
101 static label_statement_t **label_anchor = NULL;
102 /** current translation unit. */
103 static translation_unit_t *unit = NULL;
104 /** true if we are in a type property context (evaluation only for type) */
105 static bool in_type_prop = false;
106 /** true if we are in an __extension__ context. */
107 static bool in_gcc_extension = false;
108 static struct obstack temp_obst;
109 static entity_t *anonymous_entity;
110 static declaration_t **incomplete_arrays;
113 #define PUSH_PARENT(stmt) \
114 statement_t *const prev_parent = current_parent; \
115 ((void)(current_parent = (stmt)))
116 #define POP_PARENT ((void)(current_parent = prev_parent))
118 /** special symbol used for anonymous entities. */
119 static symbol_t *sym_anonymous = NULL;
121 /** The token anchor set */
122 static unsigned char token_anchor_set[T_LAST_TOKEN];
124 /** The current source position. */
125 #define HERE (&token.source_position)
127 /** true if we are in GCC mode. */
128 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
130 static statement_t *parse_compound_statement(bool inside_expression_statement);
131 static statement_t *parse_statement(void);
133 static expression_t *parse_subexpression(precedence_t);
134 static expression_t *parse_expression(void);
135 static type_t *parse_typename(void);
136 static void parse_externals(void);
137 static void parse_external(void);
139 static void parse_compound_type_entries(compound_t *compound_declaration);
141 static void check_call_argument(type_t *expected_type,
142 call_argument_t *argument, unsigned pos);
144 typedef enum declarator_flags_t {
146 DECL_MAY_BE_ABSTRACT = 1U << 0,
147 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
148 DECL_IS_PARAMETER = 1U << 2
149 } declarator_flags_t;
151 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
152 declarator_flags_t flags);
154 static void semantic_comparison(binary_expression_t *expression);
156 #define STORAGE_CLASSES \
157 STORAGE_CLASSES_NO_EXTERN \
160 #define STORAGE_CLASSES_NO_EXTERN \
167 #define TYPE_QUALIFIERS \
172 case T__forceinline: \
173 case T___attribute__:
175 #define COMPLEX_SPECIFIERS \
177 #define IMAGINARY_SPECIFIERS \
180 #define TYPE_SPECIFIERS \
182 case T___builtin_va_list: \
207 #define DECLARATION_START \
212 #define DECLARATION_START_NO_EXTERN \
213 STORAGE_CLASSES_NO_EXTERN \
217 #define TYPENAME_START \
221 #define EXPRESSION_START \
230 case T_CHARACTER_CONSTANT: \
231 case T_FLOATINGPOINT: \
232 case T_FLOATINGPOINT_HEXADECIMAL: \
234 case T_INTEGER_HEXADECIMAL: \
235 case T_INTEGER_OCTAL: \
238 case T_STRING_LITERAL: \
239 case T_WIDE_CHARACTER_CONSTANT: \
240 case T_WIDE_STRING_LITERAL: \
241 case T___FUNCDNAME__: \
242 case T___FUNCSIG__: \
243 case T___FUNCTION__: \
244 case T___PRETTY_FUNCTION__: \
245 case T___alignof__: \
246 case T___builtin_classify_type: \
247 case T___builtin_constant_p: \
248 case T___builtin_isgreater: \
249 case T___builtin_isgreaterequal: \
250 case T___builtin_isless: \
251 case T___builtin_islessequal: \
252 case T___builtin_islessgreater: \
253 case T___builtin_isunordered: \
254 case T___builtin_offsetof: \
255 case T___builtin_va_arg: \
256 case T___builtin_va_copy: \
257 case T___builtin_va_start: \
268 * Returns the size of a statement node.
270 * @param kind the statement kind
272 static size_t get_statement_struct_size(statement_kind_t kind)
274 static const size_t sizes[] = {
275 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
276 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
277 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
278 [STATEMENT_RETURN] = sizeof(return_statement_t),
279 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
280 [STATEMENT_IF] = sizeof(if_statement_t),
281 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
282 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
283 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
284 [STATEMENT_BREAK] = sizeof(statement_base_t),
285 [STATEMENT_GOTO] = sizeof(goto_statement_t),
286 [STATEMENT_LABEL] = sizeof(label_statement_t),
287 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
288 [STATEMENT_WHILE] = sizeof(while_statement_t),
289 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
290 [STATEMENT_FOR] = sizeof(for_statement_t),
291 [STATEMENT_ASM] = sizeof(asm_statement_t),
292 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
293 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
295 assert(kind < lengthof(sizes));
296 assert(sizes[kind] != 0);
301 * Returns the size of an expression node.
303 * @param kind the expression kind
305 static size_t get_expression_struct_size(expression_kind_t kind)
307 static const size_t sizes[] = {
308 [EXPR_INVALID] = sizeof(expression_base_t),
309 [EXPR_REFERENCE] = sizeof(reference_expression_t),
310 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
311 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
312 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
313 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
314 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
315 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
316 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
317 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
318 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
319 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
320 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
321 [EXPR_CALL] = sizeof(call_expression_t),
322 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
323 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
324 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
325 [EXPR_SELECT] = sizeof(select_expression_t),
326 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
327 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
328 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
329 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
330 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
331 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
332 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
333 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
334 [EXPR_VA_START] = sizeof(va_start_expression_t),
335 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
336 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
337 [EXPR_STATEMENT] = sizeof(statement_expression_t),
338 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
340 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
341 return sizes[EXPR_UNARY_FIRST];
343 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
344 return sizes[EXPR_BINARY_FIRST];
346 assert(kind < lengthof(sizes));
347 assert(sizes[kind] != 0);
352 * Allocate a statement node of given kind and initialize all
353 * fields with zero. Sets its source position to the position
354 * of the current token.
356 static statement_t *allocate_statement_zero(statement_kind_t kind)
358 size_t size = get_statement_struct_size(kind);
359 statement_t *res = allocate_ast_zero(size);
361 res->base.kind = kind;
362 res->base.parent = current_parent;
363 res->base.source_position = token.source_position;
368 * Allocate an expression node of given kind and initialize all
371 * @param kind the kind of the expression to allocate
373 static expression_t *allocate_expression_zero(expression_kind_t kind)
375 size_t size = get_expression_struct_size(kind);
376 expression_t *res = allocate_ast_zero(size);
378 res->base.kind = kind;
379 res->base.type = type_error_type;
380 res->base.source_position = token.source_position;
385 * Creates a new invalid expression at the source position
386 * of the current token.
388 static expression_t *create_invalid_expression(void)
390 return allocate_expression_zero(EXPR_INVALID);
394 * Creates a new invalid statement.
396 static statement_t *create_invalid_statement(void)
398 return allocate_statement_zero(STATEMENT_INVALID);
402 * Allocate a new empty statement.
404 static statement_t *create_empty_statement(void)
406 return allocate_statement_zero(STATEMENT_EMPTY);
409 static function_parameter_t *allocate_parameter(type_t *const type)
411 function_parameter_t *const param
412 = obstack_alloc(type_obst, sizeof(*param));
413 memset(param, 0, sizeof(*param));
419 * Returns the size of an initializer node.
421 * @param kind the initializer kind
423 static size_t get_initializer_size(initializer_kind_t kind)
425 static const size_t sizes[] = {
426 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
427 [INITIALIZER_STRING] = sizeof(initializer_string_t),
428 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
429 [INITIALIZER_LIST] = sizeof(initializer_list_t),
430 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
432 assert(kind < lengthof(sizes));
433 assert(sizes[kind] != 0);
438 * Allocate an initializer node of given kind and initialize all
441 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
443 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
450 * Returns the index of the top element of the environment stack.
452 static size_t environment_top(void)
454 return ARR_LEN(environment_stack);
458 * Returns the index of the top element of the global label stack.
460 static size_t label_top(void)
462 return ARR_LEN(label_stack);
466 * Return the next token.
468 static inline void next_token(void)
470 token = lookahead_buffer[lookahead_bufpos];
471 lookahead_buffer[lookahead_bufpos] = lexer_token;
474 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
477 print_token(stderr, &token);
478 fprintf(stderr, "\n");
482 static inline bool next_if(int const type)
484 if (token.type == type) {
493 * Return the next token with a given lookahead.
495 static inline const token_t *look_ahead(size_t num)
497 assert(0 < num && num <= MAX_LOOKAHEAD);
498 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
499 return &lookahead_buffer[pos];
503 * Adds a token type to the token type anchor set (a multi-set).
505 static void add_anchor_token(int token_type)
507 assert(0 <= token_type && token_type < T_LAST_TOKEN);
508 ++token_anchor_set[token_type];
512 * Set the number of tokens types of the given type
513 * to zero and return the old count.
515 static int save_and_reset_anchor_state(int token_type)
517 assert(0 <= token_type && token_type < T_LAST_TOKEN);
518 int count = token_anchor_set[token_type];
519 token_anchor_set[token_type] = 0;
524 * Restore the number of token types to the given count.
526 static void restore_anchor_state(int token_type, int count)
528 assert(0 <= token_type && token_type < T_LAST_TOKEN);
529 token_anchor_set[token_type] = count;
533 * Remove a token type from the token type anchor set (a multi-set).
535 static void rem_anchor_token(int token_type)
537 assert(0 <= token_type && token_type < T_LAST_TOKEN);
538 assert(token_anchor_set[token_type] != 0);
539 --token_anchor_set[token_type];
543 * Return true if the token type of the current token is
546 static bool at_anchor(void)
550 return token_anchor_set[token.type];
554 * Eat tokens until a matching token type is found.
556 static void eat_until_matching_token(int type)
560 case '(': end_token = ')'; break;
561 case '{': end_token = '}'; break;
562 case '[': end_token = ']'; break;
563 default: end_token = type; break;
566 unsigned parenthesis_count = 0;
567 unsigned brace_count = 0;
568 unsigned bracket_count = 0;
569 while (token.type != end_token ||
570 parenthesis_count != 0 ||
572 bracket_count != 0) {
573 switch (token.type) {
575 case '(': ++parenthesis_count; break;
576 case '{': ++brace_count; break;
577 case '[': ++bracket_count; break;
580 if (parenthesis_count > 0)
590 if (bracket_count > 0)
593 if (token.type == end_token &&
594 parenthesis_count == 0 &&
608 * Eat input tokens until an anchor is found.
610 static void eat_until_anchor(void)
612 while (token_anchor_set[token.type] == 0) {
613 if (token.type == '(' || token.type == '{' || token.type == '[')
614 eat_until_matching_token(token.type);
620 * Eat a whole block from input tokens.
622 static void eat_block(void)
624 eat_until_matching_token('{');
628 #define eat(token_type) (assert(token.type == (token_type)), next_token())
631 * Report a parse error because an expected token was not found.
634 #if defined __GNUC__ && __GNUC__ >= 4
635 __attribute__((sentinel))
637 void parse_error_expected(const char *message, ...)
639 if (message != NULL) {
640 errorf(HERE, "%s", message);
643 va_start(ap, message);
644 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
649 * Report an incompatible type.
651 static void type_error_incompatible(const char *msg,
652 const source_position_t *source_position, type_t *type1, type_t *type2)
654 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
659 * Expect the current token is the expected token.
660 * If not, generate an error, eat the current statement,
661 * and goto the error_label label.
663 #define expect(expected, error_label) \
665 if (UNLIKELY(token.type != (expected))) { \
666 parse_error_expected(NULL, (expected), NULL); \
667 add_anchor_token(expected); \
668 eat_until_anchor(); \
669 next_if((expected)); \
670 rem_anchor_token(expected); \
677 * Push a given scope on the scope stack and make it the
680 static scope_t *scope_push(scope_t *new_scope)
682 if (current_scope != NULL) {
683 new_scope->depth = current_scope->depth + 1;
686 scope_t *old_scope = current_scope;
687 current_scope = new_scope;
692 * Pop the current scope from the scope stack.
694 static void scope_pop(scope_t *old_scope)
696 current_scope = old_scope;
700 * Search an entity by its symbol in a given namespace.
702 static entity_t *get_entity(const symbol_t *const symbol,
703 namespace_tag_t namespc)
705 assert(namespc != NAMESPACE_INVALID);
706 entity_t *entity = symbol->entity;
707 for (; entity != NULL; entity = entity->base.symbol_next) {
708 if (entity->base.namespc == namespc)
715 /* §6.2.3:1 24) There is only one name space for tags even though three are
717 static entity_t *get_tag(symbol_t const *const symbol,
718 entity_kind_tag_t const kind)
720 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
721 if (entity != NULL && entity->kind != kind) {
723 "'%Y' defined as wrong kind of tag (previous definition %P)",
724 symbol, &entity->base.source_position);
731 * pushs an entity on the environment stack and links the corresponding symbol
734 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
736 symbol_t *symbol = entity->base.symbol;
737 entity_namespace_t namespc = entity->base.namespc;
738 assert(namespc != NAMESPACE_INVALID);
740 /* replace/add entity into entity list of the symbol */
743 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
748 /* replace an entry? */
749 if (iter->base.namespc == namespc) {
750 entity->base.symbol_next = iter->base.symbol_next;
756 /* remember old declaration */
758 entry.symbol = symbol;
759 entry.old_entity = iter;
760 entry.namespc = namespc;
761 ARR_APP1(stack_entry_t, *stack_ptr, entry);
765 * Push an entity on the environment stack.
767 static void environment_push(entity_t *entity)
769 assert(entity->base.source_position.input_name != NULL);
770 assert(entity->base.parent_scope != NULL);
771 stack_push(&environment_stack, entity);
775 * Push a declaration on the global label stack.
777 * @param declaration the declaration
779 static void label_push(entity_t *label)
781 /* we abuse the parameters scope as parent for the labels */
782 label->base.parent_scope = ¤t_function->parameters;
783 stack_push(&label_stack, label);
787 * pops symbols from the environment stack until @p new_top is the top element
789 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
791 stack_entry_t *stack = *stack_ptr;
792 size_t top = ARR_LEN(stack);
795 assert(new_top <= top);
799 for (i = top; i > new_top; --i) {
800 stack_entry_t *entry = &stack[i - 1];
802 entity_t *old_entity = entry->old_entity;
803 symbol_t *symbol = entry->symbol;
804 entity_namespace_t namespc = entry->namespc;
806 /* replace with old_entity/remove */
809 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
811 assert(iter != NULL);
812 /* replace an entry? */
813 if (iter->base.namespc == namespc)
817 /* restore definition from outer scopes (if there was one) */
818 if (old_entity != NULL) {
819 old_entity->base.symbol_next = iter->base.symbol_next;
820 *anchor = old_entity;
822 /* remove entry from list */
823 *anchor = iter->base.symbol_next;
827 ARR_SHRINKLEN(*stack_ptr, new_top);
831 * Pop all entries from the environment stack until the new_top
834 * @param new_top the new stack top
836 static void environment_pop_to(size_t new_top)
838 stack_pop_to(&environment_stack, new_top);
842 * Pop all entries from the global label stack until the new_top
845 * @param new_top the new stack top
847 static void label_pop_to(size_t new_top)
849 stack_pop_to(&label_stack, new_top);
852 static int get_akind_rank(atomic_type_kind_t akind)
858 * Return the type rank for an atomic type.
860 static int get_rank(const type_t *type)
862 assert(!is_typeref(type));
863 if (type->kind == TYPE_ENUM)
864 return get_akind_rank(type->enumt.akind);
866 assert(type->kind == TYPE_ATOMIC);
867 return get_akind_rank(type->atomic.akind);
871 * §6.3.1.1:2 Do integer promotion for a given type.
873 * @param type the type to promote
874 * @return the promoted type
876 static type_t *promote_integer(type_t *type)
878 if (type->kind == TYPE_BITFIELD)
879 type = type->bitfield.base_type;
881 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
888 * Create a cast expression.
890 * @param expression the expression to cast
891 * @param dest_type the destination type
893 static expression_t *create_cast_expression(expression_t *expression,
896 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
898 cast->unary.value = expression;
899 cast->base.type = dest_type;
905 * Check if a given expression represents a null pointer constant.
907 * @param expression the expression to check
909 static bool is_null_pointer_constant(const expression_t *expression)
911 /* skip void* cast */
912 if (expression->kind == EXPR_UNARY_CAST ||
913 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
914 type_t *const type = skip_typeref(expression->base.type);
915 if (types_compatible(type, type_void_ptr))
916 expression = expression->unary.value;
919 type_t *const type = skip_typeref(expression->base.type);
920 if (!is_type_integer(type))
922 switch (is_constant_expression(expression)) {
923 case EXPR_CLASS_ERROR: return true;
924 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
925 default: return false;
930 * Create an implicit cast expression.
932 * @param expression the expression to cast
933 * @param dest_type the destination type
935 static expression_t *create_implicit_cast(expression_t *expression,
938 type_t *const source_type = expression->base.type;
940 if (source_type == dest_type)
943 return create_cast_expression(expression, dest_type);
946 typedef enum assign_error_t {
948 ASSIGN_ERROR_INCOMPATIBLE,
949 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
950 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
951 ASSIGN_WARNING_POINTER_FROM_INT,
952 ASSIGN_WARNING_INT_FROM_POINTER
955 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
956 const expression_t *const right,
958 const source_position_t *source_position)
960 type_t *const orig_type_right = right->base.type;
961 type_t *const type_left = skip_typeref(orig_type_left);
962 type_t *const type_right = skip_typeref(orig_type_right);
967 case ASSIGN_ERROR_INCOMPATIBLE:
968 errorf(source_position,
969 "destination type '%T' in %s is incompatible with type '%T'",
970 orig_type_left, context, orig_type_right);
973 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
975 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
976 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
978 /* the left type has all qualifiers from the right type */
979 unsigned missing_qualifiers
980 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
981 warningf(source_position,
982 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
983 orig_type_left, context, orig_type_right, missing_qualifiers);
988 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
990 warningf(source_position,
991 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
992 orig_type_left, context, right, orig_type_right);
996 case ASSIGN_WARNING_POINTER_FROM_INT:
998 warningf(source_position,
999 "%s makes pointer '%T' from integer '%T' without a cast",
1000 context, orig_type_left, orig_type_right);
1004 case ASSIGN_WARNING_INT_FROM_POINTER:
1005 if (warning.other) {
1006 warningf(source_position,
1007 "%s makes integer '%T' from pointer '%T' without a cast",
1008 context, orig_type_left, orig_type_right);
1013 panic("invalid error value");
1017 /** Implements the rules from §6.5.16.1 */
1018 static assign_error_t semantic_assign(type_t *orig_type_left,
1019 const expression_t *const right)
1021 type_t *const orig_type_right = right->base.type;
1022 type_t *const type_left = skip_typeref(orig_type_left);
1023 type_t *const type_right = skip_typeref(orig_type_right);
1025 if (is_type_pointer(type_left)) {
1026 if (is_null_pointer_constant(right)) {
1027 return ASSIGN_SUCCESS;
1028 } else if (is_type_pointer(type_right)) {
1029 type_t *points_to_left
1030 = skip_typeref(type_left->pointer.points_to);
1031 type_t *points_to_right
1032 = skip_typeref(type_right->pointer.points_to);
1033 assign_error_t res = ASSIGN_SUCCESS;
1035 /* the left type has all qualifiers from the right type */
1036 unsigned missing_qualifiers
1037 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1038 if (missing_qualifiers != 0) {
1039 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1042 points_to_left = get_unqualified_type(points_to_left);
1043 points_to_right = get_unqualified_type(points_to_right);
1045 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1048 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1049 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1050 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1053 if (!types_compatible(points_to_left, points_to_right)) {
1054 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1058 } else if (is_type_integer(type_right)) {
1059 return ASSIGN_WARNING_POINTER_FROM_INT;
1061 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1062 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1063 && is_type_pointer(type_right))) {
1064 return ASSIGN_SUCCESS;
1065 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1066 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1067 type_t *const unqual_type_left = get_unqualified_type(type_left);
1068 type_t *const unqual_type_right = get_unqualified_type(type_right);
1069 if (types_compatible(unqual_type_left, unqual_type_right)) {
1070 return ASSIGN_SUCCESS;
1072 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1073 return ASSIGN_WARNING_INT_FROM_POINTER;
1076 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1077 return ASSIGN_SUCCESS;
1079 return ASSIGN_ERROR_INCOMPATIBLE;
1082 static expression_t *parse_constant_expression(void)
1084 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1086 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1087 errorf(&result->base.source_position,
1088 "expression '%E' is not constant", result);
1094 static expression_t *parse_assignment_expression(void)
1096 return parse_subexpression(PREC_ASSIGNMENT);
1099 static void warn_string_concat(const source_position_t *pos)
1101 if (warning.traditional) {
1102 warningf(pos, "traditional C rejects string constant concatenation");
1106 static string_t parse_string_literals(void)
1108 assert(token.type == T_STRING_LITERAL);
1109 string_t result = token.literal;
1113 while (token.type == T_STRING_LITERAL) {
1114 warn_string_concat(&token.source_position);
1115 result = concat_strings(&result, &token.literal);
1123 * compare two string, ignoring double underscores on the second.
1125 static int strcmp_underscore(const char *s1, const char *s2)
1127 if (s2[0] == '_' && s2[1] == '_') {
1128 size_t len2 = strlen(s2);
1129 size_t len1 = strlen(s1);
1130 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1131 return strncmp(s1, s2+2, len2-4);
1135 return strcmp(s1, s2);
1138 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1140 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1141 attribute->kind = kind;
1146 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1149 * __attribute__ ( ( attribute-list ) )
1153 * attribute_list , attrib
1158 * any-word ( identifier )
1159 * any-word ( identifier , nonempty-expr-list )
1160 * any-word ( expr-list )
1162 * where the "identifier" must not be declared as a type, and
1163 * "any-word" may be any identifier (including one declared as a
1164 * type), a reserved word storage class specifier, type specifier or
1165 * type qualifier. ??? This still leaves out most reserved keywords
1166 * (following the old parser), shouldn't we include them, and why not
1167 * allow identifiers declared as types to start the arguments?
1169 * Matze: this all looks confusing and little systematic, so we're even less
1170 * strict and parse any list of things which are identifiers or
1171 * (assignment-)expressions.
1173 static attribute_argument_t *parse_attribute_arguments(void)
1175 attribute_argument_t *first = NULL;
1176 attribute_argument_t **anchor = &first;
1177 if (token.type != ')') do {
1178 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1180 /* is it an identifier */
1181 if (token.type == T_IDENTIFIER
1182 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1183 symbol_t *symbol = token.symbol;
1184 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1185 argument->v.symbol = symbol;
1188 /* must be an expression */
1189 expression_t *expression = parse_assignment_expression();
1191 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1192 argument->v.expression = expression;
1195 /* append argument */
1197 anchor = &argument->next;
1198 } while (next_if(','));
1199 expect(')', end_error);
1208 static attribute_t *parse_attribute_asm(void)
1212 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1214 expect('(', end_error);
1215 attribute->a.arguments = parse_attribute_arguments();
1222 static symbol_t *get_symbol_from_token(void)
1224 switch(token.type) {
1226 return token.symbol;
1255 /* maybe we need more tokens ... add them on demand */
1256 return get_token_symbol(&token);
1262 static attribute_t *parse_attribute_gnu_single(void)
1264 /* parse "any-word" */
1265 symbol_t *symbol = get_symbol_from_token();
1266 if (symbol == NULL) {
1267 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1271 const char *name = symbol->string;
1274 attribute_kind_t kind;
1275 for (kind = ATTRIBUTE_GNU_FIRST; kind <= ATTRIBUTE_GNU_LAST; ++kind) {
1276 const char *attribute_name = get_attribute_name(kind);
1277 if (attribute_name != NULL
1278 && strcmp_underscore(attribute_name, name) == 0)
1282 if (kind >= ATTRIBUTE_GNU_LAST) {
1283 if (warning.attribute) {
1284 warningf(HERE, "unknown attribute '%s' ignored", name);
1286 /* TODO: we should still save the attribute in the list... */
1287 kind = ATTRIBUTE_UNKNOWN;
1290 attribute_t *attribute = allocate_attribute_zero(kind);
1292 /* parse arguments */
1294 attribute->a.arguments = parse_attribute_arguments();
1299 static attribute_t *parse_attribute_gnu(void)
1301 attribute_t *first = NULL;
1302 attribute_t **anchor = &first;
1304 eat(T___attribute__);
1305 expect('(', end_error);
1306 expect('(', end_error);
1308 if (token.type != ')') do {
1309 attribute_t *attribute = parse_attribute_gnu_single();
1310 if (attribute == NULL)
1313 *anchor = attribute;
1314 anchor = &attribute->next;
1315 } while (next_if(','));
1316 expect(')', end_error);
1317 expect(')', end_error);
1323 /** Parse attributes. */
1324 static attribute_t *parse_attributes(attribute_t *first)
1326 attribute_t **anchor = &first;
1328 while (*anchor != NULL)
1329 anchor = &(*anchor)->next;
1331 attribute_t *attribute;
1332 switch (token.type) {
1333 case T___attribute__:
1334 attribute = parse_attribute_gnu();
1338 attribute = parse_attribute_asm();
1343 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1348 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1351 case T__forceinline:
1353 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1358 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1363 /* TODO record modifier */
1365 warningf(HERE, "Ignoring declaration modifier %K", &token);
1366 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1373 *anchor = attribute;
1374 anchor = &attribute->next;
1378 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1380 static entity_t *determine_lhs_ent(expression_t *const expr,
1383 switch (expr->kind) {
1384 case EXPR_REFERENCE: {
1385 entity_t *const entity = expr->reference.entity;
1386 /* we should only find variables as lvalues... */
1387 if (entity->base.kind != ENTITY_VARIABLE
1388 && entity->base.kind != ENTITY_PARAMETER)
1394 case EXPR_ARRAY_ACCESS: {
1395 expression_t *const ref = expr->array_access.array_ref;
1396 entity_t * ent = NULL;
1397 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1398 ent = determine_lhs_ent(ref, lhs_ent);
1401 mark_vars_read(expr->select.compound, lhs_ent);
1403 mark_vars_read(expr->array_access.index, lhs_ent);
1408 if (is_type_compound(skip_typeref(expr->base.type))) {
1409 return determine_lhs_ent(expr->select.compound, lhs_ent);
1411 mark_vars_read(expr->select.compound, lhs_ent);
1416 case EXPR_UNARY_DEREFERENCE: {
1417 expression_t *const val = expr->unary.value;
1418 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1420 return determine_lhs_ent(val->unary.value, lhs_ent);
1422 mark_vars_read(val, NULL);
1428 mark_vars_read(expr, NULL);
1433 #define ENT_ANY ((entity_t*)-1)
1436 * Mark declarations, which are read. This is used to detect variables, which
1440 * x is not marked as "read", because it is only read to calculate its own new
1444 * x and y are not detected as "not read", because multiple variables are
1447 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1449 switch (expr->kind) {
1450 case EXPR_REFERENCE: {
1451 entity_t *const entity = expr->reference.entity;
1452 if (entity->kind != ENTITY_VARIABLE
1453 && entity->kind != ENTITY_PARAMETER)
1456 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1457 if (entity->kind == ENTITY_VARIABLE) {
1458 entity->variable.read = true;
1460 entity->parameter.read = true;
1467 // TODO respect pure/const
1468 mark_vars_read(expr->call.function, NULL);
1469 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1470 mark_vars_read(arg->expression, NULL);
1474 case EXPR_CONDITIONAL:
1475 // TODO lhs_decl should depend on whether true/false have an effect
1476 mark_vars_read(expr->conditional.condition, NULL);
1477 if (expr->conditional.true_expression != NULL)
1478 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1479 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1483 if (lhs_ent == ENT_ANY
1484 && !is_type_compound(skip_typeref(expr->base.type)))
1486 mark_vars_read(expr->select.compound, lhs_ent);
1489 case EXPR_ARRAY_ACCESS: {
1490 expression_t *const ref = expr->array_access.array_ref;
1491 mark_vars_read(ref, lhs_ent);
1492 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1493 mark_vars_read(expr->array_access.index, lhs_ent);
1498 mark_vars_read(expr->va_arge.ap, lhs_ent);
1502 mark_vars_read(expr->va_copye.src, lhs_ent);
1505 case EXPR_UNARY_CAST:
1506 /* Special case: Use void cast to mark a variable as "read" */
1507 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1512 case EXPR_UNARY_THROW:
1513 if (expr->unary.value == NULL)
1516 case EXPR_UNARY_DEREFERENCE:
1517 case EXPR_UNARY_DELETE:
1518 case EXPR_UNARY_DELETE_ARRAY:
1519 if (lhs_ent == ENT_ANY)
1523 case EXPR_UNARY_NEGATE:
1524 case EXPR_UNARY_PLUS:
1525 case EXPR_UNARY_BITWISE_NEGATE:
1526 case EXPR_UNARY_NOT:
1527 case EXPR_UNARY_TAKE_ADDRESS:
1528 case EXPR_UNARY_POSTFIX_INCREMENT:
1529 case EXPR_UNARY_POSTFIX_DECREMENT:
1530 case EXPR_UNARY_PREFIX_INCREMENT:
1531 case EXPR_UNARY_PREFIX_DECREMENT:
1532 case EXPR_UNARY_CAST_IMPLICIT:
1533 case EXPR_UNARY_ASSUME:
1535 mark_vars_read(expr->unary.value, lhs_ent);
1538 case EXPR_BINARY_ADD:
1539 case EXPR_BINARY_SUB:
1540 case EXPR_BINARY_MUL:
1541 case EXPR_BINARY_DIV:
1542 case EXPR_BINARY_MOD:
1543 case EXPR_BINARY_EQUAL:
1544 case EXPR_BINARY_NOTEQUAL:
1545 case EXPR_BINARY_LESS:
1546 case EXPR_BINARY_LESSEQUAL:
1547 case EXPR_BINARY_GREATER:
1548 case EXPR_BINARY_GREATEREQUAL:
1549 case EXPR_BINARY_BITWISE_AND:
1550 case EXPR_BINARY_BITWISE_OR:
1551 case EXPR_BINARY_BITWISE_XOR:
1552 case EXPR_BINARY_LOGICAL_AND:
1553 case EXPR_BINARY_LOGICAL_OR:
1554 case EXPR_BINARY_SHIFTLEFT:
1555 case EXPR_BINARY_SHIFTRIGHT:
1556 case EXPR_BINARY_COMMA:
1557 case EXPR_BINARY_ISGREATER:
1558 case EXPR_BINARY_ISGREATEREQUAL:
1559 case EXPR_BINARY_ISLESS:
1560 case EXPR_BINARY_ISLESSEQUAL:
1561 case EXPR_BINARY_ISLESSGREATER:
1562 case EXPR_BINARY_ISUNORDERED:
1563 mark_vars_read(expr->binary.left, lhs_ent);
1564 mark_vars_read(expr->binary.right, lhs_ent);
1567 case EXPR_BINARY_ASSIGN:
1568 case EXPR_BINARY_MUL_ASSIGN:
1569 case EXPR_BINARY_DIV_ASSIGN:
1570 case EXPR_BINARY_MOD_ASSIGN:
1571 case EXPR_BINARY_ADD_ASSIGN:
1572 case EXPR_BINARY_SUB_ASSIGN:
1573 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1574 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1575 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1576 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1577 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1578 if (lhs_ent == ENT_ANY)
1580 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1581 mark_vars_read(expr->binary.right, lhs_ent);
1586 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1592 case EXPR_STRING_LITERAL:
1593 case EXPR_WIDE_STRING_LITERAL:
1594 case EXPR_COMPOUND_LITERAL: // TODO init?
1596 case EXPR_CLASSIFY_TYPE:
1599 case EXPR_BUILTIN_CONSTANT_P:
1600 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1602 case EXPR_STATEMENT: // TODO
1603 case EXPR_LABEL_ADDRESS:
1604 case EXPR_REFERENCE_ENUM_VALUE:
1608 panic("unhandled expression");
1611 static designator_t *parse_designation(void)
1613 designator_t *result = NULL;
1614 designator_t **anchor = &result;
1617 designator_t *designator;
1618 switch (token.type) {
1620 designator = allocate_ast_zero(sizeof(designator[0]));
1621 designator->source_position = token.source_position;
1623 add_anchor_token(']');
1624 designator->array_index = parse_constant_expression();
1625 rem_anchor_token(']');
1626 expect(']', end_error);
1629 designator = allocate_ast_zero(sizeof(designator[0]));
1630 designator->source_position = token.source_position;
1632 if (token.type != T_IDENTIFIER) {
1633 parse_error_expected("while parsing designator",
1634 T_IDENTIFIER, NULL);
1637 designator->symbol = token.symbol;
1641 expect('=', end_error);
1645 assert(designator != NULL);
1646 *anchor = designator;
1647 anchor = &designator->next;
1653 static initializer_t *initializer_from_string(array_type_t *const type,
1654 const string_t *const string)
1656 /* TODO: check len vs. size of array type */
1659 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1660 initializer->string.string = *string;
1665 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1666 const string_t *const string)
1668 /* TODO: check len vs. size of array type */
1671 initializer_t *const initializer =
1672 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1673 initializer->wide_string.string = *string;
1679 * Build an initializer from a given expression.
1681 static initializer_t *initializer_from_expression(type_t *orig_type,
1682 expression_t *expression)
1684 /* TODO check that expression is a constant expression */
1686 /* §6.7.8.14/15 char array may be initialized by string literals */
1687 type_t *type = skip_typeref(orig_type);
1688 type_t *expr_type_orig = expression->base.type;
1689 type_t *expr_type = skip_typeref(expr_type_orig);
1691 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1692 array_type_t *const array_type = &type->array;
1693 type_t *const element_type = skip_typeref(array_type->element_type);
1695 if (element_type->kind == TYPE_ATOMIC) {
1696 atomic_type_kind_t akind = element_type->atomic.akind;
1697 switch (expression->kind) {
1698 case EXPR_STRING_LITERAL:
1699 if (akind == ATOMIC_TYPE_CHAR
1700 || akind == ATOMIC_TYPE_SCHAR
1701 || akind == ATOMIC_TYPE_UCHAR) {
1702 return initializer_from_string(array_type,
1703 &expression->string_literal.value);
1707 case EXPR_WIDE_STRING_LITERAL: {
1708 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1709 if (get_unqualified_type(element_type) == bare_wchar_type) {
1710 return initializer_from_wide_string(array_type,
1711 &expression->string_literal.value);
1722 assign_error_t error = semantic_assign(type, expression);
1723 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1725 report_assign_error(error, type, expression, "initializer",
1726 &expression->base.source_position);
1728 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1729 result->value.value = create_implicit_cast(expression, type);
1735 * Checks if a given expression can be used as an constant initializer.
1737 static bool is_initializer_constant(const expression_t *expression)
1740 is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1741 is_address_constant(expression) != EXPR_CLASS_VARIABLE;
1745 * Parses an scalar initializer.
1747 * §6.7.8.11; eat {} without warning
1749 static initializer_t *parse_scalar_initializer(type_t *type,
1750 bool must_be_constant)
1752 /* there might be extra {} hierarchies */
1756 warningf(HERE, "extra curly braces around scalar initializer");
1759 } while (next_if('{'));
1762 expression_t *expression = parse_assignment_expression();
1763 mark_vars_read(expression, NULL);
1764 if (must_be_constant && !is_initializer_constant(expression)) {
1765 errorf(&expression->base.source_position,
1766 "initialisation expression '%E' is not constant",
1770 initializer_t *initializer = initializer_from_expression(type, expression);
1772 if (initializer == NULL) {
1773 errorf(&expression->base.source_position,
1774 "expression '%E' (type '%T') doesn't match expected type '%T'",
1775 expression, expression->base.type, type);
1780 bool additional_warning_displayed = false;
1781 while (braces > 0) {
1783 if (token.type != '}') {
1784 if (!additional_warning_displayed && warning.other) {
1785 warningf(HERE, "additional elements in scalar initializer");
1786 additional_warning_displayed = true;
1797 * An entry in the type path.
1799 typedef struct type_path_entry_t type_path_entry_t;
1800 struct type_path_entry_t {
1801 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1803 size_t index; /**< For array types: the current index. */
1804 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1809 * A type path expression a position inside compound or array types.
1811 typedef struct type_path_t type_path_t;
1812 struct type_path_t {
1813 type_path_entry_t *path; /**< An flexible array containing the current path. */
1814 type_t *top_type; /**< type of the element the path points */
1815 size_t max_index; /**< largest index in outermost array */
1819 * Prints a type path for debugging.
1821 static __attribute__((unused)) void debug_print_type_path(
1822 const type_path_t *path)
1824 size_t len = ARR_LEN(path->path);
1826 for (size_t i = 0; i < len; ++i) {
1827 const type_path_entry_t *entry = & path->path[i];
1829 type_t *type = skip_typeref(entry->type);
1830 if (is_type_compound(type)) {
1831 /* in gcc mode structs can have no members */
1832 if (entry->v.compound_entry == NULL) {
1836 fprintf(stderr, ".%s",
1837 entry->v.compound_entry->base.symbol->string);
1838 } else if (is_type_array(type)) {
1839 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1841 fprintf(stderr, "-INVALID-");
1844 if (path->top_type != NULL) {
1845 fprintf(stderr, " (");
1846 print_type(path->top_type);
1847 fprintf(stderr, ")");
1852 * Return the top type path entry, ie. in a path
1853 * (type).a.b returns the b.
1855 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1857 size_t len = ARR_LEN(path->path);
1859 return &path->path[len-1];
1863 * Enlarge the type path by an (empty) element.
1865 static type_path_entry_t *append_to_type_path(type_path_t *path)
1867 size_t len = ARR_LEN(path->path);
1868 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1870 type_path_entry_t *result = & path->path[len];
1871 memset(result, 0, sizeof(result[0]));
1876 * Descending into a sub-type. Enter the scope of the current top_type.
1878 static void descend_into_subtype(type_path_t *path)
1880 type_t *orig_top_type = path->top_type;
1881 type_t *top_type = skip_typeref(orig_top_type);
1883 type_path_entry_t *top = append_to_type_path(path);
1884 top->type = top_type;
1886 if (is_type_compound(top_type)) {
1887 compound_t *compound = top_type->compound.compound;
1888 entity_t *entry = compound->members.entities;
1890 if (entry != NULL) {
1891 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1892 top->v.compound_entry = &entry->declaration;
1893 path->top_type = entry->declaration.type;
1895 path->top_type = NULL;
1897 } else if (is_type_array(top_type)) {
1899 path->top_type = top_type->array.element_type;
1901 assert(!is_type_valid(top_type));
1906 * Pop an entry from the given type path, ie. returning from
1907 * (type).a.b to (type).a
1909 static void ascend_from_subtype(type_path_t *path)
1911 type_path_entry_t *top = get_type_path_top(path);
1913 path->top_type = top->type;
1915 size_t len = ARR_LEN(path->path);
1916 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1920 * Pop entries from the given type path until the given
1921 * path level is reached.
1923 static void ascend_to(type_path_t *path, size_t top_path_level)
1925 size_t len = ARR_LEN(path->path);
1927 while (len > top_path_level) {
1928 ascend_from_subtype(path);
1929 len = ARR_LEN(path->path);
1933 static bool walk_designator(type_path_t *path, const designator_t *designator,
1934 bool used_in_offsetof)
1936 for (; designator != NULL; designator = designator->next) {
1937 type_path_entry_t *top = get_type_path_top(path);
1938 type_t *orig_type = top->type;
1940 type_t *type = skip_typeref(orig_type);
1942 if (designator->symbol != NULL) {
1943 symbol_t *symbol = designator->symbol;
1944 if (!is_type_compound(type)) {
1945 if (is_type_valid(type)) {
1946 errorf(&designator->source_position,
1947 "'.%Y' designator used for non-compound type '%T'",
1951 top->type = type_error_type;
1952 top->v.compound_entry = NULL;
1953 orig_type = type_error_type;
1955 compound_t *compound = type->compound.compound;
1956 entity_t *iter = compound->members.entities;
1957 for (; iter != NULL; iter = iter->base.next) {
1958 if (iter->base.symbol == symbol) {
1963 errorf(&designator->source_position,
1964 "'%T' has no member named '%Y'", orig_type, symbol);
1967 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1968 if (used_in_offsetof) {
1969 type_t *real_type = skip_typeref(iter->declaration.type);
1970 if (real_type->kind == TYPE_BITFIELD) {
1971 errorf(&designator->source_position,
1972 "offsetof designator '%Y' must not specify bitfield",
1978 top->type = orig_type;
1979 top->v.compound_entry = &iter->declaration;
1980 orig_type = iter->declaration.type;
1983 expression_t *array_index = designator->array_index;
1984 assert(designator->array_index != NULL);
1986 if (!is_type_array(type)) {
1987 if (is_type_valid(type)) {
1988 errorf(&designator->source_position,
1989 "[%E] designator used for non-array type '%T'",
1990 array_index, orig_type);
1995 long index = fold_constant_to_int(array_index);
1996 if (!used_in_offsetof) {
1998 errorf(&designator->source_position,
1999 "array index [%E] must be positive", array_index);
2000 } else if (type->array.size_constant) {
2001 long array_size = type->array.size;
2002 if (index >= array_size) {
2003 errorf(&designator->source_position,
2004 "designator [%E] (%d) exceeds array size %d",
2005 array_index, index, array_size);
2010 top->type = orig_type;
2011 top->v.index = (size_t) index;
2012 orig_type = type->array.element_type;
2014 path->top_type = orig_type;
2016 if (designator->next != NULL) {
2017 descend_into_subtype(path);
2026 static void advance_current_object(type_path_t *path, size_t top_path_level)
2028 type_path_entry_t *top = get_type_path_top(path);
2030 type_t *type = skip_typeref(top->type);
2031 if (is_type_union(type)) {
2032 /* in unions only the first element is initialized */
2033 top->v.compound_entry = NULL;
2034 } else if (is_type_struct(type)) {
2035 declaration_t *entry = top->v.compound_entry;
2037 entity_t *next_entity = entry->base.next;
2038 if (next_entity != NULL) {
2039 assert(is_declaration(next_entity));
2040 entry = &next_entity->declaration;
2045 top->v.compound_entry = entry;
2046 if (entry != NULL) {
2047 path->top_type = entry->type;
2050 } else if (is_type_array(type)) {
2051 assert(is_type_array(type));
2055 if (!type->array.size_constant || top->v.index < type->array.size) {
2059 assert(!is_type_valid(type));
2063 /* we're past the last member of the current sub-aggregate, try if we
2064 * can ascend in the type hierarchy and continue with another subobject */
2065 size_t len = ARR_LEN(path->path);
2067 if (len > top_path_level) {
2068 ascend_from_subtype(path);
2069 advance_current_object(path, top_path_level);
2071 path->top_type = NULL;
2076 * skip any {...} blocks until a closing bracket is reached.
2078 static void skip_initializers(void)
2082 while (token.type != '}') {
2083 if (token.type == T_EOF)
2085 if (token.type == '{') {
2093 static initializer_t *create_empty_initializer(void)
2095 static initializer_t empty_initializer
2096 = { .list = { { INITIALIZER_LIST }, 0 } };
2097 return &empty_initializer;
2101 * Parse a part of an initialiser for a struct or union,
2103 static initializer_t *parse_sub_initializer(type_path_t *path,
2104 type_t *outer_type, size_t top_path_level,
2105 parse_initializer_env_t *env)
2107 if (token.type == '}') {
2108 /* empty initializer */
2109 return create_empty_initializer();
2112 type_t *orig_type = path->top_type;
2113 type_t *type = NULL;
2115 if (orig_type == NULL) {
2116 /* We are initializing an empty compound. */
2118 type = skip_typeref(orig_type);
2121 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2124 designator_t *designator = NULL;
2125 if (token.type == '.' || token.type == '[') {
2126 designator = parse_designation();
2127 goto finish_designator;
2128 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2129 /* GNU-style designator ("identifier: value") */
2130 designator = allocate_ast_zero(sizeof(designator[0]));
2131 designator->source_position = token.source_position;
2132 designator->symbol = token.symbol;
2137 /* reset path to toplevel, evaluate designator from there */
2138 ascend_to(path, top_path_level);
2139 if (!walk_designator(path, designator, false)) {
2140 /* can't continue after designation error */
2144 initializer_t *designator_initializer
2145 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2146 designator_initializer->designator.designator = designator;
2147 ARR_APP1(initializer_t*, initializers, designator_initializer);
2149 orig_type = path->top_type;
2150 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2155 if (token.type == '{') {
2156 if (type != NULL && is_type_scalar(type)) {
2157 sub = parse_scalar_initializer(type, env->must_be_constant);
2161 if (env->entity != NULL) {
2163 "extra brace group at end of initializer for '%Y'",
2164 env->entity->base.symbol);
2166 errorf(HERE, "extra brace group at end of initializer");
2169 descend_into_subtype(path);
2171 add_anchor_token('}');
2172 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2174 rem_anchor_token('}');
2177 ascend_from_subtype(path);
2178 expect('}', end_error);
2180 expect('}', end_error);
2181 goto error_parse_next;
2185 /* must be an expression */
2186 expression_t *expression = parse_assignment_expression();
2187 mark_vars_read(expression, NULL);
2189 if (env->must_be_constant && !is_initializer_constant(expression)) {
2190 errorf(&expression->base.source_position,
2191 "Initialisation expression '%E' is not constant",
2196 /* we are already outside, ... */
2197 if (outer_type == NULL)
2198 goto error_parse_next;
2199 type_t *const outer_type_skip = skip_typeref(outer_type);
2200 if (is_type_compound(outer_type_skip) &&
2201 !outer_type_skip->compound.compound->complete) {
2202 goto error_parse_next;
2207 /* handle { "string" } special case */
2208 if ((expression->kind == EXPR_STRING_LITERAL
2209 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2210 && outer_type != NULL) {
2211 sub = initializer_from_expression(outer_type, expression);
2214 if (token.type != '}' && warning.other) {
2215 warningf(HERE, "excessive elements in initializer for type '%T'",
2218 /* TODO: eat , ... */
2223 /* descend into subtypes until expression matches type */
2225 orig_type = path->top_type;
2226 type = skip_typeref(orig_type);
2228 sub = initializer_from_expression(orig_type, expression);
2232 if (!is_type_valid(type)) {
2235 if (is_type_scalar(type)) {
2236 errorf(&expression->base.source_position,
2237 "expression '%E' doesn't match expected type '%T'",
2238 expression, orig_type);
2242 descend_into_subtype(path);
2246 /* update largest index of top array */
2247 const type_path_entry_t *first = &path->path[0];
2248 type_t *first_type = first->type;
2249 first_type = skip_typeref(first_type);
2250 if (is_type_array(first_type)) {
2251 size_t index = first->v.index;
2252 if (index > path->max_index)
2253 path->max_index = index;
2257 /* append to initializers list */
2258 ARR_APP1(initializer_t*, initializers, sub);
2261 if (warning.other) {
2262 if (env->entity != NULL) {
2263 warningf(HERE, "excess elements in initializer for '%Y'",
2264 env->entity->base.symbol);
2266 warningf(HERE, "excess elements in initializer");
2272 if (token.type == '}') {
2275 expect(',', end_error);
2276 if (token.type == '}') {
2281 /* advance to the next declaration if we are not at the end */
2282 advance_current_object(path, top_path_level);
2283 orig_type = path->top_type;
2284 if (orig_type != NULL)
2285 type = skip_typeref(orig_type);
2291 size_t len = ARR_LEN(initializers);
2292 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2293 initializer_t *result = allocate_ast_zero(size);
2294 result->kind = INITIALIZER_LIST;
2295 result->list.len = len;
2296 memcpy(&result->list.initializers, initializers,
2297 len * sizeof(initializers[0]));
2299 DEL_ARR_F(initializers);
2300 ascend_to(path, top_path_level+1);
2305 skip_initializers();
2306 DEL_ARR_F(initializers);
2307 ascend_to(path, top_path_level+1);
2311 static expression_t *make_size_literal(size_t value)
2313 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2314 literal->base.type = type_size_t;
2317 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2318 literal->literal.value = make_string(buf);
2324 * Parses an initializer. Parsers either a compound literal
2325 * (env->declaration == NULL) or an initializer of a declaration.
2327 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2329 type_t *type = skip_typeref(env->type);
2330 size_t max_index = 0;
2331 initializer_t *result;
2333 if (is_type_scalar(type)) {
2334 result = parse_scalar_initializer(type, env->must_be_constant);
2335 } else if (token.type == '{') {
2339 memset(&path, 0, sizeof(path));
2340 path.top_type = env->type;
2341 path.path = NEW_ARR_F(type_path_entry_t, 0);
2343 descend_into_subtype(&path);
2345 add_anchor_token('}');
2346 result = parse_sub_initializer(&path, env->type, 1, env);
2347 rem_anchor_token('}');
2349 max_index = path.max_index;
2350 DEL_ARR_F(path.path);
2352 expect('}', end_error);
2354 /* parse_scalar_initializer() also works in this case: we simply
2355 * have an expression without {} around it */
2356 result = parse_scalar_initializer(type, env->must_be_constant);
2359 /* §6.7.8:22 array initializers for arrays with unknown size determine
2360 * the array type size */
2361 if (is_type_array(type) && type->array.size_expression == NULL
2362 && result != NULL) {
2364 switch (result->kind) {
2365 case INITIALIZER_LIST:
2366 assert(max_index != 0xdeadbeaf);
2367 size = max_index + 1;
2370 case INITIALIZER_STRING:
2371 size = result->string.string.size;
2374 case INITIALIZER_WIDE_STRING:
2375 size = result->wide_string.string.size;
2378 case INITIALIZER_DESIGNATOR:
2379 case INITIALIZER_VALUE:
2380 /* can happen for parse errors */
2385 internal_errorf(HERE, "invalid initializer type");
2388 type_t *new_type = duplicate_type(type);
2390 new_type->array.size_expression = make_size_literal(size);
2391 new_type->array.size_constant = true;
2392 new_type->array.has_implicit_size = true;
2393 new_type->array.size = size;
2394 env->type = new_type;
2402 static void append_entity(scope_t *scope, entity_t *entity)
2404 if (scope->last_entity != NULL) {
2405 scope->last_entity->base.next = entity;
2407 scope->entities = entity;
2409 entity->base.parent_entity = current_entity;
2410 scope->last_entity = entity;
2414 static compound_t *parse_compound_type_specifier(bool is_struct)
2416 eat(is_struct ? T_struct : T_union);
2418 symbol_t *symbol = NULL;
2419 compound_t *compound = NULL;
2420 attribute_t *attributes = NULL;
2422 if (token.type == T___attribute__) {
2423 attributes = parse_attributes(NULL);
2426 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2427 if (token.type == T_IDENTIFIER) {
2428 /* the compound has a name, check if we have seen it already */
2429 symbol = token.symbol;
2432 entity_t *entity = get_tag(symbol, kind);
2433 if (entity != NULL) {
2434 compound = &entity->compound;
2435 if (compound->base.parent_scope != current_scope &&
2436 (token.type == '{' || token.type == ';')) {
2437 /* we're in an inner scope and have a definition. Shadow
2438 * existing definition in outer scope */
2440 } else if (compound->complete && token.type == '{') {
2441 assert(symbol != NULL);
2442 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2443 is_struct ? "struct" : "union", symbol,
2444 &compound->base.source_position);
2445 /* clear members in the hope to avoid further errors */
2446 compound->members.entities = NULL;
2449 } else if (token.type != '{') {
2451 parse_error_expected("while parsing struct type specifier",
2452 T_IDENTIFIER, '{', NULL);
2454 parse_error_expected("while parsing union type specifier",
2455 T_IDENTIFIER, '{', NULL);
2461 if (compound == NULL) {
2462 entity_t *entity = allocate_entity_zero(kind);
2463 compound = &entity->compound;
2465 compound->alignment = 1;
2466 compound->base.namespc = NAMESPACE_TAG;
2467 compound->base.source_position = token.source_position;
2468 compound->base.symbol = symbol;
2469 compound->base.parent_scope = current_scope;
2470 if (symbol != NULL) {
2471 environment_push(entity);
2473 append_entity(current_scope, entity);
2476 if (token.type == '{') {
2477 parse_compound_type_entries(compound);
2479 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2480 if (symbol == NULL) {
2481 assert(anonymous_entity == NULL);
2482 anonymous_entity = (entity_t*)compound;
2486 if (attributes != NULL) {
2487 handle_entity_attributes(attributes, (entity_t*) compound);
2493 static void parse_enum_entries(type_t *const enum_type)
2497 if (token.type == '}') {
2498 errorf(HERE, "empty enum not allowed");
2503 add_anchor_token('}');
2505 if (token.type != T_IDENTIFIER) {
2506 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2508 rem_anchor_token('}');
2512 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2513 entity->enum_value.enum_type = enum_type;
2514 entity->base.namespc = NAMESPACE_NORMAL;
2515 entity->base.symbol = token.symbol;
2516 entity->base.source_position = token.source_position;
2520 expression_t *value = parse_constant_expression();
2522 value = create_implicit_cast(value, enum_type);
2523 entity->enum_value.value = value;
2528 record_entity(entity, false);
2529 } while (next_if(',') && token.type != '}');
2530 rem_anchor_token('}');
2532 expect('}', end_error);
2538 static type_t *parse_enum_specifier(void)
2544 switch (token.type) {
2546 symbol = token.symbol;
2549 entity = get_tag(symbol, ENTITY_ENUM);
2550 if (entity != NULL) {
2551 if (entity->base.parent_scope != current_scope &&
2552 (token.type == '{' || token.type == ';')) {
2553 /* we're in an inner scope and have a definition. Shadow
2554 * existing definition in outer scope */
2556 } else if (entity->enume.complete && token.type == '{') {
2557 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
2558 symbol, &entity->base.source_position);
2569 parse_error_expected("while parsing enum type specifier",
2570 T_IDENTIFIER, '{', NULL);
2574 if (entity == NULL) {
2575 entity = allocate_entity_zero(ENTITY_ENUM);
2576 entity->base.namespc = NAMESPACE_TAG;
2577 entity->base.source_position = token.source_position;
2578 entity->base.symbol = symbol;
2579 entity->base.parent_scope = current_scope;
2582 type_t *const type = allocate_type_zero(TYPE_ENUM);
2583 type->enumt.enume = &entity->enume;
2584 type->enumt.akind = ATOMIC_TYPE_INT;
2586 if (token.type == '{') {
2587 if (symbol != NULL) {
2588 environment_push(entity);
2590 append_entity(current_scope, entity);
2591 entity->enume.complete = true;
2593 parse_enum_entries(type);
2594 parse_attributes(NULL);
2596 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2597 if (symbol == NULL) {
2598 assert(anonymous_entity == NULL);
2599 anonymous_entity = entity;
2601 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2602 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2610 * if a symbol is a typedef to another type, return true
2612 static bool is_typedef_symbol(symbol_t *symbol)
2614 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2615 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2618 static type_t *parse_typeof(void)
2624 expect('(', end_error);
2625 add_anchor_token(')');
2627 expression_t *expression = NULL;
2629 bool old_type_prop = in_type_prop;
2630 bool old_gcc_extension = in_gcc_extension;
2631 in_type_prop = true;
2633 while (next_if(T___extension__)) {
2634 /* This can be a prefix to a typename or an expression. */
2635 in_gcc_extension = true;
2637 switch (token.type) {
2639 if (is_typedef_symbol(token.symbol)) {
2641 type = parse_typename();
2644 expression = parse_expression();
2645 type = revert_automatic_type_conversion(expression);
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.namespc = NAMESPACE_NORMAL;
2830 entity->base.source_position = *HERE;
2831 entity->base.symbol = symbol;
2832 if (is_declaration(entity)) {
2833 entity->declaration.type = type_error_type;
2834 entity->declaration.implicit = true;
2835 } else if (kind == ENTITY_TYPEDEF) {
2836 entity->typedefe.type = type_error_type;
2837 entity->typedefe.builtin = true;
2839 if (kind != ENTITY_COMPOUND_MEMBER)
2840 record_entity(entity, false);
2844 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2846 type_t *type = NULL;
2847 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2848 unsigned type_specifiers = 0;
2849 bool newtype = false;
2850 bool saw_error = false;
2851 bool old_gcc_extension = in_gcc_extension;
2853 specifiers->source_position = token.source_position;
2856 specifiers->attributes = parse_attributes(specifiers->attributes);
2858 switch (token.type) {
2860 #define MATCH_STORAGE_CLASS(token, class) \
2862 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2863 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2865 specifiers->storage_class = class; \
2866 if (specifiers->thread_local) \
2867 goto check_thread_storage_class; \
2871 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2872 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2873 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2874 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2875 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2878 specifiers->attributes
2879 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2883 if (specifiers->thread_local) {
2884 errorf(HERE, "duplicate '__thread'");
2886 specifiers->thread_local = true;
2887 check_thread_storage_class:
2888 switch (specifiers->storage_class) {
2889 case STORAGE_CLASS_EXTERN:
2890 case STORAGE_CLASS_NONE:
2891 case STORAGE_CLASS_STATIC:
2895 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2896 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2897 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2898 wrong_thread_storage_class:
2899 errorf(HERE, "'__thread' used with '%s'", wrong);
2906 /* type qualifiers */
2907 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2909 qualifiers |= qualifier; \
2913 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2914 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2915 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2916 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2917 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2918 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2919 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2920 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2922 case T___extension__:
2924 in_gcc_extension = true;
2927 /* type specifiers */
2928 #define MATCH_SPECIFIER(token, specifier, name) \
2930 if (type_specifiers & specifier) { \
2931 errorf(HERE, "multiple " name " type specifiers given"); \
2933 type_specifiers |= specifier; \
2938 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2939 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2940 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2941 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2942 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2943 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2944 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2945 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2946 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2947 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2948 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2949 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2950 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2951 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2952 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2953 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2954 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2955 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2959 specifiers->is_inline = true;
2963 case T__forceinline:
2965 specifiers->modifiers |= DM_FORCEINLINE;
2970 if (type_specifiers & SPECIFIER_LONG_LONG) {
2971 errorf(HERE, "multiple type specifiers given");
2972 } else if (type_specifiers & SPECIFIER_LONG) {
2973 type_specifiers |= SPECIFIER_LONG_LONG;
2975 type_specifiers |= SPECIFIER_LONG;
2980 #define CHECK_DOUBLE_TYPE() \
2981 if ( type != NULL) \
2982 errorf(HERE, "multiple data types in declaration specifiers");
2985 CHECK_DOUBLE_TYPE();
2986 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2988 type->compound.compound = parse_compound_type_specifier(true);
2991 CHECK_DOUBLE_TYPE();
2992 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2993 type->compound.compound = parse_compound_type_specifier(false);
2996 CHECK_DOUBLE_TYPE();
2997 type = parse_enum_specifier();
3000 CHECK_DOUBLE_TYPE();
3001 type = parse_typeof();
3003 case T___builtin_va_list:
3004 CHECK_DOUBLE_TYPE();
3005 type = duplicate_type(type_valist);
3009 case T_IDENTIFIER: {
3010 /* only parse identifier if we haven't found a type yet */
3011 if (type != NULL || type_specifiers != 0) {
3012 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3013 * declaration, so it doesn't generate errors about expecting '(' or
3015 switch (look_ahead(1)->type) {
3022 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3026 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3031 goto finish_specifiers;
3035 type_t *const typedef_type = get_typedef_type(token.symbol);
3036 if (typedef_type == NULL) {
3037 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3038 * declaration, so it doesn't generate 'implicit int' followed by more
3039 * errors later on. */
3040 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3046 errorf(HERE, "%K does not name a type", &token);
3049 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3051 type = allocate_type_zero(TYPE_TYPEDEF);
3052 type->typedeft.typedefe = &entity->typedefe;
3056 if (la1_type == '&' || la1_type == '*')
3057 goto finish_specifiers;
3062 goto finish_specifiers;
3067 type = typedef_type;
3071 /* function specifier */
3073 goto finish_specifiers;
3078 specifiers->attributes = parse_attributes(specifiers->attributes);
3080 in_gcc_extension = old_gcc_extension;
3082 if (type == NULL || (saw_error && type_specifiers != 0)) {
3083 atomic_type_kind_t atomic_type;
3085 /* match valid basic types */
3086 switch (type_specifiers) {
3087 case SPECIFIER_VOID:
3088 atomic_type = ATOMIC_TYPE_VOID;
3090 case SPECIFIER_WCHAR_T:
3091 atomic_type = ATOMIC_TYPE_WCHAR_T;
3093 case SPECIFIER_CHAR:
3094 atomic_type = ATOMIC_TYPE_CHAR;
3096 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3097 atomic_type = ATOMIC_TYPE_SCHAR;
3099 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3100 atomic_type = ATOMIC_TYPE_UCHAR;
3102 case SPECIFIER_SHORT:
3103 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3104 case SPECIFIER_SHORT | SPECIFIER_INT:
3105 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3106 atomic_type = ATOMIC_TYPE_SHORT;
3108 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3109 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3110 atomic_type = ATOMIC_TYPE_USHORT;
3113 case SPECIFIER_SIGNED:
3114 case SPECIFIER_SIGNED | SPECIFIER_INT:
3115 atomic_type = ATOMIC_TYPE_INT;
3117 case SPECIFIER_UNSIGNED:
3118 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3119 atomic_type = ATOMIC_TYPE_UINT;
3121 case SPECIFIER_LONG:
3122 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3123 case SPECIFIER_LONG | SPECIFIER_INT:
3124 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3125 atomic_type = ATOMIC_TYPE_LONG;
3127 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3128 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3129 atomic_type = ATOMIC_TYPE_ULONG;
3132 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3133 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3134 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3135 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3137 atomic_type = ATOMIC_TYPE_LONGLONG;
3138 goto warn_about_long_long;
3140 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3141 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3143 atomic_type = ATOMIC_TYPE_ULONGLONG;
3144 warn_about_long_long:
3145 if (warning.long_long) {
3146 warningf(&specifiers->source_position,
3147 "ISO C90 does not support 'long long'");
3151 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3152 atomic_type = unsigned_int8_type_kind;
3155 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3156 atomic_type = unsigned_int16_type_kind;
3159 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3160 atomic_type = unsigned_int32_type_kind;
3163 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3164 atomic_type = unsigned_int64_type_kind;
3167 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3168 atomic_type = unsigned_int128_type_kind;
3171 case SPECIFIER_INT8:
3172 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3173 atomic_type = int8_type_kind;
3176 case SPECIFIER_INT16:
3177 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3178 atomic_type = int16_type_kind;
3181 case SPECIFIER_INT32:
3182 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3183 atomic_type = int32_type_kind;
3186 case SPECIFIER_INT64:
3187 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3188 atomic_type = int64_type_kind;
3191 case SPECIFIER_INT128:
3192 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3193 atomic_type = int128_type_kind;
3196 case SPECIFIER_FLOAT:
3197 atomic_type = ATOMIC_TYPE_FLOAT;
3199 case SPECIFIER_DOUBLE:
3200 atomic_type = ATOMIC_TYPE_DOUBLE;
3202 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3203 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3205 case SPECIFIER_BOOL:
3206 atomic_type = ATOMIC_TYPE_BOOL;
3208 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3209 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3210 atomic_type = ATOMIC_TYPE_FLOAT;
3212 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3213 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3214 atomic_type = ATOMIC_TYPE_DOUBLE;
3216 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3217 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3218 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3221 /* invalid specifier combination, give an error message */
3222 if (type_specifiers == 0) {
3226 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3227 if (!(c_mode & _CXX) && !strict_mode) {
3228 if (warning.implicit_int) {
3229 warningf(HERE, "no type specifiers in declaration, using 'int'");
3231 atomic_type = ATOMIC_TYPE_INT;
3234 errorf(HERE, "no type specifiers given in declaration");
3236 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3237 (type_specifiers & SPECIFIER_UNSIGNED)) {
3238 errorf(HERE, "signed and unsigned specifiers given");
3239 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3240 errorf(HERE, "only integer types can be signed or unsigned");
3242 errorf(HERE, "multiple datatypes in declaration");
3247 if (type_specifiers & SPECIFIER_COMPLEX) {
3248 type = allocate_type_zero(TYPE_COMPLEX);
3249 type->complex.akind = atomic_type;
3250 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3251 type = allocate_type_zero(TYPE_IMAGINARY);
3252 type->imaginary.akind = atomic_type;
3254 type = allocate_type_zero(TYPE_ATOMIC);
3255 type->atomic.akind = atomic_type;
3258 } else if (type_specifiers != 0) {
3259 errorf(HERE, "multiple datatypes in declaration");
3262 /* FIXME: check type qualifiers here */
3263 type->base.qualifiers = qualifiers;
3266 type = identify_new_type(type);
3268 type = typehash_insert(type);
3271 if (specifiers->attributes != NULL)
3272 type = handle_type_attributes(specifiers->attributes, type);
3273 specifiers->type = type;
3277 specifiers->type = type_error_type;
3280 static type_qualifiers_t parse_type_qualifiers(void)
3282 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3285 switch (token.type) {
3286 /* type qualifiers */
3287 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3288 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3289 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3290 /* microsoft extended type modifiers */
3291 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3292 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3293 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3294 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3295 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3304 * Parses an K&R identifier list
3306 static void parse_identifier_list(scope_t *scope)
3309 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3310 entity->base.source_position = token.source_position;
3311 entity->base.namespc = NAMESPACE_NORMAL;
3312 entity->base.symbol = token.symbol;
3313 /* a K&R parameter has no type, yet */
3317 append_entity(scope, entity);
3318 } while (next_if(',') && token.type == T_IDENTIFIER);
3321 static entity_t *parse_parameter(void)
3323 declaration_specifiers_t specifiers;
3324 memset(&specifiers, 0, sizeof(specifiers));
3326 parse_declaration_specifiers(&specifiers);
3328 entity_t *entity = parse_declarator(&specifiers,
3329 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3330 anonymous_entity = NULL;
3334 static void semantic_parameter_incomplete(const entity_t *entity)
3336 assert(entity->kind == ENTITY_PARAMETER);
3338 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3339 * list in a function declarator that is part of a
3340 * definition of that function shall not have
3341 * incomplete type. */
3342 type_t *type = skip_typeref(entity->declaration.type);
3343 if (is_type_incomplete(type)) {
3344 errorf(&entity->base.source_position,
3345 "parameter '%#T' has incomplete type",
3346 entity->declaration.type, entity->base.symbol);
3350 static bool has_parameters(void)
3352 /* func(void) is not a parameter */
3353 if (token.type == T_IDENTIFIER) {
3354 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3357 if (entity->kind != ENTITY_TYPEDEF)
3359 if (skip_typeref(entity->typedefe.type) != type_void)
3361 } else if (token.type != T_void) {
3364 if (look_ahead(1)->type != ')')
3371 * Parses function type parameters (and optionally creates variable_t entities
3372 * for them in a scope)
3374 static void parse_parameters(function_type_t *type, scope_t *scope)
3377 add_anchor_token(')');
3378 int saved_comma_state = save_and_reset_anchor_state(',');
3380 if (token.type == T_IDENTIFIER &&
3381 !is_typedef_symbol(token.symbol)) {
3382 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3383 if (la1_type == ',' || la1_type == ')') {
3384 type->kr_style_parameters = true;
3385 parse_identifier_list(scope);
3386 goto parameters_finished;
3390 if (token.type == ')') {
3391 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3392 if (!(c_mode & _CXX))
3393 type->unspecified_parameters = true;
3394 goto parameters_finished;
3397 if (has_parameters()) {
3398 function_parameter_t **anchor = &type->parameters;
3400 switch (token.type) {
3403 type->variadic = true;
3404 goto parameters_finished;
3407 case T___extension__:
3410 entity_t *entity = parse_parameter();
3411 if (entity->kind == ENTITY_TYPEDEF) {
3412 errorf(&entity->base.source_position,
3413 "typedef not allowed as function parameter");
3416 assert(is_declaration(entity));
3418 semantic_parameter_incomplete(entity);
3420 function_parameter_t *const parameter =
3421 allocate_parameter(entity->declaration.type);
3423 if (scope != NULL) {
3424 append_entity(scope, entity);
3427 *anchor = parameter;
3428 anchor = ¶meter->next;
3433 goto parameters_finished;
3435 } while (next_if(','));
3439 parameters_finished:
3440 rem_anchor_token(')');
3441 expect(')', end_error);
3444 restore_anchor_state(',', saved_comma_state);
3447 typedef enum construct_type_kind_t {
3450 CONSTRUCT_REFERENCE,
3453 } construct_type_kind_t;
3455 typedef union construct_type_t construct_type_t;
3457 typedef struct construct_type_base_t {
3458 construct_type_kind_t kind;
3459 source_position_t pos;
3460 construct_type_t *next;
3461 } construct_type_base_t;
3463 typedef struct parsed_pointer_t {
3464 construct_type_base_t base;
3465 type_qualifiers_t type_qualifiers;
3466 variable_t *base_variable; /**< MS __based extension. */
3469 typedef struct parsed_reference_t {
3470 construct_type_base_t base;
3471 } parsed_reference_t;
3473 typedef struct construct_function_type_t {
3474 construct_type_base_t base;
3475 type_t *function_type;
3476 } construct_function_type_t;
3478 typedef struct parsed_array_t {
3479 construct_type_base_t base;
3480 type_qualifiers_t type_qualifiers;
3486 union construct_type_t {
3487 construct_type_kind_t kind;
3488 construct_type_base_t base;
3489 parsed_pointer_t pointer;
3490 parsed_reference_t reference;
3491 construct_function_type_t function;
3492 parsed_array_t array;
3495 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3497 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3498 memset(cons, 0, size);
3500 cons->base.pos = *HERE;
3505 static construct_type_t *parse_pointer_declarator(void)
3507 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3509 cons->pointer.type_qualifiers = parse_type_qualifiers();
3510 //cons->pointer.base_variable = base_variable;
3515 /* ISO/IEC 14882:1998(E) §8.3.2 */
3516 static construct_type_t *parse_reference_declarator(void)
3518 if (!(c_mode & _CXX))
3519 errorf(HERE, "references are only available for C++");
3521 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3528 static construct_type_t *parse_array_declarator(void)
3530 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3531 parsed_array_t *const array = &cons->array;
3534 add_anchor_token(']');
3536 bool is_static = next_if(T_static);
3538 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3541 is_static = next_if(T_static);
3543 array->type_qualifiers = type_qualifiers;
3544 array->is_static = is_static;
3546 expression_t *size = NULL;
3547 if (token.type == '*' && look_ahead(1)->type == ']') {
3548 array->is_variable = true;
3550 } else if (token.type != ']') {
3551 size = parse_assignment_expression();
3553 /* §6.7.5.2:1 Array size must have integer type */
3554 type_t *const orig_type = size->base.type;
3555 type_t *const type = skip_typeref(orig_type);
3556 if (!is_type_integer(type) && is_type_valid(type)) {
3557 errorf(&size->base.source_position,
3558 "array size '%E' must have integer type but has type '%T'",
3563 mark_vars_read(size, NULL);
3566 if (is_static && size == NULL)
3567 errorf(HERE, "static array parameters require a size");
3569 rem_anchor_token(']');
3570 expect(']', end_error);
3577 static construct_type_t *parse_function_declarator(scope_t *scope)
3579 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3581 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3582 function_type_t *ftype = &type->function;
3584 ftype->linkage = current_linkage;
3585 ftype->calling_convention = CC_DEFAULT;
3587 parse_parameters(ftype, scope);
3589 cons->function.function_type = type;
3594 typedef struct parse_declarator_env_t {
3595 bool may_be_abstract : 1;
3596 bool must_be_abstract : 1;
3597 decl_modifiers_t modifiers;
3599 source_position_t source_position;
3601 attribute_t *attributes;
3602 } parse_declarator_env_t;
3605 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3607 /* construct a single linked list of construct_type_t's which describe
3608 * how to construct the final declarator type */
3609 construct_type_t *first = NULL;
3610 construct_type_t **anchor = &first;
3612 env->attributes = parse_attributes(env->attributes);
3615 construct_type_t *type;
3616 //variable_t *based = NULL; /* MS __based extension */
3617 switch (token.type) {
3619 type = parse_reference_declarator();
3623 panic("based not supported anymore");
3628 type = parse_pointer_declarator();
3632 goto ptr_operator_end;
3636 anchor = &type->base.next;
3638 /* TODO: find out if this is correct */
3639 env->attributes = parse_attributes(env->attributes);
3643 construct_type_t *inner_types = NULL;
3645 switch (token.type) {
3647 if (env->must_be_abstract) {
3648 errorf(HERE, "no identifier expected in typename");
3650 env->symbol = token.symbol;
3651 env->source_position = token.source_position;
3656 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3657 * interpreted as ``function with no parameter specification'', rather
3658 * than redundant parentheses around the omitted identifier. */
3659 if (look_ahead(1)->type != ')') {
3661 add_anchor_token(')');
3662 inner_types = parse_inner_declarator(env);
3663 if (inner_types != NULL) {
3664 /* All later declarators only modify the return type */
3665 env->must_be_abstract = true;
3667 rem_anchor_token(')');
3668 expect(')', end_error);
3669 } else if (!env->may_be_abstract) {
3670 errorf(HERE, "declarator must have a name");
3675 if (env->may_be_abstract)
3677 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3683 construct_type_t **const p = anchor;
3686 construct_type_t *type;
3687 switch (token.type) {
3689 scope_t *scope = NULL;
3690 if (!env->must_be_abstract) {
3691 scope = &env->parameters;
3694 type = parse_function_declarator(scope);
3698 type = parse_array_declarator();
3701 goto declarator_finished;
3704 /* insert in the middle of the list (at p) */
3705 type->base.next = *p;
3708 anchor = &type->base.next;
3711 declarator_finished:
3712 /* append inner_types at the end of the list, we don't to set anchor anymore
3713 * as it's not needed anymore */
3714 *anchor = inner_types;
3721 static type_t *construct_declarator_type(construct_type_t *construct_list,
3724 construct_type_t *iter = construct_list;
3725 for (; iter != NULL; iter = iter->base.next) {
3726 source_position_t const* const pos = &iter->base.pos;
3727 switch (iter->kind) {
3728 case CONSTRUCT_INVALID:
3730 case CONSTRUCT_FUNCTION: {
3731 construct_function_type_t *function = &iter->function;
3732 type_t *function_type = function->function_type;
3734 function_type->function.return_type = type;
3736 type_t *skipped_return_type = skip_typeref(type);
3738 if (is_type_function(skipped_return_type)) {
3739 errorf(pos, "function returning function is not allowed");
3740 } else if (is_type_array(skipped_return_type)) {
3741 errorf(pos, "function returning array is not allowed");
3743 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3744 warningf(pos, "type qualifiers in return type of function type are meaningless");
3748 /* The function type was constructed earlier. Freeing it here will
3749 * destroy other types. */
3750 type = typehash_insert(function_type);
3754 case CONSTRUCT_POINTER: {
3755 if (is_type_reference(skip_typeref(type)))
3756 errorf(pos, "cannot declare a pointer to reference");
3758 parsed_pointer_t *pointer = &iter->pointer;
3759 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3763 case CONSTRUCT_REFERENCE:
3764 if (is_type_reference(skip_typeref(type)))
3765 errorf(pos, "cannot declare a reference to reference");
3767 type = make_reference_type(type);
3770 case CONSTRUCT_ARRAY: {
3771 if (is_type_reference(skip_typeref(type)))
3772 errorf(pos, "cannot declare an array of references");
3774 parsed_array_t *array = &iter->array;
3775 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3777 expression_t *size_expression = array->size;
3778 if (size_expression != NULL) {
3780 = create_implicit_cast(size_expression, type_size_t);
3783 array_type->base.qualifiers = array->type_qualifiers;
3784 array_type->array.element_type = type;
3785 array_type->array.is_static = array->is_static;
3786 array_type->array.is_variable = array->is_variable;
3787 array_type->array.size_expression = size_expression;
3789 if (size_expression != NULL) {
3790 switch (is_constant_expression(size_expression)) {
3791 case EXPR_CLASS_CONSTANT: {
3792 long const size = fold_constant_to_int(size_expression);
3793 array_type->array.size = size;
3794 array_type->array.size_constant = true;
3795 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3796 * have a value greater than zero. */
3798 if (size < 0 || !GNU_MODE) {
3799 errorf(&size_expression->base.source_position,
3800 "size of array must be greater than zero");
3801 } else if (warning.other) {
3802 warningf(&size_expression->base.source_position,
3803 "zero length arrays are a GCC extension");
3809 case EXPR_CLASS_VARIABLE:
3810 array_type->array.is_vla = true;
3813 case EXPR_CLASS_ERROR:
3818 type_t *skipped_type = skip_typeref(type);
3820 if (is_type_incomplete(skipped_type)) {
3821 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3822 } else if (is_type_function(skipped_type)) {
3823 errorf(pos, "array of functions is not allowed");
3825 type = identify_new_type(array_type);
3829 internal_errorf(pos, "invalid type construction found");
3835 static type_t *automatic_type_conversion(type_t *orig_type);
3837 static type_t *semantic_parameter(const source_position_t *pos,
3839 const declaration_specifiers_t *specifiers,
3842 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3843 * shall be adjusted to ``qualified pointer to type'',
3845 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3846 * type'' shall be adjusted to ``pointer to function
3847 * returning type'', as in 6.3.2.1. */
3848 type = automatic_type_conversion(type);
3850 if (specifiers->is_inline && is_type_valid(type)) {
3851 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3854 /* §6.9.1:6 The declarations in the declaration list shall contain
3855 * no storage-class specifier other than register and no
3856 * initializations. */
3857 if (specifiers->thread_local || (
3858 specifiers->storage_class != STORAGE_CLASS_NONE &&
3859 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3861 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3864 /* delay test for incomplete type, because we might have (void)
3865 * which is legal but incomplete... */
3870 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3871 declarator_flags_t flags)
3873 parse_declarator_env_t env;
3874 memset(&env, 0, sizeof(env));
3875 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3877 construct_type_t *construct_type = parse_inner_declarator(&env);
3879 construct_declarator_type(construct_type, specifiers->type);
3880 type_t *type = skip_typeref(orig_type);
3882 if (construct_type != NULL) {
3883 obstack_free(&temp_obst, construct_type);
3886 attribute_t *attributes = parse_attributes(env.attributes);
3887 /* append (shared) specifier attribute behind attributes of this
3889 attribute_t **anchor = &attributes;
3890 while (*anchor != NULL)
3891 anchor = &(*anchor)->next;
3892 *anchor = specifiers->attributes;
3895 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3896 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3897 entity->base.namespc = NAMESPACE_NORMAL;
3898 entity->base.symbol = env.symbol;
3899 entity->base.source_position = env.source_position;
3900 entity->typedefe.type = orig_type;
3902 if (anonymous_entity != NULL) {
3903 if (is_type_compound(type)) {
3904 assert(anonymous_entity->compound.alias == NULL);
3905 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3906 anonymous_entity->kind == ENTITY_UNION);
3907 anonymous_entity->compound.alias = entity;
3908 anonymous_entity = NULL;
3909 } else if (is_type_enum(type)) {
3910 assert(anonymous_entity->enume.alias == NULL);
3911 assert(anonymous_entity->kind == ENTITY_ENUM);
3912 anonymous_entity->enume.alias = entity;
3913 anonymous_entity = NULL;
3917 /* create a declaration type entity */
3918 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3919 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3921 if (env.symbol != NULL) {
3922 if (specifiers->is_inline && is_type_valid(type)) {
3923 errorf(&env.source_position,
3924 "compound member '%Y' declared 'inline'", env.symbol);
3927 if (specifiers->thread_local ||
3928 specifiers->storage_class != STORAGE_CLASS_NONE) {
3929 errorf(&env.source_position,
3930 "compound member '%Y' must have no storage class",
3934 } else if (flags & DECL_IS_PARAMETER) {
3935 orig_type = semantic_parameter(&env.source_position, orig_type,
3936 specifiers, env.symbol);
3938 entity = allocate_entity_zero(ENTITY_PARAMETER);
3939 } else if (is_type_function(type)) {
3940 entity = allocate_entity_zero(ENTITY_FUNCTION);
3942 entity->function.is_inline = specifiers->is_inline;
3943 entity->function.parameters = env.parameters;
3945 if (env.symbol != NULL) {
3946 /* this needs fixes for C++ */
3947 bool in_function_scope = current_function != NULL;
3949 if (specifiers->thread_local || (
3950 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3951 specifiers->storage_class != STORAGE_CLASS_NONE &&
3952 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3954 errorf(&env.source_position,
3955 "invalid storage class for function '%Y'", env.symbol);
3959 entity = allocate_entity_zero(ENTITY_VARIABLE);
3961 entity->variable.thread_local = specifiers->thread_local;
3963 if (env.symbol != NULL) {
3964 if (specifiers->is_inline && is_type_valid(type)) {
3965 errorf(&env.source_position,
3966 "variable '%Y' declared 'inline'", env.symbol);
3969 bool invalid_storage_class = false;
3970 if (current_scope == file_scope) {
3971 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3972 specifiers->storage_class != STORAGE_CLASS_NONE &&
3973 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3974 invalid_storage_class = true;
3977 if (specifiers->thread_local &&
3978 specifiers->storage_class == STORAGE_CLASS_NONE) {
3979 invalid_storage_class = true;
3982 if (invalid_storage_class) {
3983 errorf(&env.source_position,
3984 "invalid storage class for variable '%Y'", env.symbol);
3989 if (env.symbol != NULL) {
3990 entity->base.symbol = env.symbol;
3991 entity->base.source_position = env.source_position;
3993 entity->base.source_position = specifiers->source_position;
3995 entity->base.namespc = NAMESPACE_NORMAL;
3996 entity->declaration.type = orig_type;
3997 entity->declaration.alignment = get_type_alignment(orig_type);
3998 entity->declaration.modifiers = env.modifiers;
3999 entity->declaration.attributes = attributes;
4001 storage_class_t storage_class = specifiers->storage_class;
4002 entity->declaration.declared_storage_class = storage_class;
4004 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
4005 storage_class = STORAGE_CLASS_AUTO;
4006 entity->declaration.storage_class = storage_class;
4009 if (attributes != NULL) {
4010 handle_entity_attributes(attributes, entity);
4016 static type_t *parse_abstract_declarator(type_t *base_type)
4018 parse_declarator_env_t env;
4019 memset(&env, 0, sizeof(env));
4020 env.may_be_abstract = true;
4021 env.must_be_abstract = true;
4023 construct_type_t *construct_type = parse_inner_declarator(&env);
4025 type_t *result = construct_declarator_type(construct_type, base_type);
4026 if (construct_type != NULL) {
4027 obstack_free(&temp_obst, construct_type);
4029 result = handle_type_attributes(env.attributes, result);
4035 * Check if the declaration of main is suspicious. main should be a
4036 * function with external linkage, returning int, taking either zero
4037 * arguments, two, or three arguments of appropriate types, ie.
4039 * int main([ int argc, char **argv [, char **env ] ]).
4041 * @param decl the declaration to check
4042 * @param type the function type of the declaration
4044 static void check_main(const entity_t *entity)
4046 const source_position_t *pos = &entity->base.source_position;
4047 if (entity->kind != ENTITY_FUNCTION) {
4048 warningf(pos, "'main' is not a function");
4052 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4053 warningf(pos, "'main' is normally a non-static function");
4056 type_t *type = skip_typeref(entity->declaration.type);
4057 assert(is_type_function(type));
4059 function_type_t *func_type = &type->function;
4060 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4061 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4062 func_type->return_type);
4064 const function_parameter_t *parm = func_type->parameters;
4066 type_t *const first_type = parm->type;
4067 if (!types_compatible(skip_typeref(first_type), type_int)) {
4069 "first argument of 'main' should be 'int', but is '%T'",
4074 type_t *const second_type = parm->type;
4075 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4076 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4080 type_t *const third_type = parm->type;
4081 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4082 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4086 goto warn_arg_count;
4090 warningf(pos, "'main' takes only zero, two or three arguments");
4096 * Check if a symbol is the equal to "main".
4098 static bool is_sym_main(const symbol_t *const sym)
4100 return strcmp(sym->string, "main") == 0;
4103 static void error_redefined_as_different_kind(const source_position_t *pos,
4104 const entity_t *old, entity_kind_t new_kind)
4106 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4107 get_entity_kind_name(old->kind), old->base.symbol,
4108 get_entity_kind_name(new_kind), &old->base.source_position);
4111 static bool is_entity_valid(entity_t *const ent)
4113 if (is_declaration(ent)) {
4114 return is_type_valid(skip_typeref(ent->declaration.type));
4115 } else if (ent->kind == ENTITY_TYPEDEF) {
4116 return is_type_valid(skip_typeref(ent->typedefe.type));
4121 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4123 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4124 if (attributes_equal(tattr, attr))
4131 * test wether new_list contains any attributes not included in old_list
4133 static bool has_new_attributes(const attribute_t *old_list,
4134 const attribute_t *new_list)
4136 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4137 if (!contains_attribute(old_list, attr))
4144 * Merge in attributes from an attribute list (probably from a previous
4145 * declaration with the same name). Warning: destroys the old structure
4146 * of the attribute list - don't reuse attributes after this call.
4148 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4151 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4153 if (contains_attribute(decl->attributes, attr))
4156 /* move attribute to new declarations attributes list */
4157 attr->next = decl->attributes;
4158 decl->attributes = attr;
4163 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4164 * for various problems that occur for multiple definitions
4166 entity_t *record_entity(entity_t *entity, const bool is_definition)
4168 const symbol_t *const symbol = entity->base.symbol;
4169 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4170 const source_position_t *pos = &entity->base.source_position;
4172 /* can happen in error cases */
4176 entity_t *const previous_entity = get_entity(symbol, namespc);
4177 /* pushing the same entity twice will break the stack structure */
4178 assert(previous_entity != entity);
4180 if (entity->kind == ENTITY_FUNCTION) {
4181 type_t *const orig_type = entity->declaration.type;
4182 type_t *const type = skip_typeref(orig_type);
4184 assert(is_type_function(type));
4185 if (type->function.unspecified_parameters &&
4186 warning.strict_prototypes &&
4187 previous_entity == NULL) {
4188 warningf(pos, "function declaration '%#T' is not a prototype",
4192 if (warning.main && current_scope == file_scope
4193 && is_sym_main(symbol)) {
4198 if (is_declaration(entity) &&
4199 warning.nested_externs &&
4200 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4201 current_scope != file_scope) {
4202 warningf(pos, "nested extern declaration of '%#T'",
4203 entity->declaration.type, symbol);
4206 if (previous_entity != NULL) {
4207 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4208 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4209 assert(previous_entity->kind == ENTITY_PARAMETER);
4211 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4212 entity->declaration.type, symbol,
4213 previous_entity->declaration.type, symbol,
4214 &previous_entity->base.source_position);
4218 if (previous_entity->base.parent_scope == current_scope) {
4219 if (previous_entity->kind != entity->kind) {
4220 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4221 error_redefined_as_different_kind(pos, previous_entity,
4226 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4227 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4228 symbol, &previous_entity->base.source_position);
4231 if (previous_entity->kind == ENTITY_TYPEDEF) {
4232 /* TODO: C++ allows this for exactly the same type */
4233 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4234 symbol, &previous_entity->base.source_position);
4238 /* at this point we should have only VARIABLES or FUNCTIONS */
4239 assert(is_declaration(previous_entity) && is_declaration(entity));
4241 declaration_t *const prev_decl = &previous_entity->declaration;
4242 declaration_t *const decl = &entity->declaration;
4244 /* can happen for K&R style declarations */
4245 if (prev_decl->type == NULL &&
4246 previous_entity->kind == ENTITY_PARAMETER &&
4247 entity->kind == ENTITY_PARAMETER) {
4248 prev_decl->type = decl->type;
4249 prev_decl->storage_class = decl->storage_class;
4250 prev_decl->declared_storage_class = decl->declared_storage_class;
4251 prev_decl->modifiers = decl->modifiers;
4252 return previous_entity;
4255 type_t *const orig_type = decl->type;
4256 assert(orig_type != NULL);
4257 type_t *const type = skip_typeref(orig_type);
4258 type_t *const prev_type = skip_typeref(prev_decl->type);
4260 if (!types_compatible(type, prev_type)) {
4262 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4263 orig_type, symbol, prev_decl->type, symbol,
4264 &previous_entity->base.source_position);
4266 unsigned old_storage_class = prev_decl->storage_class;
4268 if (warning.redundant_decls &&
4271 !(prev_decl->modifiers & DM_USED) &&
4272 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4273 warningf(&previous_entity->base.source_position,
4274 "unnecessary static forward declaration for '%#T'",
4275 prev_decl->type, symbol);
4278 storage_class_t new_storage_class = decl->storage_class;
4280 /* pretend no storage class means extern for function
4281 * declarations (except if the previous declaration is neither
4282 * none nor extern) */
4283 if (entity->kind == ENTITY_FUNCTION) {
4284 /* the previous declaration could have unspecified parameters or
4285 * be a typedef, so use the new type */
4286 if (prev_type->function.unspecified_parameters || is_definition)
4287 prev_decl->type = type;
4289 switch (old_storage_class) {
4290 case STORAGE_CLASS_NONE:
4291 old_storage_class = STORAGE_CLASS_EXTERN;
4294 case STORAGE_CLASS_EXTERN:
4295 if (is_definition) {
4296 if (warning.missing_prototypes &&
4297 prev_type->function.unspecified_parameters &&
4298 !is_sym_main(symbol)) {
4299 warningf(pos, "no previous prototype for '%#T'",
4302 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4303 new_storage_class = STORAGE_CLASS_EXTERN;
4310 } else if (is_type_incomplete(prev_type)) {
4311 prev_decl->type = type;
4314 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4315 new_storage_class == STORAGE_CLASS_EXTERN) {
4317 warn_redundant_declaration: ;
4319 = has_new_attributes(prev_decl->attributes,
4321 if (has_new_attrs) {
4322 merge_in_attributes(decl, prev_decl->attributes);
4323 } else if (!is_definition &&
4324 warning.redundant_decls &&
4325 is_type_valid(prev_type) &&
4326 strcmp(previous_entity->base.source_position.input_name,
4327 "<builtin>") != 0) {
4329 "redundant declaration for '%Y' (declared %P)",
4330 symbol, &previous_entity->base.source_position);
4332 } else if (current_function == NULL) {
4333 if (old_storage_class != STORAGE_CLASS_STATIC &&
4334 new_storage_class == STORAGE_CLASS_STATIC) {
4336 "static declaration of '%Y' follows non-static declaration (declared %P)",
4337 symbol, &previous_entity->base.source_position);
4338 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4339 prev_decl->storage_class = STORAGE_CLASS_NONE;
4340 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4342 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4344 goto error_redeclaration;
4345 goto warn_redundant_declaration;
4347 } else if (is_type_valid(prev_type)) {
4348 if (old_storage_class == new_storage_class) {
4349 error_redeclaration:
4350 errorf(pos, "redeclaration of '%Y' (declared %P)",
4351 symbol, &previous_entity->base.source_position);
4354 "redeclaration of '%Y' with different linkage (declared %P)",
4355 symbol, &previous_entity->base.source_position);
4360 prev_decl->modifiers |= decl->modifiers;
4361 if (entity->kind == ENTITY_FUNCTION) {
4362 previous_entity->function.is_inline |= entity->function.is_inline;
4364 return previous_entity;
4367 if (warning.shadow) {
4368 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4369 get_entity_kind_name(entity->kind), symbol,
4370 get_entity_kind_name(previous_entity->kind),
4371 &previous_entity->base.source_position);
4375 if (entity->kind == ENTITY_FUNCTION) {
4376 if (is_definition &&
4377 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4378 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4379 warningf(pos, "no previous prototype for '%#T'",
4380 entity->declaration.type, symbol);
4381 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4382 warningf(pos, "no previous declaration for '%#T'",
4383 entity->declaration.type, symbol);
4386 } else if (warning.missing_declarations &&
4387 entity->kind == ENTITY_VARIABLE &&
4388 current_scope == file_scope) {
4389 declaration_t *declaration = &entity->declaration;
4390 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4391 warningf(pos, "no previous declaration for '%#T'",
4392 declaration->type, symbol);
4397 assert(entity->base.parent_scope == NULL);
4398 assert(current_scope != NULL);
4400 entity->base.parent_scope = current_scope;
4401 entity->base.namespc = NAMESPACE_NORMAL;
4402 environment_push(entity);
4403 append_entity(current_scope, entity);
4408 static void parser_error_multiple_definition(entity_t *entity,
4409 const source_position_t *source_position)
4411 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4412 entity->base.symbol, &entity->base.source_position);
4415 static bool is_declaration_specifier(const token_t *token,
4416 bool only_specifiers_qualifiers)
4418 switch (token->type) {
4423 return is_typedef_symbol(token->symbol);
4425 case T___extension__:
4427 return !only_specifiers_qualifiers;
4434 static void parse_init_declarator_rest(entity_t *entity)
4436 type_t *orig_type = type_error_type;
4438 if (entity->base.kind == ENTITY_TYPEDEF) {
4439 errorf(&entity->base.source_position,
4440 "typedef '%Y' is initialized (use __typeof__ instead)",
4441 entity->base.symbol);
4443 assert(is_declaration(entity));
4444 orig_type = entity->declaration.type;
4448 type_t *type = skip_typeref(orig_type);
4450 if (entity->kind == ENTITY_VARIABLE
4451 && entity->variable.initializer != NULL) {
4452 parser_error_multiple_definition(entity, HERE);
4455 declaration_t *const declaration = &entity->declaration;
4456 bool must_be_constant = false;
4457 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4458 entity->base.parent_scope == file_scope) {
4459 must_be_constant = true;
4462 if (is_type_function(type)) {
4463 errorf(&entity->base.source_position,
4464 "function '%#T' is initialized like a variable",
4465 orig_type, entity->base.symbol);
4466 orig_type = type_error_type;
4469 parse_initializer_env_t env;
4470 env.type = orig_type;
4471 env.must_be_constant = must_be_constant;
4472 env.entity = entity;
4473 current_init_decl = entity;
4475 initializer_t *initializer = parse_initializer(&env);
4476 current_init_decl = NULL;
4478 if (entity->kind == ENTITY_VARIABLE) {
4479 /* §6.7.5:22 array initializers for arrays with unknown size
4480 * determine the array type size */
4481 declaration->type = env.type;
4482 entity->variable.initializer = initializer;
4486 /* parse rest of a declaration without any declarator */
4487 static void parse_anonymous_declaration_rest(
4488 const declaration_specifiers_t *specifiers)
4491 anonymous_entity = NULL;
4493 if (warning.other) {
4494 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4495 specifiers->thread_local) {
4496 warningf(&specifiers->source_position,
4497 "useless storage class in empty declaration");
4500 type_t *type = specifiers->type;
4501 switch (type->kind) {
4502 case TYPE_COMPOUND_STRUCT:
4503 case TYPE_COMPOUND_UNION: {
4504 if (type->compound.compound->base.symbol == NULL) {
4505 warningf(&specifiers->source_position,
4506 "unnamed struct/union that defines no instances");
4515 warningf(&specifiers->source_position, "empty declaration");
4521 static void check_variable_type_complete(entity_t *ent)
4523 if (ent->kind != ENTITY_VARIABLE)
4526 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4527 * type for the object shall be complete [...] */
4528 declaration_t *decl = &ent->declaration;
4529 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4530 decl->storage_class == STORAGE_CLASS_STATIC)
4533 type_t *const orig_type = decl->type;
4534 type_t *const type = skip_typeref(orig_type);
4535 if (!is_type_incomplete(type))
4538 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4539 * are given length one. */
4540 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4541 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4545 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4546 orig_type, ent->base.symbol);
4550 static void parse_declaration_rest(entity_t *ndeclaration,
4551 const declaration_specifiers_t *specifiers,
4552 parsed_declaration_func finished_declaration,
4553 declarator_flags_t flags)
4555 add_anchor_token(';');
4556 add_anchor_token(',');
4558 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4560 if (token.type == '=') {
4561 parse_init_declarator_rest(entity);
4562 } else if (entity->kind == ENTITY_VARIABLE) {
4563 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4564 * [...] where the extern specifier is explicitly used. */
4565 declaration_t *decl = &entity->declaration;
4566 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4567 type_t *type = decl->type;
4568 if (is_type_reference(skip_typeref(type))) {
4569 errorf(&entity->base.source_position,
4570 "reference '%#T' must be initialized",
4571 type, entity->base.symbol);
4576 check_variable_type_complete(entity);
4581 add_anchor_token('=');
4582 ndeclaration = parse_declarator(specifiers, flags);
4583 rem_anchor_token('=');
4585 expect(';', end_error);
4588 anonymous_entity = NULL;
4589 rem_anchor_token(';');
4590 rem_anchor_token(',');
4593 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4595 symbol_t *symbol = entity->base.symbol;
4596 if (symbol == NULL) {
4597 errorf(HERE, "anonymous declaration not valid as function parameter");
4601 assert(entity->base.namespc == NAMESPACE_NORMAL);
4602 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4603 if (previous_entity == NULL
4604 || previous_entity->base.parent_scope != current_scope) {
4605 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4610 if (is_definition) {
4611 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4614 return record_entity(entity, false);
4617 static void parse_declaration(parsed_declaration_func finished_declaration,
4618 declarator_flags_t flags)
4620 declaration_specifiers_t specifiers;
4621 memset(&specifiers, 0, sizeof(specifiers));
4623 add_anchor_token(';');
4624 parse_declaration_specifiers(&specifiers);
4625 rem_anchor_token(';');
4627 if (token.type == ';') {
4628 parse_anonymous_declaration_rest(&specifiers);
4630 entity_t *entity = parse_declarator(&specifiers, flags);
4631 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4636 static type_t *get_default_promoted_type(type_t *orig_type)
4638 type_t *result = orig_type;
4640 type_t *type = skip_typeref(orig_type);
4641 if (is_type_integer(type)) {
4642 result = promote_integer(type);
4643 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4644 result = type_double;
4650 static void parse_kr_declaration_list(entity_t *entity)
4652 if (entity->kind != ENTITY_FUNCTION)
4655 type_t *type = skip_typeref(entity->declaration.type);
4656 assert(is_type_function(type));
4657 if (!type->function.kr_style_parameters)
4660 add_anchor_token('{');
4662 /* push function parameters */
4663 size_t const top = environment_top();
4664 scope_t *old_scope = scope_push(&entity->function.parameters);
4666 entity_t *parameter = entity->function.parameters.entities;
4667 for ( ; parameter != NULL; parameter = parameter->base.next) {
4668 assert(parameter->base.parent_scope == NULL);
4669 parameter->base.parent_scope = current_scope;
4670 environment_push(parameter);
4673 /* parse declaration list */
4675 switch (token.type) {
4677 case T___extension__:
4678 /* This covers symbols, which are no type, too, and results in
4679 * better error messages. The typical cases are misspelled type
4680 * names and missing includes. */
4682 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4690 /* pop function parameters */
4691 assert(current_scope == &entity->function.parameters);
4692 scope_pop(old_scope);
4693 environment_pop_to(top);
4695 /* update function type */
4696 type_t *new_type = duplicate_type(type);
4698 function_parameter_t *parameters = NULL;
4699 function_parameter_t **anchor = ¶meters;
4701 /* did we have an earlier prototype? */
4702 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4703 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4706 function_parameter_t *proto_parameter = NULL;
4707 if (proto_type != NULL) {
4708 type_t *proto_type_type = proto_type->declaration.type;
4709 proto_parameter = proto_type_type->function.parameters;
4710 /* If a K&R function definition has a variadic prototype earlier, then
4711 * make the function definition variadic, too. This should conform to
4712 * §6.7.5.3:15 and §6.9.1:8. */
4713 new_type->function.variadic = proto_type_type->function.variadic;
4715 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4717 new_type->function.unspecified_parameters = true;
4720 bool need_incompatible_warning = false;
4721 parameter = entity->function.parameters.entities;
4722 for (; parameter != NULL; parameter = parameter->base.next,
4724 proto_parameter == NULL ? NULL : proto_parameter->next) {
4725 if (parameter->kind != ENTITY_PARAMETER)
4728 type_t *parameter_type = parameter->declaration.type;
4729 if (parameter_type == NULL) {
4731 errorf(HERE, "no type specified for function parameter '%Y'",
4732 parameter->base.symbol);
4733 parameter_type = type_error_type;
4735 if (warning.implicit_int) {
4736 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4737 parameter->base.symbol);
4739 parameter_type = type_int;
4741 parameter->declaration.type = parameter_type;
4744 semantic_parameter_incomplete(parameter);
4746 /* we need the default promoted types for the function type */
4747 type_t *not_promoted = parameter_type;
4748 parameter_type = get_default_promoted_type(parameter_type);
4750 /* gcc special: if the type of the prototype matches the unpromoted
4751 * type don't promote */
4752 if (!strict_mode && proto_parameter != NULL) {
4753 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4754 type_t *promo_skip = skip_typeref(parameter_type);
4755 type_t *param_skip = skip_typeref(not_promoted);
4756 if (!types_compatible(proto_p_type, promo_skip)
4757 && types_compatible(proto_p_type, param_skip)) {
4759 need_incompatible_warning = true;
4760 parameter_type = not_promoted;
4763 function_parameter_t *const parameter
4764 = allocate_parameter(parameter_type);
4766 *anchor = parameter;
4767 anchor = ¶meter->next;
4770 new_type->function.parameters = parameters;
4771 new_type = identify_new_type(new_type);
4773 if (warning.other && need_incompatible_warning) {
4774 type_t *proto_type_type = proto_type->declaration.type;
4776 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4777 proto_type_type, proto_type->base.symbol,
4778 new_type, entity->base.symbol,
4779 &proto_type->base.source_position);
4782 entity->declaration.type = new_type;
4784 rem_anchor_token('{');
4787 static bool first_err = true;
4790 * When called with first_err set, prints the name of the current function,
4793 static void print_in_function(void)
4797 diagnosticf("%s: In function '%Y':\n",
4798 current_function->base.base.source_position.input_name,
4799 current_function->base.base.symbol);
4804 * Check if all labels are defined in the current function.
4805 * Check if all labels are used in the current function.
4807 static void check_labels(void)
4809 for (const goto_statement_t *goto_statement = goto_first;
4810 goto_statement != NULL;
4811 goto_statement = goto_statement->next) {
4812 /* skip computed gotos */
4813 if (goto_statement->expression != NULL)
4816 label_t *label = goto_statement->label;
4819 if (label->base.source_position.input_name == NULL) {
4820 print_in_function();
4821 errorf(&goto_statement->base.source_position,
4822 "label '%Y' used but not defined", label->base.symbol);
4826 if (warning.unused_label) {
4827 for (const label_statement_t *label_statement = label_first;
4828 label_statement != NULL;
4829 label_statement = label_statement->next) {
4830 label_t *label = label_statement->label;
4832 if (! label->used) {
4833 print_in_function();
4834 warningf(&label_statement->base.source_position,
4835 "label '%Y' defined but not used", label->base.symbol);
4841 static void warn_unused_entity(entity_t *entity, entity_t *last)
4843 entity_t const *const end = last != NULL ? last->base.next : NULL;
4844 for (; entity != end; entity = entity->base.next) {
4845 if (!is_declaration(entity))
4848 declaration_t *declaration = &entity->declaration;
4849 if (declaration->implicit)
4852 if (!declaration->used) {
4853 print_in_function();
4854 const char *what = get_entity_kind_name(entity->kind);
4855 warningf(&entity->base.source_position, "%s '%Y' is unused",
4856 what, entity->base.symbol);
4857 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4858 print_in_function();
4859 const char *what = get_entity_kind_name(entity->kind);
4860 warningf(&entity->base.source_position, "%s '%Y' is never read",
4861 what, entity->base.symbol);
4866 static void check_unused_variables(statement_t *const stmt, void *const env)
4870 switch (stmt->kind) {
4871 case STATEMENT_DECLARATION: {
4872 declaration_statement_t const *const decls = &stmt->declaration;
4873 warn_unused_entity(decls->declarations_begin,
4874 decls->declarations_end);
4879 warn_unused_entity(stmt->fors.scope.entities, NULL);
4888 * Check declarations of current_function for unused entities.
4890 static void check_declarations(void)
4892 if (warning.unused_parameter) {
4893 const scope_t *scope = ¤t_function->parameters;
4895 /* do not issue unused warnings for main */
4896 if (!is_sym_main(current_function->base.base.symbol)) {
4897 warn_unused_entity(scope->entities, NULL);
4900 if (warning.unused_variable) {
4901 walk_statements(current_function->statement, check_unused_variables,
4906 static int determine_truth(expression_t const* const cond)
4909 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4910 fold_constant_to_bool(cond) ? 1 :
4914 static void check_reachable(statement_t *);
4915 static bool reaches_end;
4917 static bool expression_returns(expression_t const *const expr)
4919 switch (expr->kind) {
4921 expression_t const *const func = expr->call.function;
4922 if (func->kind == EXPR_REFERENCE) {
4923 entity_t *entity = func->reference.entity;
4924 if (entity->kind == ENTITY_FUNCTION
4925 && entity->declaration.modifiers & DM_NORETURN)
4929 if (!expression_returns(func))
4932 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4933 if (!expression_returns(arg->expression))
4940 case EXPR_REFERENCE:
4941 case EXPR_REFERENCE_ENUM_VALUE:
4943 case EXPR_STRING_LITERAL:
4944 case EXPR_WIDE_STRING_LITERAL:
4945 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4946 case EXPR_LABEL_ADDRESS:
4947 case EXPR_CLASSIFY_TYPE:
4948 case EXPR_SIZEOF: // TODO handle obscure VLA case
4951 case EXPR_BUILTIN_CONSTANT_P:
4952 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4957 case EXPR_STATEMENT: {
4958 bool old_reaches_end = reaches_end;
4959 reaches_end = false;
4960 check_reachable(expr->statement.statement);
4961 bool returns = reaches_end;
4962 reaches_end = old_reaches_end;
4966 case EXPR_CONDITIONAL:
4967 // TODO handle constant expression
4969 if (!expression_returns(expr->conditional.condition))
4972 if (expr->conditional.true_expression != NULL
4973 && expression_returns(expr->conditional.true_expression))
4976 return expression_returns(expr->conditional.false_expression);
4979 return expression_returns(expr->select.compound);
4981 case EXPR_ARRAY_ACCESS:
4983 expression_returns(expr->array_access.array_ref) &&
4984 expression_returns(expr->array_access.index);
4987 return expression_returns(expr->va_starte.ap);
4990 return expression_returns(expr->va_arge.ap);
4993 return expression_returns(expr->va_copye.src);
4995 EXPR_UNARY_CASES_MANDATORY
4996 return expression_returns(expr->unary.value);
4998 case EXPR_UNARY_THROW:
5002 // TODO handle constant lhs of && and ||
5004 expression_returns(expr->binary.left) &&
5005 expression_returns(expr->binary.right);
5011 panic("unhandled expression");
5014 static bool initializer_returns(initializer_t const *const init)
5016 switch (init->kind) {
5017 case INITIALIZER_VALUE:
5018 return expression_returns(init->value.value);
5020 case INITIALIZER_LIST: {
5021 initializer_t * const* i = init->list.initializers;
5022 initializer_t * const* const end = i + init->list.len;
5023 bool returns = true;
5024 for (; i != end; ++i) {
5025 if (!initializer_returns(*i))
5031 case INITIALIZER_STRING:
5032 case INITIALIZER_WIDE_STRING:
5033 case INITIALIZER_DESIGNATOR: // designators have no payload
5036 panic("unhandled initializer");
5039 static bool noreturn_candidate;
5041 static void check_reachable(statement_t *const stmt)
5043 if (stmt->base.reachable)
5045 if (stmt->kind != STATEMENT_DO_WHILE)
5046 stmt->base.reachable = true;
5048 statement_t *last = stmt;
5050 switch (stmt->kind) {
5051 case STATEMENT_INVALID:
5052 case STATEMENT_EMPTY:
5054 next = stmt->base.next;
5057 case STATEMENT_DECLARATION: {
5058 declaration_statement_t const *const decl = &stmt->declaration;
5059 entity_t const * ent = decl->declarations_begin;
5060 entity_t const *const last = decl->declarations_end;
5062 for (;; ent = ent->base.next) {
5063 if (ent->kind == ENTITY_VARIABLE &&
5064 ent->variable.initializer != NULL &&
5065 !initializer_returns(ent->variable.initializer)) {
5072 next = stmt->base.next;
5076 case STATEMENT_COMPOUND:
5077 next = stmt->compound.statements;
5079 next = stmt->base.next;
5082 case STATEMENT_RETURN: {
5083 expression_t const *const val = stmt->returns.value;
5084 if (val == NULL || expression_returns(val))
5085 noreturn_candidate = false;
5089 case STATEMENT_IF: {
5090 if_statement_t const *const ifs = &stmt->ifs;
5091 expression_t const *const cond = ifs->condition;
5093 if (!expression_returns(cond))
5096 int const val = determine_truth(cond);
5099 check_reachable(ifs->true_statement);
5104 if (ifs->false_statement != NULL) {
5105 check_reachable(ifs->false_statement);
5109 next = stmt->base.next;
5113 case STATEMENT_SWITCH: {
5114 switch_statement_t const *const switchs = &stmt->switchs;
5115 expression_t const *const expr = switchs->expression;
5117 if (!expression_returns(expr))
5120 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
5121 long const val = fold_constant_to_int(expr);
5122 case_label_statement_t * defaults = NULL;
5123 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5124 if (i->expression == NULL) {
5129 if (i->first_case <= val && val <= i->last_case) {
5130 check_reachable((statement_t*)i);
5135 if (defaults != NULL) {
5136 check_reachable((statement_t*)defaults);
5140 bool has_default = false;
5141 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5142 if (i->expression == NULL)
5145 check_reachable((statement_t*)i);
5152 next = stmt->base.next;
5156 case STATEMENT_EXPRESSION: {
5157 /* Check for noreturn function call */
5158 expression_t const *const expr = stmt->expression.expression;
5159 if (!expression_returns(expr))
5162 next = stmt->base.next;
5166 case STATEMENT_CONTINUE:
5167 for (statement_t *parent = stmt;;) {
5168 parent = parent->base.parent;
5169 if (parent == NULL) /* continue not within loop */
5173 switch (parent->kind) {
5174 case STATEMENT_WHILE: goto continue_while;
5175 case STATEMENT_DO_WHILE: goto continue_do_while;
5176 case STATEMENT_FOR: goto continue_for;
5182 case STATEMENT_BREAK:
5183 for (statement_t *parent = stmt;;) {
5184 parent = parent->base.parent;
5185 if (parent == NULL) /* break not within loop/switch */
5188 switch (parent->kind) {
5189 case STATEMENT_SWITCH:
5190 case STATEMENT_WHILE:
5191 case STATEMENT_DO_WHILE:
5194 next = parent->base.next;
5195 goto found_break_parent;
5203 case STATEMENT_GOTO:
5204 if (stmt->gotos.expression) {
5205 if (!expression_returns(stmt->gotos.expression))
5208 statement_t *parent = stmt->base.parent;
5209 if (parent == NULL) /* top level goto */
5213 next = stmt->gotos.label->statement;
5214 if (next == NULL) /* missing label */
5219 case STATEMENT_LABEL:
5220 next = stmt->label.statement;
5223 case STATEMENT_CASE_LABEL:
5224 next = stmt->case_label.statement;
5227 case STATEMENT_WHILE: {
5228 while_statement_t const *const whiles = &stmt->whiles;
5229 expression_t const *const cond = whiles->condition;
5231 if (!expression_returns(cond))
5234 int const val = determine_truth(cond);
5237 check_reachable(whiles->body);
5242 next = stmt->base.next;
5246 case STATEMENT_DO_WHILE:
5247 next = stmt->do_while.body;
5250 case STATEMENT_FOR: {
5251 for_statement_t *const fors = &stmt->fors;
5253 if (fors->condition_reachable)
5255 fors->condition_reachable = true;
5257 expression_t const *const cond = fors->condition;
5262 } else if (expression_returns(cond)) {
5263 val = determine_truth(cond);
5269 check_reachable(fors->body);
5274 next = stmt->base.next;
5278 case STATEMENT_MS_TRY: {
5279 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5280 check_reachable(ms_try->try_statement);
5281 next = ms_try->final_statement;
5285 case STATEMENT_LEAVE: {
5286 statement_t *parent = stmt;
5288 parent = parent->base.parent;
5289 if (parent == NULL) /* __leave not within __try */
5292 if (parent->kind == STATEMENT_MS_TRY) {
5294 next = parent->ms_try.final_statement;
5302 panic("invalid statement kind");
5305 while (next == NULL) {
5306 next = last->base.parent;
5308 noreturn_candidate = false;
5310 type_t *const type = skip_typeref(current_function->base.type);
5311 assert(is_type_function(type));
5312 type_t *const ret = skip_typeref(type->function.return_type);
5313 if (warning.return_type &&
5314 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5315 is_type_valid(ret) &&
5316 !is_sym_main(current_function->base.base.symbol)) {
5317 warningf(&stmt->base.source_position,
5318 "control reaches end of non-void function");
5323 switch (next->kind) {
5324 case STATEMENT_INVALID:
5325 case STATEMENT_EMPTY:
5326 case STATEMENT_DECLARATION:
5327 case STATEMENT_EXPRESSION:
5329 case STATEMENT_RETURN:
5330 case STATEMENT_CONTINUE:
5331 case STATEMENT_BREAK:
5332 case STATEMENT_GOTO:
5333 case STATEMENT_LEAVE:
5334 panic("invalid control flow in function");
5336 case STATEMENT_COMPOUND:
5337 if (next->compound.stmt_expr) {
5343 case STATEMENT_SWITCH:
5344 case STATEMENT_LABEL:
5345 case STATEMENT_CASE_LABEL:
5347 next = next->base.next;
5350 case STATEMENT_WHILE: {
5352 if (next->base.reachable)
5354 next->base.reachable = true;
5356 while_statement_t const *const whiles = &next->whiles;
5357 expression_t const *const cond = whiles->condition;
5359 if (!expression_returns(cond))
5362 int const val = determine_truth(cond);
5365 check_reachable(whiles->body);
5371 next = next->base.next;
5375 case STATEMENT_DO_WHILE: {
5377 if (next->base.reachable)
5379 next->base.reachable = true;
5381 do_while_statement_t const *const dw = &next->do_while;
5382 expression_t const *const cond = dw->condition;
5384 if (!expression_returns(cond))
5387 int const val = determine_truth(cond);
5390 check_reachable(dw->body);
5396 next = next->base.next;
5400 case STATEMENT_FOR: {
5402 for_statement_t *const fors = &next->fors;
5404 fors->step_reachable = true;
5406 if (fors->condition_reachable)
5408 fors->condition_reachable = true;
5410 expression_t const *const cond = fors->condition;
5415 } else if (expression_returns(cond)) {
5416 val = determine_truth(cond);
5422 check_reachable(fors->body);
5428 next = next->base.next;
5432 case STATEMENT_MS_TRY:
5434 next = next->ms_try.final_statement;
5439 check_reachable(next);
5442 static void check_unreachable(statement_t* const stmt, void *const env)
5446 switch (stmt->kind) {
5447 case STATEMENT_DO_WHILE:
5448 if (!stmt->base.reachable) {
5449 expression_t const *const cond = stmt->do_while.condition;
5450 if (determine_truth(cond) >= 0) {
5451 warningf(&cond->base.source_position,
5452 "condition of do-while-loop is unreachable");
5457 case STATEMENT_FOR: {
5458 for_statement_t const* const fors = &stmt->fors;
5460 // if init and step are unreachable, cond is unreachable, too
5461 if (!stmt->base.reachable && !fors->step_reachable) {
5462 warningf(&stmt->base.source_position, "statement is unreachable");
5464 if (!stmt->base.reachable && fors->initialisation != NULL) {
5465 warningf(&fors->initialisation->base.source_position,
5466 "initialisation of for-statement is unreachable");
5469 if (!fors->condition_reachable && fors->condition != NULL) {
5470 warningf(&fors->condition->base.source_position,
5471 "condition of for-statement is unreachable");
5474 if (!fors->step_reachable && fors->step != NULL) {
5475 warningf(&fors->step->base.source_position,
5476 "step of for-statement is unreachable");
5482 case STATEMENT_COMPOUND:
5483 if (stmt->compound.statements != NULL)
5485 goto warn_unreachable;
5487 case STATEMENT_DECLARATION: {
5488 /* Only warn if there is at least one declarator with an initializer.
5489 * This typically occurs in switch statements. */
5490 declaration_statement_t const *const decl = &stmt->declaration;
5491 entity_t const * ent = decl->declarations_begin;
5492 entity_t const *const last = decl->declarations_end;
5494 for (;; ent = ent->base.next) {
5495 if (ent->kind == ENTITY_VARIABLE &&
5496 ent->variable.initializer != NULL) {
5497 goto warn_unreachable;
5507 if (!stmt->base.reachable)
5508 warningf(&stmt->base.source_position, "statement is unreachable");
5513 static void parse_external_declaration(void)
5515 /* function-definitions and declarations both start with declaration
5517 declaration_specifiers_t specifiers;
5518 memset(&specifiers, 0, sizeof(specifiers));
5520 add_anchor_token(';');
5521 parse_declaration_specifiers(&specifiers);
5522 rem_anchor_token(';');
5524 /* must be a declaration */
5525 if (token.type == ';') {
5526 parse_anonymous_declaration_rest(&specifiers);
5530 add_anchor_token(',');
5531 add_anchor_token('=');
5532 add_anchor_token(';');
5533 add_anchor_token('{');
5535 /* declarator is common to both function-definitions and declarations */
5536 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5538 rem_anchor_token('{');
5539 rem_anchor_token(';');
5540 rem_anchor_token('=');
5541 rem_anchor_token(',');
5543 /* must be a declaration */
5544 switch (token.type) {
5548 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5553 /* must be a function definition */
5554 parse_kr_declaration_list(ndeclaration);
5556 if (token.type != '{') {
5557 parse_error_expected("while parsing function definition", '{', NULL);
5558 eat_until_matching_token(';');
5562 assert(is_declaration(ndeclaration));
5563 type_t *const orig_type = ndeclaration->declaration.type;
5564 type_t * type = skip_typeref(orig_type);
5566 if (!is_type_function(type)) {
5567 if (is_type_valid(type)) {
5568 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5569 type, ndeclaration->base.symbol);
5573 } else if (is_typeref(orig_type)) {
5575 errorf(&ndeclaration->base.source_position,
5576 "type of function definition '%#T' is a typedef",
5577 orig_type, ndeclaration->base.symbol);
5580 if (warning.aggregate_return &&
5581 is_type_compound(skip_typeref(type->function.return_type))) {
5582 warningf(HERE, "function '%Y' returns an aggregate",
5583 ndeclaration->base.symbol);
5585 if (warning.traditional && !type->function.unspecified_parameters) {
5586 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5587 ndeclaration->base.symbol);
5589 if (warning.old_style_definition && type->function.unspecified_parameters) {
5590 warningf(HERE, "old-style function definition '%Y'",
5591 ndeclaration->base.symbol);
5594 /* §6.7.5.3:14 a function definition with () means no
5595 * parameters (and not unspecified parameters) */
5596 if (type->function.unspecified_parameters &&
5597 type->function.parameters == NULL) {
5598 type_t *copy = duplicate_type(type);
5599 copy->function.unspecified_parameters = false;
5600 type = identify_new_type(copy);
5602 ndeclaration->declaration.type = type;
5605 entity_t *const entity = record_entity(ndeclaration, true);
5606 assert(entity->kind == ENTITY_FUNCTION);
5607 assert(ndeclaration->kind == ENTITY_FUNCTION);
5609 function_t *function = &entity->function;
5610 if (ndeclaration != entity) {
5611 function->parameters = ndeclaration->function.parameters;
5613 assert(is_declaration(entity));
5614 type = skip_typeref(entity->declaration.type);
5616 /* push function parameters and switch scope */
5617 size_t const top = environment_top();
5618 scope_t *old_scope = scope_push(&function->parameters);
5620 entity_t *parameter = function->parameters.entities;
5621 for (; parameter != NULL; parameter = parameter->base.next) {
5622 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5623 parameter->base.parent_scope = current_scope;
5625 assert(parameter->base.parent_scope == NULL
5626 || parameter->base.parent_scope == current_scope);
5627 parameter->base.parent_scope = current_scope;
5628 if (parameter->base.symbol == NULL) {
5629 errorf(¶meter->base.source_position, "parameter name omitted");
5632 environment_push(parameter);
5635 if (function->statement != NULL) {
5636 parser_error_multiple_definition(entity, HERE);
5639 /* parse function body */
5640 int label_stack_top = label_top();
5641 function_t *old_current_function = current_function;
5642 entity_t *old_current_entity = current_entity;
5643 current_function = function;
5644 current_entity = (entity_t*) function;
5645 current_parent = NULL;
5648 goto_anchor = &goto_first;
5650 label_anchor = &label_first;
5652 statement_t *const body = parse_compound_statement(false);
5653 function->statement = body;
5656 check_declarations();
5657 if (warning.return_type ||
5658 warning.unreachable_code ||
5659 (warning.missing_noreturn
5660 && !(function->base.modifiers & DM_NORETURN))) {
5661 noreturn_candidate = true;
5662 check_reachable(body);
5663 if (warning.unreachable_code)
5664 walk_statements(body, check_unreachable, NULL);
5665 if (warning.missing_noreturn &&
5666 noreturn_candidate &&
5667 !(function->base.modifiers & DM_NORETURN)) {
5668 warningf(&body->base.source_position,
5669 "function '%#T' is candidate for attribute 'noreturn'",
5670 type, entity->base.symbol);
5674 assert(current_parent == NULL);
5675 assert(current_function == function);
5676 assert(current_entity == (entity_t*) function);
5677 current_entity = old_current_entity;
5678 current_function = old_current_function;
5679 label_pop_to(label_stack_top);
5682 assert(current_scope == &function->parameters);
5683 scope_pop(old_scope);
5684 environment_pop_to(top);
5687 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5688 source_position_t *source_position,
5689 const symbol_t *symbol)
5691 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5693 type->bitfield.base_type = base_type;
5694 type->bitfield.size_expression = size;
5697 type_t *skipped_type = skip_typeref(base_type);
5698 if (!is_type_integer(skipped_type)) {
5699 errorf(HERE, "bitfield base type '%T' is not an integer type",
5703 bit_size = get_type_size(base_type) * 8;
5706 if (is_constant_expression(size) == EXPR_CLASS_CONSTANT) {
5707 long v = fold_constant_to_int(size);
5708 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5711 errorf(source_position, "negative width in bit-field '%Y'",
5713 } else if (v == 0 && symbol != NULL) {
5714 errorf(source_position, "zero width for bit-field '%Y'",
5716 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5717 errorf(source_position, "width of '%Y' exceeds its type",
5720 type->bitfield.bit_size = v;
5727 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5729 entity_t *iter = compound->members.entities;
5730 for (; iter != NULL; iter = iter->base.next) {
5731 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5734 if (iter->base.symbol == symbol) {
5736 } else if (iter->base.symbol == NULL) {
5737 /* search in anonymous structs and unions */
5738 type_t *type = skip_typeref(iter->declaration.type);
5739 if (is_type_compound(type)) {
5740 if (find_compound_entry(type->compound.compound, symbol)
5751 static void check_deprecated(const source_position_t *source_position,
5752 const entity_t *entity)
5754 if (!warning.deprecated_declarations)
5756 if (!is_declaration(entity))
5758 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5761 char const *const prefix = get_entity_kind_name(entity->kind);
5762 const char *deprecated_string
5763 = get_deprecated_string(entity->declaration.attributes);
5764 if (deprecated_string != NULL) {
5765 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5766 prefix, entity->base.symbol, &entity->base.source_position,
5769 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5770 entity->base.symbol, &entity->base.source_position);
5775 static expression_t *create_select(const source_position_t *pos,
5777 type_qualifiers_t qualifiers,
5780 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5782 check_deprecated(pos, entry);
5784 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5785 select->select.compound = addr;
5786 select->select.compound_entry = entry;
5788 type_t *entry_type = entry->declaration.type;
5789 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5791 /* we always do the auto-type conversions; the & and sizeof parser contains
5792 * code to revert this! */
5793 select->base.type = automatic_type_conversion(res_type);
5794 if (res_type->kind == TYPE_BITFIELD) {
5795 select->base.type = res_type->bitfield.base_type;
5802 * Find entry with symbol in compound. Search anonymous structs and unions and
5803 * creates implicit select expressions for them.
5804 * Returns the adress for the innermost compound.
5806 static expression_t *find_create_select(const source_position_t *pos,
5808 type_qualifiers_t qualifiers,
5809 compound_t *compound, symbol_t *symbol)
5811 entity_t *iter = compound->members.entities;
5812 for (; iter != NULL; iter = iter->base.next) {
5813 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5816 symbol_t *iter_symbol = iter->base.symbol;
5817 if (iter_symbol == NULL) {
5818 type_t *type = iter->declaration.type;
5819 if (type->kind != TYPE_COMPOUND_STRUCT
5820 && type->kind != TYPE_COMPOUND_UNION)
5823 compound_t *sub_compound = type->compound.compound;
5825 if (find_compound_entry(sub_compound, symbol) == NULL)
5828 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5829 sub_addr->base.source_position = *pos;
5830 sub_addr->select.implicit = true;
5831 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5835 if (iter_symbol == symbol) {
5836 return create_select(pos, addr, qualifiers, iter);
5843 static void parse_compound_declarators(compound_t *compound,
5844 const declaration_specifiers_t *specifiers)
5849 if (token.type == ':') {
5850 source_position_t source_position = *HERE;
5853 type_t *base_type = specifiers->type;
5854 expression_t *size = parse_constant_expression();
5856 type_t *type = make_bitfield_type(base_type, size,
5857 &source_position, NULL);
5859 attribute_t *attributes = parse_attributes(NULL);
5860 attribute_t **anchor = &attributes;
5861 while (*anchor != NULL)
5862 anchor = &(*anchor)->next;
5863 *anchor = specifiers->attributes;
5865 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5866 entity->base.namespc = NAMESPACE_NORMAL;
5867 entity->base.source_position = source_position;
5868 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5869 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5870 entity->declaration.type = type;
5871 entity->declaration.attributes = attributes;
5873 if (attributes != NULL) {
5874 handle_entity_attributes(attributes, entity);
5876 append_entity(&compound->members, entity);
5878 entity = parse_declarator(specifiers,
5879 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5880 if (entity->kind == ENTITY_TYPEDEF) {
5881 errorf(&entity->base.source_position,
5882 "typedef not allowed as compound member");
5884 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5886 /* make sure we don't define a symbol multiple times */
5887 symbol_t *symbol = entity->base.symbol;
5888 if (symbol != NULL) {
5889 entity_t *prev = find_compound_entry(compound, symbol);
5891 errorf(&entity->base.source_position,
5892 "multiple declarations of symbol '%Y' (declared %P)",
5893 symbol, &prev->base.source_position);
5897 if (token.type == ':') {
5898 source_position_t source_position = *HERE;
5900 expression_t *size = parse_constant_expression();
5902 type_t *type = entity->declaration.type;
5903 type_t *bitfield_type = make_bitfield_type(type, size,
5904 &source_position, entity->base.symbol);
5906 attribute_t *attributes = parse_attributes(NULL);
5907 entity->declaration.type = bitfield_type;
5908 handle_entity_attributes(attributes, entity);
5910 type_t *orig_type = entity->declaration.type;
5911 type_t *type = skip_typeref(orig_type);
5912 if (is_type_function(type)) {
5913 errorf(&entity->base.source_position,
5914 "compound member '%Y' must not have function type '%T'",
5915 entity->base.symbol, orig_type);
5916 } else if (is_type_incomplete(type)) {
5917 /* §6.7.2.1:16 flexible array member */
5918 if (!is_type_array(type) ||
5919 token.type != ';' ||
5920 look_ahead(1)->type != '}') {
5921 errorf(&entity->base.source_position,
5922 "compound member '%Y' has incomplete type '%T'",
5923 entity->base.symbol, orig_type);
5928 append_entity(&compound->members, entity);
5931 } while (next_if(','));
5932 expect(';', end_error);
5935 anonymous_entity = NULL;
5938 static void parse_compound_type_entries(compound_t *compound)
5941 add_anchor_token('}');
5943 while (token.type != '}') {
5944 if (token.type == T_EOF) {
5945 errorf(HERE, "EOF while parsing struct");
5948 declaration_specifiers_t specifiers;
5949 memset(&specifiers, 0, sizeof(specifiers));
5950 parse_declaration_specifiers(&specifiers);
5952 parse_compound_declarators(compound, &specifiers);
5954 rem_anchor_token('}');
5958 compound->complete = true;
5961 static type_t *parse_typename(void)
5963 declaration_specifiers_t specifiers;
5964 memset(&specifiers, 0, sizeof(specifiers));
5965 parse_declaration_specifiers(&specifiers);
5966 if (specifiers.storage_class != STORAGE_CLASS_NONE
5967 || specifiers.thread_local) {
5968 /* TODO: improve error message, user does probably not know what a
5969 * storage class is...
5971 errorf(HERE, "typename must not have a storage class");
5974 type_t *result = parse_abstract_declarator(specifiers.type);
5982 typedef expression_t* (*parse_expression_function)(void);
5983 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5985 typedef struct expression_parser_function_t expression_parser_function_t;
5986 struct expression_parser_function_t {
5987 parse_expression_function parser;
5988 precedence_t infix_precedence;
5989 parse_expression_infix_function infix_parser;
5992 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5995 * Prints an error message if an expression was expected but not read
5997 static expression_t *expected_expression_error(void)
5999 /* skip the error message if the error token was read */
6000 if (token.type != T_ERROR) {
6001 errorf(HERE, "expected expression, got token %K", &token);
6005 return create_invalid_expression();
6008 static type_t *get_string_type(void)
6010 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
6013 static type_t *get_wide_string_type(void)
6015 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6019 * Parse a string constant.
6021 static expression_t *parse_string_literal(void)
6023 source_position_t begin = token.source_position;
6024 string_t res = token.literal;
6025 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
6028 while (token.type == T_STRING_LITERAL
6029 || token.type == T_WIDE_STRING_LITERAL) {
6030 warn_string_concat(&token.source_position);
6031 res = concat_strings(&res, &token.literal);
6033 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6036 expression_t *literal;
6038 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6039 literal->base.type = get_wide_string_type();
6041 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6042 literal->base.type = get_string_type();
6044 literal->base.source_position = begin;
6045 literal->literal.value = res;
6051 * Parse a boolean constant.
6053 static expression_t *parse_boolean_literal(bool value)
6055 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6056 literal->base.source_position = token.source_position;
6057 literal->base.type = type_bool;
6058 literal->literal.value.begin = value ? "true" : "false";
6059 literal->literal.value.size = value ? 4 : 5;
6065 static void warn_traditional_suffix(void)
6067 if (!warning.traditional)
6069 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6073 static void check_integer_suffix(void)
6075 symbol_t *suffix = token.symbol;
6079 bool not_traditional = false;
6080 const char *c = suffix->string;
6081 if (*c == 'l' || *c == 'L') {
6084 not_traditional = true;
6086 if (*c == 'u' || *c == 'U') {
6089 } else if (*c == 'u' || *c == 'U') {
6090 not_traditional = true;
6093 } else if (*c == 'u' || *c == 'U') {
6094 not_traditional = true;
6096 if (*c == 'l' || *c == 'L') {
6104 errorf(&token.source_position,
6105 "invalid suffix '%s' on integer constant", suffix->string);
6106 } else if (not_traditional) {
6107 warn_traditional_suffix();
6111 static type_t *check_floatingpoint_suffix(void)
6113 symbol_t *suffix = token.symbol;
6114 type_t *type = type_double;
6118 bool not_traditional = false;
6119 const char *c = suffix->string;
6120 if (*c == 'f' || *c == 'F') {
6123 } else if (*c == 'l' || *c == 'L') {
6125 type = type_long_double;
6128 errorf(&token.source_position,
6129 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6130 } else if (not_traditional) {
6131 warn_traditional_suffix();
6138 * Parse an integer constant.
6140 static expression_t *parse_number_literal(void)
6142 expression_kind_t kind;
6145 switch (token.type) {
6147 kind = EXPR_LITERAL_INTEGER;
6148 check_integer_suffix();
6151 case T_INTEGER_OCTAL:
6152 kind = EXPR_LITERAL_INTEGER_OCTAL;
6153 check_integer_suffix();
6156 case T_INTEGER_HEXADECIMAL:
6157 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6158 check_integer_suffix();
6161 case T_FLOATINGPOINT:
6162 kind = EXPR_LITERAL_FLOATINGPOINT;
6163 type = check_floatingpoint_suffix();
6165 case T_FLOATINGPOINT_HEXADECIMAL:
6166 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6167 type = check_floatingpoint_suffix();
6170 panic("unexpected token type in parse_number_literal");
6173 expression_t *literal = allocate_expression_zero(kind);
6174 literal->base.source_position = token.source_position;
6175 literal->base.type = type;
6176 literal->literal.value = token.literal;
6177 literal->literal.suffix = token.symbol;
6180 /* integer type depends on the size of the number and the size
6181 * representable by the types. The backend/codegeneration has to determine
6184 determine_literal_type(&literal->literal);
6189 * Parse a character constant.
6191 static expression_t *parse_character_constant(void)
6193 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6194 literal->base.source_position = token.source_position;
6195 literal->base.type = c_mode & _CXX ? type_char : type_int;
6196 literal->literal.value = token.literal;
6198 size_t len = literal->literal.value.size;
6200 if (!GNU_MODE && !(c_mode & _C99)) {
6201 errorf(HERE, "more than 1 character in character constant");
6202 } else if (warning.multichar) {
6203 literal->base.type = type_int;
6204 warningf(HERE, "multi-character character constant");
6213 * Parse a wide character constant.
6215 static expression_t *parse_wide_character_constant(void)
6217 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6218 literal->base.source_position = token.source_position;
6219 literal->base.type = type_int;
6220 literal->literal.value = token.literal;
6222 size_t len = wstrlen(&literal->literal.value);
6224 warningf(HERE, "multi-character character constant");
6231 static entity_t *create_implicit_function(symbol_t *symbol,
6232 const source_position_t *source_position)
6234 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6235 ntype->function.return_type = type_int;
6236 ntype->function.unspecified_parameters = true;
6237 ntype->function.linkage = LINKAGE_C;
6238 type_t *type = identify_new_type(ntype);
6240 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6241 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6242 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6243 entity->declaration.type = type;
6244 entity->declaration.implicit = true;
6245 entity->base.namespc = NAMESPACE_NORMAL;
6246 entity->base.symbol = symbol;
6247 entity->base.source_position = *source_position;
6249 if (current_scope != NULL) {
6250 bool strict_prototypes_old = warning.strict_prototypes;
6251 warning.strict_prototypes = false;
6252 record_entity(entity, false);
6253 warning.strict_prototypes = strict_prototypes_old;
6260 * Performs automatic type cast as described in §6.3.2.1.
6262 * @param orig_type the original type
6264 static type_t *automatic_type_conversion(type_t *orig_type)
6266 type_t *type = skip_typeref(orig_type);
6267 if (is_type_array(type)) {
6268 array_type_t *array_type = &type->array;
6269 type_t *element_type = array_type->element_type;
6270 unsigned qualifiers = array_type->base.qualifiers;
6272 return make_pointer_type(element_type, qualifiers);
6275 if (is_type_function(type)) {
6276 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6283 * reverts the automatic casts of array to pointer types and function
6284 * to function-pointer types as defined §6.3.2.1
6286 type_t *revert_automatic_type_conversion(const expression_t *expression)
6288 switch (expression->kind) {
6289 case EXPR_REFERENCE: {
6290 entity_t *entity = expression->reference.entity;
6291 if (is_declaration(entity)) {
6292 return entity->declaration.type;
6293 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6294 return entity->enum_value.enum_type;
6296 panic("no declaration or enum in reference");
6301 entity_t *entity = expression->select.compound_entry;
6302 assert(is_declaration(entity));
6303 type_t *type = entity->declaration.type;
6304 return get_qualified_type(type,
6305 expression->base.type->base.qualifiers);
6308 case EXPR_UNARY_DEREFERENCE: {
6309 const expression_t *const value = expression->unary.value;
6310 type_t *const type = skip_typeref(value->base.type);
6311 if (!is_type_pointer(type))
6312 return type_error_type;
6313 return type->pointer.points_to;
6316 case EXPR_ARRAY_ACCESS: {
6317 const expression_t *array_ref = expression->array_access.array_ref;
6318 type_t *type_left = skip_typeref(array_ref->base.type);
6319 if (!is_type_pointer(type_left))
6320 return type_error_type;
6321 return type_left->pointer.points_to;
6324 case EXPR_STRING_LITERAL: {
6325 size_t size = expression->string_literal.value.size;
6326 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6329 case EXPR_WIDE_STRING_LITERAL: {
6330 size_t size = wstrlen(&expression->string_literal.value);
6331 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6334 case EXPR_COMPOUND_LITERAL:
6335 return expression->compound_literal.type;
6340 return expression->base.type;
6344 * Find an entity matching a symbol in a scope.
6345 * Uses current scope if scope is NULL
6347 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6348 namespace_tag_t namespc)
6350 if (scope == NULL) {
6351 return get_entity(symbol, namespc);
6354 /* we should optimize here, if scope grows above a certain size we should
6355 construct a hashmap here... */
6356 entity_t *entity = scope->entities;
6357 for ( ; entity != NULL; entity = entity->base.next) {
6358 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6365 static entity_t *parse_qualified_identifier(void)
6367 /* namespace containing the symbol */
6369 source_position_t pos;
6370 const scope_t *lookup_scope = NULL;
6372 if (next_if(T_COLONCOLON))
6373 lookup_scope = &unit->scope;
6377 if (token.type != T_IDENTIFIER) {
6378 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6379 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6381 symbol = token.symbol;
6386 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6388 if (!next_if(T_COLONCOLON))
6391 switch (entity->kind) {
6392 case ENTITY_NAMESPACE:
6393 lookup_scope = &entity->namespacee.members;
6398 lookup_scope = &entity->compound.members;
6401 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6402 symbol, get_entity_kind_name(entity->kind));
6407 if (entity == NULL) {
6408 if (!strict_mode && token.type == '(') {
6409 /* an implicitly declared function */
6410 if (warning.error_implicit_function_declaration) {
6411 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6412 } else if (warning.implicit_function_declaration) {
6413 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6416 entity = create_implicit_function(symbol, &pos);
6418 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6419 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6426 /* skip further qualifications */
6427 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6429 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6432 static expression_t *parse_reference(void)
6434 entity_t *entity = parse_qualified_identifier();
6437 if (is_declaration(entity)) {
6438 orig_type = entity->declaration.type;
6439 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6440 orig_type = entity->enum_value.enum_type;
6442 panic("expected declaration or enum value in reference");
6445 /* we always do the auto-type conversions; the & and sizeof parser contains
6446 * code to revert this! */
6447 type_t *type = automatic_type_conversion(orig_type);
6449 expression_kind_t kind = EXPR_REFERENCE;
6450 if (entity->kind == ENTITY_ENUM_VALUE)
6451 kind = EXPR_REFERENCE_ENUM_VALUE;
6453 expression_t *expression = allocate_expression_zero(kind);
6454 expression->reference.entity = entity;
6455 expression->base.type = type;
6457 /* this declaration is used */
6458 if (is_declaration(entity)) {
6459 entity->declaration.used = true;
6462 if (entity->base.parent_scope != file_scope
6463 && (current_function != NULL
6464 && entity->base.parent_scope->depth < current_function->parameters.depth)
6465 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6466 if (entity->kind == ENTITY_VARIABLE) {
6467 /* access of a variable from an outer function */
6468 entity->variable.address_taken = true;
6469 } else if (entity->kind == ENTITY_PARAMETER) {
6470 entity->parameter.address_taken = true;
6472 current_function->need_closure = true;
6475 check_deprecated(HERE, entity);
6477 if (warning.init_self && entity == current_init_decl && !in_type_prop
6478 && entity->kind == ENTITY_VARIABLE) {
6479 current_init_decl = NULL;
6480 warningf(HERE, "variable '%#T' is initialized by itself",
6481 entity->declaration.type, entity->base.symbol);
6487 static bool semantic_cast(expression_t *cast)
6489 expression_t *expression = cast->unary.value;
6490 type_t *orig_dest_type = cast->base.type;
6491 type_t *orig_type_right = expression->base.type;
6492 type_t const *dst_type = skip_typeref(orig_dest_type);
6493 type_t const *src_type = skip_typeref(orig_type_right);
6494 source_position_t const *pos = &cast->base.source_position;
6496 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6497 if (dst_type == type_void)
6500 /* only integer and pointer can be casted to pointer */
6501 if (is_type_pointer(dst_type) &&
6502 !is_type_pointer(src_type) &&
6503 !is_type_integer(src_type) &&
6504 is_type_valid(src_type)) {
6505 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6509 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6510 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6514 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6515 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6519 if (warning.cast_qual &&
6520 is_type_pointer(src_type) &&
6521 is_type_pointer(dst_type)) {
6522 type_t *src = skip_typeref(src_type->pointer.points_to);
6523 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6524 unsigned missing_qualifiers =
6525 src->base.qualifiers & ~dst->base.qualifiers;
6526 if (missing_qualifiers != 0) {
6528 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6529 missing_qualifiers, orig_type_right);
6535 static expression_t *parse_compound_literal(type_t *type)
6537 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6539 parse_initializer_env_t env;
6542 env.must_be_constant = false;
6543 initializer_t *initializer = parse_initializer(&env);
6546 expression->compound_literal.initializer = initializer;
6547 expression->compound_literal.type = type;
6548 expression->base.type = automatic_type_conversion(type);
6554 * Parse a cast expression.
6556 static expression_t *parse_cast(void)
6558 add_anchor_token(')');
6560 source_position_t source_position = token.source_position;
6562 type_t *type = parse_typename();
6564 rem_anchor_token(')');
6565 expect(')', end_error);
6567 if (token.type == '{') {
6568 return parse_compound_literal(type);
6571 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6572 cast->base.source_position = source_position;
6574 expression_t *value = parse_subexpression(PREC_CAST);
6575 cast->base.type = type;
6576 cast->unary.value = value;
6578 if (! semantic_cast(cast)) {
6579 /* TODO: record the error in the AST. else it is impossible to detect it */
6584 return create_invalid_expression();
6588 * Parse a statement expression.
6590 static expression_t *parse_statement_expression(void)
6592 add_anchor_token(')');
6594 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6596 statement_t *statement = parse_compound_statement(true);
6597 statement->compound.stmt_expr = true;
6598 expression->statement.statement = statement;
6600 /* find last statement and use its type */
6601 type_t *type = type_void;
6602 const statement_t *stmt = statement->compound.statements;
6604 while (stmt->base.next != NULL)
6605 stmt = stmt->base.next;
6607 if (stmt->kind == STATEMENT_EXPRESSION) {
6608 type = stmt->expression.expression->base.type;
6610 } else if (warning.other) {
6611 warningf(&expression->base.source_position, "empty statement expression ({})");
6613 expression->base.type = type;
6615 rem_anchor_token(')');
6616 expect(')', end_error);
6623 * Parse a parenthesized expression.
6625 static expression_t *parse_parenthesized_expression(void)
6629 switch (token.type) {
6631 /* gcc extension: a statement expression */
6632 return parse_statement_expression();
6636 return parse_cast();
6638 if (is_typedef_symbol(token.symbol)) {
6639 return parse_cast();
6643 add_anchor_token(')');
6644 expression_t *result = parse_expression();
6645 result->base.parenthesized = true;
6646 rem_anchor_token(')');
6647 expect(')', end_error);
6653 static expression_t *parse_function_keyword(void)
6657 if (current_function == NULL) {
6658 errorf(HERE, "'__func__' used outside of a function");
6661 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6662 expression->base.type = type_char_ptr;
6663 expression->funcname.kind = FUNCNAME_FUNCTION;
6670 static expression_t *parse_pretty_function_keyword(void)
6672 if (current_function == NULL) {
6673 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6676 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6677 expression->base.type = type_char_ptr;
6678 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6680 eat(T___PRETTY_FUNCTION__);
6685 static expression_t *parse_funcsig_keyword(void)
6687 if (current_function == NULL) {
6688 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6691 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6692 expression->base.type = type_char_ptr;
6693 expression->funcname.kind = FUNCNAME_FUNCSIG;
6700 static expression_t *parse_funcdname_keyword(void)
6702 if (current_function == NULL) {
6703 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6706 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6707 expression->base.type = type_char_ptr;
6708 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6710 eat(T___FUNCDNAME__);
6715 static designator_t *parse_designator(void)
6717 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6718 result->source_position = *HERE;
6720 if (token.type != T_IDENTIFIER) {
6721 parse_error_expected("while parsing member designator",
6722 T_IDENTIFIER, NULL);
6725 result->symbol = token.symbol;
6728 designator_t *last_designator = result;
6731 if (token.type != T_IDENTIFIER) {
6732 parse_error_expected("while parsing member designator",
6733 T_IDENTIFIER, NULL);
6736 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6737 designator->source_position = *HERE;
6738 designator->symbol = token.symbol;
6741 last_designator->next = designator;
6742 last_designator = designator;
6746 add_anchor_token(']');
6747 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6748 designator->source_position = *HERE;
6749 designator->array_index = parse_expression();
6750 rem_anchor_token(']');
6751 expect(']', end_error);
6752 if (designator->array_index == NULL) {
6756 last_designator->next = designator;
6757 last_designator = designator;
6769 * Parse the __builtin_offsetof() expression.
6771 static expression_t *parse_offsetof(void)
6773 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6774 expression->base.type = type_size_t;
6776 eat(T___builtin_offsetof);
6778 expect('(', end_error);
6779 add_anchor_token(',');
6780 type_t *type = parse_typename();
6781 rem_anchor_token(',');
6782 expect(',', end_error);
6783 add_anchor_token(')');
6784 designator_t *designator = parse_designator();
6785 rem_anchor_token(')');
6786 expect(')', end_error);
6788 expression->offsetofe.type = type;
6789 expression->offsetofe.designator = designator;
6792 memset(&path, 0, sizeof(path));
6793 path.top_type = type;
6794 path.path = NEW_ARR_F(type_path_entry_t, 0);
6796 descend_into_subtype(&path);
6798 if (!walk_designator(&path, designator, true)) {
6799 return create_invalid_expression();
6802 DEL_ARR_F(path.path);
6806 return create_invalid_expression();
6810 * Parses a _builtin_va_start() expression.
6812 static expression_t *parse_va_start(void)
6814 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6816 eat(T___builtin_va_start);
6818 expect('(', end_error);
6819 add_anchor_token(',');
6820 expression->va_starte.ap = parse_assignment_expression();
6821 rem_anchor_token(',');
6822 expect(',', end_error);
6823 expression_t *const expr = parse_assignment_expression();
6824 if (expr->kind == EXPR_REFERENCE) {
6825 entity_t *const entity = expr->reference.entity;
6826 if (!current_function->base.type->function.variadic) {
6827 errorf(&expr->base.source_position,
6828 "'va_start' used in non-variadic function");
6829 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6830 entity->base.next != NULL ||
6831 entity->kind != ENTITY_PARAMETER) {
6832 errorf(&expr->base.source_position,
6833 "second argument of 'va_start' must be last parameter of the current function");
6835 expression->va_starte.parameter = &entity->variable;
6837 expect(')', end_error);
6840 expect(')', end_error);
6842 return create_invalid_expression();
6846 * Parses a __builtin_va_arg() expression.
6848 static expression_t *parse_va_arg(void)
6850 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6852 eat(T___builtin_va_arg);
6854 expect('(', end_error);
6856 ap.expression = parse_assignment_expression();
6857 expression->va_arge.ap = ap.expression;
6858 check_call_argument(type_valist, &ap, 1);
6860 expect(',', end_error);
6861 expression->base.type = parse_typename();
6862 expect(')', end_error);
6866 return create_invalid_expression();
6870 * Parses a __builtin_va_copy() expression.
6872 static expression_t *parse_va_copy(void)
6874 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6876 eat(T___builtin_va_copy);
6878 expect('(', end_error);
6879 expression_t *dst = parse_assignment_expression();
6880 assign_error_t error = semantic_assign(type_valist, dst);
6881 report_assign_error(error, type_valist, dst, "call argument 1",
6882 &dst->base.source_position);
6883 expression->va_copye.dst = dst;
6885 expect(',', end_error);
6887 call_argument_t src;
6888 src.expression = parse_assignment_expression();
6889 check_call_argument(type_valist, &src, 2);
6890 expression->va_copye.src = src.expression;
6891 expect(')', end_error);
6895 return create_invalid_expression();
6899 * Parses a __builtin_constant_p() expression.
6901 static expression_t *parse_builtin_constant(void)
6903 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6905 eat(T___builtin_constant_p);
6907 expect('(', end_error);
6908 add_anchor_token(')');
6909 expression->builtin_constant.value = parse_assignment_expression();
6910 rem_anchor_token(')');
6911 expect(')', end_error);
6912 expression->base.type = type_int;
6916 return create_invalid_expression();
6920 * Parses a __builtin_types_compatible_p() expression.
6922 static expression_t *parse_builtin_types_compatible(void)
6924 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6926 eat(T___builtin_types_compatible_p);
6928 expect('(', end_error);
6929 add_anchor_token(')');
6930 add_anchor_token(',');
6931 expression->builtin_types_compatible.left = parse_typename();
6932 rem_anchor_token(',');
6933 expect(',', end_error);
6934 expression->builtin_types_compatible.right = parse_typename();
6935 rem_anchor_token(')');
6936 expect(')', end_error);
6937 expression->base.type = type_int;
6941 return create_invalid_expression();
6945 * Parses a __builtin_is_*() compare expression.
6947 static expression_t *parse_compare_builtin(void)
6949 expression_t *expression;
6951 switch (token.type) {
6952 case T___builtin_isgreater:
6953 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6955 case T___builtin_isgreaterequal:
6956 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6958 case T___builtin_isless:
6959 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6961 case T___builtin_islessequal:
6962 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6964 case T___builtin_islessgreater:
6965 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6967 case T___builtin_isunordered:
6968 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6971 internal_errorf(HERE, "invalid compare builtin found");
6973 expression->base.source_position = *HERE;
6976 expect('(', end_error);
6977 expression->binary.left = parse_assignment_expression();
6978 expect(',', end_error);
6979 expression->binary.right = parse_assignment_expression();
6980 expect(')', end_error);
6982 type_t *const orig_type_left = expression->binary.left->base.type;
6983 type_t *const orig_type_right = expression->binary.right->base.type;
6985 type_t *const type_left = skip_typeref(orig_type_left);
6986 type_t *const type_right = skip_typeref(orig_type_right);
6987 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6988 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6989 type_error_incompatible("invalid operands in comparison",
6990 &expression->base.source_position, orig_type_left, orig_type_right);
6993 semantic_comparison(&expression->binary);
6998 return create_invalid_expression();
7002 * Parses a MS assume() expression.
7004 static expression_t *parse_assume(void)
7006 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7010 expect('(', end_error);
7011 add_anchor_token(')');
7012 expression->unary.value = parse_assignment_expression();
7013 rem_anchor_token(')');
7014 expect(')', end_error);
7016 expression->base.type = type_void;
7019 return create_invalid_expression();
7023 * Return the declaration for a given label symbol or create a new one.
7025 * @param symbol the symbol of the label
7027 static label_t *get_label(symbol_t *symbol)
7030 assert(current_function != NULL);
7032 label = get_entity(symbol, NAMESPACE_LABEL);
7033 /* if we found a local label, we already created the declaration */
7034 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7035 if (label->base.parent_scope != current_scope) {
7036 assert(label->base.parent_scope->depth < current_scope->depth);
7037 current_function->goto_to_outer = true;
7039 return &label->label;
7042 label = get_entity(symbol, NAMESPACE_LABEL);
7043 /* if we found a label in the same function, then we already created the
7046 && label->base.parent_scope == ¤t_function->parameters) {
7047 return &label->label;
7050 /* otherwise we need to create a new one */
7051 label = allocate_entity_zero(ENTITY_LABEL);
7052 label->base.namespc = NAMESPACE_LABEL;
7053 label->base.symbol = symbol;
7057 return &label->label;
7061 * Parses a GNU && label address expression.
7063 static expression_t *parse_label_address(void)
7065 source_position_t source_position = token.source_position;
7067 if (token.type != T_IDENTIFIER) {
7068 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7071 symbol_t *symbol = token.symbol;
7074 label_t *label = get_label(symbol);
7076 label->address_taken = true;
7078 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7079 expression->base.source_position = source_position;
7081 /* label address is threaten as a void pointer */
7082 expression->base.type = type_void_ptr;
7083 expression->label_address.label = label;
7086 return create_invalid_expression();
7090 * Parse a microsoft __noop expression.
7092 static expression_t *parse_noop_expression(void)
7094 /* the result is a (int)0 */
7095 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7096 literal->base.type = type_int;
7097 literal->base.source_position = token.source_position;
7098 literal->literal.value.begin = "__noop";
7099 literal->literal.value.size = 6;
7103 if (token.type == '(') {
7104 /* parse arguments */
7106 add_anchor_token(')');
7107 add_anchor_token(',');
7109 if (token.type != ')') do {
7110 (void)parse_assignment_expression();
7111 } while (next_if(','));
7113 rem_anchor_token(',');
7114 rem_anchor_token(')');
7115 expect(')', end_error);
7122 * Parses a primary expression.
7124 static expression_t *parse_primary_expression(void)
7126 switch (token.type) {
7127 case T_false: return parse_boolean_literal(false);
7128 case T_true: return parse_boolean_literal(true);
7130 case T_INTEGER_OCTAL:
7131 case T_INTEGER_HEXADECIMAL:
7132 case T_FLOATINGPOINT:
7133 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7134 case T_CHARACTER_CONSTANT: return parse_character_constant();
7135 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7136 case T_STRING_LITERAL:
7137 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7138 case T___FUNCTION__:
7139 case T___func__: return parse_function_keyword();
7140 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7141 case T___FUNCSIG__: return parse_funcsig_keyword();
7142 case T___FUNCDNAME__: return parse_funcdname_keyword();
7143 case T___builtin_offsetof: return parse_offsetof();
7144 case T___builtin_va_start: return parse_va_start();
7145 case T___builtin_va_arg: return parse_va_arg();
7146 case T___builtin_va_copy: return parse_va_copy();
7147 case T___builtin_isgreater:
7148 case T___builtin_isgreaterequal:
7149 case T___builtin_isless:
7150 case T___builtin_islessequal:
7151 case T___builtin_islessgreater:
7152 case T___builtin_isunordered: return parse_compare_builtin();
7153 case T___builtin_constant_p: return parse_builtin_constant();
7154 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7155 case T__assume: return parse_assume();
7158 return parse_label_address();
7161 case '(': return parse_parenthesized_expression();
7162 case T___noop: return parse_noop_expression();
7164 /* Gracefully handle type names while parsing expressions. */
7166 return parse_reference();
7168 if (!is_typedef_symbol(token.symbol)) {
7169 return parse_reference();
7173 source_position_t const pos = *HERE;
7174 type_t const *const type = parse_typename();
7175 errorf(&pos, "encountered type '%T' while parsing expression", type);
7176 return create_invalid_expression();
7180 errorf(HERE, "unexpected token %K, expected an expression", &token);
7182 return create_invalid_expression();
7186 * Check if the expression has the character type and issue a warning then.
7188 static void check_for_char_index_type(const expression_t *expression)
7190 type_t *const type = expression->base.type;
7191 const type_t *const base_type = skip_typeref(type);
7193 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7194 warning.char_subscripts) {
7195 warningf(&expression->base.source_position,
7196 "array subscript has type '%T'", type);
7200 static expression_t *parse_array_expression(expression_t *left)
7202 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7205 add_anchor_token(']');
7207 expression_t *inside = parse_expression();
7209 type_t *const orig_type_left = left->base.type;
7210 type_t *const orig_type_inside = inside->base.type;
7212 type_t *const type_left = skip_typeref(orig_type_left);
7213 type_t *const type_inside = skip_typeref(orig_type_inside);
7215 type_t *return_type;
7216 array_access_expression_t *array_access = &expression->array_access;
7217 if (is_type_pointer(type_left)) {
7218 return_type = type_left->pointer.points_to;
7219 array_access->array_ref = left;
7220 array_access->index = inside;
7221 check_for_char_index_type(inside);
7222 } else if (is_type_pointer(type_inside)) {
7223 return_type = type_inside->pointer.points_to;
7224 array_access->array_ref = inside;
7225 array_access->index = left;
7226 array_access->flipped = true;
7227 check_for_char_index_type(left);
7229 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7231 "array access on object with non-pointer types '%T', '%T'",
7232 orig_type_left, orig_type_inside);
7234 return_type = type_error_type;
7235 array_access->array_ref = left;
7236 array_access->index = inside;
7239 expression->base.type = automatic_type_conversion(return_type);
7241 rem_anchor_token(']');
7242 expect(']', end_error);
7247 static expression_t *parse_typeprop(expression_kind_t const kind)
7249 expression_t *tp_expression = allocate_expression_zero(kind);
7250 tp_expression->base.type = type_size_t;
7252 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7254 /* we only refer to a type property, mark this case */
7255 bool old = in_type_prop;
7256 in_type_prop = true;
7259 expression_t *expression;
7260 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7262 add_anchor_token(')');
7263 orig_type = parse_typename();
7264 rem_anchor_token(')');
7265 expect(')', end_error);
7267 if (token.type == '{') {
7268 /* It was not sizeof(type) after all. It is sizeof of an expression
7269 * starting with a compound literal */
7270 expression = parse_compound_literal(orig_type);
7271 goto typeprop_expression;
7274 expression = parse_subexpression(PREC_UNARY);
7276 typeprop_expression:
7277 tp_expression->typeprop.tp_expression = expression;
7279 orig_type = revert_automatic_type_conversion(expression);
7280 expression->base.type = orig_type;
7283 tp_expression->typeprop.type = orig_type;
7284 type_t const* const type = skip_typeref(orig_type);
7285 char const* wrong_type = NULL;
7286 if (is_type_incomplete(type)) {
7287 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7288 wrong_type = "incomplete";
7289 } else if (type->kind == TYPE_FUNCTION) {
7291 /* function types are allowed (and return 1) */
7292 if (warning.other) {
7293 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7294 warningf(&tp_expression->base.source_position,
7295 "%s expression with function argument returns invalid result", what);
7298 wrong_type = "function";
7301 if (is_type_incomplete(type))
7302 wrong_type = "incomplete";
7304 if (type->kind == TYPE_BITFIELD)
7305 wrong_type = "bitfield";
7307 if (wrong_type != NULL) {
7308 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7309 errorf(&tp_expression->base.source_position,
7310 "operand of %s expression must not be of %s type '%T'",
7311 what, wrong_type, orig_type);
7316 return tp_expression;
7319 static expression_t *parse_sizeof(void)
7321 return parse_typeprop(EXPR_SIZEOF);
7324 static expression_t *parse_alignof(void)
7326 return parse_typeprop(EXPR_ALIGNOF);
7329 static expression_t *parse_select_expression(expression_t *addr)
7331 assert(token.type == '.' || token.type == T_MINUSGREATER);
7332 bool select_left_arrow = (token.type == T_MINUSGREATER);
7333 source_position_t const pos = *HERE;
7336 if (token.type != T_IDENTIFIER) {
7337 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7338 return create_invalid_expression();
7340 symbol_t *symbol = token.symbol;
7343 type_t *const orig_type = addr->base.type;
7344 type_t *const type = skip_typeref(orig_type);
7347 bool saw_error = false;
7348 if (is_type_pointer(type)) {
7349 if (!select_left_arrow) {
7351 "request for member '%Y' in something not a struct or union, but '%T'",
7355 type_left = skip_typeref(type->pointer.points_to);
7357 if (select_left_arrow && is_type_valid(type)) {
7358 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7364 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7365 type_left->kind != TYPE_COMPOUND_UNION) {
7367 if (is_type_valid(type_left) && !saw_error) {
7369 "request for member '%Y' in something not a struct or union, but '%T'",
7372 return create_invalid_expression();
7375 compound_t *compound = type_left->compound.compound;
7376 if (!compound->complete) {
7377 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7379 return create_invalid_expression();
7382 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7383 expression_t *result =
7384 find_create_select(&pos, addr, qualifiers, compound, symbol);
7386 if (result == NULL) {
7387 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7388 return create_invalid_expression();
7394 static void check_call_argument(type_t *expected_type,
7395 call_argument_t *argument, unsigned pos)
7397 type_t *expected_type_skip = skip_typeref(expected_type);
7398 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7399 expression_t *arg_expr = argument->expression;
7400 type_t *arg_type = skip_typeref(arg_expr->base.type);
7402 /* handle transparent union gnu extension */
7403 if (is_type_union(expected_type_skip)
7404 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7405 compound_t *union_decl = expected_type_skip->compound.compound;
7406 type_t *best_type = NULL;
7407 entity_t *entry = union_decl->members.entities;
7408 for ( ; entry != NULL; entry = entry->base.next) {
7409 assert(is_declaration(entry));
7410 type_t *decl_type = entry->declaration.type;
7411 error = semantic_assign(decl_type, arg_expr);
7412 if (error == ASSIGN_ERROR_INCOMPATIBLE
7413 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7416 if (error == ASSIGN_SUCCESS) {
7417 best_type = decl_type;
7418 } else if (best_type == NULL) {
7419 best_type = decl_type;
7423 if (best_type != NULL) {
7424 expected_type = best_type;
7428 error = semantic_assign(expected_type, arg_expr);
7429 argument->expression = create_implicit_cast(arg_expr, expected_type);
7431 if (error != ASSIGN_SUCCESS) {
7432 /* report exact scope in error messages (like "in argument 3") */
7434 snprintf(buf, sizeof(buf), "call argument %u", pos);
7435 report_assign_error(error, expected_type, arg_expr, buf,
7436 &arg_expr->base.source_position);
7437 } else if (warning.traditional || warning.conversion) {
7438 type_t *const promoted_type = get_default_promoted_type(arg_type);
7439 if (!types_compatible(expected_type_skip, promoted_type) &&
7440 !types_compatible(expected_type_skip, type_void_ptr) &&
7441 !types_compatible(type_void_ptr, promoted_type)) {
7442 /* Deliberately show the skipped types in this warning */
7443 warningf(&arg_expr->base.source_position,
7444 "passing call argument %u as '%T' rather than '%T' due to prototype",
7445 pos, expected_type_skip, promoted_type);
7451 * Handle the semantic restrictions of builtin calls
7453 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7454 switch (call->function->reference.entity->function.btk) {
7455 case bk_gnu_builtin_return_address:
7456 case bk_gnu_builtin_frame_address: {
7457 /* argument must be constant */
7458 call_argument_t *argument = call->arguments;
7460 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7461 errorf(&call->base.source_position,
7462 "argument of '%Y' must be a constant expression",
7463 call->function->reference.entity->base.symbol);
7467 case bk_gnu_builtin_object_size:
7468 if (call->arguments == NULL)
7471 call_argument_t *arg = call->arguments->next;
7472 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7473 errorf(&call->base.source_position,
7474 "second argument of '%Y' must be a constant expression",
7475 call->function->reference.entity->base.symbol);
7478 case bk_gnu_builtin_prefetch:
7479 /* second and third argument must be constant if existent */
7480 if (call->arguments == NULL)
7482 call_argument_t *rw = call->arguments->next;
7483 call_argument_t *locality = NULL;
7486 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7487 errorf(&call->base.source_position,
7488 "second argument of '%Y' must be a constant expression",
7489 call->function->reference.entity->base.symbol);
7491 locality = rw->next;
7493 if (locality != NULL) {
7494 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7495 errorf(&call->base.source_position,
7496 "third argument of '%Y' must be a constant expression",
7497 call->function->reference.entity->base.symbol);
7499 locality = rw->next;
7508 * Parse a call expression, ie. expression '( ... )'.
7510 * @param expression the function address
7512 static expression_t *parse_call_expression(expression_t *expression)
7514 expression_t *result = allocate_expression_zero(EXPR_CALL);
7515 call_expression_t *call = &result->call;
7516 call->function = expression;
7518 type_t *const orig_type = expression->base.type;
7519 type_t *const type = skip_typeref(orig_type);
7521 function_type_t *function_type = NULL;
7522 if (is_type_pointer(type)) {
7523 type_t *const to_type = skip_typeref(type->pointer.points_to);
7525 if (is_type_function(to_type)) {
7526 function_type = &to_type->function;
7527 call->base.type = function_type->return_type;
7531 if (function_type == NULL && is_type_valid(type)) {
7533 "called object '%E' (type '%T') is not a pointer to a function",
7534 expression, orig_type);
7537 /* parse arguments */
7539 add_anchor_token(')');
7540 add_anchor_token(',');
7542 if (token.type != ')') {
7543 call_argument_t **anchor = &call->arguments;
7545 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7546 argument->expression = parse_assignment_expression();
7549 anchor = &argument->next;
7550 } while (next_if(','));
7552 rem_anchor_token(',');
7553 rem_anchor_token(')');
7554 expect(')', end_error);
7556 if (function_type == NULL)
7559 /* check type and count of call arguments */
7560 function_parameter_t *parameter = function_type->parameters;
7561 call_argument_t *argument = call->arguments;
7562 if (!function_type->unspecified_parameters) {
7563 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7564 parameter = parameter->next, argument = argument->next) {
7565 check_call_argument(parameter->type, argument, ++pos);
7568 if (parameter != NULL) {
7569 errorf(HERE, "too few arguments to function '%E'", expression);
7570 } else if (argument != NULL && !function_type->variadic) {
7571 errorf(HERE, "too many arguments to function '%E'", expression);
7575 /* do default promotion for other arguments */
7576 for (; argument != NULL; argument = argument->next) {
7577 type_t *type = argument->expression->base.type;
7578 if (!is_type_object(skip_typeref(type))) {
7579 errorf(&argument->expression->base.source_position,
7580 "call argument '%E' must not be void", argument->expression);
7583 type = get_default_promoted_type(type);
7585 argument->expression
7586 = create_implicit_cast(argument->expression, type);
7589 check_format(&result->call);
7591 if (warning.aggregate_return &&
7592 is_type_compound(skip_typeref(function_type->return_type))) {
7593 warningf(&result->base.source_position,
7594 "function call has aggregate value");
7597 if (call->function->kind == EXPR_REFERENCE) {
7598 reference_expression_t *reference = &call->function->reference;
7599 if (reference->entity->kind == ENTITY_FUNCTION &&
7600 reference->entity->function.btk != bk_none)
7601 handle_builtin_argument_restrictions(call);
7608 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7610 static bool same_compound_type(const type_t *type1, const type_t *type2)
7613 is_type_compound(type1) &&
7614 type1->kind == type2->kind &&
7615 type1->compound.compound == type2->compound.compound;
7618 static expression_t const *get_reference_address(expression_t const *expr)
7620 bool regular_take_address = true;
7622 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7623 expr = expr->unary.value;
7625 regular_take_address = false;
7628 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7631 expr = expr->unary.value;
7634 if (expr->kind != EXPR_REFERENCE)
7637 /* special case for functions which are automatically converted to a
7638 * pointer to function without an extra TAKE_ADDRESS operation */
7639 if (!regular_take_address &&
7640 expr->reference.entity->kind != ENTITY_FUNCTION) {
7647 static void warn_reference_address_as_bool(expression_t const* expr)
7649 if (!warning.address)
7652 expr = get_reference_address(expr);
7654 warningf(&expr->base.source_position,
7655 "the address of '%Y' will always evaluate as 'true'",
7656 expr->reference.entity->base.symbol);
7660 static void warn_assignment_in_condition(const expression_t *const expr)
7662 if (!warning.parentheses)
7664 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7666 if (expr->base.parenthesized)
7668 warningf(&expr->base.source_position,
7669 "suggest parentheses around assignment used as truth value");
7672 static void semantic_condition(expression_t const *const expr,
7673 char const *const context)
7675 type_t *const type = skip_typeref(expr->base.type);
7676 if (is_type_scalar(type)) {
7677 warn_reference_address_as_bool(expr);
7678 warn_assignment_in_condition(expr);
7679 } else if (is_type_valid(type)) {
7680 errorf(&expr->base.source_position,
7681 "%s must have scalar type", context);
7686 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7688 * @param expression the conditional expression
7690 static expression_t *parse_conditional_expression(expression_t *expression)
7692 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7694 conditional_expression_t *conditional = &result->conditional;
7695 conditional->condition = expression;
7698 add_anchor_token(':');
7700 /* §6.5.15:2 The first operand shall have scalar type. */
7701 semantic_condition(expression, "condition of conditional operator");
7703 expression_t *true_expression = expression;
7704 bool gnu_cond = false;
7705 if (GNU_MODE && token.type == ':') {
7708 true_expression = parse_expression();
7710 rem_anchor_token(':');
7711 expect(':', end_error);
7713 expression_t *false_expression =
7714 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7716 type_t *const orig_true_type = true_expression->base.type;
7717 type_t *const orig_false_type = false_expression->base.type;
7718 type_t *const true_type = skip_typeref(orig_true_type);
7719 type_t *const false_type = skip_typeref(orig_false_type);
7722 type_t *result_type;
7723 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7724 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7725 /* ISO/IEC 14882:1998(E) §5.16:2 */
7726 if (true_expression->kind == EXPR_UNARY_THROW) {
7727 result_type = false_type;
7728 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7729 result_type = true_type;
7731 if (warning.other && (
7732 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7733 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7735 warningf(&conditional->base.source_position,
7736 "ISO C forbids conditional expression with only one void side");
7738 result_type = type_void;
7740 } else if (is_type_arithmetic(true_type)
7741 && is_type_arithmetic(false_type)) {
7742 result_type = semantic_arithmetic(true_type, false_type);
7743 } else if (same_compound_type(true_type, false_type)) {
7744 /* just take 1 of the 2 types */
7745 result_type = true_type;
7746 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7747 type_t *pointer_type;
7749 expression_t *other_expression;
7750 if (is_type_pointer(true_type) &&
7751 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7752 pointer_type = true_type;
7753 other_type = false_type;
7754 other_expression = false_expression;
7756 pointer_type = false_type;
7757 other_type = true_type;
7758 other_expression = true_expression;
7761 if (is_null_pointer_constant(other_expression)) {
7762 result_type = pointer_type;
7763 } else if (is_type_pointer(other_type)) {
7764 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7765 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7768 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7769 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7771 } else if (types_compatible(get_unqualified_type(to1),
7772 get_unqualified_type(to2))) {
7775 if (warning.other) {
7776 warningf(&conditional->base.source_position,
7777 "pointer types '%T' and '%T' in conditional expression are incompatible",
7778 true_type, false_type);
7783 type_t *const type =
7784 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7785 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7786 } else if (is_type_integer(other_type)) {
7787 if (warning.other) {
7788 warningf(&conditional->base.source_position,
7789 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7791 result_type = pointer_type;
7793 if (is_type_valid(other_type)) {
7794 type_error_incompatible("while parsing conditional",
7795 &expression->base.source_position, true_type, false_type);
7797 result_type = type_error_type;
7800 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7801 type_error_incompatible("while parsing conditional",
7802 &conditional->base.source_position, true_type,
7805 result_type = type_error_type;
7808 conditional->true_expression
7809 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7810 conditional->false_expression
7811 = create_implicit_cast(false_expression, result_type);
7812 conditional->base.type = result_type;
7817 * Parse an extension expression.
7819 static expression_t *parse_extension(void)
7821 eat(T___extension__);
7823 bool old_gcc_extension = in_gcc_extension;
7824 in_gcc_extension = true;
7825 expression_t *expression = parse_subexpression(PREC_UNARY);
7826 in_gcc_extension = old_gcc_extension;
7831 * Parse a __builtin_classify_type() expression.
7833 static expression_t *parse_builtin_classify_type(void)
7835 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7836 result->base.type = type_int;
7838 eat(T___builtin_classify_type);
7840 expect('(', end_error);
7841 add_anchor_token(')');
7842 expression_t *expression = parse_expression();
7843 rem_anchor_token(')');
7844 expect(')', end_error);
7845 result->classify_type.type_expression = expression;
7849 return create_invalid_expression();
7853 * Parse a delete expression
7854 * ISO/IEC 14882:1998(E) §5.3.5
7856 static expression_t *parse_delete(void)
7858 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7859 result->base.type = type_void;
7864 result->kind = EXPR_UNARY_DELETE_ARRAY;
7865 expect(']', end_error);
7869 expression_t *const value = parse_subexpression(PREC_CAST);
7870 result->unary.value = value;
7872 type_t *const type = skip_typeref(value->base.type);
7873 if (!is_type_pointer(type)) {
7874 if (is_type_valid(type)) {
7875 errorf(&value->base.source_position,
7876 "operand of delete must have pointer type");
7878 } else if (warning.other &&
7879 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7880 warningf(&value->base.source_position,
7881 "deleting 'void*' is undefined");
7888 * Parse a throw expression
7889 * ISO/IEC 14882:1998(E) §15:1
7891 static expression_t *parse_throw(void)
7893 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7894 result->base.type = type_void;
7898 expression_t *value = NULL;
7899 switch (token.type) {
7901 value = parse_assignment_expression();
7902 /* ISO/IEC 14882:1998(E) §15.1:3 */
7903 type_t *const orig_type = value->base.type;
7904 type_t *const type = skip_typeref(orig_type);
7905 if (is_type_incomplete(type)) {
7906 errorf(&value->base.source_position,
7907 "cannot throw object of incomplete type '%T'", orig_type);
7908 } else if (is_type_pointer(type)) {
7909 type_t *const points_to = skip_typeref(type->pointer.points_to);
7910 if (is_type_incomplete(points_to) &&
7911 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7912 errorf(&value->base.source_position,
7913 "cannot throw pointer to incomplete type '%T'", orig_type);
7921 result->unary.value = value;
7926 static bool check_pointer_arithmetic(const source_position_t *source_position,
7927 type_t *pointer_type,
7928 type_t *orig_pointer_type)
7930 type_t *points_to = pointer_type->pointer.points_to;
7931 points_to = skip_typeref(points_to);
7933 if (is_type_incomplete(points_to)) {
7934 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7935 errorf(source_position,
7936 "arithmetic with pointer to incomplete type '%T' not allowed",
7939 } else if (warning.pointer_arith) {
7940 warningf(source_position,
7941 "pointer of type '%T' used in arithmetic",
7944 } else if (is_type_function(points_to)) {
7946 errorf(source_position,
7947 "arithmetic with pointer to function type '%T' not allowed",
7950 } else if (warning.pointer_arith) {
7951 warningf(source_position,
7952 "pointer to a function '%T' used in arithmetic",
7959 static bool is_lvalue(const expression_t *expression)
7961 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7962 switch (expression->kind) {
7963 case EXPR_ARRAY_ACCESS:
7964 case EXPR_COMPOUND_LITERAL:
7965 case EXPR_REFERENCE:
7967 case EXPR_UNARY_DEREFERENCE:
7971 type_t *type = skip_typeref(expression->base.type);
7973 /* ISO/IEC 14882:1998(E) §3.10:3 */
7974 is_type_reference(type) ||
7975 /* Claim it is an lvalue, if the type is invalid. There was a parse
7976 * error before, which maybe prevented properly recognizing it as
7978 !is_type_valid(type);
7983 static void semantic_incdec(unary_expression_t *expression)
7985 type_t *const orig_type = expression->value->base.type;
7986 type_t *const type = skip_typeref(orig_type);
7987 if (is_type_pointer(type)) {
7988 if (!check_pointer_arithmetic(&expression->base.source_position,
7992 } else if (!is_type_real(type) && is_type_valid(type)) {
7993 /* TODO: improve error message */
7994 errorf(&expression->base.source_position,
7995 "operation needs an arithmetic or pointer type");
7998 if (!is_lvalue(expression->value)) {
7999 /* TODO: improve error message */
8000 errorf(&expression->base.source_position, "lvalue required as operand");
8002 expression->base.type = orig_type;
8005 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8007 type_t *const orig_type = expression->value->base.type;
8008 type_t *const type = skip_typeref(orig_type);
8009 if (!is_type_arithmetic(type)) {
8010 if (is_type_valid(type)) {
8011 /* TODO: improve error message */
8012 errorf(&expression->base.source_position,
8013 "operation needs an arithmetic type");
8018 expression->base.type = orig_type;
8021 static void semantic_unexpr_plus(unary_expression_t *expression)
8023 semantic_unexpr_arithmetic(expression);
8024 if (warning.traditional)
8025 warningf(&expression->base.source_position,
8026 "traditional C rejects the unary plus operator");
8029 static void semantic_not(unary_expression_t *expression)
8031 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8032 semantic_condition(expression->value, "operand of !");
8033 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8036 static void semantic_unexpr_integer(unary_expression_t *expression)
8038 type_t *const orig_type = expression->value->base.type;
8039 type_t *const type = skip_typeref(orig_type);
8040 if (!is_type_integer(type)) {
8041 if (is_type_valid(type)) {
8042 errorf(&expression->base.source_position,
8043 "operand of ~ must be of integer type");
8048 expression->base.type = orig_type;
8051 static void semantic_dereference(unary_expression_t *expression)
8053 type_t *const orig_type = expression->value->base.type;
8054 type_t *const type = skip_typeref(orig_type);
8055 if (!is_type_pointer(type)) {
8056 if (is_type_valid(type)) {
8057 errorf(&expression->base.source_position,
8058 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8063 type_t *result_type = type->pointer.points_to;
8064 result_type = automatic_type_conversion(result_type);
8065 expression->base.type = result_type;
8069 * Record that an address is taken (expression represents an lvalue).
8071 * @param expression the expression
8072 * @param may_be_register if true, the expression might be an register
8074 static void set_address_taken(expression_t *expression, bool may_be_register)
8076 if (expression->kind != EXPR_REFERENCE)
8079 entity_t *const entity = expression->reference.entity;
8081 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8084 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8085 && !may_be_register) {
8086 errorf(&expression->base.source_position,
8087 "address of register %s '%Y' requested",
8088 get_entity_kind_name(entity->kind), entity->base.symbol);
8091 if (entity->kind == ENTITY_VARIABLE) {
8092 entity->variable.address_taken = true;
8094 assert(entity->kind == ENTITY_PARAMETER);
8095 entity->parameter.address_taken = true;
8100 * Check the semantic of the address taken expression.
8102 static void semantic_take_addr(unary_expression_t *expression)
8104 expression_t *value = expression->value;
8105 value->base.type = revert_automatic_type_conversion(value);
8107 type_t *orig_type = value->base.type;
8108 type_t *type = skip_typeref(orig_type);
8109 if (!is_type_valid(type))
8113 if (!is_lvalue(value)) {
8114 errorf(&expression->base.source_position, "'&' requires an lvalue");
8116 if (type->kind == TYPE_BITFIELD) {
8117 errorf(&expression->base.source_position,
8118 "'&' not allowed on object with bitfield type '%T'",
8122 set_address_taken(value, false);
8124 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8127 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8128 static expression_t *parse_##unexpression_type(void) \
8130 expression_t *unary_expression \
8131 = allocate_expression_zero(unexpression_type); \
8133 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8135 sfunc(&unary_expression->unary); \
8137 return unary_expression; \
8140 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8141 semantic_unexpr_arithmetic)
8142 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8143 semantic_unexpr_plus)
8144 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8146 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8147 semantic_dereference)
8148 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8150 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8151 semantic_unexpr_integer)
8152 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8154 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8157 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8159 static expression_t *parse_##unexpression_type(expression_t *left) \
8161 expression_t *unary_expression \
8162 = allocate_expression_zero(unexpression_type); \
8164 unary_expression->unary.value = left; \
8166 sfunc(&unary_expression->unary); \
8168 return unary_expression; \
8171 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8172 EXPR_UNARY_POSTFIX_INCREMENT,
8174 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8175 EXPR_UNARY_POSTFIX_DECREMENT,
8178 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8180 /* TODO: handle complex + imaginary types */
8182 type_left = get_unqualified_type(type_left);
8183 type_right = get_unqualified_type(type_right);
8185 /* §6.3.1.8 Usual arithmetic conversions */
8186 if (type_left == type_long_double || type_right == type_long_double) {
8187 return type_long_double;
8188 } else if (type_left == type_double || type_right == type_double) {
8190 } else if (type_left == type_float || type_right == type_float) {
8194 type_left = promote_integer(type_left);
8195 type_right = promote_integer(type_right);
8197 if (type_left == type_right)
8200 bool const signed_left = is_type_signed(type_left);
8201 bool const signed_right = is_type_signed(type_right);
8202 int const rank_left = get_rank(type_left);
8203 int const rank_right = get_rank(type_right);
8205 if (signed_left == signed_right)
8206 return rank_left >= rank_right ? type_left : type_right;
8215 u_rank = rank_right;
8216 u_type = type_right;
8218 s_rank = rank_right;
8219 s_type = type_right;
8224 if (u_rank >= s_rank)
8227 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8229 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8230 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8234 case ATOMIC_TYPE_INT: return type_unsigned_int;
8235 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8236 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8238 default: panic("invalid atomic type");
8243 * Check the semantic restrictions for a binary expression.
8245 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8247 expression_t *const left = expression->left;
8248 expression_t *const right = expression->right;
8249 type_t *const orig_type_left = left->base.type;
8250 type_t *const orig_type_right = right->base.type;
8251 type_t *const type_left = skip_typeref(orig_type_left);
8252 type_t *const type_right = skip_typeref(orig_type_right);
8254 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8255 /* TODO: improve error message */
8256 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8257 errorf(&expression->base.source_position,
8258 "operation needs arithmetic types");
8263 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8264 expression->left = create_implicit_cast(left, arithmetic_type);
8265 expression->right = create_implicit_cast(right, arithmetic_type);
8266 expression->base.type = arithmetic_type;
8269 static void semantic_binexpr_integer(binary_expression_t *const expression)
8271 expression_t *const left = expression->left;
8272 expression_t *const right = expression->right;
8273 type_t *const orig_type_left = left->base.type;
8274 type_t *const orig_type_right = right->base.type;
8275 type_t *const type_left = skip_typeref(orig_type_left);
8276 type_t *const type_right = skip_typeref(orig_type_right);
8278 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8279 /* TODO: improve error message */
8280 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8281 errorf(&expression->base.source_position,
8282 "operation needs integer types");
8287 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8288 expression->left = create_implicit_cast(left, result_type);
8289 expression->right = create_implicit_cast(right, result_type);
8290 expression->base.type = result_type;
8293 static void warn_div_by_zero(binary_expression_t const *const expression)
8295 if (!warning.div_by_zero ||
8296 !is_type_integer(expression->base.type))
8299 expression_t const *const right = expression->right;
8300 /* The type of the right operand can be different for /= */
8301 if (is_type_integer(right->base.type) &&
8302 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8303 !fold_constant_to_bool(right)) {
8304 warningf(&expression->base.source_position, "division by zero");
8309 * Check the semantic restrictions for a div/mod expression.
8311 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8313 semantic_binexpr_arithmetic(expression);
8314 warn_div_by_zero(expression);
8317 static void warn_addsub_in_shift(const expression_t *const expr)
8319 if (expr->base.parenthesized)
8323 switch (expr->kind) {
8324 case EXPR_BINARY_ADD: op = '+'; break;
8325 case EXPR_BINARY_SUB: op = '-'; break;
8329 warningf(&expr->base.source_position,
8330 "suggest parentheses around '%c' inside shift", op);
8333 static bool semantic_shift(binary_expression_t *expression)
8335 expression_t *const left = expression->left;
8336 expression_t *const right = expression->right;
8337 type_t *const orig_type_left = left->base.type;
8338 type_t *const orig_type_right = right->base.type;
8339 type_t * type_left = skip_typeref(orig_type_left);
8340 type_t * type_right = skip_typeref(orig_type_right);
8342 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8343 /* TODO: improve error message */
8344 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8345 errorf(&expression->base.source_position,
8346 "operands of shift operation must have integer types");
8351 type_left = promote_integer(type_left);
8353 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8354 long count = fold_constant_to_int(right);
8356 warningf(&right->base.source_position,
8357 "shift count must be non-negative");
8358 } else if ((unsigned long)count >=
8359 get_atomic_type_size(type_left->atomic.akind) * 8) {
8360 warningf(&right->base.source_position,
8361 "shift count must be less than type width");
8365 type_right = promote_integer(type_right);
8366 expression->right = create_implicit_cast(right, type_right);
8371 static void semantic_shift_op(binary_expression_t *expression)
8373 expression_t *const left = expression->left;
8374 expression_t *const right = expression->right;
8376 if (!semantic_shift(expression))
8379 if (warning.parentheses) {
8380 warn_addsub_in_shift(left);
8381 warn_addsub_in_shift(right);
8384 type_t *const orig_type_left = left->base.type;
8385 type_t * type_left = skip_typeref(orig_type_left);
8387 type_left = promote_integer(type_left);
8388 expression->left = create_implicit_cast(left, type_left);
8389 expression->base.type = type_left;
8392 static void semantic_add(binary_expression_t *expression)
8394 expression_t *const left = expression->left;
8395 expression_t *const right = expression->right;
8396 type_t *const orig_type_left = left->base.type;
8397 type_t *const orig_type_right = right->base.type;
8398 type_t *const type_left = skip_typeref(orig_type_left);
8399 type_t *const type_right = skip_typeref(orig_type_right);
8402 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8403 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8404 expression->left = create_implicit_cast(left, arithmetic_type);
8405 expression->right = create_implicit_cast(right, arithmetic_type);
8406 expression->base.type = arithmetic_type;
8407 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8408 check_pointer_arithmetic(&expression->base.source_position,
8409 type_left, orig_type_left);
8410 expression->base.type = type_left;
8411 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8412 check_pointer_arithmetic(&expression->base.source_position,
8413 type_right, orig_type_right);
8414 expression->base.type = type_right;
8415 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8416 errorf(&expression->base.source_position,
8417 "invalid operands to binary + ('%T', '%T')",
8418 orig_type_left, orig_type_right);
8422 static void semantic_sub(binary_expression_t *expression)
8424 expression_t *const left = expression->left;
8425 expression_t *const right = expression->right;
8426 type_t *const orig_type_left = left->base.type;
8427 type_t *const orig_type_right = right->base.type;
8428 type_t *const type_left = skip_typeref(orig_type_left);
8429 type_t *const type_right = skip_typeref(orig_type_right);
8430 source_position_t const *const pos = &expression->base.source_position;
8433 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8434 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8435 expression->left = create_implicit_cast(left, arithmetic_type);
8436 expression->right = create_implicit_cast(right, arithmetic_type);
8437 expression->base.type = arithmetic_type;
8438 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8439 check_pointer_arithmetic(&expression->base.source_position,
8440 type_left, orig_type_left);
8441 expression->base.type = type_left;
8442 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8443 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8444 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8445 if (!types_compatible(unqual_left, unqual_right)) {
8447 "subtracting pointers to incompatible types '%T' and '%T'",
8448 orig_type_left, orig_type_right);
8449 } else if (!is_type_object(unqual_left)) {
8450 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8451 errorf(pos, "subtracting pointers to non-object types '%T'",
8453 } else if (warning.other) {
8454 warningf(pos, "subtracting pointers to void");
8457 expression->base.type = type_ptrdiff_t;
8458 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8459 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8460 orig_type_left, orig_type_right);
8464 static void warn_string_literal_address(expression_t const* expr)
8466 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8467 expr = expr->unary.value;
8468 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8470 expr = expr->unary.value;
8473 if (expr->kind == EXPR_STRING_LITERAL
8474 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8475 warningf(&expr->base.source_position,
8476 "comparison with string literal results in unspecified behaviour");
8480 static void warn_comparison_in_comparison(const expression_t *const expr)
8482 if (expr->base.parenthesized)
8484 switch (expr->base.kind) {
8485 case EXPR_BINARY_LESS:
8486 case EXPR_BINARY_GREATER:
8487 case EXPR_BINARY_LESSEQUAL:
8488 case EXPR_BINARY_GREATEREQUAL:
8489 case EXPR_BINARY_NOTEQUAL:
8490 case EXPR_BINARY_EQUAL:
8491 warningf(&expr->base.source_position,
8492 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8499 static bool maybe_negative(expression_t const *const expr)
8501 switch (is_constant_expression(expr)) {
8502 case EXPR_CLASS_ERROR: return false;
8503 case EXPR_CLASS_CONSTANT: return fold_constant_to_int(expr) < 0;
8504 default: return true;
8509 * Check the semantics of comparison expressions.
8511 * @param expression The expression to check.
8513 static void semantic_comparison(binary_expression_t *expression)
8515 expression_t *left = expression->left;
8516 expression_t *right = expression->right;
8518 if (warning.address) {
8519 warn_string_literal_address(left);
8520 warn_string_literal_address(right);
8522 expression_t const* const func_left = get_reference_address(left);
8523 if (func_left != NULL && is_null_pointer_constant(right)) {
8524 warningf(&expression->base.source_position,
8525 "the address of '%Y' will never be NULL",
8526 func_left->reference.entity->base.symbol);
8529 expression_t const* const func_right = get_reference_address(right);
8530 if (func_right != NULL && is_null_pointer_constant(right)) {
8531 warningf(&expression->base.source_position,
8532 "the address of '%Y' will never be NULL",
8533 func_right->reference.entity->base.symbol);
8537 if (warning.parentheses) {
8538 warn_comparison_in_comparison(left);
8539 warn_comparison_in_comparison(right);
8542 type_t *orig_type_left = left->base.type;
8543 type_t *orig_type_right = right->base.type;
8544 type_t *type_left = skip_typeref(orig_type_left);
8545 type_t *type_right = skip_typeref(orig_type_right);
8547 /* TODO non-arithmetic types */
8548 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8549 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8551 /* test for signed vs unsigned compares */
8552 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8553 bool const signed_left = is_type_signed(type_left);
8554 bool const signed_right = is_type_signed(type_right);
8555 if (signed_left != signed_right) {
8556 /* FIXME long long needs better const folding magic */
8557 /* TODO check whether constant value can be represented by other type */
8558 if ((signed_left && maybe_negative(left)) ||
8559 (signed_right && maybe_negative(right))) {
8560 warningf(&expression->base.source_position,
8561 "comparison between signed and unsigned");
8566 expression->left = create_implicit_cast(left, arithmetic_type);
8567 expression->right = create_implicit_cast(right, arithmetic_type);
8568 expression->base.type = arithmetic_type;
8569 if (warning.float_equal &&
8570 (expression->base.kind == EXPR_BINARY_EQUAL ||
8571 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8572 is_type_float(arithmetic_type)) {
8573 warningf(&expression->base.source_position,
8574 "comparing floating point with == or != is unsafe");
8576 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8577 /* TODO check compatibility */
8578 } else if (is_type_pointer(type_left)) {
8579 expression->right = create_implicit_cast(right, type_left);
8580 } else if (is_type_pointer(type_right)) {
8581 expression->left = create_implicit_cast(left, type_right);
8582 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8583 type_error_incompatible("invalid operands in comparison",
8584 &expression->base.source_position,
8585 type_left, type_right);
8587 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8591 * Checks if a compound type has constant fields.
8593 static bool has_const_fields(const compound_type_t *type)
8595 compound_t *compound = type->compound;
8596 entity_t *entry = compound->members.entities;
8598 for (; entry != NULL; entry = entry->base.next) {
8599 if (!is_declaration(entry))
8602 const type_t *decl_type = skip_typeref(entry->declaration.type);
8603 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8610 static bool is_valid_assignment_lhs(expression_t const* const left)
8612 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8613 type_t *const type_left = skip_typeref(orig_type_left);
8615 if (!is_lvalue(left)) {
8616 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8621 if (left->kind == EXPR_REFERENCE
8622 && left->reference.entity->kind == ENTITY_FUNCTION) {
8623 errorf(HERE, "cannot assign to function '%E'", left);
8627 if (is_type_array(type_left)) {
8628 errorf(HERE, "cannot assign to array '%E'", left);
8631 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8632 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8636 if (is_type_incomplete(type_left)) {
8637 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8638 left, orig_type_left);
8641 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8642 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8643 left, orig_type_left);
8650 static void semantic_arithmetic_assign(binary_expression_t *expression)
8652 expression_t *left = expression->left;
8653 expression_t *right = expression->right;
8654 type_t *orig_type_left = left->base.type;
8655 type_t *orig_type_right = right->base.type;
8657 if (!is_valid_assignment_lhs(left))
8660 type_t *type_left = skip_typeref(orig_type_left);
8661 type_t *type_right = skip_typeref(orig_type_right);
8663 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8664 /* TODO: improve error message */
8665 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8666 errorf(&expression->base.source_position,
8667 "operation needs arithmetic types");
8672 /* combined instructions are tricky. We can't create an implicit cast on
8673 * the left side, because we need the uncasted form for the store.
8674 * The ast2firm pass has to know that left_type must be right_type
8675 * for the arithmetic operation and create a cast by itself */
8676 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8677 expression->right = create_implicit_cast(right, arithmetic_type);
8678 expression->base.type = type_left;
8681 static void semantic_divmod_assign(binary_expression_t *expression)
8683 semantic_arithmetic_assign(expression);
8684 warn_div_by_zero(expression);
8687 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8689 expression_t *const left = expression->left;
8690 expression_t *const right = expression->right;
8691 type_t *const orig_type_left = left->base.type;
8692 type_t *const orig_type_right = right->base.type;
8693 type_t *const type_left = skip_typeref(orig_type_left);
8694 type_t *const type_right = skip_typeref(orig_type_right);
8696 if (!is_valid_assignment_lhs(left))
8699 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8700 /* combined instructions are tricky. We can't create an implicit cast on
8701 * the left side, because we need the uncasted form for the store.
8702 * The ast2firm pass has to know that left_type must be right_type
8703 * for the arithmetic operation and create a cast by itself */
8704 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8705 expression->right = create_implicit_cast(right, arithmetic_type);
8706 expression->base.type = type_left;
8707 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8708 check_pointer_arithmetic(&expression->base.source_position,
8709 type_left, orig_type_left);
8710 expression->base.type = type_left;
8711 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8712 errorf(&expression->base.source_position,
8713 "incompatible types '%T' and '%T' in assignment",
8714 orig_type_left, orig_type_right);
8718 static void semantic_integer_assign(binary_expression_t *expression)
8720 expression_t *left = expression->left;
8721 expression_t *right = expression->right;
8722 type_t *orig_type_left = left->base.type;
8723 type_t *orig_type_right = right->base.type;
8725 if (!is_valid_assignment_lhs(left))
8728 type_t *type_left = skip_typeref(orig_type_left);
8729 type_t *type_right = skip_typeref(orig_type_right);
8731 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8732 /* TODO: improve error message */
8733 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8734 errorf(&expression->base.source_position,
8735 "operation needs integer types");
8740 /* combined instructions are tricky. We can't create an implicit cast on
8741 * the left side, because we need the uncasted form for the store.
8742 * The ast2firm pass has to know that left_type must be right_type
8743 * for the arithmetic operation and create a cast by itself */
8744 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8745 expression->right = create_implicit_cast(right, arithmetic_type);
8746 expression->base.type = type_left;
8749 static void semantic_shift_assign(binary_expression_t *expression)
8751 expression_t *left = expression->left;
8753 if (!is_valid_assignment_lhs(left))
8756 if (!semantic_shift(expression))
8759 expression->base.type = skip_typeref(left->base.type);
8762 static void warn_logical_and_within_or(const expression_t *const expr)
8764 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8766 if (expr->base.parenthesized)
8768 warningf(&expr->base.source_position,
8769 "suggest parentheses around && within ||");
8773 * Check the semantic restrictions of a logical expression.
8775 static void semantic_logical_op(binary_expression_t *expression)
8777 /* §6.5.13:2 Each of the operands shall have scalar type.
8778 * §6.5.14:2 Each of the operands shall have scalar type. */
8779 semantic_condition(expression->left, "left operand of logical operator");
8780 semantic_condition(expression->right, "right operand of logical operator");
8781 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8782 warning.parentheses) {
8783 warn_logical_and_within_or(expression->left);
8784 warn_logical_and_within_or(expression->right);
8786 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8790 * Check the semantic restrictions of a binary assign expression.
8792 static void semantic_binexpr_assign(binary_expression_t *expression)
8794 expression_t *left = expression->left;
8795 type_t *orig_type_left = left->base.type;
8797 if (!is_valid_assignment_lhs(left))
8800 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8801 report_assign_error(error, orig_type_left, expression->right,
8802 "assignment", &left->base.source_position);
8803 expression->right = create_implicit_cast(expression->right, orig_type_left);
8804 expression->base.type = orig_type_left;
8808 * Determine if the outermost operation (or parts thereof) of the given
8809 * expression has no effect in order to generate a warning about this fact.
8810 * Therefore in some cases this only examines some of the operands of the
8811 * expression (see comments in the function and examples below).
8813 * f() + 23; // warning, because + has no effect
8814 * x || f(); // no warning, because x controls execution of f()
8815 * x ? y : f(); // warning, because y has no effect
8816 * (void)x; // no warning to be able to suppress the warning
8817 * This function can NOT be used for an "expression has definitely no effect"-
8819 static bool expression_has_effect(const expression_t *const expr)
8821 switch (expr->kind) {
8822 case EXPR_UNKNOWN: break;
8823 case EXPR_INVALID: return true; /* do NOT warn */
8824 case EXPR_REFERENCE: return false;
8825 case EXPR_REFERENCE_ENUM_VALUE: return false;
8826 case EXPR_LABEL_ADDRESS: return false;
8828 /* suppress the warning for microsoft __noop operations */
8829 case EXPR_LITERAL_MS_NOOP: return true;
8830 case EXPR_LITERAL_BOOLEAN:
8831 case EXPR_LITERAL_CHARACTER:
8832 case EXPR_LITERAL_WIDE_CHARACTER:
8833 case EXPR_LITERAL_INTEGER:
8834 case EXPR_LITERAL_INTEGER_OCTAL:
8835 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8836 case EXPR_LITERAL_FLOATINGPOINT:
8837 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8838 case EXPR_STRING_LITERAL: return false;
8839 case EXPR_WIDE_STRING_LITERAL: return false;
8842 const call_expression_t *const call = &expr->call;
8843 if (call->function->kind != EXPR_REFERENCE)
8846 switch (call->function->reference.entity->function.btk) {
8847 /* FIXME: which builtins have no effect? */
8848 default: return true;
8852 /* Generate the warning if either the left or right hand side of a
8853 * conditional expression has no effect */
8854 case EXPR_CONDITIONAL: {
8855 conditional_expression_t const *const cond = &expr->conditional;
8856 expression_t const *const t = cond->true_expression;
8858 (t == NULL || expression_has_effect(t)) &&
8859 expression_has_effect(cond->false_expression);
8862 case EXPR_SELECT: return false;
8863 case EXPR_ARRAY_ACCESS: return false;
8864 case EXPR_SIZEOF: return false;
8865 case EXPR_CLASSIFY_TYPE: return false;
8866 case EXPR_ALIGNOF: return false;
8868 case EXPR_FUNCNAME: return false;
8869 case EXPR_BUILTIN_CONSTANT_P: return false;
8870 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8871 case EXPR_OFFSETOF: return false;
8872 case EXPR_VA_START: return true;
8873 case EXPR_VA_ARG: return true;
8874 case EXPR_VA_COPY: return true;
8875 case EXPR_STATEMENT: return true; // TODO
8876 case EXPR_COMPOUND_LITERAL: return false;
8878 case EXPR_UNARY_NEGATE: return false;
8879 case EXPR_UNARY_PLUS: return false;
8880 case EXPR_UNARY_BITWISE_NEGATE: return false;
8881 case EXPR_UNARY_NOT: return false;
8882 case EXPR_UNARY_DEREFERENCE: return false;
8883 case EXPR_UNARY_TAKE_ADDRESS: return false;
8884 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8885 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8886 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8887 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8889 /* Treat void casts as if they have an effect in order to being able to
8890 * suppress the warning */
8891 case EXPR_UNARY_CAST: {
8892 type_t *const type = skip_typeref(expr->base.type);
8893 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8896 case EXPR_UNARY_CAST_IMPLICIT: return true;
8897 case EXPR_UNARY_ASSUME: return true;
8898 case EXPR_UNARY_DELETE: return true;
8899 case EXPR_UNARY_DELETE_ARRAY: return true;
8900 case EXPR_UNARY_THROW: return true;
8902 case EXPR_BINARY_ADD: return false;
8903 case EXPR_BINARY_SUB: return false;
8904 case EXPR_BINARY_MUL: return false;
8905 case EXPR_BINARY_DIV: return false;
8906 case EXPR_BINARY_MOD: return false;
8907 case EXPR_BINARY_EQUAL: return false;
8908 case EXPR_BINARY_NOTEQUAL: return false;
8909 case EXPR_BINARY_LESS: return false;
8910 case EXPR_BINARY_LESSEQUAL: return false;
8911 case EXPR_BINARY_GREATER: return false;
8912 case EXPR_BINARY_GREATEREQUAL: return false;
8913 case EXPR_BINARY_BITWISE_AND: return false;
8914 case EXPR_BINARY_BITWISE_OR: return false;
8915 case EXPR_BINARY_BITWISE_XOR: return false;
8916 case EXPR_BINARY_SHIFTLEFT: return false;
8917 case EXPR_BINARY_SHIFTRIGHT: return false;
8918 case EXPR_BINARY_ASSIGN: return true;
8919 case EXPR_BINARY_MUL_ASSIGN: return true;
8920 case EXPR_BINARY_DIV_ASSIGN: return true;
8921 case EXPR_BINARY_MOD_ASSIGN: return true;
8922 case EXPR_BINARY_ADD_ASSIGN: return true;
8923 case EXPR_BINARY_SUB_ASSIGN: return true;
8924 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8925 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8926 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8927 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8928 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8930 /* Only examine the right hand side of && and ||, because the left hand
8931 * side already has the effect of controlling the execution of the right
8933 case EXPR_BINARY_LOGICAL_AND:
8934 case EXPR_BINARY_LOGICAL_OR:
8935 /* Only examine the right hand side of a comma expression, because the left
8936 * hand side has a separate warning */
8937 case EXPR_BINARY_COMMA:
8938 return expression_has_effect(expr->binary.right);
8940 case EXPR_BINARY_ISGREATER: return false;
8941 case EXPR_BINARY_ISGREATEREQUAL: return false;
8942 case EXPR_BINARY_ISLESS: return false;
8943 case EXPR_BINARY_ISLESSEQUAL: return false;
8944 case EXPR_BINARY_ISLESSGREATER: return false;
8945 case EXPR_BINARY_ISUNORDERED: return false;
8948 internal_errorf(HERE, "unexpected expression");
8951 static void semantic_comma(binary_expression_t *expression)
8953 if (warning.unused_value) {
8954 const expression_t *const left = expression->left;
8955 if (!expression_has_effect(left)) {
8956 warningf(&left->base.source_position,
8957 "left-hand operand of comma expression has no effect");
8960 expression->base.type = expression->right->base.type;
8964 * @param prec_r precedence of the right operand
8966 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8967 static expression_t *parse_##binexpression_type(expression_t *left) \
8969 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8970 binexpr->binary.left = left; \
8973 expression_t *right = parse_subexpression(prec_r); \
8975 binexpr->binary.right = right; \
8976 sfunc(&binexpr->binary); \
8981 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8982 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8983 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8984 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8985 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8986 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8987 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8988 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8989 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8990 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8991 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8992 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8993 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8994 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8995 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8996 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8997 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8998 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8999 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
9000 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9001 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9002 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9003 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9004 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9005 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9006 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9007 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9008 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9009 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9010 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9013 static expression_t *parse_subexpression(precedence_t precedence)
9015 if (token.type < 0) {
9016 return expected_expression_error();
9019 expression_parser_function_t *parser
9020 = &expression_parsers[token.type];
9021 source_position_t source_position = token.source_position;
9024 if (parser->parser != NULL) {
9025 left = parser->parser();
9027 left = parse_primary_expression();
9029 assert(left != NULL);
9030 left->base.source_position = source_position;
9033 if (token.type < 0) {
9034 return expected_expression_error();
9037 parser = &expression_parsers[token.type];
9038 if (parser->infix_parser == NULL)
9040 if (parser->infix_precedence < precedence)
9043 left = parser->infix_parser(left);
9045 assert(left != NULL);
9046 assert(left->kind != EXPR_UNKNOWN);
9047 left->base.source_position = source_position;
9054 * Parse an expression.
9056 static expression_t *parse_expression(void)
9058 return parse_subexpression(PREC_EXPRESSION);
9062 * Register a parser for a prefix-like operator.
9064 * @param parser the parser function
9065 * @param token_type the token type of the prefix token
9067 static void register_expression_parser(parse_expression_function parser,
9070 expression_parser_function_t *entry = &expression_parsers[token_type];
9072 if (entry->parser != NULL) {
9073 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9074 panic("trying to register multiple expression parsers for a token");
9076 entry->parser = parser;
9080 * Register a parser for an infix operator with given precedence.
9082 * @param parser the parser function
9083 * @param token_type the token type of the infix operator
9084 * @param precedence the precedence of the operator
9086 static void register_infix_parser(parse_expression_infix_function parser,
9087 int token_type, precedence_t precedence)
9089 expression_parser_function_t *entry = &expression_parsers[token_type];
9091 if (entry->infix_parser != NULL) {
9092 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9093 panic("trying to register multiple infix expression parsers for a "
9096 entry->infix_parser = parser;
9097 entry->infix_precedence = precedence;
9101 * Initialize the expression parsers.
9103 static void init_expression_parsers(void)
9105 memset(&expression_parsers, 0, sizeof(expression_parsers));
9107 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9108 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9109 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9110 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9111 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9112 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9113 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9114 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9115 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9116 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9117 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9118 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9119 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9120 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9121 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9122 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9123 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9124 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9125 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9126 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9127 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9128 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9129 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9130 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9131 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9132 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9133 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9134 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9135 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9136 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9137 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9138 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9139 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9140 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9141 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9142 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9143 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9145 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9146 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9147 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9148 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9149 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9150 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9151 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9152 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9153 register_expression_parser(parse_sizeof, T_sizeof);
9154 register_expression_parser(parse_alignof, T___alignof__);
9155 register_expression_parser(parse_extension, T___extension__);
9156 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9157 register_expression_parser(parse_delete, T_delete);
9158 register_expression_parser(parse_throw, T_throw);
9162 * Parse a asm statement arguments specification.
9164 static asm_argument_t *parse_asm_arguments(bool is_out)
9166 asm_argument_t *result = NULL;
9167 asm_argument_t **anchor = &result;
9169 while (token.type == T_STRING_LITERAL || token.type == '[') {
9170 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9171 memset(argument, 0, sizeof(argument[0]));
9174 if (token.type != T_IDENTIFIER) {
9175 parse_error_expected("while parsing asm argument",
9176 T_IDENTIFIER, NULL);
9179 argument->symbol = token.symbol;
9181 expect(']', end_error);
9184 argument->constraints = parse_string_literals();
9185 expect('(', end_error);
9186 add_anchor_token(')');
9187 expression_t *expression = parse_expression();
9188 rem_anchor_token(')');
9190 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9191 * change size or type representation (e.g. int -> long is ok, but
9192 * int -> float is not) */
9193 if (expression->kind == EXPR_UNARY_CAST) {
9194 type_t *const type = expression->base.type;
9195 type_kind_t const kind = type->kind;
9196 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9199 if (kind == TYPE_ATOMIC) {
9200 atomic_type_kind_t const akind = type->atomic.akind;
9201 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9202 size = get_atomic_type_size(akind);
9204 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9205 size = get_atomic_type_size(get_intptr_kind());
9209 expression_t *const value = expression->unary.value;
9210 type_t *const value_type = value->base.type;
9211 type_kind_t const value_kind = value_type->kind;
9213 unsigned value_flags;
9214 unsigned value_size;
9215 if (value_kind == TYPE_ATOMIC) {
9216 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9217 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9218 value_size = get_atomic_type_size(value_akind);
9219 } else if (value_kind == TYPE_POINTER) {
9220 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9221 value_size = get_atomic_type_size(get_intptr_kind());
9226 if (value_flags != flags || value_size != size)
9230 } while (expression->kind == EXPR_UNARY_CAST);
9234 if (!is_lvalue(expression)) {
9235 errorf(&expression->base.source_position,
9236 "asm output argument is not an lvalue");
9239 if (argument->constraints.begin[0] == '=')
9240 determine_lhs_ent(expression, NULL);
9242 mark_vars_read(expression, NULL);
9244 mark_vars_read(expression, NULL);
9246 argument->expression = expression;
9247 expect(')', end_error);
9249 set_address_taken(expression, true);
9252 anchor = &argument->next;
9264 * Parse a asm statement clobber specification.
9266 static asm_clobber_t *parse_asm_clobbers(void)
9268 asm_clobber_t *result = NULL;
9269 asm_clobber_t **anchor = &result;
9271 while (token.type == T_STRING_LITERAL) {
9272 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9273 clobber->clobber = parse_string_literals();
9276 anchor = &clobber->next;
9286 * Parse an asm statement.
9288 static statement_t *parse_asm_statement(void)
9290 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9291 asm_statement_t *asm_statement = &statement->asms;
9295 if (next_if(T_volatile))
9296 asm_statement->is_volatile = true;
9298 expect('(', end_error);
9299 add_anchor_token(')');
9300 if (token.type != T_STRING_LITERAL) {
9301 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9304 asm_statement->asm_text = parse_string_literals();
9306 add_anchor_token(':');
9307 if (!next_if(':')) {
9308 rem_anchor_token(':');
9312 asm_statement->outputs = parse_asm_arguments(true);
9313 if (!next_if(':')) {
9314 rem_anchor_token(':');
9318 asm_statement->inputs = parse_asm_arguments(false);
9319 if (!next_if(':')) {
9320 rem_anchor_token(':');
9323 rem_anchor_token(':');
9325 asm_statement->clobbers = parse_asm_clobbers();
9328 rem_anchor_token(')');
9329 expect(')', end_error);
9330 expect(';', end_error);
9332 if (asm_statement->outputs == NULL) {
9333 /* GCC: An 'asm' instruction without any output operands will be treated
9334 * identically to a volatile 'asm' instruction. */
9335 asm_statement->is_volatile = true;
9340 return create_invalid_statement();
9343 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9345 statement_t *inner_stmt;
9346 switch (token.type) {
9348 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9349 inner_stmt = create_invalid_statement();
9353 if (label->kind == STATEMENT_LABEL) {
9354 /* Eat an empty statement here, to avoid the warning about an empty
9355 * statement after a label. label:; is commonly used to have a label
9356 * before a closing brace. */
9357 inner_stmt = create_empty_statement();
9364 inner_stmt = parse_statement();
9365 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9366 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9367 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9375 * Parse a case statement.
9377 static statement_t *parse_case_statement(void)
9379 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9380 source_position_t *const pos = &statement->base.source_position;
9384 expression_t *const expression = parse_expression();
9385 statement->case_label.expression = expression;
9386 expression_classification_t const expr_class = is_constant_expression(expression);
9387 if (expr_class != EXPR_CLASS_CONSTANT) {
9388 if (expr_class != EXPR_CLASS_ERROR) {
9389 errorf(pos, "case label does not reduce to an integer constant");
9391 statement->case_label.is_bad = true;
9393 long const val = fold_constant_to_int(expression);
9394 statement->case_label.first_case = val;
9395 statement->case_label.last_case = val;
9399 if (next_if(T_DOTDOTDOT)) {
9400 expression_t *const end_range = parse_expression();
9401 statement->case_label.end_range = end_range;
9402 expression_classification_t const end_class = is_constant_expression(end_range);
9403 if (end_class != EXPR_CLASS_CONSTANT) {
9404 if (end_class != EXPR_CLASS_ERROR) {
9405 errorf(pos, "case range does not reduce to an integer constant");
9407 statement->case_label.is_bad = true;
9409 long const val = fold_constant_to_int(end_range);
9410 statement->case_label.last_case = val;
9412 if (warning.other && val < statement->case_label.first_case) {
9413 statement->case_label.is_empty_range = true;
9414 warningf(pos, "empty range specified");
9420 PUSH_PARENT(statement);
9422 expect(':', end_error);
9425 if (current_switch != NULL) {
9426 if (! statement->case_label.is_bad) {
9427 /* Check for duplicate case values */
9428 case_label_statement_t *c = &statement->case_label;
9429 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9430 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9433 if (c->last_case < l->first_case || c->first_case > l->last_case)
9436 errorf(pos, "duplicate case value (previously used %P)",
9437 &l->base.source_position);
9441 /* link all cases into the switch statement */
9442 if (current_switch->last_case == NULL) {
9443 current_switch->first_case = &statement->case_label;
9445 current_switch->last_case->next = &statement->case_label;
9447 current_switch->last_case = &statement->case_label;
9449 errorf(pos, "case label not within a switch statement");
9452 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9459 * Parse a default statement.
9461 static statement_t *parse_default_statement(void)
9463 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9467 PUSH_PARENT(statement);
9469 expect(':', end_error);
9472 if (current_switch != NULL) {
9473 const case_label_statement_t *def_label = current_switch->default_label;
9474 if (def_label != NULL) {
9475 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9476 &def_label->base.source_position);
9478 current_switch->default_label = &statement->case_label;
9480 /* link all cases into the switch statement */
9481 if (current_switch->last_case == NULL) {
9482 current_switch->first_case = &statement->case_label;
9484 current_switch->last_case->next = &statement->case_label;
9486 current_switch->last_case = &statement->case_label;
9489 errorf(&statement->base.source_position,
9490 "'default' label not within a switch statement");
9493 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9500 * Parse a label statement.
9502 static statement_t *parse_label_statement(void)
9504 assert(token.type == T_IDENTIFIER);
9505 symbol_t *symbol = token.symbol;
9506 label_t *label = get_label(symbol);
9508 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9509 statement->label.label = label;
9513 PUSH_PARENT(statement);
9515 /* if statement is already set then the label is defined twice,
9516 * otherwise it was just mentioned in a goto/local label declaration so far
9518 if (label->statement != NULL) {
9519 errorf(HERE, "duplicate label '%Y' (declared %P)",
9520 symbol, &label->base.source_position);
9522 label->base.source_position = token.source_position;
9523 label->statement = statement;
9528 statement->label.statement = parse_label_inner_statement(statement, "label");
9530 /* remember the labels in a list for later checking */
9531 *label_anchor = &statement->label;
9532 label_anchor = &statement->label.next;
9539 * Parse an if statement.
9541 static statement_t *parse_if(void)
9543 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9547 PUSH_PARENT(statement);
9549 add_anchor_token('{');
9551 expect('(', end_error);
9552 add_anchor_token(')');
9553 expression_t *const expr = parse_expression();
9554 statement->ifs.condition = expr;
9555 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9557 semantic_condition(expr, "condition of 'if'-statment");
9558 mark_vars_read(expr, NULL);
9559 rem_anchor_token(')');
9560 expect(')', end_error);
9563 rem_anchor_token('{');
9565 add_anchor_token(T_else);
9566 statement_t *const true_stmt = parse_statement();
9567 statement->ifs.true_statement = true_stmt;
9568 rem_anchor_token(T_else);
9570 if (next_if(T_else)) {
9571 statement->ifs.false_statement = parse_statement();
9572 } else if (warning.parentheses &&
9573 true_stmt->kind == STATEMENT_IF &&
9574 true_stmt->ifs.false_statement != NULL) {
9575 warningf(&true_stmt->base.source_position,
9576 "suggest explicit braces to avoid ambiguous 'else'");
9584 * Check that all enums are handled in a switch.
9586 * @param statement the switch statement to check
9588 static void check_enum_cases(const switch_statement_t *statement)
9590 const type_t *type = skip_typeref(statement->expression->base.type);
9591 if (! is_type_enum(type))
9593 const enum_type_t *enumt = &type->enumt;
9595 /* if we have a default, no warnings */
9596 if (statement->default_label != NULL)
9599 /* FIXME: calculation of value should be done while parsing */
9600 /* TODO: quadratic algorithm here. Change to an n log n one */
9601 long last_value = -1;
9602 const entity_t *entry = enumt->enume->base.next;
9603 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9604 entry = entry->base.next) {
9605 const expression_t *expression = entry->enum_value.value;
9606 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9608 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9609 if (l->expression == NULL)
9611 if (l->first_case <= value && value <= l->last_case) {
9617 warningf(&statement->base.source_position,
9618 "enumeration value '%Y' not handled in switch",
9619 entry->base.symbol);
9626 * Parse a switch statement.
9628 static statement_t *parse_switch(void)
9630 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9634 PUSH_PARENT(statement);
9636 expect('(', end_error);
9637 add_anchor_token(')');
9638 expression_t *const expr = parse_expression();
9639 mark_vars_read(expr, NULL);
9640 type_t * type = skip_typeref(expr->base.type);
9641 if (is_type_integer(type)) {
9642 type = promote_integer(type);
9643 if (warning.traditional) {
9644 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9645 warningf(&expr->base.source_position,
9646 "'%T' switch expression not converted to '%T' in ISO C",
9650 } else if (is_type_valid(type)) {
9651 errorf(&expr->base.source_position,
9652 "switch quantity is not an integer, but '%T'", type);
9653 type = type_error_type;
9655 statement->switchs.expression = create_implicit_cast(expr, type);
9656 expect(')', end_error);
9657 rem_anchor_token(')');
9659 switch_statement_t *rem = current_switch;
9660 current_switch = &statement->switchs;
9661 statement->switchs.body = parse_statement();
9662 current_switch = rem;
9664 if (warning.switch_default &&
9665 statement->switchs.default_label == NULL) {
9666 warningf(&statement->base.source_position, "switch has no default case");
9668 if (warning.switch_enum)
9669 check_enum_cases(&statement->switchs);
9675 return create_invalid_statement();
9678 static statement_t *parse_loop_body(statement_t *const loop)
9680 statement_t *const rem = current_loop;
9681 current_loop = loop;
9683 statement_t *const body = parse_statement();
9690 * Parse a while statement.
9692 static statement_t *parse_while(void)
9694 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9698 PUSH_PARENT(statement);
9700 expect('(', end_error);
9701 add_anchor_token(')');
9702 expression_t *const cond = parse_expression();
9703 statement->whiles.condition = cond;
9704 /* §6.8.5:2 The controlling expression of an iteration statement shall
9705 * have scalar type. */
9706 semantic_condition(cond, "condition of 'while'-statement");
9707 mark_vars_read(cond, NULL);
9708 rem_anchor_token(')');
9709 expect(')', end_error);
9711 statement->whiles.body = parse_loop_body(statement);
9717 return create_invalid_statement();
9721 * Parse a do statement.
9723 static statement_t *parse_do(void)
9725 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9729 PUSH_PARENT(statement);
9731 add_anchor_token(T_while);
9732 statement->do_while.body = parse_loop_body(statement);
9733 rem_anchor_token(T_while);
9735 expect(T_while, end_error);
9736 expect('(', end_error);
9737 add_anchor_token(')');
9738 expression_t *const cond = parse_expression();
9739 statement->do_while.condition = cond;
9740 /* §6.8.5:2 The controlling expression of an iteration statement shall
9741 * have scalar type. */
9742 semantic_condition(cond, "condition of 'do-while'-statement");
9743 mark_vars_read(cond, NULL);
9744 rem_anchor_token(')');
9745 expect(')', end_error);
9746 expect(';', end_error);
9752 return create_invalid_statement();
9756 * Parse a for statement.
9758 static statement_t *parse_for(void)
9760 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9764 expect('(', end_error1);
9765 add_anchor_token(')');
9767 PUSH_PARENT(statement);
9769 size_t const top = environment_top();
9770 scope_t *old_scope = scope_push(&statement->fors.scope);
9772 bool old_gcc_extension = in_gcc_extension;
9773 while (next_if(T___extension__)) {
9774 in_gcc_extension = true;
9778 } else if (is_declaration_specifier(&token, false)) {
9779 parse_declaration(record_entity, DECL_FLAGS_NONE);
9781 add_anchor_token(';');
9782 expression_t *const init = parse_expression();
9783 statement->fors.initialisation = init;
9784 mark_vars_read(init, ENT_ANY);
9785 if (warning.unused_value && !expression_has_effect(init)) {
9786 warningf(&init->base.source_position,
9787 "initialisation of 'for'-statement has no effect");
9789 rem_anchor_token(';');
9790 expect(';', end_error2);
9792 in_gcc_extension = old_gcc_extension;
9794 if (token.type != ';') {
9795 add_anchor_token(';');
9796 expression_t *const cond = parse_expression();
9797 statement->fors.condition = cond;
9798 /* §6.8.5:2 The controlling expression of an iteration statement
9799 * shall have scalar type. */
9800 semantic_condition(cond, "condition of 'for'-statement");
9801 mark_vars_read(cond, NULL);
9802 rem_anchor_token(';');
9804 expect(';', end_error2);
9805 if (token.type != ')') {
9806 expression_t *const step = parse_expression();
9807 statement->fors.step = step;
9808 mark_vars_read(step, ENT_ANY);
9809 if (warning.unused_value && !expression_has_effect(step)) {
9810 warningf(&step->base.source_position,
9811 "step of 'for'-statement has no effect");
9814 expect(')', end_error2);
9815 rem_anchor_token(')');
9816 statement->fors.body = parse_loop_body(statement);
9818 assert(current_scope == &statement->fors.scope);
9819 scope_pop(old_scope);
9820 environment_pop_to(top);
9827 rem_anchor_token(')');
9828 assert(current_scope == &statement->fors.scope);
9829 scope_pop(old_scope);
9830 environment_pop_to(top);
9834 return create_invalid_statement();
9838 * Parse a goto statement.
9840 static statement_t *parse_goto(void)
9842 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9845 if (GNU_MODE && next_if('*')) {
9846 expression_t *expression = parse_expression();
9847 mark_vars_read(expression, NULL);
9849 /* Argh: although documentation says the expression must be of type void*,
9850 * gcc accepts anything that can be casted into void* without error */
9851 type_t *type = expression->base.type;
9853 if (type != type_error_type) {
9854 if (!is_type_pointer(type) && !is_type_integer(type)) {
9855 errorf(&expression->base.source_position,
9856 "cannot convert to a pointer type");
9857 } else if (warning.other && type != type_void_ptr) {
9858 warningf(&expression->base.source_position,
9859 "type of computed goto expression should be 'void*' not '%T'", type);
9861 expression = create_implicit_cast(expression, type_void_ptr);
9864 statement->gotos.expression = expression;
9865 } else if (token.type == T_IDENTIFIER) {
9866 symbol_t *symbol = token.symbol;
9868 statement->gotos.label = get_label(symbol);
9871 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9873 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9875 return create_invalid_statement();
9878 /* remember the goto's in a list for later checking */
9879 *goto_anchor = &statement->gotos;
9880 goto_anchor = &statement->gotos.next;
9882 expect(';', end_error);
9889 * Parse a continue statement.
9891 static statement_t *parse_continue(void)
9893 if (current_loop == NULL) {
9894 errorf(HERE, "continue statement not within loop");
9897 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9900 expect(';', end_error);
9907 * Parse a break statement.
9909 static statement_t *parse_break(void)
9911 if (current_switch == NULL && current_loop == NULL) {
9912 errorf(HERE, "break statement not within loop or switch");
9915 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9918 expect(';', end_error);
9925 * Parse a __leave statement.
9927 static statement_t *parse_leave_statement(void)
9929 if (current_try == NULL) {
9930 errorf(HERE, "__leave statement not within __try");
9933 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9936 expect(';', end_error);
9943 * Check if a given entity represents a local variable.
9945 static bool is_local_variable(const entity_t *entity)
9947 if (entity->kind != ENTITY_VARIABLE)
9950 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9951 case STORAGE_CLASS_AUTO:
9952 case STORAGE_CLASS_REGISTER: {
9953 const type_t *type = skip_typeref(entity->declaration.type);
9954 if (is_type_function(type)) {
9966 * Check if a given expression represents a local variable.
9968 static bool expression_is_local_variable(const expression_t *expression)
9970 if (expression->base.kind != EXPR_REFERENCE) {
9973 const entity_t *entity = expression->reference.entity;
9974 return is_local_variable(entity);
9978 * Check if a given expression represents a local variable and
9979 * return its declaration then, else return NULL.
9981 entity_t *expression_is_variable(const expression_t *expression)
9983 if (expression->base.kind != EXPR_REFERENCE) {
9986 entity_t *entity = expression->reference.entity;
9987 if (entity->kind != ENTITY_VARIABLE)
9994 * Parse a return statement.
9996 static statement_t *parse_return(void)
10000 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10002 expression_t *return_value = NULL;
10003 if (token.type != ';') {
10004 return_value = parse_expression();
10005 mark_vars_read(return_value, NULL);
10008 const type_t *const func_type = skip_typeref(current_function->base.type);
10009 assert(is_type_function(func_type));
10010 type_t *const return_type = skip_typeref(func_type->function.return_type);
10012 source_position_t const *const pos = &statement->base.source_position;
10013 if (return_value != NULL) {
10014 type_t *return_value_type = skip_typeref(return_value->base.type);
10016 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10017 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10018 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10019 /* Only warn in C mode, because GCC does the same */
10020 if (c_mode & _CXX || strict_mode) {
10022 "'return' with a value, in function returning 'void'");
10023 } else if (warning.other) {
10025 "'return' with a value, in function returning 'void'");
10027 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10028 /* Only warn in C mode, because GCC does the same */
10031 "'return' with expression in function returning 'void'");
10032 } else if (warning.other) {
10034 "'return' with expression in function returning 'void'");
10038 assign_error_t error = semantic_assign(return_type, return_value);
10039 report_assign_error(error, return_type, return_value, "'return'",
10042 return_value = create_implicit_cast(return_value, return_type);
10043 /* check for returning address of a local var */
10044 if (warning.other && return_value != NULL
10045 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10046 const expression_t *expression = return_value->unary.value;
10047 if (expression_is_local_variable(expression)) {
10048 warningf(pos, "function returns address of local variable");
10051 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10052 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10053 if (c_mode & _CXX || strict_mode) {
10055 "'return' without value, in function returning non-void");
10058 "'return' without value, in function returning non-void");
10061 statement->returns.value = return_value;
10063 expect(';', end_error);
10070 * Parse a declaration statement.
10072 static statement_t *parse_declaration_statement(void)
10074 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10076 entity_t *before = current_scope->last_entity;
10078 parse_external_declaration();
10080 parse_declaration(record_entity, DECL_FLAGS_NONE);
10083 declaration_statement_t *const decl = &statement->declaration;
10084 entity_t *const begin =
10085 before != NULL ? before->base.next : current_scope->entities;
10086 decl->declarations_begin = begin;
10087 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10093 * Parse an expression statement, ie. expr ';'.
10095 static statement_t *parse_expression_statement(void)
10097 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10099 expression_t *const expr = parse_expression();
10100 statement->expression.expression = expr;
10101 mark_vars_read(expr, ENT_ANY);
10103 expect(';', end_error);
10110 * Parse a microsoft __try { } __finally { } or
10111 * __try{ } __except() { }
10113 static statement_t *parse_ms_try_statment(void)
10115 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10118 PUSH_PARENT(statement);
10120 ms_try_statement_t *rem = current_try;
10121 current_try = &statement->ms_try;
10122 statement->ms_try.try_statement = parse_compound_statement(false);
10127 if (next_if(T___except)) {
10128 expect('(', end_error);
10129 add_anchor_token(')');
10130 expression_t *const expr = parse_expression();
10131 mark_vars_read(expr, NULL);
10132 type_t * type = skip_typeref(expr->base.type);
10133 if (is_type_integer(type)) {
10134 type = promote_integer(type);
10135 } else if (is_type_valid(type)) {
10136 errorf(&expr->base.source_position,
10137 "__expect expression is not an integer, but '%T'", type);
10138 type = type_error_type;
10140 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10141 rem_anchor_token(')');
10142 expect(')', end_error);
10143 statement->ms_try.final_statement = parse_compound_statement(false);
10144 } else if (next_if(T__finally)) {
10145 statement->ms_try.final_statement = parse_compound_statement(false);
10147 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10148 return create_invalid_statement();
10152 return create_invalid_statement();
10155 static statement_t *parse_empty_statement(void)
10157 if (warning.empty_statement) {
10158 warningf(HERE, "statement is empty");
10160 statement_t *const statement = create_empty_statement();
10165 static statement_t *parse_local_label_declaration(void)
10167 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10171 entity_t *begin = NULL;
10172 entity_t *end = NULL;
10173 entity_t **anchor = &begin;
10175 if (token.type != T_IDENTIFIER) {
10176 parse_error_expected("while parsing local label declaration",
10177 T_IDENTIFIER, NULL);
10180 symbol_t *symbol = token.symbol;
10181 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10182 if (entity != NULL && entity->base.parent_scope == current_scope) {
10183 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10184 symbol, &entity->base.source_position);
10186 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10188 entity->base.parent_scope = current_scope;
10189 entity->base.namespc = NAMESPACE_LABEL;
10190 entity->base.source_position = token.source_position;
10191 entity->base.symbol = symbol;
10194 anchor = &entity->base.next;
10197 environment_push(entity);
10200 } while (next_if(','));
10201 expect(';', end_error);
10203 statement->declaration.declarations_begin = begin;
10204 statement->declaration.declarations_end = end;
10208 static void parse_namespace_definition(void)
10212 entity_t *entity = NULL;
10213 symbol_t *symbol = NULL;
10215 if (token.type == T_IDENTIFIER) {
10216 symbol = token.symbol;
10219 entity = get_entity(symbol, NAMESPACE_NORMAL);
10221 && entity->kind != ENTITY_NAMESPACE
10222 && entity->base.parent_scope == current_scope) {
10223 if (is_entity_valid(entity)) {
10224 error_redefined_as_different_kind(&token.source_position,
10225 entity, ENTITY_NAMESPACE);
10231 if (entity == NULL) {
10232 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10233 entity->base.symbol = symbol;
10234 entity->base.source_position = token.source_position;
10235 entity->base.namespc = NAMESPACE_NORMAL;
10236 entity->base.parent_scope = current_scope;
10239 if (token.type == '=') {
10240 /* TODO: parse namespace alias */
10241 panic("namespace alias definition not supported yet");
10244 environment_push(entity);
10245 append_entity(current_scope, entity);
10247 size_t const top = environment_top();
10248 scope_t *old_scope = scope_push(&entity->namespacee.members);
10250 entity_t *old_current_entity = current_entity;
10251 current_entity = entity;
10253 expect('{', end_error);
10255 expect('}', end_error);
10258 assert(current_scope == &entity->namespacee.members);
10259 assert(current_entity == entity);
10260 current_entity = old_current_entity;
10261 scope_pop(old_scope);
10262 environment_pop_to(top);
10266 * Parse a statement.
10267 * There's also parse_statement() which additionally checks for
10268 * "statement has no effect" warnings
10270 static statement_t *intern_parse_statement(void)
10272 statement_t *statement = NULL;
10274 /* declaration or statement */
10275 add_anchor_token(';');
10276 switch (token.type) {
10277 case T_IDENTIFIER: {
10278 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10279 if (la1_type == ':') {
10280 statement = parse_label_statement();
10281 } else if (is_typedef_symbol(token.symbol)) {
10282 statement = parse_declaration_statement();
10284 /* it's an identifier, the grammar says this must be an
10285 * expression statement. However it is common that users mistype
10286 * declaration types, so we guess a bit here to improve robustness
10287 * for incorrect programs */
10288 switch (la1_type) {
10291 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10293 statement = parse_expression_statement();
10297 statement = parse_declaration_statement();
10305 case T___extension__:
10306 /* This can be a prefix to a declaration or an expression statement.
10307 * We simply eat it now and parse the rest with tail recursion. */
10308 while (next_if(T___extension__)) {}
10309 bool old_gcc_extension = in_gcc_extension;
10310 in_gcc_extension = true;
10311 statement = intern_parse_statement();
10312 in_gcc_extension = old_gcc_extension;
10316 statement = parse_declaration_statement();
10320 statement = parse_local_label_declaration();
10323 case ';': statement = parse_empty_statement(); break;
10324 case '{': statement = parse_compound_statement(false); break;
10325 case T___leave: statement = parse_leave_statement(); break;
10326 case T___try: statement = parse_ms_try_statment(); break;
10327 case T_asm: statement = parse_asm_statement(); break;
10328 case T_break: statement = parse_break(); break;
10329 case T_case: statement = parse_case_statement(); break;
10330 case T_continue: statement = parse_continue(); break;
10331 case T_default: statement = parse_default_statement(); break;
10332 case T_do: statement = parse_do(); break;
10333 case T_for: statement = parse_for(); break;
10334 case T_goto: statement = parse_goto(); break;
10335 case T_if: statement = parse_if(); break;
10336 case T_return: statement = parse_return(); break;
10337 case T_switch: statement = parse_switch(); break;
10338 case T_while: statement = parse_while(); break;
10341 statement = parse_expression_statement();
10345 errorf(HERE, "unexpected token %K while parsing statement", &token);
10346 statement = create_invalid_statement();
10351 rem_anchor_token(';');
10353 assert(statement != NULL
10354 && statement->base.source_position.input_name != NULL);
10360 * parse a statement and emits "statement has no effect" warning if needed
10361 * (This is really a wrapper around intern_parse_statement with check for 1
10362 * single warning. It is needed, because for statement expressions we have
10363 * to avoid the warning on the last statement)
10365 static statement_t *parse_statement(void)
10367 statement_t *statement = intern_parse_statement();
10369 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10370 expression_t *expression = statement->expression.expression;
10371 if (!expression_has_effect(expression)) {
10372 warningf(&expression->base.source_position,
10373 "statement has no effect");
10381 * Parse a compound statement.
10383 static statement_t *parse_compound_statement(bool inside_expression_statement)
10385 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10387 PUSH_PARENT(statement);
10390 add_anchor_token('}');
10391 /* tokens, which can start a statement */
10392 /* TODO MS, __builtin_FOO */
10393 add_anchor_token('!');
10394 add_anchor_token('&');
10395 add_anchor_token('(');
10396 add_anchor_token('*');
10397 add_anchor_token('+');
10398 add_anchor_token('-');
10399 add_anchor_token('{');
10400 add_anchor_token('~');
10401 add_anchor_token(T_CHARACTER_CONSTANT);
10402 add_anchor_token(T_COLONCOLON);
10403 add_anchor_token(T_FLOATINGPOINT);
10404 add_anchor_token(T_IDENTIFIER);
10405 add_anchor_token(T_INTEGER);
10406 add_anchor_token(T_MINUSMINUS);
10407 add_anchor_token(T_PLUSPLUS);
10408 add_anchor_token(T_STRING_LITERAL);
10409 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10410 add_anchor_token(T_WIDE_STRING_LITERAL);
10411 add_anchor_token(T__Bool);
10412 add_anchor_token(T__Complex);
10413 add_anchor_token(T__Imaginary);
10414 add_anchor_token(T___FUNCTION__);
10415 add_anchor_token(T___PRETTY_FUNCTION__);
10416 add_anchor_token(T___alignof__);
10417 add_anchor_token(T___attribute__);
10418 add_anchor_token(T___builtin_va_start);
10419 add_anchor_token(T___extension__);
10420 add_anchor_token(T___func__);
10421 add_anchor_token(T___imag__);
10422 add_anchor_token(T___label__);
10423 add_anchor_token(T___real__);
10424 add_anchor_token(T___thread);
10425 add_anchor_token(T_asm);
10426 add_anchor_token(T_auto);
10427 add_anchor_token(T_bool);
10428 add_anchor_token(T_break);
10429 add_anchor_token(T_case);
10430 add_anchor_token(T_char);
10431 add_anchor_token(T_class);
10432 add_anchor_token(T_const);
10433 add_anchor_token(T_const_cast);
10434 add_anchor_token(T_continue);
10435 add_anchor_token(T_default);
10436 add_anchor_token(T_delete);
10437 add_anchor_token(T_double);
10438 add_anchor_token(T_do);
10439 add_anchor_token(T_dynamic_cast);
10440 add_anchor_token(T_enum);
10441 add_anchor_token(T_extern);
10442 add_anchor_token(T_false);
10443 add_anchor_token(T_float);
10444 add_anchor_token(T_for);
10445 add_anchor_token(T_goto);
10446 add_anchor_token(T_if);
10447 add_anchor_token(T_inline);
10448 add_anchor_token(T_int);
10449 add_anchor_token(T_long);
10450 add_anchor_token(T_new);
10451 add_anchor_token(T_operator);
10452 add_anchor_token(T_register);
10453 add_anchor_token(T_reinterpret_cast);
10454 add_anchor_token(T_restrict);
10455 add_anchor_token(T_return);
10456 add_anchor_token(T_short);
10457 add_anchor_token(T_signed);
10458 add_anchor_token(T_sizeof);
10459 add_anchor_token(T_static);
10460 add_anchor_token(T_static_cast);
10461 add_anchor_token(T_struct);
10462 add_anchor_token(T_switch);
10463 add_anchor_token(T_template);
10464 add_anchor_token(T_this);
10465 add_anchor_token(T_throw);
10466 add_anchor_token(T_true);
10467 add_anchor_token(T_try);
10468 add_anchor_token(T_typedef);
10469 add_anchor_token(T_typeid);
10470 add_anchor_token(T_typename);
10471 add_anchor_token(T_typeof);
10472 add_anchor_token(T_union);
10473 add_anchor_token(T_unsigned);
10474 add_anchor_token(T_using);
10475 add_anchor_token(T_void);
10476 add_anchor_token(T_volatile);
10477 add_anchor_token(T_wchar_t);
10478 add_anchor_token(T_while);
10480 size_t const top = environment_top();
10481 scope_t *old_scope = scope_push(&statement->compound.scope);
10483 statement_t **anchor = &statement->compound.statements;
10484 bool only_decls_so_far = true;
10485 while (token.type != '}') {
10486 if (token.type == T_EOF) {
10487 errorf(&statement->base.source_position,
10488 "EOF while parsing compound statement");
10491 statement_t *sub_statement = intern_parse_statement();
10492 if (is_invalid_statement(sub_statement)) {
10493 /* an error occurred. if we are at an anchor, return */
10499 if (warning.declaration_after_statement) {
10500 if (sub_statement->kind != STATEMENT_DECLARATION) {
10501 only_decls_so_far = false;
10502 } else if (!only_decls_so_far) {
10503 warningf(&sub_statement->base.source_position,
10504 "ISO C90 forbids mixed declarations and code");
10508 *anchor = sub_statement;
10510 while (sub_statement->base.next != NULL)
10511 sub_statement = sub_statement->base.next;
10513 anchor = &sub_statement->base.next;
10517 /* look over all statements again to produce no effect warnings */
10518 if (warning.unused_value) {
10519 statement_t *sub_statement = statement->compound.statements;
10520 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10521 if (sub_statement->kind != STATEMENT_EXPRESSION)
10523 /* don't emit a warning for the last expression in an expression
10524 * statement as it has always an effect */
10525 if (inside_expression_statement && sub_statement->base.next == NULL)
10528 expression_t *expression = sub_statement->expression.expression;
10529 if (!expression_has_effect(expression)) {
10530 warningf(&expression->base.source_position,
10531 "statement has no effect");
10537 rem_anchor_token(T_while);
10538 rem_anchor_token(T_wchar_t);
10539 rem_anchor_token(T_volatile);
10540 rem_anchor_token(T_void);
10541 rem_anchor_token(T_using);
10542 rem_anchor_token(T_unsigned);
10543 rem_anchor_token(T_union);
10544 rem_anchor_token(T_typeof);
10545 rem_anchor_token(T_typename);
10546 rem_anchor_token(T_typeid);
10547 rem_anchor_token(T_typedef);
10548 rem_anchor_token(T_try);
10549 rem_anchor_token(T_true);
10550 rem_anchor_token(T_throw);
10551 rem_anchor_token(T_this);
10552 rem_anchor_token(T_template);
10553 rem_anchor_token(T_switch);
10554 rem_anchor_token(T_struct);
10555 rem_anchor_token(T_static_cast);
10556 rem_anchor_token(T_static);
10557 rem_anchor_token(T_sizeof);
10558 rem_anchor_token(T_signed);
10559 rem_anchor_token(T_short);
10560 rem_anchor_token(T_return);
10561 rem_anchor_token(T_restrict);
10562 rem_anchor_token(T_reinterpret_cast);
10563 rem_anchor_token(T_register);
10564 rem_anchor_token(T_operator);
10565 rem_anchor_token(T_new);
10566 rem_anchor_token(T_long);
10567 rem_anchor_token(T_int);
10568 rem_anchor_token(T_inline);
10569 rem_anchor_token(T_if);
10570 rem_anchor_token(T_goto);
10571 rem_anchor_token(T_for);
10572 rem_anchor_token(T_float);
10573 rem_anchor_token(T_false);
10574 rem_anchor_token(T_extern);
10575 rem_anchor_token(T_enum);
10576 rem_anchor_token(T_dynamic_cast);
10577 rem_anchor_token(T_do);
10578 rem_anchor_token(T_double);
10579 rem_anchor_token(T_delete);
10580 rem_anchor_token(T_default);
10581 rem_anchor_token(T_continue);
10582 rem_anchor_token(T_const_cast);
10583 rem_anchor_token(T_const);
10584 rem_anchor_token(T_class);
10585 rem_anchor_token(T_char);
10586 rem_anchor_token(T_case);
10587 rem_anchor_token(T_break);
10588 rem_anchor_token(T_bool);
10589 rem_anchor_token(T_auto);
10590 rem_anchor_token(T_asm);
10591 rem_anchor_token(T___thread);
10592 rem_anchor_token(T___real__);
10593 rem_anchor_token(T___label__);
10594 rem_anchor_token(T___imag__);
10595 rem_anchor_token(T___func__);
10596 rem_anchor_token(T___extension__);
10597 rem_anchor_token(T___builtin_va_start);
10598 rem_anchor_token(T___attribute__);
10599 rem_anchor_token(T___alignof__);
10600 rem_anchor_token(T___PRETTY_FUNCTION__);
10601 rem_anchor_token(T___FUNCTION__);
10602 rem_anchor_token(T__Imaginary);
10603 rem_anchor_token(T__Complex);
10604 rem_anchor_token(T__Bool);
10605 rem_anchor_token(T_WIDE_STRING_LITERAL);
10606 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10607 rem_anchor_token(T_STRING_LITERAL);
10608 rem_anchor_token(T_PLUSPLUS);
10609 rem_anchor_token(T_MINUSMINUS);
10610 rem_anchor_token(T_INTEGER);
10611 rem_anchor_token(T_IDENTIFIER);
10612 rem_anchor_token(T_FLOATINGPOINT);
10613 rem_anchor_token(T_COLONCOLON);
10614 rem_anchor_token(T_CHARACTER_CONSTANT);
10615 rem_anchor_token('~');
10616 rem_anchor_token('{');
10617 rem_anchor_token('-');
10618 rem_anchor_token('+');
10619 rem_anchor_token('*');
10620 rem_anchor_token('(');
10621 rem_anchor_token('&');
10622 rem_anchor_token('!');
10623 rem_anchor_token('}');
10624 assert(current_scope == &statement->compound.scope);
10625 scope_pop(old_scope);
10626 environment_pop_to(top);
10633 * Check for unused global static functions and variables
10635 static void check_unused_globals(void)
10637 if (!warning.unused_function && !warning.unused_variable)
10640 for (const entity_t *entity = file_scope->entities; entity != NULL;
10641 entity = entity->base.next) {
10642 if (!is_declaration(entity))
10645 const declaration_t *declaration = &entity->declaration;
10646 if (declaration->used ||
10647 declaration->modifiers & DM_UNUSED ||
10648 declaration->modifiers & DM_USED ||
10649 declaration->storage_class != STORAGE_CLASS_STATIC)
10652 type_t *const type = declaration->type;
10654 if (entity->kind == ENTITY_FUNCTION) {
10655 /* inhibit warning for static inline functions */
10656 if (entity->function.is_inline)
10659 s = entity->function.statement != NULL ? "defined" : "declared";
10664 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10665 type, declaration->base.symbol, s);
10669 static void parse_global_asm(void)
10671 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10674 expect('(', end_error);
10676 statement->asms.asm_text = parse_string_literals();
10677 statement->base.next = unit->global_asm;
10678 unit->global_asm = statement;
10680 expect(')', end_error);
10681 expect(';', end_error);
10686 static void parse_linkage_specification(void)
10690 const char *linkage = parse_string_literals().begin;
10692 linkage_kind_t old_linkage = current_linkage;
10693 linkage_kind_t new_linkage;
10694 if (strcmp(linkage, "C") == 0) {
10695 new_linkage = LINKAGE_C;
10696 } else if (strcmp(linkage, "C++") == 0) {
10697 new_linkage = LINKAGE_CXX;
10699 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10700 new_linkage = LINKAGE_INVALID;
10702 current_linkage = new_linkage;
10704 if (next_if('{')) {
10706 expect('}', end_error);
10712 assert(current_linkage == new_linkage);
10713 current_linkage = old_linkage;
10716 static void parse_external(void)
10718 switch (token.type) {
10719 DECLARATION_START_NO_EXTERN
10721 case T___extension__:
10722 /* tokens below are for implicit int */
10723 case '&': /* & x; -> int& x; (and error later, because C++ has no
10725 case '*': /* * x; -> int* x; */
10726 case '(': /* (x); -> int (x); */
10727 parse_external_declaration();
10731 if (look_ahead(1)->type == T_STRING_LITERAL) {
10732 parse_linkage_specification();
10734 parse_external_declaration();
10739 parse_global_asm();
10743 parse_namespace_definition();
10747 if (!strict_mode) {
10749 warningf(HERE, "stray ';' outside of function");
10756 errorf(HERE, "stray %K outside of function", &token);
10757 if (token.type == '(' || token.type == '{' || token.type == '[')
10758 eat_until_matching_token(token.type);
10764 static void parse_externals(void)
10766 add_anchor_token('}');
10767 add_anchor_token(T_EOF);
10770 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10771 unsigned char token_anchor_copy[T_LAST_TOKEN];
10772 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10775 while (token.type != T_EOF && token.type != '}') {
10777 bool anchor_leak = false;
10778 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10779 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10781 /* the anchor set and its copy differs */
10782 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10783 anchor_leak = true;
10786 if (in_gcc_extension) {
10787 /* an gcc extension scope was not closed */
10788 errorf(HERE, "Leaked __extension__");
10789 anchor_leak = true;
10799 rem_anchor_token(T_EOF);
10800 rem_anchor_token('}');
10804 * Parse a translation unit.
10806 static void parse_translation_unit(void)
10808 add_anchor_token(T_EOF);
10813 if (token.type == T_EOF)
10816 errorf(HERE, "stray %K outside of function", &token);
10817 if (token.type == '(' || token.type == '{' || token.type == '[')
10818 eat_until_matching_token(token.type);
10826 * @return the translation unit or NULL if errors occurred.
10828 void start_parsing(void)
10830 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10831 label_stack = NEW_ARR_F(stack_entry_t, 0);
10832 diagnostic_count = 0;
10836 print_to_file(stderr);
10838 assert(unit == NULL);
10839 unit = allocate_ast_zero(sizeof(unit[0]));
10841 assert(file_scope == NULL);
10842 file_scope = &unit->scope;
10844 assert(current_scope == NULL);
10845 scope_push(&unit->scope);
10847 create_gnu_builtins();
10849 create_microsoft_intrinsics();
10852 translation_unit_t *finish_parsing(void)
10854 assert(current_scope == &unit->scope);
10857 assert(file_scope == &unit->scope);
10858 check_unused_globals();
10861 DEL_ARR_F(environment_stack);
10862 DEL_ARR_F(label_stack);
10864 translation_unit_t *result = unit;
10869 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10870 * are given length one. */
10871 static void complete_incomplete_arrays(void)
10873 size_t n = ARR_LEN(incomplete_arrays);
10874 for (size_t i = 0; i != n; ++i) {
10875 declaration_t *const decl = incomplete_arrays[i];
10876 type_t *const orig_type = decl->type;
10877 type_t *const type = skip_typeref(orig_type);
10879 if (!is_type_incomplete(type))
10882 if (warning.other) {
10883 warningf(&decl->base.source_position,
10884 "array '%#T' assumed to have one element",
10885 orig_type, decl->base.symbol);
10888 type_t *const new_type = duplicate_type(type);
10889 new_type->array.size_constant = true;
10890 new_type->array.has_implicit_size = true;
10891 new_type->array.size = 1;
10893 type_t *const result = identify_new_type(new_type);
10895 decl->type = result;
10899 void prepare_main_collect2(entity_t *entity)
10901 // create call to __main
10902 symbol_t *symbol = symbol_table_insert("__main");
10903 entity_t *subsubmain_ent
10904 = create_implicit_function(symbol, &builtin_source_position);
10906 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10907 type_t *ftype = subsubmain_ent->declaration.type;
10908 ref->base.source_position = builtin_source_position;
10909 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10910 ref->reference.entity = subsubmain_ent;
10912 expression_t *call = allocate_expression_zero(EXPR_CALL);
10913 call->base.source_position = builtin_source_position;
10914 call->base.type = type_void;
10915 call->call.function = ref;
10917 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10918 expr_statement->base.source_position = builtin_source_position;
10919 expr_statement->expression.expression = call;
10921 statement_t *statement = entity->function.statement;
10922 assert(statement->kind == STATEMENT_COMPOUND);
10923 compound_statement_t *compounds = &statement->compound;
10925 expr_statement->base.next = compounds->statements;
10926 compounds->statements = expr_statement;
10931 lookahead_bufpos = 0;
10932 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10935 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10936 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10937 parse_translation_unit();
10938 complete_incomplete_arrays();
10939 DEL_ARR_F(incomplete_arrays);
10940 incomplete_arrays = NULL;
10944 * Initialize the parser.
10946 void init_parser(void)
10948 sym_anonymous = symbol_table_insert("<anonymous>");
10950 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10952 init_expression_parsers();
10953 obstack_init(&temp_obst);
10955 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10956 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10960 * Terminate the parser.
10962 void exit_parser(void)
10964 obstack_free(&temp_obst, NULL);