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;
111 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
114 #define PUSH_PARENT(stmt) \
115 statement_t *const prev_parent = current_parent; \
116 ((void)(current_parent = (stmt)))
117 #define POP_PARENT ((void)(current_parent = prev_parent))
119 /** special symbol used for anonymous entities. */
120 static symbol_t *sym_anonymous = NULL;
122 /** The token anchor set */
123 static unsigned char token_anchor_set[T_LAST_TOKEN];
125 /** The current source position. */
126 #define HERE (&token.source_position)
128 /** true if we are in GCC mode. */
129 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
131 static statement_t *parse_compound_statement(bool inside_expression_statement);
132 static statement_t *parse_statement(void);
134 static expression_t *parse_subexpression(precedence_t);
135 static expression_t *parse_expression(void);
136 static type_t *parse_typename(void);
137 static void parse_externals(void);
138 static void parse_external(void);
140 static void parse_compound_type_entries(compound_t *compound_declaration);
142 static void check_call_argument(type_t *expected_type,
143 call_argument_t *argument, unsigned pos);
145 typedef enum declarator_flags_t {
147 DECL_MAY_BE_ABSTRACT = 1U << 0,
148 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
149 DECL_IS_PARAMETER = 1U << 2
150 } declarator_flags_t;
152 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
153 declarator_flags_t flags);
155 static void semantic_comparison(binary_expression_t *expression);
157 #define STORAGE_CLASSES \
158 STORAGE_CLASSES_NO_EXTERN \
161 #define STORAGE_CLASSES_NO_EXTERN \
168 #define TYPE_QUALIFIERS \
173 case T__forceinline: \
174 case T___attribute__:
176 #define COMPLEX_SPECIFIERS \
178 #define IMAGINARY_SPECIFIERS \
181 #define TYPE_SPECIFIERS \
183 case T___builtin_va_list: \
208 #define DECLARATION_START \
213 #define DECLARATION_START_NO_EXTERN \
214 STORAGE_CLASSES_NO_EXTERN \
218 #define EXPRESSION_START \
227 case T_CHARACTER_CONSTANT: \
228 case T_FLOATINGPOINT: \
229 case T_FLOATINGPOINT_HEXADECIMAL: \
231 case T_INTEGER_HEXADECIMAL: \
232 case T_INTEGER_OCTAL: \
235 case T_STRING_LITERAL: \
236 case T_WIDE_CHARACTER_CONSTANT: \
237 case T_WIDE_STRING_LITERAL: \
238 case T___FUNCDNAME__: \
239 case T___FUNCSIG__: \
240 case T___FUNCTION__: \
241 case T___PRETTY_FUNCTION__: \
242 case T___alignof__: \
243 case T___builtin_classify_type: \
244 case T___builtin_constant_p: \
245 case T___builtin_isgreater: \
246 case T___builtin_isgreaterequal: \
247 case T___builtin_isless: \
248 case T___builtin_islessequal: \
249 case T___builtin_islessgreater: \
250 case T___builtin_isunordered: \
251 case T___builtin_offsetof: \
252 case T___builtin_va_arg: \
253 case T___builtin_va_copy: \
254 case T___builtin_va_start: \
265 * Returns the size of a statement node.
267 * @param kind the statement kind
269 static size_t get_statement_struct_size(statement_kind_t kind)
271 static const size_t sizes[] = {
272 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
273 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
274 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
275 [STATEMENT_RETURN] = sizeof(return_statement_t),
276 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
277 [STATEMENT_IF] = sizeof(if_statement_t),
278 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
279 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
280 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
281 [STATEMENT_BREAK] = sizeof(statement_base_t),
282 [STATEMENT_GOTO] = sizeof(goto_statement_t),
283 [STATEMENT_LABEL] = sizeof(label_statement_t),
284 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
285 [STATEMENT_WHILE] = sizeof(while_statement_t),
286 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
287 [STATEMENT_FOR] = sizeof(for_statement_t),
288 [STATEMENT_ASM] = sizeof(asm_statement_t),
289 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
290 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
292 assert((size_t)kind < lengthof(sizes));
293 assert(sizes[kind] != 0);
298 * Returns the size of an expression node.
300 * @param kind the expression kind
302 static size_t get_expression_struct_size(expression_kind_t kind)
304 static const size_t sizes[] = {
305 [EXPR_INVALID] = sizeof(expression_base_t),
306 [EXPR_REFERENCE] = sizeof(reference_expression_t),
307 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
308 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
309 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
310 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
311 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
312 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
313 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
314 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
315 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
316 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
317 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
318 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
319 [EXPR_CALL] = sizeof(call_expression_t),
320 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
321 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
322 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
323 [EXPR_SELECT] = sizeof(select_expression_t),
324 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
325 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
326 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
327 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
328 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
329 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
330 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
331 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
332 [EXPR_VA_START] = sizeof(va_start_expression_t),
333 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
334 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
335 [EXPR_STATEMENT] = sizeof(statement_expression_t),
336 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
338 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
339 return sizes[EXPR_UNARY_FIRST];
341 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
342 return sizes[EXPR_BINARY_FIRST];
344 assert((size_t)kind < lengthof(sizes));
345 assert(sizes[kind] != 0);
350 * Allocate a statement node of given kind and initialize all
351 * fields with zero. Sets its source position to the position
352 * of the current token.
354 static statement_t *allocate_statement_zero(statement_kind_t kind)
356 size_t size = get_statement_struct_size(kind);
357 statement_t *res = allocate_ast_zero(size);
359 res->base.kind = kind;
360 res->base.parent = current_parent;
361 res->base.source_position = token.source_position;
366 * Allocate an expression node of given kind and initialize all
369 * @param kind the kind of the expression to allocate
371 static expression_t *allocate_expression_zero(expression_kind_t kind)
373 size_t size = get_expression_struct_size(kind);
374 expression_t *res = allocate_ast_zero(size);
376 res->base.kind = kind;
377 res->base.type = type_error_type;
378 res->base.source_position = token.source_position;
383 * Creates a new invalid expression at the source position
384 * of the current token.
386 static expression_t *create_invalid_expression(void)
388 return allocate_expression_zero(EXPR_INVALID);
392 * Creates a new invalid statement.
394 static statement_t *create_invalid_statement(void)
396 return allocate_statement_zero(STATEMENT_INVALID);
400 * Allocate a new empty statement.
402 static statement_t *create_empty_statement(void)
404 return allocate_statement_zero(STATEMENT_EMPTY);
407 static function_parameter_t *allocate_parameter(type_t *const type)
409 function_parameter_t *const param
410 = obstack_alloc(type_obst, sizeof(*param));
411 memset(param, 0, sizeof(*param));
417 * Returns the size of an initializer node.
419 * @param kind the initializer kind
421 static size_t get_initializer_size(initializer_kind_t kind)
423 static const size_t sizes[] = {
424 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
425 [INITIALIZER_STRING] = sizeof(initializer_string_t),
426 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
427 [INITIALIZER_LIST] = sizeof(initializer_list_t),
428 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
430 assert((size_t)kind < lengthof(sizes));
431 assert(sizes[kind] != 0);
436 * Allocate an initializer node of given kind and initialize all
439 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
441 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
448 * Returns the index of the top element of the environment stack.
450 static size_t environment_top(void)
452 return ARR_LEN(environment_stack);
456 * Returns the index of the top element of the global label stack.
458 static size_t label_top(void)
460 return ARR_LEN(label_stack);
464 * Return the next token.
466 static inline void next_token(void)
468 token = lookahead_buffer[lookahead_bufpos];
469 lookahead_buffer[lookahead_bufpos] = lexer_token;
472 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
475 print_token(stderr, &token);
476 fprintf(stderr, "\n");
480 static inline bool next_if(int const type)
482 if (token.type == type) {
491 * Return the next token with a given lookahead.
493 static inline const token_t *look_ahead(size_t num)
495 assert(0 < num && num <= MAX_LOOKAHEAD);
496 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
497 return &lookahead_buffer[pos];
501 * Adds a token type to the token type anchor set (a multi-set).
503 static void add_anchor_token(int token_type)
505 assert(0 <= token_type && token_type < T_LAST_TOKEN);
506 ++token_anchor_set[token_type];
510 * Set the number of tokens types of the given type
511 * to zero and return the old count.
513 static int save_and_reset_anchor_state(int token_type)
515 assert(0 <= token_type && token_type < T_LAST_TOKEN);
516 int count = token_anchor_set[token_type];
517 token_anchor_set[token_type] = 0;
522 * Restore the number of token types to the given count.
524 static void restore_anchor_state(int token_type, int count)
526 assert(0 <= token_type && token_type < T_LAST_TOKEN);
527 token_anchor_set[token_type] = count;
531 * Remove a token type from the token type anchor set (a multi-set).
533 static void rem_anchor_token(int token_type)
535 assert(0 <= token_type && token_type < T_LAST_TOKEN);
536 assert(token_anchor_set[token_type] != 0);
537 --token_anchor_set[token_type];
541 * Return true if the token type of the current token is
544 static bool at_anchor(void)
548 return token_anchor_set[token.type];
552 * Eat tokens until a matching token type is found.
554 static void eat_until_matching_token(int type)
558 case '(': end_token = ')'; break;
559 case '{': end_token = '}'; break;
560 case '[': end_token = ']'; break;
561 default: end_token = type; break;
564 unsigned parenthesis_count = 0;
565 unsigned brace_count = 0;
566 unsigned bracket_count = 0;
567 while (token.type != end_token ||
568 parenthesis_count != 0 ||
570 bracket_count != 0) {
571 switch (token.type) {
573 case '(': ++parenthesis_count; break;
574 case '{': ++brace_count; break;
575 case '[': ++bracket_count; break;
578 if (parenthesis_count > 0)
588 if (bracket_count > 0)
591 if (token.type == end_token &&
592 parenthesis_count == 0 &&
606 * Eat input tokens until an anchor is found.
608 static void eat_until_anchor(void)
610 while (token_anchor_set[token.type] == 0) {
611 if (token.type == '(' || token.type == '{' || token.type == '[')
612 eat_until_matching_token(token.type);
618 * Eat a whole block from input tokens.
620 static void eat_block(void)
622 eat_until_matching_token('{');
626 #define eat(token_type) (assert(token.type == (token_type)), next_token())
629 * Report a parse error because an expected token was not found.
632 #if defined __GNUC__ && __GNUC__ >= 4
633 __attribute__((sentinel))
635 void parse_error_expected(const char *message, ...)
637 if (message != NULL) {
638 errorf(HERE, "%s", message);
641 va_start(ap, message);
642 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
647 * Report an incompatible type.
649 static void type_error_incompatible(const char *msg,
650 const source_position_t *source_position, type_t *type1, type_t *type2)
652 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
657 * Expect the current token is the expected token.
658 * If not, generate an error, eat the current statement,
659 * and goto the error_label label.
661 #define expect(expected, error_label) \
663 if (UNLIKELY(token.type != (expected))) { \
664 parse_error_expected(NULL, (expected), NULL); \
665 add_anchor_token(expected); \
666 eat_until_anchor(); \
667 next_if((expected)); \
668 rem_anchor_token(expected); \
675 * Push a given scope on the scope stack and make it the
678 static scope_t *scope_push(scope_t *new_scope)
680 if (current_scope != NULL) {
681 new_scope->depth = current_scope->depth + 1;
684 scope_t *old_scope = current_scope;
685 current_scope = new_scope;
690 * Pop the current scope from the scope stack.
692 static void scope_pop(scope_t *old_scope)
694 current_scope = old_scope;
698 * Search an entity by its symbol in a given namespace.
700 static entity_t *get_entity(const symbol_t *const symbol,
701 namespace_tag_t namespc)
703 assert(namespc != NAMESPACE_INVALID);
704 entity_t *entity = symbol->entity;
705 for (; entity != NULL; entity = entity->base.symbol_next) {
706 if ((namespace_tag_t)entity->base.namespc == namespc)
713 /* §6.2.3:1 24) There is only one name space for tags even though three are
715 static entity_t *get_tag(symbol_t const *const symbol,
716 entity_kind_tag_t const kind)
718 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
719 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
721 "'%Y' defined as wrong kind of tag (previous definition %P)",
722 symbol, &entity->base.source_position);
729 * pushs an entity on the environment stack and links the corresponding symbol
732 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
734 symbol_t *symbol = entity->base.symbol;
735 entity_namespace_t namespc = entity->base.namespc;
736 assert(namespc != NAMESPACE_INVALID);
738 /* replace/add entity into entity list of the symbol */
741 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
746 /* replace an entry? */
747 if (iter->base.namespc == namespc) {
748 entity->base.symbol_next = iter->base.symbol_next;
754 /* remember old declaration */
756 entry.symbol = symbol;
757 entry.old_entity = iter;
758 entry.namespc = namespc;
759 ARR_APP1(stack_entry_t, *stack_ptr, entry);
763 * Push an entity on the environment stack.
765 static void environment_push(entity_t *entity)
767 assert(entity->base.source_position.input_name != NULL);
768 assert(entity->base.parent_scope != NULL);
769 stack_push(&environment_stack, entity);
773 * Push a declaration on the global label stack.
775 * @param declaration the declaration
777 static void label_push(entity_t *label)
779 /* we abuse the parameters scope as parent for the labels */
780 label->base.parent_scope = ¤t_function->parameters;
781 stack_push(&label_stack, label);
785 * pops symbols from the environment stack until @p new_top is the top element
787 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
789 stack_entry_t *stack = *stack_ptr;
790 size_t top = ARR_LEN(stack);
793 assert(new_top <= top);
797 for (i = top; i > new_top; --i) {
798 stack_entry_t *entry = &stack[i - 1];
800 entity_t *old_entity = entry->old_entity;
801 symbol_t *symbol = entry->symbol;
802 entity_namespace_t namespc = entry->namespc;
804 /* replace with old_entity/remove */
807 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
809 assert(iter != NULL);
810 /* replace an entry? */
811 if (iter->base.namespc == namespc)
815 /* restore definition from outer scopes (if there was one) */
816 if (old_entity != NULL) {
817 old_entity->base.symbol_next = iter->base.symbol_next;
818 *anchor = old_entity;
820 /* remove entry from list */
821 *anchor = iter->base.symbol_next;
825 ARR_SHRINKLEN(*stack_ptr, new_top);
829 * Pop all entries from the environment stack until the new_top
832 * @param new_top the new stack top
834 static void environment_pop_to(size_t new_top)
836 stack_pop_to(&environment_stack, new_top);
840 * Pop all entries from the global label stack until the new_top
843 * @param new_top the new stack top
845 static void label_pop_to(size_t new_top)
847 stack_pop_to(&label_stack, new_top);
850 static int get_akind_rank(atomic_type_kind_t akind)
856 * Return the type rank for an atomic type.
858 static int get_rank(const type_t *type)
860 assert(!is_typeref(type));
861 if (type->kind == TYPE_ENUM)
862 return get_akind_rank(type->enumt.akind);
864 assert(type->kind == TYPE_ATOMIC);
865 return get_akind_rank(type->atomic.akind);
869 * §6.3.1.1:2 Do integer promotion for a given type.
871 * @param type the type to promote
872 * @return the promoted type
874 static type_t *promote_integer(type_t *type)
876 if (type->kind == TYPE_BITFIELD)
877 type = type->bitfield.base_type;
879 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
886 * Create a cast expression.
888 * @param expression the expression to cast
889 * @param dest_type the destination type
891 static expression_t *create_cast_expression(expression_t *expression,
894 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
896 cast->unary.value = expression;
897 cast->base.type = dest_type;
903 * Check if a given expression represents a null pointer constant.
905 * @param expression the expression to check
907 static bool is_null_pointer_constant(const expression_t *expression)
909 /* skip void* cast */
910 if (expression->kind == EXPR_UNARY_CAST ||
911 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
912 type_t *const type = skip_typeref(expression->base.type);
913 if (types_compatible(type, type_void_ptr))
914 expression = expression->unary.value;
917 type_t *const type = skip_typeref(expression->base.type);
918 if (!is_type_integer(type))
920 switch (is_constant_expression(expression)) {
921 case EXPR_CLASS_ERROR: return true;
922 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
923 default: return false;
928 * Create an implicit cast expression.
930 * @param expression the expression to cast
931 * @param dest_type the destination type
933 static expression_t *create_implicit_cast(expression_t *expression,
936 type_t *const source_type = expression->base.type;
938 if (source_type == dest_type)
941 return create_cast_expression(expression, dest_type);
944 typedef enum assign_error_t {
946 ASSIGN_ERROR_INCOMPATIBLE,
947 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
948 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
949 ASSIGN_WARNING_POINTER_FROM_INT,
950 ASSIGN_WARNING_INT_FROM_POINTER
953 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
954 const expression_t *const right,
956 const source_position_t *source_position)
958 type_t *const orig_type_right = right->base.type;
959 type_t *const type_left = skip_typeref(orig_type_left);
960 type_t *const type_right = skip_typeref(orig_type_right);
965 case ASSIGN_ERROR_INCOMPATIBLE:
966 errorf(source_position,
967 "destination type '%T' in %s is incompatible with type '%T'",
968 orig_type_left, context, orig_type_right);
971 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
973 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
974 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
976 /* the left type has all qualifiers from the right type */
977 unsigned missing_qualifiers
978 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
979 warningf(source_position,
980 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
981 orig_type_left, context, orig_type_right, missing_qualifiers);
986 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
988 warningf(source_position,
989 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
990 orig_type_left, context, right, orig_type_right);
994 case ASSIGN_WARNING_POINTER_FROM_INT:
996 warningf(source_position,
997 "%s makes pointer '%T' from integer '%T' without a cast",
998 context, orig_type_left, orig_type_right);
1002 case ASSIGN_WARNING_INT_FROM_POINTER:
1003 if (warning.other) {
1004 warningf(source_position,
1005 "%s makes integer '%T' from pointer '%T' without a cast",
1006 context, orig_type_left, orig_type_right);
1011 panic("invalid error value");
1015 /** Implements the rules from §6.5.16.1 */
1016 static assign_error_t semantic_assign(type_t *orig_type_left,
1017 const expression_t *const right)
1019 type_t *const orig_type_right = right->base.type;
1020 type_t *const type_left = skip_typeref(orig_type_left);
1021 type_t *const type_right = skip_typeref(orig_type_right);
1023 if (is_type_pointer(type_left)) {
1024 if (is_null_pointer_constant(right)) {
1025 return ASSIGN_SUCCESS;
1026 } else if (is_type_pointer(type_right)) {
1027 type_t *points_to_left
1028 = skip_typeref(type_left->pointer.points_to);
1029 type_t *points_to_right
1030 = skip_typeref(type_right->pointer.points_to);
1031 assign_error_t res = ASSIGN_SUCCESS;
1033 /* the left type has all qualifiers from the right type */
1034 unsigned missing_qualifiers
1035 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1036 if (missing_qualifiers != 0) {
1037 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1040 points_to_left = get_unqualified_type(points_to_left);
1041 points_to_right = get_unqualified_type(points_to_right);
1043 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1046 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1047 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1048 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1051 if (!types_compatible(points_to_left, points_to_right)) {
1052 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1056 } else if (is_type_integer(type_right)) {
1057 return ASSIGN_WARNING_POINTER_FROM_INT;
1059 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1060 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1061 && is_type_pointer(type_right))) {
1062 return ASSIGN_SUCCESS;
1063 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1064 type_t *const unqual_type_left = get_unqualified_type(type_left);
1065 type_t *const unqual_type_right = get_unqualified_type(type_right);
1066 if (types_compatible(unqual_type_left, unqual_type_right)) {
1067 return ASSIGN_SUCCESS;
1069 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1070 return ASSIGN_WARNING_INT_FROM_POINTER;
1073 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1074 return ASSIGN_SUCCESS;
1076 return ASSIGN_ERROR_INCOMPATIBLE;
1079 static expression_t *parse_constant_expression(void)
1081 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1083 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1084 errorf(&result->base.source_position,
1085 "expression '%E' is not constant", result);
1091 static expression_t *parse_assignment_expression(void)
1093 return parse_subexpression(PREC_ASSIGNMENT);
1096 static void warn_string_concat(const source_position_t *pos)
1098 if (warning.traditional) {
1099 warningf(pos, "traditional C rejects string constant concatenation");
1103 static string_t parse_string_literals(void)
1105 assert(token.type == T_STRING_LITERAL);
1106 string_t result = token.literal;
1110 while (token.type == T_STRING_LITERAL) {
1111 warn_string_concat(&token.source_position);
1112 result = concat_strings(&result, &token.literal);
1120 * compare two string, ignoring double underscores on the second.
1122 static int strcmp_underscore(const char *s1, const char *s2)
1124 if (s2[0] == '_' && s2[1] == '_') {
1125 size_t len2 = strlen(s2);
1126 size_t len1 = strlen(s1);
1127 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1128 return strncmp(s1, s2+2, len2-4);
1132 return strcmp(s1, s2);
1135 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1137 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1138 attribute->kind = kind;
1143 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1146 * __attribute__ ( ( attribute-list ) )
1150 * attribute_list , attrib
1155 * any-word ( identifier )
1156 * any-word ( identifier , nonempty-expr-list )
1157 * any-word ( expr-list )
1159 * where the "identifier" must not be declared as a type, and
1160 * "any-word" may be any identifier (including one declared as a
1161 * type), a reserved word storage class specifier, type specifier or
1162 * type qualifier. ??? This still leaves out most reserved keywords
1163 * (following the old parser), shouldn't we include them, and why not
1164 * allow identifiers declared as types to start the arguments?
1166 * Matze: this all looks confusing and little systematic, so we're even less
1167 * strict and parse any list of things which are identifiers or
1168 * (assignment-)expressions.
1170 static attribute_argument_t *parse_attribute_arguments(void)
1172 attribute_argument_t *first = NULL;
1173 attribute_argument_t **anchor = &first;
1174 if (token.type != ')') do {
1175 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1177 /* is it an identifier */
1178 if (token.type == T_IDENTIFIER
1179 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1180 symbol_t *symbol = token.symbol;
1181 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1182 argument->v.symbol = symbol;
1185 /* must be an expression */
1186 expression_t *expression = parse_assignment_expression();
1188 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1189 argument->v.expression = expression;
1192 /* append argument */
1194 anchor = &argument->next;
1195 } while (next_if(','));
1196 expect(')', end_error);
1205 static attribute_t *parse_attribute_asm(void)
1209 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1211 expect('(', end_error);
1212 attribute->a.arguments = parse_attribute_arguments();
1219 static symbol_t *get_symbol_from_token(void)
1221 switch(token.type) {
1223 return token.symbol;
1252 /* maybe we need more tokens ... add them on demand */
1253 return get_token_symbol(&token);
1259 static attribute_t *parse_attribute_gnu_single(void)
1261 /* parse "any-word" */
1262 symbol_t *symbol = get_symbol_from_token();
1263 if (symbol == NULL) {
1264 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1268 attribute_kind_t kind;
1269 char const *const name = symbol->string;
1270 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1271 if (kind > ATTRIBUTE_GNU_LAST) {
1272 if (warning.attribute) {
1273 warningf(HERE, "unknown attribute '%s' ignored", name);
1275 /* TODO: we should still save the attribute in the list... */
1276 kind = ATTRIBUTE_UNKNOWN;
1280 const char *attribute_name = get_attribute_name(kind);
1281 if (attribute_name != NULL
1282 && strcmp_underscore(attribute_name, name) == 0)
1288 attribute_t *attribute = allocate_attribute_zero(kind);
1290 /* parse arguments */
1292 attribute->a.arguments = parse_attribute_arguments();
1297 static attribute_t *parse_attribute_gnu(void)
1299 attribute_t *first = NULL;
1300 attribute_t **anchor = &first;
1302 eat(T___attribute__);
1303 expect('(', end_error);
1304 expect('(', end_error);
1306 if (token.type != ')') do {
1307 attribute_t *attribute = parse_attribute_gnu_single();
1308 if (attribute == NULL)
1311 *anchor = attribute;
1312 anchor = &attribute->next;
1313 } while (next_if(','));
1314 expect(')', end_error);
1315 expect(')', end_error);
1321 /** Parse attributes. */
1322 static attribute_t *parse_attributes(attribute_t *first)
1324 attribute_t **anchor = &first;
1326 while (*anchor != NULL)
1327 anchor = &(*anchor)->next;
1329 attribute_t *attribute;
1330 switch (token.type) {
1331 case T___attribute__:
1332 attribute = parse_attribute_gnu();
1333 if (attribute == NULL)
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);
1362 /* TODO record modifier */
1364 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 a constant initializer.
1737 static bool is_initializer_constant(const expression_t *expression)
1739 return is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1740 is_linker_constant(expression) != EXPR_CLASS_VARIABLE;
1744 * Parses an scalar initializer.
1746 * §6.7.8.11; eat {} without warning
1748 static initializer_t *parse_scalar_initializer(type_t *type,
1749 bool must_be_constant)
1751 /* there might be extra {} hierarchies */
1753 if (token.type == '{') {
1755 warningf(HERE, "extra curly braces around scalar initializer");
1759 } while (token.type == '{');
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);
2023 static void advance_current_object(type_path_t *path, size_t top_path_level)
2025 type_path_entry_t *top = get_type_path_top(path);
2027 type_t *type = skip_typeref(top->type);
2028 if (is_type_union(type)) {
2029 /* in unions only the first element is initialized */
2030 top->v.compound_entry = NULL;
2031 } else if (is_type_struct(type)) {
2032 declaration_t *entry = top->v.compound_entry;
2034 entity_t *next_entity = entry->base.next;
2035 if (next_entity != NULL) {
2036 assert(is_declaration(next_entity));
2037 entry = &next_entity->declaration;
2042 top->v.compound_entry = entry;
2043 if (entry != NULL) {
2044 path->top_type = entry->type;
2047 } else if (is_type_array(type)) {
2048 assert(is_type_array(type));
2052 if (!type->array.size_constant || top->v.index < type->array.size) {
2056 assert(!is_type_valid(type));
2060 /* we're past the last member of the current sub-aggregate, try if we
2061 * can ascend in the type hierarchy and continue with another subobject */
2062 size_t len = ARR_LEN(path->path);
2064 if (len > top_path_level) {
2065 ascend_from_subtype(path);
2066 advance_current_object(path, top_path_level);
2068 path->top_type = NULL;
2073 * skip any {...} blocks until a closing bracket is reached.
2075 static void skip_initializers(void)
2079 while (token.type != '}') {
2080 if (token.type == T_EOF)
2082 if (token.type == '{') {
2090 static initializer_t *create_empty_initializer(void)
2092 static initializer_t empty_initializer
2093 = { .list = { { INITIALIZER_LIST }, 0 } };
2094 return &empty_initializer;
2098 * Parse a part of an initialiser for a struct or union,
2100 static initializer_t *parse_sub_initializer(type_path_t *path,
2101 type_t *outer_type, size_t top_path_level,
2102 parse_initializer_env_t *env)
2104 if (token.type == '}') {
2105 /* empty initializer */
2106 return create_empty_initializer();
2109 type_t *orig_type = path->top_type;
2110 type_t *type = NULL;
2112 if (orig_type == NULL) {
2113 /* We are initializing an empty compound. */
2115 type = skip_typeref(orig_type);
2118 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2121 designator_t *designator = NULL;
2122 if (token.type == '.' || token.type == '[') {
2123 designator = parse_designation();
2124 goto finish_designator;
2125 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2126 /* GNU-style designator ("identifier: value") */
2127 designator = allocate_ast_zero(sizeof(designator[0]));
2128 designator->source_position = token.source_position;
2129 designator->symbol = token.symbol;
2134 /* reset path to toplevel, evaluate designator from there */
2135 ascend_to(path, top_path_level);
2136 if (!walk_designator(path, designator, false)) {
2137 /* can't continue after designation error */
2141 initializer_t *designator_initializer
2142 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2143 designator_initializer->designator.designator = designator;
2144 ARR_APP1(initializer_t*, initializers, designator_initializer);
2146 orig_type = path->top_type;
2147 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2152 if (token.type == '{') {
2153 if (type != NULL && is_type_scalar(type)) {
2154 sub = parse_scalar_initializer(type, env->must_be_constant);
2157 if (env->entity != NULL) {
2159 "extra brace group at end of initializer for '%Y'",
2160 env->entity->base.symbol);
2162 errorf(HERE, "extra brace group at end of initializer");
2167 descend_into_subtype(path);
2170 add_anchor_token('}');
2171 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2173 rem_anchor_token('}');
2176 ascend_from_subtype(path);
2177 expect('}', end_error);
2179 expect('}', end_error);
2180 goto error_parse_next;
2184 /* must be an expression */
2185 expression_t *expression = parse_assignment_expression();
2186 mark_vars_read(expression, NULL);
2188 if (env->must_be_constant && !is_initializer_constant(expression)) {
2189 errorf(&expression->base.source_position,
2190 "Initialisation expression '%E' is not constant",
2195 /* we are already outside, ... */
2196 if (outer_type == NULL)
2197 goto error_parse_next;
2198 type_t *const outer_type_skip = skip_typeref(outer_type);
2199 if (is_type_compound(outer_type_skip) &&
2200 !outer_type_skip->compound.compound->complete) {
2201 goto error_parse_next;
2204 if (warning.other) {
2205 source_position_t const* const pos = &expression->base.source_position;
2206 if (env->entity != NULL) {
2207 warningf(pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2209 warningf(pos, "excess elements in initializer");
2212 goto error_parse_next;
2215 /* handle { "string" } special case */
2216 if ((expression->kind == EXPR_STRING_LITERAL
2217 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2218 && outer_type != NULL) {
2219 sub = initializer_from_expression(outer_type, expression);
2222 if (token.type != '}' && warning.other) {
2223 warningf(HERE, "excessive elements in initializer for type '%T'",
2226 /* TODO: eat , ... */
2231 /* descend into subtypes until expression matches type */
2233 orig_type = path->top_type;
2234 type = skip_typeref(orig_type);
2236 sub = initializer_from_expression(orig_type, expression);
2240 if (!is_type_valid(type)) {
2243 if (is_type_scalar(type)) {
2244 errorf(&expression->base.source_position,
2245 "expression '%E' doesn't match expected type '%T'",
2246 expression, orig_type);
2250 descend_into_subtype(path);
2254 /* update largest index of top array */
2255 const type_path_entry_t *first = &path->path[0];
2256 type_t *first_type = first->type;
2257 first_type = skip_typeref(first_type);
2258 if (is_type_array(first_type)) {
2259 size_t index = first->v.index;
2260 if (index > path->max_index)
2261 path->max_index = index;
2264 /* append to initializers list */
2265 ARR_APP1(initializer_t*, initializers, sub);
2268 if (token.type == '}') {
2271 expect(',', end_error);
2272 if (token.type == '}') {
2277 /* advance to the next declaration if we are not at the end */
2278 advance_current_object(path, top_path_level);
2279 orig_type = path->top_type;
2280 if (orig_type != NULL)
2281 type = skip_typeref(orig_type);
2287 size_t len = ARR_LEN(initializers);
2288 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2289 initializer_t *result = allocate_ast_zero(size);
2290 result->kind = INITIALIZER_LIST;
2291 result->list.len = len;
2292 memcpy(&result->list.initializers, initializers,
2293 len * sizeof(initializers[0]));
2295 DEL_ARR_F(initializers);
2296 ascend_to(path, top_path_level+1);
2301 skip_initializers();
2302 DEL_ARR_F(initializers);
2303 ascend_to(path, top_path_level+1);
2307 static expression_t *make_size_literal(size_t value)
2309 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2310 literal->base.type = type_size_t;
2313 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2314 literal->literal.value = make_string(buf);
2320 * Parses an initializer. Parsers either a compound literal
2321 * (env->declaration == NULL) or an initializer of a declaration.
2323 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2325 type_t *type = skip_typeref(env->type);
2326 size_t max_index = 0;
2327 initializer_t *result;
2329 if (is_type_scalar(type)) {
2330 result = parse_scalar_initializer(type, env->must_be_constant);
2331 } else if (token.type == '{') {
2335 memset(&path, 0, sizeof(path));
2336 path.top_type = env->type;
2337 path.path = NEW_ARR_F(type_path_entry_t, 0);
2339 descend_into_subtype(&path);
2341 add_anchor_token('}');
2342 result = parse_sub_initializer(&path, env->type, 1, env);
2343 rem_anchor_token('}');
2345 max_index = path.max_index;
2346 DEL_ARR_F(path.path);
2348 expect('}', end_error);
2351 /* parse_scalar_initializer() also works in this case: we simply
2352 * have an expression without {} around it */
2353 result = parse_scalar_initializer(type, env->must_be_constant);
2356 /* §6.7.8:22 array initializers for arrays with unknown size determine
2357 * the array type size */
2358 if (is_type_array(type) && type->array.size_expression == NULL
2359 && result != NULL) {
2361 switch (result->kind) {
2362 case INITIALIZER_LIST:
2363 assert(max_index != 0xdeadbeaf);
2364 size = max_index + 1;
2367 case INITIALIZER_STRING:
2368 size = result->string.string.size;
2371 case INITIALIZER_WIDE_STRING:
2372 size = result->wide_string.string.size;
2375 case INITIALIZER_DESIGNATOR:
2376 case INITIALIZER_VALUE:
2377 /* can happen for parse errors */
2382 internal_errorf(HERE, "invalid initializer type");
2385 type_t *new_type = duplicate_type(type);
2387 new_type->array.size_expression = make_size_literal(size);
2388 new_type->array.size_constant = true;
2389 new_type->array.has_implicit_size = true;
2390 new_type->array.size = size;
2391 env->type = new_type;
2397 static void append_entity(scope_t *scope, entity_t *entity)
2399 if (scope->last_entity != NULL) {
2400 scope->last_entity->base.next = entity;
2402 scope->entities = entity;
2404 entity->base.parent_entity = current_entity;
2405 scope->last_entity = entity;
2409 static compound_t *parse_compound_type_specifier(bool is_struct)
2411 source_position_t const pos = *HERE;
2412 eat(is_struct ? T_struct : T_union);
2414 symbol_t *symbol = NULL;
2415 entity_t *entity = NULL;
2416 attribute_t *attributes = NULL;
2418 if (token.type == T___attribute__) {
2419 attributes = parse_attributes(NULL);
2422 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2423 if (token.type == T_IDENTIFIER) {
2424 /* the compound has a name, check if we have seen it already */
2425 symbol = token.symbol;
2426 entity = get_tag(symbol, kind);
2429 if (entity != NULL) {
2430 if (entity->base.parent_scope != current_scope &&
2431 (token.type == '{' || token.type == ';')) {
2432 /* we're in an inner scope and have a definition. Shadow
2433 * existing definition in outer scope */
2435 } else if (entity->compound.complete && token.type == '{') {
2436 errorf(&pos, "multiple definitions of '%s %Y' (previous definition %P)",
2437 is_struct ? "struct" : "union", symbol,
2438 &entity->base.source_position);
2439 /* clear members in the hope to avoid further errors */
2440 entity->compound.members.entities = NULL;
2443 } else if (token.type != '{') {
2444 char const *const msg =
2445 is_struct ? "while parsing struct type specifier" :
2446 "while parsing union type specifier";
2447 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2452 if (entity == NULL) {
2453 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2454 entity->compound.alignment = 1;
2455 entity->base.source_position = pos;
2456 entity->base.parent_scope = current_scope;
2457 if (symbol != NULL) {
2458 environment_push(entity);
2460 append_entity(current_scope, entity);
2463 if (token.type == '{') {
2464 parse_compound_type_entries(&entity->compound);
2466 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2467 if (symbol == NULL) {
2468 assert(anonymous_entity == NULL);
2469 anonymous_entity = entity;
2473 if (attributes != NULL) {
2474 handle_entity_attributes(attributes, entity);
2477 return &entity->compound;
2480 static void parse_enum_entries(type_t *const enum_type)
2484 if (token.type == '}') {
2485 errorf(HERE, "empty enum not allowed");
2490 add_anchor_token('}');
2492 if (token.type != T_IDENTIFIER) {
2493 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2495 rem_anchor_token('}');
2499 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, token.symbol);
2500 entity->enum_value.enum_type = enum_type;
2501 entity->base.source_position = token.source_position;
2505 expression_t *value = parse_constant_expression();
2507 value = create_implicit_cast(value, enum_type);
2508 entity->enum_value.value = value;
2513 record_entity(entity, false);
2514 } while (next_if(',') && token.type != '}');
2515 rem_anchor_token('}');
2517 expect('}', end_error);
2523 static type_t *parse_enum_specifier(void)
2525 source_position_t const pos = *HERE;
2530 switch (token.type) {
2532 symbol = token.symbol;
2533 entity = get_tag(symbol, ENTITY_ENUM);
2536 if (entity != NULL) {
2537 if (entity->base.parent_scope != current_scope &&
2538 (token.type == '{' || token.type == ';')) {
2539 /* we're in an inner scope and have a definition. Shadow
2540 * existing definition in outer scope */
2542 } else if (entity->enume.complete && token.type == '{') {
2543 errorf(&pos, "multiple definitions of 'enum %Y' (previous definition %P)",
2544 symbol, &entity->base.source_position);
2555 parse_error_expected("while parsing enum type specifier",
2556 T_IDENTIFIER, '{', NULL);
2560 if (entity == NULL) {
2561 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2562 entity->base.source_position = pos;
2563 entity->base.parent_scope = current_scope;
2566 type_t *const type = allocate_type_zero(TYPE_ENUM);
2567 type->enumt.enume = &entity->enume;
2568 type->enumt.akind = ATOMIC_TYPE_INT;
2570 if (token.type == '{') {
2571 if (symbol != NULL) {
2572 environment_push(entity);
2574 append_entity(current_scope, entity);
2575 entity->enume.complete = true;
2577 parse_enum_entries(type);
2578 parse_attributes(NULL);
2580 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2581 if (symbol == NULL) {
2582 assert(anonymous_entity == NULL);
2583 anonymous_entity = entity;
2585 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2586 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2593 * if a symbol is a typedef to another type, return true
2595 static bool is_typedef_symbol(symbol_t *symbol)
2597 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2598 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2601 static type_t *parse_typeof(void)
2607 expect('(', end_error);
2608 add_anchor_token(')');
2610 expression_t *expression = NULL;
2612 bool old_type_prop = in_type_prop;
2613 bool old_gcc_extension = in_gcc_extension;
2614 in_type_prop = true;
2616 while (next_if(T___extension__)) {
2617 /* This can be a prefix to a typename or an expression. */
2618 in_gcc_extension = true;
2620 switch (token.type) {
2622 if (is_typedef_symbol(token.symbol)) {
2624 type = parse_typename();
2627 expression = parse_expression();
2628 type = revert_automatic_type_conversion(expression);
2632 in_type_prop = old_type_prop;
2633 in_gcc_extension = old_gcc_extension;
2635 rem_anchor_token(')');
2636 expect(')', end_error);
2638 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2639 typeof_type->typeoft.expression = expression;
2640 typeof_type->typeoft.typeof_type = type;
2647 typedef enum specifiers_t {
2648 SPECIFIER_SIGNED = 1 << 0,
2649 SPECIFIER_UNSIGNED = 1 << 1,
2650 SPECIFIER_LONG = 1 << 2,
2651 SPECIFIER_INT = 1 << 3,
2652 SPECIFIER_DOUBLE = 1 << 4,
2653 SPECIFIER_CHAR = 1 << 5,
2654 SPECIFIER_WCHAR_T = 1 << 6,
2655 SPECIFIER_SHORT = 1 << 7,
2656 SPECIFIER_LONG_LONG = 1 << 8,
2657 SPECIFIER_FLOAT = 1 << 9,
2658 SPECIFIER_BOOL = 1 << 10,
2659 SPECIFIER_VOID = 1 << 11,
2660 SPECIFIER_INT8 = 1 << 12,
2661 SPECIFIER_INT16 = 1 << 13,
2662 SPECIFIER_INT32 = 1 << 14,
2663 SPECIFIER_INT64 = 1 << 15,
2664 SPECIFIER_INT128 = 1 << 16,
2665 SPECIFIER_COMPLEX = 1 << 17,
2666 SPECIFIER_IMAGINARY = 1 << 18,
2669 static type_t *get_typedef_type(symbol_t *symbol)
2671 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2672 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2675 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2676 type->typedeft.typedefe = &entity->typedefe;
2681 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2683 expect('(', end_error);
2685 attribute_property_argument_t *property
2686 = allocate_ast_zero(sizeof(*property));
2689 if (token.type != T_IDENTIFIER) {
2690 parse_error_expected("while parsing property declspec",
2691 T_IDENTIFIER, NULL);
2696 symbol_t *symbol = token.symbol;
2697 if (strcmp(symbol->string, "put") == 0) {
2698 prop = &property->put_symbol;
2699 } else if (strcmp(symbol->string, "get") == 0) {
2700 prop = &property->get_symbol;
2702 errorf(HERE, "expected put or get in property declspec");
2706 expect('=', end_error);
2707 if (token.type != T_IDENTIFIER) {
2708 parse_error_expected("while parsing property declspec",
2709 T_IDENTIFIER, NULL);
2713 *prop = token.symbol;
2715 } while (next_if(','));
2717 attribute->a.property = property;
2719 expect(')', end_error);
2725 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2727 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2728 if (next_if(T_restrict)) {
2729 kind = ATTRIBUTE_MS_RESTRICT;
2730 } else if (token.type == T_IDENTIFIER) {
2731 const char *name = token.symbol->string;
2732 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2734 const char *attribute_name = get_attribute_name(k);
2735 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2741 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2742 warningf(HERE, "unknown __declspec '%s' ignored", name);
2746 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2750 attribute_t *attribute = allocate_attribute_zero(kind);
2752 if (kind == ATTRIBUTE_MS_PROPERTY) {
2753 return parse_attribute_ms_property(attribute);
2756 /* parse arguments */
2758 attribute->a.arguments = parse_attribute_arguments();
2763 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2767 expect('(', end_error);
2772 add_anchor_token(')');
2774 attribute_t **anchor = &first;
2776 while (*anchor != NULL)
2777 anchor = &(*anchor)->next;
2779 attribute_t *attribute
2780 = parse_microsoft_extended_decl_modifier_single();
2781 if (attribute == NULL)
2784 *anchor = attribute;
2785 anchor = &attribute->next;
2786 } while (next_if(','));
2788 rem_anchor_token(')');
2789 expect(')', end_error);
2793 rem_anchor_token(')');
2797 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2799 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2800 entity->base.source_position = *HERE;
2801 if (is_declaration(entity)) {
2802 entity->declaration.type = type_error_type;
2803 entity->declaration.implicit = true;
2804 } else if (kind == ENTITY_TYPEDEF) {
2805 entity->typedefe.type = type_error_type;
2806 entity->typedefe.builtin = true;
2808 if (kind != ENTITY_COMPOUND_MEMBER)
2809 record_entity(entity, false);
2813 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2815 type_t *type = NULL;
2816 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2817 unsigned type_specifiers = 0;
2818 bool newtype = false;
2819 bool saw_error = false;
2820 bool old_gcc_extension = in_gcc_extension;
2822 memset(specifiers, 0, sizeof(*specifiers));
2823 specifiers->source_position = token.source_position;
2826 specifiers->attributes = parse_attributes(specifiers->attributes);
2828 switch (token.type) {
2830 #define MATCH_STORAGE_CLASS(token, class) \
2832 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2833 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2835 specifiers->storage_class = class; \
2836 if (specifiers->thread_local) \
2837 goto check_thread_storage_class; \
2841 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2842 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2843 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2844 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2845 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2848 specifiers->attributes
2849 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2853 if (specifiers->thread_local) {
2854 errorf(HERE, "duplicate '__thread'");
2856 specifiers->thread_local = true;
2857 check_thread_storage_class:
2858 switch (specifiers->storage_class) {
2859 case STORAGE_CLASS_EXTERN:
2860 case STORAGE_CLASS_NONE:
2861 case STORAGE_CLASS_STATIC:
2865 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2866 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2867 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2868 wrong_thread_storage_class:
2869 errorf(HERE, "'__thread' used with '%s'", wrong);
2876 /* type qualifiers */
2877 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2879 qualifiers |= qualifier; \
2883 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2884 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2885 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2886 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2887 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2888 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2889 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2890 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2892 case T___extension__:
2894 in_gcc_extension = true;
2897 /* type specifiers */
2898 #define MATCH_SPECIFIER(token, specifier, name) \
2900 if (type_specifiers & specifier) { \
2901 errorf(HERE, "multiple " name " type specifiers given"); \
2903 type_specifiers |= specifier; \
2908 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2909 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2910 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2911 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2912 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2913 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2914 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2915 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2916 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2917 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2918 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2919 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2920 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2921 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2922 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2923 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2924 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2925 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2929 specifiers->is_inline = true;
2933 case T__forceinline:
2935 specifiers->modifiers |= DM_FORCEINLINE;
2940 if (type_specifiers & SPECIFIER_LONG_LONG) {
2941 errorf(HERE, "too many long type specifiers given");
2942 } else if (type_specifiers & SPECIFIER_LONG) {
2943 type_specifiers |= SPECIFIER_LONG_LONG;
2945 type_specifiers |= SPECIFIER_LONG;
2950 #define CHECK_DOUBLE_TYPE() \
2952 if ( type != NULL) \
2953 errorf(HERE, "multiple data types in declaration specifiers"); \
2957 CHECK_DOUBLE_TYPE();
2958 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2960 type->compound.compound = parse_compound_type_specifier(true);
2963 CHECK_DOUBLE_TYPE();
2964 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2965 type->compound.compound = parse_compound_type_specifier(false);
2968 CHECK_DOUBLE_TYPE();
2969 type = parse_enum_specifier();
2972 CHECK_DOUBLE_TYPE();
2973 type = parse_typeof();
2975 case T___builtin_va_list:
2976 CHECK_DOUBLE_TYPE();
2977 type = duplicate_type(type_valist);
2981 case T_IDENTIFIER: {
2982 /* only parse identifier if we haven't found a type yet */
2983 if (type != NULL || type_specifiers != 0) {
2984 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2985 * declaration, so it doesn't generate errors about expecting '(' or
2987 switch (look_ahead(1)->type) {
2994 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2998 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3003 goto finish_specifiers;
3007 type_t *const typedef_type = get_typedef_type(token.symbol);
3008 if (typedef_type == NULL) {
3009 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3010 * declaration, so it doesn't generate 'implicit int' followed by more
3011 * errors later on. */
3012 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3018 errorf(HERE, "%K does not name a type", &token);
3021 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3023 type = allocate_type_zero(TYPE_TYPEDEF);
3024 type->typedeft.typedefe = &entity->typedefe;
3032 goto finish_specifiers;
3037 type = typedef_type;
3041 /* function specifier */
3043 goto finish_specifiers;
3048 specifiers->attributes = parse_attributes(specifiers->attributes);
3050 in_gcc_extension = old_gcc_extension;
3052 if (type == NULL || (saw_error && type_specifiers != 0)) {
3053 atomic_type_kind_t atomic_type;
3055 /* match valid basic types */
3056 switch (type_specifiers) {
3057 case SPECIFIER_VOID:
3058 atomic_type = ATOMIC_TYPE_VOID;
3060 case SPECIFIER_WCHAR_T:
3061 atomic_type = ATOMIC_TYPE_WCHAR_T;
3063 case SPECIFIER_CHAR:
3064 atomic_type = ATOMIC_TYPE_CHAR;
3066 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3067 atomic_type = ATOMIC_TYPE_SCHAR;
3069 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3070 atomic_type = ATOMIC_TYPE_UCHAR;
3072 case SPECIFIER_SHORT:
3073 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3074 case SPECIFIER_SHORT | SPECIFIER_INT:
3075 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3076 atomic_type = ATOMIC_TYPE_SHORT;
3078 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3079 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3080 atomic_type = ATOMIC_TYPE_USHORT;
3083 case SPECIFIER_SIGNED:
3084 case SPECIFIER_SIGNED | SPECIFIER_INT:
3085 atomic_type = ATOMIC_TYPE_INT;
3087 case SPECIFIER_UNSIGNED:
3088 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3089 atomic_type = ATOMIC_TYPE_UINT;
3091 case SPECIFIER_LONG:
3092 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3093 case SPECIFIER_LONG | SPECIFIER_INT:
3094 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3095 atomic_type = ATOMIC_TYPE_LONG;
3097 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3098 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3099 atomic_type = ATOMIC_TYPE_ULONG;
3102 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3103 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3104 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3105 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3107 atomic_type = ATOMIC_TYPE_LONGLONG;
3108 goto warn_about_long_long;
3110 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3111 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3113 atomic_type = ATOMIC_TYPE_ULONGLONG;
3114 warn_about_long_long:
3115 if (warning.long_long) {
3116 warningf(&specifiers->source_position,
3117 "ISO C90 does not support 'long long'");
3121 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3122 atomic_type = unsigned_int8_type_kind;
3125 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3126 atomic_type = unsigned_int16_type_kind;
3129 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3130 atomic_type = unsigned_int32_type_kind;
3133 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3134 atomic_type = unsigned_int64_type_kind;
3137 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3138 atomic_type = unsigned_int128_type_kind;
3141 case SPECIFIER_INT8:
3142 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3143 atomic_type = int8_type_kind;
3146 case SPECIFIER_INT16:
3147 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3148 atomic_type = int16_type_kind;
3151 case SPECIFIER_INT32:
3152 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3153 atomic_type = int32_type_kind;
3156 case SPECIFIER_INT64:
3157 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3158 atomic_type = int64_type_kind;
3161 case SPECIFIER_INT128:
3162 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3163 atomic_type = int128_type_kind;
3166 case SPECIFIER_FLOAT:
3167 atomic_type = ATOMIC_TYPE_FLOAT;
3169 case SPECIFIER_DOUBLE:
3170 atomic_type = ATOMIC_TYPE_DOUBLE;
3172 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3173 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3175 case SPECIFIER_BOOL:
3176 atomic_type = ATOMIC_TYPE_BOOL;
3178 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3179 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3180 atomic_type = ATOMIC_TYPE_FLOAT;
3182 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3183 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3184 atomic_type = ATOMIC_TYPE_DOUBLE;
3186 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3187 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3188 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3191 /* invalid specifier combination, give an error message */
3192 source_position_t const* const pos = &specifiers->source_position;
3193 if (type_specifiers == 0) {
3195 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3196 if (!(c_mode & _CXX) && !strict_mode) {
3197 if (warning.implicit_int) {
3198 warningf(pos, "no type specifiers in declaration, using 'int'");
3200 atomic_type = ATOMIC_TYPE_INT;
3203 errorf(pos, "no type specifiers given in declaration");
3206 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3207 (type_specifiers & SPECIFIER_UNSIGNED)) {
3208 errorf(pos, "signed and unsigned specifiers given");
3209 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3210 errorf(pos, "only integer types can be signed or unsigned");
3212 errorf(pos, "multiple datatypes in declaration");
3218 if (type_specifiers & SPECIFIER_COMPLEX) {
3219 type = allocate_type_zero(TYPE_COMPLEX);
3220 type->complex.akind = atomic_type;
3221 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3222 type = allocate_type_zero(TYPE_IMAGINARY);
3223 type->imaginary.akind = atomic_type;
3225 type = allocate_type_zero(TYPE_ATOMIC);
3226 type->atomic.akind = atomic_type;
3229 } else if (type_specifiers != 0) {
3230 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3233 /* FIXME: check type qualifiers here */
3234 type->base.qualifiers = qualifiers;
3237 type = identify_new_type(type);
3239 type = typehash_insert(type);
3242 if (specifiers->attributes != NULL)
3243 type = handle_type_attributes(specifiers->attributes, type);
3244 specifiers->type = type;
3248 specifiers->type = type_error_type;
3251 static type_qualifiers_t parse_type_qualifiers(void)
3253 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3256 switch (token.type) {
3257 /* type qualifiers */
3258 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3259 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3260 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3261 /* microsoft extended type modifiers */
3262 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3263 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3264 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3265 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3266 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3275 * Parses an K&R identifier list
3277 static void parse_identifier_list(scope_t *scope)
3280 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.symbol);
3281 entity->base.source_position = token.source_position;
3282 /* a K&R parameter has no type, yet */
3286 append_entity(scope, entity);
3287 } while (next_if(',') && token.type == T_IDENTIFIER);
3290 static entity_t *parse_parameter(void)
3292 declaration_specifiers_t specifiers;
3293 parse_declaration_specifiers(&specifiers);
3295 entity_t *entity = parse_declarator(&specifiers,
3296 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3297 anonymous_entity = NULL;
3301 static void semantic_parameter_incomplete(const entity_t *entity)
3303 assert(entity->kind == ENTITY_PARAMETER);
3305 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3306 * list in a function declarator that is part of a
3307 * definition of that function shall not have
3308 * incomplete type. */
3309 type_t *type = skip_typeref(entity->declaration.type);
3310 if (is_type_incomplete(type)) {
3311 errorf(&entity->base.source_position,
3312 "parameter '%#T' has incomplete type",
3313 entity->declaration.type, entity->base.symbol);
3317 static bool has_parameters(void)
3319 /* func(void) is not a parameter */
3320 if (token.type == T_IDENTIFIER) {
3321 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3324 if (entity->kind != ENTITY_TYPEDEF)
3326 if (skip_typeref(entity->typedefe.type) != type_void)
3328 } else if (token.type != T_void) {
3331 if (look_ahead(1)->type != ')')
3338 * Parses function type parameters (and optionally creates variable_t entities
3339 * for them in a scope)
3341 static void parse_parameters(function_type_t *type, scope_t *scope)
3344 add_anchor_token(')');
3345 int saved_comma_state = save_and_reset_anchor_state(',');
3347 if (token.type == T_IDENTIFIER &&
3348 !is_typedef_symbol(token.symbol)) {
3349 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3350 if (la1_type == ',' || la1_type == ')') {
3351 type->kr_style_parameters = true;
3352 parse_identifier_list(scope);
3353 goto parameters_finished;
3357 if (token.type == ')') {
3358 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3359 if (!(c_mode & _CXX))
3360 type->unspecified_parameters = true;
3361 } else if (has_parameters()) {
3362 function_parameter_t **anchor = &type->parameters;
3364 switch (token.type) {
3367 type->variadic = true;
3368 goto parameters_finished;
3371 case T___extension__:
3374 entity_t *entity = parse_parameter();
3375 if (entity->kind == ENTITY_TYPEDEF) {
3376 errorf(&entity->base.source_position,
3377 "typedef not allowed as function parameter");
3380 assert(is_declaration(entity));
3382 semantic_parameter_incomplete(entity);
3384 function_parameter_t *const parameter =
3385 allocate_parameter(entity->declaration.type);
3387 if (scope != NULL) {
3388 append_entity(scope, entity);
3391 *anchor = parameter;
3392 anchor = ¶meter->next;
3397 goto parameters_finished;
3399 } while (next_if(','));
3402 parameters_finished:
3403 rem_anchor_token(')');
3404 expect(')', end_error);
3407 restore_anchor_state(',', saved_comma_state);
3410 typedef enum construct_type_kind_t {
3413 CONSTRUCT_REFERENCE,
3416 } construct_type_kind_t;
3418 typedef union construct_type_t construct_type_t;
3420 typedef struct construct_type_base_t {
3421 construct_type_kind_t kind;
3422 source_position_t pos;
3423 construct_type_t *next;
3424 } construct_type_base_t;
3426 typedef struct parsed_pointer_t {
3427 construct_type_base_t base;
3428 type_qualifiers_t type_qualifiers;
3429 variable_t *base_variable; /**< MS __based extension. */
3432 typedef struct parsed_reference_t {
3433 construct_type_base_t base;
3434 } parsed_reference_t;
3436 typedef struct construct_function_type_t {
3437 construct_type_base_t base;
3438 type_t *function_type;
3439 } construct_function_type_t;
3441 typedef struct parsed_array_t {
3442 construct_type_base_t base;
3443 type_qualifiers_t type_qualifiers;
3449 union construct_type_t {
3450 construct_type_kind_t kind;
3451 construct_type_base_t base;
3452 parsed_pointer_t pointer;
3453 parsed_reference_t reference;
3454 construct_function_type_t function;
3455 parsed_array_t array;
3458 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3460 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3461 memset(cons, 0, size);
3463 cons->base.pos = *HERE;
3468 static construct_type_t *parse_pointer_declarator(void)
3470 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3472 cons->pointer.type_qualifiers = parse_type_qualifiers();
3473 //cons->pointer.base_variable = base_variable;
3478 /* ISO/IEC 14882:1998(E) §8.3.2 */
3479 static construct_type_t *parse_reference_declarator(void)
3481 if (!(c_mode & _CXX))
3482 errorf(HERE, "references are only available for C++");
3484 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3491 static construct_type_t *parse_array_declarator(void)
3493 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3494 parsed_array_t *const array = &cons->array;
3497 add_anchor_token(']');
3499 bool is_static = next_if(T_static);
3501 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3504 is_static = next_if(T_static);
3506 array->type_qualifiers = type_qualifiers;
3507 array->is_static = is_static;
3509 expression_t *size = NULL;
3510 if (token.type == '*' && look_ahead(1)->type == ']') {
3511 array->is_variable = true;
3513 } else if (token.type != ']') {
3514 size = parse_assignment_expression();
3516 /* §6.7.5.2:1 Array size must have integer type */
3517 type_t *const orig_type = size->base.type;
3518 type_t *const type = skip_typeref(orig_type);
3519 if (!is_type_integer(type) && is_type_valid(type)) {
3520 errorf(&size->base.source_position,
3521 "array size '%E' must have integer type but has type '%T'",
3526 mark_vars_read(size, NULL);
3529 if (is_static && size == NULL)
3530 errorf(&array->base.pos, "static array parameters require a size");
3532 rem_anchor_token(']');
3533 expect(']', end_error);
3540 static construct_type_t *parse_function_declarator(scope_t *scope)
3542 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3544 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3545 function_type_t *ftype = &type->function;
3547 ftype->linkage = current_linkage;
3548 ftype->calling_convention = CC_DEFAULT;
3550 parse_parameters(ftype, scope);
3552 cons->function.function_type = type;
3557 typedef struct parse_declarator_env_t {
3558 bool may_be_abstract : 1;
3559 bool must_be_abstract : 1;
3560 decl_modifiers_t modifiers;
3562 source_position_t source_position;
3564 attribute_t *attributes;
3565 } parse_declarator_env_t;
3568 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3570 /* construct a single linked list of construct_type_t's which describe
3571 * how to construct the final declarator type */
3572 construct_type_t *first = NULL;
3573 construct_type_t **anchor = &first;
3575 env->attributes = parse_attributes(env->attributes);
3578 construct_type_t *type;
3579 //variable_t *based = NULL; /* MS __based extension */
3580 switch (token.type) {
3582 type = parse_reference_declarator();
3586 panic("based not supported anymore");
3591 type = parse_pointer_declarator();
3595 goto ptr_operator_end;
3599 anchor = &type->base.next;
3601 /* TODO: find out if this is correct */
3602 env->attributes = parse_attributes(env->attributes);
3606 construct_type_t *inner_types = NULL;
3608 switch (token.type) {
3610 if (env->must_be_abstract) {
3611 errorf(HERE, "no identifier expected in typename");
3613 env->symbol = token.symbol;
3614 env->source_position = token.source_position;
3620 /* Parenthesized declarator or function declarator? */
3621 token_t const *const la1 = look_ahead(1);
3622 switch (la1->type) {
3624 if (is_typedef_symbol(la1->symbol)) {
3626 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3627 * interpreted as ``function with no parameter specification'', rather
3628 * than redundant parentheses around the omitted identifier. */
3630 /* Function declarator. */
3631 if (!env->may_be_abstract) {
3632 errorf(HERE, "function declarator must have a name");
3639 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3640 /* Paranthesized declarator. */
3642 add_anchor_token(')');
3643 inner_types = parse_inner_declarator(env);
3644 if (inner_types != NULL) {
3645 /* All later declarators only modify the return type */
3646 env->must_be_abstract = true;
3648 rem_anchor_token(')');
3649 expect(')', end_error);
3657 if (env->may_be_abstract)
3659 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3664 construct_type_t **const p = anchor;
3667 construct_type_t *type;
3668 switch (token.type) {
3670 scope_t *scope = NULL;
3671 if (!env->must_be_abstract) {
3672 scope = &env->parameters;
3675 type = parse_function_declarator(scope);
3679 type = parse_array_declarator();
3682 goto declarator_finished;
3685 /* insert in the middle of the list (at p) */
3686 type->base.next = *p;
3689 anchor = &type->base.next;
3692 declarator_finished:
3693 /* append inner_types at the end of the list, we don't to set anchor anymore
3694 * as it's not needed anymore */
3695 *anchor = inner_types;
3702 static type_t *construct_declarator_type(construct_type_t *construct_list,
3705 construct_type_t *iter = construct_list;
3706 for (; iter != NULL; iter = iter->base.next) {
3707 source_position_t const* const pos = &iter->base.pos;
3708 switch (iter->kind) {
3709 case CONSTRUCT_INVALID:
3711 case CONSTRUCT_FUNCTION: {
3712 construct_function_type_t *function = &iter->function;
3713 type_t *function_type = function->function_type;
3715 function_type->function.return_type = type;
3717 type_t *skipped_return_type = skip_typeref(type);
3719 if (is_type_function(skipped_return_type)) {
3720 errorf(pos, "function returning function is not allowed");
3721 } else if (is_type_array(skipped_return_type)) {
3722 errorf(pos, "function returning array is not allowed");
3724 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3725 warningf(pos, "type qualifiers in return type of function type are meaningless");
3729 /* The function type was constructed earlier. Freeing it here will
3730 * destroy other types. */
3731 type = typehash_insert(function_type);
3735 case CONSTRUCT_POINTER: {
3736 if (is_type_reference(skip_typeref(type)))
3737 errorf(pos, "cannot declare a pointer to reference");
3739 parsed_pointer_t *pointer = &iter->pointer;
3740 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3744 case CONSTRUCT_REFERENCE:
3745 if (is_type_reference(skip_typeref(type)))
3746 errorf(pos, "cannot declare a reference to reference");
3748 type = make_reference_type(type);
3751 case CONSTRUCT_ARRAY: {
3752 if (is_type_reference(skip_typeref(type)))
3753 errorf(pos, "cannot declare an array of references");
3755 parsed_array_t *array = &iter->array;
3756 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3758 expression_t *size_expression = array->size;
3759 if (size_expression != NULL) {
3761 = create_implicit_cast(size_expression, type_size_t);
3764 array_type->base.qualifiers = array->type_qualifiers;
3765 array_type->array.element_type = type;
3766 array_type->array.is_static = array->is_static;
3767 array_type->array.is_variable = array->is_variable;
3768 array_type->array.size_expression = size_expression;
3770 if (size_expression != NULL) {
3771 switch (is_constant_expression(size_expression)) {
3772 case EXPR_CLASS_CONSTANT: {
3773 long const size = fold_constant_to_int(size_expression);
3774 array_type->array.size = size;
3775 array_type->array.size_constant = true;
3776 /* §6.7.5.2:1 If the expression is a constant expression,
3777 * it shall have a value greater than zero. */
3779 errorf(&size_expression->base.source_position,
3780 "size of array must be greater than zero");
3781 } else if (size == 0 && !GNU_MODE) {
3782 errorf(&size_expression->base.source_position,
3783 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3788 case EXPR_CLASS_VARIABLE:
3789 array_type->array.is_vla = true;
3792 case EXPR_CLASS_ERROR:
3797 type_t *skipped_type = skip_typeref(type);
3799 if (is_type_incomplete(skipped_type)) {
3800 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3801 } else if (is_type_function(skipped_type)) {
3802 errorf(pos, "array of functions is not allowed");
3804 type = identify_new_type(array_type);
3808 internal_errorf(pos, "invalid type construction found");
3814 static type_t *automatic_type_conversion(type_t *orig_type);
3816 static type_t *semantic_parameter(const source_position_t *pos,
3818 const declaration_specifiers_t *specifiers,
3821 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3822 * shall be adjusted to ``qualified pointer to type'',
3824 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3825 * type'' shall be adjusted to ``pointer to function
3826 * returning type'', as in 6.3.2.1. */
3827 type = automatic_type_conversion(type);
3829 if (specifiers->is_inline && is_type_valid(type)) {
3830 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3833 /* §6.9.1:6 The declarations in the declaration list shall contain
3834 * no storage-class specifier other than register and no
3835 * initializations. */
3836 if (specifiers->thread_local || (
3837 specifiers->storage_class != STORAGE_CLASS_NONE &&
3838 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3840 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3843 /* delay test for incomplete type, because we might have (void)
3844 * which is legal but incomplete... */
3849 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3850 declarator_flags_t flags)
3852 parse_declarator_env_t env;
3853 memset(&env, 0, sizeof(env));
3854 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3856 construct_type_t *construct_type = parse_inner_declarator(&env);
3858 construct_declarator_type(construct_type, specifiers->type);
3859 type_t *type = skip_typeref(orig_type);
3861 if (construct_type != NULL) {
3862 obstack_free(&temp_obst, construct_type);
3865 attribute_t *attributes = parse_attributes(env.attributes);
3866 /* append (shared) specifier attribute behind attributes of this
3868 attribute_t **anchor = &attributes;
3869 while (*anchor != NULL)
3870 anchor = &(*anchor)->next;
3871 *anchor = specifiers->attributes;
3874 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3875 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3876 entity->base.source_position = env.source_position;
3877 entity->typedefe.type = orig_type;
3879 if (anonymous_entity != NULL) {
3880 if (is_type_compound(type)) {
3881 assert(anonymous_entity->compound.alias == NULL);
3882 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3883 anonymous_entity->kind == ENTITY_UNION);
3884 anonymous_entity->compound.alias = entity;
3885 anonymous_entity = NULL;
3886 } else if (is_type_enum(type)) {
3887 assert(anonymous_entity->enume.alias == NULL);
3888 assert(anonymous_entity->kind == ENTITY_ENUM);
3889 anonymous_entity->enume.alias = entity;
3890 anonymous_entity = NULL;
3894 /* create a declaration type entity */
3895 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3896 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3898 if (env.symbol != NULL) {
3899 if (specifiers->is_inline && is_type_valid(type)) {
3900 errorf(&env.source_position,
3901 "compound member '%Y' declared 'inline'", env.symbol);
3904 if (specifiers->thread_local ||
3905 specifiers->storage_class != STORAGE_CLASS_NONE) {
3906 errorf(&env.source_position,
3907 "compound member '%Y' must have no storage class",
3911 } else if (flags & DECL_IS_PARAMETER) {
3912 orig_type = semantic_parameter(&env.source_position, orig_type,
3913 specifiers, env.symbol);
3915 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3916 } else if (is_type_function(type)) {
3917 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3918 entity->function.is_inline = specifiers->is_inline;
3919 entity->function.elf_visibility = default_visibility;
3920 entity->function.parameters = env.parameters;
3922 if (env.symbol != NULL) {
3923 /* this needs fixes for C++ */
3924 bool in_function_scope = current_function != NULL;
3926 if (specifiers->thread_local || (
3927 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3928 specifiers->storage_class != STORAGE_CLASS_NONE &&
3929 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3931 errorf(&env.source_position,
3932 "invalid storage class for function '%Y'", env.symbol);
3936 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3937 entity->variable.elf_visibility = default_visibility;
3938 entity->variable.thread_local = specifiers->thread_local;
3940 if (env.symbol != NULL) {
3941 if (specifiers->is_inline && is_type_valid(type)) {
3942 errorf(&env.source_position,
3943 "variable '%Y' declared 'inline'", env.symbol);
3946 bool invalid_storage_class = false;
3947 if (current_scope == file_scope) {
3948 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3949 specifiers->storage_class != STORAGE_CLASS_NONE &&
3950 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3951 invalid_storage_class = true;
3954 if (specifiers->thread_local &&
3955 specifiers->storage_class == STORAGE_CLASS_NONE) {
3956 invalid_storage_class = true;
3959 if (invalid_storage_class) {
3960 errorf(&env.source_position,
3961 "invalid storage class for variable '%Y'", env.symbol);
3966 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3967 entity->declaration.type = orig_type;
3968 entity->declaration.alignment = get_type_alignment(orig_type);
3969 entity->declaration.modifiers = env.modifiers;
3970 entity->declaration.attributes = attributes;
3972 storage_class_t storage_class = specifiers->storage_class;
3973 entity->declaration.declared_storage_class = storage_class;
3975 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3976 storage_class = STORAGE_CLASS_AUTO;
3977 entity->declaration.storage_class = storage_class;
3980 if (attributes != NULL) {
3981 handle_entity_attributes(attributes, entity);
3987 static type_t *parse_abstract_declarator(type_t *base_type)
3989 parse_declarator_env_t env;
3990 memset(&env, 0, sizeof(env));
3991 env.may_be_abstract = true;
3992 env.must_be_abstract = true;
3994 construct_type_t *construct_type = parse_inner_declarator(&env);
3996 type_t *result = construct_declarator_type(construct_type, base_type);
3997 if (construct_type != NULL) {
3998 obstack_free(&temp_obst, construct_type);
4000 result = handle_type_attributes(env.attributes, result);
4006 * Check if the declaration of main is suspicious. main should be a
4007 * function with external linkage, returning int, taking either zero
4008 * arguments, two, or three arguments of appropriate types, ie.
4010 * int main([ int argc, char **argv [, char **env ] ]).
4012 * @param decl the declaration to check
4013 * @param type the function type of the declaration
4015 static void check_main(const entity_t *entity)
4017 const source_position_t *pos = &entity->base.source_position;
4018 if (entity->kind != ENTITY_FUNCTION) {
4019 warningf(pos, "'main' is not a function");
4023 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4024 warningf(pos, "'main' is normally a non-static function");
4027 type_t *type = skip_typeref(entity->declaration.type);
4028 assert(is_type_function(type));
4030 function_type_t *func_type = &type->function;
4031 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4032 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4033 func_type->return_type);
4035 const function_parameter_t *parm = func_type->parameters;
4037 type_t *const first_type = skip_typeref(parm->type);
4038 type_t *const first_type_unqual = get_unqualified_type(first_type);
4039 if (!types_compatible(first_type_unqual, type_int)) {
4041 "first argument of 'main' should be 'int', but is '%T'",
4046 type_t *const second_type = skip_typeref(parm->type);
4047 type_t *const second_type_unqual
4048 = get_unqualified_type(second_type);
4049 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
4050 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'",
4055 type_t *const third_type = skip_typeref(parm->type);
4056 type_t *const third_type_unqual
4057 = get_unqualified_type(third_type);
4058 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
4059 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'",
4064 goto warn_arg_count;
4068 warningf(pos, "'main' takes only zero, two or three arguments");
4074 * Check if a symbol is the equal to "main".
4076 static bool is_sym_main(const symbol_t *const sym)
4078 return strcmp(sym->string, "main") == 0;
4081 static void error_redefined_as_different_kind(const source_position_t *pos,
4082 const entity_t *old, entity_kind_t new_kind)
4084 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4085 get_entity_kind_name(old->kind), old->base.symbol,
4086 get_entity_kind_name(new_kind), &old->base.source_position);
4089 static bool is_entity_valid(entity_t *const ent)
4091 if (is_declaration(ent)) {
4092 return is_type_valid(skip_typeref(ent->declaration.type));
4093 } else if (ent->kind == ENTITY_TYPEDEF) {
4094 return is_type_valid(skip_typeref(ent->typedefe.type));
4099 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4101 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4102 if (attributes_equal(tattr, attr))
4109 * test wether new_list contains any attributes not included in old_list
4111 static bool has_new_attributes(const attribute_t *old_list,
4112 const attribute_t *new_list)
4114 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4115 if (!contains_attribute(old_list, attr))
4122 * Merge in attributes from an attribute list (probably from a previous
4123 * declaration with the same name). Warning: destroys the old structure
4124 * of the attribute list - don't reuse attributes after this call.
4126 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4129 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4131 if (contains_attribute(decl->attributes, attr))
4134 /* move attribute to new declarations attributes list */
4135 attr->next = decl->attributes;
4136 decl->attributes = attr;
4141 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4142 * for various problems that occur for multiple definitions
4144 entity_t *record_entity(entity_t *entity, const bool is_definition)
4146 const symbol_t *const symbol = entity->base.symbol;
4147 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4148 const source_position_t *pos = &entity->base.source_position;
4150 /* can happen in error cases */
4154 entity_t *const previous_entity = get_entity(symbol, namespc);
4155 /* pushing the same entity twice will break the stack structure */
4156 assert(previous_entity != entity);
4158 if (entity->kind == ENTITY_FUNCTION) {
4159 type_t *const orig_type = entity->declaration.type;
4160 type_t *const type = skip_typeref(orig_type);
4162 assert(is_type_function(type));
4163 if (type->function.unspecified_parameters &&
4164 warning.strict_prototypes &&
4165 previous_entity == NULL) {
4166 warningf(pos, "function declaration '%#T' is not a prototype",
4170 if (warning.main && current_scope == file_scope
4171 && is_sym_main(symbol)) {
4176 if (is_declaration(entity) &&
4177 warning.nested_externs &&
4178 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4179 current_scope != file_scope) {
4180 warningf(pos, "nested extern declaration of '%#T'",
4181 entity->declaration.type, symbol);
4184 if (previous_entity != NULL) {
4185 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4186 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4187 assert(previous_entity->kind == ENTITY_PARAMETER);
4189 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4190 entity->declaration.type, symbol,
4191 previous_entity->declaration.type, symbol,
4192 &previous_entity->base.source_position);
4196 if (previous_entity->base.parent_scope == current_scope) {
4197 if (previous_entity->kind != entity->kind) {
4198 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4199 error_redefined_as_different_kind(pos, previous_entity,
4204 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4205 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4206 symbol, &previous_entity->base.source_position);
4209 if (previous_entity->kind == ENTITY_TYPEDEF) {
4210 /* TODO: C++ allows this for exactly the same type */
4211 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4212 symbol, &previous_entity->base.source_position);
4216 /* at this point we should have only VARIABLES or FUNCTIONS */
4217 assert(is_declaration(previous_entity) && is_declaration(entity));
4219 declaration_t *const prev_decl = &previous_entity->declaration;
4220 declaration_t *const decl = &entity->declaration;
4222 /* can happen for K&R style declarations */
4223 if (prev_decl->type == NULL &&
4224 previous_entity->kind == ENTITY_PARAMETER &&
4225 entity->kind == ENTITY_PARAMETER) {
4226 prev_decl->type = decl->type;
4227 prev_decl->storage_class = decl->storage_class;
4228 prev_decl->declared_storage_class = decl->declared_storage_class;
4229 prev_decl->modifiers = decl->modifiers;
4230 return previous_entity;
4233 type_t *const orig_type = decl->type;
4234 assert(orig_type != NULL);
4235 type_t *const type = skip_typeref(orig_type);
4236 type_t *const prev_type = skip_typeref(prev_decl->type);
4238 if (!types_compatible(type, prev_type)) {
4240 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4241 orig_type, symbol, prev_decl->type, symbol,
4242 &previous_entity->base.source_position);
4244 unsigned old_storage_class = prev_decl->storage_class;
4246 if (warning.redundant_decls &&
4249 !(prev_decl->modifiers & DM_USED) &&
4250 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4251 warningf(&previous_entity->base.source_position,
4252 "unnecessary static forward declaration for '%#T'",
4253 prev_decl->type, symbol);
4256 storage_class_t new_storage_class = decl->storage_class;
4258 /* pretend no storage class means extern for function
4259 * declarations (except if the previous declaration is neither
4260 * none nor extern) */
4261 if (entity->kind == ENTITY_FUNCTION) {
4262 /* the previous declaration could have unspecified parameters or
4263 * be a typedef, so use the new type */
4264 if (prev_type->function.unspecified_parameters || is_definition)
4265 prev_decl->type = type;
4267 switch (old_storage_class) {
4268 case STORAGE_CLASS_NONE:
4269 old_storage_class = STORAGE_CLASS_EXTERN;
4272 case STORAGE_CLASS_EXTERN:
4273 if (is_definition) {
4274 if (warning.missing_prototypes &&
4275 prev_type->function.unspecified_parameters &&
4276 !is_sym_main(symbol)) {
4277 warningf(pos, "no previous prototype for '%#T'",
4280 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4281 new_storage_class = STORAGE_CLASS_EXTERN;
4288 } else if (is_type_incomplete(prev_type)) {
4289 prev_decl->type = type;
4292 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4293 new_storage_class == STORAGE_CLASS_EXTERN) {
4295 warn_redundant_declaration: ;
4297 = has_new_attributes(prev_decl->attributes,
4299 if (has_new_attrs) {
4300 merge_in_attributes(decl, prev_decl->attributes);
4301 } else if (!is_definition &&
4302 warning.redundant_decls &&
4303 is_type_valid(prev_type) &&
4304 strcmp(previous_entity->base.source_position.input_name,
4305 "<builtin>") != 0) {
4307 "redundant declaration for '%Y' (declared %P)",
4308 symbol, &previous_entity->base.source_position);
4310 } else if (current_function == NULL) {
4311 if (old_storage_class != STORAGE_CLASS_STATIC &&
4312 new_storage_class == STORAGE_CLASS_STATIC) {
4314 "static declaration of '%Y' follows non-static declaration (declared %P)",
4315 symbol, &previous_entity->base.source_position);
4316 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4317 prev_decl->storage_class = STORAGE_CLASS_NONE;
4318 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4320 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4322 goto error_redeclaration;
4323 goto warn_redundant_declaration;
4325 } else if (is_type_valid(prev_type)) {
4326 if (old_storage_class == new_storage_class) {
4327 error_redeclaration:
4328 errorf(pos, "redeclaration of '%Y' (declared %P)",
4329 symbol, &previous_entity->base.source_position);
4332 "redeclaration of '%Y' with different linkage (declared %P)",
4333 symbol, &previous_entity->base.source_position);
4338 prev_decl->modifiers |= decl->modifiers;
4339 if (entity->kind == ENTITY_FUNCTION) {
4340 previous_entity->function.is_inline |= entity->function.is_inline;
4342 return previous_entity;
4345 if (warning.shadow ||
4346 (warning.shadow_local && previous_entity->base.parent_scope != file_scope)) {
4347 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4348 get_entity_kind_name(entity->kind), symbol,
4349 get_entity_kind_name(previous_entity->kind),
4350 &previous_entity->base.source_position);
4354 if (entity->kind == ENTITY_FUNCTION) {
4355 if (is_definition &&
4356 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4357 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4358 warningf(pos, "no previous prototype for '%#T'",
4359 entity->declaration.type, symbol);
4360 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4361 warningf(pos, "no previous declaration for '%#T'",
4362 entity->declaration.type, symbol);
4365 } else if (warning.missing_declarations &&
4366 entity->kind == ENTITY_VARIABLE &&
4367 current_scope == file_scope) {
4368 declaration_t *declaration = &entity->declaration;
4369 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4370 warningf(pos, "no previous declaration for '%#T'",
4371 declaration->type, symbol);
4376 assert(entity->base.parent_scope == NULL);
4377 assert(current_scope != NULL);
4379 entity->base.parent_scope = current_scope;
4380 environment_push(entity);
4381 append_entity(current_scope, entity);
4386 static void parser_error_multiple_definition(entity_t *entity,
4387 const source_position_t *source_position)
4389 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4390 entity->base.symbol, &entity->base.source_position);
4393 static bool is_declaration_specifier(const token_t *token)
4395 switch (token->type) {
4399 return is_typedef_symbol(token->symbol);
4406 static void parse_init_declarator_rest(entity_t *entity)
4408 type_t *orig_type = type_error_type;
4410 if (entity->base.kind == ENTITY_TYPEDEF) {
4411 errorf(&entity->base.source_position,
4412 "typedef '%Y' is initialized (use __typeof__ instead)",
4413 entity->base.symbol);
4415 assert(is_declaration(entity));
4416 orig_type = entity->declaration.type;
4419 type_t *type = skip_typeref(orig_type);
4421 if (entity->kind == ENTITY_VARIABLE
4422 && entity->variable.initializer != NULL) {
4423 parser_error_multiple_definition(entity, HERE);
4427 declaration_t *const declaration = &entity->declaration;
4428 bool must_be_constant = false;
4429 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4430 entity->base.parent_scope == file_scope) {
4431 must_be_constant = true;
4434 if (is_type_function(type)) {
4435 errorf(&entity->base.source_position,
4436 "function '%#T' is initialized like a variable",
4437 orig_type, entity->base.symbol);
4438 orig_type = type_error_type;
4441 parse_initializer_env_t env;
4442 env.type = orig_type;
4443 env.must_be_constant = must_be_constant;
4444 env.entity = entity;
4445 current_init_decl = entity;
4447 initializer_t *initializer = parse_initializer(&env);
4448 current_init_decl = NULL;
4450 if (entity->kind == ENTITY_VARIABLE) {
4451 /* §6.7.5:22 array initializers for arrays with unknown size
4452 * determine the array type size */
4453 declaration->type = env.type;
4454 entity->variable.initializer = initializer;
4458 /* parse rest of a declaration without any declarator */
4459 static void parse_anonymous_declaration_rest(
4460 const declaration_specifiers_t *specifiers)
4463 anonymous_entity = NULL;
4465 if (warning.other) {
4466 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4467 specifiers->thread_local) {
4468 warningf(&specifiers->source_position,
4469 "useless storage class in empty declaration");
4472 type_t *type = specifiers->type;
4473 switch (type->kind) {
4474 case TYPE_COMPOUND_STRUCT:
4475 case TYPE_COMPOUND_UNION: {
4476 if (type->compound.compound->base.symbol == NULL) {
4477 warningf(&specifiers->source_position,
4478 "unnamed struct/union that defines no instances");
4487 warningf(&specifiers->source_position, "empty declaration");
4493 static void check_variable_type_complete(entity_t *ent)
4495 if (ent->kind != ENTITY_VARIABLE)
4498 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4499 * type for the object shall be complete [...] */
4500 declaration_t *decl = &ent->declaration;
4501 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4502 decl->storage_class == STORAGE_CLASS_STATIC)
4505 type_t *const orig_type = decl->type;
4506 type_t *const type = skip_typeref(orig_type);
4507 if (!is_type_incomplete(type))
4510 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4511 * are given length one. */
4512 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4513 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4517 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4518 orig_type, ent->base.symbol);
4522 static void parse_declaration_rest(entity_t *ndeclaration,
4523 const declaration_specifiers_t *specifiers,
4524 parsed_declaration_func finished_declaration,
4525 declarator_flags_t flags)
4527 add_anchor_token(';');
4528 add_anchor_token(',');
4530 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4532 if (token.type == '=') {
4533 parse_init_declarator_rest(entity);
4534 } else if (entity->kind == ENTITY_VARIABLE) {
4535 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4536 * [...] where the extern specifier is explicitly used. */
4537 declaration_t *decl = &entity->declaration;
4538 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4539 type_t *type = decl->type;
4540 if (is_type_reference(skip_typeref(type))) {
4541 errorf(&entity->base.source_position,
4542 "reference '%#T' must be initialized",
4543 type, entity->base.symbol);
4548 check_variable_type_complete(entity);
4553 add_anchor_token('=');
4554 ndeclaration = parse_declarator(specifiers, flags);
4555 rem_anchor_token('=');
4557 expect(';', end_error);
4560 anonymous_entity = NULL;
4561 rem_anchor_token(';');
4562 rem_anchor_token(',');
4565 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4567 symbol_t *symbol = entity->base.symbol;
4571 assert(entity->base.namespc == NAMESPACE_NORMAL);
4572 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4573 if (previous_entity == NULL
4574 || previous_entity->base.parent_scope != current_scope) {
4575 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4580 if (is_definition) {
4581 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4584 return record_entity(entity, false);
4587 static void parse_declaration(parsed_declaration_func finished_declaration,
4588 declarator_flags_t flags)
4590 add_anchor_token(';');
4591 declaration_specifiers_t specifiers;
4592 parse_declaration_specifiers(&specifiers);
4593 rem_anchor_token(';');
4595 if (token.type == ';') {
4596 parse_anonymous_declaration_rest(&specifiers);
4598 entity_t *entity = parse_declarator(&specifiers, flags);
4599 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4604 static type_t *get_default_promoted_type(type_t *orig_type)
4606 type_t *result = orig_type;
4608 type_t *type = skip_typeref(orig_type);
4609 if (is_type_integer(type)) {
4610 result = promote_integer(type);
4611 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4612 result = type_double;
4618 static void parse_kr_declaration_list(entity_t *entity)
4620 if (entity->kind != ENTITY_FUNCTION)
4623 type_t *type = skip_typeref(entity->declaration.type);
4624 assert(is_type_function(type));
4625 if (!type->function.kr_style_parameters)
4628 add_anchor_token('{');
4630 /* push function parameters */
4631 size_t const top = environment_top();
4632 scope_t *old_scope = scope_push(&entity->function.parameters);
4634 entity_t *parameter = entity->function.parameters.entities;
4635 for ( ; parameter != NULL; parameter = parameter->base.next) {
4636 assert(parameter->base.parent_scope == NULL);
4637 parameter->base.parent_scope = current_scope;
4638 environment_push(parameter);
4641 /* parse declaration list */
4643 switch (token.type) {
4645 case T___extension__:
4646 /* This covers symbols, which are no type, too, and results in
4647 * better error messages. The typical cases are misspelled type
4648 * names and missing includes. */
4650 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4658 /* pop function parameters */
4659 assert(current_scope == &entity->function.parameters);
4660 scope_pop(old_scope);
4661 environment_pop_to(top);
4663 /* update function type */
4664 type_t *new_type = duplicate_type(type);
4666 function_parameter_t *parameters = NULL;
4667 function_parameter_t **anchor = ¶meters;
4669 /* did we have an earlier prototype? */
4670 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4671 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4674 function_parameter_t *proto_parameter = NULL;
4675 if (proto_type != NULL) {
4676 type_t *proto_type_type = proto_type->declaration.type;
4677 proto_parameter = proto_type_type->function.parameters;
4678 /* If a K&R function definition has a variadic prototype earlier, then
4679 * make the function definition variadic, too. This should conform to
4680 * §6.7.5.3:15 and §6.9.1:8. */
4681 new_type->function.variadic = proto_type_type->function.variadic;
4683 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4685 new_type->function.unspecified_parameters = true;
4688 bool need_incompatible_warning = false;
4689 parameter = entity->function.parameters.entities;
4690 for (; parameter != NULL; parameter = parameter->base.next,
4692 proto_parameter == NULL ? NULL : proto_parameter->next) {
4693 if (parameter->kind != ENTITY_PARAMETER)
4696 type_t *parameter_type = parameter->declaration.type;
4697 if (parameter_type == NULL) {
4698 source_position_t const* const pos = ¶meter->base.source_position;
4700 errorf(pos, "no type specified for function parameter '%Y'", parameter->base.symbol);
4701 parameter_type = type_error_type;
4703 if (warning.implicit_int) {
4704 warningf(pos, "no type specified for function parameter '%Y', using 'int'", parameter->base.symbol);
4706 parameter_type = type_int;
4708 parameter->declaration.type = parameter_type;
4711 semantic_parameter_incomplete(parameter);
4713 /* we need the default promoted types for the function type */
4714 type_t *not_promoted = parameter_type;
4715 parameter_type = get_default_promoted_type(parameter_type);
4717 /* gcc special: if the type of the prototype matches the unpromoted
4718 * type don't promote */
4719 if (!strict_mode && proto_parameter != NULL) {
4720 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4721 type_t *promo_skip = skip_typeref(parameter_type);
4722 type_t *param_skip = skip_typeref(not_promoted);
4723 if (!types_compatible(proto_p_type, promo_skip)
4724 && types_compatible(proto_p_type, param_skip)) {
4726 need_incompatible_warning = true;
4727 parameter_type = not_promoted;
4730 function_parameter_t *const function_parameter
4731 = allocate_parameter(parameter_type);
4733 *anchor = function_parameter;
4734 anchor = &function_parameter->next;
4737 new_type->function.parameters = parameters;
4738 new_type = identify_new_type(new_type);
4740 if (warning.other && need_incompatible_warning) {
4741 type_t *proto_type_type = proto_type->declaration.type;
4742 warningf(&entity->base.source_position,
4743 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4744 proto_type_type, proto_type->base.symbol,
4745 new_type, entity->base.symbol,
4746 &proto_type->base.source_position);
4749 entity->declaration.type = new_type;
4751 rem_anchor_token('{');
4754 static bool first_err = true;
4757 * When called with first_err set, prints the name of the current function,
4760 static void print_in_function(void)
4764 diagnosticf("%s: In function '%Y':\n",
4765 current_function->base.base.source_position.input_name,
4766 current_function->base.base.symbol);
4771 * Check if all labels are defined in the current function.
4772 * Check if all labels are used in the current function.
4774 static void check_labels(void)
4776 for (const goto_statement_t *goto_statement = goto_first;
4777 goto_statement != NULL;
4778 goto_statement = goto_statement->next) {
4779 /* skip computed gotos */
4780 if (goto_statement->expression != NULL)
4783 label_t *label = goto_statement->label;
4784 if (label->base.source_position.input_name == NULL) {
4785 print_in_function();
4786 errorf(&goto_statement->base.source_position,
4787 "label '%Y' used but not defined", label->base.symbol);
4791 if (warning.unused_label) {
4792 for (const label_statement_t *label_statement = label_first;
4793 label_statement != NULL;
4794 label_statement = label_statement->next) {
4795 label_t *label = label_statement->label;
4797 if (! label->used) {
4798 print_in_function();
4799 warningf(&label_statement->base.source_position,
4800 "label '%Y' defined but not used", label->base.symbol);
4806 static void warn_unused_entity(entity_t *entity, entity_t *last)
4808 entity_t const *const end = last != NULL ? last->base.next : NULL;
4809 for (; entity != end; entity = entity->base.next) {
4810 if (!is_declaration(entity))
4813 declaration_t *declaration = &entity->declaration;
4814 if (declaration->implicit)
4817 if (!declaration->used) {
4818 print_in_function();
4819 const char *what = get_entity_kind_name(entity->kind);
4820 warningf(&entity->base.source_position, "%s '%Y' is unused",
4821 what, entity->base.symbol);
4822 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4823 print_in_function();
4824 const char *what = get_entity_kind_name(entity->kind);
4825 warningf(&entity->base.source_position, "%s '%Y' is never read",
4826 what, entity->base.symbol);
4831 static void check_unused_variables(statement_t *const stmt, void *const env)
4835 switch (stmt->kind) {
4836 case STATEMENT_DECLARATION: {
4837 declaration_statement_t const *const decls = &stmt->declaration;
4838 warn_unused_entity(decls->declarations_begin,
4839 decls->declarations_end);
4844 warn_unused_entity(stmt->fors.scope.entities, NULL);
4853 * Check declarations of current_function for unused entities.
4855 static void check_declarations(void)
4857 if (warning.unused_parameter) {
4858 const scope_t *scope = ¤t_function->parameters;
4860 /* do not issue unused warnings for main */
4861 if (!is_sym_main(current_function->base.base.symbol)) {
4862 warn_unused_entity(scope->entities, NULL);
4865 if (warning.unused_variable) {
4866 walk_statements(current_function->statement, check_unused_variables,
4871 static int determine_truth(expression_t const* const cond)
4874 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4875 fold_constant_to_bool(cond) ? 1 :
4879 static void check_reachable(statement_t *);
4880 static bool reaches_end;
4882 static bool expression_returns(expression_t const *const expr)
4884 switch (expr->kind) {
4886 expression_t const *const func = expr->call.function;
4887 if (func->kind == EXPR_REFERENCE) {
4888 entity_t *entity = func->reference.entity;
4889 if (entity->kind == ENTITY_FUNCTION
4890 && entity->declaration.modifiers & DM_NORETURN)
4894 if (!expression_returns(func))
4897 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4898 if (!expression_returns(arg->expression))
4905 case EXPR_REFERENCE:
4906 case EXPR_REFERENCE_ENUM_VALUE:
4908 case EXPR_STRING_LITERAL:
4909 case EXPR_WIDE_STRING_LITERAL:
4910 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4911 case EXPR_LABEL_ADDRESS:
4912 case EXPR_CLASSIFY_TYPE:
4913 case EXPR_SIZEOF: // TODO handle obscure VLA case
4916 case EXPR_BUILTIN_CONSTANT_P:
4917 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4922 case EXPR_STATEMENT: {
4923 bool old_reaches_end = reaches_end;
4924 reaches_end = false;
4925 check_reachable(expr->statement.statement);
4926 bool returns = reaches_end;
4927 reaches_end = old_reaches_end;
4931 case EXPR_CONDITIONAL:
4932 // TODO handle constant expression
4934 if (!expression_returns(expr->conditional.condition))
4937 if (expr->conditional.true_expression != NULL
4938 && expression_returns(expr->conditional.true_expression))
4941 return expression_returns(expr->conditional.false_expression);
4944 return expression_returns(expr->select.compound);
4946 case EXPR_ARRAY_ACCESS:
4948 expression_returns(expr->array_access.array_ref) &&
4949 expression_returns(expr->array_access.index);
4952 return expression_returns(expr->va_starte.ap);
4955 return expression_returns(expr->va_arge.ap);
4958 return expression_returns(expr->va_copye.src);
4960 EXPR_UNARY_CASES_MANDATORY
4961 return expression_returns(expr->unary.value);
4963 case EXPR_UNARY_THROW:
4967 // TODO handle constant lhs of && and ||
4969 expression_returns(expr->binary.left) &&
4970 expression_returns(expr->binary.right);
4976 panic("unhandled expression");
4979 static bool initializer_returns(initializer_t const *const init)
4981 switch (init->kind) {
4982 case INITIALIZER_VALUE:
4983 return expression_returns(init->value.value);
4985 case INITIALIZER_LIST: {
4986 initializer_t * const* i = init->list.initializers;
4987 initializer_t * const* const end = i + init->list.len;
4988 bool returns = true;
4989 for (; i != end; ++i) {
4990 if (!initializer_returns(*i))
4996 case INITIALIZER_STRING:
4997 case INITIALIZER_WIDE_STRING:
4998 case INITIALIZER_DESIGNATOR: // designators have no payload
5001 panic("unhandled initializer");
5004 static bool noreturn_candidate;
5006 static void check_reachable(statement_t *const stmt)
5008 if (stmt->base.reachable)
5010 if (stmt->kind != STATEMENT_DO_WHILE)
5011 stmt->base.reachable = true;
5013 statement_t *last = stmt;
5015 switch (stmt->kind) {
5016 case STATEMENT_INVALID:
5017 case STATEMENT_EMPTY:
5019 next = stmt->base.next;
5022 case STATEMENT_DECLARATION: {
5023 declaration_statement_t const *const decl = &stmt->declaration;
5024 entity_t const * ent = decl->declarations_begin;
5025 entity_t const *const last_decl = decl->declarations_end;
5027 for (;; ent = ent->base.next) {
5028 if (ent->kind == ENTITY_VARIABLE &&
5029 ent->variable.initializer != NULL &&
5030 !initializer_returns(ent->variable.initializer)) {
5033 if (ent == last_decl)
5037 next = stmt->base.next;
5041 case STATEMENT_COMPOUND:
5042 next = stmt->compound.statements;
5044 next = stmt->base.next;
5047 case STATEMENT_RETURN: {
5048 expression_t const *const val = stmt->returns.value;
5049 if (val == NULL || expression_returns(val))
5050 noreturn_candidate = false;
5054 case STATEMENT_IF: {
5055 if_statement_t const *const ifs = &stmt->ifs;
5056 expression_t const *const cond = ifs->condition;
5058 if (!expression_returns(cond))
5061 int const val = determine_truth(cond);
5064 check_reachable(ifs->true_statement);
5069 if (ifs->false_statement != NULL) {
5070 check_reachable(ifs->false_statement);
5074 next = stmt->base.next;
5078 case STATEMENT_SWITCH: {
5079 switch_statement_t const *const switchs = &stmt->switchs;
5080 expression_t const *const expr = switchs->expression;
5082 if (!expression_returns(expr))
5085 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
5086 long const val = fold_constant_to_int(expr);
5087 case_label_statement_t * defaults = NULL;
5088 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5089 if (i->expression == NULL) {
5094 if (i->first_case <= val && val <= i->last_case) {
5095 check_reachable((statement_t*)i);
5100 if (defaults != NULL) {
5101 check_reachable((statement_t*)defaults);
5105 bool has_default = false;
5106 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5107 if (i->expression == NULL)
5110 check_reachable((statement_t*)i);
5117 next = stmt->base.next;
5121 case STATEMENT_EXPRESSION: {
5122 /* Check for noreturn function call */
5123 expression_t const *const expr = stmt->expression.expression;
5124 if (!expression_returns(expr))
5127 next = stmt->base.next;
5131 case STATEMENT_CONTINUE:
5132 for (statement_t *parent = stmt;;) {
5133 parent = parent->base.parent;
5134 if (parent == NULL) /* continue not within loop */
5138 switch (parent->kind) {
5139 case STATEMENT_WHILE: goto continue_while;
5140 case STATEMENT_DO_WHILE: goto continue_do_while;
5141 case STATEMENT_FOR: goto continue_for;
5147 case STATEMENT_BREAK:
5148 for (statement_t *parent = stmt;;) {
5149 parent = parent->base.parent;
5150 if (parent == NULL) /* break not within loop/switch */
5153 switch (parent->kind) {
5154 case STATEMENT_SWITCH:
5155 case STATEMENT_WHILE:
5156 case STATEMENT_DO_WHILE:
5159 next = parent->base.next;
5160 goto found_break_parent;
5168 case STATEMENT_GOTO:
5169 if (stmt->gotos.expression) {
5170 if (!expression_returns(stmt->gotos.expression))
5173 statement_t *parent = stmt->base.parent;
5174 if (parent == NULL) /* top level goto */
5178 next = stmt->gotos.label->statement;
5179 if (next == NULL) /* missing label */
5184 case STATEMENT_LABEL:
5185 next = stmt->label.statement;
5188 case STATEMENT_CASE_LABEL:
5189 next = stmt->case_label.statement;
5192 case STATEMENT_WHILE: {
5193 while_statement_t const *const whiles = &stmt->whiles;
5194 expression_t const *const cond = whiles->condition;
5196 if (!expression_returns(cond))
5199 int const val = determine_truth(cond);
5202 check_reachable(whiles->body);
5207 next = stmt->base.next;
5211 case STATEMENT_DO_WHILE:
5212 next = stmt->do_while.body;
5215 case STATEMENT_FOR: {
5216 for_statement_t *const fors = &stmt->fors;
5218 if (fors->condition_reachable)
5220 fors->condition_reachable = true;
5222 expression_t const *const cond = fors->condition;
5227 } else if (expression_returns(cond)) {
5228 val = determine_truth(cond);
5234 check_reachable(fors->body);
5239 next = stmt->base.next;
5243 case STATEMENT_MS_TRY: {
5244 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5245 check_reachable(ms_try->try_statement);
5246 next = ms_try->final_statement;
5250 case STATEMENT_LEAVE: {
5251 statement_t *parent = stmt;
5253 parent = parent->base.parent;
5254 if (parent == NULL) /* __leave not within __try */
5257 if (parent->kind == STATEMENT_MS_TRY) {
5259 next = parent->ms_try.final_statement;
5267 panic("invalid statement kind");
5270 while (next == NULL) {
5271 next = last->base.parent;
5273 noreturn_candidate = false;
5275 type_t *const type = skip_typeref(current_function->base.type);
5276 assert(is_type_function(type));
5277 type_t *const ret = skip_typeref(type->function.return_type);
5278 if (warning.return_type &&
5279 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5280 is_type_valid(ret) &&
5281 !is_sym_main(current_function->base.base.symbol)) {
5282 warningf(&stmt->base.source_position,
5283 "control reaches end of non-void function");
5288 switch (next->kind) {
5289 case STATEMENT_INVALID:
5290 case STATEMENT_EMPTY:
5291 case STATEMENT_DECLARATION:
5292 case STATEMENT_EXPRESSION:
5294 case STATEMENT_RETURN:
5295 case STATEMENT_CONTINUE:
5296 case STATEMENT_BREAK:
5297 case STATEMENT_GOTO:
5298 case STATEMENT_LEAVE:
5299 panic("invalid control flow in function");
5301 case STATEMENT_COMPOUND:
5302 if (next->compound.stmt_expr) {
5308 case STATEMENT_SWITCH:
5309 case STATEMENT_LABEL:
5310 case STATEMENT_CASE_LABEL:
5312 next = next->base.next;
5315 case STATEMENT_WHILE: {
5317 if (next->base.reachable)
5319 next->base.reachable = true;
5321 while_statement_t const *const whiles = &next->whiles;
5322 expression_t const *const cond = whiles->condition;
5324 if (!expression_returns(cond))
5327 int const val = determine_truth(cond);
5330 check_reachable(whiles->body);
5336 next = next->base.next;
5340 case STATEMENT_DO_WHILE: {
5342 if (next->base.reachable)
5344 next->base.reachable = true;
5346 do_while_statement_t const *const dw = &next->do_while;
5347 expression_t const *const cond = dw->condition;
5349 if (!expression_returns(cond))
5352 int const val = determine_truth(cond);
5355 check_reachable(dw->body);
5361 next = next->base.next;
5365 case STATEMENT_FOR: {
5367 for_statement_t *const fors = &next->fors;
5369 fors->step_reachable = true;
5371 if (fors->condition_reachable)
5373 fors->condition_reachable = true;
5375 expression_t const *const cond = fors->condition;
5380 } else if (expression_returns(cond)) {
5381 val = determine_truth(cond);
5387 check_reachable(fors->body);
5393 next = next->base.next;
5397 case STATEMENT_MS_TRY:
5399 next = next->ms_try.final_statement;
5404 check_reachable(next);
5407 static void check_unreachable(statement_t* const stmt, void *const env)
5411 switch (stmt->kind) {
5412 case STATEMENT_DO_WHILE:
5413 if (!stmt->base.reachable) {
5414 expression_t const *const cond = stmt->do_while.condition;
5415 if (determine_truth(cond) >= 0) {
5416 warningf(&cond->base.source_position,
5417 "condition of do-while-loop is unreachable");
5422 case STATEMENT_FOR: {
5423 for_statement_t const* const fors = &stmt->fors;
5425 // if init and step are unreachable, cond is unreachable, too
5426 if (!stmt->base.reachable && !fors->step_reachable) {
5427 warningf(&stmt->base.source_position, "statement is unreachable");
5429 if (!stmt->base.reachable && fors->initialisation != NULL) {
5430 warningf(&fors->initialisation->base.source_position,
5431 "initialisation of for-statement is unreachable");
5434 if (!fors->condition_reachable && fors->condition != NULL) {
5435 warningf(&fors->condition->base.source_position,
5436 "condition of for-statement is unreachable");
5439 if (!fors->step_reachable && fors->step != NULL) {
5440 warningf(&fors->step->base.source_position,
5441 "step of for-statement is unreachable");
5447 case STATEMENT_COMPOUND:
5448 if (stmt->compound.statements != NULL)
5450 goto warn_unreachable;
5452 case STATEMENT_DECLARATION: {
5453 /* Only warn if there is at least one declarator with an initializer.
5454 * This typically occurs in switch statements. */
5455 declaration_statement_t const *const decl = &stmt->declaration;
5456 entity_t const * ent = decl->declarations_begin;
5457 entity_t const *const last = decl->declarations_end;
5459 for (;; ent = ent->base.next) {
5460 if (ent->kind == ENTITY_VARIABLE &&
5461 ent->variable.initializer != NULL) {
5462 goto warn_unreachable;
5472 if (!stmt->base.reachable)
5473 warningf(&stmt->base.source_position, "statement is unreachable");
5478 static void parse_external_declaration(void)
5480 /* function-definitions and declarations both start with declaration
5482 add_anchor_token(';');
5483 declaration_specifiers_t specifiers;
5484 parse_declaration_specifiers(&specifiers);
5485 rem_anchor_token(';');
5487 /* must be a declaration */
5488 if (token.type == ';') {
5489 parse_anonymous_declaration_rest(&specifiers);
5493 add_anchor_token(',');
5494 add_anchor_token('=');
5495 add_anchor_token(';');
5496 add_anchor_token('{');
5498 /* declarator is common to both function-definitions and declarations */
5499 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5501 rem_anchor_token('{');
5502 rem_anchor_token(';');
5503 rem_anchor_token('=');
5504 rem_anchor_token(',');
5506 /* must be a declaration */
5507 switch (token.type) {
5511 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5516 /* must be a function definition */
5517 parse_kr_declaration_list(ndeclaration);
5519 if (token.type != '{') {
5520 parse_error_expected("while parsing function definition", '{', NULL);
5521 eat_until_matching_token(';');
5525 assert(is_declaration(ndeclaration));
5526 type_t *const orig_type = ndeclaration->declaration.type;
5527 type_t * type = skip_typeref(orig_type);
5529 if (!is_type_function(type)) {
5530 if (is_type_valid(type)) {
5531 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5532 type, ndeclaration->base.symbol);
5536 } else if (is_typeref(orig_type)) {
5538 errorf(&ndeclaration->base.source_position,
5539 "type of function definition '%#T' is a typedef",
5540 orig_type, ndeclaration->base.symbol);
5543 if (warning.aggregate_return &&
5544 is_type_compound(skip_typeref(type->function.return_type))) {
5545 warningf(&ndeclaration->base.source_position, "function '%Y' returns an aggregate",
5546 ndeclaration->base.symbol);
5548 if (warning.traditional && !type->function.unspecified_parameters) {
5549 warningf(&ndeclaration->base.source_position, "traditional C rejects ISO C style function definition of function '%Y'",
5550 ndeclaration->base.symbol);
5552 if (warning.old_style_definition && type->function.unspecified_parameters) {
5553 warningf(&ndeclaration->base.source_position, "old-style function definition '%Y'",
5554 ndeclaration->base.symbol);
5557 /* §6.7.5.3:14 a function definition with () means no
5558 * parameters (and not unspecified parameters) */
5559 if (type->function.unspecified_parameters &&
5560 type->function.parameters == NULL) {
5561 type_t *copy = duplicate_type(type);
5562 copy->function.unspecified_parameters = false;
5563 type = identify_new_type(copy);
5565 ndeclaration->declaration.type = type;
5568 entity_t *const entity = record_entity(ndeclaration, true);
5569 assert(entity->kind == ENTITY_FUNCTION);
5570 assert(ndeclaration->kind == ENTITY_FUNCTION);
5572 function_t *const function = &entity->function;
5573 if (ndeclaration != entity) {
5574 function->parameters = ndeclaration->function.parameters;
5576 assert(is_declaration(entity));
5577 type = skip_typeref(entity->declaration.type);
5579 /* push function parameters and switch scope */
5580 size_t const top = environment_top();
5581 scope_t *old_scope = scope_push(&function->parameters);
5583 entity_t *parameter = function->parameters.entities;
5584 for (; parameter != NULL; parameter = parameter->base.next) {
5585 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5586 parameter->base.parent_scope = current_scope;
5588 assert(parameter->base.parent_scope == NULL
5589 || parameter->base.parent_scope == current_scope);
5590 parameter->base.parent_scope = current_scope;
5591 if (parameter->base.symbol == NULL) {
5592 errorf(¶meter->base.source_position, "parameter name omitted");
5595 environment_push(parameter);
5598 if (function->statement != NULL) {
5599 parser_error_multiple_definition(entity, HERE);
5602 /* parse function body */
5603 int label_stack_top = label_top();
5604 function_t *old_current_function = current_function;
5605 entity_t *old_current_entity = current_entity;
5606 current_function = function;
5607 current_entity = entity;
5608 current_parent = NULL;
5611 goto_anchor = &goto_first;
5613 label_anchor = &label_first;
5615 statement_t *const body = parse_compound_statement(false);
5616 function->statement = body;
5619 check_declarations();
5620 if (warning.return_type ||
5621 warning.unreachable_code ||
5622 (warning.missing_noreturn
5623 && !(function->base.modifiers & DM_NORETURN))) {
5624 noreturn_candidate = true;
5625 check_reachable(body);
5626 if (warning.unreachable_code)
5627 walk_statements(body, check_unreachable, NULL);
5628 if (warning.missing_noreturn &&
5629 noreturn_candidate &&
5630 !(function->base.modifiers & DM_NORETURN)) {
5631 warningf(&body->base.source_position,
5632 "function '%#T' is candidate for attribute 'noreturn'",
5633 type, entity->base.symbol);
5637 assert(current_parent == NULL);
5638 assert(current_function == function);
5639 assert(current_entity == entity);
5640 current_entity = old_current_entity;
5641 current_function = old_current_function;
5642 label_pop_to(label_stack_top);
5645 assert(current_scope == &function->parameters);
5646 scope_pop(old_scope);
5647 environment_pop_to(top);
5650 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5651 source_position_t *source_position,
5652 const symbol_t *symbol)
5654 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5656 type->bitfield.base_type = base_type;
5657 type->bitfield.size_expression = size;
5660 type_t *skipped_type = skip_typeref(base_type);
5661 if (!is_type_integer(skipped_type)) {
5662 errorf(source_position, "bitfield base type '%T' is not an integer type", base_type);
5665 bit_size = get_type_size(base_type) * 8;
5668 if (is_constant_expression(size) == EXPR_CLASS_CONSTANT) {
5669 long v = fold_constant_to_int(size);
5670 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5673 errorf(source_position, "negative width in bit-field '%Y'",
5675 } else if (v == 0 && symbol != NULL) {
5676 errorf(source_position, "zero width for bit-field '%Y'",
5678 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5679 errorf(source_position, "width of '%Y' exceeds its type",
5682 type->bitfield.bit_size = v;
5689 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5691 entity_t *iter = compound->members.entities;
5692 for (; iter != NULL; iter = iter->base.next) {
5693 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5696 if (iter->base.symbol == symbol) {
5698 } else if (iter->base.symbol == NULL) {
5699 /* search in anonymous structs and unions */
5700 type_t *type = skip_typeref(iter->declaration.type);
5701 if (is_type_compound(type)) {
5702 if (find_compound_entry(type->compound.compound, symbol)
5713 static void check_deprecated(const source_position_t *source_position,
5714 const entity_t *entity)
5716 if (!warning.deprecated_declarations)
5718 if (!is_declaration(entity))
5720 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5723 char const *const prefix = get_entity_kind_name(entity->kind);
5724 const char *deprecated_string
5725 = get_deprecated_string(entity->declaration.attributes);
5726 if (deprecated_string != NULL) {
5727 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5728 prefix, entity->base.symbol, &entity->base.source_position,
5731 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5732 entity->base.symbol, &entity->base.source_position);
5737 static expression_t *create_select(const source_position_t *pos,
5739 type_qualifiers_t qualifiers,
5742 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5744 check_deprecated(pos, entry);
5746 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5747 select->select.compound = addr;
5748 select->select.compound_entry = entry;
5750 type_t *entry_type = entry->declaration.type;
5751 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5753 /* we always do the auto-type conversions; the & and sizeof parser contains
5754 * code to revert this! */
5755 select->base.type = automatic_type_conversion(res_type);
5756 if (res_type->kind == TYPE_BITFIELD) {
5757 select->base.type = res_type->bitfield.base_type;
5764 * Find entry with symbol in compound. Search anonymous structs and unions and
5765 * creates implicit select expressions for them.
5766 * Returns the adress for the innermost compound.
5768 static expression_t *find_create_select(const source_position_t *pos,
5770 type_qualifiers_t qualifiers,
5771 compound_t *compound, symbol_t *symbol)
5773 entity_t *iter = compound->members.entities;
5774 for (; iter != NULL; iter = iter->base.next) {
5775 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5778 symbol_t *iter_symbol = iter->base.symbol;
5779 if (iter_symbol == NULL) {
5780 type_t *type = iter->declaration.type;
5781 if (type->kind != TYPE_COMPOUND_STRUCT
5782 && type->kind != TYPE_COMPOUND_UNION)
5785 compound_t *sub_compound = type->compound.compound;
5787 if (find_compound_entry(sub_compound, symbol) == NULL)
5790 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5791 sub_addr->base.source_position = *pos;
5792 sub_addr->select.implicit = true;
5793 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5797 if (iter_symbol == symbol) {
5798 return create_select(pos, addr, qualifiers, iter);
5805 static void parse_compound_declarators(compound_t *compound,
5806 const declaration_specifiers_t *specifiers)
5811 if (token.type == ':') {
5812 source_position_t source_position = *HERE;
5815 type_t *base_type = specifiers->type;
5816 expression_t *size = parse_constant_expression();
5818 type_t *type = make_bitfield_type(base_type, size,
5819 &source_position, NULL);
5821 attribute_t *attributes = parse_attributes(NULL);
5822 attribute_t **anchor = &attributes;
5823 while (*anchor != NULL)
5824 anchor = &(*anchor)->next;
5825 *anchor = specifiers->attributes;
5827 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL);
5828 entity->base.source_position = source_position;
5829 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5830 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5831 entity->declaration.type = type;
5832 entity->declaration.attributes = attributes;
5834 if (attributes != NULL) {
5835 handle_entity_attributes(attributes, entity);
5837 append_entity(&compound->members, entity);
5839 entity = parse_declarator(specifiers,
5840 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5841 if (entity->kind == ENTITY_TYPEDEF) {
5842 errorf(&entity->base.source_position,
5843 "typedef not allowed as compound member");
5845 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5847 /* make sure we don't define a symbol multiple times */
5848 symbol_t *symbol = entity->base.symbol;
5849 if (symbol != NULL) {
5850 entity_t *prev = find_compound_entry(compound, symbol);
5852 errorf(&entity->base.source_position,
5853 "multiple declarations of symbol '%Y' (declared %P)",
5854 symbol, &prev->base.source_position);
5858 if (token.type == ':') {
5859 source_position_t source_position = *HERE;
5861 expression_t *size = parse_constant_expression();
5863 type_t *type = entity->declaration.type;
5864 type_t *bitfield_type = make_bitfield_type(type, size,
5865 &source_position, entity->base.symbol);
5867 attribute_t *attributes = parse_attributes(NULL);
5868 entity->declaration.type = bitfield_type;
5869 handle_entity_attributes(attributes, entity);
5871 type_t *orig_type = entity->declaration.type;
5872 type_t *type = skip_typeref(orig_type);
5873 if (is_type_function(type)) {
5874 errorf(&entity->base.source_position,
5875 "compound member '%Y' must not have function type '%T'",
5876 entity->base.symbol, orig_type);
5877 } else if (is_type_incomplete(type)) {
5878 /* §6.7.2.1:16 flexible array member */
5879 if (!is_type_array(type) ||
5880 token.type != ';' ||
5881 look_ahead(1)->type != '}') {
5882 errorf(&entity->base.source_position,
5883 "compound member '%Y' has incomplete type '%T'",
5884 entity->base.symbol, orig_type);
5889 append_entity(&compound->members, entity);
5892 } while (next_if(','));
5893 expect(';', end_error);
5896 anonymous_entity = NULL;
5899 static void parse_compound_type_entries(compound_t *compound)
5902 add_anchor_token('}');
5904 while (token.type != '}') {
5905 if (token.type == T_EOF) {
5906 errorf(HERE, "EOF while parsing struct");
5909 declaration_specifiers_t specifiers;
5910 parse_declaration_specifiers(&specifiers);
5911 parse_compound_declarators(compound, &specifiers);
5913 rem_anchor_token('}');
5917 compound->complete = true;
5920 static type_t *parse_typename(void)
5922 declaration_specifiers_t specifiers;
5923 parse_declaration_specifiers(&specifiers);
5924 if (specifiers.storage_class != STORAGE_CLASS_NONE
5925 || specifiers.thread_local) {
5926 /* TODO: improve error message, user does probably not know what a
5927 * storage class is...
5929 errorf(&specifiers.source_position, "typename must not have a storage class");
5932 type_t *result = parse_abstract_declarator(specifiers.type);
5940 typedef expression_t* (*parse_expression_function)(void);
5941 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5943 typedef struct expression_parser_function_t expression_parser_function_t;
5944 struct expression_parser_function_t {
5945 parse_expression_function parser;
5946 precedence_t infix_precedence;
5947 parse_expression_infix_function infix_parser;
5950 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5953 * Prints an error message if an expression was expected but not read
5955 static expression_t *expected_expression_error(void)
5957 /* skip the error message if the error token was read */
5958 if (token.type != T_ERROR) {
5959 errorf(HERE, "expected expression, got token %K", &token);
5963 return create_invalid_expression();
5966 static type_t *get_string_type(void)
5968 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
5971 static type_t *get_wide_string_type(void)
5973 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5977 * Parse a string constant.
5979 static expression_t *parse_string_literal(void)
5981 source_position_t begin = token.source_position;
5982 string_t res = token.literal;
5983 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
5986 while (token.type == T_STRING_LITERAL
5987 || token.type == T_WIDE_STRING_LITERAL) {
5988 warn_string_concat(&token.source_position);
5989 res = concat_strings(&res, &token.literal);
5991 is_wide |= token.type == T_WIDE_STRING_LITERAL;
5994 expression_t *literal;
5996 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5997 literal->base.type = get_wide_string_type();
5999 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6000 literal->base.type = get_string_type();
6002 literal->base.source_position = begin;
6003 literal->literal.value = res;
6009 * Parse a boolean constant.
6011 static expression_t *parse_boolean_literal(bool value)
6013 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6014 literal->base.source_position = token.source_position;
6015 literal->base.type = type_bool;
6016 literal->literal.value.begin = value ? "true" : "false";
6017 literal->literal.value.size = value ? 4 : 5;
6023 static void warn_traditional_suffix(void)
6025 if (!warning.traditional)
6027 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6031 static void check_integer_suffix(void)
6033 symbol_t *suffix = token.symbol;
6037 bool not_traditional = false;
6038 const char *c = suffix->string;
6039 if (*c == 'l' || *c == 'L') {
6042 not_traditional = true;
6044 if (*c == 'u' || *c == 'U') {
6047 } else if (*c == 'u' || *c == 'U') {
6048 not_traditional = true;
6051 } else if (*c == 'u' || *c == 'U') {
6052 not_traditional = true;
6054 if (*c == 'l' || *c == 'L') {
6062 errorf(&token.source_position,
6063 "invalid suffix '%s' on integer constant", suffix->string);
6064 } else if (not_traditional) {
6065 warn_traditional_suffix();
6069 static type_t *check_floatingpoint_suffix(void)
6071 symbol_t *suffix = token.symbol;
6072 type_t *type = type_double;
6076 bool not_traditional = false;
6077 const char *c = suffix->string;
6078 if (*c == 'f' || *c == 'F') {
6081 } else if (*c == 'l' || *c == 'L') {
6083 type = type_long_double;
6086 errorf(&token.source_position,
6087 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6088 } else if (not_traditional) {
6089 warn_traditional_suffix();
6096 * Parse an integer constant.
6098 static expression_t *parse_number_literal(void)
6100 expression_kind_t kind;
6103 switch (token.type) {
6105 kind = EXPR_LITERAL_INTEGER;
6106 check_integer_suffix();
6109 case T_INTEGER_OCTAL:
6110 kind = EXPR_LITERAL_INTEGER_OCTAL;
6111 check_integer_suffix();
6114 case T_INTEGER_HEXADECIMAL:
6115 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6116 check_integer_suffix();
6119 case T_FLOATINGPOINT:
6120 kind = EXPR_LITERAL_FLOATINGPOINT;
6121 type = check_floatingpoint_suffix();
6123 case T_FLOATINGPOINT_HEXADECIMAL:
6124 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6125 type = check_floatingpoint_suffix();
6128 panic("unexpected token type in parse_number_literal");
6131 expression_t *literal = allocate_expression_zero(kind);
6132 literal->base.source_position = token.source_position;
6133 literal->base.type = type;
6134 literal->literal.value = token.literal;
6135 literal->literal.suffix = token.symbol;
6138 /* integer type depends on the size of the number and the size
6139 * representable by the types. The backend/codegeneration has to determine
6142 determine_literal_type(&literal->literal);
6147 * Parse a character constant.
6149 static expression_t *parse_character_constant(void)
6151 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6152 literal->base.source_position = token.source_position;
6153 literal->base.type = c_mode & _CXX ? type_char : type_int;
6154 literal->literal.value = token.literal;
6156 size_t len = literal->literal.value.size;
6158 if (!GNU_MODE && !(c_mode & _C99)) {
6159 errorf(HERE, "more than 1 character in character constant");
6160 } else if (warning.multichar) {
6161 literal->base.type = type_int;
6162 warningf(HERE, "multi-character character constant");
6171 * Parse a wide character constant.
6173 static expression_t *parse_wide_character_constant(void)
6175 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6176 literal->base.source_position = token.source_position;
6177 literal->base.type = type_int;
6178 literal->literal.value = token.literal;
6180 size_t len = wstrlen(&literal->literal.value);
6182 warningf(HERE, "multi-character character constant");
6189 static entity_t *create_implicit_function(symbol_t *symbol,
6190 const source_position_t *source_position)
6192 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6193 ntype->function.return_type = type_int;
6194 ntype->function.unspecified_parameters = true;
6195 ntype->function.linkage = LINKAGE_C;
6196 type_t *type = identify_new_type(ntype);
6198 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6199 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6200 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6201 entity->declaration.type = type;
6202 entity->declaration.implicit = true;
6203 entity->base.source_position = *source_position;
6205 if (current_scope != NULL) {
6206 bool strict_prototypes_old = warning.strict_prototypes;
6207 warning.strict_prototypes = false;
6208 record_entity(entity, false);
6209 warning.strict_prototypes = strict_prototypes_old;
6216 * Performs automatic type cast as described in §6.3.2.1.
6218 * @param orig_type the original type
6220 static type_t *automatic_type_conversion(type_t *orig_type)
6222 type_t *type = skip_typeref(orig_type);
6223 if (is_type_array(type)) {
6224 array_type_t *array_type = &type->array;
6225 type_t *element_type = array_type->element_type;
6226 unsigned qualifiers = array_type->base.qualifiers;
6228 return make_pointer_type(element_type, qualifiers);
6231 if (is_type_function(type)) {
6232 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6239 * reverts the automatic casts of array to pointer types and function
6240 * to function-pointer types as defined §6.3.2.1
6242 type_t *revert_automatic_type_conversion(const expression_t *expression)
6244 switch (expression->kind) {
6245 case EXPR_REFERENCE: {
6246 entity_t *entity = expression->reference.entity;
6247 if (is_declaration(entity)) {
6248 return entity->declaration.type;
6249 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6250 return entity->enum_value.enum_type;
6252 panic("no declaration or enum in reference");
6257 entity_t *entity = expression->select.compound_entry;
6258 assert(is_declaration(entity));
6259 type_t *type = entity->declaration.type;
6260 return get_qualified_type(type,
6261 expression->base.type->base.qualifiers);
6264 case EXPR_UNARY_DEREFERENCE: {
6265 const expression_t *const value = expression->unary.value;
6266 type_t *const type = skip_typeref(value->base.type);
6267 if (!is_type_pointer(type))
6268 return type_error_type;
6269 return type->pointer.points_to;
6272 case EXPR_ARRAY_ACCESS: {
6273 const expression_t *array_ref = expression->array_access.array_ref;
6274 type_t *type_left = skip_typeref(array_ref->base.type);
6275 if (!is_type_pointer(type_left))
6276 return type_error_type;
6277 return type_left->pointer.points_to;
6280 case EXPR_STRING_LITERAL: {
6281 size_t size = expression->string_literal.value.size;
6282 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6285 case EXPR_WIDE_STRING_LITERAL: {
6286 size_t size = wstrlen(&expression->string_literal.value);
6287 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6290 case EXPR_COMPOUND_LITERAL:
6291 return expression->compound_literal.type;
6296 return expression->base.type;
6300 * Find an entity matching a symbol in a scope.
6301 * Uses current scope if scope is NULL
6303 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6304 namespace_tag_t namespc)
6306 if (scope == NULL) {
6307 return get_entity(symbol, namespc);
6310 /* we should optimize here, if scope grows above a certain size we should
6311 construct a hashmap here... */
6312 entity_t *entity = scope->entities;
6313 for ( ; entity != NULL; entity = entity->base.next) {
6314 if (entity->base.symbol == symbol
6315 && (namespace_tag_t)entity->base.namespc == namespc)
6322 static entity_t *parse_qualified_identifier(void)
6324 /* namespace containing the symbol */
6326 source_position_t pos;
6327 const scope_t *lookup_scope = NULL;
6329 if (next_if(T_COLONCOLON))
6330 lookup_scope = &unit->scope;
6334 if (token.type != T_IDENTIFIER) {
6335 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6336 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6338 symbol = token.symbol;
6343 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6345 if (!next_if(T_COLONCOLON))
6348 switch (entity->kind) {
6349 case ENTITY_NAMESPACE:
6350 lookup_scope = &entity->namespacee.members;
6355 lookup_scope = &entity->compound.members;
6358 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6359 symbol, get_entity_kind_name(entity->kind));
6364 if (entity == NULL) {
6365 if (!strict_mode && token.type == '(') {
6366 /* an implicitly declared function */
6367 if (warning.error_implicit_function_declaration) {
6368 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6369 } else if (warning.implicit_function_declaration) {
6370 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6373 entity = create_implicit_function(symbol, &pos);
6375 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6376 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6383 /* skip further qualifications */
6384 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6386 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6389 static expression_t *parse_reference(void)
6391 source_position_t const pos = token.source_position;
6392 entity_t *const entity = parse_qualified_identifier();
6395 if (is_declaration(entity)) {
6396 orig_type = entity->declaration.type;
6397 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6398 orig_type = entity->enum_value.enum_type;
6400 panic("expected declaration or enum value in reference");
6403 /* we always do the auto-type conversions; the & and sizeof parser contains
6404 * code to revert this! */
6405 type_t *type = automatic_type_conversion(orig_type);
6407 expression_kind_t kind = EXPR_REFERENCE;
6408 if (entity->kind == ENTITY_ENUM_VALUE)
6409 kind = EXPR_REFERENCE_ENUM_VALUE;
6411 expression_t *expression = allocate_expression_zero(kind);
6412 expression->base.source_position = pos;
6413 expression->base.type = type;
6414 expression->reference.entity = entity;
6416 /* this declaration is used */
6417 if (is_declaration(entity)) {
6418 entity->declaration.used = true;
6421 if (entity->base.parent_scope != file_scope
6422 && (current_function != NULL
6423 && entity->base.parent_scope->depth < current_function->parameters.depth)
6424 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6425 if (entity->kind == ENTITY_VARIABLE) {
6426 /* access of a variable from an outer function */
6427 entity->variable.address_taken = true;
6428 } else if (entity->kind == ENTITY_PARAMETER) {
6429 entity->parameter.address_taken = true;
6431 current_function->need_closure = true;
6434 check_deprecated(&pos, entity);
6436 if (warning.init_self && entity == current_init_decl && !in_type_prop
6437 && entity->kind == ENTITY_VARIABLE) {
6438 current_init_decl = NULL;
6439 warningf(&pos, "variable '%#T' is initialized by itself",
6440 entity->declaration.type, entity->base.symbol);
6446 static bool semantic_cast(expression_t *cast)
6448 expression_t *expression = cast->unary.value;
6449 type_t *orig_dest_type = cast->base.type;
6450 type_t *orig_type_right = expression->base.type;
6451 type_t const *dst_type = skip_typeref(orig_dest_type);
6452 type_t const *src_type = skip_typeref(orig_type_right);
6453 source_position_t const *pos = &cast->base.source_position;
6455 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6456 if (dst_type == type_void)
6459 /* only integer and pointer can be casted to pointer */
6460 if (is_type_pointer(dst_type) &&
6461 !is_type_pointer(src_type) &&
6462 !is_type_integer(src_type) &&
6463 is_type_valid(src_type)) {
6464 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6468 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6469 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6473 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6474 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6478 if (warning.cast_qual &&
6479 is_type_pointer(src_type) &&
6480 is_type_pointer(dst_type)) {
6481 type_t *src = skip_typeref(src_type->pointer.points_to);
6482 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6483 unsigned missing_qualifiers =
6484 src->base.qualifiers & ~dst->base.qualifiers;
6485 if (missing_qualifiers != 0) {
6487 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6488 missing_qualifiers, orig_type_right);
6494 static expression_t *parse_compound_literal(type_t *type)
6496 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6498 parse_initializer_env_t env;
6501 env.must_be_constant = false;
6502 initializer_t *initializer = parse_initializer(&env);
6505 expression->compound_literal.initializer = initializer;
6506 expression->compound_literal.type = type;
6507 expression->base.type = automatic_type_conversion(type);
6513 * Parse a cast expression.
6515 static expression_t *parse_cast(void)
6517 source_position_t source_position = token.source_position;
6520 add_anchor_token(')');
6522 type_t *type = parse_typename();
6524 rem_anchor_token(')');
6525 expect(')', end_error);
6527 if (token.type == '{') {
6528 return parse_compound_literal(type);
6531 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6532 cast->base.source_position = source_position;
6534 expression_t *value = parse_subexpression(PREC_CAST);
6535 cast->base.type = type;
6536 cast->unary.value = value;
6538 if (! semantic_cast(cast)) {
6539 /* TODO: record the error in the AST. else it is impossible to detect it */
6544 return create_invalid_expression();
6548 * Parse a statement expression.
6550 static expression_t *parse_statement_expression(void)
6552 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6555 add_anchor_token(')');
6557 statement_t *statement = parse_compound_statement(true);
6558 statement->compound.stmt_expr = true;
6559 expression->statement.statement = statement;
6561 /* find last statement and use its type */
6562 type_t *type = type_void;
6563 const statement_t *stmt = statement->compound.statements;
6565 while (stmt->base.next != NULL)
6566 stmt = stmt->base.next;
6568 if (stmt->kind == STATEMENT_EXPRESSION) {
6569 type = stmt->expression.expression->base.type;
6571 } else if (warning.other) {
6572 warningf(&expression->base.source_position, "empty statement expression ({})");
6574 expression->base.type = type;
6576 rem_anchor_token(')');
6577 expect(')', end_error);
6584 * Parse a parenthesized expression.
6586 static expression_t *parse_parenthesized_expression(void)
6588 token_t const* const la1 = look_ahead(1);
6589 switch (la1->type) {
6591 /* gcc extension: a statement expression */
6592 return parse_statement_expression();
6595 if (is_typedef_symbol(la1->symbol)) {
6597 return parse_cast();
6602 add_anchor_token(')');
6603 expression_t *result = parse_expression();
6604 result->base.parenthesized = true;
6605 rem_anchor_token(')');
6606 expect(')', end_error);
6612 static expression_t *parse_function_keyword(void)
6616 if (current_function == NULL) {
6617 errorf(HERE, "'__func__' used outside of a function");
6620 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6621 expression->base.type = type_char_ptr;
6622 expression->funcname.kind = FUNCNAME_FUNCTION;
6629 static expression_t *parse_pretty_function_keyword(void)
6631 if (current_function == NULL) {
6632 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6635 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6636 expression->base.type = type_char_ptr;
6637 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6639 eat(T___PRETTY_FUNCTION__);
6644 static expression_t *parse_funcsig_keyword(void)
6646 if (current_function == NULL) {
6647 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6650 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6651 expression->base.type = type_char_ptr;
6652 expression->funcname.kind = FUNCNAME_FUNCSIG;
6659 static expression_t *parse_funcdname_keyword(void)
6661 if (current_function == NULL) {
6662 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6665 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6666 expression->base.type = type_char_ptr;
6667 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6669 eat(T___FUNCDNAME__);
6674 static designator_t *parse_designator(void)
6676 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6677 result->source_position = *HERE;
6679 if (token.type != T_IDENTIFIER) {
6680 parse_error_expected("while parsing member designator",
6681 T_IDENTIFIER, NULL);
6684 result->symbol = token.symbol;
6687 designator_t *last_designator = result;
6690 if (token.type != T_IDENTIFIER) {
6691 parse_error_expected("while parsing member designator",
6692 T_IDENTIFIER, NULL);
6695 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6696 designator->source_position = *HERE;
6697 designator->symbol = token.symbol;
6700 last_designator->next = designator;
6701 last_designator = designator;
6705 add_anchor_token(']');
6706 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6707 designator->source_position = *HERE;
6708 designator->array_index = parse_expression();
6709 rem_anchor_token(']');
6710 expect(']', end_error);
6711 if (designator->array_index == NULL) {
6715 last_designator->next = designator;
6716 last_designator = designator;
6728 * Parse the __builtin_offsetof() expression.
6730 static expression_t *parse_offsetof(void)
6732 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6733 expression->base.type = type_size_t;
6735 eat(T___builtin_offsetof);
6737 expect('(', end_error);
6738 add_anchor_token(',');
6739 type_t *type = parse_typename();
6740 rem_anchor_token(',');
6741 expect(',', end_error);
6742 add_anchor_token(')');
6743 designator_t *designator = parse_designator();
6744 rem_anchor_token(')');
6745 expect(')', end_error);
6747 expression->offsetofe.type = type;
6748 expression->offsetofe.designator = designator;
6751 memset(&path, 0, sizeof(path));
6752 path.top_type = type;
6753 path.path = NEW_ARR_F(type_path_entry_t, 0);
6755 descend_into_subtype(&path);
6757 if (!walk_designator(&path, designator, true)) {
6758 return create_invalid_expression();
6761 DEL_ARR_F(path.path);
6765 return create_invalid_expression();
6769 * Parses a _builtin_va_start() expression.
6771 static expression_t *parse_va_start(void)
6773 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6775 eat(T___builtin_va_start);
6777 expect('(', end_error);
6778 add_anchor_token(',');
6779 expression->va_starte.ap = parse_assignment_expression();
6780 rem_anchor_token(',');
6781 expect(',', end_error);
6782 expression_t *const expr = parse_assignment_expression();
6783 if (expr->kind == EXPR_REFERENCE) {
6784 entity_t *const entity = expr->reference.entity;
6785 if (!current_function->base.type->function.variadic) {
6786 errorf(&expr->base.source_position,
6787 "'va_start' used in non-variadic function");
6788 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6789 entity->base.next != NULL ||
6790 entity->kind != ENTITY_PARAMETER) {
6791 errorf(&expr->base.source_position,
6792 "second argument of 'va_start' must be last parameter of the current function");
6794 expression->va_starte.parameter = &entity->variable;
6796 expect(')', end_error);
6799 expect(')', end_error);
6801 return create_invalid_expression();
6805 * Parses a __builtin_va_arg() expression.
6807 static expression_t *parse_va_arg(void)
6809 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6811 eat(T___builtin_va_arg);
6813 expect('(', end_error);
6815 ap.expression = parse_assignment_expression();
6816 expression->va_arge.ap = ap.expression;
6817 check_call_argument(type_valist, &ap, 1);
6819 expect(',', end_error);
6820 expression->base.type = parse_typename();
6821 expect(')', end_error);
6825 return create_invalid_expression();
6829 * Parses a __builtin_va_copy() expression.
6831 static expression_t *parse_va_copy(void)
6833 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6835 eat(T___builtin_va_copy);
6837 expect('(', end_error);
6838 expression_t *dst = parse_assignment_expression();
6839 assign_error_t error = semantic_assign(type_valist, dst);
6840 report_assign_error(error, type_valist, dst, "call argument 1",
6841 &dst->base.source_position);
6842 expression->va_copye.dst = dst;
6844 expect(',', end_error);
6846 call_argument_t src;
6847 src.expression = parse_assignment_expression();
6848 check_call_argument(type_valist, &src, 2);
6849 expression->va_copye.src = src.expression;
6850 expect(')', end_error);
6854 return create_invalid_expression();
6858 * Parses a __builtin_constant_p() expression.
6860 static expression_t *parse_builtin_constant(void)
6862 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6864 eat(T___builtin_constant_p);
6866 expect('(', end_error);
6867 add_anchor_token(')');
6868 expression->builtin_constant.value = parse_assignment_expression();
6869 rem_anchor_token(')');
6870 expect(')', end_error);
6871 expression->base.type = type_int;
6875 return create_invalid_expression();
6879 * Parses a __builtin_types_compatible_p() expression.
6881 static expression_t *parse_builtin_types_compatible(void)
6883 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6885 eat(T___builtin_types_compatible_p);
6887 expect('(', end_error);
6888 add_anchor_token(')');
6889 add_anchor_token(',');
6890 expression->builtin_types_compatible.left = parse_typename();
6891 rem_anchor_token(',');
6892 expect(',', end_error);
6893 expression->builtin_types_compatible.right = parse_typename();
6894 rem_anchor_token(')');
6895 expect(')', end_error);
6896 expression->base.type = type_int;
6900 return create_invalid_expression();
6904 * Parses a __builtin_is_*() compare expression.
6906 static expression_t *parse_compare_builtin(void)
6908 expression_t *expression;
6910 switch (token.type) {
6911 case T___builtin_isgreater:
6912 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6914 case T___builtin_isgreaterequal:
6915 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6917 case T___builtin_isless:
6918 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6920 case T___builtin_islessequal:
6921 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6923 case T___builtin_islessgreater:
6924 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6926 case T___builtin_isunordered:
6927 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6930 internal_errorf(HERE, "invalid compare builtin found");
6932 expression->base.source_position = *HERE;
6935 expect('(', end_error);
6936 expression->binary.left = parse_assignment_expression();
6937 expect(',', end_error);
6938 expression->binary.right = parse_assignment_expression();
6939 expect(')', end_error);
6941 type_t *const orig_type_left = expression->binary.left->base.type;
6942 type_t *const orig_type_right = expression->binary.right->base.type;
6944 type_t *const type_left = skip_typeref(orig_type_left);
6945 type_t *const type_right = skip_typeref(orig_type_right);
6946 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6947 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6948 type_error_incompatible("invalid operands in comparison",
6949 &expression->base.source_position, orig_type_left, orig_type_right);
6952 semantic_comparison(&expression->binary);
6957 return create_invalid_expression();
6961 * Parses a MS assume() expression.
6963 static expression_t *parse_assume(void)
6965 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6969 expect('(', end_error);
6970 add_anchor_token(')');
6971 expression->unary.value = parse_assignment_expression();
6972 rem_anchor_token(')');
6973 expect(')', end_error);
6975 expression->base.type = type_void;
6978 return create_invalid_expression();
6982 * Return the label for the current symbol or create a new one.
6984 static label_t *get_label(void)
6986 assert(token.type == T_IDENTIFIER);
6987 assert(current_function != NULL);
6989 entity_t *label = get_entity(token.symbol, NAMESPACE_LABEL);
6990 /* If we find a local label, we already created the declaration. */
6991 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6992 if (label->base.parent_scope != current_scope) {
6993 assert(label->base.parent_scope->depth < current_scope->depth);
6994 current_function->goto_to_outer = true;
6996 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6997 /* There is no matching label in the same function, so create a new one. */
6998 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.symbol);
7003 return &label->label;
7007 * Parses a GNU && label address expression.
7009 static expression_t *parse_label_address(void)
7011 source_position_t source_position = token.source_position;
7013 if (token.type != T_IDENTIFIER) {
7014 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7015 return create_invalid_expression();
7018 label_t *const label = get_label();
7020 label->address_taken = true;
7022 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7023 expression->base.source_position = source_position;
7025 /* label address is treated as a void pointer */
7026 expression->base.type = type_void_ptr;
7027 expression->label_address.label = label;
7032 * Parse a microsoft __noop expression.
7034 static expression_t *parse_noop_expression(void)
7036 /* the result is a (int)0 */
7037 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7038 literal->base.type = type_int;
7039 literal->base.source_position = token.source_position;
7040 literal->literal.value.begin = "__noop";
7041 literal->literal.value.size = 6;
7045 if (token.type == '(') {
7046 /* parse arguments */
7048 add_anchor_token(')');
7049 add_anchor_token(',');
7051 if (token.type != ')') do {
7052 (void)parse_assignment_expression();
7053 } while (next_if(','));
7055 rem_anchor_token(',');
7056 rem_anchor_token(')');
7057 expect(')', end_error);
7064 * Parses a primary expression.
7066 static expression_t *parse_primary_expression(void)
7068 switch (token.type) {
7069 case T_false: return parse_boolean_literal(false);
7070 case T_true: return parse_boolean_literal(true);
7072 case T_INTEGER_OCTAL:
7073 case T_INTEGER_HEXADECIMAL:
7074 case T_FLOATINGPOINT:
7075 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7076 case T_CHARACTER_CONSTANT: return parse_character_constant();
7077 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7078 case T_STRING_LITERAL:
7079 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7080 case T___FUNCTION__:
7081 case T___func__: return parse_function_keyword();
7082 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7083 case T___FUNCSIG__: return parse_funcsig_keyword();
7084 case T___FUNCDNAME__: return parse_funcdname_keyword();
7085 case T___builtin_offsetof: return parse_offsetof();
7086 case T___builtin_va_start: return parse_va_start();
7087 case T___builtin_va_arg: return parse_va_arg();
7088 case T___builtin_va_copy: return parse_va_copy();
7089 case T___builtin_isgreater:
7090 case T___builtin_isgreaterequal:
7091 case T___builtin_isless:
7092 case T___builtin_islessequal:
7093 case T___builtin_islessgreater:
7094 case T___builtin_isunordered: return parse_compare_builtin();
7095 case T___builtin_constant_p: return parse_builtin_constant();
7096 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7097 case T__assume: return parse_assume();
7100 return parse_label_address();
7103 case '(': return parse_parenthesized_expression();
7104 case T___noop: return parse_noop_expression();
7106 /* Gracefully handle type names while parsing expressions. */
7108 return parse_reference();
7110 if (!is_typedef_symbol(token.symbol)) {
7111 return parse_reference();
7115 source_position_t const pos = *HERE;
7116 declaration_specifiers_t specifiers;
7117 parse_declaration_specifiers(&specifiers);
7118 type_t const *const type = parse_abstract_declarator(specifiers.type);
7119 errorf(&pos, "encountered type '%T' while parsing expression", type);
7120 return create_invalid_expression();
7124 errorf(HERE, "unexpected token %K, expected an expression", &token);
7126 return create_invalid_expression();
7129 static expression_t *parse_array_expression(expression_t *left)
7131 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7132 array_access_expression_t *const arr = &expr->array_access;
7135 add_anchor_token(']');
7137 expression_t *const inside = parse_expression();
7139 type_t *const orig_type_left = left->base.type;
7140 type_t *const orig_type_inside = inside->base.type;
7142 type_t *const type_left = skip_typeref(orig_type_left);
7143 type_t *const type_inside = skip_typeref(orig_type_inside);
7149 if (is_type_pointer(type_left)) {
7152 idx_type = type_inside;
7153 res_type = type_left->pointer.points_to;
7155 } else if (is_type_pointer(type_inside)) {
7156 arr->flipped = true;
7159 idx_type = type_left;
7160 res_type = type_inside->pointer.points_to;
7162 res_type = automatic_type_conversion(res_type);
7163 if (!is_type_integer(idx_type)) {
7164 errorf(&idx->base.source_position, "array subscript must have integer type");
7165 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR) && warning.char_subscripts) {
7166 warningf(&idx->base.source_position, "array subscript has char type");
7169 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7170 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
7172 res_type = type_error_type;
7177 arr->array_ref = ref;
7179 arr->base.type = res_type;
7181 rem_anchor_token(']');
7182 expect(']', end_error);
7187 static expression_t *parse_typeprop(expression_kind_t const kind)
7189 expression_t *tp_expression = allocate_expression_zero(kind);
7190 tp_expression->base.type = type_size_t;
7192 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7194 /* we only refer to a type property, mark this case */
7195 bool old = in_type_prop;
7196 in_type_prop = true;
7199 expression_t *expression;
7200 if (token.type == '(' && is_declaration_specifier(look_ahead(1))) {
7202 add_anchor_token(')');
7203 orig_type = parse_typename();
7204 rem_anchor_token(')');
7205 expect(')', end_error);
7207 if (token.type == '{') {
7208 /* It was not sizeof(type) after all. It is sizeof of an expression
7209 * starting with a compound literal */
7210 expression = parse_compound_literal(orig_type);
7211 goto typeprop_expression;
7214 expression = parse_subexpression(PREC_UNARY);
7216 typeprop_expression:
7217 tp_expression->typeprop.tp_expression = expression;
7219 orig_type = revert_automatic_type_conversion(expression);
7220 expression->base.type = orig_type;
7223 tp_expression->typeprop.type = orig_type;
7224 type_t const* const type = skip_typeref(orig_type);
7225 char const* wrong_type = NULL;
7226 if (is_type_incomplete(type)) {
7227 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7228 wrong_type = "incomplete";
7229 } else if (type->kind == TYPE_FUNCTION) {
7231 /* function types are allowed (and return 1) */
7232 if (warning.other) {
7233 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7234 warningf(&tp_expression->base.source_position,
7235 "%s expression with function argument returns invalid result", what);
7238 wrong_type = "function";
7241 if (is_type_incomplete(type))
7242 wrong_type = "incomplete";
7244 if (type->kind == TYPE_BITFIELD)
7245 wrong_type = "bitfield";
7247 if (wrong_type != NULL) {
7248 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7249 errorf(&tp_expression->base.source_position,
7250 "operand of %s expression must not be of %s type '%T'",
7251 what, wrong_type, orig_type);
7256 return tp_expression;
7259 static expression_t *parse_sizeof(void)
7261 return parse_typeprop(EXPR_SIZEOF);
7264 static expression_t *parse_alignof(void)
7266 return parse_typeprop(EXPR_ALIGNOF);
7269 static expression_t *parse_select_expression(expression_t *addr)
7271 assert(token.type == '.' || token.type == T_MINUSGREATER);
7272 bool select_left_arrow = (token.type == T_MINUSGREATER);
7273 source_position_t const pos = *HERE;
7276 if (token.type != T_IDENTIFIER) {
7277 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7278 return create_invalid_expression();
7280 symbol_t *symbol = token.symbol;
7283 type_t *const orig_type = addr->base.type;
7284 type_t *const type = skip_typeref(orig_type);
7287 bool saw_error = false;
7288 if (is_type_pointer(type)) {
7289 if (!select_left_arrow) {
7291 "request for member '%Y' in something not a struct or union, but '%T'",
7295 type_left = skip_typeref(type->pointer.points_to);
7297 if (select_left_arrow && is_type_valid(type)) {
7298 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7304 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7305 type_left->kind != TYPE_COMPOUND_UNION) {
7307 if (is_type_valid(type_left) && !saw_error) {
7309 "request for member '%Y' in something not a struct or union, but '%T'",
7312 return create_invalid_expression();
7315 compound_t *compound = type_left->compound.compound;
7316 if (!compound->complete) {
7317 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7319 return create_invalid_expression();
7322 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7323 expression_t *result =
7324 find_create_select(&pos, addr, qualifiers, compound, symbol);
7326 if (result == NULL) {
7327 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7328 return create_invalid_expression();
7334 static void check_call_argument(type_t *expected_type,
7335 call_argument_t *argument, unsigned pos)
7337 type_t *expected_type_skip = skip_typeref(expected_type);
7338 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7339 expression_t *arg_expr = argument->expression;
7340 type_t *arg_type = skip_typeref(arg_expr->base.type);
7342 /* handle transparent union gnu extension */
7343 if (is_type_union(expected_type_skip)
7344 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7345 compound_t *union_decl = expected_type_skip->compound.compound;
7346 type_t *best_type = NULL;
7347 entity_t *entry = union_decl->members.entities;
7348 for ( ; entry != NULL; entry = entry->base.next) {
7349 assert(is_declaration(entry));
7350 type_t *decl_type = entry->declaration.type;
7351 error = semantic_assign(decl_type, arg_expr);
7352 if (error == ASSIGN_ERROR_INCOMPATIBLE
7353 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7356 if (error == ASSIGN_SUCCESS) {
7357 best_type = decl_type;
7358 } else if (best_type == NULL) {
7359 best_type = decl_type;
7363 if (best_type != NULL) {
7364 expected_type = best_type;
7368 error = semantic_assign(expected_type, arg_expr);
7369 argument->expression = create_implicit_cast(arg_expr, expected_type);
7371 if (error != ASSIGN_SUCCESS) {
7372 /* report exact scope in error messages (like "in argument 3") */
7374 snprintf(buf, sizeof(buf), "call argument %u", pos);
7375 report_assign_error(error, expected_type, arg_expr, buf,
7376 &arg_expr->base.source_position);
7377 } else if (warning.traditional || warning.conversion) {
7378 type_t *const promoted_type = get_default_promoted_type(arg_type);
7379 if (!types_compatible(expected_type_skip, promoted_type) &&
7380 !types_compatible(expected_type_skip, type_void_ptr) &&
7381 !types_compatible(type_void_ptr, promoted_type)) {
7382 /* Deliberately show the skipped types in this warning */
7383 warningf(&arg_expr->base.source_position,
7384 "passing call argument %u as '%T' rather than '%T' due to prototype",
7385 pos, expected_type_skip, promoted_type);
7391 * Handle the semantic restrictions of builtin calls
7393 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7394 switch (call->function->reference.entity->function.btk) {
7395 case bk_gnu_builtin_return_address:
7396 case bk_gnu_builtin_frame_address: {
7397 /* argument must be constant */
7398 call_argument_t *argument = call->arguments;
7400 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7401 errorf(&call->base.source_position,
7402 "argument of '%Y' must be a constant expression",
7403 call->function->reference.entity->base.symbol);
7407 case bk_gnu_builtin_object_size:
7408 if (call->arguments == NULL)
7411 call_argument_t *arg = call->arguments->next;
7412 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7413 errorf(&call->base.source_position,
7414 "second argument of '%Y' must be a constant expression",
7415 call->function->reference.entity->base.symbol);
7418 case bk_gnu_builtin_prefetch:
7419 /* second and third argument must be constant if existent */
7420 if (call->arguments == NULL)
7422 call_argument_t *rw = call->arguments->next;
7423 call_argument_t *locality = NULL;
7426 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7427 errorf(&call->base.source_position,
7428 "second argument of '%Y' must be a constant expression",
7429 call->function->reference.entity->base.symbol);
7431 locality = rw->next;
7433 if (locality != NULL) {
7434 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7435 errorf(&call->base.source_position,
7436 "third argument of '%Y' must be a constant expression",
7437 call->function->reference.entity->base.symbol);
7439 locality = rw->next;
7448 * Parse a call expression, ie. expression '( ... )'.
7450 * @param expression the function address
7452 static expression_t *parse_call_expression(expression_t *expression)
7454 expression_t *result = allocate_expression_zero(EXPR_CALL);
7455 call_expression_t *call = &result->call;
7456 call->function = expression;
7458 type_t *const orig_type = expression->base.type;
7459 type_t *const type = skip_typeref(orig_type);
7461 function_type_t *function_type = NULL;
7462 if (is_type_pointer(type)) {
7463 type_t *const to_type = skip_typeref(type->pointer.points_to);
7465 if (is_type_function(to_type)) {
7466 function_type = &to_type->function;
7467 call->base.type = function_type->return_type;
7471 if (function_type == NULL && is_type_valid(type)) {
7473 "called object '%E' (type '%T') is not a pointer to a function",
7474 expression, orig_type);
7477 /* parse arguments */
7479 add_anchor_token(')');
7480 add_anchor_token(',');
7482 if (token.type != ')') {
7483 call_argument_t **anchor = &call->arguments;
7485 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7486 argument->expression = parse_assignment_expression();
7489 anchor = &argument->next;
7490 } while (next_if(','));
7492 rem_anchor_token(',');
7493 rem_anchor_token(')');
7494 expect(')', end_error);
7496 if (function_type == NULL)
7499 /* check type and count of call arguments */
7500 function_parameter_t *parameter = function_type->parameters;
7501 call_argument_t *argument = call->arguments;
7502 if (!function_type->unspecified_parameters) {
7503 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7504 parameter = parameter->next, argument = argument->next) {
7505 check_call_argument(parameter->type, argument, ++pos);
7508 if (parameter != NULL) {
7509 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7510 } else if (argument != NULL && !function_type->variadic) {
7511 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7515 /* do default promotion for other arguments */
7516 for (; argument != NULL; argument = argument->next) {
7517 type_t *argument_type = argument->expression->base.type;
7518 if (!is_type_object(skip_typeref(argument_type))) {
7519 errorf(&argument->expression->base.source_position,
7520 "call argument '%E' must not be void", argument->expression);
7523 argument_type = get_default_promoted_type(argument_type);
7525 argument->expression
7526 = create_implicit_cast(argument->expression, argument_type);
7531 if (warning.aggregate_return &&
7532 is_type_compound(skip_typeref(function_type->return_type))) {
7533 warningf(&expression->base.source_position,
7534 "function call has aggregate value");
7537 if (expression->kind == EXPR_REFERENCE) {
7538 reference_expression_t *reference = &expression->reference;
7539 if (reference->entity->kind == ENTITY_FUNCTION &&
7540 reference->entity->function.btk != bk_none)
7541 handle_builtin_argument_restrictions(call);
7548 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7550 static bool same_compound_type(const type_t *type1, const type_t *type2)
7553 is_type_compound(type1) &&
7554 type1->kind == type2->kind &&
7555 type1->compound.compound == type2->compound.compound;
7558 static expression_t const *get_reference_address(expression_t const *expr)
7560 bool regular_take_address = true;
7562 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7563 expr = expr->unary.value;
7565 regular_take_address = false;
7568 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7571 expr = expr->unary.value;
7574 if (expr->kind != EXPR_REFERENCE)
7577 /* special case for functions which are automatically converted to a
7578 * pointer to function without an extra TAKE_ADDRESS operation */
7579 if (!regular_take_address &&
7580 expr->reference.entity->kind != ENTITY_FUNCTION) {
7587 static void warn_reference_address_as_bool(expression_t const* expr)
7589 if (!warning.address)
7592 expr = get_reference_address(expr);
7594 warningf(&expr->base.source_position,
7595 "the address of '%Y' will always evaluate as 'true'",
7596 expr->reference.entity->base.symbol);
7600 static void warn_assignment_in_condition(const expression_t *const expr)
7602 if (!warning.parentheses)
7604 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7606 if (expr->base.parenthesized)
7608 warningf(&expr->base.source_position,
7609 "suggest parentheses around assignment used as truth value");
7612 static void semantic_condition(expression_t const *const expr,
7613 char const *const context)
7615 type_t *const type = skip_typeref(expr->base.type);
7616 if (is_type_scalar(type)) {
7617 warn_reference_address_as_bool(expr);
7618 warn_assignment_in_condition(expr);
7619 } else if (is_type_valid(type)) {
7620 errorf(&expr->base.source_position,
7621 "%s must have scalar type", context);
7626 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7628 * @param expression the conditional expression
7630 static expression_t *parse_conditional_expression(expression_t *expression)
7632 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7634 conditional_expression_t *conditional = &result->conditional;
7635 conditional->condition = expression;
7638 add_anchor_token(':');
7640 /* §6.5.15:2 The first operand shall have scalar type. */
7641 semantic_condition(expression, "condition of conditional operator");
7643 expression_t *true_expression = expression;
7644 bool gnu_cond = false;
7645 if (GNU_MODE && token.type == ':') {
7648 true_expression = parse_expression();
7650 rem_anchor_token(':');
7651 expect(':', end_error);
7653 expression_t *false_expression =
7654 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7656 type_t *const orig_true_type = true_expression->base.type;
7657 type_t *const orig_false_type = false_expression->base.type;
7658 type_t *const true_type = skip_typeref(orig_true_type);
7659 type_t *const false_type = skip_typeref(orig_false_type);
7662 type_t *result_type;
7663 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7664 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7665 /* ISO/IEC 14882:1998(E) §5.16:2 */
7666 if (true_expression->kind == EXPR_UNARY_THROW) {
7667 result_type = false_type;
7668 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7669 result_type = true_type;
7671 if (warning.other && (
7672 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7673 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7675 warningf(&conditional->base.source_position,
7676 "ISO C forbids conditional expression with only one void side");
7678 result_type = type_void;
7680 } else if (is_type_arithmetic(true_type)
7681 && is_type_arithmetic(false_type)) {
7682 result_type = semantic_arithmetic(true_type, false_type);
7683 } else if (same_compound_type(true_type, false_type)) {
7684 /* just take 1 of the 2 types */
7685 result_type = true_type;
7686 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7687 type_t *pointer_type;
7689 expression_t *other_expression;
7690 if (is_type_pointer(true_type) &&
7691 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7692 pointer_type = true_type;
7693 other_type = false_type;
7694 other_expression = false_expression;
7696 pointer_type = false_type;
7697 other_type = true_type;
7698 other_expression = true_expression;
7701 if (is_null_pointer_constant(other_expression)) {
7702 result_type = pointer_type;
7703 } else if (is_type_pointer(other_type)) {
7704 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7705 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7708 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7709 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7711 } else if (types_compatible(get_unqualified_type(to1),
7712 get_unqualified_type(to2))) {
7715 if (warning.other) {
7716 warningf(&conditional->base.source_position,
7717 "pointer types '%T' and '%T' in conditional expression are incompatible",
7718 true_type, false_type);
7723 type_t *const type =
7724 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7725 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7726 } else if (is_type_integer(other_type)) {
7727 if (warning.other) {
7728 warningf(&conditional->base.source_position,
7729 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7731 result_type = pointer_type;
7733 if (is_type_valid(other_type)) {
7734 type_error_incompatible("while parsing conditional",
7735 &expression->base.source_position, true_type, false_type);
7737 result_type = type_error_type;
7740 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7741 type_error_incompatible("while parsing conditional",
7742 &conditional->base.source_position, true_type,
7745 result_type = type_error_type;
7748 conditional->true_expression
7749 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7750 conditional->false_expression
7751 = create_implicit_cast(false_expression, result_type);
7752 conditional->base.type = result_type;
7757 * Parse an extension expression.
7759 static expression_t *parse_extension(void)
7761 eat(T___extension__);
7763 bool old_gcc_extension = in_gcc_extension;
7764 in_gcc_extension = true;
7765 expression_t *expression = parse_subexpression(PREC_UNARY);
7766 in_gcc_extension = old_gcc_extension;
7771 * Parse a __builtin_classify_type() expression.
7773 static expression_t *parse_builtin_classify_type(void)
7775 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7776 result->base.type = type_int;
7778 eat(T___builtin_classify_type);
7780 expect('(', end_error);
7781 add_anchor_token(')');
7782 expression_t *expression = parse_expression();
7783 rem_anchor_token(')');
7784 expect(')', end_error);
7785 result->classify_type.type_expression = expression;
7789 return create_invalid_expression();
7793 * Parse a delete expression
7794 * ISO/IEC 14882:1998(E) §5.3.5
7796 static expression_t *parse_delete(void)
7798 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7799 result->base.type = type_void;
7804 result->kind = EXPR_UNARY_DELETE_ARRAY;
7805 expect(']', end_error);
7809 expression_t *const value = parse_subexpression(PREC_CAST);
7810 result->unary.value = value;
7812 type_t *const type = skip_typeref(value->base.type);
7813 if (!is_type_pointer(type)) {
7814 if (is_type_valid(type)) {
7815 errorf(&value->base.source_position,
7816 "operand of delete must have pointer type");
7818 } else if (warning.other &&
7819 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7820 warningf(&value->base.source_position,
7821 "deleting 'void*' is undefined");
7828 * Parse a throw expression
7829 * ISO/IEC 14882:1998(E) §15:1
7831 static expression_t *parse_throw(void)
7833 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7834 result->base.type = type_void;
7838 expression_t *value = NULL;
7839 switch (token.type) {
7841 value = parse_assignment_expression();
7842 /* ISO/IEC 14882:1998(E) §15.1:3 */
7843 type_t *const orig_type = value->base.type;
7844 type_t *const type = skip_typeref(orig_type);
7845 if (is_type_incomplete(type)) {
7846 errorf(&value->base.source_position,
7847 "cannot throw object of incomplete type '%T'", orig_type);
7848 } else if (is_type_pointer(type)) {
7849 type_t *const points_to = skip_typeref(type->pointer.points_to);
7850 if (is_type_incomplete(points_to) &&
7851 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7852 errorf(&value->base.source_position,
7853 "cannot throw pointer to incomplete type '%T'", orig_type);
7861 result->unary.value = value;
7866 static bool check_pointer_arithmetic(const source_position_t *source_position,
7867 type_t *pointer_type,
7868 type_t *orig_pointer_type)
7870 type_t *points_to = pointer_type->pointer.points_to;
7871 points_to = skip_typeref(points_to);
7873 if (is_type_incomplete(points_to)) {
7874 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7875 errorf(source_position,
7876 "arithmetic with pointer to incomplete type '%T' not allowed",
7879 } else if (warning.pointer_arith) {
7880 warningf(source_position,
7881 "pointer of type '%T' used in arithmetic",
7884 } else if (is_type_function(points_to)) {
7886 errorf(source_position,
7887 "arithmetic with pointer to function type '%T' not allowed",
7890 } else if (warning.pointer_arith) {
7891 warningf(source_position,
7892 "pointer to a function '%T' used in arithmetic",
7899 static bool is_lvalue(const expression_t *expression)
7901 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7902 switch (expression->kind) {
7903 case EXPR_ARRAY_ACCESS:
7904 case EXPR_COMPOUND_LITERAL:
7905 case EXPR_REFERENCE:
7907 case EXPR_UNARY_DEREFERENCE:
7911 type_t *type = skip_typeref(expression->base.type);
7913 /* ISO/IEC 14882:1998(E) §3.10:3 */
7914 is_type_reference(type) ||
7915 /* Claim it is an lvalue, if the type is invalid. There was a parse
7916 * error before, which maybe prevented properly recognizing it as
7918 !is_type_valid(type);
7923 static void semantic_incdec(unary_expression_t *expression)
7925 type_t *const orig_type = expression->value->base.type;
7926 type_t *const type = skip_typeref(orig_type);
7927 if (is_type_pointer(type)) {
7928 if (!check_pointer_arithmetic(&expression->base.source_position,
7932 } else if (!is_type_real(type) && is_type_valid(type)) {
7933 /* TODO: improve error message */
7934 errorf(&expression->base.source_position,
7935 "operation needs an arithmetic or pointer type");
7938 if (!is_lvalue(expression->value)) {
7939 /* TODO: improve error message */
7940 errorf(&expression->base.source_position, "lvalue required as operand");
7942 expression->base.type = orig_type;
7945 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7947 type_t *const orig_type = expression->value->base.type;
7948 type_t *const type = skip_typeref(orig_type);
7949 if (!is_type_arithmetic(type)) {
7950 if (is_type_valid(type)) {
7951 /* TODO: improve error message */
7952 errorf(&expression->base.source_position,
7953 "operation needs an arithmetic type");
7958 expression->base.type = orig_type;
7961 static void semantic_unexpr_plus(unary_expression_t *expression)
7963 semantic_unexpr_arithmetic(expression);
7964 if (warning.traditional)
7965 warningf(&expression->base.source_position,
7966 "traditional C rejects the unary plus operator");
7969 static void semantic_not(unary_expression_t *expression)
7971 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7972 semantic_condition(expression->value, "operand of !");
7973 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7976 static void semantic_unexpr_integer(unary_expression_t *expression)
7978 type_t *const orig_type = expression->value->base.type;
7979 type_t *const type = skip_typeref(orig_type);
7980 if (!is_type_integer(type)) {
7981 if (is_type_valid(type)) {
7982 errorf(&expression->base.source_position,
7983 "operand of ~ must be of integer type");
7988 expression->base.type = orig_type;
7991 static void semantic_dereference(unary_expression_t *expression)
7993 type_t *const orig_type = expression->value->base.type;
7994 type_t *const type = skip_typeref(orig_type);
7995 if (!is_type_pointer(type)) {
7996 if (is_type_valid(type)) {
7997 errorf(&expression->base.source_position,
7998 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8003 type_t *result_type = type->pointer.points_to;
8004 result_type = automatic_type_conversion(result_type);
8005 expression->base.type = result_type;
8009 * Record that an address is taken (expression represents an lvalue).
8011 * @param expression the expression
8012 * @param may_be_register if true, the expression might be an register
8014 static void set_address_taken(expression_t *expression, bool may_be_register)
8016 if (expression->kind != EXPR_REFERENCE)
8019 entity_t *const entity = expression->reference.entity;
8021 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8024 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8025 && !may_be_register) {
8026 errorf(&expression->base.source_position,
8027 "address of register %s '%Y' requested",
8028 get_entity_kind_name(entity->kind), entity->base.symbol);
8031 if (entity->kind == ENTITY_VARIABLE) {
8032 entity->variable.address_taken = true;
8034 assert(entity->kind == ENTITY_PARAMETER);
8035 entity->parameter.address_taken = true;
8040 * Check the semantic of the address taken expression.
8042 static void semantic_take_addr(unary_expression_t *expression)
8044 expression_t *value = expression->value;
8045 value->base.type = revert_automatic_type_conversion(value);
8047 type_t *orig_type = value->base.type;
8048 type_t *type = skip_typeref(orig_type);
8049 if (!is_type_valid(type))
8053 if (!is_lvalue(value)) {
8054 errorf(&expression->base.source_position, "'&' requires an lvalue");
8056 if (type->kind == TYPE_BITFIELD) {
8057 errorf(&expression->base.source_position,
8058 "'&' not allowed on object with bitfield type '%T'",
8062 set_address_taken(value, false);
8064 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8067 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8068 static expression_t *parse_##unexpression_type(void) \
8070 expression_t *unary_expression \
8071 = allocate_expression_zero(unexpression_type); \
8073 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8075 sfunc(&unary_expression->unary); \
8077 return unary_expression; \
8080 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8081 semantic_unexpr_arithmetic)
8082 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8083 semantic_unexpr_plus)
8084 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8086 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8087 semantic_dereference)
8088 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8090 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8091 semantic_unexpr_integer)
8092 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8094 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8097 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8099 static expression_t *parse_##unexpression_type(expression_t *left) \
8101 expression_t *unary_expression \
8102 = allocate_expression_zero(unexpression_type); \
8104 unary_expression->unary.value = left; \
8106 sfunc(&unary_expression->unary); \
8108 return unary_expression; \
8111 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8112 EXPR_UNARY_POSTFIX_INCREMENT,
8114 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8115 EXPR_UNARY_POSTFIX_DECREMENT,
8118 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8120 /* TODO: handle complex + imaginary types */
8122 type_left = get_unqualified_type(type_left);
8123 type_right = get_unqualified_type(type_right);
8125 /* §6.3.1.8 Usual arithmetic conversions */
8126 if (type_left == type_long_double || type_right == type_long_double) {
8127 return type_long_double;
8128 } else if (type_left == type_double || type_right == type_double) {
8130 } else if (type_left == type_float || type_right == type_float) {
8134 type_left = promote_integer(type_left);
8135 type_right = promote_integer(type_right);
8137 if (type_left == type_right)
8140 bool const signed_left = is_type_signed(type_left);
8141 bool const signed_right = is_type_signed(type_right);
8142 int const rank_left = get_rank(type_left);
8143 int const rank_right = get_rank(type_right);
8145 if (signed_left == signed_right)
8146 return rank_left >= rank_right ? type_left : type_right;
8155 u_rank = rank_right;
8156 u_type = type_right;
8158 s_rank = rank_right;
8159 s_type = type_right;
8164 if (u_rank >= s_rank)
8167 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8169 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8170 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8174 case ATOMIC_TYPE_INT: return type_unsigned_int;
8175 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8176 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8178 default: panic("invalid atomic type");
8183 * Check the semantic restrictions for a binary expression.
8185 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8187 expression_t *const left = expression->left;
8188 expression_t *const right = expression->right;
8189 type_t *const orig_type_left = left->base.type;
8190 type_t *const orig_type_right = right->base.type;
8191 type_t *const type_left = skip_typeref(orig_type_left);
8192 type_t *const type_right = skip_typeref(orig_type_right);
8194 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8195 /* TODO: improve error message */
8196 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8197 errorf(&expression->base.source_position,
8198 "operation needs arithmetic types");
8203 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8204 expression->left = create_implicit_cast(left, arithmetic_type);
8205 expression->right = create_implicit_cast(right, arithmetic_type);
8206 expression->base.type = arithmetic_type;
8209 static void semantic_binexpr_integer(binary_expression_t *const expression)
8211 expression_t *const left = expression->left;
8212 expression_t *const right = expression->right;
8213 type_t *const orig_type_left = left->base.type;
8214 type_t *const orig_type_right = right->base.type;
8215 type_t *const type_left = skip_typeref(orig_type_left);
8216 type_t *const type_right = skip_typeref(orig_type_right);
8218 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8219 /* TODO: improve error message */
8220 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8221 errorf(&expression->base.source_position,
8222 "operation needs integer types");
8227 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8228 expression->left = create_implicit_cast(left, result_type);
8229 expression->right = create_implicit_cast(right, result_type);
8230 expression->base.type = result_type;
8233 static void warn_div_by_zero(binary_expression_t const *const expression)
8235 if (!warning.div_by_zero ||
8236 !is_type_integer(expression->base.type))
8239 expression_t const *const right = expression->right;
8240 /* The type of the right operand can be different for /= */
8241 if (is_type_integer(right->base.type) &&
8242 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8243 !fold_constant_to_bool(right)) {
8244 warningf(&expression->base.source_position, "division by zero");
8249 * Check the semantic restrictions for a div/mod expression.
8251 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8253 semantic_binexpr_arithmetic(expression);
8254 warn_div_by_zero(expression);
8257 static void warn_addsub_in_shift(const expression_t *const expr)
8259 if (expr->base.parenthesized)
8263 switch (expr->kind) {
8264 case EXPR_BINARY_ADD: op = '+'; break;
8265 case EXPR_BINARY_SUB: op = '-'; break;
8269 warningf(&expr->base.source_position,
8270 "suggest parentheses around '%c' inside shift", op);
8273 static bool semantic_shift(binary_expression_t *expression)
8275 expression_t *const left = expression->left;
8276 expression_t *const right = expression->right;
8277 type_t *const orig_type_left = left->base.type;
8278 type_t *const orig_type_right = right->base.type;
8279 type_t * type_left = skip_typeref(orig_type_left);
8280 type_t * type_right = skip_typeref(orig_type_right);
8282 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8283 /* TODO: improve error message */
8284 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8285 errorf(&expression->base.source_position,
8286 "operands of shift operation must have integer types");
8291 type_left = promote_integer(type_left);
8293 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8294 long count = fold_constant_to_int(right);
8296 warningf(&right->base.source_position,
8297 "shift count must be non-negative");
8298 } else if ((unsigned long)count >=
8299 get_atomic_type_size(type_left->atomic.akind) * 8) {
8300 warningf(&right->base.source_position,
8301 "shift count must be less than type width");
8305 type_right = promote_integer(type_right);
8306 expression->right = create_implicit_cast(right, type_right);
8311 static void semantic_shift_op(binary_expression_t *expression)
8313 expression_t *const left = expression->left;
8314 expression_t *const right = expression->right;
8316 if (!semantic_shift(expression))
8319 if (warning.parentheses) {
8320 warn_addsub_in_shift(left);
8321 warn_addsub_in_shift(right);
8324 type_t *const orig_type_left = left->base.type;
8325 type_t * type_left = skip_typeref(orig_type_left);
8327 type_left = promote_integer(type_left);
8328 expression->left = create_implicit_cast(left, type_left);
8329 expression->base.type = type_left;
8332 static void semantic_add(binary_expression_t *expression)
8334 expression_t *const left = expression->left;
8335 expression_t *const right = expression->right;
8336 type_t *const orig_type_left = left->base.type;
8337 type_t *const orig_type_right = right->base.type;
8338 type_t *const type_left = skip_typeref(orig_type_left);
8339 type_t *const type_right = skip_typeref(orig_type_right);
8342 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8343 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8344 expression->left = create_implicit_cast(left, arithmetic_type);
8345 expression->right = create_implicit_cast(right, arithmetic_type);
8346 expression->base.type = arithmetic_type;
8347 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8348 check_pointer_arithmetic(&expression->base.source_position,
8349 type_left, orig_type_left);
8350 expression->base.type = type_left;
8351 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8352 check_pointer_arithmetic(&expression->base.source_position,
8353 type_right, orig_type_right);
8354 expression->base.type = type_right;
8355 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8356 errorf(&expression->base.source_position,
8357 "invalid operands to binary + ('%T', '%T')",
8358 orig_type_left, orig_type_right);
8362 static void semantic_sub(binary_expression_t *expression)
8364 expression_t *const left = expression->left;
8365 expression_t *const right = expression->right;
8366 type_t *const orig_type_left = left->base.type;
8367 type_t *const orig_type_right = right->base.type;
8368 type_t *const type_left = skip_typeref(orig_type_left);
8369 type_t *const type_right = skip_typeref(orig_type_right);
8370 source_position_t const *const pos = &expression->base.source_position;
8373 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8374 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8375 expression->left = create_implicit_cast(left, arithmetic_type);
8376 expression->right = create_implicit_cast(right, arithmetic_type);
8377 expression->base.type = arithmetic_type;
8378 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8379 check_pointer_arithmetic(&expression->base.source_position,
8380 type_left, orig_type_left);
8381 expression->base.type = type_left;
8382 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8383 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8384 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8385 if (!types_compatible(unqual_left, unqual_right)) {
8387 "subtracting pointers to incompatible types '%T' and '%T'",
8388 orig_type_left, orig_type_right);
8389 } else if (!is_type_object(unqual_left)) {
8390 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8391 errorf(pos, "subtracting pointers to non-object types '%T'",
8393 } else if (warning.other) {
8394 warningf(pos, "subtracting pointers to void");
8397 expression->base.type = type_ptrdiff_t;
8398 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8399 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8400 orig_type_left, orig_type_right);
8404 static void warn_string_literal_address(expression_t const* expr)
8406 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8407 expr = expr->unary.value;
8408 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8410 expr = expr->unary.value;
8413 if (expr->kind == EXPR_STRING_LITERAL
8414 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8415 warningf(&expr->base.source_position,
8416 "comparison with string literal results in unspecified behaviour");
8420 static void warn_comparison_in_comparison(const expression_t *const expr)
8422 if (expr->base.parenthesized)
8424 switch (expr->base.kind) {
8425 case EXPR_BINARY_LESS:
8426 case EXPR_BINARY_GREATER:
8427 case EXPR_BINARY_LESSEQUAL:
8428 case EXPR_BINARY_GREATEREQUAL:
8429 case EXPR_BINARY_NOTEQUAL:
8430 case EXPR_BINARY_EQUAL:
8431 warningf(&expr->base.source_position,
8432 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8439 static bool maybe_negative(expression_t const *const expr)
8441 switch (is_constant_expression(expr)) {
8442 case EXPR_CLASS_ERROR: return false;
8443 case EXPR_CLASS_CONSTANT: return fold_constant_to_int(expr) < 0;
8444 default: return true;
8449 * Check the semantics of comparison expressions.
8451 * @param expression The expression to check.
8453 static void semantic_comparison(binary_expression_t *expression)
8455 expression_t *left = expression->left;
8456 expression_t *right = expression->right;
8458 if (warning.address) {
8459 warn_string_literal_address(left);
8460 warn_string_literal_address(right);
8462 expression_t const* const func_left = get_reference_address(left);
8463 if (func_left != NULL && is_null_pointer_constant(right)) {
8464 warningf(&expression->base.source_position,
8465 "the address of '%Y' will never be NULL",
8466 func_left->reference.entity->base.symbol);
8469 expression_t const* const func_right = get_reference_address(right);
8470 if (func_right != NULL && is_null_pointer_constant(right)) {
8471 warningf(&expression->base.source_position,
8472 "the address of '%Y' will never be NULL",
8473 func_right->reference.entity->base.symbol);
8477 if (warning.parentheses) {
8478 warn_comparison_in_comparison(left);
8479 warn_comparison_in_comparison(right);
8482 type_t *orig_type_left = left->base.type;
8483 type_t *orig_type_right = right->base.type;
8484 type_t *type_left = skip_typeref(orig_type_left);
8485 type_t *type_right = skip_typeref(orig_type_right);
8487 /* TODO non-arithmetic types */
8488 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8489 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8491 /* test for signed vs unsigned compares */
8492 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8493 bool const signed_left = is_type_signed(type_left);
8494 bool const signed_right = is_type_signed(type_right);
8495 if (signed_left != signed_right) {
8496 /* FIXME long long needs better const folding magic */
8497 /* TODO check whether constant value can be represented by other type */
8498 if ((signed_left && maybe_negative(left)) ||
8499 (signed_right && maybe_negative(right))) {
8500 warningf(&expression->base.source_position,
8501 "comparison between signed and unsigned");
8506 expression->left = create_implicit_cast(left, arithmetic_type);
8507 expression->right = create_implicit_cast(right, arithmetic_type);
8508 expression->base.type = arithmetic_type;
8509 if (warning.float_equal &&
8510 (expression->base.kind == EXPR_BINARY_EQUAL ||
8511 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8512 is_type_float(arithmetic_type)) {
8513 warningf(&expression->base.source_position,
8514 "comparing floating point with == or != is unsafe");
8516 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8517 /* TODO check compatibility */
8518 } else if (is_type_pointer(type_left)) {
8519 expression->right = create_implicit_cast(right, type_left);
8520 } else if (is_type_pointer(type_right)) {
8521 expression->left = create_implicit_cast(left, type_right);
8522 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8523 type_error_incompatible("invalid operands in comparison",
8524 &expression->base.source_position,
8525 type_left, type_right);
8527 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8531 * Checks if a compound type has constant fields.
8533 static bool has_const_fields(const compound_type_t *type)
8535 compound_t *compound = type->compound;
8536 entity_t *entry = compound->members.entities;
8538 for (; entry != NULL; entry = entry->base.next) {
8539 if (!is_declaration(entry))
8542 const type_t *decl_type = skip_typeref(entry->declaration.type);
8543 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8550 static bool is_valid_assignment_lhs(expression_t const* const left)
8552 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8553 type_t *const type_left = skip_typeref(orig_type_left);
8555 if (!is_lvalue(left)) {
8556 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8561 if (left->kind == EXPR_REFERENCE
8562 && left->reference.entity->kind == ENTITY_FUNCTION) {
8563 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8567 if (is_type_array(type_left)) {
8568 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8571 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8572 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8576 if (is_type_incomplete(type_left)) {
8577 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8578 left, orig_type_left);
8581 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8582 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8583 left, orig_type_left);
8590 static void semantic_arithmetic_assign(binary_expression_t *expression)
8592 expression_t *left = expression->left;
8593 expression_t *right = expression->right;
8594 type_t *orig_type_left = left->base.type;
8595 type_t *orig_type_right = right->base.type;
8597 if (!is_valid_assignment_lhs(left))
8600 type_t *type_left = skip_typeref(orig_type_left);
8601 type_t *type_right = skip_typeref(orig_type_right);
8603 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8604 /* TODO: improve error message */
8605 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8606 errorf(&expression->base.source_position,
8607 "operation needs arithmetic types");
8612 /* combined instructions are tricky. We can't create an implicit cast on
8613 * the left side, because we need the uncasted form for the store.
8614 * The ast2firm pass has to know that left_type must be right_type
8615 * for the arithmetic operation and create a cast by itself */
8616 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8617 expression->right = create_implicit_cast(right, arithmetic_type);
8618 expression->base.type = type_left;
8621 static void semantic_divmod_assign(binary_expression_t *expression)
8623 semantic_arithmetic_assign(expression);
8624 warn_div_by_zero(expression);
8627 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8629 expression_t *const left = expression->left;
8630 expression_t *const right = expression->right;
8631 type_t *const orig_type_left = left->base.type;
8632 type_t *const orig_type_right = right->base.type;
8633 type_t *const type_left = skip_typeref(orig_type_left);
8634 type_t *const type_right = skip_typeref(orig_type_right);
8636 if (!is_valid_assignment_lhs(left))
8639 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8640 /* combined instructions are tricky. We can't create an implicit cast on
8641 * the left side, because we need the uncasted form for the store.
8642 * The ast2firm pass has to know that left_type must be right_type
8643 * for the arithmetic operation and create a cast by itself */
8644 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8645 expression->right = create_implicit_cast(right, arithmetic_type);
8646 expression->base.type = type_left;
8647 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8648 check_pointer_arithmetic(&expression->base.source_position,
8649 type_left, orig_type_left);
8650 expression->base.type = type_left;
8651 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8652 errorf(&expression->base.source_position,
8653 "incompatible types '%T' and '%T' in assignment",
8654 orig_type_left, orig_type_right);
8658 static void semantic_integer_assign(binary_expression_t *expression)
8660 expression_t *left = expression->left;
8661 expression_t *right = expression->right;
8662 type_t *orig_type_left = left->base.type;
8663 type_t *orig_type_right = right->base.type;
8665 if (!is_valid_assignment_lhs(left))
8668 type_t *type_left = skip_typeref(orig_type_left);
8669 type_t *type_right = skip_typeref(orig_type_right);
8671 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8672 /* TODO: improve error message */
8673 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8674 errorf(&expression->base.source_position,
8675 "operation needs integer types");
8680 /* combined instructions are tricky. We can't create an implicit cast on
8681 * the left side, because we need the uncasted form for the store.
8682 * The ast2firm pass has to know that left_type must be right_type
8683 * for the arithmetic operation and create a cast by itself */
8684 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8685 expression->right = create_implicit_cast(right, arithmetic_type);
8686 expression->base.type = type_left;
8689 static void semantic_shift_assign(binary_expression_t *expression)
8691 expression_t *left = expression->left;
8693 if (!is_valid_assignment_lhs(left))
8696 if (!semantic_shift(expression))
8699 expression->base.type = skip_typeref(left->base.type);
8702 static void warn_logical_and_within_or(const expression_t *const expr)
8704 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8706 if (expr->base.parenthesized)
8708 warningf(&expr->base.source_position,
8709 "suggest parentheses around && within ||");
8713 * Check the semantic restrictions of a logical expression.
8715 static void semantic_logical_op(binary_expression_t *expression)
8717 /* §6.5.13:2 Each of the operands shall have scalar type.
8718 * §6.5.14:2 Each of the operands shall have scalar type. */
8719 semantic_condition(expression->left, "left operand of logical operator");
8720 semantic_condition(expression->right, "right operand of logical operator");
8721 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8722 warning.parentheses) {
8723 warn_logical_and_within_or(expression->left);
8724 warn_logical_and_within_or(expression->right);
8726 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8730 * Check the semantic restrictions of a binary assign expression.
8732 static void semantic_binexpr_assign(binary_expression_t *expression)
8734 expression_t *left = expression->left;
8735 type_t *orig_type_left = left->base.type;
8737 if (!is_valid_assignment_lhs(left))
8740 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8741 report_assign_error(error, orig_type_left, expression->right,
8742 "assignment", &left->base.source_position);
8743 expression->right = create_implicit_cast(expression->right, orig_type_left);
8744 expression->base.type = orig_type_left;
8748 * Determine if the outermost operation (or parts thereof) of the given
8749 * expression has no effect in order to generate a warning about this fact.
8750 * Therefore in some cases this only examines some of the operands of the
8751 * expression (see comments in the function and examples below).
8753 * f() + 23; // warning, because + has no effect
8754 * x || f(); // no warning, because x controls execution of f()
8755 * x ? y : f(); // warning, because y has no effect
8756 * (void)x; // no warning to be able to suppress the warning
8757 * This function can NOT be used for an "expression has definitely no effect"-
8759 static bool expression_has_effect(const expression_t *const expr)
8761 switch (expr->kind) {
8762 case EXPR_UNKNOWN: break;
8763 case EXPR_INVALID: return true; /* do NOT warn */
8764 case EXPR_REFERENCE: return false;
8765 case EXPR_REFERENCE_ENUM_VALUE: return false;
8766 case EXPR_LABEL_ADDRESS: return false;
8768 /* suppress the warning for microsoft __noop operations */
8769 case EXPR_LITERAL_MS_NOOP: return true;
8770 case EXPR_LITERAL_BOOLEAN:
8771 case EXPR_LITERAL_CHARACTER:
8772 case EXPR_LITERAL_WIDE_CHARACTER:
8773 case EXPR_LITERAL_INTEGER:
8774 case EXPR_LITERAL_INTEGER_OCTAL:
8775 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8776 case EXPR_LITERAL_FLOATINGPOINT:
8777 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8778 case EXPR_STRING_LITERAL: return false;
8779 case EXPR_WIDE_STRING_LITERAL: return false;
8782 const call_expression_t *const call = &expr->call;
8783 if (call->function->kind != EXPR_REFERENCE)
8786 switch (call->function->reference.entity->function.btk) {
8787 /* FIXME: which builtins have no effect? */
8788 default: return true;
8792 /* Generate the warning if either the left or right hand side of a
8793 * conditional expression has no effect */
8794 case EXPR_CONDITIONAL: {
8795 conditional_expression_t const *const cond = &expr->conditional;
8796 expression_t const *const t = cond->true_expression;
8798 (t == NULL || expression_has_effect(t)) &&
8799 expression_has_effect(cond->false_expression);
8802 case EXPR_SELECT: return false;
8803 case EXPR_ARRAY_ACCESS: return false;
8804 case EXPR_SIZEOF: return false;
8805 case EXPR_CLASSIFY_TYPE: return false;
8806 case EXPR_ALIGNOF: return false;
8808 case EXPR_FUNCNAME: return false;
8809 case EXPR_BUILTIN_CONSTANT_P: return false;
8810 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8811 case EXPR_OFFSETOF: return false;
8812 case EXPR_VA_START: return true;
8813 case EXPR_VA_ARG: return true;
8814 case EXPR_VA_COPY: return true;
8815 case EXPR_STATEMENT: return true; // TODO
8816 case EXPR_COMPOUND_LITERAL: return false;
8818 case EXPR_UNARY_NEGATE: return false;
8819 case EXPR_UNARY_PLUS: return false;
8820 case EXPR_UNARY_BITWISE_NEGATE: return false;
8821 case EXPR_UNARY_NOT: return false;
8822 case EXPR_UNARY_DEREFERENCE: return false;
8823 case EXPR_UNARY_TAKE_ADDRESS: return false;
8824 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8825 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8826 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8827 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8829 /* Treat void casts as if they have an effect in order to being able to
8830 * suppress the warning */
8831 case EXPR_UNARY_CAST: {
8832 type_t *const type = skip_typeref(expr->base.type);
8833 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8836 case EXPR_UNARY_CAST_IMPLICIT: return true;
8837 case EXPR_UNARY_ASSUME: return true;
8838 case EXPR_UNARY_DELETE: return true;
8839 case EXPR_UNARY_DELETE_ARRAY: return true;
8840 case EXPR_UNARY_THROW: return true;
8842 case EXPR_BINARY_ADD: return false;
8843 case EXPR_BINARY_SUB: return false;
8844 case EXPR_BINARY_MUL: return false;
8845 case EXPR_BINARY_DIV: return false;
8846 case EXPR_BINARY_MOD: return false;
8847 case EXPR_BINARY_EQUAL: return false;
8848 case EXPR_BINARY_NOTEQUAL: return false;
8849 case EXPR_BINARY_LESS: return false;
8850 case EXPR_BINARY_LESSEQUAL: return false;
8851 case EXPR_BINARY_GREATER: return false;
8852 case EXPR_BINARY_GREATEREQUAL: return false;
8853 case EXPR_BINARY_BITWISE_AND: return false;
8854 case EXPR_BINARY_BITWISE_OR: return false;
8855 case EXPR_BINARY_BITWISE_XOR: return false;
8856 case EXPR_BINARY_SHIFTLEFT: return false;
8857 case EXPR_BINARY_SHIFTRIGHT: return false;
8858 case EXPR_BINARY_ASSIGN: return true;
8859 case EXPR_BINARY_MUL_ASSIGN: return true;
8860 case EXPR_BINARY_DIV_ASSIGN: return true;
8861 case EXPR_BINARY_MOD_ASSIGN: return true;
8862 case EXPR_BINARY_ADD_ASSIGN: return true;
8863 case EXPR_BINARY_SUB_ASSIGN: return true;
8864 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8865 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8866 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8867 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8868 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8870 /* Only examine the right hand side of && and ||, because the left hand
8871 * side already has the effect of controlling the execution of the right
8873 case EXPR_BINARY_LOGICAL_AND:
8874 case EXPR_BINARY_LOGICAL_OR:
8875 /* Only examine the right hand side of a comma expression, because the left
8876 * hand side has a separate warning */
8877 case EXPR_BINARY_COMMA:
8878 return expression_has_effect(expr->binary.right);
8880 case EXPR_BINARY_ISGREATER: return false;
8881 case EXPR_BINARY_ISGREATEREQUAL: return false;
8882 case EXPR_BINARY_ISLESS: return false;
8883 case EXPR_BINARY_ISLESSEQUAL: return false;
8884 case EXPR_BINARY_ISLESSGREATER: return false;
8885 case EXPR_BINARY_ISUNORDERED: return false;
8888 internal_errorf(HERE, "unexpected expression");
8891 static void semantic_comma(binary_expression_t *expression)
8893 if (warning.unused_value) {
8894 const expression_t *const left = expression->left;
8895 if (!expression_has_effect(left)) {
8896 warningf(&left->base.source_position,
8897 "left-hand operand of comma expression has no effect");
8900 expression->base.type = expression->right->base.type;
8904 * @param prec_r precedence of the right operand
8906 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8907 static expression_t *parse_##binexpression_type(expression_t *left) \
8909 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8910 binexpr->binary.left = left; \
8913 expression_t *right = parse_subexpression(prec_r); \
8915 binexpr->binary.right = right; \
8916 sfunc(&binexpr->binary); \
8921 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8922 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8923 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8924 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8925 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8926 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8927 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8928 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8929 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8930 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8931 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8932 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8933 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8934 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8935 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8936 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8937 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8938 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8939 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8940 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8941 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8942 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8943 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8944 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8945 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8946 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8947 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8948 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8949 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8950 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8953 static expression_t *parse_subexpression(precedence_t precedence)
8955 if (token.type < 0) {
8956 return expected_expression_error();
8959 expression_parser_function_t *parser
8960 = &expression_parsers[token.type];
8961 source_position_t source_position = token.source_position;
8964 if (parser->parser != NULL) {
8965 left = parser->parser();
8967 left = parse_primary_expression();
8969 assert(left != NULL);
8970 left->base.source_position = source_position;
8973 if (token.type < 0) {
8974 return expected_expression_error();
8977 parser = &expression_parsers[token.type];
8978 if (parser->infix_parser == NULL)
8980 if (parser->infix_precedence < precedence)
8983 left = parser->infix_parser(left);
8985 assert(left != NULL);
8986 assert(left->kind != EXPR_UNKNOWN);
8987 left->base.source_position = source_position;
8994 * Parse an expression.
8996 static expression_t *parse_expression(void)
8998 return parse_subexpression(PREC_EXPRESSION);
9002 * Register a parser for a prefix-like operator.
9004 * @param parser the parser function
9005 * @param token_type the token type of the prefix token
9007 static void register_expression_parser(parse_expression_function parser,
9010 expression_parser_function_t *entry = &expression_parsers[token_type];
9012 if (entry->parser != NULL) {
9013 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9014 panic("trying to register multiple expression parsers for a token");
9016 entry->parser = parser;
9020 * Register a parser for an infix operator with given precedence.
9022 * @param parser the parser function
9023 * @param token_type the token type of the infix operator
9024 * @param precedence the precedence of the operator
9026 static void register_infix_parser(parse_expression_infix_function parser,
9027 int token_type, precedence_t precedence)
9029 expression_parser_function_t *entry = &expression_parsers[token_type];
9031 if (entry->infix_parser != NULL) {
9032 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9033 panic("trying to register multiple infix expression parsers for a "
9036 entry->infix_parser = parser;
9037 entry->infix_precedence = precedence;
9041 * Initialize the expression parsers.
9043 static void init_expression_parsers(void)
9045 memset(&expression_parsers, 0, sizeof(expression_parsers));
9047 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9048 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9049 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9050 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9051 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9052 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9053 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9054 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9055 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9056 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9057 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9058 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9059 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9060 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9061 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9062 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9063 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9064 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9065 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9066 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9067 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9068 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9069 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9070 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9071 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9072 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9073 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9074 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9075 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9076 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9077 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9078 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9079 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9080 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9081 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9082 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9083 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9085 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9086 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9087 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9088 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9089 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9090 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9091 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9092 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9093 register_expression_parser(parse_sizeof, T_sizeof);
9094 register_expression_parser(parse_alignof, T___alignof__);
9095 register_expression_parser(parse_extension, T___extension__);
9096 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9097 register_expression_parser(parse_delete, T_delete);
9098 register_expression_parser(parse_throw, T_throw);
9102 * Parse a asm statement arguments specification.
9104 static asm_argument_t *parse_asm_arguments(bool is_out)
9106 asm_argument_t *result = NULL;
9107 asm_argument_t **anchor = &result;
9109 while (token.type == T_STRING_LITERAL || token.type == '[') {
9110 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9111 memset(argument, 0, sizeof(argument[0]));
9114 if (token.type != T_IDENTIFIER) {
9115 parse_error_expected("while parsing asm argument",
9116 T_IDENTIFIER, NULL);
9119 argument->symbol = token.symbol;
9121 expect(']', end_error);
9124 argument->constraints = parse_string_literals();
9125 expect('(', end_error);
9126 add_anchor_token(')');
9127 expression_t *expression = parse_expression();
9128 rem_anchor_token(')');
9130 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9131 * change size or type representation (e.g. int -> long is ok, but
9132 * int -> float is not) */
9133 if (expression->kind == EXPR_UNARY_CAST) {
9134 type_t *const type = expression->base.type;
9135 type_kind_t const kind = type->kind;
9136 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9139 if (kind == TYPE_ATOMIC) {
9140 atomic_type_kind_t const akind = type->atomic.akind;
9141 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9142 size = get_atomic_type_size(akind);
9144 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9145 size = get_atomic_type_size(get_intptr_kind());
9149 expression_t *const value = expression->unary.value;
9150 type_t *const value_type = value->base.type;
9151 type_kind_t const value_kind = value_type->kind;
9153 unsigned value_flags;
9154 unsigned value_size;
9155 if (value_kind == TYPE_ATOMIC) {
9156 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9157 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9158 value_size = get_atomic_type_size(value_akind);
9159 } else if (value_kind == TYPE_POINTER) {
9160 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9161 value_size = get_atomic_type_size(get_intptr_kind());
9166 if (value_flags != flags || value_size != size)
9170 } while (expression->kind == EXPR_UNARY_CAST);
9174 if (!is_lvalue(expression)) {
9175 errorf(&expression->base.source_position,
9176 "asm output argument is not an lvalue");
9179 if (argument->constraints.begin[0] == '=')
9180 determine_lhs_ent(expression, NULL);
9182 mark_vars_read(expression, NULL);
9184 mark_vars_read(expression, NULL);
9186 argument->expression = expression;
9187 expect(')', end_error);
9189 set_address_taken(expression, true);
9192 anchor = &argument->next;
9204 * Parse a asm statement clobber specification.
9206 static asm_clobber_t *parse_asm_clobbers(void)
9208 asm_clobber_t *result = NULL;
9209 asm_clobber_t **anchor = &result;
9211 while (token.type == T_STRING_LITERAL) {
9212 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9213 clobber->clobber = parse_string_literals();
9216 anchor = &clobber->next;
9226 * Parse an asm statement.
9228 static statement_t *parse_asm_statement(void)
9230 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9231 asm_statement_t *asm_statement = &statement->asms;
9235 if (next_if(T_volatile))
9236 asm_statement->is_volatile = true;
9238 expect('(', end_error);
9239 add_anchor_token(')');
9240 if (token.type != T_STRING_LITERAL) {
9241 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9244 asm_statement->asm_text = parse_string_literals();
9246 add_anchor_token(':');
9247 if (!next_if(':')) {
9248 rem_anchor_token(':');
9252 asm_statement->outputs = parse_asm_arguments(true);
9253 if (!next_if(':')) {
9254 rem_anchor_token(':');
9258 asm_statement->inputs = parse_asm_arguments(false);
9259 if (!next_if(':')) {
9260 rem_anchor_token(':');
9263 rem_anchor_token(':');
9265 asm_statement->clobbers = parse_asm_clobbers();
9268 rem_anchor_token(')');
9269 expect(')', end_error);
9270 expect(';', end_error);
9272 if (asm_statement->outputs == NULL) {
9273 /* GCC: An 'asm' instruction without any output operands will be treated
9274 * identically to a volatile 'asm' instruction. */
9275 asm_statement->is_volatile = true;
9280 return create_invalid_statement();
9283 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9285 statement_t *inner_stmt;
9286 switch (token.type) {
9288 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9289 inner_stmt = create_invalid_statement();
9293 if (label->kind == STATEMENT_LABEL) {
9294 /* Eat an empty statement here, to avoid the warning about an empty
9295 * statement after a label. label:; is commonly used to have a label
9296 * before a closing brace. */
9297 inner_stmt = create_empty_statement();
9304 inner_stmt = parse_statement();
9305 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9306 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9307 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9315 * Parse a case statement.
9317 static statement_t *parse_case_statement(void)
9319 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9320 source_position_t *const pos = &statement->base.source_position;
9324 expression_t *const expression = parse_expression();
9325 statement->case_label.expression = expression;
9326 expression_classification_t const expr_class = is_constant_expression(expression);
9327 if (expr_class != EXPR_CLASS_CONSTANT) {
9328 if (expr_class != EXPR_CLASS_ERROR) {
9329 errorf(pos, "case label does not reduce to an integer constant");
9331 statement->case_label.is_bad = true;
9333 long const val = fold_constant_to_int(expression);
9334 statement->case_label.first_case = val;
9335 statement->case_label.last_case = val;
9339 if (next_if(T_DOTDOTDOT)) {
9340 expression_t *const end_range = parse_expression();
9341 statement->case_label.end_range = end_range;
9342 expression_classification_t const end_class = is_constant_expression(end_range);
9343 if (end_class != EXPR_CLASS_CONSTANT) {
9344 if (end_class != EXPR_CLASS_ERROR) {
9345 errorf(pos, "case range does not reduce to an integer constant");
9347 statement->case_label.is_bad = true;
9349 long const val = fold_constant_to_int(end_range);
9350 statement->case_label.last_case = val;
9352 if (warning.other && val < statement->case_label.first_case) {
9353 statement->case_label.is_empty_range = true;
9354 warningf(pos, "empty range specified");
9360 PUSH_PARENT(statement);
9362 expect(':', end_error);
9365 if (current_switch != NULL) {
9366 if (! statement->case_label.is_bad) {
9367 /* Check for duplicate case values */
9368 case_label_statement_t *c = &statement->case_label;
9369 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9370 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9373 if (c->last_case < l->first_case || c->first_case > l->last_case)
9376 errorf(pos, "duplicate case value (previously used %P)",
9377 &l->base.source_position);
9381 /* link all cases into the switch statement */
9382 if (current_switch->last_case == NULL) {
9383 current_switch->first_case = &statement->case_label;
9385 current_switch->last_case->next = &statement->case_label;
9387 current_switch->last_case = &statement->case_label;
9389 errorf(pos, "case label not within a switch statement");
9392 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9399 * Parse a default statement.
9401 static statement_t *parse_default_statement(void)
9403 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9407 PUSH_PARENT(statement);
9409 expect(':', end_error);
9412 if (current_switch != NULL) {
9413 const case_label_statement_t *def_label = current_switch->default_label;
9414 if (def_label != NULL) {
9415 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9417 current_switch->default_label = &statement->case_label;
9419 /* link all cases into the switch statement */
9420 if (current_switch->last_case == NULL) {
9421 current_switch->first_case = &statement->case_label;
9423 current_switch->last_case->next = &statement->case_label;
9425 current_switch->last_case = &statement->case_label;
9428 errorf(&statement->base.source_position,
9429 "'default' label not within a switch statement");
9432 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9439 * Parse a label statement.
9441 static statement_t *parse_label_statement(void)
9443 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9444 label_t *const label = get_label();
9445 statement->label.label = label;
9447 PUSH_PARENT(statement);
9449 /* if statement is already set then the label is defined twice,
9450 * otherwise it was just mentioned in a goto/local label declaration so far
9452 source_position_t const* const pos = &statement->base.source_position;
9453 if (label->statement != NULL) {
9454 errorf(pos, "duplicate label '%Y' (declared %P)", label->base.symbol, &label->base.source_position);
9456 label->base.source_position = *pos;
9457 label->statement = statement;
9462 statement->label.statement = parse_label_inner_statement(statement, "label");
9464 /* remember the labels in a list for later checking */
9465 *label_anchor = &statement->label;
9466 label_anchor = &statement->label.next;
9473 * Parse an if statement.
9475 static statement_t *parse_if(void)
9477 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9481 PUSH_PARENT(statement);
9483 add_anchor_token('{');
9485 expect('(', end_error);
9486 add_anchor_token(')');
9487 expression_t *const expr = parse_expression();
9488 statement->ifs.condition = expr;
9489 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9491 semantic_condition(expr, "condition of 'if'-statment");
9492 mark_vars_read(expr, NULL);
9493 rem_anchor_token(')');
9494 expect(')', end_error);
9497 rem_anchor_token('{');
9499 add_anchor_token(T_else);
9500 statement_t *const true_stmt = parse_statement();
9501 statement->ifs.true_statement = true_stmt;
9502 rem_anchor_token(T_else);
9504 if (next_if(T_else)) {
9505 statement->ifs.false_statement = parse_statement();
9506 } else if (warning.parentheses &&
9507 true_stmt->kind == STATEMENT_IF &&
9508 true_stmt->ifs.false_statement != NULL) {
9509 warningf(&true_stmt->base.source_position,
9510 "suggest explicit braces to avoid ambiguous 'else'");
9518 * Check that all enums are handled in a switch.
9520 * @param statement the switch statement to check
9522 static void check_enum_cases(const switch_statement_t *statement)
9524 const type_t *type = skip_typeref(statement->expression->base.type);
9525 if (! is_type_enum(type))
9527 const enum_type_t *enumt = &type->enumt;
9529 /* if we have a default, no warnings */
9530 if (statement->default_label != NULL)
9533 /* FIXME: calculation of value should be done while parsing */
9534 /* TODO: quadratic algorithm here. Change to an n log n one */
9535 long last_value = -1;
9536 const entity_t *entry = enumt->enume->base.next;
9537 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9538 entry = entry->base.next) {
9539 const expression_t *expression = entry->enum_value.value;
9540 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9542 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9543 if (l->expression == NULL)
9545 if (l->first_case <= value && value <= l->last_case) {
9551 warningf(&statement->base.source_position,
9552 "enumeration value '%Y' not handled in switch",
9553 entry->base.symbol);
9560 * Parse a switch statement.
9562 static statement_t *parse_switch(void)
9564 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9568 PUSH_PARENT(statement);
9570 expect('(', end_error);
9571 add_anchor_token(')');
9572 expression_t *const expr = parse_expression();
9573 mark_vars_read(expr, NULL);
9574 type_t * type = skip_typeref(expr->base.type);
9575 if (is_type_integer(type)) {
9576 type = promote_integer(type);
9577 if (warning.traditional) {
9578 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9579 warningf(&expr->base.source_position,
9580 "'%T' switch expression not converted to '%T' in ISO C",
9584 } else if (is_type_valid(type)) {
9585 errorf(&expr->base.source_position,
9586 "switch quantity is not an integer, but '%T'", type);
9587 type = type_error_type;
9589 statement->switchs.expression = create_implicit_cast(expr, type);
9590 expect(')', end_error);
9591 rem_anchor_token(')');
9593 switch_statement_t *rem = current_switch;
9594 current_switch = &statement->switchs;
9595 statement->switchs.body = parse_statement();
9596 current_switch = rem;
9598 if (warning.switch_default &&
9599 statement->switchs.default_label == NULL) {
9600 warningf(&statement->base.source_position, "switch has no default case");
9602 if (warning.switch_enum)
9603 check_enum_cases(&statement->switchs);
9609 return create_invalid_statement();
9612 static statement_t *parse_loop_body(statement_t *const loop)
9614 statement_t *const rem = current_loop;
9615 current_loop = loop;
9617 statement_t *const body = parse_statement();
9624 * Parse a while statement.
9626 static statement_t *parse_while(void)
9628 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9632 PUSH_PARENT(statement);
9634 expect('(', end_error);
9635 add_anchor_token(')');
9636 expression_t *const cond = parse_expression();
9637 statement->whiles.condition = cond;
9638 /* §6.8.5:2 The controlling expression of an iteration statement shall
9639 * have scalar type. */
9640 semantic_condition(cond, "condition of 'while'-statement");
9641 mark_vars_read(cond, NULL);
9642 rem_anchor_token(')');
9643 expect(')', end_error);
9645 statement->whiles.body = parse_loop_body(statement);
9651 return create_invalid_statement();
9655 * Parse a do statement.
9657 static statement_t *parse_do(void)
9659 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9663 PUSH_PARENT(statement);
9665 add_anchor_token(T_while);
9666 statement->do_while.body = parse_loop_body(statement);
9667 rem_anchor_token(T_while);
9669 expect(T_while, end_error);
9670 expect('(', end_error);
9671 add_anchor_token(')');
9672 expression_t *const cond = parse_expression();
9673 statement->do_while.condition = cond;
9674 /* §6.8.5:2 The controlling expression of an iteration statement shall
9675 * have scalar type. */
9676 semantic_condition(cond, "condition of 'do-while'-statement");
9677 mark_vars_read(cond, NULL);
9678 rem_anchor_token(')');
9679 expect(')', end_error);
9680 expect(';', end_error);
9686 return create_invalid_statement();
9690 * Parse a for statement.
9692 static statement_t *parse_for(void)
9694 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9698 expect('(', end_error1);
9699 add_anchor_token(')');
9701 PUSH_PARENT(statement);
9703 size_t const top = environment_top();
9704 scope_t *old_scope = scope_push(&statement->fors.scope);
9706 bool old_gcc_extension = in_gcc_extension;
9707 while (next_if(T___extension__)) {
9708 in_gcc_extension = true;
9712 } else if (is_declaration_specifier(&token)) {
9713 parse_declaration(record_entity, DECL_FLAGS_NONE);
9715 add_anchor_token(';');
9716 expression_t *const init = parse_expression();
9717 statement->fors.initialisation = init;
9718 mark_vars_read(init, ENT_ANY);
9719 if (warning.unused_value && !expression_has_effect(init)) {
9720 warningf(&init->base.source_position,
9721 "initialisation of 'for'-statement has no effect");
9723 rem_anchor_token(';');
9724 expect(';', end_error2);
9726 in_gcc_extension = old_gcc_extension;
9728 if (token.type != ';') {
9729 add_anchor_token(';');
9730 expression_t *const cond = parse_expression();
9731 statement->fors.condition = cond;
9732 /* §6.8.5:2 The controlling expression of an iteration statement
9733 * shall have scalar type. */
9734 semantic_condition(cond, "condition of 'for'-statement");
9735 mark_vars_read(cond, NULL);
9736 rem_anchor_token(';');
9738 expect(';', end_error2);
9739 if (token.type != ')') {
9740 expression_t *const step = parse_expression();
9741 statement->fors.step = step;
9742 mark_vars_read(step, ENT_ANY);
9743 if (warning.unused_value && !expression_has_effect(step)) {
9744 warningf(&step->base.source_position,
9745 "step of 'for'-statement has no effect");
9748 expect(')', end_error2);
9749 rem_anchor_token(')');
9750 statement->fors.body = parse_loop_body(statement);
9752 assert(current_scope == &statement->fors.scope);
9753 scope_pop(old_scope);
9754 environment_pop_to(top);
9761 rem_anchor_token(')');
9762 assert(current_scope == &statement->fors.scope);
9763 scope_pop(old_scope);
9764 environment_pop_to(top);
9768 return create_invalid_statement();
9772 * Parse a goto statement.
9774 static statement_t *parse_goto(void)
9776 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9779 if (GNU_MODE && next_if('*')) {
9780 expression_t *expression = parse_expression();
9781 mark_vars_read(expression, NULL);
9783 /* Argh: although documentation says the expression must be of type void*,
9784 * gcc accepts anything that can be casted into void* without error */
9785 type_t *type = expression->base.type;
9787 if (type != type_error_type) {
9788 if (!is_type_pointer(type) && !is_type_integer(type)) {
9789 errorf(&expression->base.source_position,
9790 "cannot convert to a pointer type");
9791 } else if (warning.other && type != type_void_ptr) {
9792 warningf(&expression->base.source_position,
9793 "type of computed goto expression should be 'void*' not '%T'", type);
9795 expression = create_implicit_cast(expression, type_void_ptr);
9798 statement->gotos.expression = expression;
9799 } else if (token.type == T_IDENTIFIER) {
9800 label_t *const label = get_label();
9802 statement->gotos.label = label;
9805 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9807 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9809 return create_invalid_statement();
9812 /* remember the goto's in a list for later checking */
9813 *goto_anchor = &statement->gotos;
9814 goto_anchor = &statement->gotos.next;
9816 expect(';', end_error);
9823 * Parse a continue statement.
9825 static statement_t *parse_continue(void)
9827 if (current_loop == NULL) {
9828 errorf(HERE, "continue statement not within loop");
9831 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9834 expect(';', end_error);
9841 * Parse a break statement.
9843 static statement_t *parse_break(void)
9845 if (current_switch == NULL && current_loop == NULL) {
9846 errorf(HERE, "break statement not within loop or switch");
9849 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9852 expect(';', end_error);
9859 * Parse a __leave statement.
9861 static statement_t *parse_leave_statement(void)
9863 if (current_try == NULL) {
9864 errorf(HERE, "__leave statement not within __try");
9867 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9870 expect(';', end_error);
9877 * Check if a given entity represents a local variable.
9879 static bool is_local_variable(const entity_t *entity)
9881 if (entity->kind != ENTITY_VARIABLE)
9884 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9885 case STORAGE_CLASS_AUTO:
9886 case STORAGE_CLASS_REGISTER: {
9887 const type_t *type = skip_typeref(entity->declaration.type);
9888 if (is_type_function(type)) {
9900 * Check if a given expression represents a local variable.
9902 static bool expression_is_local_variable(const expression_t *expression)
9904 if (expression->base.kind != EXPR_REFERENCE) {
9907 const entity_t *entity = expression->reference.entity;
9908 return is_local_variable(entity);
9912 * Check if a given expression represents a local variable and
9913 * return its declaration then, else return NULL.
9915 entity_t *expression_is_variable(const expression_t *expression)
9917 if (expression->base.kind != EXPR_REFERENCE) {
9920 entity_t *entity = expression->reference.entity;
9921 if (entity->kind != ENTITY_VARIABLE)
9928 * Parse a return statement.
9930 static statement_t *parse_return(void)
9934 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9936 expression_t *return_value = NULL;
9937 if (token.type != ';') {
9938 return_value = parse_expression();
9939 mark_vars_read(return_value, NULL);
9942 const type_t *const func_type = skip_typeref(current_function->base.type);
9943 assert(is_type_function(func_type));
9944 type_t *const return_type = skip_typeref(func_type->function.return_type);
9946 source_position_t const *const pos = &statement->base.source_position;
9947 if (return_value != NULL) {
9948 type_t *return_value_type = skip_typeref(return_value->base.type);
9950 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9951 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9952 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9953 /* Only warn in C mode, because GCC does the same */
9954 if (c_mode & _CXX || strict_mode) {
9956 "'return' with a value, in function returning 'void'");
9957 } else if (warning.other) {
9959 "'return' with a value, in function returning 'void'");
9961 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9962 /* Only warn in C mode, because GCC does the same */
9965 "'return' with expression in function returning 'void'");
9966 } else if (warning.other) {
9968 "'return' with expression in function returning 'void'");
9972 assign_error_t error = semantic_assign(return_type, return_value);
9973 report_assign_error(error, return_type, return_value, "'return'",
9976 return_value = create_implicit_cast(return_value, return_type);
9977 /* check for returning address of a local var */
9978 if (warning.other && return_value != NULL
9979 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9980 const expression_t *expression = return_value->unary.value;
9981 if (expression_is_local_variable(expression)) {
9982 warningf(pos, "function returns address of local variable");
9985 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9986 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9987 if (c_mode & _CXX || strict_mode) {
9989 "'return' without value, in function returning non-void");
9992 "'return' without value, in function returning non-void");
9995 statement->returns.value = return_value;
9997 expect(';', end_error);
10004 * Parse a declaration statement.
10006 static statement_t *parse_declaration_statement(void)
10008 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10010 entity_t *before = current_scope->last_entity;
10012 parse_external_declaration();
10014 parse_declaration(record_entity, DECL_FLAGS_NONE);
10017 declaration_statement_t *const decl = &statement->declaration;
10018 entity_t *const begin =
10019 before != NULL ? before->base.next : current_scope->entities;
10020 decl->declarations_begin = begin;
10021 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10027 * Parse an expression statement, ie. expr ';'.
10029 static statement_t *parse_expression_statement(void)
10031 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10033 expression_t *const expr = parse_expression();
10034 statement->expression.expression = expr;
10035 mark_vars_read(expr, ENT_ANY);
10037 expect(';', end_error);
10044 * Parse a microsoft __try { } __finally { } or
10045 * __try{ } __except() { }
10047 static statement_t *parse_ms_try_statment(void)
10049 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10052 PUSH_PARENT(statement);
10054 ms_try_statement_t *rem = current_try;
10055 current_try = &statement->ms_try;
10056 statement->ms_try.try_statement = parse_compound_statement(false);
10061 if (next_if(T___except)) {
10062 expect('(', end_error);
10063 add_anchor_token(')');
10064 expression_t *const expr = parse_expression();
10065 mark_vars_read(expr, NULL);
10066 type_t * type = skip_typeref(expr->base.type);
10067 if (is_type_integer(type)) {
10068 type = promote_integer(type);
10069 } else if (is_type_valid(type)) {
10070 errorf(&expr->base.source_position,
10071 "__expect expression is not an integer, but '%T'", type);
10072 type = type_error_type;
10074 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10075 rem_anchor_token(')');
10076 expect(')', end_error);
10077 statement->ms_try.final_statement = parse_compound_statement(false);
10078 } else if (next_if(T__finally)) {
10079 statement->ms_try.final_statement = parse_compound_statement(false);
10081 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10082 return create_invalid_statement();
10086 return create_invalid_statement();
10089 static statement_t *parse_empty_statement(void)
10091 if (warning.empty_statement) {
10092 warningf(HERE, "statement is empty");
10094 statement_t *const statement = create_empty_statement();
10099 static statement_t *parse_local_label_declaration(void)
10101 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10105 entity_t *begin = NULL;
10106 entity_t *end = NULL;
10107 entity_t **anchor = &begin;
10109 if (token.type != T_IDENTIFIER) {
10110 parse_error_expected("while parsing local label declaration",
10111 T_IDENTIFIER, NULL);
10114 symbol_t *symbol = token.symbol;
10115 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10116 if (entity != NULL && entity->base.parent_scope == current_scope) {
10117 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10118 symbol, &entity->base.source_position);
10120 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
10121 entity->base.parent_scope = current_scope;
10122 entity->base.source_position = token.source_position;
10125 anchor = &entity->base.next;
10128 environment_push(entity);
10131 } while (next_if(','));
10132 expect(';', end_error);
10134 statement->declaration.declarations_begin = begin;
10135 statement->declaration.declarations_end = end;
10139 static void parse_namespace_definition(void)
10143 entity_t *entity = NULL;
10144 symbol_t *symbol = NULL;
10146 if (token.type == T_IDENTIFIER) {
10147 symbol = token.symbol;
10150 entity = get_entity(symbol, NAMESPACE_NORMAL);
10152 && entity->kind != ENTITY_NAMESPACE
10153 && entity->base.parent_scope == current_scope) {
10154 if (is_entity_valid(entity)) {
10155 error_redefined_as_different_kind(&token.source_position,
10156 entity, ENTITY_NAMESPACE);
10162 if (entity == NULL) {
10163 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
10164 entity->base.source_position = token.source_position;
10165 entity->base.parent_scope = current_scope;
10168 if (token.type == '=') {
10169 /* TODO: parse namespace alias */
10170 panic("namespace alias definition not supported yet");
10173 environment_push(entity);
10174 append_entity(current_scope, entity);
10176 size_t const top = environment_top();
10177 scope_t *old_scope = scope_push(&entity->namespacee.members);
10179 entity_t *old_current_entity = current_entity;
10180 current_entity = entity;
10182 expect('{', end_error);
10184 expect('}', end_error);
10187 assert(current_scope == &entity->namespacee.members);
10188 assert(current_entity == entity);
10189 current_entity = old_current_entity;
10190 scope_pop(old_scope);
10191 environment_pop_to(top);
10195 * Parse a statement.
10196 * There's also parse_statement() which additionally checks for
10197 * "statement has no effect" warnings
10199 static statement_t *intern_parse_statement(void)
10201 statement_t *statement = NULL;
10203 /* declaration or statement */
10204 add_anchor_token(';');
10205 switch (token.type) {
10206 case T_IDENTIFIER: {
10207 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10208 if (la1_type == ':') {
10209 statement = parse_label_statement();
10210 } else if (is_typedef_symbol(token.symbol)) {
10211 statement = parse_declaration_statement();
10213 /* it's an identifier, the grammar says this must be an
10214 * expression statement. However it is common that users mistype
10215 * declaration types, so we guess a bit here to improve robustness
10216 * for incorrect programs */
10217 switch (la1_type) {
10220 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10222 statement = parse_expression_statement();
10226 statement = parse_declaration_statement();
10234 case T___extension__:
10235 /* This can be a prefix to a declaration or an expression statement.
10236 * We simply eat it now and parse the rest with tail recursion. */
10237 while (next_if(T___extension__)) {}
10238 bool old_gcc_extension = in_gcc_extension;
10239 in_gcc_extension = true;
10240 statement = intern_parse_statement();
10241 in_gcc_extension = old_gcc_extension;
10245 statement = parse_declaration_statement();
10249 statement = parse_local_label_declaration();
10252 case ';': statement = parse_empty_statement(); break;
10253 case '{': statement = parse_compound_statement(false); break;
10254 case T___leave: statement = parse_leave_statement(); break;
10255 case T___try: statement = parse_ms_try_statment(); break;
10256 case T_asm: statement = parse_asm_statement(); break;
10257 case T_break: statement = parse_break(); break;
10258 case T_case: statement = parse_case_statement(); break;
10259 case T_continue: statement = parse_continue(); break;
10260 case T_default: statement = parse_default_statement(); break;
10261 case T_do: statement = parse_do(); break;
10262 case T_for: statement = parse_for(); break;
10263 case T_goto: statement = parse_goto(); break;
10264 case T_if: statement = parse_if(); break;
10265 case T_return: statement = parse_return(); break;
10266 case T_switch: statement = parse_switch(); break;
10267 case T_while: statement = parse_while(); break;
10270 statement = parse_expression_statement();
10274 errorf(HERE, "unexpected token %K while parsing statement", &token);
10275 statement = create_invalid_statement();
10280 rem_anchor_token(';');
10282 assert(statement != NULL
10283 && statement->base.source_position.input_name != NULL);
10289 * parse a statement and emits "statement has no effect" warning if needed
10290 * (This is really a wrapper around intern_parse_statement with check for 1
10291 * single warning. It is needed, because for statement expressions we have
10292 * to avoid the warning on the last statement)
10294 static statement_t *parse_statement(void)
10296 statement_t *statement = intern_parse_statement();
10298 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10299 expression_t *expression = statement->expression.expression;
10300 if (!expression_has_effect(expression)) {
10301 warningf(&expression->base.source_position,
10302 "statement has no effect");
10310 * Parse a compound statement.
10312 static statement_t *parse_compound_statement(bool inside_expression_statement)
10314 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10316 PUSH_PARENT(statement);
10319 add_anchor_token('}');
10320 /* tokens, which can start a statement */
10321 /* TODO MS, __builtin_FOO */
10322 add_anchor_token('!');
10323 add_anchor_token('&');
10324 add_anchor_token('(');
10325 add_anchor_token('*');
10326 add_anchor_token('+');
10327 add_anchor_token('-');
10328 add_anchor_token('{');
10329 add_anchor_token('~');
10330 add_anchor_token(T_CHARACTER_CONSTANT);
10331 add_anchor_token(T_COLONCOLON);
10332 add_anchor_token(T_FLOATINGPOINT);
10333 add_anchor_token(T_IDENTIFIER);
10334 add_anchor_token(T_INTEGER);
10335 add_anchor_token(T_MINUSMINUS);
10336 add_anchor_token(T_PLUSPLUS);
10337 add_anchor_token(T_STRING_LITERAL);
10338 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10339 add_anchor_token(T_WIDE_STRING_LITERAL);
10340 add_anchor_token(T__Bool);
10341 add_anchor_token(T__Complex);
10342 add_anchor_token(T__Imaginary);
10343 add_anchor_token(T___FUNCTION__);
10344 add_anchor_token(T___PRETTY_FUNCTION__);
10345 add_anchor_token(T___alignof__);
10346 add_anchor_token(T___attribute__);
10347 add_anchor_token(T___builtin_va_start);
10348 add_anchor_token(T___extension__);
10349 add_anchor_token(T___func__);
10350 add_anchor_token(T___imag__);
10351 add_anchor_token(T___label__);
10352 add_anchor_token(T___real__);
10353 add_anchor_token(T___thread);
10354 add_anchor_token(T_asm);
10355 add_anchor_token(T_auto);
10356 add_anchor_token(T_bool);
10357 add_anchor_token(T_break);
10358 add_anchor_token(T_case);
10359 add_anchor_token(T_char);
10360 add_anchor_token(T_class);
10361 add_anchor_token(T_const);
10362 add_anchor_token(T_const_cast);
10363 add_anchor_token(T_continue);
10364 add_anchor_token(T_default);
10365 add_anchor_token(T_delete);
10366 add_anchor_token(T_double);
10367 add_anchor_token(T_do);
10368 add_anchor_token(T_dynamic_cast);
10369 add_anchor_token(T_enum);
10370 add_anchor_token(T_extern);
10371 add_anchor_token(T_false);
10372 add_anchor_token(T_float);
10373 add_anchor_token(T_for);
10374 add_anchor_token(T_goto);
10375 add_anchor_token(T_if);
10376 add_anchor_token(T_inline);
10377 add_anchor_token(T_int);
10378 add_anchor_token(T_long);
10379 add_anchor_token(T_new);
10380 add_anchor_token(T_operator);
10381 add_anchor_token(T_register);
10382 add_anchor_token(T_reinterpret_cast);
10383 add_anchor_token(T_restrict);
10384 add_anchor_token(T_return);
10385 add_anchor_token(T_short);
10386 add_anchor_token(T_signed);
10387 add_anchor_token(T_sizeof);
10388 add_anchor_token(T_static);
10389 add_anchor_token(T_static_cast);
10390 add_anchor_token(T_struct);
10391 add_anchor_token(T_switch);
10392 add_anchor_token(T_template);
10393 add_anchor_token(T_this);
10394 add_anchor_token(T_throw);
10395 add_anchor_token(T_true);
10396 add_anchor_token(T_try);
10397 add_anchor_token(T_typedef);
10398 add_anchor_token(T_typeid);
10399 add_anchor_token(T_typename);
10400 add_anchor_token(T_typeof);
10401 add_anchor_token(T_union);
10402 add_anchor_token(T_unsigned);
10403 add_anchor_token(T_using);
10404 add_anchor_token(T_void);
10405 add_anchor_token(T_volatile);
10406 add_anchor_token(T_wchar_t);
10407 add_anchor_token(T_while);
10409 size_t const top = environment_top();
10410 scope_t *old_scope = scope_push(&statement->compound.scope);
10412 statement_t **anchor = &statement->compound.statements;
10413 bool only_decls_so_far = true;
10414 while (token.type != '}') {
10415 if (token.type == T_EOF) {
10416 errorf(&statement->base.source_position,
10417 "EOF while parsing compound statement");
10420 statement_t *sub_statement = intern_parse_statement();
10421 if (is_invalid_statement(sub_statement)) {
10422 /* an error occurred. if we are at an anchor, return */
10428 if (warning.declaration_after_statement) {
10429 if (sub_statement->kind != STATEMENT_DECLARATION) {
10430 only_decls_so_far = false;
10431 } else if (!only_decls_so_far) {
10432 warningf(&sub_statement->base.source_position,
10433 "ISO C90 forbids mixed declarations and code");
10437 *anchor = sub_statement;
10439 while (sub_statement->base.next != NULL)
10440 sub_statement = sub_statement->base.next;
10442 anchor = &sub_statement->base.next;
10446 /* look over all statements again to produce no effect warnings */
10447 if (warning.unused_value) {
10448 statement_t *sub_statement = statement->compound.statements;
10449 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10450 if (sub_statement->kind != STATEMENT_EXPRESSION)
10452 /* don't emit a warning for the last expression in an expression
10453 * statement as it has always an effect */
10454 if (inside_expression_statement && sub_statement->base.next == NULL)
10457 expression_t *expression = sub_statement->expression.expression;
10458 if (!expression_has_effect(expression)) {
10459 warningf(&expression->base.source_position,
10460 "statement has no effect");
10466 rem_anchor_token(T_while);
10467 rem_anchor_token(T_wchar_t);
10468 rem_anchor_token(T_volatile);
10469 rem_anchor_token(T_void);
10470 rem_anchor_token(T_using);
10471 rem_anchor_token(T_unsigned);
10472 rem_anchor_token(T_union);
10473 rem_anchor_token(T_typeof);
10474 rem_anchor_token(T_typename);
10475 rem_anchor_token(T_typeid);
10476 rem_anchor_token(T_typedef);
10477 rem_anchor_token(T_try);
10478 rem_anchor_token(T_true);
10479 rem_anchor_token(T_throw);
10480 rem_anchor_token(T_this);
10481 rem_anchor_token(T_template);
10482 rem_anchor_token(T_switch);
10483 rem_anchor_token(T_struct);
10484 rem_anchor_token(T_static_cast);
10485 rem_anchor_token(T_static);
10486 rem_anchor_token(T_sizeof);
10487 rem_anchor_token(T_signed);
10488 rem_anchor_token(T_short);
10489 rem_anchor_token(T_return);
10490 rem_anchor_token(T_restrict);
10491 rem_anchor_token(T_reinterpret_cast);
10492 rem_anchor_token(T_register);
10493 rem_anchor_token(T_operator);
10494 rem_anchor_token(T_new);
10495 rem_anchor_token(T_long);
10496 rem_anchor_token(T_int);
10497 rem_anchor_token(T_inline);
10498 rem_anchor_token(T_if);
10499 rem_anchor_token(T_goto);
10500 rem_anchor_token(T_for);
10501 rem_anchor_token(T_float);
10502 rem_anchor_token(T_false);
10503 rem_anchor_token(T_extern);
10504 rem_anchor_token(T_enum);
10505 rem_anchor_token(T_dynamic_cast);
10506 rem_anchor_token(T_do);
10507 rem_anchor_token(T_double);
10508 rem_anchor_token(T_delete);
10509 rem_anchor_token(T_default);
10510 rem_anchor_token(T_continue);
10511 rem_anchor_token(T_const_cast);
10512 rem_anchor_token(T_const);
10513 rem_anchor_token(T_class);
10514 rem_anchor_token(T_char);
10515 rem_anchor_token(T_case);
10516 rem_anchor_token(T_break);
10517 rem_anchor_token(T_bool);
10518 rem_anchor_token(T_auto);
10519 rem_anchor_token(T_asm);
10520 rem_anchor_token(T___thread);
10521 rem_anchor_token(T___real__);
10522 rem_anchor_token(T___label__);
10523 rem_anchor_token(T___imag__);
10524 rem_anchor_token(T___func__);
10525 rem_anchor_token(T___extension__);
10526 rem_anchor_token(T___builtin_va_start);
10527 rem_anchor_token(T___attribute__);
10528 rem_anchor_token(T___alignof__);
10529 rem_anchor_token(T___PRETTY_FUNCTION__);
10530 rem_anchor_token(T___FUNCTION__);
10531 rem_anchor_token(T__Imaginary);
10532 rem_anchor_token(T__Complex);
10533 rem_anchor_token(T__Bool);
10534 rem_anchor_token(T_WIDE_STRING_LITERAL);
10535 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10536 rem_anchor_token(T_STRING_LITERAL);
10537 rem_anchor_token(T_PLUSPLUS);
10538 rem_anchor_token(T_MINUSMINUS);
10539 rem_anchor_token(T_INTEGER);
10540 rem_anchor_token(T_IDENTIFIER);
10541 rem_anchor_token(T_FLOATINGPOINT);
10542 rem_anchor_token(T_COLONCOLON);
10543 rem_anchor_token(T_CHARACTER_CONSTANT);
10544 rem_anchor_token('~');
10545 rem_anchor_token('{');
10546 rem_anchor_token('-');
10547 rem_anchor_token('+');
10548 rem_anchor_token('*');
10549 rem_anchor_token('(');
10550 rem_anchor_token('&');
10551 rem_anchor_token('!');
10552 rem_anchor_token('}');
10553 assert(current_scope == &statement->compound.scope);
10554 scope_pop(old_scope);
10555 environment_pop_to(top);
10562 * Check for unused global static functions and variables
10564 static void check_unused_globals(void)
10566 if (!warning.unused_function && !warning.unused_variable)
10569 for (const entity_t *entity = file_scope->entities; entity != NULL;
10570 entity = entity->base.next) {
10571 if (!is_declaration(entity))
10574 const declaration_t *declaration = &entity->declaration;
10575 if (declaration->used ||
10576 declaration->modifiers & DM_UNUSED ||
10577 declaration->modifiers & DM_USED ||
10578 declaration->storage_class != STORAGE_CLASS_STATIC)
10581 type_t *const type = declaration->type;
10583 if (entity->kind == ENTITY_FUNCTION) {
10584 /* inhibit warning for static inline functions */
10585 if (entity->function.is_inline)
10588 s = entity->function.statement != NULL ? "defined" : "declared";
10593 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10594 type, declaration->base.symbol, s);
10598 static void parse_global_asm(void)
10600 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10603 expect('(', end_error);
10605 statement->asms.asm_text = parse_string_literals();
10606 statement->base.next = unit->global_asm;
10607 unit->global_asm = statement;
10609 expect(')', end_error);
10610 expect(';', end_error);
10615 static void parse_linkage_specification(void)
10619 source_position_t const pos = *HERE;
10620 char const *const linkage = parse_string_literals().begin;
10622 linkage_kind_t old_linkage = current_linkage;
10623 linkage_kind_t new_linkage;
10624 if (strcmp(linkage, "C") == 0) {
10625 new_linkage = LINKAGE_C;
10626 } else if (strcmp(linkage, "C++") == 0) {
10627 new_linkage = LINKAGE_CXX;
10629 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10630 new_linkage = LINKAGE_INVALID;
10632 current_linkage = new_linkage;
10634 if (next_if('{')) {
10636 expect('}', end_error);
10642 assert(current_linkage == new_linkage);
10643 current_linkage = old_linkage;
10646 static void parse_external(void)
10648 switch (token.type) {
10649 DECLARATION_START_NO_EXTERN
10651 case T___extension__:
10652 /* tokens below are for implicit int */
10653 case '&': /* & x; -> int& x; (and error later, because C++ has no
10655 case '*': /* * x; -> int* x; */
10656 case '(': /* (x); -> int (x); */
10657 parse_external_declaration();
10661 if (look_ahead(1)->type == T_STRING_LITERAL) {
10662 parse_linkage_specification();
10664 parse_external_declaration();
10669 parse_global_asm();
10673 parse_namespace_definition();
10677 if (!strict_mode) {
10679 warningf(HERE, "stray ';' outside of function");
10686 errorf(HERE, "stray %K outside of function", &token);
10687 if (token.type == '(' || token.type == '{' || token.type == '[')
10688 eat_until_matching_token(token.type);
10694 static void parse_externals(void)
10696 add_anchor_token('}');
10697 add_anchor_token(T_EOF);
10700 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10701 unsigned char token_anchor_copy[T_LAST_TOKEN];
10702 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10705 while (token.type != T_EOF && token.type != '}') {
10707 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10708 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10710 /* the anchor set and its copy differs */
10711 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10714 if (in_gcc_extension) {
10715 /* an gcc extension scope was not closed */
10716 internal_errorf(HERE, "Leaked __extension__");
10723 rem_anchor_token(T_EOF);
10724 rem_anchor_token('}');
10728 * Parse a translation unit.
10730 static void parse_translation_unit(void)
10732 add_anchor_token(T_EOF);
10737 if (token.type == T_EOF)
10740 errorf(HERE, "stray %K outside of function", &token);
10741 if (token.type == '(' || token.type == '{' || token.type == '[')
10742 eat_until_matching_token(token.type);
10747 void set_default_visibility(elf_visibility_tag_t visibility)
10749 default_visibility = visibility;
10755 * @return the translation unit or NULL if errors occurred.
10757 void start_parsing(void)
10759 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10760 label_stack = NEW_ARR_F(stack_entry_t, 0);
10761 diagnostic_count = 0;
10765 print_to_file(stderr);
10767 assert(unit == NULL);
10768 unit = allocate_ast_zero(sizeof(unit[0]));
10770 assert(file_scope == NULL);
10771 file_scope = &unit->scope;
10773 assert(current_scope == NULL);
10774 scope_push(&unit->scope);
10776 create_gnu_builtins();
10778 create_microsoft_intrinsics();
10781 translation_unit_t *finish_parsing(void)
10783 assert(current_scope == &unit->scope);
10786 assert(file_scope == &unit->scope);
10787 check_unused_globals();
10790 DEL_ARR_F(environment_stack);
10791 DEL_ARR_F(label_stack);
10793 translation_unit_t *result = unit;
10798 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10799 * are given length one. */
10800 static void complete_incomplete_arrays(void)
10802 size_t n = ARR_LEN(incomplete_arrays);
10803 for (size_t i = 0; i != n; ++i) {
10804 declaration_t *const decl = incomplete_arrays[i];
10805 type_t *const orig_type = decl->type;
10806 type_t *const type = skip_typeref(orig_type);
10808 if (!is_type_incomplete(type))
10811 if (warning.other) {
10812 warningf(&decl->base.source_position,
10813 "array '%#T' assumed to have one element",
10814 orig_type, decl->base.symbol);
10817 type_t *const new_type = duplicate_type(type);
10818 new_type->array.size_constant = true;
10819 new_type->array.has_implicit_size = true;
10820 new_type->array.size = 1;
10822 type_t *const result = identify_new_type(new_type);
10824 decl->type = result;
10828 void prepare_main_collect2(entity_t *entity)
10830 // create call to __main
10831 symbol_t *symbol = symbol_table_insert("__main");
10832 entity_t *subsubmain_ent
10833 = create_implicit_function(symbol, &builtin_source_position);
10835 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10836 type_t *ftype = subsubmain_ent->declaration.type;
10837 ref->base.source_position = builtin_source_position;
10838 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10839 ref->reference.entity = subsubmain_ent;
10841 expression_t *call = allocate_expression_zero(EXPR_CALL);
10842 call->base.source_position = builtin_source_position;
10843 call->base.type = type_void;
10844 call->call.function = ref;
10846 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10847 expr_statement->base.source_position = builtin_source_position;
10848 expr_statement->expression.expression = call;
10850 statement_t *statement = entity->function.statement;
10851 assert(statement->kind == STATEMENT_COMPOUND);
10852 compound_statement_t *compounds = &statement->compound;
10854 expr_statement->base.next = compounds->statements;
10855 compounds->statements = expr_statement;
10860 lookahead_bufpos = 0;
10861 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10864 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10865 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10866 parse_translation_unit();
10867 complete_incomplete_arrays();
10868 DEL_ARR_F(incomplete_arrays);
10869 incomplete_arrays = NULL;
10873 * Initialize the parser.
10875 void init_parser(void)
10877 sym_anonymous = symbol_table_insert("<anonymous>");
10879 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10881 init_expression_parsers();
10882 obstack_init(&temp_obst);
10886 * Terminate the parser.
10888 void exit_parser(void)
10890 obstack_free(&temp_obst, NULL);