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 TYPENAME_START \
222 #define EXPRESSION_START \
231 case T_CHARACTER_CONSTANT: \
232 case T_FLOATINGPOINT: \
233 case T_FLOATINGPOINT_HEXADECIMAL: \
235 case T_INTEGER_HEXADECIMAL: \
236 case T_INTEGER_OCTAL: \
239 case T_STRING_LITERAL: \
240 case T_WIDE_CHARACTER_CONSTANT: \
241 case T_WIDE_STRING_LITERAL: \
242 case T___FUNCDNAME__: \
243 case T___FUNCSIG__: \
244 case T___FUNCTION__: \
245 case T___PRETTY_FUNCTION__: \
246 case T___alignof__: \
247 case T___builtin_classify_type: \
248 case T___builtin_constant_p: \
249 case T___builtin_isgreater: \
250 case T___builtin_isgreaterequal: \
251 case T___builtin_isless: \
252 case T___builtin_islessequal: \
253 case T___builtin_islessgreater: \
254 case T___builtin_isunordered: \
255 case T___builtin_offsetof: \
256 case T___builtin_va_arg: \
257 case T___builtin_va_copy: \
258 case T___builtin_va_start: \
269 * Returns the size of a statement node.
271 * @param kind the statement kind
273 static size_t get_statement_struct_size(statement_kind_t kind)
275 static const size_t sizes[] = {
276 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
277 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
278 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
279 [STATEMENT_RETURN] = sizeof(return_statement_t),
280 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
281 [STATEMENT_IF] = sizeof(if_statement_t),
282 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
283 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
284 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
285 [STATEMENT_BREAK] = sizeof(statement_base_t),
286 [STATEMENT_GOTO] = sizeof(goto_statement_t),
287 [STATEMENT_LABEL] = sizeof(label_statement_t),
288 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
289 [STATEMENT_WHILE] = sizeof(while_statement_t),
290 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
291 [STATEMENT_FOR] = sizeof(for_statement_t),
292 [STATEMENT_ASM] = sizeof(asm_statement_t),
293 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
294 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
296 assert(kind < lengthof(sizes));
297 assert(sizes[kind] != 0);
302 * Returns the size of an expression node.
304 * @param kind the expression kind
306 static size_t get_expression_struct_size(expression_kind_t kind)
308 static const size_t sizes[] = {
309 [EXPR_INVALID] = sizeof(expression_base_t),
310 [EXPR_REFERENCE] = sizeof(reference_expression_t),
311 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
312 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
313 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
314 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
315 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
316 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
317 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
318 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
319 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
320 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
321 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
322 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
323 [EXPR_CALL] = sizeof(call_expression_t),
324 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
325 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
326 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
327 [EXPR_SELECT] = sizeof(select_expression_t),
328 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
329 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
330 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
331 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
332 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
333 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
334 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
335 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
336 [EXPR_VA_START] = sizeof(va_start_expression_t),
337 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
338 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
339 [EXPR_STATEMENT] = sizeof(statement_expression_t),
340 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
342 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
343 return sizes[EXPR_UNARY_FIRST];
345 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
346 return sizes[EXPR_BINARY_FIRST];
348 assert(kind < lengthof(sizes));
349 assert(sizes[kind] != 0);
354 * Allocate a statement node of given kind and initialize all
355 * fields with zero. Sets its source position to the position
356 * of the current token.
358 static statement_t *allocate_statement_zero(statement_kind_t kind)
360 size_t size = get_statement_struct_size(kind);
361 statement_t *res = allocate_ast_zero(size);
363 res->base.kind = kind;
364 res->base.parent = current_parent;
365 res->base.source_position = token.source_position;
370 * Allocate an expression node of given kind and initialize all
373 * @param kind the kind of the expression to allocate
375 static expression_t *allocate_expression_zero(expression_kind_t kind)
377 size_t size = get_expression_struct_size(kind);
378 expression_t *res = allocate_ast_zero(size);
380 res->base.kind = kind;
381 res->base.type = type_error_type;
382 res->base.source_position = token.source_position;
387 * Creates a new invalid expression at the source position
388 * of the current token.
390 static expression_t *create_invalid_expression(void)
392 return allocate_expression_zero(EXPR_INVALID);
396 * Creates a new invalid statement.
398 static statement_t *create_invalid_statement(void)
400 return allocate_statement_zero(STATEMENT_INVALID);
404 * Allocate a new empty statement.
406 static statement_t *create_empty_statement(void)
408 return allocate_statement_zero(STATEMENT_EMPTY);
411 static function_parameter_t *allocate_parameter(type_t *const type)
413 function_parameter_t *const param
414 = obstack_alloc(type_obst, sizeof(*param));
415 memset(param, 0, sizeof(*param));
421 * Returns the size of an initializer node.
423 * @param kind the initializer kind
425 static size_t get_initializer_size(initializer_kind_t kind)
427 static const size_t sizes[] = {
428 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
429 [INITIALIZER_STRING] = sizeof(initializer_string_t),
430 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
431 [INITIALIZER_LIST] = sizeof(initializer_list_t),
432 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
434 assert(kind < lengthof(sizes));
435 assert(sizes[kind] != 0);
440 * Allocate an initializer node of given kind and initialize all
443 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
445 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
452 * Returns the index of the top element of the environment stack.
454 static size_t environment_top(void)
456 return ARR_LEN(environment_stack);
460 * Returns the index of the top element of the global label stack.
462 static size_t label_top(void)
464 return ARR_LEN(label_stack);
468 * Return the next token.
470 static inline void next_token(void)
472 token = lookahead_buffer[lookahead_bufpos];
473 lookahead_buffer[lookahead_bufpos] = lexer_token;
476 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
479 print_token(stderr, &token);
480 fprintf(stderr, "\n");
484 static inline bool next_if(int const type)
486 if (token.type == type) {
495 * Return the next token with a given lookahead.
497 static inline const token_t *look_ahead(size_t num)
499 assert(0 < num && num <= MAX_LOOKAHEAD);
500 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
501 return &lookahead_buffer[pos];
505 * Adds a token type to the token type anchor set (a multi-set).
507 static void add_anchor_token(int token_type)
509 assert(0 <= token_type && token_type < T_LAST_TOKEN);
510 ++token_anchor_set[token_type];
514 * Set the number of tokens types of the given type
515 * to zero and return the old count.
517 static int save_and_reset_anchor_state(int token_type)
519 assert(0 <= token_type && token_type < T_LAST_TOKEN);
520 int count = token_anchor_set[token_type];
521 token_anchor_set[token_type] = 0;
526 * Restore the number of token types to the given count.
528 static void restore_anchor_state(int token_type, int count)
530 assert(0 <= token_type && token_type < T_LAST_TOKEN);
531 token_anchor_set[token_type] = count;
535 * Remove a token type from the token type anchor set (a multi-set).
537 static void rem_anchor_token(int token_type)
539 assert(0 <= token_type && token_type < T_LAST_TOKEN);
540 assert(token_anchor_set[token_type] != 0);
541 --token_anchor_set[token_type];
545 * Return true if the token type of the current token is
548 static bool at_anchor(void)
552 return token_anchor_set[token.type];
556 * Eat tokens until a matching token type is found.
558 static void eat_until_matching_token(int type)
562 case '(': end_token = ')'; break;
563 case '{': end_token = '}'; break;
564 case '[': end_token = ']'; break;
565 default: end_token = type; break;
568 unsigned parenthesis_count = 0;
569 unsigned brace_count = 0;
570 unsigned bracket_count = 0;
571 while (token.type != end_token ||
572 parenthesis_count != 0 ||
574 bracket_count != 0) {
575 switch (token.type) {
577 case '(': ++parenthesis_count; break;
578 case '{': ++brace_count; break;
579 case '[': ++bracket_count; break;
582 if (parenthesis_count > 0)
592 if (bracket_count > 0)
595 if (token.type == end_token &&
596 parenthesis_count == 0 &&
610 * Eat input tokens until an anchor is found.
612 static void eat_until_anchor(void)
614 while (token_anchor_set[token.type] == 0) {
615 if (token.type == '(' || token.type == '{' || token.type == '[')
616 eat_until_matching_token(token.type);
622 * Eat a whole block from input tokens.
624 static void eat_block(void)
626 eat_until_matching_token('{');
630 #define eat(token_type) (assert(token.type == (token_type)), next_token())
633 * Report a parse error because an expected token was not found.
636 #if defined __GNUC__ && __GNUC__ >= 4
637 __attribute__((sentinel))
639 void parse_error_expected(const char *message, ...)
641 if (message != NULL) {
642 errorf(HERE, "%s", message);
645 va_start(ap, message);
646 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
651 * Report an incompatible type.
653 static void type_error_incompatible(const char *msg,
654 const source_position_t *source_position, type_t *type1, type_t *type2)
656 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
661 * Expect the current token is the expected token.
662 * If not, generate an error, eat the current statement,
663 * and goto the error_label label.
665 #define expect(expected, error_label) \
667 if (UNLIKELY(token.type != (expected))) { \
668 parse_error_expected(NULL, (expected), NULL); \
669 add_anchor_token(expected); \
670 eat_until_anchor(); \
671 next_if((expected)); \
672 rem_anchor_token(expected); \
679 * Push a given scope on the scope stack and make it the
682 static scope_t *scope_push(scope_t *new_scope)
684 if (current_scope != NULL) {
685 new_scope->depth = current_scope->depth + 1;
688 scope_t *old_scope = current_scope;
689 current_scope = new_scope;
694 * Pop the current scope from the scope stack.
696 static void scope_pop(scope_t *old_scope)
698 current_scope = old_scope;
702 * Search an entity by its symbol in a given namespace.
704 static entity_t *get_entity(const symbol_t *const symbol,
705 namespace_tag_t namespc)
707 assert(namespc != NAMESPACE_INVALID);
708 entity_t *entity = symbol->entity;
709 for (; entity != NULL; entity = entity->base.symbol_next) {
710 if (entity->base.namespc == namespc)
717 /* §6.2.3:1 24) There is only one name space for tags even though three are
719 static entity_t *get_tag(symbol_t const *const symbol,
720 entity_kind_tag_t const kind)
722 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
723 if (entity != NULL && entity->kind != kind) {
725 "'%Y' defined as wrong kind of tag (previous definition %P)",
726 symbol, &entity->base.source_position);
733 * pushs an entity on the environment stack and links the corresponding symbol
736 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
738 symbol_t *symbol = entity->base.symbol;
739 entity_namespace_t namespc = entity->base.namespc;
740 assert(namespc != NAMESPACE_INVALID);
742 /* replace/add entity into entity list of the symbol */
745 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
750 /* replace an entry? */
751 if (iter->base.namespc == namespc) {
752 entity->base.symbol_next = iter->base.symbol_next;
758 /* remember old declaration */
760 entry.symbol = symbol;
761 entry.old_entity = iter;
762 entry.namespc = namespc;
763 ARR_APP1(stack_entry_t, *stack_ptr, entry);
767 * Push an entity on the environment stack.
769 static void environment_push(entity_t *entity)
771 assert(entity->base.source_position.input_name != NULL);
772 assert(entity->base.parent_scope != NULL);
773 stack_push(&environment_stack, entity);
777 * Push a declaration on the global label stack.
779 * @param declaration the declaration
781 static void label_push(entity_t *label)
783 /* we abuse the parameters scope as parent for the labels */
784 label->base.parent_scope = ¤t_function->parameters;
785 stack_push(&label_stack, label);
789 * pops symbols from the environment stack until @p new_top is the top element
791 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
793 stack_entry_t *stack = *stack_ptr;
794 size_t top = ARR_LEN(stack);
797 assert(new_top <= top);
801 for (i = top; i > new_top; --i) {
802 stack_entry_t *entry = &stack[i - 1];
804 entity_t *old_entity = entry->old_entity;
805 symbol_t *symbol = entry->symbol;
806 entity_namespace_t namespc = entry->namespc;
808 /* replace with old_entity/remove */
811 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
813 assert(iter != NULL);
814 /* replace an entry? */
815 if (iter->base.namespc == namespc)
819 /* restore definition from outer scopes (if there was one) */
820 if (old_entity != NULL) {
821 old_entity->base.symbol_next = iter->base.symbol_next;
822 *anchor = old_entity;
824 /* remove entry from list */
825 *anchor = iter->base.symbol_next;
829 ARR_SHRINKLEN(*stack_ptr, new_top);
833 * Pop all entries from the environment stack until the new_top
836 * @param new_top the new stack top
838 static void environment_pop_to(size_t new_top)
840 stack_pop_to(&environment_stack, new_top);
844 * Pop all entries from the global label stack until the new_top
847 * @param new_top the new stack top
849 static void label_pop_to(size_t new_top)
851 stack_pop_to(&label_stack, new_top);
854 static int get_akind_rank(atomic_type_kind_t akind)
860 * Return the type rank for an atomic type.
862 static int get_rank(const type_t *type)
864 assert(!is_typeref(type));
865 if (type->kind == TYPE_ENUM)
866 return get_akind_rank(type->enumt.akind);
868 assert(type->kind == TYPE_ATOMIC);
869 return get_akind_rank(type->atomic.akind);
873 * §6.3.1.1:2 Do integer promotion for a given type.
875 * @param type the type to promote
876 * @return the promoted type
878 static type_t *promote_integer(type_t *type)
880 if (type->kind == TYPE_BITFIELD)
881 type = type->bitfield.base_type;
883 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
890 * Create a cast expression.
892 * @param expression the expression to cast
893 * @param dest_type the destination type
895 static expression_t *create_cast_expression(expression_t *expression,
898 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
900 cast->unary.value = expression;
901 cast->base.type = dest_type;
907 * Check if a given expression represents a null pointer constant.
909 * @param expression the expression to check
911 static bool is_null_pointer_constant(const expression_t *expression)
913 /* skip void* cast */
914 if (expression->kind == EXPR_UNARY_CAST ||
915 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
916 type_t *const type = skip_typeref(expression->base.type);
917 if (types_compatible(type, type_void_ptr))
918 expression = expression->unary.value;
921 type_t *const type = skip_typeref(expression->base.type);
922 if (!is_type_integer(type))
924 switch (is_constant_expression(expression)) {
925 case EXPR_CLASS_ERROR: return true;
926 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
927 default: return false;
932 * Create an implicit cast expression.
934 * @param expression the expression to cast
935 * @param dest_type the destination type
937 static expression_t *create_implicit_cast(expression_t *expression,
940 type_t *const source_type = expression->base.type;
942 if (source_type == dest_type)
945 return create_cast_expression(expression, dest_type);
948 typedef enum assign_error_t {
950 ASSIGN_ERROR_INCOMPATIBLE,
951 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
952 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
953 ASSIGN_WARNING_POINTER_FROM_INT,
954 ASSIGN_WARNING_INT_FROM_POINTER
957 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
958 const expression_t *const right,
960 const source_position_t *source_position)
962 type_t *const orig_type_right = right->base.type;
963 type_t *const type_left = skip_typeref(orig_type_left);
964 type_t *const type_right = skip_typeref(orig_type_right);
969 case ASSIGN_ERROR_INCOMPATIBLE:
970 errorf(source_position,
971 "destination type '%T' in %s is incompatible with type '%T'",
972 orig_type_left, context, orig_type_right);
975 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
977 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
978 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
980 /* the left type has all qualifiers from the right type */
981 unsigned missing_qualifiers
982 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
983 warningf(source_position,
984 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
985 orig_type_left, context, orig_type_right, missing_qualifiers);
990 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
992 warningf(source_position,
993 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
994 orig_type_left, context, right, orig_type_right);
998 case ASSIGN_WARNING_POINTER_FROM_INT:
1000 warningf(source_position,
1001 "%s makes pointer '%T' from integer '%T' without a cast",
1002 context, orig_type_left, orig_type_right);
1006 case ASSIGN_WARNING_INT_FROM_POINTER:
1007 if (warning.other) {
1008 warningf(source_position,
1009 "%s makes integer '%T' from pointer '%T' without a cast",
1010 context, orig_type_left, orig_type_right);
1015 panic("invalid error value");
1019 /** Implements the rules from §6.5.16.1 */
1020 static assign_error_t semantic_assign(type_t *orig_type_left,
1021 const expression_t *const right)
1023 type_t *const orig_type_right = right->base.type;
1024 type_t *const type_left = skip_typeref(orig_type_left);
1025 type_t *const type_right = skip_typeref(orig_type_right);
1027 if (is_type_pointer(type_left)) {
1028 if (is_null_pointer_constant(right)) {
1029 return ASSIGN_SUCCESS;
1030 } else if (is_type_pointer(type_right)) {
1031 type_t *points_to_left
1032 = skip_typeref(type_left->pointer.points_to);
1033 type_t *points_to_right
1034 = skip_typeref(type_right->pointer.points_to);
1035 assign_error_t res = ASSIGN_SUCCESS;
1037 /* the left type has all qualifiers from the right type */
1038 unsigned missing_qualifiers
1039 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1040 if (missing_qualifiers != 0) {
1041 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1044 points_to_left = get_unqualified_type(points_to_left);
1045 points_to_right = get_unqualified_type(points_to_right);
1047 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1050 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1051 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1052 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1055 if (!types_compatible(points_to_left, points_to_right)) {
1056 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1060 } else if (is_type_integer(type_right)) {
1061 return ASSIGN_WARNING_POINTER_FROM_INT;
1063 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1064 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1065 && is_type_pointer(type_right))) {
1066 return ASSIGN_SUCCESS;
1067 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1068 type_t *const unqual_type_left = get_unqualified_type(type_left);
1069 type_t *const unqual_type_right = get_unqualified_type(type_right);
1070 if (types_compatible(unqual_type_left, unqual_type_right)) {
1071 return ASSIGN_SUCCESS;
1073 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1074 return ASSIGN_WARNING_INT_FROM_POINTER;
1077 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1078 return ASSIGN_SUCCESS;
1080 return ASSIGN_ERROR_INCOMPATIBLE;
1083 static expression_t *parse_constant_expression(void)
1085 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1087 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1088 errorf(&result->base.source_position,
1089 "expression '%E' is not constant", result);
1095 static expression_t *parse_assignment_expression(void)
1097 return parse_subexpression(PREC_ASSIGNMENT);
1100 static void warn_string_concat(const source_position_t *pos)
1102 if (warning.traditional) {
1103 warningf(pos, "traditional C rejects string constant concatenation");
1107 static string_t parse_string_literals(void)
1109 assert(token.type == T_STRING_LITERAL);
1110 string_t result = token.literal;
1114 while (token.type == T_STRING_LITERAL) {
1115 warn_string_concat(&token.source_position);
1116 result = concat_strings(&result, &token.literal);
1124 * compare two string, ignoring double underscores on the second.
1126 static int strcmp_underscore(const char *s1, const char *s2)
1128 if (s2[0] == '_' && s2[1] == '_') {
1129 size_t len2 = strlen(s2);
1130 size_t len1 = strlen(s1);
1131 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1132 return strncmp(s1, s2+2, len2-4);
1136 return strcmp(s1, s2);
1139 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1141 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1142 attribute->kind = kind;
1147 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1150 * __attribute__ ( ( attribute-list ) )
1154 * attribute_list , attrib
1159 * any-word ( identifier )
1160 * any-word ( identifier , nonempty-expr-list )
1161 * any-word ( expr-list )
1163 * where the "identifier" must not be declared as a type, and
1164 * "any-word" may be any identifier (including one declared as a
1165 * type), a reserved word storage class specifier, type specifier or
1166 * type qualifier. ??? This still leaves out most reserved keywords
1167 * (following the old parser), shouldn't we include them, and why not
1168 * allow identifiers declared as types to start the arguments?
1170 * Matze: this all looks confusing and little systematic, so we're even less
1171 * strict and parse any list of things which are identifiers or
1172 * (assignment-)expressions.
1174 static attribute_argument_t *parse_attribute_arguments(void)
1176 attribute_argument_t *first = NULL;
1177 attribute_argument_t **anchor = &first;
1178 if (token.type != ')') do {
1179 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1181 /* is it an identifier */
1182 if (token.type == T_IDENTIFIER
1183 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1184 symbol_t *symbol = token.symbol;
1185 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1186 argument->v.symbol = symbol;
1189 /* must be an expression */
1190 expression_t *expression = parse_assignment_expression();
1192 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1193 argument->v.expression = expression;
1196 /* append argument */
1198 anchor = &argument->next;
1199 } while (next_if(','));
1200 expect(')', end_error);
1209 static attribute_t *parse_attribute_asm(void)
1213 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1215 expect('(', end_error);
1216 attribute->a.arguments = parse_attribute_arguments();
1223 static symbol_t *get_symbol_from_token(void)
1225 switch(token.type) {
1227 return token.symbol;
1256 /* maybe we need more tokens ... add them on demand */
1257 return get_token_symbol(&token);
1263 static attribute_t *parse_attribute_gnu_single(void)
1265 /* parse "any-word" */
1266 symbol_t *symbol = get_symbol_from_token();
1267 if (symbol == NULL) {
1268 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1272 const char *name = symbol->string;
1275 attribute_kind_t kind;
1276 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1277 if (kind > ATTRIBUTE_GNU_LAST) {
1278 if (warning.attribute) {
1279 warningf(HERE, "unknown attribute '%s' ignored", name);
1281 /* TODO: we should still save the attribute in the list... */
1282 kind = ATTRIBUTE_UNKNOWN;
1286 const char *attribute_name = get_attribute_name(kind);
1287 if (attribute_name != NULL
1288 && strcmp_underscore(attribute_name, name) == 0)
1292 attribute_t *attribute = allocate_attribute_zero(kind);
1294 /* parse arguments */
1296 attribute->a.arguments = parse_attribute_arguments();
1301 static attribute_t *parse_attribute_gnu(void)
1303 attribute_t *first = NULL;
1304 attribute_t **anchor = &first;
1306 eat(T___attribute__);
1307 expect('(', end_error);
1308 expect('(', end_error);
1310 if (token.type != ')') do {
1311 attribute_t *attribute = parse_attribute_gnu_single();
1312 if (attribute == NULL)
1315 *anchor = attribute;
1316 anchor = &attribute->next;
1317 } while (next_if(','));
1318 expect(')', end_error);
1319 expect(')', end_error);
1325 /** Parse attributes. */
1326 static attribute_t *parse_attributes(attribute_t *first)
1328 attribute_t **anchor = &first;
1330 while (*anchor != NULL)
1331 anchor = &(*anchor)->next;
1333 attribute_t *attribute;
1334 switch (token.type) {
1335 case T___attribute__:
1336 attribute = parse_attribute_gnu();
1337 if (attribute == NULL)
1342 attribute = parse_attribute_asm();
1347 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1352 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1355 case T__forceinline:
1357 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1362 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1367 /* TODO record modifier */
1369 warningf(HERE, "Ignoring declaration modifier %K", &token);
1370 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1377 *anchor = attribute;
1378 anchor = &attribute->next;
1382 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1384 static entity_t *determine_lhs_ent(expression_t *const expr,
1387 switch (expr->kind) {
1388 case EXPR_REFERENCE: {
1389 entity_t *const entity = expr->reference.entity;
1390 /* we should only find variables as lvalues... */
1391 if (entity->base.kind != ENTITY_VARIABLE
1392 && entity->base.kind != ENTITY_PARAMETER)
1398 case EXPR_ARRAY_ACCESS: {
1399 expression_t *const ref = expr->array_access.array_ref;
1400 entity_t * ent = NULL;
1401 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1402 ent = determine_lhs_ent(ref, lhs_ent);
1405 mark_vars_read(expr->select.compound, lhs_ent);
1407 mark_vars_read(expr->array_access.index, lhs_ent);
1412 if (is_type_compound(skip_typeref(expr->base.type))) {
1413 return determine_lhs_ent(expr->select.compound, lhs_ent);
1415 mark_vars_read(expr->select.compound, lhs_ent);
1420 case EXPR_UNARY_DEREFERENCE: {
1421 expression_t *const val = expr->unary.value;
1422 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1424 return determine_lhs_ent(val->unary.value, lhs_ent);
1426 mark_vars_read(val, NULL);
1432 mark_vars_read(expr, NULL);
1437 #define ENT_ANY ((entity_t*)-1)
1440 * Mark declarations, which are read. This is used to detect variables, which
1444 * x is not marked as "read", because it is only read to calculate its own new
1448 * x and y are not detected as "not read", because multiple variables are
1451 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1453 switch (expr->kind) {
1454 case EXPR_REFERENCE: {
1455 entity_t *const entity = expr->reference.entity;
1456 if (entity->kind != ENTITY_VARIABLE
1457 && entity->kind != ENTITY_PARAMETER)
1460 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1461 if (entity->kind == ENTITY_VARIABLE) {
1462 entity->variable.read = true;
1464 entity->parameter.read = true;
1471 // TODO respect pure/const
1472 mark_vars_read(expr->call.function, NULL);
1473 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1474 mark_vars_read(arg->expression, NULL);
1478 case EXPR_CONDITIONAL:
1479 // TODO lhs_decl should depend on whether true/false have an effect
1480 mark_vars_read(expr->conditional.condition, NULL);
1481 if (expr->conditional.true_expression != NULL)
1482 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1483 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1487 if (lhs_ent == ENT_ANY
1488 && !is_type_compound(skip_typeref(expr->base.type)))
1490 mark_vars_read(expr->select.compound, lhs_ent);
1493 case EXPR_ARRAY_ACCESS: {
1494 expression_t *const ref = expr->array_access.array_ref;
1495 mark_vars_read(ref, lhs_ent);
1496 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1497 mark_vars_read(expr->array_access.index, lhs_ent);
1502 mark_vars_read(expr->va_arge.ap, lhs_ent);
1506 mark_vars_read(expr->va_copye.src, lhs_ent);
1509 case EXPR_UNARY_CAST:
1510 /* Special case: Use void cast to mark a variable as "read" */
1511 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1516 case EXPR_UNARY_THROW:
1517 if (expr->unary.value == NULL)
1520 case EXPR_UNARY_DEREFERENCE:
1521 case EXPR_UNARY_DELETE:
1522 case EXPR_UNARY_DELETE_ARRAY:
1523 if (lhs_ent == ENT_ANY)
1527 case EXPR_UNARY_NEGATE:
1528 case EXPR_UNARY_PLUS:
1529 case EXPR_UNARY_BITWISE_NEGATE:
1530 case EXPR_UNARY_NOT:
1531 case EXPR_UNARY_TAKE_ADDRESS:
1532 case EXPR_UNARY_POSTFIX_INCREMENT:
1533 case EXPR_UNARY_POSTFIX_DECREMENT:
1534 case EXPR_UNARY_PREFIX_INCREMENT:
1535 case EXPR_UNARY_PREFIX_DECREMENT:
1536 case EXPR_UNARY_CAST_IMPLICIT:
1537 case EXPR_UNARY_ASSUME:
1539 mark_vars_read(expr->unary.value, lhs_ent);
1542 case EXPR_BINARY_ADD:
1543 case EXPR_BINARY_SUB:
1544 case EXPR_BINARY_MUL:
1545 case EXPR_BINARY_DIV:
1546 case EXPR_BINARY_MOD:
1547 case EXPR_BINARY_EQUAL:
1548 case EXPR_BINARY_NOTEQUAL:
1549 case EXPR_BINARY_LESS:
1550 case EXPR_BINARY_LESSEQUAL:
1551 case EXPR_BINARY_GREATER:
1552 case EXPR_BINARY_GREATEREQUAL:
1553 case EXPR_BINARY_BITWISE_AND:
1554 case EXPR_BINARY_BITWISE_OR:
1555 case EXPR_BINARY_BITWISE_XOR:
1556 case EXPR_BINARY_LOGICAL_AND:
1557 case EXPR_BINARY_LOGICAL_OR:
1558 case EXPR_BINARY_SHIFTLEFT:
1559 case EXPR_BINARY_SHIFTRIGHT:
1560 case EXPR_BINARY_COMMA:
1561 case EXPR_BINARY_ISGREATER:
1562 case EXPR_BINARY_ISGREATEREQUAL:
1563 case EXPR_BINARY_ISLESS:
1564 case EXPR_BINARY_ISLESSEQUAL:
1565 case EXPR_BINARY_ISLESSGREATER:
1566 case EXPR_BINARY_ISUNORDERED:
1567 mark_vars_read(expr->binary.left, lhs_ent);
1568 mark_vars_read(expr->binary.right, lhs_ent);
1571 case EXPR_BINARY_ASSIGN:
1572 case EXPR_BINARY_MUL_ASSIGN:
1573 case EXPR_BINARY_DIV_ASSIGN:
1574 case EXPR_BINARY_MOD_ASSIGN:
1575 case EXPR_BINARY_ADD_ASSIGN:
1576 case EXPR_BINARY_SUB_ASSIGN:
1577 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1578 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1579 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1580 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1581 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1582 if (lhs_ent == ENT_ANY)
1584 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1585 mark_vars_read(expr->binary.right, lhs_ent);
1590 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1596 case EXPR_STRING_LITERAL:
1597 case EXPR_WIDE_STRING_LITERAL:
1598 case EXPR_COMPOUND_LITERAL: // TODO init?
1600 case EXPR_CLASSIFY_TYPE:
1603 case EXPR_BUILTIN_CONSTANT_P:
1604 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1606 case EXPR_STATEMENT: // TODO
1607 case EXPR_LABEL_ADDRESS:
1608 case EXPR_REFERENCE_ENUM_VALUE:
1612 panic("unhandled expression");
1615 static designator_t *parse_designation(void)
1617 designator_t *result = NULL;
1618 designator_t **anchor = &result;
1621 designator_t *designator;
1622 switch (token.type) {
1624 designator = allocate_ast_zero(sizeof(designator[0]));
1625 designator->source_position = token.source_position;
1627 add_anchor_token(']');
1628 designator->array_index = parse_constant_expression();
1629 rem_anchor_token(']');
1630 expect(']', end_error);
1633 designator = allocate_ast_zero(sizeof(designator[0]));
1634 designator->source_position = token.source_position;
1636 if (token.type != T_IDENTIFIER) {
1637 parse_error_expected("while parsing designator",
1638 T_IDENTIFIER, NULL);
1641 designator->symbol = token.symbol;
1645 expect('=', end_error);
1649 assert(designator != NULL);
1650 *anchor = designator;
1651 anchor = &designator->next;
1657 static initializer_t *initializer_from_string(array_type_t *const type,
1658 const string_t *const string)
1660 /* TODO: check len vs. size of array type */
1663 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1664 initializer->string.string = *string;
1669 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1670 const string_t *const string)
1672 /* TODO: check len vs. size of array type */
1675 initializer_t *const initializer =
1676 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1677 initializer->wide_string.string = *string;
1683 * Build an initializer from a given expression.
1685 static initializer_t *initializer_from_expression(type_t *orig_type,
1686 expression_t *expression)
1688 /* TODO check that expression is a constant expression */
1690 /* §6.7.8.14/15 char array may be initialized by string literals */
1691 type_t *type = skip_typeref(orig_type);
1692 type_t *expr_type_orig = expression->base.type;
1693 type_t *expr_type = skip_typeref(expr_type_orig);
1695 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1696 array_type_t *const array_type = &type->array;
1697 type_t *const element_type = skip_typeref(array_type->element_type);
1699 if (element_type->kind == TYPE_ATOMIC) {
1700 atomic_type_kind_t akind = element_type->atomic.akind;
1701 switch (expression->kind) {
1702 case EXPR_STRING_LITERAL:
1703 if (akind == ATOMIC_TYPE_CHAR
1704 || akind == ATOMIC_TYPE_SCHAR
1705 || akind == ATOMIC_TYPE_UCHAR) {
1706 return initializer_from_string(array_type,
1707 &expression->string_literal.value);
1711 case EXPR_WIDE_STRING_LITERAL: {
1712 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1713 if (get_unqualified_type(element_type) == bare_wchar_type) {
1714 return initializer_from_wide_string(array_type,
1715 &expression->string_literal.value);
1726 assign_error_t error = semantic_assign(type, expression);
1727 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1729 report_assign_error(error, type, expression, "initializer",
1730 &expression->base.source_position);
1732 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1733 result->value.value = create_implicit_cast(expression, type);
1739 * Checks if a given expression can be used as an constant initializer.
1741 static bool is_initializer_constant(const expression_t *expression)
1744 is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1745 is_address_constant(expression) != EXPR_CLASS_VARIABLE;
1749 * Parses an scalar initializer.
1751 * §6.7.8.11; eat {} without warning
1753 static initializer_t *parse_scalar_initializer(type_t *type,
1754 bool must_be_constant)
1756 /* there might be extra {} hierarchies */
1758 if (token.type == '{') {
1760 warningf(HERE, "extra curly braces around scalar initializer");
1764 } while (token.type == '{');
1767 expression_t *expression = parse_assignment_expression();
1768 mark_vars_read(expression, NULL);
1769 if (must_be_constant && !is_initializer_constant(expression)) {
1770 errorf(&expression->base.source_position,
1771 "initialisation expression '%E' is not constant",
1775 initializer_t *initializer = initializer_from_expression(type, expression);
1777 if (initializer == NULL) {
1778 errorf(&expression->base.source_position,
1779 "expression '%E' (type '%T') doesn't match expected type '%T'",
1780 expression, expression->base.type, type);
1785 bool additional_warning_displayed = false;
1786 while (braces > 0) {
1788 if (token.type != '}') {
1789 if (!additional_warning_displayed && warning.other) {
1790 warningf(HERE, "additional elements in scalar initializer");
1791 additional_warning_displayed = true;
1802 * An entry in the type path.
1804 typedef struct type_path_entry_t type_path_entry_t;
1805 struct type_path_entry_t {
1806 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1808 size_t index; /**< For array types: the current index. */
1809 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1814 * A type path expression a position inside compound or array types.
1816 typedef struct type_path_t type_path_t;
1817 struct type_path_t {
1818 type_path_entry_t *path; /**< An flexible array containing the current path. */
1819 type_t *top_type; /**< type of the element the path points */
1820 size_t max_index; /**< largest index in outermost array */
1824 * Prints a type path for debugging.
1826 static __attribute__((unused)) void debug_print_type_path(
1827 const type_path_t *path)
1829 size_t len = ARR_LEN(path->path);
1831 for (size_t i = 0; i < len; ++i) {
1832 const type_path_entry_t *entry = & path->path[i];
1834 type_t *type = skip_typeref(entry->type);
1835 if (is_type_compound(type)) {
1836 /* in gcc mode structs can have no members */
1837 if (entry->v.compound_entry == NULL) {
1841 fprintf(stderr, ".%s",
1842 entry->v.compound_entry->base.symbol->string);
1843 } else if (is_type_array(type)) {
1844 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1846 fprintf(stderr, "-INVALID-");
1849 if (path->top_type != NULL) {
1850 fprintf(stderr, " (");
1851 print_type(path->top_type);
1852 fprintf(stderr, ")");
1857 * Return the top type path entry, ie. in a path
1858 * (type).a.b returns the b.
1860 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1862 size_t len = ARR_LEN(path->path);
1864 return &path->path[len-1];
1868 * Enlarge the type path by an (empty) element.
1870 static type_path_entry_t *append_to_type_path(type_path_t *path)
1872 size_t len = ARR_LEN(path->path);
1873 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1875 type_path_entry_t *result = & path->path[len];
1876 memset(result, 0, sizeof(result[0]));
1881 * Descending into a sub-type. Enter the scope of the current top_type.
1883 static void descend_into_subtype(type_path_t *path)
1885 type_t *orig_top_type = path->top_type;
1886 type_t *top_type = skip_typeref(orig_top_type);
1888 type_path_entry_t *top = append_to_type_path(path);
1889 top->type = top_type;
1891 if (is_type_compound(top_type)) {
1892 compound_t *compound = top_type->compound.compound;
1893 entity_t *entry = compound->members.entities;
1895 if (entry != NULL) {
1896 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1897 top->v.compound_entry = &entry->declaration;
1898 path->top_type = entry->declaration.type;
1900 path->top_type = NULL;
1902 } else if (is_type_array(top_type)) {
1904 path->top_type = top_type->array.element_type;
1906 assert(!is_type_valid(top_type));
1911 * Pop an entry from the given type path, ie. returning from
1912 * (type).a.b to (type).a
1914 static void ascend_from_subtype(type_path_t *path)
1916 type_path_entry_t *top = get_type_path_top(path);
1918 path->top_type = top->type;
1920 size_t len = ARR_LEN(path->path);
1921 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1925 * Pop entries from the given type path until the given
1926 * path level is reached.
1928 static void ascend_to(type_path_t *path, size_t top_path_level)
1930 size_t len = ARR_LEN(path->path);
1932 while (len > top_path_level) {
1933 ascend_from_subtype(path);
1934 len = ARR_LEN(path->path);
1938 static bool walk_designator(type_path_t *path, const designator_t *designator,
1939 bool used_in_offsetof)
1941 for (; designator != NULL; designator = designator->next) {
1942 type_path_entry_t *top = get_type_path_top(path);
1943 type_t *orig_type = top->type;
1945 type_t *type = skip_typeref(orig_type);
1947 if (designator->symbol != NULL) {
1948 symbol_t *symbol = designator->symbol;
1949 if (!is_type_compound(type)) {
1950 if (is_type_valid(type)) {
1951 errorf(&designator->source_position,
1952 "'.%Y' designator used for non-compound type '%T'",
1956 top->type = type_error_type;
1957 top->v.compound_entry = NULL;
1958 orig_type = type_error_type;
1960 compound_t *compound = type->compound.compound;
1961 entity_t *iter = compound->members.entities;
1962 for (; iter != NULL; iter = iter->base.next) {
1963 if (iter->base.symbol == symbol) {
1968 errorf(&designator->source_position,
1969 "'%T' has no member named '%Y'", orig_type, symbol);
1972 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1973 if (used_in_offsetof) {
1974 type_t *real_type = skip_typeref(iter->declaration.type);
1975 if (real_type->kind == TYPE_BITFIELD) {
1976 errorf(&designator->source_position,
1977 "offsetof designator '%Y' must not specify bitfield",
1983 top->type = orig_type;
1984 top->v.compound_entry = &iter->declaration;
1985 orig_type = iter->declaration.type;
1988 expression_t *array_index = designator->array_index;
1989 assert(designator->array_index != NULL);
1991 if (!is_type_array(type)) {
1992 if (is_type_valid(type)) {
1993 errorf(&designator->source_position,
1994 "[%E] designator used for non-array type '%T'",
1995 array_index, orig_type);
2000 long index = fold_constant_to_int(array_index);
2001 if (!used_in_offsetof) {
2003 errorf(&designator->source_position,
2004 "array index [%E] must be positive", array_index);
2005 } else if (type->array.size_constant) {
2006 long array_size = type->array.size;
2007 if (index >= array_size) {
2008 errorf(&designator->source_position,
2009 "designator [%E] (%d) exceeds array size %d",
2010 array_index, index, array_size);
2015 top->type = orig_type;
2016 top->v.index = (size_t) index;
2017 orig_type = type->array.element_type;
2019 path->top_type = orig_type;
2021 if (designator->next != NULL) {
2022 descend_into_subtype(path);
2028 static void advance_current_object(type_path_t *path, size_t top_path_level)
2030 type_path_entry_t *top = get_type_path_top(path);
2032 type_t *type = skip_typeref(top->type);
2033 if (is_type_union(type)) {
2034 /* in unions only the first element is initialized */
2035 top->v.compound_entry = NULL;
2036 } else if (is_type_struct(type)) {
2037 declaration_t *entry = top->v.compound_entry;
2039 entity_t *next_entity = entry->base.next;
2040 if (next_entity != NULL) {
2041 assert(is_declaration(next_entity));
2042 entry = &next_entity->declaration;
2047 top->v.compound_entry = entry;
2048 if (entry != NULL) {
2049 path->top_type = entry->type;
2052 } else if (is_type_array(type)) {
2053 assert(is_type_array(type));
2057 if (!type->array.size_constant || top->v.index < type->array.size) {
2061 assert(!is_type_valid(type));
2065 /* we're past the last member of the current sub-aggregate, try if we
2066 * can ascend in the type hierarchy and continue with another subobject */
2067 size_t len = ARR_LEN(path->path);
2069 if (len > top_path_level) {
2070 ascend_from_subtype(path);
2071 advance_current_object(path, top_path_level);
2073 path->top_type = NULL;
2078 * skip any {...} blocks until a closing bracket is reached.
2080 static void skip_initializers(void)
2084 while (token.type != '}') {
2085 if (token.type == T_EOF)
2087 if (token.type == '{') {
2095 static initializer_t *create_empty_initializer(void)
2097 static initializer_t empty_initializer
2098 = { .list = { { INITIALIZER_LIST }, 0 } };
2099 return &empty_initializer;
2103 * Parse a part of an initialiser for a struct or union,
2105 static initializer_t *parse_sub_initializer(type_path_t *path,
2106 type_t *outer_type, size_t top_path_level,
2107 parse_initializer_env_t *env)
2109 if (token.type == '}') {
2110 /* empty initializer */
2111 return create_empty_initializer();
2114 type_t *orig_type = path->top_type;
2115 type_t *type = NULL;
2117 if (orig_type == NULL) {
2118 /* We are initializing an empty compound. */
2120 type = skip_typeref(orig_type);
2123 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2126 designator_t *designator = NULL;
2127 if (token.type == '.' || token.type == '[') {
2128 designator = parse_designation();
2129 goto finish_designator;
2130 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2131 /* GNU-style designator ("identifier: value") */
2132 designator = allocate_ast_zero(sizeof(designator[0]));
2133 designator->source_position = token.source_position;
2134 designator->symbol = token.symbol;
2139 /* reset path to toplevel, evaluate designator from there */
2140 ascend_to(path, top_path_level);
2141 if (!walk_designator(path, designator, false)) {
2142 /* can't continue after designation error */
2146 initializer_t *designator_initializer
2147 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2148 designator_initializer->designator.designator = designator;
2149 ARR_APP1(initializer_t*, initializers, designator_initializer);
2151 orig_type = path->top_type;
2152 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2157 if (token.type == '{') {
2158 if (type != NULL && is_type_scalar(type)) {
2159 sub = parse_scalar_initializer(type, env->must_be_constant);
2162 if (env->entity != NULL) {
2164 "extra brace group at end of initializer for '%Y'",
2165 env->entity->base.symbol);
2167 errorf(HERE, "extra brace group at end of initializer");
2172 descend_into_subtype(path);
2175 add_anchor_token('}');
2176 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2178 rem_anchor_token('}');
2181 ascend_from_subtype(path);
2182 expect('}', end_error);
2184 expect('}', end_error);
2185 goto error_parse_next;
2189 /* must be an expression */
2190 expression_t *expression = parse_assignment_expression();
2191 mark_vars_read(expression, NULL);
2193 if (env->must_be_constant && !is_initializer_constant(expression)) {
2194 errorf(&expression->base.source_position,
2195 "Initialisation expression '%E' is not constant",
2200 /* we are already outside, ... */
2201 if (outer_type == NULL)
2202 goto error_parse_next;
2203 type_t *const outer_type_skip = skip_typeref(outer_type);
2204 if (is_type_compound(outer_type_skip) &&
2205 !outer_type_skip->compound.compound->complete) {
2206 goto error_parse_next;
2209 if (warning.other) {
2210 if (env->entity != NULL) {
2211 warningf(HERE, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2213 warningf(HERE, "excess elements in initializer");
2216 goto error_parse_next;
2219 /* handle { "string" } special case */
2220 if ((expression->kind == EXPR_STRING_LITERAL
2221 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2222 && outer_type != NULL) {
2223 sub = initializer_from_expression(outer_type, expression);
2226 if (token.type != '}' && warning.other) {
2227 warningf(HERE, "excessive elements in initializer for type '%T'",
2230 /* TODO: eat , ... */
2235 /* descend into subtypes until expression matches type */
2237 orig_type = path->top_type;
2238 type = skip_typeref(orig_type);
2240 sub = initializer_from_expression(orig_type, expression);
2244 if (!is_type_valid(type)) {
2247 if (is_type_scalar(type)) {
2248 errorf(&expression->base.source_position,
2249 "expression '%E' doesn't match expected type '%T'",
2250 expression, orig_type);
2254 descend_into_subtype(path);
2258 /* update largest index of top array */
2259 const type_path_entry_t *first = &path->path[0];
2260 type_t *first_type = first->type;
2261 first_type = skip_typeref(first_type);
2262 if (is_type_array(first_type)) {
2263 size_t index = first->v.index;
2264 if (index > path->max_index)
2265 path->max_index = index;
2268 /* append to initializers list */
2269 ARR_APP1(initializer_t*, initializers, sub);
2272 if (token.type == '}') {
2275 expect(',', end_error);
2276 if (token.type == '}') {
2281 /* advance to the next declaration if we are not at the end */
2282 advance_current_object(path, top_path_level);
2283 orig_type = path->top_type;
2284 if (orig_type != NULL)
2285 type = skip_typeref(orig_type);
2291 size_t len = ARR_LEN(initializers);
2292 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2293 initializer_t *result = allocate_ast_zero(size);
2294 result->kind = INITIALIZER_LIST;
2295 result->list.len = len;
2296 memcpy(&result->list.initializers, initializers,
2297 len * sizeof(initializers[0]));
2299 DEL_ARR_F(initializers);
2300 ascend_to(path, top_path_level+1);
2305 skip_initializers();
2306 DEL_ARR_F(initializers);
2307 ascend_to(path, top_path_level+1);
2311 static expression_t *make_size_literal(size_t value)
2313 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2314 literal->base.type = type_size_t;
2317 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2318 literal->literal.value = make_string(buf);
2324 * Parses an initializer. Parsers either a compound literal
2325 * (env->declaration == NULL) or an initializer of a declaration.
2327 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2329 type_t *type = skip_typeref(env->type);
2330 size_t max_index = 0;
2331 initializer_t *result;
2333 if (is_type_scalar(type)) {
2334 result = parse_scalar_initializer(type, env->must_be_constant);
2335 } else if (token.type == '{') {
2339 memset(&path, 0, sizeof(path));
2340 path.top_type = env->type;
2341 path.path = NEW_ARR_F(type_path_entry_t, 0);
2343 descend_into_subtype(&path);
2345 add_anchor_token('}');
2346 result = parse_sub_initializer(&path, env->type, 1, env);
2347 rem_anchor_token('}');
2349 max_index = path.max_index;
2350 DEL_ARR_F(path.path);
2352 expect('}', end_error);
2355 /* parse_scalar_initializer() also works in this case: we simply
2356 * have an expression without {} around it */
2357 result = parse_scalar_initializer(type, env->must_be_constant);
2360 /* §6.7.8:22 array initializers for arrays with unknown size determine
2361 * the array type size */
2362 if (is_type_array(type) && type->array.size_expression == NULL
2363 && result != NULL) {
2365 switch (result->kind) {
2366 case INITIALIZER_LIST:
2367 assert(max_index != 0xdeadbeaf);
2368 size = max_index + 1;
2371 case INITIALIZER_STRING:
2372 size = result->string.string.size;
2375 case INITIALIZER_WIDE_STRING:
2376 size = result->wide_string.string.size;
2379 case INITIALIZER_DESIGNATOR:
2380 case INITIALIZER_VALUE:
2381 /* can happen for parse errors */
2386 internal_errorf(HERE, "invalid initializer type");
2389 type_t *new_type = duplicate_type(type);
2391 new_type->array.size_expression = make_size_literal(size);
2392 new_type->array.size_constant = true;
2393 new_type->array.has_implicit_size = true;
2394 new_type->array.size = size;
2395 env->type = new_type;
2401 static void append_entity(scope_t *scope, entity_t *entity)
2403 if (scope->last_entity != NULL) {
2404 scope->last_entity->base.next = entity;
2406 scope->entities = entity;
2408 entity->base.parent_entity = current_entity;
2409 scope->last_entity = entity;
2413 static compound_t *parse_compound_type_specifier(bool is_struct)
2415 source_position_t const pos = *HERE;
2416 eat(is_struct ? T_struct : T_union);
2418 symbol_t *symbol = NULL;
2419 entity_t *entity = NULL;
2420 attribute_t *attributes = NULL;
2422 if (token.type == T___attribute__) {
2423 attributes = parse_attributes(NULL);
2426 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2427 if (token.type == T_IDENTIFIER) {
2428 /* the compound has a name, check if we have seen it already */
2429 symbol = token.symbol;
2430 entity = get_tag(symbol, kind);
2433 if (entity != NULL) {
2434 if (entity->base.parent_scope != current_scope &&
2435 (token.type == '{' || token.type == ';')) {
2436 /* we're in an inner scope and have a definition. Shadow
2437 * existing definition in outer scope */
2439 } else if (entity->compound.complete && token.type == '{') {
2440 errorf(&pos, "multiple definitions of '%s %Y' (previous definition %P)",
2441 is_struct ? "struct" : "union", symbol,
2442 &entity->base.source_position);
2443 /* clear members in the hope to avoid further errors */
2444 entity->compound.members.entities = NULL;
2447 } else if (token.type != '{') {
2448 char const *const msg =
2449 is_struct ? "while parsing struct type specifier" :
2450 "while parsing union type specifier";
2451 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2456 if (entity == NULL) {
2457 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2458 entity->compound.alignment = 1;
2459 entity->base.source_position = pos;
2460 entity->base.parent_scope = current_scope;
2461 if (symbol != NULL) {
2462 environment_push(entity);
2464 append_entity(current_scope, entity);
2467 if (token.type == '{') {
2468 parse_compound_type_entries(&entity->compound);
2470 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2471 if (symbol == NULL) {
2472 assert(anonymous_entity == NULL);
2473 anonymous_entity = entity;
2477 if (attributes != NULL) {
2478 handle_entity_attributes(attributes, entity);
2481 return &entity->compound;
2484 static void parse_enum_entries(type_t *const enum_type)
2488 if (token.type == '}') {
2489 errorf(HERE, "empty enum not allowed");
2494 add_anchor_token('}');
2496 if (token.type != T_IDENTIFIER) {
2497 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2499 rem_anchor_token('}');
2503 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, token.symbol);
2504 entity->enum_value.enum_type = enum_type;
2505 entity->base.source_position = token.source_position;
2509 expression_t *value = parse_constant_expression();
2511 value = create_implicit_cast(value, enum_type);
2512 entity->enum_value.value = value;
2517 record_entity(entity, false);
2518 } while (next_if(',') && token.type != '}');
2519 rem_anchor_token('}');
2521 expect('}', end_error);
2527 static type_t *parse_enum_specifier(void)
2529 source_position_t const pos = *HERE;
2534 switch (token.type) {
2536 symbol = token.symbol;
2537 entity = get_tag(symbol, ENTITY_ENUM);
2540 if (entity != NULL) {
2541 if (entity->base.parent_scope != current_scope &&
2542 (token.type == '{' || token.type == ';')) {
2543 /* we're in an inner scope and have a definition. Shadow
2544 * existing definition in outer scope */
2546 } else if (entity->enume.complete && token.type == '{') {
2547 errorf(&pos, "multiple definitions of 'enum %Y' (previous definition %P)",
2548 symbol, &entity->base.source_position);
2559 parse_error_expected("while parsing enum type specifier",
2560 T_IDENTIFIER, '{', NULL);
2564 if (entity == NULL) {
2565 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2566 entity->base.source_position = pos;
2567 entity->base.parent_scope = current_scope;
2570 type_t *const type = allocate_type_zero(TYPE_ENUM);
2571 type->enumt.enume = &entity->enume;
2572 type->enumt.akind = ATOMIC_TYPE_INT;
2574 if (token.type == '{') {
2575 if (symbol != NULL) {
2576 environment_push(entity);
2578 append_entity(current_scope, entity);
2579 entity->enume.complete = true;
2581 parse_enum_entries(type);
2582 parse_attributes(NULL);
2584 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2585 if (symbol == NULL) {
2586 assert(anonymous_entity == NULL);
2587 anonymous_entity = entity;
2589 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2590 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2597 * if a symbol is a typedef to another type, return true
2599 static bool is_typedef_symbol(symbol_t *symbol)
2601 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2602 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2605 static type_t *parse_typeof(void)
2611 expect('(', end_error);
2612 add_anchor_token(')');
2614 expression_t *expression = NULL;
2616 bool old_type_prop = in_type_prop;
2617 bool old_gcc_extension = in_gcc_extension;
2618 in_type_prop = true;
2620 while (next_if(T___extension__)) {
2621 /* This can be a prefix to a typename or an expression. */
2622 in_gcc_extension = true;
2624 switch (token.type) {
2626 if (is_typedef_symbol(token.symbol)) {
2628 type = parse_typename();
2631 expression = parse_expression();
2632 type = revert_automatic_type_conversion(expression);
2636 in_type_prop = old_type_prop;
2637 in_gcc_extension = old_gcc_extension;
2639 rem_anchor_token(')');
2640 expect(')', end_error);
2642 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2643 typeof_type->typeoft.expression = expression;
2644 typeof_type->typeoft.typeof_type = type;
2651 typedef enum specifiers_t {
2652 SPECIFIER_SIGNED = 1 << 0,
2653 SPECIFIER_UNSIGNED = 1 << 1,
2654 SPECIFIER_LONG = 1 << 2,
2655 SPECIFIER_INT = 1 << 3,
2656 SPECIFIER_DOUBLE = 1 << 4,
2657 SPECIFIER_CHAR = 1 << 5,
2658 SPECIFIER_WCHAR_T = 1 << 6,
2659 SPECIFIER_SHORT = 1 << 7,
2660 SPECIFIER_LONG_LONG = 1 << 8,
2661 SPECIFIER_FLOAT = 1 << 9,
2662 SPECIFIER_BOOL = 1 << 10,
2663 SPECIFIER_VOID = 1 << 11,
2664 SPECIFIER_INT8 = 1 << 12,
2665 SPECIFIER_INT16 = 1 << 13,
2666 SPECIFIER_INT32 = 1 << 14,
2667 SPECIFIER_INT64 = 1 << 15,
2668 SPECIFIER_INT128 = 1 << 16,
2669 SPECIFIER_COMPLEX = 1 << 17,
2670 SPECIFIER_IMAGINARY = 1 << 18,
2673 static type_t *get_typedef_type(symbol_t *symbol)
2675 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2676 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2679 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2680 type->typedeft.typedefe = &entity->typedefe;
2685 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2687 expect('(', end_error);
2689 attribute_property_argument_t *property
2690 = allocate_ast_zero(sizeof(*property));
2693 if (token.type != T_IDENTIFIER) {
2694 parse_error_expected("while parsing property declspec",
2695 T_IDENTIFIER, NULL);
2700 symbol_t *symbol = token.symbol;
2702 if (strcmp(symbol->string, "put") == 0) {
2703 prop = &property->put_symbol;
2704 } else if (strcmp(symbol->string, "get") == 0) {
2705 prop = &property->get_symbol;
2707 errorf(HERE, "expected put or get in property declspec");
2710 expect('=', end_error);
2711 if (token.type != T_IDENTIFIER) {
2712 parse_error_expected("while parsing property declspec",
2713 T_IDENTIFIER, NULL);
2717 *prop = token.symbol;
2719 } while (next_if(','));
2721 attribute->a.property = property;
2723 expect(')', end_error);
2729 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2731 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2732 if (next_if(T_restrict)) {
2733 kind = ATTRIBUTE_MS_RESTRICT;
2734 } else if (token.type == T_IDENTIFIER) {
2735 const char *name = token.symbol->string;
2737 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2739 const char *attribute_name = get_attribute_name(k);
2740 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2746 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2747 warningf(HERE, "unknown __declspec '%s' ignored", name);
2750 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2754 attribute_t *attribute = allocate_attribute_zero(kind);
2756 if (kind == ATTRIBUTE_MS_PROPERTY) {
2757 return parse_attribute_ms_property(attribute);
2760 /* parse arguments */
2762 attribute->a.arguments = parse_attribute_arguments();
2767 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2771 expect('(', end_error);
2776 add_anchor_token(')');
2778 attribute_t **anchor = &first;
2780 while (*anchor != NULL)
2781 anchor = &(*anchor)->next;
2783 attribute_t *attribute
2784 = parse_microsoft_extended_decl_modifier_single();
2785 if (attribute == NULL)
2788 *anchor = attribute;
2789 anchor = &attribute->next;
2790 } while (next_if(','));
2792 rem_anchor_token(')');
2793 expect(')', end_error);
2797 rem_anchor_token(')');
2801 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2803 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2804 entity->base.source_position = *HERE;
2805 if (is_declaration(entity)) {
2806 entity->declaration.type = type_error_type;
2807 entity->declaration.implicit = true;
2808 } else if (kind == ENTITY_TYPEDEF) {
2809 entity->typedefe.type = type_error_type;
2810 entity->typedefe.builtin = true;
2812 if (kind != ENTITY_COMPOUND_MEMBER)
2813 record_entity(entity, false);
2817 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2819 type_t *type = NULL;
2820 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2821 unsigned type_specifiers = 0;
2822 bool newtype = false;
2823 bool saw_error = false;
2824 bool old_gcc_extension = in_gcc_extension;
2826 memset(specifiers, 0, sizeof(*specifiers));
2827 specifiers->source_position = token.source_position;
2830 specifiers->attributes = parse_attributes(specifiers->attributes);
2832 switch (token.type) {
2834 #define MATCH_STORAGE_CLASS(token, class) \
2836 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2837 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2839 specifiers->storage_class = class; \
2840 if (specifiers->thread_local) \
2841 goto check_thread_storage_class; \
2845 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2846 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2847 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2848 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2849 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2852 specifiers->attributes
2853 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2857 if (specifiers->thread_local) {
2858 errorf(HERE, "duplicate '__thread'");
2860 specifiers->thread_local = true;
2861 check_thread_storage_class:
2862 switch (specifiers->storage_class) {
2863 case STORAGE_CLASS_EXTERN:
2864 case STORAGE_CLASS_NONE:
2865 case STORAGE_CLASS_STATIC:
2869 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2870 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2871 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2872 wrong_thread_storage_class:
2873 errorf(HERE, "'__thread' used with '%s'", wrong);
2880 /* type qualifiers */
2881 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2883 qualifiers |= qualifier; \
2887 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2888 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2889 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2890 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2891 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2892 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2893 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2894 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2896 case T___extension__:
2898 in_gcc_extension = true;
2901 /* type specifiers */
2902 #define MATCH_SPECIFIER(token, specifier, name) \
2904 if (type_specifiers & specifier) { \
2905 errorf(HERE, "multiple " name " type specifiers given"); \
2907 type_specifiers |= specifier; \
2912 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2913 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2914 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2915 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2916 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2917 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2918 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2919 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2920 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2921 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2922 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2923 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2924 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2925 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2926 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2927 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2928 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2929 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2933 specifiers->is_inline = true;
2937 case T__forceinline:
2939 specifiers->modifiers |= DM_FORCEINLINE;
2944 if (type_specifiers & SPECIFIER_LONG_LONG) {
2945 errorf(HERE, "too many long type specifiers given");
2946 } else if (type_specifiers & SPECIFIER_LONG) {
2947 type_specifiers |= SPECIFIER_LONG_LONG;
2949 type_specifiers |= SPECIFIER_LONG;
2954 #define CHECK_DOUBLE_TYPE() \
2955 if ( type != NULL) \
2956 errorf(HERE, "multiple data types in declaration specifiers");
2959 CHECK_DOUBLE_TYPE();
2960 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2962 type->compound.compound = parse_compound_type_specifier(true);
2965 CHECK_DOUBLE_TYPE();
2966 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2967 type->compound.compound = parse_compound_type_specifier(false);
2970 CHECK_DOUBLE_TYPE();
2971 type = parse_enum_specifier();
2974 CHECK_DOUBLE_TYPE();
2975 type = parse_typeof();
2977 case T___builtin_va_list:
2978 CHECK_DOUBLE_TYPE();
2979 type = duplicate_type(type_valist);
2983 case T_IDENTIFIER: {
2984 /* only parse identifier if we haven't found a type yet */
2985 if (type != NULL || type_specifiers != 0) {
2986 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2987 * declaration, so it doesn't generate errors about expecting '(' or
2989 switch (look_ahead(1)->type) {
2996 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3000 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3005 goto finish_specifiers;
3009 type_t *const typedef_type = get_typedef_type(token.symbol);
3010 if (typedef_type == NULL) {
3011 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3012 * declaration, so it doesn't generate 'implicit int' followed by more
3013 * errors later on. */
3014 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3020 errorf(HERE, "%K does not name a type", &token);
3023 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3025 type = allocate_type_zero(TYPE_TYPEDEF);
3026 type->typedeft.typedefe = &entity->typedefe;
3034 goto finish_specifiers;
3039 type = typedef_type;
3043 /* function specifier */
3045 goto finish_specifiers;
3050 specifiers->attributes = parse_attributes(specifiers->attributes);
3052 in_gcc_extension = old_gcc_extension;
3054 if (type == NULL || (saw_error && type_specifiers != 0)) {
3055 atomic_type_kind_t atomic_type;
3057 /* match valid basic types */
3058 switch (type_specifiers) {
3059 case SPECIFIER_VOID:
3060 atomic_type = ATOMIC_TYPE_VOID;
3062 case SPECIFIER_WCHAR_T:
3063 atomic_type = ATOMIC_TYPE_WCHAR_T;
3065 case SPECIFIER_CHAR:
3066 atomic_type = ATOMIC_TYPE_CHAR;
3068 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3069 atomic_type = ATOMIC_TYPE_SCHAR;
3071 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3072 atomic_type = ATOMIC_TYPE_UCHAR;
3074 case SPECIFIER_SHORT:
3075 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3076 case SPECIFIER_SHORT | SPECIFIER_INT:
3077 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3078 atomic_type = ATOMIC_TYPE_SHORT;
3080 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3081 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3082 atomic_type = ATOMIC_TYPE_USHORT;
3085 case SPECIFIER_SIGNED:
3086 case SPECIFIER_SIGNED | SPECIFIER_INT:
3087 atomic_type = ATOMIC_TYPE_INT;
3089 case SPECIFIER_UNSIGNED:
3090 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3091 atomic_type = ATOMIC_TYPE_UINT;
3093 case SPECIFIER_LONG:
3094 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3095 case SPECIFIER_LONG | SPECIFIER_INT:
3096 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3097 atomic_type = ATOMIC_TYPE_LONG;
3099 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3100 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3101 atomic_type = ATOMIC_TYPE_ULONG;
3104 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3105 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3106 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3107 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3109 atomic_type = ATOMIC_TYPE_LONGLONG;
3110 goto warn_about_long_long;
3112 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3113 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3115 atomic_type = ATOMIC_TYPE_ULONGLONG;
3116 warn_about_long_long:
3117 if (warning.long_long) {
3118 warningf(&specifiers->source_position,
3119 "ISO C90 does not support 'long long'");
3123 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3124 atomic_type = unsigned_int8_type_kind;
3127 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3128 atomic_type = unsigned_int16_type_kind;
3131 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3132 atomic_type = unsigned_int32_type_kind;
3135 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3136 atomic_type = unsigned_int64_type_kind;
3139 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3140 atomic_type = unsigned_int128_type_kind;
3143 case SPECIFIER_INT8:
3144 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3145 atomic_type = int8_type_kind;
3148 case SPECIFIER_INT16:
3149 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3150 atomic_type = int16_type_kind;
3153 case SPECIFIER_INT32:
3154 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3155 atomic_type = int32_type_kind;
3158 case SPECIFIER_INT64:
3159 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3160 atomic_type = int64_type_kind;
3163 case SPECIFIER_INT128:
3164 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3165 atomic_type = int128_type_kind;
3168 case SPECIFIER_FLOAT:
3169 atomic_type = ATOMIC_TYPE_FLOAT;
3171 case SPECIFIER_DOUBLE:
3172 atomic_type = ATOMIC_TYPE_DOUBLE;
3174 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3175 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3177 case SPECIFIER_BOOL:
3178 atomic_type = ATOMIC_TYPE_BOOL;
3180 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3181 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3182 atomic_type = ATOMIC_TYPE_FLOAT;
3184 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3185 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3186 atomic_type = ATOMIC_TYPE_DOUBLE;
3188 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3189 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3190 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3193 /* invalid specifier combination, give an error message */
3194 if (type_specifiers == 0) {
3196 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3197 if (!(c_mode & _CXX) && !strict_mode) {
3198 if (warning.implicit_int) {
3199 warningf(HERE, "no type specifiers in declaration, using 'int'");
3201 atomic_type = ATOMIC_TYPE_INT;
3204 errorf(HERE, "no type specifiers given in declaration");
3207 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3208 (type_specifiers & SPECIFIER_UNSIGNED)) {
3209 errorf(HERE, "signed and unsigned specifiers given");
3210 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3211 errorf(HERE, "only integer types can be signed or unsigned");
3213 errorf(HERE, "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(HERE, "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, it shall
3777 * have a value greater than zero. */
3779 if (size < 0 || !GNU_MODE) {
3780 errorf(&size_expression->base.source_position,
3781 "size of array must be greater than zero");
3782 } else if (warning.other) {
3783 warningf(&size_expression->base.source_position,
3784 "zero length arrays are a GCC extension");
3790 case EXPR_CLASS_VARIABLE:
3791 array_type->array.is_vla = true;
3794 case EXPR_CLASS_ERROR:
3799 type_t *skipped_type = skip_typeref(type);
3801 if (is_type_incomplete(skipped_type)) {
3802 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3803 } else if (is_type_function(skipped_type)) {
3804 errorf(pos, "array of functions is not allowed");
3806 type = identify_new_type(array_type);
3810 internal_errorf(pos, "invalid type construction found");
3816 static type_t *automatic_type_conversion(type_t *orig_type);
3818 static type_t *semantic_parameter(const source_position_t *pos,
3820 const declaration_specifiers_t *specifiers,
3823 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3824 * shall be adjusted to ``qualified pointer to type'',
3826 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3827 * type'' shall be adjusted to ``pointer to function
3828 * returning type'', as in 6.3.2.1. */
3829 type = automatic_type_conversion(type);
3831 if (specifiers->is_inline && is_type_valid(type)) {
3832 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3835 /* §6.9.1:6 The declarations in the declaration list shall contain
3836 * no storage-class specifier other than register and no
3837 * initializations. */
3838 if (specifiers->thread_local || (
3839 specifiers->storage_class != STORAGE_CLASS_NONE &&
3840 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3842 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3845 /* delay test for incomplete type, because we might have (void)
3846 * which is legal but incomplete... */
3851 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3852 declarator_flags_t flags)
3854 parse_declarator_env_t env;
3855 memset(&env, 0, sizeof(env));
3856 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3858 construct_type_t *construct_type = parse_inner_declarator(&env);
3860 construct_declarator_type(construct_type, specifiers->type);
3861 type_t *type = skip_typeref(orig_type);
3863 if (construct_type != NULL) {
3864 obstack_free(&temp_obst, construct_type);
3867 attribute_t *attributes = parse_attributes(env.attributes);
3868 /* append (shared) specifier attribute behind attributes of this
3870 attribute_t **anchor = &attributes;
3871 while (*anchor != NULL)
3872 anchor = &(*anchor)->next;
3873 *anchor = specifiers->attributes;
3876 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3877 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3878 entity->base.source_position = env.source_position;
3879 entity->typedefe.type = orig_type;
3881 if (anonymous_entity != NULL) {
3882 if (is_type_compound(type)) {
3883 assert(anonymous_entity->compound.alias == NULL);
3884 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3885 anonymous_entity->kind == ENTITY_UNION);
3886 anonymous_entity->compound.alias = entity;
3887 anonymous_entity = NULL;
3888 } else if (is_type_enum(type)) {
3889 assert(anonymous_entity->enume.alias == NULL);
3890 assert(anonymous_entity->kind == ENTITY_ENUM);
3891 anonymous_entity->enume.alias = entity;
3892 anonymous_entity = NULL;
3896 /* create a declaration type entity */
3897 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3898 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3900 if (env.symbol != NULL) {
3901 if (specifiers->is_inline && is_type_valid(type)) {
3902 errorf(&env.source_position,
3903 "compound member '%Y' declared 'inline'", env.symbol);
3906 if (specifiers->thread_local ||
3907 specifiers->storage_class != STORAGE_CLASS_NONE) {
3908 errorf(&env.source_position,
3909 "compound member '%Y' must have no storage class",
3913 } else if (flags & DECL_IS_PARAMETER) {
3914 orig_type = semantic_parameter(&env.source_position, orig_type,
3915 specifiers, env.symbol);
3917 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3918 } else if (is_type_function(type)) {
3919 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3920 entity->function.is_inline = specifiers->is_inline;
3921 entity->function.elf_visibility = default_visibility;
3922 entity->function.parameters = env.parameters;
3924 if (env.symbol != NULL) {
3925 /* this needs fixes for C++ */
3926 bool in_function_scope = current_function != NULL;
3928 if (specifiers->thread_local || (
3929 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3930 specifiers->storage_class != STORAGE_CLASS_NONE &&
3931 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3933 errorf(&env.source_position,
3934 "invalid storage class for function '%Y'", env.symbol);
3938 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3939 entity->variable.elf_visibility = default_visibility;
3940 entity->variable.thread_local = specifiers->thread_local;
3942 if (env.symbol != NULL) {
3943 if (specifiers->is_inline && is_type_valid(type)) {
3944 errorf(&env.source_position,
3945 "variable '%Y' declared 'inline'", env.symbol);
3948 bool invalid_storage_class = false;
3949 if (current_scope == file_scope) {
3950 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3951 specifiers->storage_class != STORAGE_CLASS_NONE &&
3952 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3953 invalid_storage_class = true;
3956 if (specifiers->thread_local &&
3957 specifiers->storage_class == STORAGE_CLASS_NONE) {
3958 invalid_storage_class = true;
3961 if (invalid_storage_class) {
3962 errorf(&env.source_position,
3963 "invalid storage class for variable '%Y'", env.symbol);
3968 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3969 entity->declaration.type = orig_type;
3970 entity->declaration.alignment = get_type_alignment(orig_type);
3971 entity->declaration.modifiers = env.modifiers;
3972 entity->declaration.attributes = attributes;
3974 storage_class_t storage_class = specifiers->storage_class;
3975 entity->declaration.declared_storage_class = storage_class;
3977 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3978 storage_class = STORAGE_CLASS_AUTO;
3979 entity->declaration.storage_class = storage_class;
3982 if (attributes != NULL) {
3983 handle_entity_attributes(attributes, entity);
3989 static type_t *parse_abstract_declarator(type_t *base_type)
3991 parse_declarator_env_t env;
3992 memset(&env, 0, sizeof(env));
3993 env.may_be_abstract = true;
3994 env.must_be_abstract = true;
3996 construct_type_t *construct_type = parse_inner_declarator(&env);
3998 type_t *result = construct_declarator_type(construct_type, base_type);
3999 if (construct_type != NULL) {
4000 obstack_free(&temp_obst, construct_type);
4002 result = handle_type_attributes(env.attributes, result);
4008 * Check if the declaration of main is suspicious. main should be a
4009 * function with external linkage, returning int, taking either zero
4010 * arguments, two, or three arguments of appropriate types, ie.
4012 * int main([ int argc, char **argv [, char **env ] ]).
4014 * @param decl the declaration to check
4015 * @param type the function type of the declaration
4017 static void check_main(const entity_t *entity)
4019 const source_position_t *pos = &entity->base.source_position;
4020 if (entity->kind != ENTITY_FUNCTION) {
4021 warningf(pos, "'main' is not a function");
4025 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4026 warningf(pos, "'main' is normally a non-static function");
4029 type_t *type = skip_typeref(entity->declaration.type);
4030 assert(is_type_function(type));
4032 function_type_t *func_type = &type->function;
4033 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4034 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4035 func_type->return_type);
4037 const function_parameter_t *parm = func_type->parameters;
4039 type_t *const first_type = skip_typeref(parm->type);
4040 type_t *const first_type_unqual = get_unqualified_type(first_type);
4041 if (!types_compatible(first_type_unqual, type_int)) {
4043 "first argument of 'main' should be 'int', but is '%T'",
4048 type_t *const second_type = skip_typeref(parm->type);
4049 type_t *const second_type_unqual
4050 = get_unqualified_type(second_type);
4051 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
4052 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'",
4057 type_t *const third_type = skip_typeref(parm->type);
4058 type_t *const third_type_unqual
4059 = get_unqualified_type(third_type);
4060 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
4061 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'",
4066 goto warn_arg_count;
4070 warningf(pos, "'main' takes only zero, two or three arguments");
4076 * Check if a symbol is the equal to "main".
4078 static bool is_sym_main(const symbol_t *const sym)
4080 return strcmp(sym->string, "main") == 0;
4083 static void error_redefined_as_different_kind(const source_position_t *pos,
4084 const entity_t *old, entity_kind_t new_kind)
4086 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4087 get_entity_kind_name(old->kind), old->base.symbol,
4088 get_entity_kind_name(new_kind), &old->base.source_position);
4091 static bool is_entity_valid(entity_t *const ent)
4093 if (is_declaration(ent)) {
4094 return is_type_valid(skip_typeref(ent->declaration.type));
4095 } else if (ent->kind == ENTITY_TYPEDEF) {
4096 return is_type_valid(skip_typeref(ent->typedefe.type));
4101 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4103 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4104 if (attributes_equal(tattr, attr))
4111 * test wether new_list contains any attributes not included in old_list
4113 static bool has_new_attributes(const attribute_t *old_list,
4114 const attribute_t *new_list)
4116 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4117 if (!contains_attribute(old_list, attr))
4124 * Merge in attributes from an attribute list (probably from a previous
4125 * declaration with the same name). Warning: destroys the old structure
4126 * of the attribute list - don't reuse attributes after this call.
4128 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4131 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4133 if (contains_attribute(decl->attributes, attr))
4136 /* move attribute to new declarations attributes list */
4137 attr->next = decl->attributes;
4138 decl->attributes = attr;
4143 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4144 * for various problems that occur for multiple definitions
4146 entity_t *record_entity(entity_t *entity, const bool is_definition)
4148 const symbol_t *const symbol = entity->base.symbol;
4149 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4150 const source_position_t *pos = &entity->base.source_position;
4152 /* can happen in error cases */
4156 entity_t *const previous_entity = get_entity(symbol, namespc);
4157 /* pushing the same entity twice will break the stack structure */
4158 assert(previous_entity != entity);
4160 if (entity->kind == ENTITY_FUNCTION) {
4161 type_t *const orig_type = entity->declaration.type;
4162 type_t *const type = skip_typeref(orig_type);
4164 assert(is_type_function(type));
4165 if (type->function.unspecified_parameters &&
4166 warning.strict_prototypes &&
4167 previous_entity == NULL) {
4168 warningf(pos, "function declaration '%#T' is not a prototype",
4172 if (warning.main && current_scope == file_scope
4173 && is_sym_main(symbol)) {
4178 if (is_declaration(entity) &&
4179 warning.nested_externs &&
4180 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4181 current_scope != file_scope) {
4182 warningf(pos, "nested extern declaration of '%#T'",
4183 entity->declaration.type, symbol);
4186 if (previous_entity != NULL) {
4187 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4188 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4189 assert(previous_entity->kind == ENTITY_PARAMETER);
4191 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4192 entity->declaration.type, symbol,
4193 previous_entity->declaration.type, symbol,
4194 &previous_entity->base.source_position);
4198 if (previous_entity->base.parent_scope == current_scope) {
4199 if (previous_entity->kind != entity->kind) {
4200 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4201 error_redefined_as_different_kind(pos, previous_entity,
4206 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4207 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4208 symbol, &previous_entity->base.source_position);
4211 if (previous_entity->kind == ENTITY_TYPEDEF) {
4212 /* TODO: C++ allows this for exactly the same type */
4213 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4214 symbol, &previous_entity->base.source_position);
4218 /* at this point we should have only VARIABLES or FUNCTIONS */
4219 assert(is_declaration(previous_entity) && is_declaration(entity));
4221 declaration_t *const prev_decl = &previous_entity->declaration;
4222 declaration_t *const decl = &entity->declaration;
4224 /* can happen for K&R style declarations */
4225 if (prev_decl->type == NULL &&
4226 previous_entity->kind == ENTITY_PARAMETER &&
4227 entity->kind == ENTITY_PARAMETER) {
4228 prev_decl->type = decl->type;
4229 prev_decl->storage_class = decl->storage_class;
4230 prev_decl->declared_storage_class = decl->declared_storage_class;
4231 prev_decl->modifiers = decl->modifiers;
4232 return previous_entity;
4235 type_t *const orig_type = decl->type;
4236 assert(orig_type != NULL);
4237 type_t *const type = skip_typeref(orig_type);
4238 type_t *const prev_type = skip_typeref(prev_decl->type);
4240 if (!types_compatible(type, prev_type)) {
4242 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4243 orig_type, symbol, prev_decl->type, symbol,
4244 &previous_entity->base.source_position);
4246 unsigned old_storage_class = prev_decl->storage_class;
4248 if (warning.redundant_decls &&
4251 !(prev_decl->modifiers & DM_USED) &&
4252 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4253 warningf(&previous_entity->base.source_position,
4254 "unnecessary static forward declaration for '%#T'",
4255 prev_decl->type, symbol);
4258 storage_class_t new_storage_class = decl->storage_class;
4260 /* pretend no storage class means extern for function
4261 * declarations (except if the previous declaration is neither
4262 * none nor extern) */
4263 if (entity->kind == ENTITY_FUNCTION) {
4264 /* the previous declaration could have unspecified parameters or
4265 * be a typedef, so use the new type */
4266 if (prev_type->function.unspecified_parameters || is_definition)
4267 prev_decl->type = type;
4269 switch (old_storage_class) {
4270 case STORAGE_CLASS_NONE:
4271 old_storage_class = STORAGE_CLASS_EXTERN;
4274 case STORAGE_CLASS_EXTERN:
4275 if (is_definition) {
4276 if (warning.missing_prototypes &&
4277 prev_type->function.unspecified_parameters &&
4278 !is_sym_main(symbol)) {
4279 warningf(pos, "no previous prototype for '%#T'",
4282 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4283 new_storage_class = STORAGE_CLASS_EXTERN;
4290 } else if (is_type_incomplete(prev_type)) {
4291 prev_decl->type = type;
4294 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4295 new_storage_class == STORAGE_CLASS_EXTERN) {
4297 warn_redundant_declaration: ;
4299 = has_new_attributes(prev_decl->attributes,
4301 if (has_new_attrs) {
4302 merge_in_attributes(decl, prev_decl->attributes);
4303 } else if (!is_definition &&
4304 warning.redundant_decls &&
4305 is_type_valid(prev_type) &&
4306 strcmp(previous_entity->base.source_position.input_name,
4307 "<builtin>") != 0) {
4309 "redundant declaration for '%Y' (declared %P)",
4310 symbol, &previous_entity->base.source_position);
4312 } else if (current_function == NULL) {
4313 if (old_storage_class != STORAGE_CLASS_STATIC &&
4314 new_storage_class == STORAGE_CLASS_STATIC) {
4316 "static declaration of '%Y' follows non-static declaration (declared %P)",
4317 symbol, &previous_entity->base.source_position);
4318 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4319 prev_decl->storage_class = STORAGE_CLASS_NONE;
4320 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4322 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4324 goto error_redeclaration;
4325 goto warn_redundant_declaration;
4327 } else if (is_type_valid(prev_type)) {
4328 if (old_storage_class == new_storage_class) {
4329 error_redeclaration:
4330 errorf(pos, "redeclaration of '%Y' (declared %P)",
4331 symbol, &previous_entity->base.source_position);
4334 "redeclaration of '%Y' with different linkage (declared %P)",
4335 symbol, &previous_entity->base.source_position);
4340 prev_decl->modifiers |= decl->modifiers;
4341 if (entity->kind == ENTITY_FUNCTION) {
4342 previous_entity->function.is_inline |= entity->function.is_inline;
4344 return previous_entity;
4347 if (warning.shadow ||
4348 (warning.shadow_local && previous_entity->base.parent_scope != file_scope)) {
4349 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4350 get_entity_kind_name(entity->kind), symbol,
4351 get_entity_kind_name(previous_entity->kind),
4352 &previous_entity->base.source_position);
4356 if (entity->kind == ENTITY_FUNCTION) {
4357 if (is_definition &&
4358 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4359 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4360 warningf(pos, "no previous prototype for '%#T'",
4361 entity->declaration.type, symbol);
4362 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4363 warningf(pos, "no previous declaration for '%#T'",
4364 entity->declaration.type, symbol);
4367 } else if (warning.missing_declarations &&
4368 entity->kind == ENTITY_VARIABLE &&
4369 current_scope == file_scope) {
4370 declaration_t *declaration = &entity->declaration;
4371 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4372 warningf(pos, "no previous declaration for '%#T'",
4373 declaration->type, symbol);
4378 assert(entity->base.parent_scope == NULL);
4379 assert(current_scope != NULL);
4381 entity->base.parent_scope = current_scope;
4382 environment_push(entity);
4383 append_entity(current_scope, entity);
4388 static void parser_error_multiple_definition(entity_t *entity,
4389 const source_position_t *source_position)
4391 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4392 entity->base.symbol, &entity->base.source_position);
4395 static bool is_declaration_specifier(const token_t *token,
4396 bool only_specifiers_qualifiers)
4398 switch (token->type) {
4403 return is_typedef_symbol(token->symbol);
4405 case T___extension__:
4407 return !only_specifiers_qualifiers;
4414 static void parse_init_declarator_rest(entity_t *entity)
4416 type_t *orig_type = type_error_type;
4418 if (entity->base.kind == ENTITY_TYPEDEF) {
4419 errorf(&entity->base.source_position,
4420 "typedef '%Y' is initialized (use __typeof__ instead)",
4421 entity->base.symbol);
4423 assert(is_declaration(entity));
4424 orig_type = entity->declaration.type;
4428 type_t *type = skip_typeref(orig_type);
4430 if (entity->kind == ENTITY_VARIABLE
4431 && entity->variable.initializer != NULL) {
4432 parser_error_multiple_definition(entity, HERE);
4435 declaration_t *const declaration = &entity->declaration;
4436 bool must_be_constant = false;
4437 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4438 entity->base.parent_scope == file_scope) {
4439 must_be_constant = true;
4442 if (is_type_function(type)) {
4443 errorf(&entity->base.source_position,
4444 "function '%#T' is initialized like a variable",
4445 orig_type, entity->base.symbol);
4446 orig_type = type_error_type;
4449 parse_initializer_env_t env;
4450 env.type = orig_type;
4451 env.must_be_constant = must_be_constant;
4452 env.entity = entity;
4453 current_init_decl = entity;
4455 initializer_t *initializer = parse_initializer(&env);
4456 current_init_decl = NULL;
4458 if (entity->kind == ENTITY_VARIABLE) {
4459 /* §6.7.5:22 array initializers for arrays with unknown size
4460 * determine the array type size */
4461 declaration->type = env.type;
4462 entity->variable.initializer = initializer;
4466 /* parse rest of a declaration without any declarator */
4467 static void parse_anonymous_declaration_rest(
4468 const declaration_specifiers_t *specifiers)
4471 anonymous_entity = NULL;
4473 if (warning.other) {
4474 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4475 specifiers->thread_local) {
4476 warningf(&specifiers->source_position,
4477 "useless storage class in empty declaration");
4480 type_t *type = specifiers->type;
4481 switch (type->kind) {
4482 case TYPE_COMPOUND_STRUCT:
4483 case TYPE_COMPOUND_UNION: {
4484 if (type->compound.compound->base.symbol == NULL) {
4485 warningf(&specifiers->source_position,
4486 "unnamed struct/union that defines no instances");
4495 warningf(&specifiers->source_position, "empty declaration");
4501 static void check_variable_type_complete(entity_t *ent)
4503 if (ent->kind != ENTITY_VARIABLE)
4506 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4507 * type for the object shall be complete [...] */
4508 declaration_t *decl = &ent->declaration;
4509 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4510 decl->storage_class == STORAGE_CLASS_STATIC)
4513 type_t *const orig_type = decl->type;
4514 type_t *const type = skip_typeref(orig_type);
4515 if (!is_type_incomplete(type))
4518 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4519 * are given length one. */
4520 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4521 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4525 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4526 orig_type, ent->base.symbol);
4530 static void parse_declaration_rest(entity_t *ndeclaration,
4531 const declaration_specifiers_t *specifiers,
4532 parsed_declaration_func finished_declaration,
4533 declarator_flags_t flags)
4535 add_anchor_token(';');
4536 add_anchor_token(',');
4538 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4540 if (token.type == '=') {
4541 parse_init_declarator_rest(entity);
4542 } else if (entity->kind == ENTITY_VARIABLE) {
4543 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4544 * [...] where the extern specifier is explicitly used. */
4545 declaration_t *decl = &entity->declaration;
4546 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4547 type_t *type = decl->type;
4548 if (is_type_reference(skip_typeref(type))) {
4549 errorf(&entity->base.source_position,
4550 "reference '%#T' must be initialized",
4551 type, entity->base.symbol);
4556 check_variable_type_complete(entity);
4561 add_anchor_token('=');
4562 ndeclaration = parse_declarator(specifiers, flags);
4563 rem_anchor_token('=');
4565 expect(';', end_error);
4568 anonymous_entity = NULL;
4569 rem_anchor_token(';');
4570 rem_anchor_token(',');
4573 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4575 symbol_t *symbol = entity->base.symbol;
4579 assert(entity->base.namespc == NAMESPACE_NORMAL);
4580 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4581 if (previous_entity == NULL
4582 || previous_entity->base.parent_scope != current_scope) {
4583 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4588 if (is_definition) {
4589 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4592 return record_entity(entity, false);
4595 static void parse_declaration(parsed_declaration_func finished_declaration,
4596 declarator_flags_t flags)
4598 add_anchor_token(';');
4599 declaration_specifiers_t specifiers;
4600 parse_declaration_specifiers(&specifiers);
4601 rem_anchor_token(';');
4603 if (token.type == ';') {
4604 parse_anonymous_declaration_rest(&specifiers);
4606 entity_t *entity = parse_declarator(&specifiers, flags);
4607 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4612 static type_t *get_default_promoted_type(type_t *orig_type)
4614 type_t *result = orig_type;
4616 type_t *type = skip_typeref(orig_type);
4617 if (is_type_integer(type)) {
4618 result = promote_integer(type);
4619 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4620 result = type_double;
4626 static void parse_kr_declaration_list(entity_t *entity)
4628 if (entity->kind != ENTITY_FUNCTION)
4631 type_t *type = skip_typeref(entity->declaration.type);
4632 assert(is_type_function(type));
4633 if (!type->function.kr_style_parameters)
4636 add_anchor_token('{');
4638 /* push function parameters */
4639 size_t const top = environment_top();
4640 scope_t *old_scope = scope_push(&entity->function.parameters);
4642 entity_t *parameter = entity->function.parameters.entities;
4643 for ( ; parameter != NULL; parameter = parameter->base.next) {
4644 assert(parameter->base.parent_scope == NULL);
4645 parameter->base.parent_scope = current_scope;
4646 environment_push(parameter);
4649 /* parse declaration list */
4651 switch (token.type) {
4653 case T___extension__:
4654 /* This covers symbols, which are no type, too, and results in
4655 * better error messages. The typical cases are misspelled type
4656 * names and missing includes. */
4658 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4666 /* pop function parameters */
4667 assert(current_scope == &entity->function.parameters);
4668 scope_pop(old_scope);
4669 environment_pop_to(top);
4671 /* update function type */
4672 type_t *new_type = duplicate_type(type);
4674 function_parameter_t *parameters = NULL;
4675 function_parameter_t **anchor = ¶meters;
4677 /* did we have an earlier prototype? */
4678 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4679 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4682 function_parameter_t *proto_parameter = NULL;
4683 if (proto_type != NULL) {
4684 type_t *proto_type_type = proto_type->declaration.type;
4685 proto_parameter = proto_type_type->function.parameters;
4686 /* If a K&R function definition has a variadic prototype earlier, then
4687 * make the function definition variadic, too. This should conform to
4688 * §6.7.5.3:15 and §6.9.1:8. */
4689 new_type->function.variadic = proto_type_type->function.variadic;
4691 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4693 new_type->function.unspecified_parameters = true;
4696 bool need_incompatible_warning = false;
4697 parameter = entity->function.parameters.entities;
4698 for (; parameter != NULL; parameter = parameter->base.next,
4700 proto_parameter == NULL ? NULL : proto_parameter->next) {
4701 if (parameter->kind != ENTITY_PARAMETER)
4704 type_t *parameter_type = parameter->declaration.type;
4705 if (parameter_type == NULL) {
4707 errorf(HERE, "no type specified for function parameter '%Y'",
4708 parameter->base.symbol);
4709 parameter_type = type_error_type;
4711 if (warning.implicit_int) {
4712 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4713 parameter->base.symbol);
4715 parameter_type = type_int;
4717 parameter->declaration.type = parameter_type;
4720 semantic_parameter_incomplete(parameter);
4722 /* we need the default promoted types for the function type */
4723 type_t *not_promoted = parameter_type;
4724 parameter_type = get_default_promoted_type(parameter_type);
4726 /* gcc special: if the type of the prototype matches the unpromoted
4727 * type don't promote */
4728 if (!strict_mode && proto_parameter != NULL) {
4729 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4730 type_t *promo_skip = skip_typeref(parameter_type);
4731 type_t *param_skip = skip_typeref(not_promoted);
4732 if (!types_compatible(proto_p_type, promo_skip)
4733 && types_compatible(proto_p_type, param_skip)) {
4735 need_incompatible_warning = true;
4736 parameter_type = not_promoted;
4739 function_parameter_t *const parameter
4740 = allocate_parameter(parameter_type);
4742 *anchor = parameter;
4743 anchor = ¶meter->next;
4746 new_type->function.parameters = parameters;
4747 new_type = identify_new_type(new_type);
4749 if (warning.other && need_incompatible_warning) {
4750 type_t *proto_type_type = proto_type->declaration.type;
4752 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4753 proto_type_type, proto_type->base.symbol,
4754 new_type, entity->base.symbol,
4755 &proto_type->base.source_position);
4758 entity->declaration.type = new_type;
4760 rem_anchor_token('{');
4763 static bool first_err = true;
4766 * When called with first_err set, prints the name of the current function,
4769 static void print_in_function(void)
4773 diagnosticf("%s: In function '%Y':\n",
4774 current_function->base.base.source_position.input_name,
4775 current_function->base.base.symbol);
4780 * Check if all labels are defined in the current function.
4781 * Check if all labels are used in the current function.
4783 static void check_labels(void)
4785 for (const goto_statement_t *goto_statement = goto_first;
4786 goto_statement != NULL;
4787 goto_statement = goto_statement->next) {
4788 /* skip computed gotos */
4789 if (goto_statement->expression != NULL)
4792 label_t *label = goto_statement->label;
4795 if (label->base.source_position.input_name == NULL) {
4796 print_in_function();
4797 errorf(&goto_statement->base.source_position,
4798 "label '%Y' used but not defined", label->base.symbol);
4802 if (warning.unused_label) {
4803 for (const label_statement_t *label_statement = label_first;
4804 label_statement != NULL;
4805 label_statement = label_statement->next) {
4806 label_t *label = label_statement->label;
4808 if (! label->used) {
4809 print_in_function();
4810 warningf(&label_statement->base.source_position,
4811 "label '%Y' defined but not used", label->base.symbol);
4817 static void warn_unused_entity(entity_t *entity, entity_t *last)
4819 entity_t const *const end = last != NULL ? last->base.next : NULL;
4820 for (; entity != end; entity = entity->base.next) {
4821 if (!is_declaration(entity))
4824 declaration_t *declaration = &entity->declaration;
4825 if (declaration->implicit)
4828 if (!declaration->used) {
4829 print_in_function();
4830 const char *what = get_entity_kind_name(entity->kind);
4831 warningf(&entity->base.source_position, "%s '%Y' is unused",
4832 what, entity->base.symbol);
4833 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4834 print_in_function();
4835 const char *what = get_entity_kind_name(entity->kind);
4836 warningf(&entity->base.source_position, "%s '%Y' is never read",
4837 what, entity->base.symbol);
4842 static void check_unused_variables(statement_t *const stmt, void *const env)
4846 switch (stmt->kind) {
4847 case STATEMENT_DECLARATION: {
4848 declaration_statement_t const *const decls = &stmt->declaration;
4849 warn_unused_entity(decls->declarations_begin,
4850 decls->declarations_end);
4855 warn_unused_entity(stmt->fors.scope.entities, NULL);
4864 * Check declarations of current_function for unused entities.
4866 static void check_declarations(void)
4868 if (warning.unused_parameter) {
4869 const scope_t *scope = ¤t_function->parameters;
4871 /* do not issue unused warnings for main */
4872 if (!is_sym_main(current_function->base.base.symbol)) {
4873 warn_unused_entity(scope->entities, NULL);
4876 if (warning.unused_variable) {
4877 walk_statements(current_function->statement, check_unused_variables,
4882 static int determine_truth(expression_t const* const cond)
4885 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4886 fold_constant_to_bool(cond) ? 1 :
4890 static void check_reachable(statement_t *);
4891 static bool reaches_end;
4893 static bool expression_returns(expression_t const *const expr)
4895 switch (expr->kind) {
4897 expression_t const *const func = expr->call.function;
4898 if (func->kind == EXPR_REFERENCE) {
4899 entity_t *entity = func->reference.entity;
4900 if (entity->kind == ENTITY_FUNCTION
4901 && entity->declaration.modifiers & DM_NORETURN)
4905 if (!expression_returns(func))
4908 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4909 if (!expression_returns(arg->expression))
4916 case EXPR_REFERENCE:
4917 case EXPR_REFERENCE_ENUM_VALUE:
4919 case EXPR_STRING_LITERAL:
4920 case EXPR_WIDE_STRING_LITERAL:
4921 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4922 case EXPR_LABEL_ADDRESS:
4923 case EXPR_CLASSIFY_TYPE:
4924 case EXPR_SIZEOF: // TODO handle obscure VLA case
4927 case EXPR_BUILTIN_CONSTANT_P:
4928 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4933 case EXPR_STATEMENT: {
4934 bool old_reaches_end = reaches_end;
4935 reaches_end = false;
4936 check_reachable(expr->statement.statement);
4937 bool returns = reaches_end;
4938 reaches_end = old_reaches_end;
4942 case EXPR_CONDITIONAL:
4943 // TODO handle constant expression
4945 if (!expression_returns(expr->conditional.condition))
4948 if (expr->conditional.true_expression != NULL
4949 && expression_returns(expr->conditional.true_expression))
4952 return expression_returns(expr->conditional.false_expression);
4955 return expression_returns(expr->select.compound);
4957 case EXPR_ARRAY_ACCESS:
4959 expression_returns(expr->array_access.array_ref) &&
4960 expression_returns(expr->array_access.index);
4963 return expression_returns(expr->va_starte.ap);
4966 return expression_returns(expr->va_arge.ap);
4969 return expression_returns(expr->va_copye.src);
4971 EXPR_UNARY_CASES_MANDATORY
4972 return expression_returns(expr->unary.value);
4974 case EXPR_UNARY_THROW:
4978 // TODO handle constant lhs of && and ||
4980 expression_returns(expr->binary.left) &&
4981 expression_returns(expr->binary.right);
4987 panic("unhandled expression");
4990 static bool initializer_returns(initializer_t const *const init)
4992 switch (init->kind) {
4993 case INITIALIZER_VALUE:
4994 return expression_returns(init->value.value);
4996 case INITIALIZER_LIST: {
4997 initializer_t * const* i = init->list.initializers;
4998 initializer_t * const* const end = i + init->list.len;
4999 bool returns = true;
5000 for (; i != end; ++i) {
5001 if (!initializer_returns(*i))
5007 case INITIALIZER_STRING:
5008 case INITIALIZER_WIDE_STRING:
5009 case INITIALIZER_DESIGNATOR: // designators have no payload
5012 panic("unhandled initializer");
5015 static bool noreturn_candidate;
5017 static void check_reachable(statement_t *const stmt)
5019 if (stmt->base.reachable)
5021 if (stmt->kind != STATEMENT_DO_WHILE)
5022 stmt->base.reachable = true;
5024 statement_t *last = stmt;
5026 switch (stmt->kind) {
5027 case STATEMENT_INVALID:
5028 case STATEMENT_EMPTY:
5030 next = stmt->base.next;
5033 case STATEMENT_DECLARATION: {
5034 declaration_statement_t const *const decl = &stmt->declaration;
5035 entity_t const * ent = decl->declarations_begin;
5036 entity_t const *const last = decl->declarations_end;
5038 for (;; ent = ent->base.next) {
5039 if (ent->kind == ENTITY_VARIABLE &&
5040 ent->variable.initializer != NULL &&
5041 !initializer_returns(ent->variable.initializer)) {
5048 next = stmt->base.next;
5052 case STATEMENT_COMPOUND:
5053 next = stmt->compound.statements;
5055 next = stmt->base.next;
5058 case STATEMENT_RETURN: {
5059 expression_t const *const val = stmt->returns.value;
5060 if (val == NULL || expression_returns(val))
5061 noreturn_candidate = false;
5065 case STATEMENT_IF: {
5066 if_statement_t const *const ifs = &stmt->ifs;
5067 expression_t const *const cond = ifs->condition;
5069 if (!expression_returns(cond))
5072 int const val = determine_truth(cond);
5075 check_reachable(ifs->true_statement);
5080 if (ifs->false_statement != NULL) {
5081 check_reachable(ifs->false_statement);
5085 next = stmt->base.next;
5089 case STATEMENT_SWITCH: {
5090 switch_statement_t const *const switchs = &stmt->switchs;
5091 expression_t const *const expr = switchs->expression;
5093 if (!expression_returns(expr))
5096 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
5097 long const val = fold_constant_to_int(expr);
5098 case_label_statement_t * defaults = NULL;
5099 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5100 if (i->expression == NULL) {
5105 if (i->first_case <= val && val <= i->last_case) {
5106 check_reachable((statement_t*)i);
5111 if (defaults != NULL) {
5112 check_reachable((statement_t*)defaults);
5116 bool has_default = false;
5117 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5118 if (i->expression == NULL)
5121 check_reachable((statement_t*)i);
5128 next = stmt->base.next;
5132 case STATEMENT_EXPRESSION: {
5133 /* Check for noreturn function call */
5134 expression_t const *const expr = stmt->expression.expression;
5135 if (!expression_returns(expr))
5138 next = stmt->base.next;
5142 case STATEMENT_CONTINUE:
5143 for (statement_t *parent = stmt;;) {
5144 parent = parent->base.parent;
5145 if (parent == NULL) /* continue not within loop */
5149 switch (parent->kind) {
5150 case STATEMENT_WHILE: goto continue_while;
5151 case STATEMENT_DO_WHILE: goto continue_do_while;
5152 case STATEMENT_FOR: goto continue_for;
5158 case STATEMENT_BREAK:
5159 for (statement_t *parent = stmt;;) {
5160 parent = parent->base.parent;
5161 if (parent == NULL) /* break not within loop/switch */
5164 switch (parent->kind) {
5165 case STATEMENT_SWITCH:
5166 case STATEMENT_WHILE:
5167 case STATEMENT_DO_WHILE:
5170 next = parent->base.next;
5171 goto found_break_parent;
5179 case STATEMENT_GOTO:
5180 if (stmt->gotos.expression) {
5181 if (!expression_returns(stmt->gotos.expression))
5184 statement_t *parent = stmt->base.parent;
5185 if (parent == NULL) /* top level goto */
5189 next = stmt->gotos.label->statement;
5190 if (next == NULL) /* missing label */
5195 case STATEMENT_LABEL:
5196 next = stmt->label.statement;
5199 case STATEMENT_CASE_LABEL:
5200 next = stmt->case_label.statement;
5203 case STATEMENT_WHILE: {
5204 while_statement_t const *const whiles = &stmt->whiles;
5205 expression_t const *const cond = whiles->condition;
5207 if (!expression_returns(cond))
5210 int const val = determine_truth(cond);
5213 check_reachable(whiles->body);
5218 next = stmt->base.next;
5222 case STATEMENT_DO_WHILE:
5223 next = stmt->do_while.body;
5226 case STATEMENT_FOR: {
5227 for_statement_t *const fors = &stmt->fors;
5229 if (fors->condition_reachable)
5231 fors->condition_reachable = true;
5233 expression_t const *const cond = fors->condition;
5238 } else if (expression_returns(cond)) {
5239 val = determine_truth(cond);
5245 check_reachable(fors->body);
5250 next = stmt->base.next;
5254 case STATEMENT_MS_TRY: {
5255 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5256 check_reachable(ms_try->try_statement);
5257 next = ms_try->final_statement;
5261 case STATEMENT_LEAVE: {
5262 statement_t *parent = stmt;
5264 parent = parent->base.parent;
5265 if (parent == NULL) /* __leave not within __try */
5268 if (parent->kind == STATEMENT_MS_TRY) {
5270 next = parent->ms_try.final_statement;
5278 panic("invalid statement kind");
5281 while (next == NULL) {
5282 next = last->base.parent;
5284 noreturn_candidate = false;
5286 type_t *const type = skip_typeref(current_function->base.type);
5287 assert(is_type_function(type));
5288 type_t *const ret = skip_typeref(type->function.return_type);
5289 if (warning.return_type &&
5290 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5291 is_type_valid(ret) &&
5292 !is_sym_main(current_function->base.base.symbol)) {
5293 warningf(&stmt->base.source_position,
5294 "control reaches end of non-void function");
5299 switch (next->kind) {
5300 case STATEMENT_INVALID:
5301 case STATEMENT_EMPTY:
5302 case STATEMENT_DECLARATION:
5303 case STATEMENT_EXPRESSION:
5305 case STATEMENT_RETURN:
5306 case STATEMENT_CONTINUE:
5307 case STATEMENT_BREAK:
5308 case STATEMENT_GOTO:
5309 case STATEMENT_LEAVE:
5310 panic("invalid control flow in function");
5312 case STATEMENT_COMPOUND:
5313 if (next->compound.stmt_expr) {
5319 case STATEMENT_SWITCH:
5320 case STATEMENT_LABEL:
5321 case STATEMENT_CASE_LABEL:
5323 next = next->base.next;
5326 case STATEMENT_WHILE: {
5328 if (next->base.reachable)
5330 next->base.reachable = true;
5332 while_statement_t const *const whiles = &next->whiles;
5333 expression_t const *const cond = whiles->condition;
5335 if (!expression_returns(cond))
5338 int const val = determine_truth(cond);
5341 check_reachable(whiles->body);
5347 next = next->base.next;
5351 case STATEMENT_DO_WHILE: {
5353 if (next->base.reachable)
5355 next->base.reachable = true;
5357 do_while_statement_t const *const dw = &next->do_while;
5358 expression_t const *const cond = dw->condition;
5360 if (!expression_returns(cond))
5363 int const val = determine_truth(cond);
5366 check_reachable(dw->body);
5372 next = next->base.next;
5376 case STATEMENT_FOR: {
5378 for_statement_t *const fors = &next->fors;
5380 fors->step_reachable = true;
5382 if (fors->condition_reachable)
5384 fors->condition_reachable = true;
5386 expression_t const *const cond = fors->condition;
5391 } else if (expression_returns(cond)) {
5392 val = determine_truth(cond);
5398 check_reachable(fors->body);
5404 next = next->base.next;
5408 case STATEMENT_MS_TRY:
5410 next = next->ms_try.final_statement;
5415 check_reachable(next);
5418 static void check_unreachable(statement_t* const stmt, void *const env)
5422 switch (stmt->kind) {
5423 case STATEMENT_DO_WHILE:
5424 if (!stmt->base.reachable) {
5425 expression_t const *const cond = stmt->do_while.condition;
5426 if (determine_truth(cond) >= 0) {
5427 warningf(&cond->base.source_position,
5428 "condition of do-while-loop is unreachable");
5433 case STATEMENT_FOR: {
5434 for_statement_t const* const fors = &stmt->fors;
5436 // if init and step are unreachable, cond is unreachable, too
5437 if (!stmt->base.reachable && !fors->step_reachable) {
5438 warningf(&stmt->base.source_position, "statement is unreachable");
5440 if (!stmt->base.reachable && fors->initialisation != NULL) {
5441 warningf(&fors->initialisation->base.source_position,
5442 "initialisation of for-statement is unreachable");
5445 if (!fors->condition_reachable && fors->condition != NULL) {
5446 warningf(&fors->condition->base.source_position,
5447 "condition of for-statement is unreachable");
5450 if (!fors->step_reachable && fors->step != NULL) {
5451 warningf(&fors->step->base.source_position,
5452 "step of for-statement is unreachable");
5458 case STATEMENT_COMPOUND:
5459 if (stmt->compound.statements != NULL)
5461 goto warn_unreachable;
5463 case STATEMENT_DECLARATION: {
5464 /* Only warn if there is at least one declarator with an initializer.
5465 * This typically occurs in switch statements. */
5466 declaration_statement_t const *const decl = &stmt->declaration;
5467 entity_t const * ent = decl->declarations_begin;
5468 entity_t const *const last = decl->declarations_end;
5470 for (;; ent = ent->base.next) {
5471 if (ent->kind == ENTITY_VARIABLE &&
5472 ent->variable.initializer != NULL) {
5473 goto warn_unreachable;
5483 if (!stmt->base.reachable)
5484 warningf(&stmt->base.source_position, "statement is unreachable");
5489 static void parse_external_declaration(void)
5491 /* function-definitions and declarations both start with declaration
5493 add_anchor_token(';');
5494 declaration_specifiers_t specifiers;
5495 parse_declaration_specifiers(&specifiers);
5496 rem_anchor_token(';');
5498 /* must be a declaration */
5499 if (token.type == ';') {
5500 parse_anonymous_declaration_rest(&specifiers);
5504 add_anchor_token(',');
5505 add_anchor_token('=');
5506 add_anchor_token(';');
5507 add_anchor_token('{');
5509 /* declarator is common to both function-definitions and declarations */
5510 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5512 rem_anchor_token('{');
5513 rem_anchor_token(';');
5514 rem_anchor_token('=');
5515 rem_anchor_token(',');
5517 /* must be a declaration */
5518 switch (token.type) {
5522 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5527 /* must be a function definition */
5528 parse_kr_declaration_list(ndeclaration);
5530 if (token.type != '{') {
5531 parse_error_expected("while parsing function definition", '{', NULL);
5532 eat_until_matching_token(';');
5536 assert(is_declaration(ndeclaration));
5537 type_t *const orig_type = ndeclaration->declaration.type;
5538 type_t * type = skip_typeref(orig_type);
5540 if (!is_type_function(type)) {
5541 if (is_type_valid(type)) {
5542 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5543 type, ndeclaration->base.symbol);
5547 } else if (is_typeref(orig_type)) {
5549 errorf(&ndeclaration->base.source_position,
5550 "type of function definition '%#T' is a typedef",
5551 orig_type, ndeclaration->base.symbol);
5554 if (warning.aggregate_return &&
5555 is_type_compound(skip_typeref(type->function.return_type))) {
5556 warningf(&ndeclaration->base.source_position, "function '%Y' returns an aggregate",
5557 ndeclaration->base.symbol);
5559 if (warning.traditional && !type->function.unspecified_parameters) {
5560 warningf(&ndeclaration->base.source_position, "traditional C rejects ISO C style function definition of function '%Y'",
5561 ndeclaration->base.symbol);
5563 if (warning.old_style_definition && type->function.unspecified_parameters) {
5564 warningf(&ndeclaration->base.source_position, "old-style function definition '%Y'",
5565 ndeclaration->base.symbol);
5568 /* §6.7.5.3:14 a function definition with () means no
5569 * parameters (and not unspecified parameters) */
5570 if (type->function.unspecified_parameters &&
5571 type->function.parameters == NULL) {
5572 type_t *copy = duplicate_type(type);
5573 copy->function.unspecified_parameters = false;
5574 type = identify_new_type(copy);
5576 ndeclaration->declaration.type = type;
5579 entity_t *const entity = record_entity(ndeclaration, true);
5580 assert(entity->kind == ENTITY_FUNCTION);
5581 assert(ndeclaration->kind == ENTITY_FUNCTION);
5583 function_t *const function = &entity->function;
5584 if (ndeclaration != entity) {
5585 function->parameters = ndeclaration->function.parameters;
5587 assert(is_declaration(entity));
5588 type = skip_typeref(entity->declaration.type);
5590 /* push function parameters and switch scope */
5591 size_t const top = environment_top();
5592 scope_t *old_scope = scope_push(&function->parameters);
5594 entity_t *parameter = function->parameters.entities;
5595 for (; parameter != NULL; parameter = parameter->base.next) {
5596 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5597 parameter->base.parent_scope = current_scope;
5599 assert(parameter->base.parent_scope == NULL
5600 || parameter->base.parent_scope == current_scope);
5601 parameter->base.parent_scope = current_scope;
5602 if (parameter->base.symbol == NULL) {
5603 errorf(¶meter->base.source_position, "parameter name omitted");
5606 environment_push(parameter);
5609 if (function->statement != NULL) {
5610 parser_error_multiple_definition(entity, HERE);
5613 /* parse function body */
5614 int label_stack_top = label_top();
5615 function_t *old_current_function = current_function;
5616 entity_t *old_current_entity = current_entity;
5617 current_function = function;
5618 current_entity = entity;
5619 current_parent = NULL;
5622 goto_anchor = &goto_first;
5624 label_anchor = &label_first;
5626 statement_t *const body = parse_compound_statement(false);
5627 function->statement = body;
5630 check_declarations();
5631 if (warning.return_type ||
5632 warning.unreachable_code ||
5633 (warning.missing_noreturn
5634 && !(function->base.modifiers & DM_NORETURN))) {
5635 noreturn_candidate = true;
5636 check_reachable(body);
5637 if (warning.unreachable_code)
5638 walk_statements(body, check_unreachable, NULL);
5639 if (warning.missing_noreturn &&
5640 noreturn_candidate &&
5641 !(function->base.modifiers & DM_NORETURN)) {
5642 warningf(&body->base.source_position,
5643 "function '%#T' is candidate for attribute 'noreturn'",
5644 type, entity->base.symbol);
5648 assert(current_parent == NULL);
5649 assert(current_function == function);
5650 assert(current_entity == entity);
5651 current_entity = old_current_entity;
5652 current_function = old_current_function;
5653 label_pop_to(label_stack_top);
5656 assert(current_scope == &function->parameters);
5657 scope_pop(old_scope);
5658 environment_pop_to(top);
5661 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5662 source_position_t *source_position,
5663 const symbol_t *symbol)
5665 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5667 type->bitfield.base_type = base_type;
5668 type->bitfield.size_expression = size;
5671 type_t *skipped_type = skip_typeref(base_type);
5672 if (!is_type_integer(skipped_type)) {
5673 errorf(HERE, "bitfield base type '%T' is not an integer type",
5677 bit_size = get_type_size(base_type) * 8;
5680 if (is_constant_expression(size) == EXPR_CLASS_CONSTANT) {
5681 long v = fold_constant_to_int(size);
5682 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5685 errorf(source_position, "negative width in bit-field '%Y'",
5687 } else if (v == 0 && symbol != NULL) {
5688 errorf(source_position, "zero width for bit-field '%Y'",
5690 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5691 errorf(source_position, "width of '%Y' exceeds its type",
5694 type->bitfield.bit_size = v;
5701 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5703 entity_t *iter = compound->members.entities;
5704 for (; iter != NULL; iter = iter->base.next) {
5705 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5708 if (iter->base.symbol == symbol) {
5710 } else if (iter->base.symbol == NULL) {
5711 /* search in anonymous structs and unions */
5712 type_t *type = skip_typeref(iter->declaration.type);
5713 if (is_type_compound(type)) {
5714 if (find_compound_entry(type->compound.compound, symbol)
5725 static void check_deprecated(const source_position_t *source_position,
5726 const entity_t *entity)
5728 if (!warning.deprecated_declarations)
5730 if (!is_declaration(entity))
5732 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5735 char const *const prefix = get_entity_kind_name(entity->kind);
5736 const char *deprecated_string
5737 = get_deprecated_string(entity->declaration.attributes);
5738 if (deprecated_string != NULL) {
5739 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5740 prefix, entity->base.symbol, &entity->base.source_position,
5743 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5744 entity->base.symbol, &entity->base.source_position);
5749 static expression_t *create_select(const source_position_t *pos,
5751 type_qualifiers_t qualifiers,
5754 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5756 check_deprecated(pos, entry);
5758 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5759 select->select.compound = addr;
5760 select->select.compound_entry = entry;
5762 type_t *entry_type = entry->declaration.type;
5763 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5765 /* we always do the auto-type conversions; the & and sizeof parser contains
5766 * code to revert this! */
5767 select->base.type = automatic_type_conversion(res_type);
5768 if (res_type->kind == TYPE_BITFIELD) {
5769 select->base.type = res_type->bitfield.base_type;
5776 * Find entry with symbol in compound. Search anonymous structs and unions and
5777 * creates implicit select expressions for them.
5778 * Returns the adress for the innermost compound.
5780 static expression_t *find_create_select(const source_position_t *pos,
5782 type_qualifiers_t qualifiers,
5783 compound_t *compound, symbol_t *symbol)
5785 entity_t *iter = compound->members.entities;
5786 for (; iter != NULL; iter = iter->base.next) {
5787 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5790 symbol_t *iter_symbol = iter->base.symbol;
5791 if (iter_symbol == NULL) {
5792 type_t *type = iter->declaration.type;
5793 if (type->kind != TYPE_COMPOUND_STRUCT
5794 && type->kind != TYPE_COMPOUND_UNION)
5797 compound_t *sub_compound = type->compound.compound;
5799 if (find_compound_entry(sub_compound, symbol) == NULL)
5802 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5803 sub_addr->base.source_position = *pos;
5804 sub_addr->select.implicit = true;
5805 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5809 if (iter_symbol == symbol) {
5810 return create_select(pos, addr, qualifiers, iter);
5817 static void parse_compound_declarators(compound_t *compound,
5818 const declaration_specifiers_t *specifiers)
5823 if (token.type == ':') {
5824 source_position_t source_position = *HERE;
5827 type_t *base_type = specifiers->type;
5828 expression_t *size = parse_constant_expression();
5830 type_t *type = make_bitfield_type(base_type, size,
5831 &source_position, NULL);
5833 attribute_t *attributes = parse_attributes(NULL);
5834 attribute_t **anchor = &attributes;
5835 while (*anchor != NULL)
5836 anchor = &(*anchor)->next;
5837 *anchor = specifiers->attributes;
5839 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL);
5840 entity->base.source_position = source_position;
5841 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5842 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5843 entity->declaration.type = type;
5844 entity->declaration.attributes = attributes;
5846 if (attributes != NULL) {
5847 handle_entity_attributes(attributes, entity);
5849 append_entity(&compound->members, entity);
5851 entity = parse_declarator(specifiers,
5852 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5853 if (entity->kind == ENTITY_TYPEDEF) {
5854 errorf(&entity->base.source_position,
5855 "typedef not allowed as compound member");
5857 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5859 /* make sure we don't define a symbol multiple times */
5860 symbol_t *symbol = entity->base.symbol;
5861 if (symbol != NULL) {
5862 entity_t *prev = find_compound_entry(compound, symbol);
5864 errorf(&entity->base.source_position,
5865 "multiple declarations of symbol '%Y' (declared %P)",
5866 symbol, &prev->base.source_position);
5870 if (token.type == ':') {
5871 source_position_t source_position = *HERE;
5873 expression_t *size = parse_constant_expression();
5875 type_t *type = entity->declaration.type;
5876 type_t *bitfield_type = make_bitfield_type(type, size,
5877 &source_position, entity->base.symbol);
5879 attribute_t *attributes = parse_attributes(NULL);
5880 entity->declaration.type = bitfield_type;
5881 handle_entity_attributes(attributes, entity);
5883 type_t *orig_type = entity->declaration.type;
5884 type_t *type = skip_typeref(orig_type);
5885 if (is_type_function(type)) {
5886 errorf(&entity->base.source_position,
5887 "compound member '%Y' must not have function type '%T'",
5888 entity->base.symbol, orig_type);
5889 } else if (is_type_incomplete(type)) {
5890 /* §6.7.2.1:16 flexible array member */
5891 if (!is_type_array(type) ||
5892 token.type != ';' ||
5893 look_ahead(1)->type != '}') {
5894 errorf(&entity->base.source_position,
5895 "compound member '%Y' has incomplete type '%T'",
5896 entity->base.symbol, orig_type);
5901 append_entity(&compound->members, entity);
5904 } while (next_if(','));
5905 expect(';', end_error);
5908 anonymous_entity = NULL;
5911 static void parse_compound_type_entries(compound_t *compound)
5914 add_anchor_token('}');
5916 while (token.type != '}') {
5917 if (token.type == T_EOF) {
5918 errorf(HERE, "EOF while parsing struct");
5921 declaration_specifiers_t specifiers;
5922 parse_declaration_specifiers(&specifiers);
5923 parse_compound_declarators(compound, &specifiers);
5925 rem_anchor_token('}');
5929 compound->complete = true;
5932 static type_t *parse_typename(void)
5934 declaration_specifiers_t specifiers;
5935 parse_declaration_specifiers(&specifiers);
5936 if (specifiers.storage_class != STORAGE_CLASS_NONE
5937 || specifiers.thread_local) {
5938 /* TODO: improve error message, user does probably not know what a
5939 * storage class is...
5941 errorf(HERE, "typename must not have a storage class");
5944 type_t *result = parse_abstract_declarator(specifiers.type);
5952 typedef expression_t* (*parse_expression_function)(void);
5953 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5955 typedef struct expression_parser_function_t expression_parser_function_t;
5956 struct expression_parser_function_t {
5957 parse_expression_function parser;
5958 precedence_t infix_precedence;
5959 parse_expression_infix_function infix_parser;
5962 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5965 * Prints an error message if an expression was expected but not read
5967 static expression_t *expected_expression_error(void)
5969 /* skip the error message if the error token was read */
5970 if (token.type != T_ERROR) {
5971 errorf(HERE, "expected expression, got token %K", &token);
5975 return create_invalid_expression();
5978 static type_t *get_string_type(void)
5980 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
5983 static type_t *get_wide_string_type(void)
5985 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5989 * Parse a string constant.
5991 static expression_t *parse_string_literal(void)
5993 source_position_t begin = token.source_position;
5994 string_t res = token.literal;
5995 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
5998 while (token.type == T_STRING_LITERAL
5999 || token.type == T_WIDE_STRING_LITERAL) {
6000 warn_string_concat(&token.source_position);
6001 res = concat_strings(&res, &token.literal);
6003 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6006 expression_t *literal;
6008 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6009 literal->base.type = get_wide_string_type();
6011 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6012 literal->base.type = get_string_type();
6014 literal->base.source_position = begin;
6015 literal->literal.value = res;
6021 * Parse a boolean constant.
6023 static expression_t *parse_boolean_literal(bool value)
6025 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6026 literal->base.source_position = token.source_position;
6027 literal->base.type = type_bool;
6028 literal->literal.value.begin = value ? "true" : "false";
6029 literal->literal.value.size = value ? 4 : 5;
6035 static void warn_traditional_suffix(void)
6037 if (!warning.traditional)
6039 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6043 static void check_integer_suffix(void)
6045 symbol_t *suffix = token.symbol;
6049 bool not_traditional = false;
6050 const char *c = suffix->string;
6051 if (*c == 'l' || *c == 'L') {
6054 not_traditional = true;
6056 if (*c == 'u' || *c == 'U') {
6059 } else if (*c == 'u' || *c == 'U') {
6060 not_traditional = true;
6063 } else if (*c == 'u' || *c == 'U') {
6064 not_traditional = true;
6066 if (*c == 'l' || *c == 'L') {
6074 errorf(&token.source_position,
6075 "invalid suffix '%s' on integer constant", suffix->string);
6076 } else if (not_traditional) {
6077 warn_traditional_suffix();
6081 static type_t *check_floatingpoint_suffix(void)
6083 symbol_t *suffix = token.symbol;
6084 type_t *type = type_double;
6088 bool not_traditional = false;
6089 const char *c = suffix->string;
6090 if (*c == 'f' || *c == 'F') {
6093 } else if (*c == 'l' || *c == 'L') {
6095 type = type_long_double;
6098 errorf(&token.source_position,
6099 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6100 } else if (not_traditional) {
6101 warn_traditional_suffix();
6108 * Parse an integer constant.
6110 static expression_t *parse_number_literal(void)
6112 expression_kind_t kind;
6115 switch (token.type) {
6117 kind = EXPR_LITERAL_INTEGER;
6118 check_integer_suffix();
6121 case T_INTEGER_OCTAL:
6122 kind = EXPR_LITERAL_INTEGER_OCTAL;
6123 check_integer_suffix();
6126 case T_INTEGER_HEXADECIMAL:
6127 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6128 check_integer_suffix();
6131 case T_FLOATINGPOINT:
6132 kind = EXPR_LITERAL_FLOATINGPOINT;
6133 type = check_floatingpoint_suffix();
6135 case T_FLOATINGPOINT_HEXADECIMAL:
6136 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6137 type = check_floatingpoint_suffix();
6140 panic("unexpected token type in parse_number_literal");
6143 expression_t *literal = allocate_expression_zero(kind);
6144 literal->base.source_position = token.source_position;
6145 literal->base.type = type;
6146 literal->literal.value = token.literal;
6147 literal->literal.suffix = token.symbol;
6150 /* integer type depends on the size of the number and the size
6151 * representable by the types. The backend/codegeneration has to determine
6154 determine_literal_type(&literal->literal);
6159 * Parse a character constant.
6161 static expression_t *parse_character_constant(void)
6163 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6164 literal->base.source_position = token.source_position;
6165 literal->base.type = c_mode & _CXX ? type_char : type_int;
6166 literal->literal.value = token.literal;
6168 size_t len = literal->literal.value.size;
6170 if (!GNU_MODE && !(c_mode & _C99)) {
6171 errorf(HERE, "more than 1 character in character constant");
6172 } else if (warning.multichar) {
6173 literal->base.type = type_int;
6174 warningf(HERE, "multi-character character constant");
6183 * Parse a wide character constant.
6185 static expression_t *parse_wide_character_constant(void)
6187 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6188 literal->base.source_position = token.source_position;
6189 literal->base.type = type_int;
6190 literal->literal.value = token.literal;
6192 size_t len = wstrlen(&literal->literal.value);
6194 warningf(HERE, "multi-character character constant");
6201 static entity_t *create_implicit_function(symbol_t *symbol,
6202 const source_position_t *source_position)
6204 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6205 ntype->function.return_type = type_int;
6206 ntype->function.unspecified_parameters = true;
6207 ntype->function.linkage = LINKAGE_C;
6208 type_t *type = identify_new_type(ntype);
6210 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6211 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6212 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6213 entity->declaration.type = type;
6214 entity->declaration.implicit = true;
6215 entity->base.source_position = *source_position;
6217 if (current_scope != NULL) {
6218 bool strict_prototypes_old = warning.strict_prototypes;
6219 warning.strict_prototypes = false;
6220 record_entity(entity, false);
6221 warning.strict_prototypes = strict_prototypes_old;
6228 * Performs automatic type cast as described in §6.3.2.1.
6230 * @param orig_type the original type
6232 static type_t *automatic_type_conversion(type_t *orig_type)
6234 type_t *type = skip_typeref(orig_type);
6235 if (is_type_array(type)) {
6236 array_type_t *array_type = &type->array;
6237 type_t *element_type = array_type->element_type;
6238 unsigned qualifiers = array_type->base.qualifiers;
6240 return make_pointer_type(element_type, qualifiers);
6243 if (is_type_function(type)) {
6244 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6251 * reverts the automatic casts of array to pointer types and function
6252 * to function-pointer types as defined §6.3.2.1
6254 type_t *revert_automatic_type_conversion(const expression_t *expression)
6256 switch (expression->kind) {
6257 case EXPR_REFERENCE: {
6258 entity_t *entity = expression->reference.entity;
6259 if (is_declaration(entity)) {
6260 return entity->declaration.type;
6261 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6262 return entity->enum_value.enum_type;
6264 panic("no declaration or enum in reference");
6269 entity_t *entity = expression->select.compound_entry;
6270 assert(is_declaration(entity));
6271 type_t *type = entity->declaration.type;
6272 return get_qualified_type(type,
6273 expression->base.type->base.qualifiers);
6276 case EXPR_UNARY_DEREFERENCE: {
6277 const expression_t *const value = expression->unary.value;
6278 type_t *const type = skip_typeref(value->base.type);
6279 if (!is_type_pointer(type))
6280 return type_error_type;
6281 return type->pointer.points_to;
6284 case EXPR_ARRAY_ACCESS: {
6285 const expression_t *array_ref = expression->array_access.array_ref;
6286 type_t *type_left = skip_typeref(array_ref->base.type);
6287 if (!is_type_pointer(type_left))
6288 return type_error_type;
6289 return type_left->pointer.points_to;
6292 case EXPR_STRING_LITERAL: {
6293 size_t size = expression->string_literal.value.size;
6294 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6297 case EXPR_WIDE_STRING_LITERAL: {
6298 size_t size = wstrlen(&expression->string_literal.value);
6299 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6302 case EXPR_COMPOUND_LITERAL:
6303 return expression->compound_literal.type;
6308 return expression->base.type;
6312 * Find an entity matching a symbol in a scope.
6313 * Uses current scope if scope is NULL
6315 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6316 namespace_tag_t namespc)
6318 if (scope == NULL) {
6319 return get_entity(symbol, namespc);
6322 /* we should optimize here, if scope grows above a certain size we should
6323 construct a hashmap here... */
6324 entity_t *entity = scope->entities;
6325 for ( ; entity != NULL; entity = entity->base.next) {
6326 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6333 static entity_t *parse_qualified_identifier(void)
6335 /* namespace containing the symbol */
6337 source_position_t pos;
6338 const scope_t *lookup_scope = NULL;
6340 if (next_if(T_COLONCOLON))
6341 lookup_scope = &unit->scope;
6345 if (token.type != T_IDENTIFIER) {
6346 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6347 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6349 symbol = token.symbol;
6354 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6356 if (!next_if(T_COLONCOLON))
6359 switch (entity->kind) {
6360 case ENTITY_NAMESPACE:
6361 lookup_scope = &entity->namespacee.members;
6366 lookup_scope = &entity->compound.members;
6369 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6370 symbol, get_entity_kind_name(entity->kind));
6375 if (entity == NULL) {
6376 if (!strict_mode && token.type == '(') {
6377 /* an implicitly declared function */
6378 if (warning.error_implicit_function_declaration) {
6379 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6380 } else if (warning.implicit_function_declaration) {
6381 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6384 entity = create_implicit_function(symbol, &pos);
6386 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6387 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6394 /* skip further qualifications */
6395 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6397 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6400 static expression_t *parse_reference(void)
6402 source_position_t const pos = token.source_position;
6403 entity_t *const entity = parse_qualified_identifier();
6406 if (is_declaration(entity)) {
6407 orig_type = entity->declaration.type;
6408 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6409 orig_type = entity->enum_value.enum_type;
6411 panic("expected declaration or enum value in reference");
6414 /* we always do the auto-type conversions; the & and sizeof parser contains
6415 * code to revert this! */
6416 type_t *type = automatic_type_conversion(orig_type);
6418 expression_kind_t kind = EXPR_REFERENCE;
6419 if (entity->kind == ENTITY_ENUM_VALUE)
6420 kind = EXPR_REFERENCE_ENUM_VALUE;
6422 expression_t *expression = allocate_expression_zero(kind);
6423 expression->base.source_position = pos;
6424 expression->base.type = type;
6425 expression->reference.entity = entity;
6427 /* this declaration is used */
6428 if (is_declaration(entity)) {
6429 entity->declaration.used = true;
6432 if (entity->base.parent_scope != file_scope
6433 && (current_function != NULL
6434 && entity->base.parent_scope->depth < current_function->parameters.depth)
6435 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6436 if (entity->kind == ENTITY_VARIABLE) {
6437 /* access of a variable from an outer function */
6438 entity->variable.address_taken = true;
6439 } else if (entity->kind == ENTITY_PARAMETER) {
6440 entity->parameter.address_taken = true;
6442 current_function->need_closure = true;
6445 check_deprecated(HERE, entity);
6447 if (warning.init_self && entity == current_init_decl && !in_type_prop
6448 && entity->kind == ENTITY_VARIABLE) {
6449 current_init_decl = NULL;
6450 warningf(&pos, "variable '%#T' is initialized by itself",
6451 entity->declaration.type, entity->base.symbol);
6457 static bool semantic_cast(expression_t *cast)
6459 expression_t *expression = cast->unary.value;
6460 type_t *orig_dest_type = cast->base.type;
6461 type_t *orig_type_right = expression->base.type;
6462 type_t const *dst_type = skip_typeref(orig_dest_type);
6463 type_t const *src_type = skip_typeref(orig_type_right);
6464 source_position_t const *pos = &cast->base.source_position;
6466 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6467 if (dst_type == type_void)
6470 /* only integer and pointer can be casted to pointer */
6471 if (is_type_pointer(dst_type) &&
6472 !is_type_pointer(src_type) &&
6473 !is_type_integer(src_type) &&
6474 is_type_valid(src_type)) {
6475 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6479 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6480 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6484 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6485 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6489 if (warning.cast_qual &&
6490 is_type_pointer(src_type) &&
6491 is_type_pointer(dst_type)) {
6492 type_t *src = skip_typeref(src_type->pointer.points_to);
6493 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6494 unsigned missing_qualifiers =
6495 src->base.qualifiers & ~dst->base.qualifiers;
6496 if (missing_qualifiers != 0) {
6498 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6499 missing_qualifiers, orig_type_right);
6505 static expression_t *parse_compound_literal(type_t *type)
6507 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6509 parse_initializer_env_t env;
6512 env.must_be_constant = false;
6513 initializer_t *initializer = parse_initializer(&env);
6516 expression->compound_literal.initializer = initializer;
6517 expression->compound_literal.type = type;
6518 expression->base.type = automatic_type_conversion(type);
6524 * Parse a cast expression.
6526 static expression_t *parse_cast(void)
6528 source_position_t source_position = token.source_position;
6531 add_anchor_token(')');
6533 type_t *type = parse_typename();
6535 rem_anchor_token(')');
6536 expect(')', end_error);
6538 if (token.type == '{') {
6539 return parse_compound_literal(type);
6542 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6543 cast->base.source_position = source_position;
6545 expression_t *value = parse_subexpression(PREC_CAST);
6546 cast->base.type = type;
6547 cast->unary.value = value;
6549 if (! semantic_cast(cast)) {
6550 /* TODO: record the error in the AST. else it is impossible to detect it */
6555 return create_invalid_expression();
6559 * Parse a statement expression.
6561 static expression_t *parse_statement_expression(void)
6563 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6566 add_anchor_token(')');
6568 statement_t *statement = parse_compound_statement(true);
6569 statement->compound.stmt_expr = true;
6570 expression->statement.statement = statement;
6572 /* find last statement and use its type */
6573 type_t *type = type_void;
6574 const statement_t *stmt = statement->compound.statements;
6576 while (stmt->base.next != NULL)
6577 stmt = stmt->base.next;
6579 if (stmt->kind == STATEMENT_EXPRESSION) {
6580 type = stmt->expression.expression->base.type;
6582 } else if (warning.other) {
6583 warningf(&expression->base.source_position, "empty statement expression ({})");
6585 expression->base.type = type;
6587 rem_anchor_token(')');
6588 expect(')', end_error);
6595 * Parse a parenthesized expression.
6597 static expression_t *parse_parenthesized_expression(void)
6599 token_t const* const la1 = look_ahead(1);
6600 switch (la1->type) {
6602 /* gcc extension: a statement expression */
6603 return parse_statement_expression();
6606 if (is_typedef_symbol(la1->symbol)) {
6609 return parse_cast();
6614 add_anchor_token(')');
6615 expression_t *result = parse_expression();
6616 result->base.parenthesized = true;
6617 rem_anchor_token(')');
6618 expect(')', end_error);
6624 static expression_t *parse_function_keyword(void)
6628 if (current_function == NULL) {
6629 errorf(HERE, "'__func__' used outside of a function");
6632 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6633 expression->base.type = type_char_ptr;
6634 expression->funcname.kind = FUNCNAME_FUNCTION;
6641 static expression_t *parse_pretty_function_keyword(void)
6643 if (current_function == NULL) {
6644 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6647 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6648 expression->base.type = type_char_ptr;
6649 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6651 eat(T___PRETTY_FUNCTION__);
6656 static expression_t *parse_funcsig_keyword(void)
6658 if (current_function == NULL) {
6659 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6662 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6663 expression->base.type = type_char_ptr;
6664 expression->funcname.kind = FUNCNAME_FUNCSIG;
6671 static expression_t *parse_funcdname_keyword(void)
6673 if (current_function == NULL) {
6674 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6677 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6678 expression->base.type = type_char_ptr;
6679 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6681 eat(T___FUNCDNAME__);
6686 static designator_t *parse_designator(void)
6688 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6689 result->source_position = *HERE;
6691 if (token.type != T_IDENTIFIER) {
6692 parse_error_expected("while parsing member designator",
6693 T_IDENTIFIER, NULL);
6696 result->symbol = token.symbol;
6699 designator_t *last_designator = result;
6702 if (token.type != T_IDENTIFIER) {
6703 parse_error_expected("while parsing member designator",
6704 T_IDENTIFIER, NULL);
6707 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6708 designator->source_position = *HERE;
6709 designator->symbol = token.symbol;
6712 last_designator->next = designator;
6713 last_designator = designator;
6717 add_anchor_token(']');
6718 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6719 designator->source_position = *HERE;
6720 designator->array_index = parse_expression();
6721 rem_anchor_token(']');
6722 expect(']', end_error);
6723 if (designator->array_index == NULL) {
6727 last_designator->next = designator;
6728 last_designator = designator;
6740 * Parse the __builtin_offsetof() expression.
6742 static expression_t *parse_offsetof(void)
6744 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6745 expression->base.type = type_size_t;
6747 eat(T___builtin_offsetof);
6749 expect('(', end_error);
6750 add_anchor_token(',');
6751 type_t *type = parse_typename();
6752 rem_anchor_token(',');
6753 expect(',', end_error);
6754 add_anchor_token(')');
6755 designator_t *designator = parse_designator();
6756 rem_anchor_token(')');
6757 expect(')', end_error);
6759 expression->offsetofe.type = type;
6760 expression->offsetofe.designator = designator;
6763 memset(&path, 0, sizeof(path));
6764 path.top_type = type;
6765 path.path = NEW_ARR_F(type_path_entry_t, 0);
6767 descend_into_subtype(&path);
6769 if (!walk_designator(&path, designator, true)) {
6770 return create_invalid_expression();
6773 DEL_ARR_F(path.path);
6777 return create_invalid_expression();
6781 * Parses a _builtin_va_start() expression.
6783 static expression_t *parse_va_start(void)
6785 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6787 eat(T___builtin_va_start);
6789 expect('(', end_error);
6790 add_anchor_token(',');
6791 expression->va_starte.ap = parse_assignment_expression();
6792 rem_anchor_token(',');
6793 expect(',', end_error);
6794 expression_t *const expr = parse_assignment_expression();
6795 if (expr->kind == EXPR_REFERENCE) {
6796 entity_t *const entity = expr->reference.entity;
6797 if (!current_function->base.type->function.variadic) {
6798 errorf(&expr->base.source_position,
6799 "'va_start' used in non-variadic function");
6800 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6801 entity->base.next != NULL ||
6802 entity->kind != ENTITY_PARAMETER) {
6803 errorf(&expr->base.source_position,
6804 "second argument of 'va_start' must be last parameter of the current function");
6806 expression->va_starte.parameter = &entity->variable;
6808 expect(')', end_error);
6811 expect(')', end_error);
6813 return create_invalid_expression();
6817 * Parses a __builtin_va_arg() expression.
6819 static expression_t *parse_va_arg(void)
6821 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6823 eat(T___builtin_va_arg);
6825 expect('(', end_error);
6827 ap.expression = parse_assignment_expression();
6828 expression->va_arge.ap = ap.expression;
6829 check_call_argument(type_valist, &ap, 1);
6831 expect(',', end_error);
6832 expression->base.type = parse_typename();
6833 expect(')', end_error);
6837 return create_invalid_expression();
6841 * Parses a __builtin_va_copy() expression.
6843 static expression_t *parse_va_copy(void)
6845 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6847 eat(T___builtin_va_copy);
6849 expect('(', end_error);
6850 expression_t *dst = parse_assignment_expression();
6851 assign_error_t error = semantic_assign(type_valist, dst);
6852 report_assign_error(error, type_valist, dst, "call argument 1",
6853 &dst->base.source_position);
6854 expression->va_copye.dst = dst;
6856 expect(',', end_error);
6858 call_argument_t src;
6859 src.expression = parse_assignment_expression();
6860 check_call_argument(type_valist, &src, 2);
6861 expression->va_copye.src = src.expression;
6862 expect(')', end_error);
6866 return create_invalid_expression();
6870 * Parses a __builtin_constant_p() expression.
6872 static expression_t *parse_builtin_constant(void)
6874 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6876 eat(T___builtin_constant_p);
6878 expect('(', end_error);
6879 add_anchor_token(')');
6880 expression->builtin_constant.value = parse_assignment_expression();
6881 rem_anchor_token(')');
6882 expect(')', end_error);
6883 expression->base.type = type_int;
6887 return create_invalid_expression();
6891 * Parses a __builtin_types_compatible_p() expression.
6893 static expression_t *parse_builtin_types_compatible(void)
6895 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6897 eat(T___builtin_types_compatible_p);
6899 expect('(', end_error);
6900 add_anchor_token(')');
6901 add_anchor_token(',');
6902 expression->builtin_types_compatible.left = parse_typename();
6903 rem_anchor_token(',');
6904 expect(',', end_error);
6905 expression->builtin_types_compatible.right = parse_typename();
6906 rem_anchor_token(')');
6907 expect(')', end_error);
6908 expression->base.type = type_int;
6912 return create_invalid_expression();
6916 * Parses a __builtin_is_*() compare expression.
6918 static expression_t *parse_compare_builtin(void)
6920 expression_t *expression;
6922 switch (token.type) {
6923 case T___builtin_isgreater:
6924 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6926 case T___builtin_isgreaterequal:
6927 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6929 case T___builtin_isless:
6930 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6932 case T___builtin_islessequal:
6933 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6935 case T___builtin_islessgreater:
6936 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6938 case T___builtin_isunordered:
6939 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6942 internal_errorf(HERE, "invalid compare builtin found");
6944 expression->base.source_position = *HERE;
6947 expect('(', end_error);
6948 expression->binary.left = parse_assignment_expression();
6949 expect(',', end_error);
6950 expression->binary.right = parse_assignment_expression();
6951 expect(')', end_error);
6953 type_t *const orig_type_left = expression->binary.left->base.type;
6954 type_t *const orig_type_right = expression->binary.right->base.type;
6956 type_t *const type_left = skip_typeref(orig_type_left);
6957 type_t *const type_right = skip_typeref(orig_type_right);
6958 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6959 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6960 type_error_incompatible("invalid operands in comparison",
6961 &expression->base.source_position, orig_type_left, orig_type_right);
6964 semantic_comparison(&expression->binary);
6969 return create_invalid_expression();
6973 * Parses a MS assume() expression.
6975 static expression_t *parse_assume(void)
6977 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6981 expect('(', end_error);
6982 add_anchor_token(')');
6983 expression->unary.value = parse_assignment_expression();
6984 rem_anchor_token(')');
6985 expect(')', end_error);
6987 expression->base.type = type_void;
6990 return create_invalid_expression();
6994 * Return the declaration for a given label symbol or create a new one.
6996 * @param symbol the symbol of the label
6998 static label_t *get_label(symbol_t *symbol)
7001 assert(current_function != NULL);
7003 label = get_entity(symbol, NAMESPACE_LABEL);
7004 /* if we found a local label, we already created the declaration */
7005 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7006 if (label->base.parent_scope != current_scope) {
7007 assert(label->base.parent_scope->depth < current_scope->depth);
7008 current_function->goto_to_outer = true;
7010 return &label->label;
7013 label = get_entity(symbol, NAMESPACE_LABEL);
7014 /* if we found a label in the same function, then we already created the
7017 && label->base.parent_scope == ¤t_function->parameters) {
7018 return &label->label;
7021 /* otherwise we need to create a new one */
7022 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, symbol);
7026 return &label->label;
7030 * Parses a GNU && label address expression.
7032 static expression_t *parse_label_address(void)
7034 source_position_t source_position = token.source_position;
7036 if (token.type != T_IDENTIFIER) {
7037 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7040 symbol_t *symbol = token.symbol;
7043 label_t *label = get_label(symbol);
7045 label->address_taken = true;
7047 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7048 expression->base.source_position = source_position;
7050 /* label address is threaten as a void pointer */
7051 expression->base.type = type_void_ptr;
7052 expression->label_address.label = label;
7055 return create_invalid_expression();
7059 * Parse a microsoft __noop expression.
7061 static expression_t *parse_noop_expression(void)
7063 /* the result is a (int)0 */
7064 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7065 literal->base.type = type_int;
7066 literal->base.source_position = token.source_position;
7067 literal->literal.value.begin = "__noop";
7068 literal->literal.value.size = 6;
7072 if (token.type == '(') {
7073 /* parse arguments */
7075 add_anchor_token(')');
7076 add_anchor_token(',');
7078 if (token.type != ')') do {
7079 (void)parse_assignment_expression();
7080 } while (next_if(','));
7082 rem_anchor_token(',');
7083 rem_anchor_token(')');
7084 expect(')', end_error);
7091 * Parses a primary expression.
7093 static expression_t *parse_primary_expression(void)
7095 switch (token.type) {
7096 case T_false: return parse_boolean_literal(false);
7097 case T_true: return parse_boolean_literal(true);
7099 case T_INTEGER_OCTAL:
7100 case T_INTEGER_HEXADECIMAL:
7101 case T_FLOATINGPOINT:
7102 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7103 case T_CHARACTER_CONSTANT: return parse_character_constant();
7104 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7105 case T_STRING_LITERAL:
7106 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7107 case T___FUNCTION__:
7108 case T___func__: return parse_function_keyword();
7109 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7110 case T___FUNCSIG__: return parse_funcsig_keyword();
7111 case T___FUNCDNAME__: return parse_funcdname_keyword();
7112 case T___builtin_offsetof: return parse_offsetof();
7113 case T___builtin_va_start: return parse_va_start();
7114 case T___builtin_va_arg: return parse_va_arg();
7115 case T___builtin_va_copy: return parse_va_copy();
7116 case T___builtin_isgreater:
7117 case T___builtin_isgreaterequal:
7118 case T___builtin_isless:
7119 case T___builtin_islessequal:
7120 case T___builtin_islessgreater:
7121 case T___builtin_isunordered: return parse_compare_builtin();
7122 case T___builtin_constant_p: return parse_builtin_constant();
7123 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7124 case T__assume: return parse_assume();
7127 return parse_label_address();
7130 case '(': return parse_parenthesized_expression();
7131 case T___noop: return parse_noop_expression();
7133 /* Gracefully handle type names while parsing expressions. */
7135 return parse_reference();
7137 if (!is_typedef_symbol(token.symbol)) {
7138 return parse_reference();
7142 source_position_t const pos = *HERE;
7143 type_t const *const type = parse_typename();
7144 errorf(&pos, "encountered type '%T' while parsing expression", type);
7145 return create_invalid_expression();
7149 errorf(HERE, "unexpected token %K, expected an expression", &token);
7151 return create_invalid_expression();
7154 static expression_t *parse_array_expression(expression_t *left)
7156 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7157 array_access_expression_t *const arr = &expr->array_access;
7160 add_anchor_token(']');
7162 expression_t *const inside = parse_expression();
7164 type_t *const orig_type_left = left->base.type;
7165 type_t *const orig_type_inside = inside->base.type;
7167 type_t *const type_left = skip_typeref(orig_type_left);
7168 type_t *const type_inside = skip_typeref(orig_type_inside);
7174 if (is_type_pointer(type_left)) {
7177 idx_type = type_inside;
7178 res_type = type_left->pointer.points_to;
7180 } else if (is_type_pointer(type_inside)) {
7181 arr->flipped = true;
7184 idx_type = type_left;
7185 res_type = type_inside->pointer.points_to;
7187 res_type = automatic_type_conversion(res_type);
7188 if (!is_type_integer(idx_type)) {
7189 errorf(&idx->base.source_position, "array subscript must have integer type");
7190 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR) && warning.char_subscripts) {
7191 warningf(&idx->base.source_position, "array subscript has char type");
7194 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7196 "array access on object with non-pointer types '%T', '%T'",
7197 orig_type_left, orig_type_inside);
7199 res_type = type_error_type;
7204 arr->array_ref = ref;
7206 arr->base.type = res_type;
7208 rem_anchor_token(']');
7209 expect(']', end_error);
7214 static expression_t *parse_typeprop(expression_kind_t const kind)
7216 expression_t *tp_expression = allocate_expression_zero(kind);
7217 tp_expression->base.type = type_size_t;
7219 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7221 /* we only refer to a type property, mark this case */
7222 bool old = in_type_prop;
7223 in_type_prop = true;
7226 expression_t *expression;
7227 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7229 add_anchor_token(')');
7230 orig_type = parse_typename();
7231 rem_anchor_token(')');
7232 expect(')', end_error);
7234 if (token.type == '{') {
7235 /* It was not sizeof(type) after all. It is sizeof of an expression
7236 * starting with a compound literal */
7237 expression = parse_compound_literal(orig_type);
7238 goto typeprop_expression;
7241 expression = parse_subexpression(PREC_UNARY);
7243 typeprop_expression:
7244 tp_expression->typeprop.tp_expression = expression;
7246 orig_type = revert_automatic_type_conversion(expression);
7247 expression->base.type = orig_type;
7250 tp_expression->typeprop.type = orig_type;
7251 type_t const* const type = skip_typeref(orig_type);
7252 char const* wrong_type = NULL;
7253 if (is_type_incomplete(type)) {
7254 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7255 wrong_type = "incomplete";
7256 } else if (type->kind == TYPE_FUNCTION) {
7258 /* function types are allowed (and return 1) */
7259 if (warning.other) {
7260 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7261 warningf(&tp_expression->base.source_position,
7262 "%s expression with function argument returns invalid result", what);
7265 wrong_type = "function";
7268 if (is_type_incomplete(type))
7269 wrong_type = "incomplete";
7271 if (type->kind == TYPE_BITFIELD)
7272 wrong_type = "bitfield";
7274 if (wrong_type != NULL) {
7275 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7276 errorf(&tp_expression->base.source_position,
7277 "operand of %s expression must not be of %s type '%T'",
7278 what, wrong_type, orig_type);
7283 return tp_expression;
7286 static expression_t *parse_sizeof(void)
7288 return parse_typeprop(EXPR_SIZEOF);
7291 static expression_t *parse_alignof(void)
7293 return parse_typeprop(EXPR_ALIGNOF);
7296 static expression_t *parse_select_expression(expression_t *addr)
7298 assert(token.type == '.' || token.type == T_MINUSGREATER);
7299 bool select_left_arrow = (token.type == T_MINUSGREATER);
7300 source_position_t const pos = *HERE;
7303 if (token.type != T_IDENTIFIER) {
7304 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7305 return create_invalid_expression();
7307 symbol_t *symbol = token.symbol;
7310 type_t *const orig_type = addr->base.type;
7311 type_t *const type = skip_typeref(orig_type);
7314 bool saw_error = false;
7315 if (is_type_pointer(type)) {
7316 if (!select_left_arrow) {
7318 "request for member '%Y' in something not a struct or union, but '%T'",
7322 type_left = skip_typeref(type->pointer.points_to);
7324 if (select_left_arrow && is_type_valid(type)) {
7325 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7331 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7332 type_left->kind != TYPE_COMPOUND_UNION) {
7334 if (is_type_valid(type_left) && !saw_error) {
7336 "request for member '%Y' in something not a struct or union, but '%T'",
7339 return create_invalid_expression();
7342 compound_t *compound = type_left->compound.compound;
7343 if (!compound->complete) {
7344 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7346 return create_invalid_expression();
7349 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7350 expression_t *result =
7351 find_create_select(&pos, addr, qualifiers, compound, symbol);
7353 if (result == NULL) {
7354 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7355 return create_invalid_expression();
7361 static void check_call_argument(type_t *expected_type,
7362 call_argument_t *argument, unsigned pos)
7364 type_t *expected_type_skip = skip_typeref(expected_type);
7365 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7366 expression_t *arg_expr = argument->expression;
7367 type_t *arg_type = skip_typeref(arg_expr->base.type);
7369 /* handle transparent union gnu extension */
7370 if (is_type_union(expected_type_skip)
7371 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7372 compound_t *union_decl = expected_type_skip->compound.compound;
7373 type_t *best_type = NULL;
7374 entity_t *entry = union_decl->members.entities;
7375 for ( ; entry != NULL; entry = entry->base.next) {
7376 assert(is_declaration(entry));
7377 type_t *decl_type = entry->declaration.type;
7378 error = semantic_assign(decl_type, arg_expr);
7379 if (error == ASSIGN_ERROR_INCOMPATIBLE
7380 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7383 if (error == ASSIGN_SUCCESS) {
7384 best_type = decl_type;
7385 } else if (best_type == NULL) {
7386 best_type = decl_type;
7390 if (best_type != NULL) {
7391 expected_type = best_type;
7395 error = semantic_assign(expected_type, arg_expr);
7396 argument->expression = create_implicit_cast(arg_expr, expected_type);
7398 if (error != ASSIGN_SUCCESS) {
7399 /* report exact scope in error messages (like "in argument 3") */
7401 snprintf(buf, sizeof(buf), "call argument %u", pos);
7402 report_assign_error(error, expected_type, arg_expr, buf,
7403 &arg_expr->base.source_position);
7404 } else if (warning.traditional || warning.conversion) {
7405 type_t *const promoted_type = get_default_promoted_type(arg_type);
7406 if (!types_compatible(expected_type_skip, promoted_type) &&
7407 !types_compatible(expected_type_skip, type_void_ptr) &&
7408 !types_compatible(type_void_ptr, promoted_type)) {
7409 /* Deliberately show the skipped types in this warning */
7410 warningf(&arg_expr->base.source_position,
7411 "passing call argument %u as '%T' rather than '%T' due to prototype",
7412 pos, expected_type_skip, promoted_type);
7418 * Handle the semantic restrictions of builtin calls
7420 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7421 switch (call->function->reference.entity->function.btk) {
7422 case bk_gnu_builtin_return_address:
7423 case bk_gnu_builtin_frame_address: {
7424 /* argument must be constant */
7425 call_argument_t *argument = call->arguments;
7427 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7428 errorf(&call->base.source_position,
7429 "argument of '%Y' must be a constant expression",
7430 call->function->reference.entity->base.symbol);
7434 case bk_gnu_builtin_object_size:
7435 if (call->arguments == NULL)
7438 call_argument_t *arg = call->arguments->next;
7439 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7440 errorf(&call->base.source_position,
7441 "second argument of '%Y' must be a constant expression",
7442 call->function->reference.entity->base.symbol);
7445 case bk_gnu_builtin_prefetch:
7446 /* second and third argument must be constant if existent */
7447 if (call->arguments == NULL)
7449 call_argument_t *rw = call->arguments->next;
7450 call_argument_t *locality = NULL;
7453 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7454 errorf(&call->base.source_position,
7455 "second argument of '%Y' must be a constant expression",
7456 call->function->reference.entity->base.symbol);
7458 locality = rw->next;
7460 if (locality != NULL) {
7461 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7462 errorf(&call->base.source_position,
7463 "third argument of '%Y' must be a constant expression",
7464 call->function->reference.entity->base.symbol);
7466 locality = rw->next;
7475 * Parse a call expression, ie. expression '( ... )'.
7477 * @param expression the function address
7479 static expression_t *parse_call_expression(expression_t *expression)
7481 expression_t *result = allocate_expression_zero(EXPR_CALL);
7482 call_expression_t *call = &result->call;
7483 call->function = expression;
7485 type_t *const orig_type = expression->base.type;
7486 type_t *const type = skip_typeref(orig_type);
7488 function_type_t *function_type = NULL;
7489 if (is_type_pointer(type)) {
7490 type_t *const to_type = skip_typeref(type->pointer.points_to);
7492 if (is_type_function(to_type)) {
7493 function_type = &to_type->function;
7494 call->base.type = function_type->return_type;
7498 if (function_type == NULL && is_type_valid(type)) {
7500 "called object '%E' (type '%T') is not a pointer to a function",
7501 expression, orig_type);
7504 /* parse arguments */
7506 add_anchor_token(')');
7507 add_anchor_token(',');
7509 if (token.type != ')') {
7510 call_argument_t **anchor = &call->arguments;
7512 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7513 argument->expression = parse_assignment_expression();
7516 anchor = &argument->next;
7517 } while (next_if(','));
7519 rem_anchor_token(',');
7520 rem_anchor_token(')');
7521 expect(')', end_error);
7523 if (function_type == NULL)
7526 /* check type and count of call arguments */
7527 function_parameter_t *parameter = function_type->parameters;
7528 call_argument_t *argument = call->arguments;
7529 if (!function_type->unspecified_parameters) {
7530 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7531 parameter = parameter->next, argument = argument->next) {
7532 check_call_argument(parameter->type, argument, ++pos);
7535 if (parameter != NULL) {
7536 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7537 } else if (argument != NULL && !function_type->variadic) {
7538 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7542 /* do default promotion for other arguments */
7543 for (; argument != NULL; argument = argument->next) {
7544 type_t *type = argument->expression->base.type;
7545 if (!is_type_object(skip_typeref(type))) {
7546 errorf(&argument->expression->base.source_position,
7547 "call argument '%E' must not be void", argument->expression);
7550 type = get_default_promoted_type(type);
7552 argument->expression
7553 = create_implicit_cast(argument->expression, type);
7558 if (warning.aggregate_return &&
7559 is_type_compound(skip_typeref(function_type->return_type))) {
7560 warningf(&expression->base.source_position,
7561 "function call has aggregate value");
7564 if (expression->kind == EXPR_REFERENCE) {
7565 reference_expression_t *reference = &expression->reference;
7566 if (reference->entity->kind == ENTITY_FUNCTION &&
7567 reference->entity->function.btk != bk_none)
7568 handle_builtin_argument_restrictions(call);
7575 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7577 static bool same_compound_type(const type_t *type1, const type_t *type2)
7580 is_type_compound(type1) &&
7581 type1->kind == type2->kind &&
7582 type1->compound.compound == type2->compound.compound;
7585 static expression_t const *get_reference_address(expression_t const *expr)
7587 bool regular_take_address = true;
7589 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7590 expr = expr->unary.value;
7592 regular_take_address = false;
7595 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7598 expr = expr->unary.value;
7601 if (expr->kind != EXPR_REFERENCE)
7604 /* special case for functions which are automatically converted to a
7605 * pointer to function without an extra TAKE_ADDRESS operation */
7606 if (!regular_take_address &&
7607 expr->reference.entity->kind != ENTITY_FUNCTION) {
7614 static void warn_reference_address_as_bool(expression_t const* expr)
7616 if (!warning.address)
7619 expr = get_reference_address(expr);
7621 warningf(&expr->base.source_position,
7622 "the address of '%Y' will always evaluate as 'true'",
7623 expr->reference.entity->base.symbol);
7627 static void warn_assignment_in_condition(const expression_t *const expr)
7629 if (!warning.parentheses)
7631 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7633 if (expr->base.parenthesized)
7635 warningf(&expr->base.source_position,
7636 "suggest parentheses around assignment used as truth value");
7639 static void semantic_condition(expression_t const *const expr,
7640 char const *const context)
7642 type_t *const type = skip_typeref(expr->base.type);
7643 if (is_type_scalar(type)) {
7644 warn_reference_address_as_bool(expr);
7645 warn_assignment_in_condition(expr);
7646 } else if (is_type_valid(type)) {
7647 errorf(&expr->base.source_position,
7648 "%s must have scalar type", context);
7653 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7655 * @param expression the conditional expression
7657 static expression_t *parse_conditional_expression(expression_t *expression)
7659 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7661 conditional_expression_t *conditional = &result->conditional;
7662 conditional->condition = expression;
7665 add_anchor_token(':');
7667 /* §6.5.15:2 The first operand shall have scalar type. */
7668 semantic_condition(expression, "condition of conditional operator");
7670 expression_t *true_expression = expression;
7671 bool gnu_cond = false;
7672 if (GNU_MODE && token.type == ':') {
7675 true_expression = parse_expression();
7677 rem_anchor_token(':');
7678 expect(':', end_error);
7680 expression_t *false_expression =
7681 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7683 type_t *const orig_true_type = true_expression->base.type;
7684 type_t *const orig_false_type = false_expression->base.type;
7685 type_t *const true_type = skip_typeref(orig_true_type);
7686 type_t *const false_type = skip_typeref(orig_false_type);
7689 type_t *result_type;
7690 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7691 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7692 /* ISO/IEC 14882:1998(E) §5.16:2 */
7693 if (true_expression->kind == EXPR_UNARY_THROW) {
7694 result_type = false_type;
7695 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7696 result_type = true_type;
7698 if (warning.other && (
7699 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7700 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7702 warningf(&conditional->base.source_position,
7703 "ISO C forbids conditional expression with only one void side");
7705 result_type = type_void;
7707 } else if (is_type_arithmetic(true_type)
7708 && is_type_arithmetic(false_type)) {
7709 result_type = semantic_arithmetic(true_type, false_type);
7710 } else if (same_compound_type(true_type, false_type)) {
7711 /* just take 1 of the 2 types */
7712 result_type = true_type;
7713 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7714 type_t *pointer_type;
7716 expression_t *other_expression;
7717 if (is_type_pointer(true_type) &&
7718 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7719 pointer_type = true_type;
7720 other_type = false_type;
7721 other_expression = false_expression;
7723 pointer_type = false_type;
7724 other_type = true_type;
7725 other_expression = true_expression;
7728 if (is_null_pointer_constant(other_expression)) {
7729 result_type = pointer_type;
7730 } else if (is_type_pointer(other_type)) {
7731 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7732 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7735 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7736 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7738 } else if (types_compatible(get_unqualified_type(to1),
7739 get_unqualified_type(to2))) {
7742 if (warning.other) {
7743 warningf(&conditional->base.source_position,
7744 "pointer types '%T' and '%T' in conditional expression are incompatible",
7745 true_type, false_type);
7750 type_t *const type =
7751 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7752 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7753 } else if (is_type_integer(other_type)) {
7754 if (warning.other) {
7755 warningf(&conditional->base.source_position,
7756 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7758 result_type = pointer_type;
7760 if (is_type_valid(other_type)) {
7761 type_error_incompatible("while parsing conditional",
7762 &expression->base.source_position, true_type, false_type);
7764 result_type = type_error_type;
7767 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7768 type_error_incompatible("while parsing conditional",
7769 &conditional->base.source_position, true_type,
7772 result_type = type_error_type;
7775 conditional->true_expression
7776 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7777 conditional->false_expression
7778 = create_implicit_cast(false_expression, result_type);
7779 conditional->base.type = result_type;
7784 * Parse an extension expression.
7786 static expression_t *parse_extension(void)
7788 eat(T___extension__);
7790 bool old_gcc_extension = in_gcc_extension;
7791 in_gcc_extension = true;
7792 expression_t *expression = parse_subexpression(PREC_UNARY);
7793 in_gcc_extension = old_gcc_extension;
7798 * Parse a __builtin_classify_type() expression.
7800 static expression_t *parse_builtin_classify_type(void)
7802 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7803 result->base.type = type_int;
7805 eat(T___builtin_classify_type);
7807 expect('(', end_error);
7808 add_anchor_token(')');
7809 expression_t *expression = parse_expression();
7810 rem_anchor_token(')');
7811 expect(')', end_error);
7812 result->classify_type.type_expression = expression;
7816 return create_invalid_expression();
7820 * Parse a delete expression
7821 * ISO/IEC 14882:1998(E) §5.3.5
7823 static expression_t *parse_delete(void)
7825 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7826 result->base.type = type_void;
7831 result->kind = EXPR_UNARY_DELETE_ARRAY;
7832 expect(']', end_error);
7836 expression_t *const value = parse_subexpression(PREC_CAST);
7837 result->unary.value = value;
7839 type_t *const type = skip_typeref(value->base.type);
7840 if (!is_type_pointer(type)) {
7841 if (is_type_valid(type)) {
7842 errorf(&value->base.source_position,
7843 "operand of delete must have pointer type");
7845 } else if (warning.other &&
7846 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7847 warningf(&value->base.source_position,
7848 "deleting 'void*' is undefined");
7855 * Parse a throw expression
7856 * ISO/IEC 14882:1998(E) §15:1
7858 static expression_t *parse_throw(void)
7860 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7861 result->base.type = type_void;
7865 expression_t *value = NULL;
7866 switch (token.type) {
7868 value = parse_assignment_expression();
7869 /* ISO/IEC 14882:1998(E) §15.1:3 */
7870 type_t *const orig_type = value->base.type;
7871 type_t *const type = skip_typeref(orig_type);
7872 if (is_type_incomplete(type)) {
7873 errorf(&value->base.source_position,
7874 "cannot throw object of incomplete type '%T'", orig_type);
7875 } else if (is_type_pointer(type)) {
7876 type_t *const points_to = skip_typeref(type->pointer.points_to);
7877 if (is_type_incomplete(points_to) &&
7878 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7879 errorf(&value->base.source_position,
7880 "cannot throw pointer to incomplete type '%T'", orig_type);
7888 result->unary.value = value;
7893 static bool check_pointer_arithmetic(const source_position_t *source_position,
7894 type_t *pointer_type,
7895 type_t *orig_pointer_type)
7897 type_t *points_to = pointer_type->pointer.points_to;
7898 points_to = skip_typeref(points_to);
7900 if (is_type_incomplete(points_to)) {
7901 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7902 errorf(source_position,
7903 "arithmetic with pointer to incomplete type '%T' not allowed",
7906 } else if (warning.pointer_arith) {
7907 warningf(source_position,
7908 "pointer of type '%T' used in arithmetic",
7911 } else if (is_type_function(points_to)) {
7913 errorf(source_position,
7914 "arithmetic with pointer to function type '%T' not allowed",
7917 } else if (warning.pointer_arith) {
7918 warningf(source_position,
7919 "pointer to a function '%T' used in arithmetic",
7926 static bool is_lvalue(const expression_t *expression)
7928 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7929 switch (expression->kind) {
7930 case EXPR_ARRAY_ACCESS:
7931 case EXPR_COMPOUND_LITERAL:
7932 case EXPR_REFERENCE:
7934 case EXPR_UNARY_DEREFERENCE:
7938 type_t *type = skip_typeref(expression->base.type);
7940 /* ISO/IEC 14882:1998(E) §3.10:3 */
7941 is_type_reference(type) ||
7942 /* Claim it is an lvalue, if the type is invalid. There was a parse
7943 * error before, which maybe prevented properly recognizing it as
7945 !is_type_valid(type);
7950 static void semantic_incdec(unary_expression_t *expression)
7952 type_t *const orig_type = expression->value->base.type;
7953 type_t *const type = skip_typeref(orig_type);
7954 if (is_type_pointer(type)) {
7955 if (!check_pointer_arithmetic(&expression->base.source_position,
7959 } else if (!is_type_real(type) && is_type_valid(type)) {
7960 /* TODO: improve error message */
7961 errorf(&expression->base.source_position,
7962 "operation needs an arithmetic or pointer type");
7965 if (!is_lvalue(expression->value)) {
7966 /* TODO: improve error message */
7967 errorf(&expression->base.source_position, "lvalue required as operand");
7969 expression->base.type = orig_type;
7972 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7974 type_t *const orig_type = expression->value->base.type;
7975 type_t *const type = skip_typeref(orig_type);
7976 if (!is_type_arithmetic(type)) {
7977 if (is_type_valid(type)) {
7978 /* TODO: improve error message */
7979 errorf(&expression->base.source_position,
7980 "operation needs an arithmetic type");
7985 expression->base.type = orig_type;
7988 static void semantic_unexpr_plus(unary_expression_t *expression)
7990 semantic_unexpr_arithmetic(expression);
7991 if (warning.traditional)
7992 warningf(&expression->base.source_position,
7993 "traditional C rejects the unary plus operator");
7996 static void semantic_not(unary_expression_t *expression)
7998 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7999 semantic_condition(expression->value, "operand of !");
8000 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8003 static void semantic_unexpr_integer(unary_expression_t *expression)
8005 type_t *const orig_type = expression->value->base.type;
8006 type_t *const type = skip_typeref(orig_type);
8007 if (!is_type_integer(type)) {
8008 if (is_type_valid(type)) {
8009 errorf(&expression->base.source_position,
8010 "operand of ~ must be of integer type");
8015 expression->base.type = orig_type;
8018 static void semantic_dereference(unary_expression_t *expression)
8020 type_t *const orig_type = expression->value->base.type;
8021 type_t *const type = skip_typeref(orig_type);
8022 if (!is_type_pointer(type)) {
8023 if (is_type_valid(type)) {
8024 errorf(&expression->base.source_position,
8025 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8030 type_t *result_type = type->pointer.points_to;
8031 result_type = automatic_type_conversion(result_type);
8032 expression->base.type = result_type;
8036 * Record that an address is taken (expression represents an lvalue).
8038 * @param expression the expression
8039 * @param may_be_register if true, the expression might be an register
8041 static void set_address_taken(expression_t *expression, bool may_be_register)
8043 if (expression->kind != EXPR_REFERENCE)
8046 entity_t *const entity = expression->reference.entity;
8048 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8051 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8052 && !may_be_register) {
8053 errorf(&expression->base.source_position,
8054 "address of register %s '%Y' requested",
8055 get_entity_kind_name(entity->kind), entity->base.symbol);
8058 if (entity->kind == ENTITY_VARIABLE) {
8059 entity->variable.address_taken = true;
8061 assert(entity->kind == ENTITY_PARAMETER);
8062 entity->parameter.address_taken = true;
8067 * Check the semantic of the address taken expression.
8069 static void semantic_take_addr(unary_expression_t *expression)
8071 expression_t *value = expression->value;
8072 value->base.type = revert_automatic_type_conversion(value);
8074 type_t *orig_type = value->base.type;
8075 type_t *type = skip_typeref(orig_type);
8076 if (!is_type_valid(type))
8080 if (!is_lvalue(value)) {
8081 errorf(&expression->base.source_position, "'&' requires an lvalue");
8083 if (type->kind == TYPE_BITFIELD) {
8084 errorf(&expression->base.source_position,
8085 "'&' not allowed on object with bitfield type '%T'",
8089 set_address_taken(value, false);
8091 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8094 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8095 static expression_t *parse_##unexpression_type(void) \
8097 expression_t *unary_expression \
8098 = allocate_expression_zero(unexpression_type); \
8100 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8102 sfunc(&unary_expression->unary); \
8104 return unary_expression; \
8107 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8108 semantic_unexpr_arithmetic)
8109 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8110 semantic_unexpr_plus)
8111 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8113 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8114 semantic_dereference)
8115 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8117 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8118 semantic_unexpr_integer)
8119 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8121 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8124 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8126 static expression_t *parse_##unexpression_type(expression_t *left) \
8128 expression_t *unary_expression \
8129 = allocate_expression_zero(unexpression_type); \
8131 unary_expression->unary.value = left; \
8133 sfunc(&unary_expression->unary); \
8135 return unary_expression; \
8138 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8139 EXPR_UNARY_POSTFIX_INCREMENT,
8141 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8142 EXPR_UNARY_POSTFIX_DECREMENT,
8145 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8147 /* TODO: handle complex + imaginary types */
8149 type_left = get_unqualified_type(type_left);
8150 type_right = get_unqualified_type(type_right);
8152 /* §6.3.1.8 Usual arithmetic conversions */
8153 if (type_left == type_long_double || type_right == type_long_double) {
8154 return type_long_double;
8155 } else if (type_left == type_double || type_right == type_double) {
8157 } else if (type_left == type_float || type_right == type_float) {
8161 type_left = promote_integer(type_left);
8162 type_right = promote_integer(type_right);
8164 if (type_left == type_right)
8167 bool const signed_left = is_type_signed(type_left);
8168 bool const signed_right = is_type_signed(type_right);
8169 int const rank_left = get_rank(type_left);
8170 int const rank_right = get_rank(type_right);
8172 if (signed_left == signed_right)
8173 return rank_left >= rank_right ? type_left : type_right;
8182 u_rank = rank_right;
8183 u_type = type_right;
8185 s_rank = rank_right;
8186 s_type = type_right;
8191 if (u_rank >= s_rank)
8194 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8196 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8197 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8201 case ATOMIC_TYPE_INT: return type_unsigned_int;
8202 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8203 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8205 default: panic("invalid atomic type");
8210 * Check the semantic restrictions for a binary expression.
8212 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8214 expression_t *const left = expression->left;
8215 expression_t *const right = expression->right;
8216 type_t *const orig_type_left = left->base.type;
8217 type_t *const orig_type_right = right->base.type;
8218 type_t *const type_left = skip_typeref(orig_type_left);
8219 type_t *const type_right = skip_typeref(orig_type_right);
8221 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8222 /* TODO: improve error message */
8223 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8224 errorf(&expression->base.source_position,
8225 "operation needs arithmetic types");
8230 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8231 expression->left = create_implicit_cast(left, arithmetic_type);
8232 expression->right = create_implicit_cast(right, arithmetic_type);
8233 expression->base.type = arithmetic_type;
8236 static void semantic_binexpr_integer(binary_expression_t *const expression)
8238 expression_t *const left = expression->left;
8239 expression_t *const right = expression->right;
8240 type_t *const orig_type_left = left->base.type;
8241 type_t *const orig_type_right = right->base.type;
8242 type_t *const type_left = skip_typeref(orig_type_left);
8243 type_t *const type_right = skip_typeref(orig_type_right);
8245 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8246 /* TODO: improve error message */
8247 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8248 errorf(&expression->base.source_position,
8249 "operation needs integer types");
8254 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8255 expression->left = create_implicit_cast(left, result_type);
8256 expression->right = create_implicit_cast(right, result_type);
8257 expression->base.type = result_type;
8260 static void warn_div_by_zero(binary_expression_t const *const expression)
8262 if (!warning.div_by_zero ||
8263 !is_type_integer(expression->base.type))
8266 expression_t const *const right = expression->right;
8267 /* The type of the right operand can be different for /= */
8268 if (is_type_integer(right->base.type) &&
8269 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8270 !fold_constant_to_bool(right)) {
8271 warningf(&expression->base.source_position, "division by zero");
8276 * Check the semantic restrictions for a div/mod expression.
8278 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8280 semantic_binexpr_arithmetic(expression);
8281 warn_div_by_zero(expression);
8284 static void warn_addsub_in_shift(const expression_t *const expr)
8286 if (expr->base.parenthesized)
8290 switch (expr->kind) {
8291 case EXPR_BINARY_ADD: op = '+'; break;
8292 case EXPR_BINARY_SUB: op = '-'; break;
8296 warningf(&expr->base.source_position,
8297 "suggest parentheses around '%c' inside shift", op);
8300 static bool semantic_shift(binary_expression_t *expression)
8302 expression_t *const left = expression->left;
8303 expression_t *const right = expression->right;
8304 type_t *const orig_type_left = left->base.type;
8305 type_t *const orig_type_right = right->base.type;
8306 type_t * type_left = skip_typeref(orig_type_left);
8307 type_t * type_right = skip_typeref(orig_type_right);
8309 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8310 /* TODO: improve error message */
8311 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8312 errorf(&expression->base.source_position,
8313 "operands of shift operation must have integer types");
8318 type_left = promote_integer(type_left);
8320 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8321 long count = fold_constant_to_int(right);
8323 warningf(&right->base.source_position,
8324 "shift count must be non-negative");
8325 } else if ((unsigned long)count >=
8326 get_atomic_type_size(type_left->atomic.akind) * 8) {
8327 warningf(&right->base.source_position,
8328 "shift count must be less than type width");
8332 type_right = promote_integer(type_right);
8333 expression->right = create_implicit_cast(right, type_right);
8338 static void semantic_shift_op(binary_expression_t *expression)
8340 expression_t *const left = expression->left;
8341 expression_t *const right = expression->right;
8343 if (!semantic_shift(expression))
8346 if (warning.parentheses) {
8347 warn_addsub_in_shift(left);
8348 warn_addsub_in_shift(right);
8351 type_t *const orig_type_left = left->base.type;
8352 type_t * type_left = skip_typeref(orig_type_left);
8354 type_left = promote_integer(type_left);
8355 expression->left = create_implicit_cast(left, type_left);
8356 expression->base.type = type_left;
8359 static void semantic_add(binary_expression_t *expression)
8361 expression_t *const left = expression->left;
8362 expression_t *const right = expression->right;
8363 type_t *const orig_type_left = left->base.type;
8364 type_t *const orig_type_right = right->base.type;
8365 type_t *const type_left = skip_typeref(orig_type_left);
8366 type_t *const type_right = skip_typeref(orig_type_right);
8369 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8370 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8371 expression->left = create_implicit_cast(left, arithmetic_type);
8372 expression->right = create_implicit_cast(right, arithmetic_type);
8373 expression->base.type = arithmetic_type;
8374 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8375 check_pointer_arithmetic(&expression->base.source_position,
8376 type_left, orig_type_left);
8377 expression->base.type = type_left;
8378 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8379 check_pointer_arithmetic(&expression->base.source_position,
8380 type_right, orig_type_right);
8381 expression->base.type = type_right;
8382 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8383 errorf(&expression->base.source_position,
8384 "invalid operands to binary + ('%T', '%T')",
8385 orig_type_left, orig_type_right);
8389 static void semantic_sub(binary_expression_t *expression)
8391 expression_t *const left = expression->left;
8392 expression_t *const right = expression->right;
8393 type_t *const orig_type_left = left->base.type;
8394 type_t *const orig_type_right = right->base.type;
8395 type_t *const type_left = skip_typeref(orig_type_left);
8396 type_t *const type_right = skip_typeref(orig_type_right);
8397 source_position_t const *const pos = &expression->base.source_position;
8400 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8401 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8402 expression->left = create_implicit_cast(left, arithmetic_type);
8403 expression->right = create_implicit_cast(right, arithmetic_type);
8404 expression->base.type = arithmetic_type;
8405 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8406 check_pointer_arithmetic(&expression->base.source_position,
8407 type_left, orig_type_left);
8408 expression->base.type = type_left;
8409 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8410 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8411 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8412 if (!types_compatible(unqual_left, unqual_right)) {
8414 "subtracting pointers to incompatible types '%T' and '%T'",
8415 orig_type_left, orig_type_right);
8416 } else if (!is_type_object(unqual_left)) {
8417 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8418 errorf(pos, "subtracting pointers to non-object types '%T'",
8420 } else if (warning.other) {
8421 warningf(pos, "subtracting pointers to void");
8424 expression->base.type = type_ptrdiff_t;
8425 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8426 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8427 orig_type_left, orig_type_right);
8431 static void warn_string_literal_address(expression_t const* expr)
8433 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8434 expr = expr->unary.value;
8435 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8437 expr = expr->unary.value;
8440 if (expr->kind == EXPR_STRING_LITERAL
8441 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8442 warningf(&expr->base.source_position,
8443 "comparison with string literal results in unspecified behaviour");
8447 static void warn_comparison_in_comparison(const expression_t *const expr)
8449 if (expr->base.parenthesized)
8451 switch (expr->base.kind) {
8452 case EXPR_BINARY_LESS:
8453 case EXPR_BINARY_GREATER:
8454 case EXPR_BINARY_LESSEQUAL:
8455 case EXPR_BINARY_GREATEREQUAL:
8456 case EXPR_BINARY_NOTEQUAL:
8457 case EXPR_BINARY_EQUAL:
8458 warningf(&expr->base.source_position,
8459 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8466 static bool maybe_negative(expression_t const *const expr)
8468 switch (is_constant_expression(expr)) {
8469 case EXPR_CLASS_ERROR: return false;
8470 case EXPR_CLASS_CONSTANT: return fold_constant_to_int(expr) < 0;
8471 default: return true;
8476 * Check the semantics of comparison expressions.
8478 * @param expression The expression to check.
8480 static void semantic_comparison(binary_expression_t *expression)
8482 expression_t *left = expression->left;
8483 expression_t *right = expression->right;
8485 if (warning.address) {
8486 warn_string_literal_address(left);
8487 warn_string_literal_address(right);
8489 expression_t const* const func_left = get_reference_address(left);
8490 if (func_left != NULL && is_null_pointer_constant(right)) {
8491 warningf(&expression->base.source_position,
8492 "the address of '%Y' will never be NULL",
8493 func_left->reference.entity->base.symbol);
8496 expression_t const* const func_right = get_reference_address(right);
8497 if (func_right != NULL && is_null_pointer_constant(right)) {
8498 warningf(&expression->base.source_position,
8499 "the address of '%Y' will never be NULL",
8500 func_right->reference.entity->base.symbol);
8504 if (warning.parentheses) {
8505 warn_comparison_in_comparison(left);
8506 warn_comparison_in_comparison(right);
8509 type_t *orig_type_left = left->base.type;
8510 type_t *orig_type_right = right->base.type;
8511 type_t *type_left = skip_typeref(orig_type_left);
8512 type_t *type_right = skip_typeref(orig_type_right);
8514 /* TODO non-arithmetic types */
8515 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8516 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8518 /* test for signed vs unsigned compares */
8519 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8520 bool const signed_left = is_type_signed(type_left);
8521 bool const signed_right = is_type_signed(type_right);
8522 if (signed_left != signed_right) {
8523 /* FIXME long long needs better const folding magic */
8524 /* TODO check whether constant value can be represented by other type */
8525 if ((signed_left && maybe_negative(left)) ||
8526 (signed_right && maybe_negative(right))) {
8527 warningf(&expression->base.source_position,
8528 "comparison between signed and unsigned");
8533 expression->left = create_implicit_cast(left, arithmetic_type);
8534 expression->right = create_implicit_cast(right, arithmetic_type);
8535 expression->base.type = arithmetic_type;
8536 if (warning.float_equal &&
8537 (expression->base.kind == EXPR_BINARY_EQUAL ||
8538 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8539 is_type_float(arithmetic_type)) {
8540 warningf(&expression->base.source_position,
8541 "comparing floating point with == or != is unsafe");
8543 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8544 /* TODO check compatibility */
8545 } else if (is_type_pointer(type_left)) {
8546 expression->right = create_implicit_cast(right, type_left);
8547 } else if (is_type_pointer(type_right)) {
8548 expression->left = create_implicit_cast(left, type_right);
8549 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8550 type_error_incompatible("invalid operands in comparison",
8551 &expression->base.source_position,
8552 type_left, type_right);
8554 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8558 * Checks if a compound type has constant fields.
8560 static bool has_const_fields(const compound_type_t *type)
8562 compound_t *compound = type->compound;
8563 entity_t *entry = compound->members.entities;
8565 for (; entry != NULL; entry = entry->base.next) {
8566 if (!is_declaration(entry))
8569 const type_t *decl_type = skip_typeref(entry->declaration.type);
8570 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8577 static bool is_valid_assignment_lhs(expression_t const* const left)
8579 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8580 type_t *const type_left = skip_typeref(orig_type_left);
8582 if (!is_lvalue(left)) {
8583 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8588 if (left->kind == EXPR_REFERENCE
8589 && left->reference.entity->kind == ENTITY_FUNCTION) {
8590 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8594 if (is_type_array(type_left)) {
8595 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8598 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8599 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8603 if (is_type_incomplete(type_left)) {
8604 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8605 left, orig_type_left);
8608 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8609 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8610 left, orig_type_left);
8617 static void semantic_arithmetic_assign(binary_expression_t *expression)
8619 expression_t *left = expression->left;
8620 expression_t *right = expression->right;
8621 type_t *orig_type_left = left->base.type;
8622 type_t *orig_type_right = right->base.type;
8624 if (!is_valid_assignment_lhs(left))
8627 type_t *type_left = skip_typeref(orig_type_left);
8628 type_t *type_right = skip_typeref(orig_type_right);
8630 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8631 /* TODO: improve error message */
8632 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8633 errorf(&expression->base.source_position,
8634 "operation needs arithmetic types");
8639 /* combined instructions are tricky. We can't create an implicit cast on
8640 * the left side, because we need the uncasted form for the store.
8641 * The ast2firm pass has to know that left_type must be right_type
8642 * for the arithmetic operation and create a cast by itself */
8643 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8644 expression->right = create_implicit_cast(right, arithmetic_type);
8645 expression->base.type = type_left;
8648 static void semantic_divmod_assign(binary_expression_t *expression)
8650 semantic_arithmetic_assign(expression);
8651 warn_div_by_zero(expression);
8654 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8656 expression_t *const left = expression->left;
8657 expression_t *const right = expression->right;
8658 type_t *const orig_type_left = left->base.type;
8659 type_t *const orig_type_right = right->base.type;
8660 type_t *const type_left = skip_typeref(orig_type_left);
8661 type_t *const type_right = skip_typeref(orig_type_right);
8663 if (!is_valid_assignment_lhs(left))
8666 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8667 /* combined instructions are tricky. We can't create an implicit cast on
8668 * the left side, because we need the uncasted form for the store.
8669 * The ast2firm pass has to know that left_type must be right_type
8670 * for the arithmetic operation and create a cast by itself */
8671 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8672 expression->right = create_implicit_cast(right, arithmetic_type);
8673 expression->base.type = type_left;
8674 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8675 check_pointer_arithmetic(&expression->base.source_position,
8676 type_left, orig_type_left);
8677 expression->base.type = type_left;
8678 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8679 errorf(&expression->base.source_position,
8680 "incompatible types '%T' and '%T' in assignment",
8681 orig_type_left, orig_type_right);
8685 static void semantic_integer_assign(binary_expression_t *expression)
8687 expression_t *left = expression->left;
8688 expression_t *right = expression->right;
8689 type_t *orig_type_left = left->base.type;
8690 type_t *orig_type_right = right->base.type;
8692 if (!is_valid_assignment_lhs(left))
8695 type_t *type_left = skip_typeref(orig_type_left);
8696 type_t *type_right = skip_typeref(orig_type_right);
8698 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8699 /* TODO: improve error message */
8700 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8701 errorf(&expression->base.source_position,
8702 "operation needs integer types");
8707 /* combined instructions are tricky. We can't create an implicit cast on
8708 * the left side, because we need the uncasted form for the store.
8709 * The ast2firm pass has to know that left_type must be right_type
8710 * for the arithmetic operation and create a cast by itself */
8711 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8712 expression->right = create_implicit_cast(right, arithmetic_type);
8713 expression->base.type = type_left;
8716 static void semantic_shift_assign(binary_expression_t *expression)
8718 expression_t *left = expression->left;
8720 if (!is_valid_assignment_lhs(left))
8723 if (!semantic_shift(expression))
8726 expression->base.type = skip_typeref(left->base.type);
8729 static void warn_logical_and_within_or(const expression_t *const expr)
8731 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8733 if (expr->base.parenthesized)
8735 warningf(&expr->base.source_position,
8736 "suggest parentheses around && within ||");
8740 * Check the semantic restrictions of a logical expression.
8742 static void semantic_logical_op(binary_expression_t *expression)
8744 /* §6.5.13:2 Each of the operands shall have scalar type.
8745 * §6.5.14:2 Each of the operands shall have scalar type. */
8746 semantic_condition(expression->left, "left operand of logical operator");
8747 semantic_condition(expression->right, "right operand of logical operator");
8748 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8749 warning.parentheses) {
8750 warn_logical_and_within_or(expression->left);
8751 warn_logical_and_within_or(expression->right);
8753 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8757 * Check the semantic restrictions of a binary assign expression.
8759 static void semantic_binexpr_assign(binary_expression_t *expression)
8761 expression_t *left = expression->left;
8762 type_t *orig_type_left = left->base.type;
8764 if (!is_valid_assignment_lhs(left))
8767 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8768 report_assign_error(error, orig_type_left, expression->right,
8769 "assignment", &left->base.source_position);
8770 expression->right = create_implicit_cast(expression->right, orig_type_left);
8771 expression->base.type = orig_type_left;
8775 * Determine if the outermost operation (or parts thereof) of the given
8776 * expression has no effect in order to generate a warning about this fact.
8777 * Therefore in some cases this only examines some of the operands of the
8778 * expression (see comments in the function and examples below).
8780 * f() + 23; // warning, because + has no effect
8781 * x || f(); // no warning, because x controls execution of f()
8782 * x ? y : f(); // warning, because y has no effect
8783 * (void)x; // no warning to be able to suppress the warning
8784 * This function can NOT be used for an "expression has definitely no effect"-
8786 static bool expression_has_effect(const expression_t *const expr)
8788 switch (expr->kind) {
8789 case EXPR_UNKNOWN: break;
8790 case EXPR_INVALID: return true; /* do NOT warn */
8791 case EXPR_REFERENCE: return false;
8792 case EXPR_REFERENCE_ENUM_VALUE: return false;
8793 case EXPR_LABEL_ADDRESS: return false;
8795 /* suppress the warning for microsoft __noop operations */
8796 case EXPR_LITERAL_MS_NOOP: return true;
8797 case EXPR_LITERAL_BOOLEAN:
8798 case EXPR_LITERAL_CHARACTER:
8799 case EXPR_LITERAL_WIDE_CHARACTER:
8800 case EXPR_LITERAL_INTEGER:
8801 case EXPR_LITERAL_INTEGER_OCTAL:
8802 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8803 case EXPR_LITERAL_FLOATINGPOINT:
8804 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8805 case EXPR_STRING_LITERAL: return false;
8806 case EXPR_WIDE_STRING_LITERAL: return false;
8809 const call_expression_t *const call = &expr->call;
8810 if (call->function->kind != EXPR_REFERENCE)
8813 switch (call->function->reference.entity->function.btk) {
8814 /* FIXME: which builtins have no effect? */
8815 default: return true;
8819 /* Generate the warning if either the left or right hand side of a
8820 * conditional expression has no effect */
8821 case EXPR_CONDITIONAL: {
8822 conditional_expression_t const *const cond = &expr->conditional;
8823 expression_t const *const t = cond->true_expression;
8825 (t == NULL || expression_has_effect(t)) &&
8826 expression_has_effect(cond->false_expression);
8829 case EXPR_SELECT: return false;
8830 case EXPR_ARRAY_ACCESS: return false;
8831 case EXPR_SIZEOF: return false;
8832 case EXPR_CLASSIFY_TYPE: return false;
8833 case EXPR_ALIGNOF: return false;
8835 case EXPR_FUNCNAME: return false;
8836 case EXPR_BUILTIN_CONSTANT_P: return false;
8837 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8838 case EXPR_OFFSETOF: return false;
8839 case EXPR_VA_START: return true;
8840 case EXPR_VA_ARG: return true;
8841 case EXPR_VA_COPY: return true;
8842 case EXPR_STATEMENT: return true; // TODO
8843 case EXPR_COMPOUND_LITERAL: return false;
8845 case EXPR_UNARY_NEGATE: return false;
8846 case EXPR_UNARY_PLUS: return false;
8847 case EXPR_UNARY_BITWISE_NEGATE: return false;
8848 case EXPR_UNARY_NOT: return false;
8849 case EXPR_UNARY_DEREFERENCE: return false;
8850 case EXPR_UNARY_TAKE_ADDRESS: return false;
8851 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8852 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8853 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8854 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8856 /* Treat void casts as if they have an effect in order to being able to
8857 * suppress the warning */
8858 case EXPR_UNARY_CAST: {
8859 type_t *const type = skip_typeref(expr->base.type);
8860 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8863 case EXPR_UNARY_CAST_IMPLICIT: return true;
8864 case EXPR_UNARY_ASSUME: return true;
8865 case EXPR_UNARY_DELETE: return true;
8866 case EXPR_UNARY_DELETE_ARRAY: return true;
8867 case EXPR_UNARY_THROW: return true;
8869 case EXPR_BINARY_ADD: return false;
8870 case EXPR_BINARY_SUB: return false;
8871 case EXPR_BINARY_MUL: return false;
8872 case EXPR_BINARY_DIV: return false;
8873 case EXPR_BINARY_MOD: return false;
8874 case EXPR_BINARY_EQUAL: return false;
8875 case EXPR_BINARY_NOTEQUAL: return false;
8876 case EXPR_BINARY_LESS: return false;
8877 case EXPR_BINARY_LESSEQUAL: return false;
8878 case EXPR_BINARY_GREATER: return false;
8879 case EXPR_BINARY_GREATEREQUAL: return false;
8880 case EXPR_BINARY_BITWISE_AND: return false;
8881 case EXPR_BINARY_BITWISE_OR: return false;
8882 case EXPR_BINARY_BITWISE_XOR: return false;
8883 case EXPR_BINARY_SHIFTLEFT: return false;
8884 case EXPR_BINARY_SHIFTRIGHT: return false;
8885 case EXPR_BINARY_ASSIGN: return true;
8886 case EXPR_BINARY_MUL_ASSIGN: return true;
8887 case EXPR_BINARY_DIV_ASSIGN: return true;
8888 case EXPR_BINARY_MOD_ASSIGN: return true;
8889 case EXPR_BINARY_ADD_ASSIGN: return true;
8890 case EXPR_BINARY_SUB_ASSIGN: return true;
8891 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8892 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8893 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8894 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8895 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8897 /* Only examine the right hand side of && and ||, because the left hand
8898 * side already has the effect of controlling the execution of the right
8900 case EXPR_BINARY_LOGICAL_AND:
8901 case EXPR_BINARY_LOGICAL_OR:
8902 /* Only examine the right hand side of a comma expression, because the left
8903 * hand side has a separate warning */
8904 case EXPR_BINARY_COMMA:
8905 return expression_has_effect(expr->binary.right);
8907 case EXPR_BINARY_ISGREATER: return false;
8908 case EXPR_BINARY_ISGREATEREQUAL: return false;
8909 case EXPR_BINARY_ISLESS: return false;
8910 case EXPR_BINARY_ISLESSEQUAL: return false;
8911 case EXPR_BINARY_ISLESSGREATER: return false;
8912 case EXPR_BINARY_ISUNORDERED: return false;
8915 internal_errorf(HERE, "unexpected expression");
8918 static void semantic_comma(binary_expression_t *expression)
8920 if (warning.unused_value) {
8921 const expression_t *const left = expression->left;
8922 if (!expression_has_effect(left)) {
8923 warningf(&left->base.source_position,
8924 "left-hand operand of comma expression has no effect");
8927 expression->base.type = expression->right->base.type;
8931 * @param prec_r precedence of the right operand
8933 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8934 static expression_t *parse_##binexpression_type(expression_t *left) \
8936 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8937 binexpr->binary.left = left; \
8940 expression_t *right = parse_subexpression(prec_r); \
8942 binexpr->binary.right = right; \
8943 sfunc(&binexpr->binary); \
8948 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8949 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8950 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8951 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8952 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8953 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8954 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8955 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8956 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8957 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8958 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8959 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8960 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8961 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8962 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8963 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8964 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8965 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8966 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8967 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8968 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8969 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8970 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8971 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8972 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8973 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8974 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8975 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8976 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8977 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8980 static expression_t *parse_subexpression(precedence_t precedence)
8982 if (token.type < 0) {
8983 return expected_expression_error();
8986 expression_parser_function_t *parser
8987 = &expression_parsers[token.type];
8988 source_position_t source_position = token.source_position;
8991 if (parser->parser != NULL) {
8992 left = parser->parser();
8994 left = parse_primary_expression();
8996 assert(left != NULL);
8997 left->base.source_position = source_position;
9000 if (token.type < 0) {
9001 return expected_expression_error();
9004 parser = &expression_parsers[token.type];
9005 if (parser->infix_parser == NULL)
9007 if (parser->infix_precedence < precedence)
9010 left = parser->infix_parser(left);
9012 assert(left != NULL);
9013 assert(left->kind != EXPR_UNKNOWN);
9014 left->base.source_position = source_position;
9021 * Parse an expression.
9023 static expression_t *parse_expression(void)
9025 return parse_subexpression(PREC_EXPRESSION);
9029 * Register a parser for a prefix-like operator.
9031 * @param parser the parser function
9032 * @param token_type the token type of the prefix token
9034 static void register_expression_parser(parse_expression_function parser,
9037 expression_parser_function_t *entry = &expression_parsers[token_type];
9039 if (entry->parser != NULL) {
9040 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9041 panic("trying to register multiple expression parsers for a token");
9043 entry->parser = parser;
9047 * Register a parser for an infix operator with given precedence.
9049 * @param parser the parser function
9050 * @param token_type the token type of the infix operator
9051 * @param precedence the precedence of the operator
9053 static void register_infix_parser(parse_expression_infix_function parser,
9054 int token_type, precedence_t precedence)
9056 expression_parser_function_t *entry = &expression_parsers[token_type];
9058 if (entry->infix_parser != NULL) {
9059 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9060 panic("trying to register multiple infix expression parsers for a "
9063 entry->infix_parser = parser;
9064 entry->infix_precedence = precedence;
9068 * Initialize the expression parsers.
9070 static void init_expression_parsers(void)
9072 memset(&expression_parsers, 0, sizeof(expression_parsers));
9074 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9075 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9076 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9077 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9078 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9079 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9080 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9081 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9082 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9083 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9084 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9085 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9086 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9087 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9088 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9089 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9090 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9091 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9092 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9093 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9094 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9095 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9096 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9097 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9098 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9099 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9100 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9101 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9102 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9103 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9104 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9105 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9106 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9107 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9108 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9109 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9110 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9112 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9113 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9114 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9115 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9116 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9117 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9118 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9119 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9120 register_expression_parser(parse_sizeof, T_sizeof);
9121 register_expression_parser(parse_alignof, T___alignof__);
9122 register_expression_parser(parse_extension, T___extension__);
9123 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9124 register_expression_parser(parse_delete, T_delete);
9125 register_expression_parser(parse_throw, T_throw);
9129 * Parse a asm statement arguments specification.
9131 static asm_argument_t *parse_asm_arguments(bool is_out)
9133 asm_argument_t *result = NULL;
9134 asm_argument_t **anchor = &result;
9136 while (token.type == T_STRING_LITERAL || token.type == '[') {
9137 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9138 memset(argument, 0, sizeof(argument[0]));
9141 if (token.type != T_IDENTIFIER) {
9142 parse_error_expected("while parsing asm argument",
9143 T_IDENTIFIER, NULL);
9146 argument->symbol = token.symbol;
9148 expect(']', end_error);
9151 argument->constraints = parse_string_literals();
9152 expect('(', end_error);
9153 add_anchor_token(')');
9154 expression_t *expression = parse_expression();
9155 rem_anchor_token(')');
9157 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9158 * change size or type representation (e.g. int -> long is ok, but
9159 * int -> float is not) */
9160 if (expression->kind == EXPR_UNARY_CAST) {
9161 type_t *const type = expression->base.type;
9162 type_kind_t const kind = type->kind;
9163 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9166 if (kind == TYPE_ATOMIC) {
9167 atomic_type_kind_t const akind = type->atomic.akind;
9168 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9169 size = get_atomic_type_size(akind);
9171 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9172 size = get_atomic_type_size(get_intptr_kind());
9176 expression_t *const value = expression->unary.value;
9177 type_t *const value_type = value->base.type;
9178 type_kind_t const value_kind = value_type->kind;
9180 unsigned value_flags;
9181 unsigned value_size;
9182 if (value_kind == TYPE_ATOMIC) {
9183 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9184 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9185 value_size = get_atomic_type_size(value_akind);
9186 } else if (value_kind == TYPE_POINTER) {
9187 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9188 value_size = get_atomic_type_size(get_intptr_kind());
9193 if (value_flags != flags || value_size != size)
9197 } while (expression->kind == EXPR_UNARY_CAST);
9201 if (!is_lvalue(expression)) {
9202 errorf(&expression->base.source_position,
9203 "asm output argument is not an lvalue");
9206 if (argument->constraints.begin[0] == '=')
9207 determine_lhs_ent(expression, NULL);
9209 mark_vars_read(expression, NULL);
9211 mark_vars_read(expression, NULL);
9213 argument->expression = expression;
9214 expect(')', end_error);
9216 set_address_taken(expression, true);
9219 anchor = &argument->next;
9231 * Parse a asm statement clobber specification.
9233 static asm_clobber_t *parse_asm_clobbers(void)
9235 asm_clobber_t *result = NULL;
9236 asm_clobber_t **anchor = &result;
9238 while (token.type == T_STRING_LITERAL) {
9239 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9240 clobber->clobber = parse_string_literals();
9243 anchor = &clobber->next;
9253 * Parse an asm statement.
9255 static statement_t *parse_asm_statement(void)
9257 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9258 asm_statement_t *asm_statement = &statement->asms;
9262 if (next_if(T_volatile))
9263 asm_statement->is_volatile = true;
9265 expect('(', end_error);
9266 add_anchor_token(')');
9267 if (token.type != T_STRING_LITERAL) {
9268 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9271 asm_statement->asm_text = parse_string_literals();
9273 add_anchor_token(':');
9274 if (!next_if(':')) {
9275 rem_anchor_token(':');
9279 asm_statement->outputs = parse_asm_arguments(true);
9280 if (!next_if(':')) {
9281 rem_anchor_token(':');
9285 asm_statement->inputs = parse_asm_arguments(false);
9286 if (!next_if(':')) {
9287 rem_anchor_token(':');
9290 rem_anchor_token(':');
9292 asm_statement->clobbers = parse_asm_clobbers();
9295 rem_anchor_token(')');
9296 expect(')', end_error);
9297 expect(';', end_error);
9299 if (asm_statement->outputs == NULL) {
9300 /* GCC: An 'asm' instruction without any output operands will be treated
9301 * identically to a volatile 'asm' instruction. */
9302 asm_statement->is_volatile = true;
9307 return create_invalid_statement();
9310 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9312 statement_t *inner_stmt;
9313 switch (token.type) {
9315 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9316 inner_stmt = create_invalid_statement();
9320 if (label->kind == STATEMENT_LABEL) {
9321 /* Eat an empty statement here, to avoid the warning about an empty
9322 * statement after a label. label:; is commonly used to have a label
9323 * before a closing brace. */
9324 inner_stmt = create_empty_statement();
9331 inner_stmt = parse_statement();
9332 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9333 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9334 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9342 * Parse a case statement.
9344 static statement_t *parse_case_statement(void)
9346 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9347 source_position_t *const pos = &statement->base.source_position;
9351 expression_t *const expression = parse_expression();
9352 statement->case_label.expression = expression;
9353 expression_classification_t const expr_class = is_constant_expression(expression);
9354 if (expr_class != EXPR_CLASS_CONSTANT) {
9355 if (expr_class != EXPR_CLASS_ERROR) {
9356 errorf(pos, "case label does not reduce to an integer constant");
9358 statement->case_label.is_bad = true;
9360 long const val = fold_constant_to_int(expression);
9361 statement->case_label.first_case = val;
9362 statement->case_label.last_case = val;
9366 if (next_if(T_DOTDOTDOT)) {
9367 expression_t *const end_range = parse_expression();
9368 statement->case_label.end_range = end_range;
9369 expression_classification_t const end_class = is_constant_expression(end_range);
9370 if (end_class != EXPR_CLASS_CONSTANT) {
9371 if (end_class != EXPR_CLASS_ERROR) {
9372 errorf(pos, "case range does not reduce to an integer constant");
9374 statement->case_label.is_bad = true;
9376 long const val = fold_constant_to_int(end_range);
9377 statement->case_label.last_case = val;
9379 if (warning.other && val < statement->case_label.first_case) {
9380 statement->case_label.is_empty_range = true;
9381 warningf(pos, "empty range specified");
9387 PUSH_PARENT(statement);
9389 expect(':', end_error);
9392 if (current_switch != NULL) {
9393 if (! statement->case_label.is_bad) {
9394 /* Check for duplicate case values */
9395 case_label_statement_t *c = &statement->case_label;
9396 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9397 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9400 if (c->last_case < l->first_case || c->first_case > l->last_case)
9403 errorf(pos, "duplicate case value (previously used %P)",
9404 &l->base.source_position);
9408 /* link all cases into the switch statement */
9409 if (current_switch->last_case == NULL) {
9410 current_switch->first_case = &statement->case_label;
9412 current_switch->last_case->next = &statement->case_label;
9414 current_switch->last_case = &statement->case_label;
9416 errorf(pos, "case label not within a switch statement");
9419 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9426 * Parse a default statement.
9428 static statement_t *parse_default_statement(void)
9430 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9434 PUSH_PARENT(statement);
9436 expect(':', end_error);
9439 if (current_switch != NULL) {
9440 const case_label_statement_t *def_label = current_switch->default_label;
9441 if (def_label != NULL) {
9442 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9443 &def_label->base.source_position);
9445 current_switch->default_label = &statement->case_label;
9447 /* link all cases into the switch statement */
9448 if (current_switch->last_case == NULL) {
9449 current_switch->first_case = &statement->case_label;
9451 current_switch->last_case->next = &statement->case_label;
9453 current_switch->last_case = &statement->case_label;
9456 errorf(&statement->base.source_position,
9457 "'default' label not within a switch statement");
9460 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9467 * Parse a label statement.
9469 static statement_t *parse_label_statement(void)
9471 assert(token.type == T_IDENTIFIER);
9472 symbol_t *symbol = token.symbol;
9473 label_t *label = get_label(symbol);
9475 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9476 statement->label.label = label;
9480 PUSH_PARENT(statement);
9482 /* if statement is already set then the label is defined twice,
9483 * otherwise it was just mentioned in a goto/local label declaration so far
9485 if (label->statement != NULL) {
9486 errorf(HERE, "duplicate label '%Y' (declared %P)",
9487 symbol, &label->base.source_position);
9489 label->base.source_position = token.source_position;
9490 label->statement = statement;
9495 statement->label.statement = parse_label_inner_statement(statement, "label");
9497 /* remember the labels in a list for later checking */
9498 *label_anchor = &statement->label;
9499 label_anchor = &statement->label.next;
9506 * Parse an if statement.
9508 static statement_t *parse_if(void)
9510 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9514 PUSH_PARENT(statement);
9516 add_anchor_token('{');
9518 expect('(', end_error);
9519 add_anchor_token(')');
9520 expression_t *const expr = parse_expression();
9521 statement->ifs.condition = expr;
9522 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9524 semantic_condition(expr, "condition of 'if'-statment");
9525 mark_vars_read(expr, NULL);
9526 rem_anchor_token(')');
9527 expect(')', end_error);
9530 rem_anchor_token('{');
9532 add_anchor_token(T_else);
9533 statement_t *const true_stmt = parse_statement();
9534 statement->ifs.true_statement = true_stmt;
9535 rem_anchor_token(T_else);
9537 if (next_if(T_else)) {
9538 statement->ifs.false_statement = parse_statement();
9539 } else if (warning.parentheses &&
9540 true_stmt->kind == STATEMENT_IF &&
9541 true_stmt->ifs.false_statement != NULL) {
9542 warningf(&true_stmt->base.source_position,
9543 "suggest explicit braces to avoid ambiguous 'else'");
9551 * Check that all enums are handled in a switch.
9553 * @param statement the switch statement to check
9555 static void check_enum_cases(const switch_statement_t *statement)
9557 const type_t *type = skip_typeref(statement->expression->base.type);
9558 if (! is_type_enum(type))
9560 const enum_type_t *enumt = &type->enumt;
9562 /* if we have a default, no warnings */
9563 if (statement->default_label != NULL)
9566 /* FIXME: calculation of value should be done while parsing */
9567 /* TODO: quadratic algorithm here. Change to an n log n one */
9568 long last_value = -1;
9569 const entity_t *entry = enumt->enume->base.next;
9570 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9571 entry = entry->base.next) {
9572 const expression_t *expression = entry->enum_value.value;
9573 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9575 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9576 if (l->expression == NULL)
9578 if (l->first_case <= value && value <= l->last_case) {
9584 warningf(&statement->base.source_position,
9585 "enumeration value '%Y' not handled in switch",
9586 entry->base.symbol);
9593 * Parse a switch statement.
9595 static statement_t *parse_switch(void)
9597 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9601 PUSH_PARENT(statement);
9603 expect('(', end_error);
9604 add_anchor_token(')');
9605 expression_t *const expr = parse_expression();
9606 mark_vars_read(expr, NULL);
9607 type_t * type = skip_typeref(expr->base.type);
9608 if (is_type_integer(type)) {
9609 type = promote_integer(type);
9610 if (warning.traditional) {
9611 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9612 warningf(&expr->base.source_position,
9613 "'%T' switch expression not converted to '%T' in ISO C",
9617 } else if (is_type_valid(type)) {
9618 errorf(&expr->base.source_position,
9619 "switch quantity is not an integer, but '%T'", type);
9620 type = type_error_type;
9622 statement->switchs.expression = create_implicit_cast(expr, type);
9623 expect(')', end_error);
9624 rem_anchor_token(')');
9626 switch_statement_t *rem = current_switch;
9627 current_switch = &statement->switchs;
9628 statement->switchs.body = parse_statement();
9629 current_switch = rem;
9631 if (warning.switch_default &&
9632 statement->switchs.default_label == NULL) {
9633 warningf(&statement->base.source_position, "switch has no default case");
9635 if (warning.switch_enum)
9636 check_enum_cases(&statement->switchs);
9642 return create_invalid_statement();
9645 static statement_t *parse_loop_body(statement_t *const loop)
9647 statement_t *const rem = current_loop;
9648 current_loop = loop;
9650 statement_t *const body = parse_statement();
9657 * Parse a while statement.
9659 static statement_t *parse_while(void)
9661 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9665 PUSH_PARENT(statement);
9667 expect('(', end_error);
9668 add_anchor_token(')');
9669 expression_t *const cond = parse_expression();
9670 statement->whiles.condition = cond;
9671 /* §6.8.5:2 The controlling expression of an iteration statement shall
9672 * have scalar type. */
9673 semantic_condition(cond, "condition of 'while'-statement");
9674 mark_vars_read(cond, NULL);
9675 rem_anchor_token(')');
9676 expect(')', end_error);
9678 statement->whiles.body = parse_loop_body(statement);
9684 return create_invalid_statement();
9688 * Parse a do statement.
9690 static statement_t *parse_do(void)
9692 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9696 PUSH_PARENT(statement);
9698 add_anchor_token(T_while);
9699 statement->do_while.body = parse_loop_body(statement);
9700 rem_anchor_token(T_while);
9702 expect(T_while, end_error);
9703 expect('(', end_error);
9704 add_anchor_token(')');
9705 expression_t *const cond = parse_expression();
9706 statement->do_while.condition = cond;
9707 /* §6.8.5:2 The controlling expression of an iteration statement shall
9708 * have scalar type. */
9709 semantic_condition(cond, "condition of 'do-while'-statement");
9710 mark_vars_read(cond, NULL);
9711 rem_anchor_token(')');
9712 expect(')', end_error);
9713 expect(';', end_error);
9719 return create_invalid_statement();
9723 * Parse a for statement.
9725 static statement_t *parse_for(void)
9727 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9731 expect('(', end_error1);
9732 add_anchor_token(')');
9734 PUSH_PARENT(statement);
9736 size_t const top = environment_top();
9737 scope_t *old_scope = scope_push(&statement->fors.scope);
9739 bool old_gcc_extension = in_gcc_extension;
9740 while (next_if(T___extension__)) {
9741 in_gcc_extension = true;
9745 } else if (is_declaration_specifier(&token, false)) {
9746 parse_declaration(record_entity, DECL_FLAGS_NONE);
9748 add_anchor_token(';');
9749 expression_t *const init = parse_expression();
9750 statement->fors.initialisation = init;
9751 mark_vars_read(init, ENT_ANY);
9752 if (warning.unused_value && !expression_has_effect(init)) {
9753 warningf(&init->base.source_position,
9754 "initialisation of 'for'-statement has no effect");
9756 rem_anchor_token(';');
9757 expect(';', end_error2);
9759 in_gcc_extension = old_gcc_extension;
9761 if (token.type != ';') {
9762 add_anchor_token(';');
9763 expression_t *const cond = parse_expression();
9764 statement->fors.condition = cond;
9765 /* §6.8.5:2 The controlling expression of an iteration statement
9766 * shall have scalar type. */
9767 semantic_condition(cond, "condition of 'for'-statement");
9768 mark_vars_read(cond, NULL);
9769 rem_anchor_token(';');
9771 expect(';', end_error2);
9772 if (token.type != ')') {
9773 expression_t *const step = parse_expression();
9774 statement->fors.step = step;
9775 mark_vars_read(step, ENT_ANY);
9776 if (warning.unused_value && !expression_has_effect(step)) {
9777 warningf(&step->base.source_position,
9778 "step of 'for'-statement has no effect");
9781 expect(')', end_error2);
9782 rem_anchor_token(')');
9783 statement->fors.body = parse_loop_body(statement);
9785 assert(current_scope == &statement->fors.scope);
9786 scope_pop(old_scope);
9787 environment_pop_to(top);
9794 rem_anchor_token(')');
9795 assert(current_scope == &statement->fors.scope);
9796 scope_pop(old_scope);
9797 environment_pop_to(top);
9801 return create_invalid_statement();
9805 * Parse a goto statement.
9807 static statement_t *parse_goto(void)
9809 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9812 if (GNU_MODE && next_if('*')) {
9813 expression_t *expression = parse_expression();
9814 mark_vars_read(expression, NULL);
9816 /* Argh: although documentation says the expression must be of type void*,
9817 * gcc accepts anything that can be casted into void* without error */
9818 type_t *type = expression->base.type;
9820 if (type != type_error_type) {
9821 if (!is_type_pointer(type) && !is_type_integer(type)) {
9822 errorf(&expression->base.source_position,
9823 "cannot convert to a pointer type");
9824 } else if (warning.other && type != type_void_ptr) {
9825 warningf(&expression->base.source_position,
9826 "type of computed goto expression should be 'void*' not '%T'", type);
9828 expression = create_implicit_cast(expression, type_void_ptr);
9831 statement->gotos.expression = expression;
9832 } else if (token.type == T_IDENTIFIER) {
9833 symbol_t *symbol = token.symbol;
9835 statement->gotos.label = get_label(symbol);
9838 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9840 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9842 return create_invalid_statement();
9845 /* remember the goto's in a list for later checking */
9846 *goto_anchor = &statement->gotos;
9847 goto_anchor = &statement->gotos.next;
9849 expect(';', end_error);
9856 * Parse a continue statement.
9858 static statement_t *parse_continue(void)
9860 if (current_loop == NULL) {
9861 errorf(HERE, "continue statement not within loop");
9864 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9867 expect(';', end_error);
9874 * Parse a break statement.
9876 static statement_t *parse_break(void)
9878 if (current_switch == NULL && current_loop == NULL) {
9879 errorf(HERE, "break statement not within loop or switch");
9882 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9885 expect(';', end_error);
9892 * Parse a __leave statement.
9894 static statement_t *parse_leave_statement(void)
9896 if (current_try == NULL) {
9897 errorf(HERE, "__leave statement not within __try");
9900 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9903 expect(';', end_error);
9910 * Check if a given entity represents a local variable.
9912 static bool is_local_variable(const entity_t *entity)
9914 if (entity->kind != ENTITY_VARIABLE)
9917 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9918 case STORAGE_CLASS_AUTO:
9919 case STORAGE_CLASS_REGISTER: {
9920 const type_t *type = skip_typeref(entity->declaration.type);
9921 if (is_type_function(type)) {
9933 * Check if a given expression represents a local variable.
9935 static bool expression_is_local_variable(const expression_t *expression)
9937 if (expression->base.kind != EXPR_REFERENCE) {
9940 const entity_t *entity = expression->reference.entity;
9941 return is_local_variable(entity);
9945 * Check if a given expression represents a local variable and
9946 * return its declaration then, else return NULL.
9948 entity_t *expression_is_variable(const expression_t *expression)
9950 if (expression->base.kind != EXPR_REFERENCE) {
9953 entity_t *entity = expression->reference.entity;
9954 if (entity->kind != ENTITY_VARIABLE)
9961 * Parse a return statement.
9963 static statement_t *parse_return(void)
9967 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9969 expression_t *return_value = NULL;
9970 if (token.type != ';') {
9971 return_value = parse_expression();
9972 mark_vars_read(return_value, NULL);
9975 const type_t *const func_type = skip_typeref(current_function->base.type);
9976 assert(is_type_function(func_type));
9977 type_t *const return_type = skip_typeref(func_type->function.return_type);
9979 source_position_t const *const pos = &statement->base.source_position;
9980 if (return_value != NULL) {
9981 type_t *return_value_type = skip_typeref(return_value->base.type);
9983 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9984 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9985 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9986 /* Only warn in C mode, because GCC does the same */
9987 if (c_mode & _CXX || strict_mode) {
9989 "'return' with a value, in function returning 'void'");
9990 } else if (warning.other) {
9992 "'return' with a value, in function returning 'void'");
9994 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9995 /* Only warn in C mode, because GCC does the same */
9998 "'return' with expression in function returning 'void'");
9999 } else if (warning.other) {
10001 "'return' with expression in function returning 'void'");
10005 assign_error_t error = semantic_assign(return_type, return_value);
10006 report_assign_error(error, return_type, return_value, "'return'",
10009 return_value = create_implicit_cast(return_value, return_type);
10010 /* check for returning address of a local var */
10011 if (warning.other && return_value != NULL
10012 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10013 const expression_t *expression = return_value->unary.value;
10014 if (expression_is_local_variable(expression)) {
10015 warningf(pos, "function returns address of local variable");
10018 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10019 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10020 if (c_mode & _CXX || strict_mode) {
10022 "'return' without value, in function returning non-void");
10025 "'return' without value, in function returning non-void");
10028 statement->returns.value = return_value;
10030 expect(';', end_error);
10037 * Parse a declaration statement.
10039 static statement_t *parse_declaration_statement(void)
10041 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10043 entity_t *before = current_scope->last_entity;
10045 parse_external_declaration();
10047 parse_declaration(record_entity, DECL_FLAGS_NONE);
10050 declaration_statement_t *const decl = &statement->declaration;
10051 entity_t *const begin =
10052 before != NULL ? before->base.next : current_scope->entities;
10053 decl->declarations_begin = begin;
10054 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10060 * Parse an expression statement, ie. expr ';'.
10062 static statement_t *parse_expression_statement(void)
10064 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10066 expression_t *const expr = parse_expression();
10067 statement->expression.expression = expr;
10068 mark_vars_read(expr, ENT_ANY);
10070 expect(';', end_error);
10077 * Parse a microsoft __try { } __finally { } or
10078 * __try{ } __except() { }
10080 static statement_t *parse_ms_try_statment(void)
10082 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10085 PUSH_PARENT(statement);
10087 ms_try_statement_t *rem = current_try;
10088 current_try = &statement->ms_try;
10089 statement->ms_try.try_statement = parse_compound_statement(false);
10094 if (next_if(T___except)) {
10095 expect('(', end_error);
10096 add_anchor_token(')');
10097 expression_t *const expr = parse_expression();
10098 mark_vars_read(expr, NULL);
10099 type_t * type = skip_typeref(expr->base.type);
10100 if (is_type_integer(type)) {
10101 type = promote_integer(type);
10102 } else if (is_type_valid(type)) {
10103 errorf(&expr->base.source_position,
10104 "__expect expression is not an integer, but '%T'", type);
10105 type = type_error_type;
10107 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10108 rem_anchor_token(')');
10109 expect(')', end_error);
10110 statement->ms_try.final_statement = parse_compound_statement(false);
10111 } else if (next_if(T__finally)) {
10112 statement->ms_try.final_statement = parse_compound_statement(false);
10114 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10115 return create_invalid_statement();
10119 return create_invalid_statement();
10122 static statement_t *parse_empty_statement(void)
10124 if (warning.empty_statement) {
10125 warningf(HERE, "statement is empty");
10127 statement_t *const statement = create_empty_statement();
10132 static statement_t *parse_local_label_declaration(void)
10134 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10138 entity_t *begin = NULL;
10139 entity_t *end = NULL;
10140 entity_t **anchor = &begin;
10142 if (token.type != T_IDENTIFIER) {
10143 parse_error_expected("while parsing local label declaration",
10144 T_IDENTIFIER, NULL);
10147 symbol_t *symbol = token.symbol;
10148 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10149 if (entity != NULL && entity->base.parent_scope == current_scope) {
10150 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10151 symbol, &entity->base.source_position);
10153 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
10154 entity->base.parent_scope = current_scope;
10155 entity->base.source_position = token.source_position;
10158 anchor = &entity->base.next;
10161 environment_push(entity);
10164 } while (next_if(','));
10165 expect(';', end_error);
10167 statement->declaration.declarations_begin = begin;
10168 statement->declaration.declarations_end = end;
10172 static void parse_namespace_definition(void)
10176 entity_t *entity = NULL;
10177 symbol_t *symbol = NULL;
10179 if (token.type == T_IDENTIFIER) {
10180 symbol = token.symbol;
10183 entity = get_entity(symbol, NAMESPACE_NORMAL);
10185 && entity->kind != ENTITY_NAMESPACE
10186 && entity->base.parent_scope == current_scope) {
10187 if (is_entity_valid(entity)) {
10188 error_redefined_as_different_kind(&token.source_position,
10189 entity, ENTITY_NAMESPACE);
10195 if (entity == NULL) {
10196 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
10197 entity->base.source_position = token.source_position;
10198 entity->base.parent_scope = current_scope;
10201 if (token.type == '=') {
10202 /* TODO: parse namespace alias */
10203 panic("namespace alias definition not supported yet");
10206 environment_push(entity);
10207 append_entity(current_scope, entity);
10209 size_t const top = environment_top();
10210 scope_t *old_scope = scope_push(&entity->namespacee.members);
10212 entity_t *old_current_entity = current_entity;
10213 current_entity = entity;
10215 expect('{', end_error);
10217 expect('}', end_error);
10220 assert(current_scope == &entity->namespacee.members);
10221 assert(current_entity == entity);
10222 current_entity = old_current_entity;
10223 scope_pop(old_scope);
10224 environment_pop_to(top);
10228 * Parse a statement.
10229 * There's also parse_statement() which additionally checks for
10230 * "statement has no effect" warnings
10232 static statement_t *intern_parse_statement(void)
10234 statement_t *statement = NULL;
10236 /* declaration or statement */
10237 add_anchor_token(';');
10238 switch (token.type) {
10239 case T_IDENTIFIER: {
10240 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10241 if (la1_type == ':') {
10242 statement = parse_label_statement();
10243 } else if (is_typedef_symbol(token.symbol)) {
10244 statement = parse_declaration_statement();
10246 /* it's an identifier, the grammar says this must be an
10247 * expression statement. However it is common that users mistype
10248 * declaration types, so we guess a bit here to improve robustness
10249 * for incorrect programs */
10250 switch (la1_type) {
10253 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10255 statement = parse_expression_statement();
10259 statement = parse_declaration_statement();
10267 case T___extension__:
10268 /* This can be a prefix to a declaration or an expression statement.
10269 * We simply eat it now and parse the rest with tail recursion. */
10270 while (next_if(T___extension__)) {}
10271 bool old_gcc_extension = in_gcc_extension;
10272 in_gcc_extension = true;
10273 statement = intern_parse_statement();
10274 in_gcc_extension = old_gcc_extension;
10278 statement = parse_declaration_statement();
10282 statement = parse_local_label_declaration();
10285 case ';': statement = parse_empty_statement(); break;
10286 case '{': statement = parse_compound_statement(false); break;
10287 case T___leave: statement = parse_leave_statement(); break;
10288 case T___try: statement = parse_ms_try_statment(); break;
10289 case T_asm: statement = parse_asm_statement(); break;
10290 case T_break: statement = parse_break(); break;
10291 case T_case: statement = parse_case_statement(); break;
10292 case T_continue: statement = parse_continue(); break;
10293 case T_default: statement = parse_default_statement(); break;
10294 case T_do: statement = parse_do(); break;
10295 case T_for: statement = parse_for(); break;
10296 case T_goto: statement = parse_goto(); break;
10297 case T_if: statement = parse_if(); break;
10298 case T_return: statement = parse_return(); break;
10299 case T_switch: statement = parse_switch(); break;
10300 case T_while: statement = parse_while(); break;
10303 statement = parse_expression_statement();
10307 errorf(HERE, "unexpected token %K while parsing statement", &token);
10308 statement = create_invalid_statement();
10313 rem_anchor_token(';');
10315 assert(statement != NULL
10316 && statement->base.source_position.input_name != NULL);
10322 * parse a statement and emits "statement has no effect" warning if needed
10323 * (This is really a wrapper around intern_parse_statement with check for 1
10324 * single warning. It is needed, because for statement expressions we have
10325 * to avoid the warning on the last statement)
10327 static statement_t *parse_statement(void)
10329 statement_t *statement = intern_parse_statement();
10331 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10332 expression_t *expression = statement->expression.expression;
10333 if (!expression_has_effect(expression)) {
10334 warningf(&expression->base.source_position,
10335 "statement has no effect");
10343 * Parse a compound statement.
10345 static statement_t *parse_compound_statement(bool inside_expression_statement)
10347 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10349 PUSH_PARENT(statement);
10352 add_anchor_token('}');
10353 /* tokens, which can start a statement */
10354 /* TODO MS, __builtin_FOO */
10355 add_anchor_token('!');
10356 add_anchor_token('&');
10357 add_anchor_token('(');
10358 add_anchor_token('*');
10359 add_anchor_token('+');
10360 add_anchor_token('-');
10361 add_anchor_token('{');
10362 add_anchor_token('~');
10363 add_anchor_token(T_CHARACTER_CONSTANT);
10364 add_anchor_token(T_COLONCOLON);
10365 add_anchor_token(T_FLOATINGPOINT);
10366 add_anchor_token(T_IDENTIFIER);
10367 add_anchor_token(T_INTEGER);
10368 add_anchor_token(T_MINUSMINUS);
10369 add_anchor_token(T_PLUSPLUS);
10370 add_anchor_token(T_STRING_LITERAL);
10371 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10372 add_anchor_token(T_WIDE_STRING_LITERAL);
10373 add_anchor_token(T__Bool);
10374 add_anchor_token(T__Complex);
10375 add_anchor_token(T__Imaginary);
10376 add_anchor_token(T___FUNCTION__);
10377 add_anchor_token(T___PRETTY_FUNCTION__);
10378 add_anchor_token(T___alignof__);
10379 add_anchor_token(T___attribute__);
10380 add_anchor_token(T___builtin_va_start);
10381 add_anchor_token(T___extension__);
10382 add_anchor_token(T___func__);
10383 add_anchor_token(T___imag__);
10384 add_anchor_token(T___label__);
10385 add_anchor_token(T___real__);
10386 add_anchor_token(T___thread);
10387 add_anchor_token(T_asm);
10388 add_anchor_token(T_auto);
10389 add_anchor_token(T_bool);
10390 add_anchor_token(T_break);
10391 add_anchor_token(T_case);
10392 add_anchor_token(T_char);
10393 add_anchor_token(T_class);
10394 add_anchor_token(T_const);
10395 add_anchor_token(T_const_cast);
10396 add_anchor_token(T_continue);
10397 add_anchor_token(T_default);
10398 add_anchor_token(T_delete);
10399 add_anchor_token(T_double);
10400 add_anchor_token(T_do);
10401 add_anchor_token(T_dynamic_cast);
10402 add_anchor_token(T_enum);
10403 add_anchor_token(T_extern);
10404 add_anchor_token(T_false);
10405 add_anchor_token(T_float);
10406 add_anchor_token(T_for);
10407 add_anchor_token(T_goto);
10408 add_anchor_token(T_if);
10409 add_anchor_token(T_inline);
10410 add_anchor_token(T_int);
10411 add_anchor_token(T_long);
10412 add_anchor_token(T_new);
10413 add_anchor_token(T_operator);
10414 add_anchor_token(T_register);
10415 add_anchor_token(T_reinterpret_cast);
10416 add_anchor_token(T_restrict);
10417 add_anchor_token(T_return);
10418 add_anchor_token(T_short);
10419 add_anchor_token(T_signed);
10420 add_anchor_token(T_sizeof);
10421 add_anchor_token(T_static);
10422 add_anchor_token(T_static_cast);
10423 add_anchor_token(T_struct);
10424 add_anchor_token(T_switch);
10425 add_anchor_token(T_template);
10426 add_anchor_token(T_this);
10427 add_anchor_token(T_throw);
10428 add_anchor_token(T_true);
10429 add_anchor_token(T_try);
10430 add_anchor_token(T_typedef);
10431 add_anchor_token(T_typeid);
10432 add_anchor_token(T_typename);
10433 add_anchor_token(T_typeof);
10434 add_anchor_token(T_union);
10435 add_anchor_token(T_unsigned);
10436 add_anchor_token(T_using);
10437 add_anchor_token(T_void);
10438 add_anchor_token(T_volatile);
10439 add_anchor_token(T_wchar_t);
10440 add_anchor_token(T_while);
10442 size_t const top = environment_top();
10443 scope_t *old_scope = scope_push(&statement->compound.scope);
10445 statement_t **anchor = &statement->compound.statements;
10446 bool only_decls_so_far = true;
10447 while (token.type != '}') {
10448 if (token.type == T_EOF) {
10449 errorf(&statement->base.source_position,
10450 "EOF while parsing compound statement");
10453 statement_t *sub_statement = intern_parse_statement();
10454 if (is_invalid_statement(sub_statement)) {
10455 /* an error occurred. if we are at an anchor, return */
10461 if (warning.declaration_after_statement) {
10462 if (sub_statement->kind != STATEMENT_DECLARATION) {
10463 only_decls_so_far = false;
10464 } else if (!only_decls_so_far) {
10465 warningf(&sub_statement->base.source_position,
10466 "ISO C90 forbids mixed declarations and code");
10470 *anchor = sub_statement;
10472 while (sub_statement->base.next != NULL)
10473 sub_statement = sub_statement->base.next;
10475 anchor = &sub_statement->base.next;
10479 /* look over all statements again to produce no effect warnings */
10480 if (warning.unused_value) {
10481 statement_t *sub_statement = statement->compound.statements;
10482 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10483 if (sub_statement->kind != STATEMENT_EXPRESSION)
10485 /* don't emit a warning for the last expression in an expression
10486 * statement as it has always an effect */
10487 if (inside_expression_statement && sub_statement->base.next == NULL)
10490 expression_t *expression = sub_statement->expression.expression;
10491 if (!expression_has_effect(expression)) {
10492 warningf(&expression->base.source_position,
10493 "statement has no effect");
10499 rem_anchor_token(T_while);
10500 rem_anchor_token(T_wchar_t);
10501 rem_anchor_token(T_volatile);
10502 rem_anchor_token(T_void);
10503 rem_anchor_token(T_using);
10504 rem_anchor_token(T_unsigned);
10505 rem_anchor_token(T_union);
10506 rem_anchor_token(T_typeof);
10507 rem_anchor_token(T_typename);
10508 rem_anchor_token(T_typeid);
10509 rem_anchor_token(T_typedef);
10510 rem_anchor_token(T_try);
10511 rem_anchor_token(T_true);
10512 rem_anchor_token(T_throw);
10513 rem_anchor_token(T_this);
10514 rem_anchor_token(T_template);
10515 rem_anchor_token(T_switch);
10516 rem_anchor_token(T_struct);
10517 rem_anchor_token(T_static_cast);
10518 rem_anchor_token(T_static);
10519 rem_anchor_token(T_sizeof);
10520 rem_anchor_token(T_signed);
10521 rem_anchor_token(T_short);
10522 rem_anchor_token(T_return);
10523 rem_anchor_token(T_restrict);
10524 rem_anchor_token(T_reinterpret_cast);
10525 rem_anchor_token(T_register);
10526 rem_anchor_token(T_operator);
10527 rem_anchor_token(T_new);
10528 rem_anchor_token(T_long);
10529 rem_anchor_token(T_int);
10530 rem_anchor_token(T_inline);
10531 rem_anchor_token(T_if);
10532 rem_anchor_token(T_goto);
10533 rem_anchor_token(T_for);
10534 rem_anchor_token(T_float);
10535 rem_anchor_token(T_false);
10536 rem_anchor_token(T_extern);
10537 rem_anchor_token(T_enum);
10538 rem_anchor_token(T_dynamic_cast);
10539 rem_anchor_token(T_do);
10540 rem_anchor_token(T_double);
10541 rem_anchor_token(T_delete);
10542 rem_anchor_token(T_default);
10543 rem_anchor_token(T_continue);
10544 rem_anchor_token(T_const_cast);
10545 rem_anchor_token(T_const);
10546 rem_anchor_token(T_class);
10547 rem_anchor_token(T_char);
10548 rem_anchor_token(T_case);
10549 rem_anchor_token(T_break);
10550 rem_anchor_token(T_bool);
10551 rem_anchor_token(T_auto);
10552 rem_anchor_token(T_asm);
10553 rem_anchor_token(T___thread);
10554 rem_anchor_token(T___real__);
10555 rem_anchor_token(T___label__);
10556 rem_anchor_token(T___imag__);
10557 rem_anchor_token(T___func__);
10558 rem_anchor_token(T___extension__);
10559 rem_anchor_token(T___builtin_va_start);
10560 rem_anchor_token(T___attribute__);
10561 rem_anchor_token(T___alignof__);
10562 rem_anchor_token(T___PRETTY_FUNCTION__);
10563 rem_anchor_token(T___FUNCTION__);
10564 rem_anchor_token(T__Imaginary);
10565 rem_anchor_token(T__Complex);
10566 rem_anchor_token(T__Bool);
10567 rem_anchor_token(T_WIDE_STRING_LITERAL);
10568 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10569 rem_anchor_token(T_STRING_LITERAL);
10570 rem_anchor_token(T_PLUSPLUS);
10571 rem_anchor_token(T_MINUSMINUS);
10572 rem_anchor_token(T_INTEGER);
10573 rem_anchor_token(T_IDENTIFIER);
10574 rem_anchor_token(T_FLOATINGPOINT);
10575 rem_anchor_token(T_COLONCOLON);
10576 rem_anchor_token(T_CHARACTER_CONSTANT);
10577 rem_anchor_token('~');
10578 rem_anchor_token('{');
10579 rem_anchor_token('-');
10580 rem_anchor_token('+');
10581 rem_anchor_token('*');
10582 rem_anchor_token('(');
10583 rem_anchor_token('&');
10584 rem_anchor_token('!');
10585 rem_anchor_token('}');
10586 assert(current_scope == &statement->compound.scope);
10587 scope_pop(old_scope);
10588 environment_pop_to(top);
10595 * Check for unused global static functions and variables
10597 static void check_unused_globals(void)
10599 if (!warning.unused_function && !warning.unused_variable)
10602 for (const entity_t *entity = file_scope->entities; entity != NULL;
10603 entity = entity->base.next) {
10604 if (!is_declaration(entity))
10607 const declaration_t *declaration = &entity->declaration;
10608 if (declaration->used ||
10609 declaration->modifiers & DM_UNUSED ||
10610 declaration->modifiers & DM_USED ||
10611 declaration->storage_class != STORAGE_CLASS_STATIC)
10614 type_t *const type = declaration->type;
10616 if (entity->kind == ENTITY_FUNCTION) {
10617 /* inhibit warning for static inline functions */
10618 if (entity->function.is_inline)
10621 s = entity->function.statement != NULL ? "defined" : "declared";
10626 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10627 type, declaration->base.symbol, s);
10631 static void parse_global_asm(void)
10633 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10636 expect('(', end_error);
10638 statement->asms.asm_text = parse_string_literals();
10639 statement->base.next = unit->global_asm;
10640 unit->global_asm = statement;
10642 expect(')', end_error);
10643 expect(';', end_error);
10648 static void parse_linkage_specification(void)
10652 const char *linkage = parse_string_literals().begin;
10654 linkage_kind_t old_linkage = current_linkage;
10655 linkage_kind_t new_linkage;
10656 if (strcmp(linkage, "C") == 0) {
10657 new_linkage = LINKAGE_C;
10658 } else if (strcmp(linkage, "C++") == 0) {
10659 new_linkage = LINKAGE_CXX;
10661 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10662 new_linkage = LINKAGE_INVALID;
10664 current_linkage = new_linkage;
10666 if (next_if('{')) {
10668 expect('}', end_error);
10674 assert(current_linkage == new_linkage);
10675 current_linkage = old_linkage;
10678 static void parse_external(void)
10680 switch (token.type) {
10681 DECLARATION_START_NO_EXTERN
10683 case T___extension__:
10684 /* tokens below are for implicit int */
10685 case '&': /* & x; -> int& x; (and error later, because C++ has no
10687 case '*': /* * x; -> int* x; */
10688 case '(': /* (x); -> int (x); */
10689 parse_external_declaration();
10693 if (look_ahead(1)->type == T_STRING_LITERAL) {
10694 parse_linkage_specification();
10696 parse_external_declaration();
10701 parse_global_asm();
10705 parse_namespace_definition();
10709 if (!strict_mode) {
10711 warningf(HERE, "stray ';' outside of function");
10718 errorf(HERE, "stray %K outside of function", &token);
10719 if (token.type == '(' || token.type == '{' || token.type == '[')
10720 eat_until_matching_token(token.type);
10726 static void parse_externals(void)
10728 add_anchor_token('}');
10729 add_anchor_token(T_EOF);
10732 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10733 unsigned char token_anchor_copy[T_LAST_TOKEN];
10734 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10737 while (token.type != T_EOF && token.type != '}') {
10739 bool anchor_leak = false;
10740 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10741 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10743 /* the anchor set and its copy differs */
10744 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10745 anchor_leak = true;
10748 if (in_gcc_extension) {
10749 /* an gcc extension scope was not closed */
10750 internal_errorf(HERE, "Leaked __extension__");
10751 anchor_leak = true;
10761 rem_anchor_token(T_EOF);
10762 rem_anchor_token('}');
10766 * Parse a translation unit.
10768 static void parse_translation_unit(void)
10770 add_anchor_token(T_EOF);
10775 if (token.type == T_EOF)
10778 errorf(HERE, "stray %K outside of function", &token);
10779 if (token.type == '(' || token.type == '{' || token.type == '[')
10780 eat_until_matching_token(token.type);
10785 void set_default_visibility(elf_visibility_tag_t visibility)
10787 default_visibility = visibility;
10793 * @return the translation unit or NULL if errors occurred.
10795 void start_parsing(void)
10797 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10798 label_stack = NEW_ARR_F(stack_entry_t, 0);
10799 diagnostic_count = 0;
10803 print_to_file(stderr);
10805 assert(unit == NULL);
10806 unit = allocate_ast_zero(sizeof(unit[0]));
10808 assert(file_scope == NULL);
10809 file_scope = &unit->scope;
10811 assert(current_scope == NULL);
10812 scope_push(&unit->scope);
10814 create_gnu_builtins();
10816 create_microsoft_intrinsics();
10819 translation_unit_t *finish_parsing(void)
10821 assert(current_scope == &unit->scope);
10824 assert(file_scope == &unit->scope);
10825 check_unused_globals();
10828 DEL_ARR_F(environment_stack);
10829 DEL_ARR_F(label_stack);
10831 translation_unit_t *result = unit;
10836 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10837 * are given length one. */
10838 static void complete_incomplete_arrays(void)
10840 size_t n = ARR_LEN(incomplete_arrays);
10841 for (size_t i = 0; i != n; ++i) {
10842 declaration_t *const decl = incomplete_arrays[i];
10843 type_t *const orig_type = decl->type;
10844 type_t *const type = skip_typeref(orig_type);
10846 if (!is_type_incomplete(type))
10849 if (warning.other) {
10850 warningf(&decl->base.source_position,
10851 "array '%#T' assumed to have one element",
10852 orig_type, decl->base.symbol);
10855 type_t *const new_type = duplicate_type(type);
10856 new_type->array.size_constant = true;
10857 new_type->array.has_implicit_size = true;
10858 new_type->array.size = 1;
10860 type_t *const result = identify_new_type(new_type);
10862 decl->type = result;
10866 void prepare_main_collect2(entity_t *entity)
10868 // create call to __main
10869 symbol_t *symbol = symbol_table_insert("__main");
10870 entity_t *subsubmain_ent
10871 = create_implicit_function(symbol, &builtin_source_position);
10873 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10874 type_t *ftype = subsubmain_ent->declaration.type;
10875 ref->base.source_position = builtin_source_position;
10876 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10877 ref->reference.entity = subsubmain_ent;
10879 expression_t *call = allocate_expression_zero(EXPR_CALL);
10880 call->base.source_position = builtin_source_position;
10881 call->base.type = type_void;
10882 call->call.function = ref;
10884 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10885 expr_statement->base.source_position = builtin_source_position;
10886 expr_statement->expression.expression = call;
10888 statement_t *statement = entity->function.statement;
10889 assert(statement->kind == STATEMENT_COMPOUND);
10890 compound_statement_t *compounds = &statement->compound;
10892 expr_statement->base.next = compounds->statements;
10893 compounds->statements = expr_statement;
10898 lookahead_bufpos = 0;
10899 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10902 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10903 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10904 parse_translation_unit();
10905 complete_incomplete_arrays();
10906 DEL_ARR_F(incomplete_arrays);
10907 incomplete_arrays = NULL;
10911 * Initialize the parser.
10913 void init_parser(void)
10915 sym_anonymous = symbol_table_insert("<anonymous>");
10917 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10919 init_expression_parsers();
10920 obstack_init(&temp_obst);
10924 * Terminate the parser.
10926 void exit_parser(void)
10928 obstack_free(&temp_obst, NULL);