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);
2459 entity->compound.alignment = 1;
2460 entity->base.namespc = NAMESPACE_TAG;
2461 entity->base.source_position = pos;
2462 entity->base.symbol = symbol;
2463 entity->base.parent_scope = current_scope;
2464 if (symbol != NULL) {
2465 environment_push(entity);
2467 append_entity(current_scope, entity);
2470 if (token.type == '{') {
2471 parse_compound_type_entries(&entity->compound);
2473 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2474 if (symbol == NULL) {
2475 assert(anonymous_entity == NULL);
2476 anonymous_entity = entity;
2480 if (attributes != NULL) {
2481 handle_entity_attributes(attributes, entity);
2484 return &entity->compound;
2487 static void parse_enum_entries(type_t *const enum_type)
2491 if (token.type == '}') {
2492 errorf(HERE, "empty enum not allowed");
2497 add_anchor_token('}');
2499 if (token.type != T_IDENTIFIER) {
2500 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2502 rem_anchor_token('}');
2506 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2507 entity->enum_value.enum_type = enum_type;
2508 entity->base.namespc = NAMESPACE_NORMAL;
2509 entity->base.symbol = token.symbol;
2510 entity->base.source_position = token.source_position;
2514 expression_t *value = parse_constant_expression();
2516 value = create_implicit_cast(value, enum_type);
2517 entity->enum_value.value = value;
2522 record_entity(entity, false);
2523 } while (next_if(',') && token.type != '}');
2524 rem_anchor_token('}');
2526 expect('}', end_error);
2532 static type_t *parse_enum_specifier(void)
2534 source_position_t const pos = *HERE;
2539 switch (token.type) {
2541 symbol = token.symbol;
2542 entity = get_tag(symbol, ENTITY_ENUM);
2545 if (entity != NULL) {
2546 if (entity->base.parent_scope != current_scope &&
2547 (token.type == '{' || token.type == ';')) {
2548 /* we're in an inner scope and have a definition. Shadow
2549 * existing definition in outer scope */
2551 } else if (entity->enume.complete && token.type == '{') {
2552 errorf(&pos, "multiple definitions of 'enum %Y' (previous definition %P)",
2553 symbol, &entity->base.source_position);
2564 parse_error_expected("while parsing enum type specifier",
2565 T_IDENTIFIER, '{', NULL);
2569 if (entity == NULL) {
2570 entity = allocate_entity_zero(ENTITY_ENUM);
2571 entity->base.namespc = NAMESPACE_TAG;
2572 entity->base.source_position = pos;
2573 entity->base.symbol = symbol;
2574 entity->base.parent_scope = current_scope;
2577 type_t *const type = allocate_type_zero(TYPE_ENUM);
2578 type->enumt.enume = &entity->enume;
2579 type->enumt.akind = ATOMIC_TYPE_INT;
2581 if (token.type == '{') {
2582 if (symbol != NULL) {
2583 environment_push(entity);
2585 append_entity(current_scope, entity);
2586 entity->enume.complete = true;
2588 parse_enum_entries(type);
2589 parse_attributes(NULL);
2591 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2592 if (symbol == NULL) {
2593 assert(anonymous_entity == NULL);
2594 anonymous_entity = entity;
2596 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2597 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2604 * if a symbol is a typedef to another type, return true
2606 static bool is_typedef_symbol(symbol_t *symbol)
2608 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2609 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2612 static type_t *parse_typeof(void)
2618 expect('(', end_error);
2619 add_anchor_token(')');
2621 expression_t *expression = NULL;
2623 bool old_type_prop = in_type_prop;
2624 bool old_gcc_extension = in_gcc_extension;
2625 in_type_prop = true;
2627 while (next_if(T___extension__)) {
2628 /* This can be a prefix to a typename or an expression. */
2629 in_gcc_extension = true;
2631 switch (token.type) {
2633 if (is_typedef_symbol(token.symbol)) {
2635 type = parse_typename();
2638 expression = parse_expression();
2639 type = revert_automatic_type_conversion(expression);
2643 in_type_prop = old_type_prop;
2644 in_gcc_extension = old_gcc_extension;
2646 rem_anchor_token(')');
2647 expect(')', end_error);
2649 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2650 typeof_type->typeoft.expression = expression;
2651 typeof_type->typeoft.typeof_type = type;
2658 typedef enum specifiers_t {
2659 SPECIFIER_SIGNED = 1 << 0,
2660 SPECIFIER_UNSIGNED = 1 << 1,
2661 SPECIFIER_LONG = 1 << 2,
2662 SPECIFIER_INT = 1 << 3,
2663 SPECIFIER_DOUBLE = 1 << 4,
2664 SPECIFIER_CHAR = 1 << 5,
2665 SPECIFIER_WCHAR_T = 1 << 6,
2666 SPECIFIER_SHORT = 1 << 7,
2667 SPECIFIER_LONG_LONG = 1 << 8,
2668 SPECIFIER_FLOAT = 1 << 9,
2669 SPECIFIER_BOOL = 1 << 10,
2670 SPECIFIER_VOID = 1 << 11,
2671 SPECIFIER_INT8 = 1 << 12,
2672 SPECIFIER_INT16 = 1 << 13,
2673 SPECIFIER_INT32 = 1 << 14,
2674 SPECIFIER_INT64 = 1 << 15,
2675 SPECIFIER_INT128 = 1 << 16,
2676 SPECIFIER_COMPLEX = 1 << 17,
2677 SPECIFIER_IMAGINARY = 1 << 18,
2680 static type_t *get_typedef_type(symbol_t *symbol)
2682 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2683 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2686 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2687 type->typedeft.typedefe = &entity->typedefe;
2692 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2694 expect('(', end_error);
2696 attribute_property_argument_t *property
2697 = allocate_ast_zero(sizeof(*property));
2700 if (token.type != T_IDENTIFIER) {
2701 parse_error_expected("while parsing property declspec",
2702 T_IDENTIFIER, NULL);
2707 symbol_t *symbol = token.symbol;
2709 if (strcmp(symbol->string, "put") == 0) {
2710 prop = &property->put_symbol;
2711 } else if (strcmp(symbol->string, "get") == 0) {
2712 prop = &property->get_symbol;
2714 errorf(HERE, "expected put or get in property declspec");
2717 expect('=', end_error);
2718 if (token.type != T_IDENTIFIER) {
2719 parse_error_expected("while parsing property declspec",
2720 T_IDENTIFIER, NULL);
2724 *prop = token.symbol;
2726 } while (next_if(','));
2728 attribute->a.property = property;
2730 expect(')', end_error);
2736 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2738 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2739 if (next_if(T_restrict)) {
2740 kind = ATTRIBUTE_MS_RESTRICT;
2741 } else if (token.type == T_IDENTIFIER) {
2742 const char *name = token.symbol->string;
2744 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2746 const char *attribute_name = get_attribute_name(k);
2747 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2753 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2754 warningf(HERE, "unknown __declspec '%s' ignored", name);
2757 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2761 attribute_t *attribute = allocate_attribute_zero(kind);
2763 if (kind == ATTRIBUTE_MS_PROPERTY) {
2764 return parse_attribute_ms_property(attribute);
2767 /* parse arguments */
2769 attribute->a.arguments = parse_attribute_arguments();
2774 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2778 expect('(', end_error);
2783 add_anchor_token(')');
2785 attribute_t **anchor = &first;
2787 while (*anchor != NULL)
2788 anchor = &(*anchor)->next;
2790 attribute_t *attribute
2791 = parse_microsoft_extended_decl_modifier_single();
2792 if (attribute == NULL)
2795 *anchor = attribute;
2796 anchor = &attribute->next;
2797 } while (next_if(','));
2799 rem_anchor_token(')');
2800 expect(')', end_error);
2804 rem_anchor_token(')');
2808 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2810 entity_t *entity = allocate_entity_zero(kind);
2811 entity->base.namespc = NAMESPACE_NORMAL;
2812 entity->base.source_position = *HERE;
2813 entity->base.symbol = symbol;
2814 if (is_declaration(entity)) {
2815 entity->declaration.type = type_error_type;
2816 entity->declaration.implicit = true;
2817 } else if (kind == ENTITY_TYPEDEF) {
2818 entity->typedefe.type = type_error_type;
2819 entity->typedefe.builtin = true;
2821 if (kind != ENTITY_COMPOUND_MEMBER)
2822 record_entity(entity, false);
2826 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2828 type_t *type = NULL;
2829 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2830 unsigned type_specifiers = 0;
2831 bool newtype = false;
2832 bool saw_error = false;
2833 bool old_gcc_extension = in_gcc_extension;
2835 memset(specifiers, 0, sizeof(*specifiers));
2836 specifiers->source_position = token.source_position;
2839 specifiers->attributes = parse_attributes(specifiers->attributes);
2841 switch (token.type) {
2843 #define MATCH_STORAGE_CLASS(token, class) \
2845 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2846 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2848 specifiers->storage_class = class; \
2849 if (specifiers->thread_local) \
2850 goto check_thread_storage_class; \
2854 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2855 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2856 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2857 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2858 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2861 specifiers->attributes
2862 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2866 if (specifiers->thread_local) {
2867 errorf(HERE, "duplicate '__thread'");
2869 specifiers->thread_local = true;
2870 check_thread_storage_class:
2871 switch (specifiers->storage_class) {
2872 case STORAGE_CLASS_EXTERN:
2873 case STORAGE_CLASS_NONE:
2874 case STORAGE_CLASS_STATIC:
2878 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2879 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2880 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2881 wrong_thread_storage_class:
2882 errorf(HERE, "'__thread' used with '%s'", wrong);
2889 /* type qualifiers */
2890 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2892 qualifiers |= qualifier; \
2896 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2897 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2898 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2899 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2900 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2901 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2902 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2903 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2905 case T___extension__:
2907 in_gcc_extension = true;
2910 /* type specifiers */
2911 #define MATCH_SPECIFIER(token, specifier, name) \
2913 if (type_specifiers & specifier) { \
2914 errorf(HERE, "multiple " name " type specifiers given"); \
2916 type_specifiers |= specifier; \
2921 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2922 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2923 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2924 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2925 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2926 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2927 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2928 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2929 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2930 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2931 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2932 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2933 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2934 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2935 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2936 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2937 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2938 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2942 specifiers->is_inline = true;
2946 case T__forceinline:
2948 specifiers->modifiers |= DM_FORCEINLINE;
2953 if (type_specifiers & SPECIFIER_LONG_LONG) {
2954 errorf(HERE, "too many long type specifiers given");
2955 } else if (type_specifiers & SPECIFIER_LONG) {
2956 type_specifiers |= SPECIFIER_LONG_LONG;
2958 type_specifiers |= SPECIFIER_LONG;
2963 #define CHECK_DOUBLE_TYPE() \
2964 if ( type != NULL) \
2965 errorf(HERE, "multiple data types in declaration specifiers");
2968 CHECK_DOUBLE_TYPE();
2969 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2971 type->compound.compound = parse_compound_type_specifier(true);
2974 CHECK_DOUBLE_TYPE();
2975 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2976 type->compound.compound = parse_compound_type_specifier(false);
2979 CHECK_DOUBLE_TYPE();
2980 type = parse_enum_specifier();
2983 CHECK_DOUBLE_TYPE();
2984 type = parse_typeof();
2986 case T___builtin_va_list:
2987 CHECK_DOUBLE_TYPE();
2988 type = duplicate_type(type_valist);
2992 case T_IDENTIFIER: {
2993 /* only parse identifier if we haven't found a type yet */
2994 if (type != NULL || type_specifiers != 0) {
2995 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2996 * declaration, so it doesn't generate errors about expecting '(' or
2998 switch (look_ahead(1)->type) {
3005 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3009 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3014 goto finish_specifiers;
3018 type_t *const typedef_type = get_typedef_type(token.symbol);
3019 if (typedef_type == NULL) {
3020 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3021 * declaration, so it doesn't generate 'implicit int' followed by more
3022 * errors later on. */
3023 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3029 errorf(HERE, "%K does not name a type", &token);
3032 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3034 type = allocate_type_zero(TYPE_TYPEDEF);
3035 type->typedeft.typedefe = &entity->typedefe;
3043 goto finish_specifiers;
3048 type = typedef_type;
3052 /* function specifier */
3054 goto finish_specifiers;
3059 specifiers->attributes = parse_attributes(specifiers->attributes);
3061 in_gcc_extension = old_gcc_extension;
3063 if (type == NULL || (saw_error && type_specifiers != 0)) {
3064 atomic_type_kind_t atomic_type;
3066 /* match valid basic types */
3067 switch (type_specifiers) {
3068 case SPECIFIER_VOID:
3069 atomic_type = ATOMIC_TYPE_VOID;
3071 case SPECIFIER_WCHAR_T:
3072 atomic_type = ATOMIC_TYPE_WCHAR_T;
3074 case SPECIFIER_CHAR:
3075 atomic_type = ATOMIC_TYPE_CHAR;
3077 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3078 atomic_type = ATOMIC_TYPE_SCHAR;
3080 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3081 atomic_type = ATOMIC_TYPE_UCHAR;
3083 case SPECIFIER_SHORT:
3084 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3085 case SPECIFIER_SHORT | SPECIFIER_INT:
3086 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3087 atomic_type = ATOMIC_TYPE_SHORT;
3089 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3090 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3091 atomic_type = ATOMIC_TYPE_USHORT;
3094 case SPECIFIER_SIGNED:
3095 case SPECIFIER_SIGNED | SPECIFIER_INT:
3096 atomic_type = ATOMIC_TYPE_INT;
3098 case SPECIFIER_UNSIGNED:
3099 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3100 atomic_type = ATOMIC_TYPE_UINT;
3102 case SPECIFIER_LONG:
3103 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3104 case SPECIFIER_LONG | SPECIFIER_INT:
3105 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3106 atomic_type = ATOMIC_TYPE_LONG;
3108 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3109 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3110 atomic_type = ATOMIC_TYPE_ULONG;
3113 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3114 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3115 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3116 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3118 atomic_type = ATOMIC_TYPE_LONGLONG;
3119 goto warn_about_long_long;
3121 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3122 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3124 atomic_type = ATOMIC_TYPE_ULONGLONG;
3125 warn_about_long_long:
3126 if (warning.long_long) {
3127 warningf(&specifiers->source_position,
3128 "ISO C90 does not support 'long long'");
3132 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3133 atomic_type = unsigned_int8_type_kind;
3136 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3137 atomic_type = unsigned_int16_type_kind;
3140 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3141 atomic_type = unsigned_int32_type_kind;
3144 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3145 atomic_type = unsigned_int64_type_kind;
3148 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3149 atomic_type = unsigned_int128_type_kind;
3152 case SPECIFIER_INT8:
3153 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3154 atomic_type = int8_type_kind;
3157 case SPECIFIER_INT16:
3158 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3159 atomic_type = int16_type_kind;
3162 case SPECIFIER_INT32:
3163 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3164 atomic_type = int32_type_kind;
3167 case SPECIFIER_INT64:
3168 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3169 atomic_type = int64_type_kind;
3172 case SPECIFIER_INT128:
3173 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3174 atomic_type = int128_type_kind;
3177 case SPECIFIER_FLOAT:
3178 atomic_type = ATOMIC_TYPE_FLOAT;
3180 case SPECIFIER_DOUBLE:
3181 atomic_type = ATOMIC_TYPE_DOUBLE;
3183 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3184 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3186 case SPECIFIER_BOOL:
3187 atomic_type = ATOMIC_TYPE_BOOL;
3189 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3190 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3191 atomic_type = ATOMIC_TYPE_FLOAT;
3193 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3194 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3195 atomic_type = ATOMIC_TYPE_DOUBLE;
3197 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3198 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3199 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3202 /* invalid specifier combination, give an error message */
3203 if (type_specifiers == 0) {
3205 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3206 if (!(c_mode & _CXX) && !strict_mode) {
3207 if (warning.implicit_int) {
3208 warningf(HERE, "no type specifiers in declaration, using 'int'");
3210 atomic_type = ATOMIC_TYPE_INT;
3213 errorf(HERE, "no type specifiers given in declaration");
3216 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3217 (type_specifiers & SPECIFIER_UNSIGNED)) {
3218 errorf(HERE, "signed and unsigned specifiers given");
3219 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3220 errorf(HERE, "only integer types can be signed or unsigned");
3222 errorf(HERE, "multiple datatypes in declaration");
3227 if (type_specifiers & SPECIFIER_COMPLEX) {
3228 type = allocate_type_zero(TYPE_COMPLEX);
3229 type->complex.akind = atomic_type;
3230 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3231 type = allocate_type_zero(TYPE_IMAGINARY);
3232 type->imaginary.akind = atomic_type;
3234 type = allocate_type_zero(TYPE_ATOMIC);
3235 type->atomic.akind = atomic_type;
3238 } else if (type_specifiers != 0) {
3239 errorf(HERE, "multiple datatypes in declaration");
3242 /* FIXME: check type qualifiers here */
3243 type->base.qualifiers = qualifiers;
3246 type = identify_new_type(type);
3248 type = typehash_insert(type);
3251 if (specifiers->attributes != NULL)
3252 type = handle_type_attributes(specifiers->attributes, type);
3253 specifiers->type = type;
3257 specifiers->type = type_error_type;
3260 static type_qualifiers_t parse_type_qualifiers(void)
3262 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3265 switch (token.type) {
3266 /* type qualifiers */
3267 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3268 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3269 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3270 /* microsoft extended type modifiers */
3271 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3272 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3273 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3274 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3275 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3284 * Parses an K&R identifier list
3286 static void parse_identifier_list(scope_t *scope)
3289 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3290 entity->base.source_position = token.source_position;
3291 entity->base.namespc = NAMESPACE_NORMAL;
3292 entity->base.symbol = token.symbol;
3293 /* a K&R parameter has no type, yet */
3297 append_entity(scope, entity);
3298 } while (next_if(',') && token.type == T_IDENTIFIER);
3301 static entity_t *parse_parameter(void)
3303 declaration_specifiers_t specifiers;
3304 parse_declaration_specifiers(&specifiers);
3306 entity_t *entity = parse_declarator(&specifiers,
3307 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3308 anonymous_entity = NULL;
3312 static void semantic_parameter_incomplete(const entity_t *entity)
3314 assert(entity->kind == ENTITY_PARAMETER);
3316 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3317 * list in a function declarator that is part of a
3318 * definition of that function shall not have
3319 * incomplete type. */
3320 type_t *type = skip_typeref(entity->declaration.type);
3321 if (is_type_incomplete(type)) {
3322 errorf(&entity->base.source_position,
3323 "parameter '%#T' has incomplete type",
3324 entity->declaration.type, entity->base.symbol);
3328 static bool has_parameters(void)
3330 /* func(void) is not a parameter */
3331 if (token.type == T_IDENTIFIER) {
3332 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3335 if (entity->kind != ENTITY_TYPEDEF)
3337 if (skip_typeref(entity->typedefe.type) != type_void)
3339 } else if (token.type != T_void) {
3342 if (look_ahead(1)->type != ')')
3349 * Parses function type parameters (and optionally creates variable_t entities
3350 * for them in a scope)
3352 static void parse_parameters(function_type_t *type, scope_t *scope)
3355 add_anchor_token(')');
3356 int saved_comma_state = save_and_reset_anchor_state(',');
3358 if (token.type == T_IDENTIFIER &&
3359 !is_typedef_symbol(token.symbol)) {
3360 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3361 if (la1_type == ',' || la1_type == ')') {
3362 type->kr_style_parameters = true;
3363 parse_identifier_list(scope);
3364 goto parameters_finished;
3368 if (token.type == ')') {
3369 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3370 if (!(c_mode & _CXX))
3371 type->unspecified_parameters = true;
3372 } else if (has_parameters()) {
3373 function_parameter_t **anchor = &type->parameters;
3375 switch (token.type) {
3378 type->variadic = true;
3379 goto parameters_finished;
3382 case T___extension__:
3385 entity_t *entity = parse_parameter();
3386 if (entity->kind == ENTITY_TYPEDEF) {
3387 errorf(&entity->base.source_position,
3388 "typedef not allowed as function parameter");
3391 assert(is_declaration(entity));
3393 semantic_parameter_incomplete(entity);
3395 function_parameter_t *const parameter =
3396 allocate_parameter(entity->declaration.type);
3398 if (scope != NULL) {
3399 append_entity(scope, entity);
3402 *anchor = parameter;
3403 anchor = ¶meter->next;
3408 goto parameters_finished;
3410 } while (next_if(','));
3413 parameters_finished:
3414 rem_anchor_token(')');
3415 expect(')', end_error);
3418 restore_anchor_state(',', saved_comma_state);
3421 typedef enum construct_type_kind_t {
3424 CONSTRUCT_REFERENCE,
3427 } construct_type_kind_t;
3429 typedef union construct_type_t construct_type_t;
3431 typedef struct construct_type_base_t {
3432 construct_type_kind_t kind;
3433 source_position_t pos;
3434 construct_type_t *next;
3435 } construct_type_base_t;
3437 typedef struct parsed_pointer_t {
3438 construct_type_base_t base;
3439 type_qualifiers_t type_qualifiers;
3440 variable_t *base_variable; /**< MS __based extension. */
3443 typedef struct parsed_reference_t {
3444 construct_type_base_t base;
3445 } parsed_reference_t;
3447 typedef struct construct_function_type_t {
3448 construct_type_base_t base;
3449 type_t *function_type;
3450 } construct_function_type_t;
3452 typedef struct parsed_array_t {
3453 construct_type_base_t base;
3454 type_qualifiers_t type_qualifiers;
3460 union construct_type_t {
3461 construct_type_kind_t kind;
3462 construct_type_base_t base;
3463 parsed_pointer_t pointer;
3464 parsed_reference_t reference;
3465 construct_function_type_t function;
3466 parsed_array_t array;
3469 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3471 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3472 memset(cons, 0, size);
3474 cons->base.pos = *HERE;
3479 static construct_type_t *parse_pointer_declarator(void)
3481 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3483 cons->pointer.type_qualifiers = parse_type_qualifiers();
3484 //cons->pointer.base_variable = base_variable;
3489 /* ISO/IEC 14882:1998(E) §8.3.2 */
3490 static construct_type_t *parse_reference_declarator(void)
3492 if (!(c_mode & _CXX))
3493 errorf(HERE, "references are only available for C++");
3495 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3502 static construct_type_t *parse_array_declarator(void)
3504 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3505 parsed_array_t *const array = &cons->array;
3508 add_anchor_token(']');
3510 bool is_static = next_if(T_static);
3512 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3515 is_static = next_if(T_static);
3517 array->type_qualifiers = type_qualifiers;
3518 array->is_static = is_static;
3520 expression_t *size = NULL;
3521 if (token.type == '*' && look_ahead(1)->type == ']') {
3522 array->is_variable = true;
3524 } else if (token.type != ']') {
3525 size = parse_assignment_expression();
3527 /* §6.7.5.2:1 Array size must have integer type */
3528 type_t *const orig_type = size->base.type;
3529 type_t *const type = skip_typeref(orig_type);
3530 if (!is_type_integer(type) && is_type_valid(type)) {
3531 errorf(&size->base.source_position,
3532 "array size '%E' must have integer type but has type '%T'",
3537 mark_vars_read(size, NULL);
3540 if (is_static && size == NULL)
3541 errorf(&array->base.pos, "static array parameters require a size");
3543 rem_anchor_token(']');
3544 expect(']', end_error);
3551 static construct_type_t *parse_function_declarator(scope_t *scope)
3553 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3555 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3556 function_type_t *ftype = &type->function;
3558 ftype->linkage = current_linkage;
3559 ftype->calling_convention = CC_DEFAULT;
3561 parse_parameters(ftype, scope);
3563 cons->function.function_type = type;
3568 typedef struct parse_declarator_env_t {
3569 bool may_be_abstract : 1;
3570 bool must_be_abstract : 1;
3571 decl_modifiers_t modifiers;
3573 source_position_t source_position;
3575 attribute_t *attributes;
3576 } parse_declarator_env_t;
3579 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3581 /* construct a single linked list of construct_type_t's which describe
3582 * how to construct the final declarator type */
3583 construct_type_t *first = NULL;
3584 construct_type_t **anchor = &first;
3586 env->attributes = parse_attributes(env->attributes);
3589 construct_type_t *type;
3590 //variable_t *based = NULL; /* MS __based extension */
3591 switch (token.type) {
3593 type = parse_reference_declarator();
3597 panic("based not supported anymore");
3602 type = parse_pointer_declarator();
3606 goto ptr_operator_end;
3610 anchor = &type->base.next;
3612 /* TODO: find out if this is correct */
3613 env->attributes = parse_attributes(env->attributes);
3617 construct_type_t *inner_types = NULL;
3619 switch (token.type) {
3621 if (env->must_be_abstract) {
3622 errorf(HERE, "no identifier expected in typename");
3624 env->symbol = token.symbol;
3625 env->source_position = token.source_position;
3631 /* Parenthesized declarator or function declarator? */
3632 token_t const *const la1 = look_ahead(1);
3633 switch (la1->type) {
3635 if (is_typedef_symbol(la1->symbol)) {
3637 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3638 * interpreted as ``function with no parameter specification'', rather
3639 * than redundant parentheses around the omitted identifier. */
3641 /* Function declarator. */
3642 if (!env->may_be_abstract) {
3643 errorf(HERE, "function declarator must have a name");
3650 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3651 /* Paranthesized declarator. */
3653 add_anchor_token(')');
3654 inner_types = parse_inner_declarator(env);
3655 if (inner_types != NULL) {
3656 /* All later declarators only modify the return type */
3657 env->must_be_abstract = true;
3659 rem_anchor_token(')');
3660 expect(')', end_error);
3668 if (env->may_be_abstract)
3670 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3675 construct_type_t **const p = anchor;
3678 construct_type_t *type;
3679 switch (token.type) {
3681 scope_t *scope = NULL;
3682 if (!env->must_be_abstract) {
3683 scope = &env->parameters;
3686 type = parse_function_declarator(scope);
3690 type = parse_array_declarator();
3693 goto declarator_finished;
3696 /* insert in the middle of the list (at p) */
3697 type->base.next = *p;
3700 anchor = &type->base.next;
3703 declarator_finished:
3704 /* append inner_types at the end of the list, we don't to set anchor anymore
3705 * as it's not needed anymore */
3706 *anchor = inner_types;
3713 static type_t *construct_declarator_type(construct_type_t *construct_list,
3716 construct_type_t *iter = construct_list;
3717 for (; iter != NULL; iter = iter->base.next) {
3718 source_position_t const* const pos = &iter->base.pos;
3719 switch (iter->kind) {
3720 case CONSTRUCT_INVALID:
3722 case CONSTRUCT_FUNCTION: {
3723 construct_function_type_t *function = &iter->function;
3724 type_t *function_type = function->function_type;
3726 function_type->function.return_type = type;
3728 type_t *skipped_return_type = skip_typeref(type);
3730 if (is_type_function(skipped_return_type)) {
3731 errorf(pos, "function returning function is not allowed");
3732 } else if (is_type_array(skipped_return_type)) {
3733 errorf(pos, "function returning array is not allowed");
3735 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3736 warningf(pos, "type qualifiers in return type of function type are meaningless");
3740 /* The function type was constructed earlier. Freeing it here will
3741 * destroy other types. */
3742 type = typehash_insert(function_type);
3746 case CONSTRUCT_POINTER: {
3747 if (is_type_reference(skip_typeref(type)))
3748 errorf(pos, "cannot declare a pointer to reference");
3750 parsed_pointer_t *pointer = &iter->pointer;
3751 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3755 case CONSTRUCT_REFERENCE:
3756 if (is_type_reference(skip_typeref(type)))
3757 errorf(pos, "cannot declare a reference to reference");
3759 type = make_reference_type(type);
3762 case CONSTRUCT_ARRAY: {
3763 if (is_type_reference(skip_typeref(type)))
3764 errorf(pos, "cannot declare an array of references");
3766 parsed_array_t *array = &iter->array;
3767 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3769 expression_t *size_expression = array->size;
3770 if (size_expression != NULL) {
3772 = create_implicit_cast(size_expression, type_size_t);
3775 array_type->base.qualifiers = array->type_qualifiers;
3776 array_type->array.element_type = type;
3777 array_type->array.is_static = array->is_static;
3778 array_type->array.is_variable = array->is_variable;
3779 array_type->array.size_expression = size_expression;
3781 if (size_expression != NULL) {
3782 switch (is_constant_expression(size_expression)) {
3783 case EXPR_CLASS_CONSTANT: {
3784 long const size = fold_constant_to_int(size_expression);
3785 array_type->array.size = size;
3786 array_type->array.size_constant = true;
3787 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3788 * have a value greater than zero. */
3790 if (size < 0 || !GNU_MODE) {
3791 errorf(&size_expression->base.source_position,
3792 "size of array must be greater than zero");
3793 } else if (warning.other) {
3794 warningf(&size_expression->base.source_position,
3795 "zero length arrays are a GCC extension");
3801 case EXPR_CLASS_VARIABLE:
3802 array_type->array.is_vla = true;
3805 case EXPR_CLASS_ERROR:
3810 type_t *skipped_type = skip_typeref(type);
3812 if (is_type_incomplete(skipped_type)) {
3813 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3814 } else if (is_type_function(skipped_type)) {
3815 errorf(pos, "array of functions is not allowed");
3817 type = identify_new_type(array_type);
3821 internal_errorf(pos, "invalid type construction found");
3827 static type_t *automatic_type_conversion(type_t *orig_type);
3829 static type_t *semantic_parameter(const source_position_t *pos,
3831 const declaration_specifiers_t *specifiers,
3834 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3835 * shall be adjusted to ``qualified pointer to type'',
3837 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3838 * type'' shall be adjusted to ``pointer to function
3839 * returning type'', as in 6.3.2.1. */
3840 type = automatic_type_conversion(type);
3842 if (specifiers->is_inline && is_type_valid(type)) {
3843 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3846 /* §6.9.1:6 The declarations in the declaration list shall contain
3847 * no storage-class specifier other than register and no
3848 * initializations. */
3849 if (specifiers->thread_local || (
3850 specifiers->storage_class != STORAGE_CLASS_NONE &&
3851 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3853 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3856 /* delay test for incomplete type, because we might have (void)
3857 * which is legal but incomplete... */
3862 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3863 declarator_flags_t flags)
3865 parse_declarator_env_t env;
3866 memset(&env, 0, sizeof(env));
3867 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3869 construct_type_t *construct_type = parse_inner_declarator(&env);
3871 construct_declarator_type(construct_type, specifiers->type);
3872 type_t *type = skip_typeref(orig_type);
3874 if (construct_type != NULL) {
3875 obstack_free(&temp_obst, construct_type);
3878 attribute_t *attributes = parse_attributes(env.attributes);
3879 /* append (shared) specifier attribute behind attributes of this
3881 attribute_t **anchor = &attributes;
3882 while (*anchor != NULL)
3883 anchor = &(*anchor)->next;
3884 *anchor = specifiers->attributes;
3887 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3888 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3889 entity->base.namespc = NAMESPACE_NORMAL;
3890 entity->base.symbol = env.symbol;
3891 entity->base.source_position = env.source_position;
3892 entity->typedefe.type = orig_type;
3894 if (anonymous_entity != NULL) {
3895 if (is_type_compound(type)) {
3896 assert(anonymous_entity->compound.alias == NULL);
3897 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3898 anonymous_entity->kind == ENTITY_UNION);
3899 anonymous_entity->compound.alias = entity;
3900 anonymous_entity = NULL;
3901 } else if (is_type_enum(type)) {
3902 assert(anonymous_entity->enume.alias == NULL);
3903 assert(anonymous_entity->kind == ENTITY_ENUM);
3904 anonymous_entity->enume.alias = entity;
3905 anonymous_entity = NULL;
3909 /* create a declaration type entity */
3910 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3911 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3913 if (env.symbol != NULL) {
3914 if (specifiers->is_inline && is_type_valid(type)) {
3915 errorf(&env.source_position,
3916 "compound member '%Y' declared 'inline'", env.symbol);
3919 if (specifiers->thread_local ||
3920 specifiers->storage_class != STORAGE_CLASS_NONE) {
3921 errorf(&env.source_position,
3922 "compound member '%Y' must have no storage class",
3926 } else if (flags & DECL_IS_PARAMETER) {
3927 orig_type = semantic_parameter(&env.source_position, orig_type,
3928 specifiers, env.symbol);
3930 entity = allocate_entity_zero(ENTITY_PARAMETER);
3931 } else if (is_type_function(type)) {
3932 entity = allocate_entity_zero(ENTITY_FUNCTION);
3934 entity->function.is_inline = specifiers->is_inline;
3935 entity->function.elf_visibility = default_visibility;
3936 entity->function.parameters = env.parameters;
3938 if (env.symbol != NULL) {
3939 /* this needs fixes for C++ */
3940 bool in_function_scope = current_function != NULL;
3942 if (specifiers->thread_local || (
3943 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3944 specifiers->storage_class != STORAGE_CLASS_NONE &&
3945 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3947 errorf(&env.source_position,
3948 "invalid storage class for function '%Y'", env.symbol);
3952 entity = allocate_entity_zero(ENTITY_VARIABLE);
3954 entity->variable.elf_visibility = default_visibility;
3955 entity->variable.thread_local = specifiers->thread_local;
3957 if (env.symbol != NULL) {
3958 if (specifiers->is_inline && is_type_valid(type)) {
3959 errorf(&env.source_position,
3960 "variable '%Y' declared 'inline'", env.symbol);
3963 bool invalid_storage_class = false;
3964 if (current_scope == file_scope) {
3965 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3966 specifiers->storage_class != STORAGE_CLASS_NONE &&
3967 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3968 invalid_storage_class = true;
3971 if (specifiers->thread_local &&
3972 specifiers->storage_class == STORAGE_CLASS_NONE) {
3973 invalid_storage_class = true;
3976 if (invalid_storage_class) {
3977 errorf(&env.source_position,
3978 "invalid storage class for variable '%Y'", env.symbol);
3983 if (env.symbol != NULL) {
3984 entity->base.symbol = env.symbol;
3985 entity->base.source_position = env.source_position;
3987 entity->base.source_position = specifiers->source_position;
3989 entity->base.namespc = NAMESPACE_NORMAL;
3990 entity->declaration.type = orig_type;
3991 entity->declaration.alignment = get_type_alignment(orig_type);
3992 entity->declaration.modifiers = env.modifiers;
3993 entity->declaration.attributes = attributes;
3995 storage_class_t storage_class = specifiers->storage_class;
3996 entity->declaration.declared_storage_class = storage_class;
3998 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3999 storage_class = STORAGE_CLASS_AUTO;
4000 entity->declaration.storage_class = storage_class;
4003 if (attributes != NULL) {
4004 handle_entity_attributes(attributes, entity);
4010 static type_t *parse_abstract_declarator(type_t *base_type)
4012 parse_declarator_env_t env;
4013 memset(&env, 0, sizeof(env));
4014 env.may_be_abstract = true;
4015 env.must_be_abstract = true;
4017 construct_type_t *construct_type = parse_inner_declarator(&env);
4019 type_t *result = construct_declarator_type(construct_type, base_type);
4020 if (construct_type != NULL) {
4021 obstack_free(&temp_obst, construct_type);
4023 result = handle_type_attributes(env.attributes, result);
4029 * Check if the declaration of main is suspicious. main should be a
4030 * function with external linkage, returning int, taking either zero
4031 * arguments, two, or three arguments of appropriate types, ie.
4033 * int main([ int argc, char **argv [, char **env ] ]).
4035 * @param decl the declaration to check
4036 * @param type the function type of the declaration
4038 static void check_main(const entity_t *entity)
4040 const source_position_t *pos = &entity->base.source_position;
4041 if (entity->kind != ENTITY_FUNCTION) {
4042 warningf(pos, "'main' is not a function");
4046 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4047 warningf(pos, "'main' is normally a non-static function");
4050 type_t *type = skip_typeref(entity->declaration.type);
4051 assert(is_type_function(type));
4053 function_type_t *func_type = &type->function;
4054 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4055 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4056 func_type->return_type);
4058 const function_parameter_t *parm = func_type->parameters;
4060 type_t *const first_type = skip_typeref(parm->type);
4061 type_t *const first_type_unqual = get_unqualified_type(first_type);
4062 if (!types_compatible(first_type_unqual, type_int)) {
4064 "first argument of 'main' should be 'int', but is '%T'",
4069 type_t *const second_type = skip_typeref(parm->type);
4070 type_t *const second_type_unqual
4071 = get_unqualified_type(second_type);
4072 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
4073 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'",
4078 type_t *const third_type = skip_typeref(parm->type);
4079 type_t *const third_type_unqual
4080 = get_unqualified_type(third_type);
4081 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
4082 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'",
4087 goto warn_arg_count;
4091 warningf(pos, "'main' takes only zero, two or three arguments");
4097 * Check if a symbol is the equal to "main".
4099 static bool is_sym_main(const symbol_t *const sym)
4101 return strcmp(sym->string, "main") == 0;
4104 static void error_redefined_as_different_kind(const source_position_t *pos,
4105 const entity_t *old, entity_kind_t new_kind)
4107 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4108 get_entity_kind_name(old->kind), old->base.symbol,
4109 get_entity_kind_name(new_kind), &old->base.source_position);
4112 static bool is_entity_valid(entity_t *const ent)
4114 if (is_declaration(ent)) {
4115 return is_type_valid(skip_typeref(ent->declaration.type));
4116 } else if (ent->kind == ENTITY_TYPEDEF) {
4117 return is_type_valid(skip_typeref(ent->typedefe.type));
4122 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4124 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4125 if (attributes_equal(tattr, attr))
4132 * test wether new_list contains any attributes not included in old_list
4134 static bool has_new_attributes(const attribute_t *old_list,
4135 const attribute_t *new_list)
4137 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4138 if (!contains_attribute(old_list, attr))
4145 * Merge in attributes from an attribute list (probably from a previous
4146 * declaration with the same name). Warning: destroys the old structure
4147 * of the attribute list - don't reuse attributes after this call.
4149 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4152 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4154 if (contains_attribute(decl->attributes, attr))
4157 /* move attribute to new declarations attributes list */
4158 attr->next = decl->attributes;
4159 decl->attributes = attr;
4164 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4165 * for various problems that occur for multiple definitions
4167 entity_t *record_entity(entity_t *entity, const bool is_definition)
4169 const symbol_t *const symbol = entity->base.symbol;
4170 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4171 const source_position_t *pos = &entity->base.source_position;
4173 /* can happen in error cases */
4177 entity_t *const previous_entity = get_entity(symbol, namespc);
4178 /* pushing the same entity twice will break the stack structure */
4179 assert(previous_entity != entity);
4181 if (entity->kind == ENTITY_FUNCTION) {
4182 type_t *const orig_type = entity->declaration.type;
4183 type_t *const type = skip_typeref(orig_type);
4185 assert(is_type_function(type));
4186 if (type->function.unspecified_parameters &&
4187 warning.strict_prototypes &&
4188 previous_entity == NULL) {
4189 warningf(pos, "function declaration '%#T' is not a prototype",
4193 if (warning.main && current_scope == file_scope
4194 && is_sym_main(symbol)) {
4199 if (is_declaration(entity) &&
4200 warning.nested_externs &&
4201 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4202 current_scope != file_scope) {
4203 warningf(pos, "nested extern declaration of '%#T'",
4204 entity->declaration.type, symbol);
4207 if (previous_entity != NULL) {
4208 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4209 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4210 assert(previous_entity->kind == ENTITY_PARAMETER);
4212 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4213 entity->declaration.type, symbol,
4214 previous_entity->declaration.type, symbol,
4215 &previous_entity->base.source_position);
4219 if (previous_entity->base.parent_scope == current_scope) {
4220 if (previous_entity->kind != entity->kind) {
4221 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4222 error_redefined_as_different_kind(pos, previous_entity,
4227 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4228 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4229 symbol, &previous_entity->base.source_position);
4232 if (previous_entity->kind == ENTITY_TYPEDEF) {
4233 /* TODO: C++ allows this for exactly the same type */
4234 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4235 symbol, &previous_entity->base.source_position);
4239 /* at this point we should have only VARIABLES or FUNCTIONS */
4240 assert(is_declaration(previous_entity) && is_declaration(entity));
4242 declaration_t *const prev_decl = &previous_entity->declaration;
4243 declaration_t *const decl = &entity->declaration;
4245 /* can happen for K&R style declarations */
4246 if (prev_decl->type == NULL &&
4247 previous_entity->kind == ENTITY_PARAMETER &&
4248 entity->kind == ENTITY_PARAMETER) {
4249 prev_decl->type = decl->type;
4250 prev_decl->storage_class = decl->storage_class;
4251 prev_decl->declared_storage_class = decl->declared_storage_class;
4252 prev_decl->modifiers = decl->modifiers;
4253 return previous_entity;
4256 type_t *const orig_type = decl->type;
4257 assert(orig_type != NULL);
4258 type_t *const type = skip_typeref(orig_type);
4259 type_t *const prev_type = skip_typeref(prev_decl->type);
4261 if (!types_compatible(type, prev_type)) {
4263 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4264 orig_type, symbol, prev_decl->type, symbol,
4265 &previous_entity->base.source_position);
4267 unsigned old_storage_class = prev_decl->storage_class;
4269 if (warning.redundant_decls &&
4272 !(prev_decl->modifiers & DM_USED) &&
4273 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4274 warningf(&previous_entity->base.source_position,
4275 "unnecessary static forward declaration for '%#T'",
4276 prev_decl->type, symbol);
4279 storage_class_t new_storage_class = decl->storage_class;
4281 /* pretend no storage class means extern for function
4282 * declarations (except if the previous declaration is neither
4283 * none nor extern) */
4284 if (entity->kind == ENTITY_FUNCTION) {
4285 /* the previous declaration could have unspecified parameters or
4286 * be a typedef, so use the new type */
4287 if (prev_type->function.unspecified_parameters || is_definition)
4288 prev_decl->type = type;
4290 switch (old_storage_class) {
4291 case STORAGE_CLASS_NONE:
4292 old_storage_class = STORAGE_CLASS_EXTERN;
4295 case STORAGE_CLASS_EXTERN:
4296 if (is_definition) {
4297 if (warning.missing_prototypes &&
4298 prev_type->function.unspecified_parameters &&
4299 !is_sym_main(symbol)) {
4300 warningf(pos, "no previous prototype for '%#T'",
4303 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4304 new_storage_class = STORAGE_CLASS_EXTERN;
4311 } else if (is_type_incomplete(prev_type)) {
4312 prev_decl->type = type;
4315 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4316 new_storage_class == STORAGE_CLASS_EXTERN) {
4318 warn_redundant_declaration: ;
4320 = has_new_attributes(prev_decl->attributes,
4322 if (has_new_attrs) {
4323 merge_in_attributes(decl, prev_decl->attributes);
4324 } else if (!is_definition &&
4325 warning.redundant_decls &&
4326 is_type_valid(prev_type) &&
4327 strcmp(previous_entity->base.source_position.input_name,
4328 "<builtin>") != 0) {
4330 "redundant declaration for '%Y' (declared %P)",
4331 symbol, &previous_entity->base.source_position);
4333 } else if (current_function == NULL) {
4334 if (old_storage_class != STORAGE_CLASS_STATIC &&
4335 new_storage_class == STORAGE_CLASS_STATIC) {
4337 "static declaration of '%Y' follows non-static declaration (declared %P)",
4338 symbol, &previous_entity->base.source_position);
4339 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4340 prev_decl->storage_class = STORAGE_CLASS_NONE;
4341 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4343 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4345 goto error_redeclaration;
4346 goto warn_redundant_declaration;
4348 } else if (is_type_valid(prev_type)) {
4349 if (old_storage_class == new_storage_class) {
4350 error_redeclaration:
4351 errorf(pos, "redeclaration of '%Y' (declared %P)",
4352 symbol, &previous_entity->base.source_position);
4355 "redeclaration of '%Y' with different linkage (declared %P)",
4356 symbol, &previous_entity->base.source_position);
4361 prev_decl->modifiers |= decl->modifiers;
4362 if (entity->kind == ENTITY_FUNCTION) {
4363 previous_entity->function.is_inline |= entity->function.is_inline;
4365 return previous_entity;
4368 if (warning.shadow ||
4369 (warning.shadow_local && previous_entity->base.parent_scope != file_scope)) {
4370 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4371 get_entity_kind_name(entity->kind), symbol,
4372 get_entity_kind_name(previous_entity->kind),
4373 &previous_entity->base.source_position);
4377 if (entity->kind == ENTITY_FUNCTION) {
4378 if (is_definition &&
4379 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4380 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4381 warningf(pos, "no previous prototype for '%#T'",
4382 entity->declaration.type, symbol);
4383 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4384 warningf(pos, "no previous declaration for '%#T'",
4385 entity->declaration.type, symbol);
4388 } else if (warning.missing_declarations &&
4389 entity->kind == ENTITY_VARIABLE &&
4390 current_scope == file_scope) {
4391 declaration_t *declaration = &entity->declaration;
4392 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4393 warningf(pos, "no previous declaration for '%#T'",
4394 declaration->type, symbol);
4399 assert(entity->base.parent_scope == NULL);
4400 assert(current_scope != NULL);
4402 entity->base.parent_scope = current_scope;
4403 entity->base.namespc = NAMESPACE_NORMAL;
4404 environment_push(entity);
4405 append_entity(current_scope, entity);
4410 static void parser_error_multiple_definition(entity_t *entity,
4411 const source_position_t *source_position)
4413 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4414 entity->base.symbol, &entity->base.source_position);
4417 static bool is_declaration_specifier(const token_t *token,
4418 bool only_specifiers_qualifiers)
4420 switch (token->type) {
4425 return is_typedef_symbol(token->symbol);
4427 case T___extension__:
4429 return !only_specifiers_qualifiers;
4436 static void parse_init_declarator_rest(entity_t *entity)
4438 type_t *orig_type = type_error_type;
4440 if (entity->base.kind == ENTITY_TYPEDEF) {
4441 errorf(&entity->base.source_position,
4442 "typedef '%Y' is initialized (use __typeof__ instead)",
4443 entity->base.symbol);
4445 assert(is_declaration(entity));
4446 orig_type = entity->declaration.type;
4450 type_t *type = skip_typeref(orig_type);
4452 if (entity->kind == ENTITY_VARIABLE
4453 && entity->variable.initializer != NULL) {
4454 parser_error_multiple_definition(entity, HERE);
4457 declaration_t *const declaration = &entity->declaration;
4458 bool must_be_constant = false;
4459 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4460 entity->base.parent_scope == file_scope) {
4461 must_be_constant = true;
4464 if (is_type_function(type)) {
4465 errorf(&entity->base.source_position,
4466 "function '%#T' is initialized like a variable",
4467 orig_type, entity->base.symbol);
4468 orig_type = type_error_type;
4471 parse_initializer_env_t env;
4472 env.type = orig_type;
4473 env.must_be_constant = must_be_constant;
4474 env.entity = entity;
4475 current_init_decl = entity;
4477 initializer_t *initializer = parse_initializer(&env);
4478 current_init_decl = NULL;
4480 if (entity->kind == ENTITY_VARIABLE) {
4481 /* §6.7.5:22 array initializers for arrays with unknown size
4482 * determine the array type size */
4483 declaration->type = env.type;
4484 entity->variable.initializer = initializer;
4488 /* parse rest of a declaration without any declarator */
4489 static void parse_anonymous_declaration_rest(
4490 const declaration_specifiers_t *specifiers)
4493 anonymous_entity = NULL;
4495 if (warning.other) {
4496 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4497 specifiers->thread_local) {
4498 warningf(&specifiers->source_position,
4499 "useless storage class in empty declaration");
4502 type_t *type = specifiers->type;
4503 switch (type->kind) {
4504 case TYPE_COMPOUND_STRUCT:
4505 case TYPE_COMPOUND_UNION: {
4506 if (type->compound.compound->base.symbol == NULL) {
4507 warningf(&specifiers->source_position,
4508 "unnamed struct/union that defines no instances");
4517 warningf(&specifiers->source_position, "empty declaration");
4523 static void check_variable_type_complete(entity_t *ent)
4525 if (ent->kind != ENTITY_VARIABLE)
4528 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4529 * type for the object shall be complete [...] */
4530 declaration_t *decl = &ent->declaration;
4531 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4532 decl->storage_class == STORAGE_CLASS_STATIC)
4535 type_t *const orig_type = decl->type;
4536 type_t *const type = skip_typeref(orig_type);
4537 if (!is_type_incomplete(type))
4540 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4541 * are given length one. */
4542 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4543 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4547 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4548 orig_type, ent->base.symbol);
4552 static void parse_declaration_rest(entity_t *ndeclaration,
4553 const declaration_specifiers_t *specifiers,
4554 parsed_declaration_func finished_declaration,
4555 declarator_flags_t flags)
4557 add_anchor_token(';');
4558 add_anchor_token(',');
4560 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4562 if (token.type == '=') {
4563 parse_init_declarator_rest(entity);
4564 } else if (entity->kind == ENTITY_VARIABLE) {
4565 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4566 * [...] where the extern specifier is explicitly used. */
4567 declaration_t *decl = &entity->declaration;
4568 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4569 type_t *type = decl->type;
4570 if (is_type_reference(skip_typeref(type))) {
4571 errorf(&entity->base.source_position,
4572 "reference '%#T' must be initialized",
4573 type, entity->base.symbol);
4578 check_variable_type_complete(entity);
4583 add_anchor_token('=');
4584 ndeclaration = parse_declarator(specifiers, flags);
4585 rem_anchor_token('=');
4587 expect(';', end_error);
4590 anonymous_entity = NULL;
4591 rem_anchor_token(';');
4592 rem_anchor_token(',');
4595 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4597 symbol_t *symbol = entity->base.symbol;
4601 assert(entity->base.namespc == NAMESPACE_NORMAL);
4602 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4603 if (previous_entity == NULL
4604 || previous_entity->base.parent_scope != current_scope) {
4605 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4610 if (is_definition) {
4611 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4614 return record_entity(entity, false);
4617 static void parse_declaration(parsed_declaration_func finished_declaration,
4618 declarator_flags_t flags)
4620 add_anchor_token(';');
4621 declaration_specifiers_t specifiers;
4622 parse_declaration_specifiers(&specifiers);
4623 rem_anchor_token(';');
4625 if (token.type == ';') {
4626 parse_anonymous_declaration_rest(&specifiers);
4628 entity_t *entity = parse_declarator(&specifiers, flags);
4629 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4634 static type_t *get_default_promoted_type(type_t *orig_type)
4636 type_t *result = orig_type;
4638 type_t *type = skip_typeref(orig_type);
4639 if (is_type_integer(type)) {
4640 result = promote_integer(type);
4641 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4642 result = type_double;
4648 static void parse_kr_declaration_list(entity_t *entity)
4650 if (entity->kind != ENTITY_FUNCTION)
4653 type_t *type = skip_typeref(entity->declaration.type);
4654 assert(is_type_function(type));
4655 if (!type->function.kr_style_parameters)
4658 add_anchor_token('{');
4660 /* push function parameters */
4661 size_t const top = environment_top();
4662 scope_t *old_scope = scope_push(&entity->function.parameters);
4664 entity_t *parameter = entity->function.parameters.entities;
4665 for ( ; parameter != NULL; parameter = parameter->base.next) {
4666 assert(parameter->base.parent_scope == NULL);
4667 parameter->base.parent_scope = current_scope;
4668 environment_push(parameter);
4671 /* parse declaration list */
4673 switch (token.type) {
4675 case T___extension__:
4676 /* This covers symbols, which are no type, too, and results in
4677 * better error messages. The typical cases are misspelled type
4678 * names and missing includes. */
4680 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4688 /* pop function parameters */
4689 assert(current_scope == &entity->function.parameters);
4690 scope_pop(old_scope);
4691 environment_pop_to(top);
4693 /* update function type */
4694 type_t *new_type = duplicate_type(type);
4696 function_parameter_t *parameters = NULL;
4697 function_parameter_t **anchor = ¶meters;
4699 /* did we have an earlier prototype? */
4700 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4701 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4704 function_parameter_t *proto_parameter = NULL;
4705 if (proto_type != NULL) {
4706 type_t *proto_type_type = proto_type->declaration.type;
4707 proto_parameter = proto_type_type->function.parameters;
4708 /* If a K&R function definition has a variadic prototype earlier, then
4709 * make the function definition variadic, too. This should conform to
4710 * §6.7.5.3:15 and §6.9.1:8. */
4711 new_type->function.variadic = proto_type_type->function.variadic;
4713 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4715 new_type->function.unspecified_parameters = true;
4718 bool need_incompatible_warning = false;
4719 parameter = entity->function.parameters.entities;
4720 for (; parameter != NULL; parameter = parameter->base.next,
4722 proto_parameter == NULL ? NULL : proto_parameter->next) {
4723 if (parameter->kind != ENTITY_PARAMETER)
4726 type_t *parameter_type = parameter->declaration.type;
4727 if (parameter_type == NULL) {
4729 errorf(HERE, "no type specified for function parameter '%Y'",
4730 parameter->base.symbol);
4731 parameter_type = type_error_type;
4733 if (warning.implicit_int) {
4734 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4735 parameter->base.symbol);
4737 parameter_type = type_int;
4739 parameter->declaration.type = parameter_type;
4742 semantic_parameter_incomplete(parameter);
4744 /* we need the default promoted types for the function type */
4745 type_t *not_promoted = parameter_type;
4746 parameter_type = get_default_promoted_type(parameter_type);
4748 /* gcc special: if the type of the prototype matches the unpromoted
4749 * type don't promote */
4750 if (!strict_mode && proto_parameter != NULL) {
4751 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4752 type_t *promo_skip = skip_typeref(parameter_type);
4753 type_t *param_skip = skip_typeref(not_promoted);
4754 if (!types_compatible(proto_p_type, promo_skip)
4755 && types_compatible(proto_p_type, param_skip)) {
4757 need_incompatible_warning = true;
4758 parameter_type = not_promoted;
4761 function_parameter_t *const parameter
4762 = allocate_parameter(parameter_type);
4764 *anchor = parameter;
4765 anchor = ¶meter->next;
4768 new_type->function.parameters = parameters;
4769 new_type = identify_new_type(new_type);
4771 if (warning.other && need_incompatible_warning) {
4772 type_t *proto_type_type = proto_type->declaration.type;
4774 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4775 proto_type_type, proto_type->base.symbol,
4776 new_type, entity->base.symbol,
4777 &proto_type->base.source_position);
4780 entity->declaration.type = new_type;
4782 rem_anchor_token('{');
4785 static bool first_err = true;
4788 * When called with first_err set, prints the name of the current function,
4791 static void print_in_function(void)
4795 diagnosticf("%s: In function '%Y':\n",
4796 current_function->base.base.source_position.input_name,
4797 current_function->base.base.symbol);
4802 * Check if all labels are defined in the current function.
4803 * Check if all labels are used in the current function.
4805 static void check_labels(void)
4807 for (const goto_statement_t *goto_statement = goto_first;
4808 goto_statement != NULL;
4809 goto_statement = goto_statement->next) {
4810 /* skip computed gotos */
4811 if (goto_statement->expression != NULL)
4814 label_t *label = goto_statement->label;
4817 if (label->base.source_position.input_name == NULL) {
4818 print_in_function();
4819 errorf(&goto_statement->base.source_position,
4820 "label '%Y' used but not defined", label->base.symbol);
4824 if (warning.unused_label) {
4825 for (const label_statement_t *label_statement = label_first;
4826 label_statement != NULL;
4827 label_statement = label_statement->next) {
4828 label_t *label = label_statement->label;
4830 if (! label->used) {
4831 print_in_function();
4832 warningf(&label_statement->base.source_position,
4833 "label '%Y' defined but not used", label->base.symbol);
4839 static void warn_unused_entity(entity_t *entity, entity_t *last)
4841 entity_t const *const end = last != NULL ? last->base.next : NULL;
4842 for (; entity != end; entity = entity->base.next) {
4843 if (!is_declaration(entity))
4846 declaration_t *declaration = &entity->declaration;
4847 if (declaration->implicit)
4850 if (!declaration->used) {
4851 print_in_function();
4852 const char *what = get_entity_kind_name(entity->kind);
4853 warningf(&entity->base.source_position, "%s '%Y' is unused",
4854 what, entity->base.symbol);
4855 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4856 print_in_function();
4857 const char *what = get_entity_kind_name(entity->kind);
4858 warningf(&entity->base.source_position, "%s '%Y' is never read",
4859 what, entity->base.symbol);
4864 static void check_unused_variables(statement_t *const stmt, void *const env)
4868 switch (stmt->kind) {
4869 case STATEMENT_DECLARATION: {
4870 declaration_statement_t const *const decls = &stmt->declaration;
4871 warn_unused_entity(decls->declarations_begin,
4872 decls->declarations_end);
4877 warn_unused_entity(stmt->fors.scope.entities, NULL);
4886 * Check declarations of current_function for unused entities.
4888 static void check_declarations(void)
4890 if (warning.unused_parameter) {
4891 const scope_t *scope = ¤t_function->parameters;
4893 /* do not issue unused warnings for main */
4894 if (!is_sym_main(current_function->base.base.symbol)) {
4895 warn_unused_entity(scope->entities, NULL);
4898 if (warning.unused_variable) {
4899 walk_statements(current_function->statement, check_unused_variables,
4904 static int determine_truth(expression_t const* const cond)
4907 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4908 fold_constant_to_bool(cond) ? 1 :
4912 static void check_reachable(statement_t *);
4913 static bool reaches_end;
4915 static bool expression_returns(expression_t const *const expr)
4917 switch (expr->kind) {
4919 expression_t const *const func = expr->call.function;
4920 if (func->kind == EXPR_REFERENCE) {
4921 entity_t *entity = func->reference.entity;
4922 if (entity->kind == ENTITY_FUNCTION
4923 && entity->declaration.modifiers & DM_NORETURN)
4927 if (!expression_returns(func))
4930 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4931 if (!expression_returns(arg->expression))
4938 case EXPR_REFERENCE:
4939 case EXPR_REFERENCE_ENUM_VALUE:
4941 case EXPR_STRING_LITERAL:
4942 case EXPR_WIDE_STRING_LITERAL:
4943 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4944 case EXPR_LABEL_ADDRESS:
4945 case EXPR_CLASSIFY_TYPE:
4946 case EXPR_SIZEOF: // TODO handle obscure VLA case
4949 case EXPR_BUILTIN_CONSTANT_P:
4950 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4955 case EXPR_STATEMENT: {
4956 bool old_reaches_end = reaches_end;
4957 reaches_end = false;
4958 check_reachable(expr->statement.statement);
4959 bool returns = reaches_end;
4960 reaches_end = old_reaches_end;
4964 case EXPR_CONDITIONAL:
4965 // TODO handle constant expression
4967 if (!expression_returns(expr->conditional.condition))
4970 if (expr->conditional.true_expression != NULL
4971 && expression_returns(expr->conditional.true_expression))
4974 return expression_returns(expr->conditional.false_expression);
4977 return expression_returns(expr->select.compound);
4979 case EXPR_ARRAY_ACCESS:
4981 expression_returns(expr->array_access.array_ref) &&
4982 expression_returns(expr->array_access.index);
4985 return expression_returns(expr->va_starte.ap);
4988 return expression_returns(expr->va_arge.ap);
4991 return expression_returns(expr->va_copye.src);
4993 EXPR_UNARY_CASES_MANDATORY
4994 return expression_returns(expr->unary.value);
4996 case EXPR_UNARY_THROW:
5000 // TODO handle constant lhs of && and ||
5002 expression_returns(expr->binary.left) &&
5003 expression_returns(expr->binary.right);
5009 panic("unhandled expression");
5012 static bool initializer_returns(initializer_t const *const init)
5014 switch (init->kind) {
5015 case INITIALIZER_VALUE:
5016 return expression_returns(init->value.value);
5018 case INITIALIZER_LIST: {
5019 initializer_t * const* i = init->list.initializers;
5020 initializer_t * const* const end = i + init->list.len;
5021 bool returns = true;
5022 for (; i != end; ++i) {
5023 if (!initializer_returns(*i))
5029 case INITIALIZER_STRING:
5030 case INITIALIZER_WIDE_STRING:
5031 case INITIALIZER_DESIGNATOR: // designators have no payload
5034 panic("unhandled initializer");
5037 static bool noreturn_candidate;
5039 static void check_reachable(statement_t *const stmt)
5041 if (stmt->base.reachable)
5043 if (stmt->kind != STATEMENT_DO_WHILE)
5044 stmt->base.reachable = true;
5046 statement_t *last = stmt;
5048 switch (stmt->kind) {
5049 case STATEMENT_INVALID:
5050 case STATEMENT_EMPTY:
5052 next = stmt->base.next;
5055 case STATEMENT_DECLARATION: {
5056 declaration_statement_t const *const decl = &stmt->declaration;
5057 entity_t const * ent = decl->declarations_begin;
5058 entity_t const *const last = decl->declarations_end;
5060 for (;; ent = ent->base.next) {
5061 if (ent->kind == ENTITY_VARIABLE &&
5062 ent->variable.initializer != NULL &&
5063 !initializer_returns(ent->variable.initializer)) {
5070 next = stmt->base.next;
5074 case STATEMENT_COMPOUND:
5075 next = stmt->compound.statements;
5077 next = stmt->base.next;
5080 case STATEMENT_RETURN: {
5081 expression_t const *const val = stmt->returns.value;
5082 if (val == NULL || expression_returns(val))
5083 noreturn_candidate = false;
5087 case STATEMENT_IF: {
5088 if_statement_t const *const ifs = &stmt->ifs;
5089 expression_t const *const cond = ifs->condition;
5091 if (!expression_returns(cond))
5094 int const val = determine_truth(cond);
5097 check_reachable(ifs->true_statement);
5102 if (ifs->false_statement != NULL) {
5103 check_reachable(ifs->false_statement);
5107 next = stmt->base.next;
5111 case STATEMENT_SWITCH: {
5112 switch_statement_t const *const switchs = &stmt->switchs;
5113 expression_t const *const expr = switchs->expression;
5115 if (!expression_returns(expr))
5118 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
5119 long const val = fold_constant_to_int(expr);
5120 case_label_statement_t * defaults = NULL;
5121 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5122 if (i->expression == NULL) {
5127 if (i->first_case <= val && val <= i->last_case) {
5128 check_reachable((statement_t*)i);
5133 if (defaults != NULL) {
5134 check_reachable((statement_t*)defaults);
5138 bool has_default = false;
5139 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5140 if (i->expression == NULL)
5143 check_reachable((statement_t*)i);
5150 next = stmt->base.next;
5154 case STATEMENT_EXPRESSION: {
5155 /* Check for noreturn function call */
5156 expression_t const *const expr = stmt->expression.expression;
5157 if (!expression_returns(expr))
5160 next = stmt->base.next;
5164 case STATEMENT_CONTINUE:
5165 for (statement_t *parent = stmt;;) {
5166 parent = parent->base.parent;
5167 if (parent == NULL) /* continue not within loop */
5171 switch (parent->kind) {
5172 case STATEMENT_WHILE: goto continue_while;
5173 case STATEMENT_DO_WHILE: goto continue_do_while;
5174 case STATEMENT_FOR: goto continue_for;
5180 case STATEMENT_BREAK:
5181 for (statement_t *parent = stmt;;) {
5182 parent = parent->base.parent;
5183 if (parent == NULL) /* break not within loop/switch */
5186 switch (parent->kind) {
5187 case STATEMENT_SWITCH:
5188 case STATEMENT_WHILE:
5189 case STATEMENT_DO_WHILE:
5192 next = parent->base.next;
5193 goto found_break_parent;
5201 case STATEMENT_GOTO:
5202 if (stmt->gotos.expression) {
5203 if (!expression_returns(stmt->gotos.expression))
5206 statement_t *parent = stmt->base.parent;
5207 if (parent == NULL) /* top level goto */
5211 next = stmt->gotos.label->statement;
5212 if (next == NULL) /* missing label */
5217 case STATEMENT_LABEL:
5218 next = stmt->label.statement;
5221 case STATEMENT_CASE_LABEL:
5222 next = stmt->case_label.statement;
5225 case STATEMENT_WHILE: {
5226 while_statement_t const *const whiles = &stmt->whiles;
5227 expression_t const *const cond = whiles->condition;
5229 if (!expression_returns(cond))
5232 int const val = determine_truth(cond);
5235 check_reachable(whiles->body);
5240 next = stmt->base.next;
5244 case STATEMENT_DO_WHILE:
5245 next = stmt->do_while.body;
5248 case STATEMENT_FOR: {
5249 for_statement_t *const fors = &stmt->fors;
5251 if (fors->condition_reachable)
5253 fors->condition_reachable = true;
5255 expression_t const *const cond = fors->condition;
5260 } else if (expression_returns(cond)) {
5261 val = determine_truth(cond);
5267 check_reachable(fors->body);
5272 next = stmt->base.next;
5276 case STATEMENT_MS_TRY: {
5277 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5278 check_reachable(ms_try->try_statement);
5279 next = ms_try->final_statement;
5283 case STATEMENT_LEAVE: {
5284 statement_t *parent = stmt;
5286 parent = parent->base.parent;
5287 if (parent == NULL) /* __leave not within __try */
5290 if (parent->kind == STATEMENT_MS_TRY) {
5292 next = parent->ms_try.final_statement;
5300 panic("invalid statement kind");
5303 while (next == NULL) {
5304 next = last->base.parent;
5306 noreturn_candidate = false;
5308 type_t *const type = skip_typeref(current_function->base.type);
5309 assert(is_type_function(type));
5310 type_t *const ret = skip_typeref(type->function.return_type);
5311 if (warning.return_type &&
5312 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5313 is_type_valid(ret) &&
5314 !is_sym_main(current_function->base.base.symbol)) {
5315 warningf(&stmt->base.source_position,
5316 "control reaches end of non-void function");
5321 switch (next->kind) {
5322 case STATEMENT_INVALID:
5323 case STATEMENT_EMPTY:
5324 case STATEMENT_DECLARATION:
5325 case STATEMENT_EXPRESSION:
5327 case STATEMENT_RETURN:
5328 case STATEMENT_CONTINUE:
5329 case STATEMENT_BREAK:
5330 case STATEMENT_GOTO:
5331 case STATEMENT_LEAVE:
5332 panic("invalid control flow in function");
5334 case STATEMENT_COMPOUND:
5335 if (next->compound.stmt_expr) {
5341 case STATEMENT_SWITCH:
5342 case STATEMENT_LABEL:
5343 case STATEMENT_CASE_LABEL:
5345 next = next->base.next;
5348 case STATEMENT_WHILE: {
5350 if (next->base.reachable)
5352 next->base.reachable = true;
5354 while_statement_t const *const whiles = &next->whiles;
5355 expression_t const *const cond = whiles->condition;
5357 if (!expression_returns(cond))
5360 int const val = determine_truth(cond);
5363 check_reachable(whiles->body);
5369 next = next->base.next;
5373 case STATEMENT_DO_WHILE: {
5375 if (next->base.reachable)
5377 next->base.reachable = true;
5379 do_while_statement_t const *const dw = &next->do_while;
5380 expression_t const *const cond = dw->condition;
5382 if (!expression_returns(cond))
5385 int const val = determine_truth(cond);
5388 check_reachable(dw->body);
5394 next = next->base.next;
5398 case STATEMENT_FOR: {
5400 for_statement_t *const fors = &next->fors;
5402 fors->step_reachable = true;
5404 if (fors->condition_reachable)
5406 fors->condition_reachable = true;
5408 expression_t const *const cond = fors->condition;
5413 } else if (expression_returns(cond)) {
5414 val = determine_truth(cond);
5420 check_reachable(fors->body);
5426 next = next->base.next;
5430 case STATEMENT_MS_TRY:
5432 next = next->ms_try.final_statement;
5437 check_reachable(next);
5440 static void check_unreachable(statement_t* const stmt, void *const env)
5444 switch (stmt->kind) {
5445 case STATEMENT_DO_WHILE:
5446 if (!stmt->base.reachable) {
5447 expression_t const *const cond = stmt->do_while.condition;
5448 if (determine_truth(cond) >= 0) {
5449 warningf(&cond->base.source_position,
5450 "condition of do-while-loop is unreachable");
5455 case STATEMENT_FOR: {
5456 for_statement_t const* const fors = &stmt->fors;
5458 // if init and step are unreachable, cond is unreachable, too
5459 if (!stmt->base.reachable && !fors->step_reachable) {
5460 warningf(&stmt->base.source_position, "statement is unreachable");
5462 if (!stmt->base.reachable && fors->initialisation != NULL) {
5463 warningf(&fors->initialisation->base.source_position,
5464 "initialisation of for-statement is unreachable");
5467 if (!fors->condition_reachable && fors->condition != NULL) {
5468 warningf(&fors->condition->base.source_position,
5469 "condition of for-statement is unreachable");
5472 if (!fors->step_reachable && fors->step != NULL) {
5473 warningf(&fors->step->base.source_position,
5474 "step of for-statement is unreachable");
5480 case STATEMENT_COMPOUND:
5481 if (stmt->compound.statements != NULL)
5483 goto warn_unreachable;
5485 case STATEMENT_DECLARATION: {
5486 /* Only warn if there is at least one declarator with an initializer.
5487 * This typically occurs in switch statements. */
5488 declaration_statement_t const *const decl = &stmt->declaration;
5489 entity_t const * ent = decl->declarations_begin;
5490 entity_t const *const last = decl->declarations_end;
5492 for (;; ent = ent->base.next) {
5493 if (ent->kind == ENTITY_VARIABLE &&
5494 ent->variable.initializer != NULL) {
5495 goto warn_unreachable;
5505 if (!stmt->base.reachable)
5506 warningf(&stmt->base.source_position, "statement is unreachable");
5511 static void parse_external_declaration(void)
5513 /* function-definitions and declarations both start with declaration
5515 add_anchor_token(';');
5516 declaration_specifiers_t specifiers;
5517 parse_declaration_specifiers(&specifiers);
5518 rem_anchor_token(';');
5520 /* must be a declaration */
5521 if (token.type == ';') {
5522 parse_anonymous_declaration_rest(&specifiers);
5526 add_anchor_token(',');
5527 add_anchor_token('=');
5528 add_anchor_token(';');
5529 add_anchor_token('{');
5531 /* declarator is common to both function-definitions and declarations */
5532 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5534 rem_anchor_token('{');
5535 rem_anchor_token(';');
5536 rem_anchor_token('=');
5537 rem_anchor_token(',');
5539 /* must be a declaration */
5540 switch (token.type) {
5544 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5549 /* must be a function definition */
5550 parse_kr_declaration_list(ndeclaration);
5552 if (token.type != '{') {
5553 parse_error_expected("while parsing function definition", '{', NULL);
5554 eat_until_matching_token(';');
5558 assert(is_declaration(ndeclaration));
5559 type_t *const orig_type = ndeclaration->declaration.type;
5560 type_t * type = skip_typeref(orig_type);
5562 if (!is_type_function(type)) {
5563 if (is_type_valid(type)) {
5564 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5565 type, ndeclaration->base.symbol);
5569 } else if (is_typeref(orig_type)) {
5571 errorf(&ndeclaration->base.source_position,
5572 "type of function definition '%#T' is a typedef",
5573 orig_type, ndeclaration->base.symbol);
5576 if (warning.aggregate_return &&
5577 is_type_compound(skip_typeref(type->function.return_type))) {
5578 warningf(&ndeclaration->base.source_position, "function '%Y' returns an aggregate",
5579 ndeclaration->base.symbol);
5581 if (warning.traditional && !type->function.unspecified_parameters) {
5582 warningf(&ndeclaration->base.source_position, "traditional C rejects ISO C style function definition of function '%Y'",
5583 ndeclaration->base.symbol);
5585 if (warning.old_style_definition && type->function.unspecified_parameters) {
5586 warningf(&ndeclaration->base.source_position, "old-style function definition '%Y'",
5587 ndeclaration->base.symbol);
5590 /* §6.7.5.3:14 a function definition with () means no
5591 * parameters (and not unspecified parameters) */
5592 if (type->function.unspecified_parameters &&
5593 type->function.parameters == NULL) {
5594 type_t *copy = duplicate_type(type);
5595 copy->function.unspecified_parameters = false;
5596 type = identify_new_type(copy);
5598 ndeclaration->declaration.type = type;
5601 entity_t *const entity = record_entity(ndeclaration, true);
5602 assert(entity->kind == ENTITY_FUNCTION);
5603 assert(ndeclaration->kind == ENTITY_FUNCTION);
5605 function_t *const function = &entity->function;
5606 if (ndeclaration != entity) {
5607 function->parameters = ndeclaration->function.parameters;
5609 assert(is_declaration(entity));
5610 type = skip_typeref(entity->declaration.type);
5612 /* push function parameters and switch scope */
5613 size_t const top = environment_top();
5614 scope_t *old_scope = scope_push(&function->parameters);
5616 entity_t *parameter = function->parameters.entities;
5617 for (; parameter != NULL; parameter = parameter->base.next) {
5618 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5619 parameter->base.parent_scope = current_scope;
5621 assert(parameter->base.parent_scope == NULL
5622 || parameter->base.parent_scope == current_scope);
5623 parameter->base.parent_scope = current_scope;
5624 if (parameter->base.symbol == NULL) {
5625 errorf(¶meter->base.source_position, "parameter name omitted");
5628 environment_push(parameter);
5631 if (function->statement != NULL) {
5632 parser_error_multiple_definition(entity, HERE);
5635 /* parse function body */
5636 int label_stack_top = label_top();
5637 function_t *old_current_function = current_function;
5638 entity_t *old_current_entity = current_entity;
5639 current_function = function;
5640 current_entity = entity;
5641 current_parent = NULL;
5644 goto_anchor = &goto_first;
5646 label_anchor = &label_first;
5648 statement_t *const body = parse_compound_statement(false);
5649 function->statement = body;
5652 check_declarations();
5653 if (warning.return_type ||
5654 warning.unreachable_code ||
5655 (warning.missing_noreturn
5656 && !(function->base.modifiers & DM_NORETURN))) {
5657 noreturn_candidate = true;
5658 check_reachable(body);
5659 if (warning.unreachable_code)
5660 walk_statements(body, check_unreachable, NULL);
5661 if (warning.missing_noreturn &&
5662 noreturn_candidate &&
5663 !(function->base.modifiers & DM_NORETURN)) {
5664 warningf(&body->base.source_position,
5665 "function '%#T' is candidate for attribute 'noreturn'",
5666 type, entity->base.symbol);
5670 assert(current_parent == NULL);
5671 assert(current_function == function);
5672 assert(current_entity == entity);
5673 current_entity = old_current_entity;
5674 current_function = old_current_function;
5675 label_pop_to(label_stack_top);
5678 assert(current_scope == &function->parameters);
5679 scope_pop(old_scope);
5680 environment_pop_to(top);
5683 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5684 source_position_t *source_position,
5685 const symbol_t *symbol)
5687 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5689 type->bitfield.base_type = base_type;
5690 type->bitfield.size_expression = size;
5693 type_t *skipped_type = skip_typeref(base_type);
5694 if (!is_type_integer(skipped_type)) {
5695 errorf(HERE, "bitfield base type '%T' is not an integer type",
5699 bit_size = get_type_size(base_type) * 8;
5702 if (is_constant_expression(size) == EXPR_CLASS_CONSTANT) {
5703 long v = fold_constant_to_int(size);
5704 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5707 errorf(source_position, "negative width in bit-field '%Y'",
5709 } else if (v == 0 && symbol != NULL) {
5710 errorf(source_position, "zero width for bit-field '%Y'",
5712 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5713 errorf(source_position, "width of '%Y' exceeds its type",
5716 type->bitfield.bit_size = v;
5723 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5725 entity_t *iter = compound->members.entities;
5726 for (; iter != NULL; iter = iter->base.next) {
5727 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5730 if (iter->base.symbol == symbol) {
5732 } else if (iter->base.symbol == NULL) {
5733 /* search in anonymous structs and unions */
5734 type_t *type = skip_typeref(iter->declaration.type);
5735 if (is_type_compound(type)) {
5736 if (find_compound_entry(type->compound.compound, symbol)
5747 static void check_deprecated(const source_position_t *source_position,
5748 const entity_t *entity)
5750 if (!warning.deprecated_declarations)
5752 if (!is_declaration(entity))
5754 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5757 char const *const prefix = get_entity_kind_name(entity->kind);
5758 const char *deprecated_string
5759 = get_deprecated_string(entity->declaration.attributes);
5760 if (deprecated_string != NULL) {
5761 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5762 prefix, entity->base.symbol, &entity->base.source_position,
5765 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5766 entity->base.symbol, &entity->base.source_position);
5771 static expression_t *create_select(const source_position_t *pos,
5773 type_qualifiers_t qualifiers,
5776 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5778 check_deprecated(pos, entry);
5780 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5781 select->select.compound = addr;
5782 select->select.compound_entry = entry;
5784 type_t *entry_type = entry->declaration.type;
5785 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5787 /* we always do the auto-type conversions; the & and sizeof parser contains
5788 * code to revert this! */
5789 select->base.type = automatic_type_conversion(res_type);
5790 if (res_type->kind == TYPE_BITFIELD) {
5791 select->base.type = res_type->bitfield.base_type;
5798 * Find entry with symbol in compound. Search anonymous structs and unions and
5799 * creates implicit select expressions for them.
5800 * Returns the adress for the innermost compound.
5802 static expression_t *find_create_select(const source_position_t *pos,
5804 type_qualifiers_t qualifiers,
5805 compound_t *compound, symbol_t *symbol)
5807 entity_t *iter = compound->members.entities;
5808 for (; iter != NULL; iter = iter->base.next) {
5809 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5812 symbol_t *iter_symbol = iter->base.symbol;
5813 if (iter_symbol == NULL) {
5814 type_t *type = iter->declaration.type;
5815 if (type->kind != TYPE_COMPOUND_STRUCT
5816 && type->kind != TYPE_COMPOUND_UNION)
5819 compound_t *sub_compound = type->compound.compound;
5821 if (find_compound_entry(sub_compound, symbol) == NULL)
5824 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5825 sub_addr->base.source_position = *pos;
5826 sub_addr->select.implicit = true;
5827 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5831 if (iter_symbol == symbol) {
5832 return create_select(pos, addr, qualifiers, iter);
5839 static void parse_compound_declarators(compound_t *compound,
5840 const declaration_specifiers_t *specifiers)
5845 if (token.type == ':') {
5846 source_position_t source_position = *HERE;
5849 type_t *base_type = specifiers->type;
5850 expression_t *size = parse_constant_expression();
5852 type_t *type = make_bitfield_type(base_type, size,
5853 &source_position, NULL);
5855 attribute_t *attributes = parse_attributes(NULL);
5856 attribute_t **anchor = &attributes;
5857 while (*anchor != NULL)
5858 anchor = &(*anchor)->next;
5859 *anchor = specifiers->attributes;
5861 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5862 entity->base.namespc = NAMESPACE_NORMAL;
5863 entity->base.source_position = source_position;
5864 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5865 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5866 entity->declaration.type = type;
5867 entity->declaration.attributes = attributes;
5869 if (attributes != NULL) {
5870 handle_entity_attributes(attributes, entity);
5872 append_entity(&compound->members, entity);
5874 entity = parse_declarator(specifiers,
5875 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5876 if (entity->kind == ENTITY_TYPEDEF) {
5877 errorf(&entity->base.source_position,
5878 "typedef not allowed as compound member");
5880 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5882 /* make sure we don't define a symbol multiple times */
5883 symbol_t *symbol = entity->base.symbol;
5884 if (symbol != NULL) {
5885 entity_t *prev = find_compound_entry(compound, symbol);
5887 errorf(&entity->base.source_position,
5888 "multiple declarations of symbol '%Y' (declared %P)",
5889 symbol, &prev->base.source_position);
5893 if (token.type == ':') {
5894 source_position_t source_position = *HERE;
5896 expression_t *size = parse_constant_expression();
5898 type_t *type = entity->declaration.type;
5899 type_t *bitfield_type = make_bitfield_type(type, size,
5900 &source_position, entity->base.symbol);
5902 attribute_t *attributes = parse_attributes(NULL);
5903 entity->declaration.type = bitfield_type;
5904 handle_entity_attributes(attributes, entity);
5906 type_t *orig_type = entity->declaration.type;
5907 type_t *type = skip_typeref(orig_type);
5908 if (is_type_function(type)) {
5909 errorf(&entity->base.source_position,
5910 "compound member '%Y' must not have function type '%T'",
5911 entity->base.symbol, orig_type);
5912 } else if (is_type_incomplete(type)) {
5913 /* §6.7.2.1:16 flexible array member */
5914 if (!is_type_array(type) ||
5915 token.type != ';' ||
5916 look_ahead(1)->type != '}') {
5917 errorf(&entity->base.source_position,
5918 "compound member '%Y' has incomplete type '%T'",
5919 entity->base.symbol, orig_type);
5924 append_entity(&compound->members, entity);
5927 } while (next_if(','));
5928 expect(';', end_error);
5931 anonymous_entity = NULL;
5934 static void parse_compound_type_entries(compound_t *compound)
5937 add_anchor_token('}');
5939 while (token.type != '}') {
5940 if (token.type == T_EOF) {
5941 errorf(HERE, "EOF while parsing struct");
5944 declaration_specifiers_t specifiers;
5945 parse_declaration_specifiers(&specifiers);
5946 parse_compound_declarators(compound, &specifiers);
5948 rem_anchor_token('}');
5952 compound->complete = true;
5955 static type_t *parse_typename(void)
5957 declaration_specifiers_t specifiers;
5958 parse_declaration_specifiers(&specifiers);
5959 if (specifiers.storage_class != STORAGE_CLASS_NONE
5960 || specifiers.thread_local) {
5961 /* TODO: improve error message, user does probably not know what a
5962 * storage class is...
5964 errorf(HERE, "typename must not have a storage class");
5967 type_t *result = parse_abstract_declarator(specifiers.type);
5975 typedef expression_t* (*parse_expression_function)(void);
5976 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5978 typedef struct expression_parser_function_t expression_parser_function_t;
5979 struct expression_parser_function_t {
5980 parse_expression_function parser;
5981 precedence_t infix_precedence;
5982 parse_expression_infix_function infix_parser;
5985 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5988 * Prints an error message if an expression was expected but not read
5990 static expression_t *expected_expression_error(void)
5992 /* skip the error message if the error token was read */
5993 if (token.type != T_ERROR) {
5994 errorf(HERE, "expected expression, got token %K", &token);
5998 return create_invalid_expression();
6001 static type_t *get_string_type(void)
6003 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
6006 static type_t *get_wide_string_type(void)
6008 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6012 * Parse a string constant.
6014 static expression_t *parse_string_literal(void)
6016 source_position_t begin = token.source_position;
6017 string_t res = token.literal;
6018 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
6021 while (token.type == T_STRING_LITERAL
6022 || token.type == T_WIDE_STRING_LITERAL) {
6023 warn_string_concat(&token.source_position);
6024 res = concat_strings(&res, &token.literal);
6026 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6029 expression_t *literal;
6031 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6032 literal->base.type = get_wide_string_type();
6034 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6035 literal->base.type = get_string_type();
6037 literal->base.source_position = begin;
6038 literal->literal.value = res;
6044 * Parse a boolean constant.
6046 static expression_t *parse_boolean_literal(bool value)
6048 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6049 literal->base.source_position = token.source_position;
6050 literal->base.type = type_bool;
6051 literal->literal.value.begin = value ? "true" : "false";
6052 literal->literal.value.size = value ? 4 : 5;
6058 static void warn_traditional_suffix(void)
6060 if (!warning.traditional)
6062 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6066 static void check_integer_suffix(void)
6068 symbol_t *suffix = token.symbol;
6072 bool not_traditional = false;
6073 const char *c = suffix->string;
6074 if (*c == 'l' || *c == 'L') {
6077 not_traditional = true;
6079 if (*c == 'u' || *c == 'U') {
6082 } else if (*c == 'u' || *c == 'U') {
6083 not_traditional = true;
6086 } else if (*c == 'u' || *c == 'U') {
6087 not_traditional = true;
6089 if (*c == 'l' || *c == 'L') {
6097 errorf(&token.source_position,
6098 "invalid suffix '%s' on integer constant", suffix->string);
6099 } else if (not_traditional) {
6100 warn_traditional_suffix();
6104 static type_t *check_floatingpoint_suffix(void)
6106 symbol_t *suffix = token.symbol;
6107 type_t *type = type_double;
6111 bool not_traditional = false;
6112 const char *c = suffix->string;
6113 if (*c == 'f' || *c == 'F') {
6116 } else if (*c == 'l' || *c == 'L') {
6118 type = type_long_double;
6121 errorf(&token.source_position,
6122 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6123 } else if (not_traditional) {
6124 warn_traditional_suffix();
6131 * Parse an integer constant.
6133 static expression_t *parse_number_literal(void)
6135 expression_kind_t kind;
6138 switch (token.type) {
6140 kind = EXPR_LITERAL_INTEGER;
6141 check_integer_suffix();
6144 case T_INTEGER_OCTAL:
6145 kind = EXPR_LITERAL_INTEGER_OCTAL;
6146 check_integer_suffix();
6149 case T_INTEGER_HEXADECIMAL:
6150 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6151 check_integer_suffix();
6154 case T_FLOATINGPOINT:
6155 kind = EXPR_LITERAL_FLOATINGPOINT;
6156 type = check_floatingpoint_suffix();
6158 case T_FLOATINGPOINT_HEXADECIMAL:
6159 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6160 type = check_floatingpoint_suffix();
6163 panic("unexpected token type in parse_number_literal");
6166 expression_t *literal = allocate_expression_zero(kind);
6167 literal->base.source_position = token.source_position;
6168 literal->base.type = type;
6169 literal->literal.value = token.literal;
6170 literal->literal.suffix = token.symbol;
6173 /* integer type depends on the size of the number and the size
6174 * representable by the types. The backend/codegeneration has to determine
6177 determine_literal_type(&literal->literal);
6182 * Parse a character constant.
6184 static expression_t *parse_character_constant(void)
6186 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6187 literal->base.source_position = token.source_position;
6188 literal->base.type = c_mode & _CXX ? type_char : type_int;
6189 literal->literal.value = token.literal;
6191 size_t len = literal->literal.value.size;
6193 if (!GNU_MODE && !(c_mode & _C99)) {
6194 errorf(HERE, "more than 1 character in character constant");
6195 } else if (warning.multichar) {
6196 literal->base.type = type_int;
6197 warningf(HERE, "multi-character character constant");
6206 * Parse a wide character constant.
6208 static expression_t *parse_wide_character_constant(void)
6210 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6211 literal->base.source_position = token.source_position;
6212 literal->base.type = type_int;
6213 literal->literal.value = token.literal;
6215 size_t len = wstrlen(&literal->literal.value);
6217 warningf(HERE, "multi-character character constant");
6224 static entity_t *create_implicit_function(symbol_t *symbol,
6225 const source_position_t *source_position)
6227 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6228 ntype->function.return_type = type_int;
6229 ntype->function.unspecified_parameters = true;
6230 ntype->function.linkage = LINKAGE_C;
6231 type_t *type = identify_new_type(ntype);
6233 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6234 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6235 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6236 entity->declaration.type = type;
6237 entity->declaration.implicit = true;
6238 entity->base.namespc = NAMESPACE_NORMAL;
6239 entity->base.symbol = symbol;
6240 entity->base.source_position = *source_position;
6242 if (current_scope != NULL) {
6243 bool strict_prototypes_old = warning.strict_prototypes;
6244 warning.strict_prototypes = false;
6245 record_entity(entity, false);
6246 warning.strict_prototypes = strict_prototypes_old;
6253 * Performs automatic type cast as described in §6.3.2.1.
6255 * @param orig_type the original type
6257 static type_t *automatic_type_conversion(type_t *orig_type)
6259 type_t *type = skip_typeref(orig_type);
6260 if (is_type_array(type)) {
6261 array_type_t *array_type = &type->array;
6262 type_t *element_type = array_type->element_type;
6263 unsigned qualifiers = array_type->base.qualifiers;
6265 return make_pointer_type(element_type, qualifiers);
6268 if (is_type_function(type)) {
6269 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6276 * reverts the automatic casts of array to pointer types and function
6277 * to function-pointer types as defined §6.3.2.1
6279 type_t *revert_automatic_type_conversion(const expression_t *expression)
6281 switch (expression->kind) {
6282 case EXPR_REFERENCE: {
6283 entity_t *entity = expression->reference.entity;
6284 if (is_declaration(entity)) {
6285 return entity->declaration.type;
6286 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6287 return entity->enum_value.enum_type;
6289 panic("no declaration or enum in reference");
6294 entity_t *entity = expression->select.compound_entry;
6295 assert(is_declaration(entity));
6296 type_t *type = entity->declaration.type;
6297 return get_qualified_type(type,
6298 expression->base.type->base.qualifiers);
6301 case EXPR_UNARY_DEREFERENCE: {
6302 const expression_t *const value = expression->unary.value;
6303 type_t *const type = skip_typeref(value->base.type);
6304 if (!is_type_pointer(type))
6305 return type_error_type;
6306 return type->pointer.points_to;
6309 case EXPR_ARRAY_ACCESS: {
6310 const expression_t *array_ref = expression->array_access.array_ref;
6311 type_t *type_left = skip_typeref(array_ref->base.type);
6312 if (!is_type_pointer(type_left))
6313 return type_error_type;
6314 return type_left->pointer.points_to;
6317 case EXPR_STRING_LITERAL: {
6318 size_t size = expression->string_literal.value.size;
6319 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6322 case EXPR_WIDE_STRING_LITERAL: {
6323 size_t size = wstrlen(&expression->string_literal.value);
6324 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6327 case EXPR_COMPOUND_LITERAL:
6328 return expression->compound_literal.type;
6333 return expression->base.type;
6337 * Find an entity matching a symbol in a scope.
6338 * Uses current scope if scope is NULL
6340 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6341 namespace_tag_t namespc)
6343 if (scope == NULL) {
6344 return get_entity(symbol, namespc);
6347 /* we should optimize here, if scope grows above a certain size we should
6348 construct a hashmap here... */
6349 entity_t *entity = scope->entities;
6350 for ( ; entity != NULL; entity = entity->base.next) {
6351 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6358 static entity_t *parse_qualified_identifier(void)
6360 /* namespace containing the symbol */
6362 source_position_t pos;
6363 const scope_t *lookup_scope = NULL;
6365 if (next_if(T_COLONCOLON))
6366 lookup_scope = &unit->scope;
6370 if (token.type != T_IDENTIFIER) {
6371 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6372 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6374 symbol = token.symbol;
6379 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6381 if (!next_if(T_COLONCOLON))
6384 switch (entity->kind) {
6385 case ENTITY_NAMESPACE:
6386 lookup_scope = &entity->namespacee.members;
6391 lookup_scope = &entity->compound.members;
6394 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6395 symbol, get_entity_kind_name(entity->kind));
6400 if (entity == NULL) {
6401 if (!strict_mode && token.type == '(') {
6402 /* an implicitly declared function */
6403 if (warning.error_implicit_function_declaration) {
6404 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6405 } else if (warning.implicit_function_declaration) {
6406 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6409 entity = create_implicit_function(symbol, &pos);
6411 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6412 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6419 /* skip further qualifications */
6420 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6422 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6425 static expression_t *parse_reference(void)
6427 source_position_t const pos = token.source_position;
6428 entity_t *const entity = parse_qualified_identifier();
6431 if (is_declaration(entity)) {
6432 orig_type = entity->declaration.type;
6433 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6434 orig_type = entity->enum_value.enum_type;
6436 panic("expected declaration or enum value in reference");
6439 /* we always do the auto-type conversions; the & and sizeof parser contains
6440 * code to revert this! */
6441 type_t *type = automatic_type_conversion(orig_type);
6443 expression_kind_t kind = EXPR_REFERENCE;
6444 if (entity->kind == ENTITY_ENUM_VALUE)
6445 kind = EXPR_REFERENCE_ENUM_VALUE;
6447 expression_t *expression = allocate_expression_zero(kind);
6448 expression->base.source_position = pos;
6449 expression->base.type = type;
6450 expression->reference.entity = entity;
6452 /* this declaration is used */
6453 if (is_declaration(entity)) {
6454 entity->declaration.used = true;
6457 if (entity->base.parent_scope != file_scope
6458 && (current_function != NULL
6459 && entity->base.parent_scope->depth < current_function->parameters.depth)
6460 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6461 if (entity->kind == ENTITY_VARIABLE) {
6462 /* access of a variable from an outer function */
6463 entity->variable.address_taken = true;
6464 } else if (entity->kind == ENTITY_PARAMETER) {
6465 entity->parameter.address_taken = true;
6467 current_function->need_closure = true;
6470 check_deprecated(HERE, entity);
6472 if (warning.init_self && entity == current_init_decl && !in_type_prop
6473 && entity->kind == ENTITY_VARIABLE) {
6474 current_init_decl = NULL;
6475 warningf(&pos, "variable '%#T' is initialized by itself",
6476 entity->declaration.type, entity->base.symbol);
6482 static bool semantic_cast(expression_t *cast)
6484 expression_t *expression = cast->unary.value;
6485 type_t *orig_dest_type = cast->base.type;
6486 type_t *orig_type_right = expression->base.type;
6487 type_t const *dst_type = skip_typeref(orig_dest_type);
6488 type_t const *src_type = skip_typeref(orig_type_right);
6489 source_position_t const *pos = &cast->base.source_position;
6491 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6492 if (dst_type == type_void)
6495 /* only integer and pointer can be casted to pointer */
6496 if (is_type_pointer(dst_type) &&
6497 !is_type_pointer(src_type) &&
6498 !is_type_integer(src_type) &&
6499 is_type_valid(src_type)) {
6500 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6504 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6505 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6509 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6510 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6514 if (warning.cast_qual &&
6515 is_type_pointer(src_type) &&
6516 is_type_pointer(dst_type)) {
6517 type_t *src = skip_typeref(src_type->pointer.points_to);
6518 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6519 unsigned missing_qualifiers =
6520 src->base.qualifiers & ~dst->base.qualifiers;
6521 if (missing_qualifiers != 0) {
6523 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6524 missing_qualifiers, orig_type_right);
6530 static expression_t *parse_compound_literal(type_t *type)
6532 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6534 parse_initializer_env_t env;
6537 env.must_be_constant = false;
6538 initializer_t *initializer = parse_initializer(&env);
6541 expression->compound_literal.initializer = initializer;
6542 expression->compound_literal.type = type;
6543 expression->base.type = automatic_type_conversion(type);
6549 * Parse a cast expression.
6551 static expression_t *parse_cast(void)
6553 source_position_t source_position = token.source_position;
6556 add_anchor_token(')');
6558 type_t *type = parse_typename();
6560 rem_anchor_token(')');
6561 expect(')', end_error);
6563 if (token.type == '{') {
6564 return parse_compound_literal(type);
6567 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6568 cast->base.source_position = source_position;
6570 expression_t *value = parse_subexpression(PREC_CAST);
6571 cast->base.type = type;
6572 cast->unary.value = value;
6574 if (! semantic_cast(cast)) {
6575 /* TODO: record the error in the AST. else it is impossible to detect it */
6580 return create_invalid_expression();
6584 * Parse a statement expression.
6586 static expression_t *parse_statement_expression(void)
6588 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6591 add_anchor_token(')');
6593 statement_t *statement = parse_compound_statement(true);
6594 statement->compound.stmt_expr = true;
6595 expression->statement.statement = statement;
6597 /* find last statement and use its type */
6598 type_t *type = type_void;
6599 const statement_t *stmt = statement->compound.statements;
6601 while (stmt->base.next != NULL)
6602 stmt = stmt->base.next;
6604 if (stmt->kind == STATEMENT_EXPRESSION) {
6605 type = stmt->expression.expression->base.type;
6607 } else if (warning.other) {
6608 warningf(&expression->base.source_position, "empty statement expression ({})");
6610 expression->base.type = type;
6612 rem_anchor_token(')');
6613 expect(')', end_error);
6620 * Parse a parenthesized expression.
6622 static expression_t *parse_parenthesized_expression(void)
6624 token_t const* const la1 = look_ahead(1);
6625 switch (la1->type) {
6627 /* gcc extension: a statement expression */
6628 return parse_statement_expression();
6631 if (is_typedef_symbol(la1->symbol)) {
6634 return parse_cast();
6639 add_anchor_token(')');
6640 expression_t *result = parse_expression();
6641 result->base.parenthesized = true;
6642 rem_anchor_token(')');
6643 expect(')', end_error);
6649 static expression_t *parse_function_keyword(void)
6653 if (current_function == NULL) {
6654 errorf(HERE, "'__func__' used outside of a function");
6657 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6658 expression->base.type = type_char_ptr;
6659 expression->funcname.kind = FUNCNAME_FUNCTION;
6666 static expression_t *parse_pretty_function_keyword(void)
6668 if (current_function == NULL) {
6669 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6672 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6673 expression->base.type = type_char_ptr;
6674 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6676 eat(T___PRETTY_FUNCTION__);
6681 static expression_t *parse_funcsig_keyword(void)
6683 if (current_function == NULL) {
6684 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6687 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6688 expression->base.type = type_char_ptr;
6689 expression->funcname.kind = FUNCNAME_FUNCSIG;
6696 static expression_t *parse_funcdname_keyword(void)
6698 if (current_function == NULL) {
6699 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6702 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6703 expression->base.type = type_char_ptr;
6704 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6706 eat(T___FUNCDNAME__);
6711 static designator_t *parse_designator(void)
6713 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6714 result->source_position = *HERE;
6716 if (token.type != T_IDENTIFIER) {
6717 parse_error_expected("while parsing member designator",
6718 T_IDENTIFIER, NULL);
6721 result->symbol = token.symbol;
6724 designator_t *last_designator = result;
6727 if (token.type != T_IDENTIFIER) {
6728 parse_error_expected("while parsing member designator",
6729 T_IDENTIFIER, NULL);
6732 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6733 designator->source_position = *HERE;
6734 designator->symbol = token.symbol;
6737 last_designator->next = designator;
6738 last_designator = designator;
6742 add_anchor_token(']');
6743 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6744 designator->source_position = *HERE;
6745 designator->array_index = parse_expression();
6746 rem_anchor_token(']');
6747 expect(']', end_error);
6748 if (designator->array_index == NULL) {
6752 last_designator->next = designator;
6753 last_designator = designator;
6765 * Parse the __builtin_offsetof() expression.
6767 static expression_t *parse_offsetof(void)
6769 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6770 expression->base.type = type_size_t;
6772 eat(T___builtin_offsetof);
6774 expect('(', end_error);
6775 add_anchor_token(',');
6776 type_t *type = parse_typename();
6777 rem_anchor_token(',');
6778 expect(',', end_error);
6779 add_anchor_token(')');
6780 designator_t *designator = parse_designator();
6781 rem_anchor_token(')');
6782 expect(')', end_error);
6784 expression->offsetofe.type = type;
6785 expression->offsetofe.designator = designator;
6788 memset(&path, 0, sizeof(path));
6789 path.top_type = type;
6790 path.path = NEW_ARR_F(type_path_entry_t, 0);
6792 descend_into_subtype(&path);
6794 if (!walk_designator(&path, designator, true)) {
6795 return create_invalid_expression();
6798 DEL_ARR_F(path.path);
6802 return create_invalid_expression();
6806 * Parses a _builtin_va_start() expression.
6808 static expression_t *parse_va_start(void)
6810 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6812 eat(T___builtin_va_start);
6814 expect('(', end_error);
6815 add_anchor_token(',');
6816 expression->va_starte.ap = parse_assignment_expression();
6817 rem_anchor_token(',');
6818 expect(',', end_error);
6819 expression_t *const expr = parse_assignment_expression();
6820 if (expr->kind == EXPR_REFERENCE) {
6821 entity_t *const entity = expr->reference.entity;
6822 if (!current_function->base.type->function.variadic) {
6823 errorf(&expr->base.source_position,
6824 "'va_start' used in non-variadic function");
6825 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6826 entity->base.next != NULL ||
6827 entity->kind != ENTITY_PARAMETER) {
6828 errorf(&expr->base.source_position,
6829 "second argument of 'va_start' must be last parameter of the current function");
6831 expression->va_starte.parameter = &entity->variable;
6833 expect(')', end_error);
6836 expect(')', end_error);
6838 return create_invalid_expression();
6842 * Parses a __builtin_va_arg() expression.
6844 static expression_t *parse_va_arg(void)
6846 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6848 eat(T___builtin_va_arg);
6850 expect('(', end_error);
6852 ap.expression = parse_assignment_expression();
6853 expression->va_arge.ap = ap.expression;
6854 check_call_argument(type_valist, &ap, 1);
6856 expect(',', end_error);
6857 expression->base.type = parse_typename();
6858 expect(')', end_error);
6862 return create_invalid_expression();
6866 * Parses a __builtin_va_copy() expression.
6868 static expression_t *parse_va_copy(void)
6870 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6872 eat(T___builtin_va_copy);
6874 expect('(', end_error);
6875 expression_t *dst = parse_assignment_expression();
6876 assign_error_t error = semantic_assign(type_valist, dst);
6877 report_assign_error(error, type_valist, dst, "call argument 1",
6878 &dst->base.source_position);
6879 expression->va_copye.dst = dst;
6881 expect(',', end_error);
6883 call_argument_t src;
6884 src.expression = parse_assignment_expression();
6885 check_call_argument(type_valist, &src, 2);
6886 expression->va_copye.src = src.expression;
6887 expect(')', end_error);
6891 return create_invalid_expression();
6895 * Parses a __builtin_constant_p() expression.
6897 static expression_t *parse_builtin_constant(void)
6899 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6901 eat(T___builtin_constant_p);
6903 expect('(', end_error);
6904 add_anchor_token(')');
6905 expression->builtin_constant.value = parse_assignment_expression();
6906 rem_anchor_token(')');
6907 expect(')', end_error);
6908 expression->base.type = type_int;
6912 return create_invalid_expression();
6916 * Parses a __builtin_types_compatible_p() expression.
6918 static expression_t *parse_builtin_types_compatible(void)
6920 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6922 eat(T___builtin_types_compatible_p);
6924 expect('(', end_error);
6925 add_anchor_token(')');
6926 add_anchor_token(',');
6927 expression->builtin_types_compatible.left = parse_typename();
6928 rem_anchor_token(',');
6929 expect(',', end_error);
6930 expression->builtin_types_compatible.right = parse_typename();
6931 rem_anchor_token(')');
6932 expect(')', end_error);
6933 expression->base.type = type_int;
6937 return create_invalid_expression();
6941 * Parses a __builtin_is_*() compare expression.
6943 static expression_t *parse_compare_builtin(void)
6945 expression_t *expression;
6947 switch (token.type) {
6948 case T___builtin_isgreater:
6949 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6951 case T___builtin_isgreaterequal:
6952 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6954 case T___builtin_isless:
6955 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6957 case T___builtin_islessequal:
6958 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6960 case T___builtin_islessgreater:
6961 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6963 case T___builtin_isunordered:
6964 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6967 internal_errorf(HERE, "invalid compare builtin found");
6969 expression->base.source_position = *HERE;
6972 expect('(', end_error);
6973 expression->binary.left = parse_assignment_expression();
6974 expect(',', end_error);
6975 expression->binary.right = parse_assignment_expression();
6976 expect(')', end_error);
6978 type_t *const orig_type_left = expression->binary.left->base.type;
6979 type_t *const orig_type_right = expression->binary.right->base.type;
6981 type_t *const type_left = skip_typeref(orig_type_left);
6982 type_t *const type_right = skip_typeref(orig_type_right);
6983 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6984 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6985 type_error_incompatible("invalid operands in comparison",
6986 &expression->base.source_position, orig_type_left, orig_type_right);
6989 semantic_comparison(&expression->binary);
6994 return create_invalid_expression();
6998 * Parses a MS assume() expression.
7000 static expression_t *parse_assume(void)
7002 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7006 expect('(', end_error);
7007 add_anchor_token(')');
7008 expression->unary.value = parse_assignment_expression();
7009 rem_anchor_token(')');
7010 expect(')', end_error);
7012 expression->base.type = type_void;
7015 return create_invalid_expression();
7019 * Return the declaration for a given label symbol or create a new one.
7021 * @param symbol the symbol of the label
7023 static label_t *get_label(symbol_t *symbol)
7026 assert(current_function != NULL);
7028 label = get_entity(symbol, NAMESPACE_LABEL);
7029 /* if we found a local label, we already created the declaration */
7030 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7031 if (label->base.parent_scope != current_scope) {
7032 assert(label->base.parent_scope->depth < current_scope->depth);
7033 current_function->goto_to_outer = true;
7035 return &label->label;
7038 label = get_entity(symbol, NAMESPACE_LABEL);
7039 /* if we found a label in the same function, then we already created the
7042 && label->base.parent_scope == ¤t_function->parameters) {
7043 return &label->label;
7046 /* otherwise we need to create a new one */
7047 label = allocate_entity_zero(ENTITY_LABEL);
7048 label->base.namespc = NAMESPACE_LABEL;
7049 label->base.symbol = symbol;
7053 return &label->label;
7057 * Parses a GNU && label address expression.
7059 static expression_t *parse_label_address(void)
7061 source_position_t source_position = token.source_position;
7063 if (token.type != T_IDENTIFIER) {
7064 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7067 symbol_t *symbol = token.symbol;
7070 label_t *label = get_label(symbol);
7072 label->address_taken = true;
7074 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7075 expression->base.source_position = source_position;
7077 /* label address is threaten as a void pointer */
7078 expression->base.type = type_void_ptr;
7079 expression->label_address.label = label;
7082 return create_invalid_expression();
7086 * Parse a microsoft __noop expression.
7088 static expression_t *parse_noop_expression(void)
7090 /* the result is a (int)0 */
7091 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7092 literal->base.type = type_int;
7093 literal->base.source_position = token.source_position;
7094 literal->literal.value.begin = "__noop";
7095 literal->literal.value.size = 6;
7099 if (token.type == '(') {
7100 /* parse arguments */
7102 add_anchor_token(')');
7103 add_anchor_token(',');
7105 if (token.type != ')') do {
7106 (void)parse_assignment_expression();
7107 } while (next_if(','));
7109 rem_anchor_token(',');
7110 rem_anchor_token(')');
7111 expect(')', end_error);
7118 * Parses a primary expression.
7120 static expression_t *parse_primary_expression(void)
7122 switch (token.type) {
7123 case T_false: return parse_boolean_literal(false);
7124 case T_true: return parse_boolean_literal(true);
7126 case T_INTEGER_OCTAL:
7127 case T_INTEGER_HEXADECIMAL:
7128 case T_FLOATINGPOINT:
7129 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7130 case T_CHARACTER_CONSTANT: return parse_character_constant();
7131 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7132 case T_STRING_LITERAL:
7133 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7134 case T___FUNCTION__:
7135 case T___func__: return parse_function_keyword();
7136 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7137 case T___FUNCSIG__: return parse_funcsig_keyword();
7138 case T___FUNCDNAME__: return parse_funcdname_keyword();
7139 case T___builtin_offsetof: return parse_offsetof();
7140 case T___builtin_va_start: return parse_va_start();
7141 case T___builtin_va_arg: return parse_va_arg();
7142 case T___builtin_va_copy: return parse_va_copy();
7143 case T___builtin_isgreater:
7144 case T___builtin_isgreaterequal:
7145 case T___builtin_isless:
7146 case T___builtin_islessequal:
7147 case T___builtin_islessgreater:
7148 case T___builtin_isunordered: return parse_compare_builtin();
7149 case T___builtin_constant_p: return parse_builtin_constant();
7150 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7151 case T__assume: return parse_assume();
7154 return parse_label_address();
7157 case '(': return parse_parenthesized_expression();
7158 case T___noop: return parse_noop_expression();
7160 /* Gracefully handle type names while parsing expressions. */
7162 return parse_reference();
7164 if (!is_typedef_symbol(token.symbol)) {
7165 return parse_reference();
7169 source_position_t const pos = *HERE;
7170 type_t const *const type = parse_typename();
7171 errorf(&pos, "encountered type '%T' while parsing expression", type);
7172 return create_invalid_expression();
7176 errorf(HERE, "unexpected token %K, expected an expression", &token);
7178 return create_invalid_expression();
7181 static expression_t *parse_array_expression(expression_t *left)
7183 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7184 array_access_expression_t *const arr = &expr->array_access;
7187 add_anchor_token(']');
7189 expression_t *const inside = parse_expression();
7191 type_t *const orig_type_left = left->base.type;
7192 type_t *const orig_type_inside = inside->base.type;
7194 type_t *const type_left = skip_typeref(orig_type_left);
7195 type_t *const type_inside = skip_typeref(orig_type_inside);
7201 if (is_type_pointer(type_left)) {
7204 idx_type = type_inside;
7205 res_type = type_left->pointer.points_to;
7207 } else if (is_type_pointer(type_inside)) {
7208 arr->flipped = true;
7211 idx_type = type_left;
7212 res_type = type_inside->pointer.points_to;
7214 res_type = automatic_type_conversion(res_type);
7215 if (!is_type_integer(idx_type)) {
7216 errorf(&idx->base.source_position, "array subscript must have integer type");
7217 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR) && warning.char_subscripts) {
7218 warningf(&idx->base.source_position, "array subscript has char type");
7221 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7223 "array access on object with non-pointer types '%T', '%T'",
7224 orig_type_left, orig_type_inside);
7226 res_type = type_error_type;
7231 arr->array_ref = ref;
7233 arr->base.type = res_type;
7235 rem_anchor_token(']');
7236 expect(']', end_error);
7241 static expression_t *parse_typeprop(expression_kind_t const kind)
7243 expression_t *tp_expression = allocate_expression_zero(kind);
7244 tp_expression->base.type = type_size_t;
7246 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7248 /* we only refer to a type property, mark this case */
7249 bool old = in_type_prop;
7250 in_type_prop = true;
7253 expression_t *expression;
7254 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7256 add_anchor_token(')');
7257 orig_type = parse_typename();
7258 rem_anchor_token(')');
7259 expect(')', end_error);
7261 if (token.type == '{') {
7262 /* It was not sizeof(type) after all. It is sizeof of an expression
7263 * starting with a compound literal */
7264 expression = parse_compound_literal(orig_type);
7265 goto typeprop_expression;
7268 expression = parse_subexpression(PREC_UNARY);
7270 typeprop_expression:
7271 tp_expression->typeprop.tp_expression = expression;
7273 orig_type = revert_automatic_type_conversion(expression);
7274 expression->base.type = orig_type;
7277 tp_expression->typeprop.type = orig_type;
7278 type_t const* const type = skip_typeref(orig_type);
7279 char const* wrong_type = NULL;
7280 if (is_type_incomplete(type)) {
7281 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7282 wrong_type = "incomplete";
7283 } else if (type->kind == TYPE_FUNCTION) {
7285 /* function types are allowed (and return 1) */
7286 if (warning.other) {
7287 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7288 warningf(&tp_expression->base.source_position,
7289 "%s expression with function argument returns invalid result", what);
7292 wrong_type = "function";
7295 if (is_type_incomplete(type))
7296 wrong_type = "incomplete";
7298 if (type->kind == TYPE_BITFIELD)
7299 wrong_type = "bitfield";
7301 if (wrong_type != NULL) {
7302 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7303 errorf(&tp_expression->base.source_position,
7304 "operand of %s expression must not be of %s type '%T'",
7305 what, wrong_type, orig_type);
7310 return tp_expression;
7313 static expression_t *parse_sizeof(void)
7315 return parse_typeprop(EXPR_SIZEOF);
7318 static expression_t *parse_alignof(void)
7320 return parse_typeprop(EXPR_ALIGNOF);
7323 static expression_t *parse_select_expression(expression_t *addr)
7325 assert(token.type == '.' || token.type == T_MINUSGREATER);
7326 bool select_left_arrow = (token.type == T_MINUSGREATER);
7327 source_position_t const pos = *HERE;
7330 if (token.type != T_IDENTIFIER) {
7331 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7332 return create_invalid_expression();
7334 symbol_t *symbol = token.symbol;
7337 type_t *const orig_type = addr->base.type;
7338 type_t *const type = skip_typeref(orig_type);
7341 bool saw_error = false;
7342 if (is_type_pointer(type)) {
7343 if (!select_left_arrow) {
7345 "request for member '%Y' in something not a struct or union, but '%T'",
7349 type_left = skip_typeref(type->pointer.points_to);
7351 if (select_left_arrow && is_type_valid(type)) {
7352 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7358 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7359 type_left->kind != TYPE_COMPOUND_UNION) {
7361 if (is_type_valid(type_left) && !saw_error) {
7363 "request for member '%Y' in something not a struct or union, but '%T'",
7366 return create_invalid_expression();
7369 compound_t *compound = type_left->compound.compound;
7370 if (!compound->complete) {
7371 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7373 return create_invalid_expression();
7376 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7377 expression_t *result =
7378 find_create_select(&pos, addr, qualifiers, compound, symbol);
7380 if (result == NULL) {
7381 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7382 return create_invalid_expression();
7388 static void check_call_argument(type_t *expected_type,
7389 call_argument_t *argument, unsigned pos)
7391 type_t *expected_type_skip = skip_typeref(expected_type);
7392 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7393 expression_t *arg_expr = argument->expression;
7394 type_t *arg_type = skip_typeref(arg_expr->base.type);
7396 /* handle transparent union gnu extension */
7397 if (is_type_union(expected_type_skip)
7398 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7399 compound_t *union_decl = expected_type_skip->compound.compound;
7400 type_t *best_type = NULL;
7401 entity_t *entry = union_decl->members.entities;
7402 for ( ; entry != NULL; entry = entry->base.next) {
7403 assert(is_declaration(entry));
7404 type_t *decl_type = entry->declaration.type;
7405 error = semantic_assign(decl_type, arg_expr);
7406 if (error == ASSIGN_ERROR_INCOMPATIBLE
7407 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7410 if (error == ASSIGN_SUCCESS) {
7411 best_type = decl_type;
7412 } else if (best_type == NULL) {
7413 best_type = decl_type;
7417 if (best_type != NULL) {
7418 expected_type = best_type;
7422 error = semantic_assign(expected_type, arg_expr);
7423 argument->expression = create_implicit_cast(arg_expr, expected_type);
7425 if (error != ASSIGN_SUCCESS) {
7426 /* report exact scope in error messages (like "in argument 3") */
7428 snprintf(buf, sizeof(buf), "call argument %u", pos);
7429 report_assign_error(error, expected_type, arg_expr, buf,
7430 &arg_expr->base.source_position);
7431 } else if (warning.traditional || warning.conversion) {
7432 type_t *const promoted_type = get_default_promoted_type(arg_type);
7433 if (!types_compatible(expected_type_skip, promoted_type) &&
7434 !types_compatible(expected_type_skip, type_void_ptr) &&
7435 !types_compatible(type_void_ptr, promoted_type)) {
7436 /* Deliberately show the skipped types in this warning */
7437 warningf(&arg_expr->base.source_position,
7438 "passing call argument %u as '%T' rather than '%T' due to prototype",
7439 pos, expected_type_skip, promoted_type);
7445 * Handle the semantic restrictions of builtin calls
7447 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7448 switch (call->function->reference.entity->function.btk) {
7449 case bk_gnu_builtin_return_address:
7450 case bk_gnu_builtin_frame_address: {
7451 /* argument must be constant */
7452 call_argument_t *argument = call->arguments;
7454 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7455 errorf(&call->base.source_position,
7456 "argument of '%Y' must be a constant expression",
7457 call->function->reference.entity->base.symbol);
7461 case bk_gnu_builtin_object_size:
7462 if (call->arguments == NULL)
7465 call_argument_t *arg = call->arguments->next;
7466 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7467 errorf(&call->base.source_position,
7468 "second argument of '%Y' must be a constant expression",
7469 call->function->reference.entity->base.symbol);
7472 case bk_gnu_builtin_prefetch:
7473 /* second and third argument must be constant if existent */
7474 if (call->arguments == NULL)
7476 call_argument_t *rw = call->arguments->next;
7477 call_argument_t *locality = NULL;
7480 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7481 errorf(&call->base.source_position,
7482 "second argument of '%Y' must be a constant expression",
7483 call->function->reference.entity->base.symbol);
7485 locality = rw->next;
7487 if (locality != NULL) {
7488 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7489 errorf(&call->base.source_position,
7490 "third argument of '%Y' must be a constant expression",
7491 call->function->reference.entity->base.symbol);
7493 locality = rw->next;
7502 * Parse a call expression, ie. expression '( ... )'.
7504 * @param expression the function address
7506 static expression_t *parse_call_expression(expression_t *expression)
7508 expression_t *result = allocate_expression_zero(EXPR_CALL);
7509 call_expression_t *call = &result->call;
7510 call->function = expression;
7512 type_t *const orig_type = expression->base.type;
7513 type_t *const type = skip_typeref(orig_type);
7515 function_type_t *function_type = NULL;
7516 if (is_type_pointer(type)) {
7517 type_t *const to_type = skip_typeref(type->pointer.points_to);
7519 if (is_type_function(to_type)) {
7520 function_type = &to_type->function;
7521 call->base.type = function_type->return_type;
7525 if (function_type == NULL && is_type_valid(type)) {
7527 "called object '%E' (type '%T') is not a pointer to a function",
7528 expression, orig_type);
7531 /* parse arguments */
7533 add_anchor_token(')');
7534 add_anchor_token(',');
7536 if (token.type != ')') {
7537 call_argument_t **anchor = &call->arguments;
7539 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7540 argument->expression = parse_assignment_expression();
7543 anchor = &argument->next;
7544 } while (next_if(','));
7546 rem_anchor_token(',');
7547 rem_anchor_token(')');
7548 expect(')', end_error);
7550 if (function_type == NULL)
7553 /* check type and count of call arguments */
7554 function_parameter_t *parameter = function_type->parameters;
7555 call_argument_t *argument = call->arguments;
7556 if (!function_type->unspecified_parameters) {
7557 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7558 parameter = parameter->next, argument = argument->next) {
7559 check_call_argument(parameter->type, argument, ++pos);
7562 if (parameter != NULL) {
7563 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7564 } else if (argument != NULL && !function_type->variadic) {
7565 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7569 /* do default promotion for other arguments */
7570 for (; argument != NULL; argument = argument->next) {
7571 type_t *type = argument->expression->base.type;
7572 if (!is_type_object(skip_typeref(type))) {
7573 errorf(&argument->expression->base.source_position,
7574 "call argument '%E' must not be void", argument->expression);
7577 type = get_default_promoted_type(type);
7579 argument->expression
7580 = create_implicit_cast(argument->expression, type);
7585 if (warning.aggregate_return &&
7586 is_type_compound(skip_typeref(function_type->return_type))) {
7587 warningf(&expression->base.source_position,
7588 "function call has aggregate value");
7591 if (expression->kind == EXPR_REFERENCE) {
7592 reference_expression_t *reference = &expression->reference;
7593 if (reference->entity->kind == ENTITY_FUNCTION &&
7594 reference->entity->function.btk != bk_none)
7595 handle_builtin_argument_restrictions(call);
7602 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7604 static bool same_compound_type(const type_t *type1, const type_t *type2)
7607 is_type_compound(type1) &&
7608 type1->kind == type2->kind &&
7609 type1->compound.compound == type2->compound.compound;
7612 static expression_t const *get_reference_address(expression_t const *expr)
7614 bool regular_take_address = true;
7616 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7617 expr = expr->unary.value;
7619 regular_take_address = false;
7622 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7625 expr = expr->unary.value;
7628 if (expr->kind != EXPR_REFERENCE)
7631 /* special case for functions which are automatically converted to a
7632 * pointer to function without an extra TAKE_ADDRESS operation */
7633 if (!regular_take_address &&
7634 expr->reference.entity->kind != ENTITY_FUNCTION) {
7641 static void warn_reference_address_as_bool(expression_t const* expr)
7643 if (!warning.address)
7646 expr = get_reference_address(expr);
7648 warningf(&expr->base.source_position,
7649 "the address of '%Y' will always evaluate as 'true'",
7650 expr->reference.entity->base.symbol);
7654 static void warn_assignment_in_condition(const expression_t *const expr)
7656 if (!warning.parentheses)
7658 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7660 if (expr->base.parenthesized)
7662 warningf(&expr->base.source_position,
7663 "suggest parentheses around assignment used as truth value");
7666 static void semantic_condition(expression_t const *const expr,
7667 char const *const context)
7669 type_t *const type = skip_typeref(expr->base.type);
7670 if (is_type_scalar(type)) {
7671 warn_reference_address_as_bool(expr);
7672 warn_assignment_in_condition(expr);
7673 } else if (is_type_valid(type)) {
7674 errorf(&expr->base.source_position,
7675 "%s must have scalar type", context);
7680 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7682 * @param expression the conditional expression
7684 static expression_t *parse_conditional_expression(expression_t *expression)
7686 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7688 conditional_expression_t *conditional = &result->conditional;
7689 conditional->condition = expression;
7692 add_anchor_token(':');
7694 /* §6.5.15:2 The first operand shall have scalar type. */
7695 semantic_condition(expression, "condition of conditional operator");
7697 expression_t *true_expression = expression;
7698 bool gnu_cond = false;
7699 if (GNU_MODE && token.type == ':') {
7702 true_expression = parse_expression();
7704 rem_anchor_token(':');
7705 expect(':', end_error);
7707 expression_t *false_expression =
7708 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7710 type_t *const orig_true_type = true_expression->base.type;
7711 type_t *const orig_false_type = false_expression->base.type;
7712 type_t *const true_type = skip_typeref(orig_true_type);
7713 type_t *const false_type = skip_typeref(orig_false_type);
7716 type_t *result_type;
7717 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7718 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7719 /* ISO/IEC 14882:1998(E) §5.16:2 */
7720 if (true_expression->kind == EXPR_UNARY_THROW) {
7721 result_type = false_type;
7722 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7723 result_type = true_type;
7725 if (warning.other && (
7726 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7727 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7729 warningf(&conditional->base.source_position,
7730 "ISO C forbids conditional expression with only one void side");
7732 result_type = type_void;
7734 } else if (is_type_arithmetic(true_type)
7735 && is_type_arithmetic(false_type)) {
7736 result_type = semantic_arithmetic(true_type, false_type);
7737 } else if (same_compound_type(true_type, false_type)) {
7738 /* just take 1 of the 2 types */
7739 result_type = true_type;
7740 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7741 type_t *pointer_type;
7743 expression_t *other_expression;
7744 if (is_type_pointer(true_type) &&
7745 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7746 pointer_type = true_type;
7747 other_type = false_type;
7748 other_expression = false_expression;
7750 pointer_type = false_type;
7751 other_type = true_type;
7752 other_expression = true_expression;
7755 if (is_null_pointer_constant(other_expression)) {
7756 result_type = pointer_type;
7757 } else if (is_type_pointer(other_type)) {
7758 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7759 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7762 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7763 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7765 } else if (types_compatible(get_unqualified_type(to1),
7766 get_unqualified_type(to2))) {
7769 if (warning.other) {
7770 warningf(&conditional->base.source_position,
7771 "pointer types '%T' and '%T' in conditional expression are incompatible",
7772 true_type, false_type);
7777 type_t *const type =
7778 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7779 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7780 } else if (is_type_integer(other_type)) {
7781 if (warning.other) {
7782 warningf(&conditional->base.source_position,
7783 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7785 result_type = pointer_type;
7787 if (is_type_valid(other_type)) {
7788 type_error_incompatible("while parsing conditional",
7789 &expression->base.source_position, true_type, false_type);
7791 result_type = type_error_type;
7794 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7795 type_error_incompatible("while parsing conditional",
7796 &conditional->base.source_position, true_type,
7799 result_type = type_error_type;
7802 conditional->true_expression
7803 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7804 conditional->false_expression
7805 = create_implicit_cast(false_expression, result_type);
7806 conditional->base.type = result_type;
7811 * Parse an extension expression.
7813 static expression_t *parse_extension(void)
7815 eat(T___extension__);
7817 bool old_gcc_extension = in_gcc_extension;
7818 in_gcc_extension = true;
7819 expression_t *expression = parse_subexpression(PREC_UNARY);
7820 in_gcc_extension = old_gcc_extension;
7825 * Parse a __builtin_classify_type() expression.
7827 static expression_t *parse_builtin_classify_type(void)
7829 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7830 result->base.type = type_int;
7832 eat(T___builtin_classify_type);
7834 expect('(', end_error);
7835 add_anchor_token(')');
7836 expression_t *expression = parse_expression();
7837 rem_anchor_token(')');
7838 expect(')', end_error);
7839 result->classify_type.type_expression = expression;
7843 return create_invalid_expression();
7847 * Parse a delete expression
7848 * ISO/IEC 14882:1998(E) §5.3.5
7850 static expression_t *parse_delete(void)
7852 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7853 result->base.type = type_void;
7858 result->kind = EXPR_UNARY_DELETE_ARRAY;
7859 expect(']', end_error);
7863 expression_t *const value = parse_subexpression(PREC_CAST);
7864 result->unary.value = value;
7866 type_t *const type = skip_typeref(value->base.type);
7867 if (!is_type_pointer(type)) {
7868 if (is_type_valid(type)) {
7869 errorf(&value->base.source_position,
7870 "operand of delete must have pointer type");
7872 } else if (warning.other &&
7873 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7874 warningf(&value->base.source_position,
7875 "deleting 'void*' is undefined");
7882 * Parse a throw expression
7883 * ISO/IEC 14882:1998(E) §15:1
7885 static expression_t *parse_throw(void)
7887 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7888 result->base.type = type_void;
7892 expression_t *value = NULL;
7893 switch (token.type) {
7895 value = parse_assignment_expression();
7896 /* ISO/IEC 14882:1998(E) §15.1:3 */
7897 type_t *const orig_type = value->base.type;
7898 type_t *const type = skip_typeref(orig_type);
7899 if (is_type_incomplete(type)) {
7900 errorf(&value->base.source_position,
7901 "cannot throw object of incomplete type '%T'", orig_type);
7902 } else if (is_type_pointer(type)) {
7903 type_t *const points_to = skip_typeref(type->pointer.points_to);
7904 if (is_type_incomplete(points_to) &&
7905 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7906 errorf(&value->base.source_position,
7907 "cannot throw pointer to incomplete type '%T'", orig_type);
7915 result->unary.value = value;
7920 static bool check_pointer_arithmetic(const source_position_t *source_position,
7921 type_t *pointer_type,
7922 type_t *orig_pointer_type)
7924 type_t *points_to = pointer_type->pointer.points_to;
7925 points_to = skip_typeref(points_to);
7927 if (is_type_incomplete(points_to)) {
7928 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7929 errorf(source_position,
7930 "arithmetic with pointer to incomplete type '%T' not allowed",
7933 } else if (warning.pointer_arith) {
7934 warningf(source_position,
7935 "pointer of type '%T' used in arithmetic",
7938 } else if (is_type_function(points_to)) {
7940 errorf(source_position,
7941 "arithmetic with pointer to function type '%T' not allowed",
7944 } else if (warning.pointer_arith) {
7945 warningf(source_position,
7946 "pointer to a function '%T' used in arithmetic",
7953 static bool is_lvalue(const expression_t *expression)
7955 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7956 switch (expression->kind) {
7957 case EXPR_ARRAY_ACCESS:
7958 case EXPR_COMPOUND_LITERAL:
7959 case EXPR_REFERENCE:
7961 case EXPR_UNARY_DEREFERENCE:
7965 type_t *type = skip_typeref(expression->base.type);
7967 /* ISO/IEC 14882:1998(E) §3.10:3 */
7968 is_type_reference(type) ||
7969 /* Claim it is an lvalue, if the type is invalid. There was a parse
7970 * error before, which maybe prevented properly recognizing it as
7972 !is_type_valid(type);
7977 static void semantic_incdec(unary_expression_t *expression)
7979 type_t *const orig_type = expression->value->base.type;
7980 type_t *const type = skip_typeref(orig_type);
7981 if (is_type_pointer(type)) {
7982 if (!check_pointer_arithmetic(&expression->base.source_position,
7986 } else if (!is_type_real(type) && is_type_valid(type)) {
7987 /* TODO: improve error message */
7988 errorf(&expression->base.source_position,
7989 "operation needs an arithmetic or pointer type");
7992 if (!is_lvalue(expression->value)) {
7993 /* TODO: improve error message */
7994 errorf(&expression->base.source_position, "lvalue required as operand");
7996 expression->base.type = orig_type;
7999 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8001 type_t *const orig_type = expression->value->base.type;
8002 type_t *const type = skip_typeref(orig_type);
8003 if (!is_type_arithmetic(type)) {
8004 if (is_type_valid(type)) {
8005 /* TODO: improve error message */
8006 errorf(&expression->base.source_position,
8007 "operation needs an arithmetic type");
8012 expression->base.type = orig_type;
8015 static void semantic_unexpr_plus(unary_expression_t *expression)
8017 semantic_unexpr_arithmetic(expression);
8018 if (warning.traditional)
8019 warningf(&expression->base.source_position,
8020 "traditional C rejects the unary plus operator");
8023 static void semantic_not(unary_expression_t *expression)
8025 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8026 semantic_condition(expression->value, "operand of !");
8027 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8030 static void semantic_unexpr_integer(unary_expression_t *expression)
8032 type_t *const orig_type = expression->value->base.type;
8033 type_t *const type = skip_typeref(orig_type);
8034 if (!is_type_integer(type)) {
8035 if (is_type_valid(type)) {
8036 errorf(&expression->base.source_position,
8037 "operand of ~ must be of integer type");
8042 expression->base.type = orig_type;
8045 static void semantic_dereference(unary_expression_t *expression)
8047 type_t *const orig_type = expression->value->base.type;
8048 type_t *const type = skip_typeref(orig_type);
8049 if (!is_type_pointer(type)) {
8050 if (is_type_valid(type)) {
8051 errorf(&expression->base.source_position,
8052 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8057 type_t *result_type = type->pointer.points_to;
8058 result_type = automatic_type_conversion(result_type);
8059 expression->base.type = result_type;
8063 * Record that an address is taken (expression represents an lvalue).
8065 * @param expression the expression
8066 * @param may_be_register if true, the expression might be an register
8068 static void set_address_taken(expression_t *expression, bool may_be_register)
8070 if (expression->kind != EXPR_REFERENCE)
8073 entity_t *const entity = expression->reference.entity;
8075 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8078 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8079 && !may_be_register) {
8080 errorf(&expression->base.source_position,
8081 "address of register %s '%Y' requested",
8082 get_entity_kind_name(entity->kind), entity->base.symbol);
8085 if (entity->kind == ENTITY_VARIABLE) {
8086 entity->variable.address_taken = true;
8088 assert(entity->kind == ENTITY_PARAMETER);
8089 entity->parameter.address_taken = true;
8094 * Check the semantic of the address taken expression.
8096 static void semantic_take_addr(unary_expression_t *expression)
8098 expression_t *value = expression->value;
8099 value->base.type = revert_automatic_type_conversion(value);
8101 type_t *orig_type = value->base.type;
8102 type_t *type = skip_typeref(orig_type);
8103 if (!is_type_valid(type))
8107 if (!is_lvalue(value)) {
8108 errorf(&expression->base.source_position, "'&' requires an lvalue");
8110 if (type->kind == TYPE_BITFIELD) {
8111 errorf(&expression->base.source_position,
8112 "'&' not allowed on object with bitfield type '%T'",
8116 set_address_taken(value, false);
8118 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8121 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8122 static expression_t *parse_##unexpression_type(void) \
8124 expression_t *unary_expression \
8125 = allocate_expression_zero(unexpression_type); \
8127 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8129 sfunc(&unary_expression->unary); \
8131 return unary_expression; \
8134 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8135 semantic_unexpr_arithmetic)
8136 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8137 semantic_unexpr_plus)
8138 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8140 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8141 semantic_dereference)
8142 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8144 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8145 semantic_unexpr_integer)
8146 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8148 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8151 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8153 static expression_t *parse_##unexpression_type(expression_t *left) \
8155 expression_t *unary_expression \
8156 = allocate_expression_zero(unexpression_type); \
8158 unary_expression->unary.value = left; \
8160 sfunc(&unary_expression->unary); \
8162 return unary_expression; \
8165 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8166 EXPR_UNARY_POSTFIX_INCREMENT,
8168 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8169 EXPR_UNARY_POSTFIX_DECREMENT,
8172 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8174 /* TODO: handle complex + imaginary types */
8176 type_left = get_unqualified_type(type_left);
8177 type_right = get_unqualified_type(type_right);
8179 /* §6.3.1.8 Usual arithmetic conversions */
8180 if (type_left == type_long_double || type_right == type_long_double) {
8181 return type_long_double;
8182 } else if (type_left == type_double || type_right == type_double) {
8184 } else if (type_left == type_float || type_right == type_float) {
8188 type_left = promote_integer(type_left);
8189 type_right = promote_integer(type_right);
8191 if (type_left == type_right)
8194 bool const signed_left = is_type_signed(type_left);
8195 bool const signed_right = is_type_signed(type_right);
8196 int const rank_left = get_rank(type_left);
8197 int const rank_right = get_rank(type_right);
8199 if (signed_left == signed_right)
8200 return rank_left >= rank_right ? type_left : type_right;
8209 u_rank = rank_right;
8210 u_type = type_right;
8212 s_rank = rank_right;
8213 s_type = type_right;
8218 if (u_rank >= s_rank)
8221 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8223 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8224 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8228 case ATOMIC_TYPE_INT: return type_unsigned_int;
8229 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8230 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8232 default: panic("invalid atomic type");
8237 * Check the semantic restrictions for a binary expression.
8239 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8241 expression_t *const left = expression->left;
8242 expression_t *const right = expression->right;
8243 type_t *const orig_type_left = left->base.type;
8244 type_t *const orig_type_right = right->base.type;
8245 type_t *const type_left = skip_typeref(orig_type_left);
8246 type_t *const type_right = skip_typeref(orig_type_right);
8248 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8249 /* TODO: improve error message */
8250 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8251 errorf(&expression->base.source_position,
8252 "operation needs arithmetic types");
8257 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8258 expression->left = create_implicit_cast(left, arithmetic_type);
8259 expression->right = create_implicit_cast(right, arithmetic_type);
8260 expression->base.type = arithmetic_type;
8263 static void semantic_binexpr_integer(binary_expression_t *const expression)
8265 expression_t *const left = expression->left;
8266 expression_t *const right = expression->right;
8267 type_t *const orig_type_left = left->base.type;
8268 type_t *const orig_type_right = right->base.type;
8269 type_t *const type_left = skip_typeref(orig_type_left);
8270 type_t *const type_right = skip_typeref(orig_type_right);
8272 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8273 /* TODO: improve error message */
8274 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8275 errorf(&expression->base.source_position,
8276 "operation needs integer types");
8281 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8282 expression->left = create_implicit_cast(left, result_type);
8283 expression->right = create_implicit_cast(right, result_type);
8284 expression->base.type = result_type;
8287 static void warn_div_by_zero(binary_expression_t const *const expression)
8289 if (!warning.div_by_zero ||
8290 !is_type_integer(expression->base.type))
8293 expression_t const *const right = expression->right;
8294 /* The type of the right operand can be different for /= */
8295 if (is_type_integer(right->base.type) &&
8296 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8297 !fold_constant_to_bool(right)) {
8298 warningf(&expression->base.source_position, "division by zero");
8303 * Check the semantic restrictions for a div/mod expression.
8305 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8307 semantic_binexpr_arithmetic(expression);
8308 warn_div_by_zero(expression);
8311 static void warn_addsub_in_shift(const expression_t *const expr)
8313 if (expr->base.parenthesized)
8317 switch (expr->kind) {
8318 case EXPR_BINARY_ADD: op = '+'; break;
8319 case EXPR_BINARY_SUB: op = '-'; break;
8323 warningf(&expr->base.source_position,
8324 "suggest parentheses around '%c' inside shift", op);
8327 static bool semantic_shift(binary_expression_t *expression)
8329 expression_t *const left = expression->left;
8330 expression_t *const right = expression->right;
8331 type_t *const orig_type_left = left->base.type;
8332 type_t *const orig_type_right = right->base.type;
8333 type_t * type_left = skip_typeref(orig_type_left);
8334 type_t * type_right = skip_typeref(orig_type_right);
8336 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8337 /* TODO: improve error message */
8338 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8339 errorf(&expression->base.source_position,
8340 "operands of shift operation must have integer types");
8345 type_left = promote_integer(type_left);
8347 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8348 long count = fold_constant_to_int(right);
8350 warningf(&right->base.source_position,
8351 "shift count must be non-negative");
8352 } else if ((unsigned long)count >=
8353 get_atomic_type_size(type_left->atomic.akind) * 8) {
8354 warningf(&right->base.source_position,
8355 "shift count must be less than type width");
8359 type_right = promote_integer(type_right);
8360 expression->right = create_implicit_cast(right, type_right);
8365 static void semantic_shift_op(binary_expression_t *expression)
8367 expression_t *const left = expression->left;
8368 expression_t *const right = expression->right;
8370 if (!semantic_shift(expression))
8373 if (warning.parentheses) {
8374 warn_addsub_in_shift(left);
8375 warn_addsub_in_shift(right);
8378 type_t *const orig_type_left = left->base.type;
8379 type_t * type_left = skip_typeref(orig_type_left);
8381 type_left = promote_integer(type_left);
8382 expression->left = create_implicit_cast(left, type_left);
8383 expression->base.type = type_left;
8386 static void semantic_add(binary_expression_t *expression)
8388 expression_t *const left = expression->left;
8389 expression_t *const right = expression->right;
8390 type_t *const orig_type_left = left->base.type;
8391 type_t *const orig_type_right = right->base.type;
8392 type_t *const type_left = skip_typeref(orig_type_left);
8393 type_t *const type_right = skip_typeref(orig_type_right);
8396 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8397 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8398 expression->left = create_implicit_cast(left, arithmetic_type);
8399 expression->right = create_implicit_cast(right, arithmetic_type);
8400 expression->base.type = arithmetic_type;
8401 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8402 check_pointer_arithmetic(&expression->base.source_position,
8403 type_left, orig_type_left);
8404 expression->base.type = type_left;
8405 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8406 check_pointer_arithmetic(&expression->base.source_position,
8407 type_right, orig_type_right);
8408 expression->base.type = type_right;
8409 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8410 errorf(&expression->base.source_position,
8411 "invalid operands to binary + ('%T', '%T')",
8412 orig_type_left, orig_type_right);
8416 static void semantic_sub(binary_expression_t *expression)
8418 expression_t *const left = expression->left;
8419 expression_t *const right = expression->right;
8420 type_t *const orig_type_left = left->base.type;
8421 type_t *const orig_type_right = right->base.type;
8422 type_t *const type_left = skip_typeref(orig_type_left);
8423 type_t *const type_right = skip_typeref(orig_type_right);
8424 source_position_t const *const pos = &expression->base.source_position;
8427 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8428 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8429 expression->left = create_implicit_cast(left, arithmetic_type);
8430 expression->right = create_implicit_cast(right, arithmetic_type);
8431 expression->base.type = arithmetic_type;
8432 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8433 check_pointer_arithmetic(&expression->base.source_position,
8434 type_left, orig_type_left);
8435 expression->base.type = type_left;
8436 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8437 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8438 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8439 if (!types_compatible(unqual_left, unqual_right)) {
8441 "subtracting pointers to incompatible types '%T' and '%T'",
8442 orig_type_left, orig_type_right);
8443 } else if (!is_type_object(unqual_left)) {
8444 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8445 errorf(pos, "subtracting pointers to non-object types '%T'",
8447 } else if (warning.other) {
8448 warningf(pos, "subtracting pointers to void");
8451 expression->base.type = type_ptrdiff_t;
8452 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8453 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8454 orig_type_left, orig_type_right);
8458 static void warn_string_literal_address(expression_t const* expr)
8460 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8461 expr = expr->unary.value;
8462 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8464 expr = expr->unary.value;
8467 if (expr->kind == EXPR_STRING_LITERAL
8468 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8469 warningf(&expr->base.source_position,
8470 "comparison with string literal results in unspecified behaviour");
8474 static void warn_comparison_in_comparison(const expression_t *const expr)
8476 if (expr->base.parenthesized)
8478 switch (expr->base.kind) {
8479 case EXPR_BINARY_LESS:
8480 case EXPR_BINARY_GREATER:
8481 case EXPR_BINARY_LESSEQUAL:
8482 case EXPR_BINARY_GREATEREQUAL:
8483 case EXPR_BINARY_NOTEQUAL:
8484 case EXPR_BINARY_EQUAL:
8485 warningf(&expr->base.source_position,
8486 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8493 static bool maybe_negative(expression_t const *const expr)
8495 switch (is_constant_expression(expr)) {
8496 case EXPR_CLASS_ERROR: return false;
8497 case EXPR_CLASS_CONSTANT: return fold_constant_to_int(expr) < 0;
8498 default: return true;
8503 * Check the semantics of comparison expressions.
8505 * @param expression The expression to check.
8507 static void semantic_comparison(binary_expression_t *expression)
8509 expression_t *left = expression->left;
8510 expression_t *right = expression->right;
8512 if (warning.address) {
8513 warn_string_literal_address(left);
8514 warn_string_literal_address(right);
8516 expression_t const* const func_left = get_reference_address(left);
8517 if (func_left != NULL && is_null_pointer_constant(right)) {
8518 warningf(&expression->base.source_position,
8519 "the address of '%Y' will never be NULL",
8520 func_left->reference.entity->base.symbol);
8523 expression_t const* const func_right = get_reference_address(right);
8524 if (func_right != NULL && is_null_pointer_constant(right)) {
8525 warningf(&expression->base.source_position,
8526 "the address of '%Y' will never be NULL",
8527 func_right->reference.entity->base.symbol);
8531 if (warning.parentheses) {
8532 warn_comparison_in_comparison(left);
8533 warn_comparison_in_comparison(right);
8536 type_t *orig_type_left = left->base.type;
8537 type_t *orig_type_right = right->base.type;
8538 type_t *type_left = skip_typeref(orig_type_left);
8539 type_t *type_right = skip_typeref(orig_type_right);
8541 /* TODO non-arithmetic types */
8542 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8543 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8545 /* test for signed vs unsigned compares */
8546 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8547 bool const signed_left = is_type_signed(type_left);
8548 bool const signed_right = is_type_signed(type_right);
8549 if (signed_left != signed_right) {
8550 /* FIXME long long needs better const folding magic */
8551 /* TODO check whether constant value can be represented by other type */
8552 if ((signed_left && maybe_negative(left)) ||
8553 (signed_right && maybe_negative(right))) {
8554 warningf(&expression->base.source_position,
8555 "comparison between signed and unsigned");
8560 expression->left = create_implicit_cast(left, arithmetic_type);
8561 expression->right = create_implicit_cast(right, arithmetic_type);
8562 expression->base.type = arithmetic_type;
8563 if (warning.float_equal &&
8564 (expression->base.kind == EXPR_BINARY_EQUAL ||
8565 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8566 is_type_float(arithmetic_type)) {
8567 warningf(&expression->base.source_position,
8568 "comparing floating point with == or != is unsafe");
8570 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8571 /* TODO check compatibility */
8572 } else if (is_type_pointer(type_left)) {
8573 expression->right = create_implicit_cast(right, type_left);
8574 } else if (is_type_pointer(type_right)) {
8575 expression->left = create_implicit_cast(left, type_right);
8576 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8577 type_error_incompatible("invalid operands in comparison",
8578 &expression->base.source_position,
8579 type_left, type_right);
8581 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8585 * Checks if a compound type has constant fields.
8587 static bool has_const_fields(const compound_type_t *type)
8589 compound_t *compound = type->compound;
8590 entity_t *entry = compound->members.entities;
8592 for (; entry != NULL; entry = entry->base.next) {
8593 if (!is_declaration(entry))
8596 const type_t *decl_type = skip_typeref(entry->declaration.type);
8597 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8604 static bool is_valid_assignment_lhs(expression_t const* const left)
8606 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8607 type_t *const type_left = skip_typeref(orig_type_left);
8609 if (!is_lvalue(left)) {
8610 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8615 if (left->kind == EXPR_REFERENCE
8616 && left->reference.entity->kind == ENTITY_FUNCTION) {
8617 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8621 if (is_type_array(type_left)) {
8622 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8625 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8626 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8630 if (is_type_incomplete(type_left)) {
8631 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8632 left, orig_type_left);
8635 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8636 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8637 left, orig_type_left);
8644 static void semantic_arithmetic_assign(binary_expression_t *expression)
8646 expression_t *left = expression->left;
8647 expression_t *right = expression->right;
8648 type_t *orig_type_left = left->base.type;
8649 type_t *orig_type_right = right->base.type;
8651 if (!is_valid_assignment_lhs(left))
8654 type_t *type_left = skip_typeref(orig_type_left);
8655 type_t *type_right = skip_typeref(orig_type_right);
8657 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8658 /* TODO: improve error message */
8659 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8660 errorf(&expression->base.source_position,
8661 "operation needs arithmetic types");
8666 /* combined instructions are tricky. We can't create an implicit cast on
8667 * the left side, because we need the uncasted form for the store.
8668 * The ast2firm pass has to know that left_type must be right_type
8669 * for the arithmetic operation and create a cast by itself */
8670 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8671 expression->right = create_implicit_cast(right, arithmetic_type);
8672 expression->base.type = type_left;
8675 static void semantic_divmod_assign(binary_expression_t *expression)
8677 semantic_arithmetic_assign(expression);
8678 warn_div_by_zero(expression);
8681 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8683 expression_t *const left = expression->left;
8684 expression_t *const right = expression->right;
8685 type_t *const orig_type_left = left->base.type;
8686 type_t *const orig_type_right = right->base.type;
8687 type_t *const type_left = skip_typeref(orig_type_left);
8688 type_t *const type_right = skip_typeref(orig_type_right);
8690 if (!is_valid_assignment_lhs(left))
8693 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8694 /* combined instructions are tricky. We can't create an implicit cast on
8695 * the left side, because we need the uncasted form for the store.
8696 * The ast2firm pass has to know that left_type must be right_type
8697 * for the arithmetic operation and create a cast by itself */
8698 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8699 expression->right = create_implicit_cast(right, arithmetic_type);
8700 expression->base.type = type_left;
8701 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8702 check_pointer_arithmetic(&expression->base.source_position,
8703 type_left, orig_type_left);
8704 expression->base.type = type_left;
8705 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8706 errorf(&expression->base.source_position,
8707 "incompatible types '%T' and '%T' in assignment",
8708 orig_type_left, orig_type_right);
8712 static void semantic_integer_assign(binary_expression_t *expression)
8714 expression_t *left = expression->left;
8715 expression_t *right = expression->right;
8716 type_t *orig_type_left = left->base.type;
8717 type_t *orig_type_right = right->base.type;
8719 if (!is_valid_assignment_lhs(left))
8722 type_t *type_left = skip_typeref(orig_type_left);
8723 type_t *type_right = skip_typeref(orig_type_right);
8725 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8726 /* TODO: improve error message */
8727 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8728 errorf(&expression->base.source_position,
8729 "operation needs integer types");
8734 /* combined instructions are tricky. We can't create an implicit cast on
8735 * the left side, because we need the uncasted form for the store.
8736 * The ast2firm pass has to know that left_type must be right_type
8737 * for the arithmetic operation and create a cast by itself */
8738 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8739 expression->right = create_implicit_cast(right, arithmetic_type);
8740 expression->base.type = type_left;
8743 static void semantic_shift_assign(binary_expression_t *expression)
8745 expression_t *left = expression->left;
8747 if (!is_valid_assignment_lhs(left))
8750 if (!semantic_shift(expression))
8753 expression->base.type = skip_typeref(left->base.type);
8756 static void warn_logical_and_within_or(const expression_t *const expr)
8758 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8760 if (expr->base.parenthesized)
8762 warningf(&expr->base.source_position,
8763 "suggest parentheses around && within ||");
8767 * Check the semantic restrictions of a logical expression.
8769 static void semantic_logical_op(binary_expression_t *expression)
8771 /* §6.5.13:2 Each of the operands shall have scalar type.
8772 * §6.5.14:2 Each of the operands shall have scalar type. */
8773 semantic_condition(expression->left, "left operand of logical operator");
8774 semantic_condition(expression->right, "right operand of logical operator");
8775 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8776 warning.parentheses) {
8777 warn_logical_and_within_or(expression->left);
8778 warn_logical_and_within_or(expression->right);
8780 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8784 * Check the semantic restrictions of a binary assign expression.
8786 static void semantic_binexpr_assign(binary_expression_t *expression)
8788 expression_t *left = expression->left;
8789 type_t *orig_type_left = left->base.type;
8791 if (!is_valid_assignment_lhs(left))
8794 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8795 report_assign_error(error, orig_type_left, expression->right,
8796 "assignment", &left->base.source_position);
8797 expression->right = create_implicit_cast(expression->right, orig_type_left);
8798 expression->base.type = orig_type_left;
8802 * Determine if the outermost operation (or parts thereof) of the given
8803 * expression has no effect in order to generate a warning about this fact.
8804 * Therefore in some cases this only examines some of the operands of the
8805 * expression (see comments in the function and examples below).
8807 * f() + 23; // warning, because + has no effect
8808 * x || f(); // no warning, because x controls execution of f()
8809 * x ? y : f(); // warning, because y has no effect
8810 * (void)x; // no warning to be able to suppress the warning
8811 * This function can NOT be used for an "expression has definitely no effect"-
8813 static bool expression_has_effect(const expression_t *const expr)
8815 switch (expr->kind) {
8816 case EXPR_UNKNOWN: break;
8817 case EXPR_INVALID: return true; /* do NOT warn */
8818 case EXPR_REFERENCE: return false;
8819 case EXPR_REFERENCE_ENUM_VALUE: return false;
8820 case EXPR_LABEL_ADDRESS: return false;
8822 /* suppress the warning for microsoft __noop operations */
8823 case EXPR_LITERAL_MS_NOOP: return true;
8824 case EXPR_LITERAL_BOOLEAN:
8825 case EXPR_LITERAL_CHARACTER:
8826 case EXPR_LITERAL_WIDE_CHARACTER:
8827 case EXPR_LITERAL_INTEGER:
8828 case EXPR_LITERAL_INTEGER_OCTAL:
8829 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8830 case EXPR_LITERAL_FLOATINGPOINT:
8831 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8832 case EXPR_STRING_LITERAL: return false;
8833 case EXPR_WIDE_STRING_LITERAL: return false;
8836 const call_expression_t *const call = &expr->call;
8837 if (call->function->kind != EXPR_REFERENCE)
8840 switch (call->function->reference.entity->function.btk) {
8841 /* FIXME: which builtins have no effect? */
8842 default: return true;
8846 /* Generate the warning if either the left or right hand side of a
8847 * conditional expression has no effect */
8848 case EXPR_CONDITIONAL: {
8849 conditional_expression_t const *const cond = &expr->conditional;
8850 expression_t const *const t = cond->true_expression;
8852 (t == NULL || expression_has_effect(t)) &&
8853 expression_has_effect(cond->false_expression);
8856 case EXPR_SELECT: return false;
8857 case EXPR_ARRAY_ACCESS: return false;
8858 case EXPR_SIZEOF: return false;
8859 case EXPR_CLASSIFY_TYPE: return false;
8860 case EXPR_ALIGNOF: return false;
8862 case EXPR_FUNCNAME: return false;
8863 case EXPR_BUILTIN_CONSTANT_P: return false;
8864 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8865 case EXPR_OFFSETOF: return false;
8866 case EXPR_VA_START: return true;
8867 case EXPR_VA_ARG: return true;
8868 case EXPR_VA_COPY: return true;
8869 case EXPR_STATEMENT: return true; // TODO
8870 case EXPR_COMPOUND_LITERAL: return false;
8872 case EXPR_UNARY_NEGATE: return false;
8873 case EXPR_UNARY_PLUS: return false;
8874 case EXPR_UNARY_BITWISE_NEGATE: return false;
8875 case EXPR_UNARY_NOT: return false;
8876 case EXPR_UNARY_DEREFERENCE: return false;
8877 case EXPR_UNARY_TAKE_ADDRESS: return false;
8878 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8879 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8880 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8881 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8883 /* Treat void casts as if they have an effect in order to being able to
8884 * suppress the warning */
8885 case EXPR_UNARY_CAST: {
8886 type_t *const type = skip_typeref(expr->base.type);
8887 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8890 case EXPR_UNARY_CAST_IMPLICIT: return true;
8891 case EXPR_UNARY_ASSUME: return true;
8892 case EXPR_UNARY_DELETE: return true;
8893 case EXPR_UNARY_DELETE_ARRAY: return true;
8894 case EXPR_UNARY_THROW: return true;
8896 case EXPR_BINARY_ADD: return false;
8897 case EXPR_BINARY_SUB: return false;
8898 case EXPR_BINARY_MUL: return false;
8899 case EXPR_BINARY_DIV: return false;
8900 case EXPR_BINARY_MOD: return false;
8901 case EXPR_BINARY_EQUAL: return false;
8902 case EXPR_BINARY_NOTEQUAL: return false;
8903 case EXPR_BINARY_LESS: return false;
8904 case EXPR_BINARY_LESSEQUAL: return false;
8905 case EXPR_BINARY_GREATER: return false;
8906 case EXPR_BINARY_GREATEREQUAL: return false;
8907 case EXPR_BINARY_BITWISE_AND: return false;
8908 case EXPR_BINARY_BITWISE_OR: return false;
8909 case EXPR_BINARY_BITWISE_XOR: return false;
8910 case EXPR_BINARY_SHIFTLEFT: return false;
8911 case EXPR_BINARY_SHIFTRIGHT: return false;
8912 case EXPR_BINARY_ASSIGN: return true;
8913 case EXPR_BINARY_MUL_ASSIGN: return true;
8914 case EXPR_BINARY_DIV_ASSIGN: return true;
8915 case EXPR_BINARY_MOD_ASSIGN: return true;
8916 case EXPR_BINARY_ADD_ASSIGN: return true;
8917 case EXPR_BINARY_SUB_ASSIGN: return true;
8918 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8919 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8920 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8921 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8922 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8924 /* Only examine the right hand side of && and ||, because the left hand
8925 * side already has the effect of controlling the execution of the right
8927 case EXPR_BINARY_LOGICAL_AND:
8928 case EXPR_BINARY_LOGICAL_OR:
8929 /* Only examine the right hand side of a comma expression, because the left
8930 * hand side has a separate warning */
8931 case EXPR_BINARY_COMMA:
8932 return expression_has_effect(expr->binary.right);
8934 case EXPR_BINARY_ISGREATER: return false;
8935 case EXPR_BINARY_ISGREATEREQUAL: return false;
8936 case EXPR_BINARY_ISLESS: return false;
8937 case EXPR_BINARY_ISLESSEQUAL: return false;
8938 case EXPR_BINARY_ISLESSGREATER: return false;
8939 case EXPR_BINARY_ISUNORDERED: return false;
8942 internal_errorf(HERE, "unexpected expression");
8945 static void semantic_comma(binary_expression_t *expression)
8947 if (warning.unused_value) {
8948 const expression_t *const left = expression->left;
8949 if (!expression_has_effect(left)) {
8950 warningf(&left->base.source_position,
8951 "left-hand operand of comma expression has no effect");
8954 expression->base.type = expression->right->base.type;
8958 * @param prec_r precedence of the right operand
8960 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8961 static expression_t *parse_##binexpression_type(expression_t *left) \
8963 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8964 binexpr->binary.left = left; \
8967 expression_t *right = parse_subexpression(prec_r); \
8969 binexpr->binary.right = right; \
8970 sfunc(&binexpr->binary); \
8975 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8976 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8977 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8978 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8979 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8980 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8981 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8982 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8983 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8984 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8985 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8986 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8987 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8988 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8989 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8990 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8991 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8992 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8993 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8994 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8995 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8996 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8997 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8998 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8999 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9000 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9001 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9002 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9003 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9004 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9007 static expression_t *parse_subexpression(precedence_t precedence)
9009 if (token.type < 0) {
9010 return expected_expression_error();
9013 expression_parser_function_t *parser
9014 = &expression_parsers[token.type];
9015 source_position_t source_position = token.source_position;
9018 if (parser->parser != NULL) {
9019 left = parser->parser();
9021 left = parse_primary_expression();
9023 assert(left != NULL);
9024 left->base.source_position = source_position;
9027 if (token.type < 0) {
9028 return expected_expression_error();
9031 parser = &expression_parsers[token.type];
9032 if (parser->infix_parser == NULL)
9034 if (parser->infix_precedence < precedence)
9037 left = parser->infix_parser(left);
9039 assert(left != NULL);
9040 assert(left->kind != EXPR_UNKNOWN);
9041 left->base.source_position = source_position;
9048 * Parse an expression.
9050 static expression_t *parse_expression(void)
9052 return parse_subexpression(PREC_EXPRESSION);
9056 * Register a parser for a prefix-like operator.
9058 * @param parser the parser function
9059 * @param token_type the token type of the prefix token
9061 static void register_expression_parser(parse_expression_function parser,
9064 expression_parser_function_t *entry = &expression_parsers[token_type];
9066 if (entry->parser != NULL) {
9067 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9068 panic("trying to register multiple expression parsers for a token");
9070 entry->parser = parser;
9074 * Register a parser for an infix operator with given precedence.
9076 * @param parser the parser function
9077 * @param token_type the token type of the infix operator
9078 * @param precedence the precedence of the operator
9080 static void register_infix_parser(parse_expression_infix_function parser,
9081 int token_type, precedence_t precedence)
9083 expression_parser_function_t *entry = &expression_parsers[token_type];
9085 if (entry->infix_parser != NULL) {
9086 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9087 panic("trying to register multiple infix expression parsers for a "
9090 entry->infix_parser = parser;
9091 entry->infix_precedence = precedence;
9095 * Initialize the expression parsers.
9097 static void init_expression_parsers(void)
9099 memset(&expression_parsers, 0, sizeof(expression_parsers));
9101 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9102 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9103 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9104 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9105 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9106 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9107 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9108 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9109 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9110 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9111 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9112 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9113 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9114 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9115 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9116 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9117 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9118 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9119 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9120 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9121 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9122 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9123 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9124 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9125 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9126 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9127 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9128 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9129 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9130 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9131 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9132 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9133 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9134 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9135 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9136 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9137 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9139 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9140 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9141 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9142 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9143 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9144 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9145 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9146 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9147 register_expression_parser(parse_sizeof, T_sizeof);
9148 register_expression_parser(parse_alignof, T___alignof__);
9149 register_expression_parser(parse_extension, T___extension__);
9150 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9151 register_expression_parser(parse_delete, T_delete);
9152 register_expression_parser(parse_throw, T_throw);
9156 * Parse a asm statement arguments specification.
9158 static asm_argument_t *parse_asm_arguments(bool is_out)
9160 asm_argument_t *result = NULL;
9161 asm_argument_t **anchor = &result;
9163 while (token.type == T_STRING_LITERAL || token.type == '[') {
9164 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9165 memset(argument, 0, sizeof(argument[0]));
9168 if (token.type != T_IDENTIFIER) {
9169 parse_error_expected("while parsing asm argument",
9170 T_IDENTIFIER, NULL);
9173 argument->symbol = token.symbol;
9175 expect(']', end_error);
9178 argument->constraints = parse_string_literals();
9179 expect('(', end_error);
9180 add_anchor_token(')');
9181 expression_t *expression = parse_expression();
9182 rem_anchor_token(')');
9184 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9185 * change size or type representation (e.g. int -> long is ok, but
9186 * int -> float is not) */
9187 if (expression->kind == EXPR_UNARY_CAST) {
9188 type_t *const type = expression->base.type;
9189 type_kind_t const kind = type->kind;
9190 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9193 if (kind == TYPE_ATOMIC) {
9194 atomic_type_kind_t const akind = type->atomic.akind;
9195 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9196 size = get_atomic_type_size(akind);
9198 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9199 size = get_atomic_type_size(get_intptr_kind());
9203 expression_t *const value = expression->unary.value;
9204 type_t *const value_type = value->base.type;
9205 type_kind_t const value_kind = value_type->kind;
9207 unsigned value_flags;
9208 unsigned value_size;
9209 if (value_kind == TYPE_ATOMIC) {
9210 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9211 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9212 value_size = get_atomic_type_size(value_akind);
9213 } else if (value_kind == TYPE_POINTER) {
9214 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9215 value_size = get_atomic_type_size(get_intptr_kind());
9220 if (value_flags != flags || value_size != size)
9224 } while (expression->kind == EXPR_UNARY_CAST);
9228 if (!is_lvalue(expression)) {
9229 errorf(&expression->base.source_position,
9230 "asm output argument is not an lvalue");
9233 if (argument->constraints.begin[0] == '=')
9234 determine_lhs_ent(expression, NULL);
9236 mark_vars_read(expression, NULL);
9238 mark_vars_read(expression, NULL);
9240 argument->expression = expression;
9241 expect(')', end_error);
9243 set_address_taken(expression, true);
9246 anchor = &argument->next;
9258 * Parse a asm statement clobber specification.
9260 static asm_clobber_t *parse_asm_clobbers(void)
9262 asm_clobber_t *result = NULL;
9263 asm_clobber_t **anchor = &result;
9265 while (token.type == T_STRING_LITERAL) {
9266 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9267 clobber->clobber = parse_string_literals();
9270 anchor = &clobber->next;
9280 * Parse an asm statement.
9282 static statement_t *parse_asm_statement(void)
9284 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9285 asm_statement_t *asm_statement = &statement->asms;
9289 if (next_if(T_volatile))
9290 asm_statement->is_volatile = true;
9292 expect('(', end_error);
9293 add_anchor_token(')');
9294 if (token.type != T_STRING_LITERAL) {
9295 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9298 asm_statement->asm_text = parse_string_literals();
9300 add_anchor_token(':');
9301 if (!next_if(':')) {
9302 rem_anchor_token(':');
9306 asm_statement->outputs = parse_asm_arguments(true);
9307 if (!next_if(':')) {
9308 rem_anchor_token(':');
9312 asm_statement->inputs = parse_asm_arguments(false);
9313 if (!next_if(':')) {
9314 rem_anchor_token(':');
9317 rem_anchor_token(':');
9319 asm_statement->clobbers = parse_asm_clobbers();
9322 rem_anchor_token(')');
9323 expect(')', end_error);
9324 expect(';', end_error);
9326 if (asm_statement->outputs == NULL) {
9327 /* GCC: An 'asm' instruction without any output operands will be treated
9328 * identically to a volatile 'asm' instruction. */
9329 asm_statement->is_volatile = true;
9334 return create_invalid_statement();
9337 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9339 statement_t *inner_stmt;
9340 switch (token.type) {
9342 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9343 inner_stmt = create_invalid_statement();
9347 if (label->kind == STATEMENT_LABEL) {
9348 /* Eat an empty statement here, to avoid the warning about an empty
9349 * statement after a label. label:; is commonly used to have a label
9350 * before a closing brace. */
9351 inner_stmt = create_empty_statement();
9358 inner_stmt = parse_statement();
9359 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9360 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9361 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9369 * Parse a case statement.
9371 static statement_t *parse_case_statement(void)
9373 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9374 source_position_t *const pos = &statement->base.source_position;
9378 expression_t *const expression = parse_expression();
9379 statement->case_label.expression = expression;
9380 expression_classification_t const expr_class = is_constant_expression(expression);
9381 if (expr_class != EXPR_CLASS_CONSTANT) {
9382 if (expr_class != EXPR_CLASS_ERROR) {
9383 errorf(pos, "case label does not reduce to an integer constant");
9385 statement->case_label.is_bad = true;
9387 long const val = fold_constant_to_int(expression);
9388 statement->case_label.first_case = val;
9389 statement->case_label.last_case = val;
9393 if (next_if(T_DOTDOTDOT)) {
9394 expression_t *const end_range = parse_expression();
9395 statement->case_label.end_range = end_range;
9396 expression_classification_t const end_class = is_constant_expression(end_range);
9397 if (end_class != EXPR_CLASS_CONSTANT) {
9398 if (end_class != EXPR_CLASS_ERROR) {
9399 errorf(pos, "case range does not reduce to an integer constant");
9401 statement->case_label.is_bad = true;
9403 long const val = fold_constant_to_int(end_range);
9404 statement->case_label.last_case = val;
9406 if (warning.other && val < statement->case_label.first_case) {
9407 statement->case_label.is_empty_range = true;
9408 warningf(pos, "empty range specified");
9414 PUSH_PARENT(statement);
9416 expect(':', end_error);
9419 if (current_switch != NULL) {
9420 if (! statement->case_label.is_bad) {
9421 /* Check for duplicate case values */
9422 case_label_statement_t *c = &statement->case_label;
9423 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9424 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9427 if (c->last_case < l->first_case || c->first_case > l->last_case)
9430 errorf(pos, "duplicate case value (previously used %P)",
9431 &l->base.source_position);
9435 /* link all cases into the switch statement */
9436 if (current_switch->last_case == NULL) {
9437 current_switch->first_case = &statement->case_label;
9439 current_switch->last_case->next = &statement->case_label;
9441 current_switch->last_case = &statement->case_label;
9443 errorf(pos, "case label not within a switch statement");
9446 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9453 * Parse a default statement.
9455 static statement_t *parse_default_statement(void)
9457 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9461 PUSH_PARENT(statement);
9463 expect(':', end_error);
9466 if (current_switch != NULL) {
9467 const case_label_statement_t *def_label = current_switch->default_label;
9468 if (def_label != NULL) {
9469 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9470 &def_label->base.source_position);
9472 current_switch->default_label = &statement->case_label;
9474 /* link all cases into the switch statement */
9475 if (current_switch->last_case == NULL) {
9476 current_switch->first_case = &statement->case_label;
9478 current_switch->last_case->next = &statement->case_label;
9480 current_switch->last_case = &statement->case_label;
9483 errorf(&statement->base.source_position,
9484 "'default' label not within a switch statement");
9487 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9494 * Parse a label statement.
9496 static statement_t *parse_label_statement(void)
9498 assert(token.type == T_IDENTIFIER);
9499 symbol_t *symbol = token.symbol;
9500 label_t *label = get_label(symbol);
9502 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9503 statement->label.label = label;
9507 PUSH_PARENT(statement);
9509 /* if statement is already set then the label is defined twice,
9510 * otherwise it was just mentioned in a goto/local label declaration so far
9512 if (label->statement != NULL) {
9513 errorf(HERE, "duplicate label '%Y' (declared %P)",
9514 symbol, &label->base.source_position);
9516 label->base.source_position = token.source_position;
9517 label->statement = statement;
9522 statement->label.statement = parse_label_inner_statement(statement, "label");
9524 /* remember the labels in a list for later checking */
9525 *label_anchor = &statement->label;
9526 label_anchor = &statement->label.next;
9533 * Parse an if statement.
9535 static statement_t *parse_if(void)
9537 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9541 PUSH_PARENT(statement);
9543 add_anchor_token('{');
9545 expect('(', end_error);
9546 add_anchor_token(')');
9547 expression_t *const expr = parse_expression();
9548 statement->ifs.condition = expr;
9549 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9551 semantic_condition(expr, "condition of 'if'-statment");
9552 mark_vars_read(expr, NULL);
9553 rem_anchor_token(')');
9554 expect(')', end_error);
9557 rem_anchor_token('{');
9559 add_anchor_token(T_else);
9560 statement_t *const true_stmt = parse_statement();
9561 statement->ifs.true_statement = true_stmt;
9562 rem_anchor_token(T_else);
9564 if (next_if(T_else)) {
9565 statement->ifs.false_statement = parse_statement();
9566 } else if (warning.parentheses &&
9567 true_stmt->kind == STATEMENT_IF &&
9568 true_stmt->ifs.false_statement != NULL) {
9569 warningf(&true_stmt->base.source_position,
9570 "suggest explicit braces to avoid ambiguous 'else'");
9578 * Check that all enums are handled in a switch.
9580 * @param statement the switch statement to check
9582 static void check_enum_cases(const switch_statement_t *statement)
9584 const type_t *type = skip_typeref(statement->expression->base.type);
9585 if (! is_type_enum(type))
9587 const enum_type_t *enumt = &type->enumt;
9589 /* if we have a default, no warnings */
9590 if (statement->default_label != NULL)
9593 /* FIXME: calculation of value should be done while parsing */
9594 /* TODO: quadratic algorithm here. Change to an n log n one */
9595 long last_value = -1;
9596 const entity_t *entry = enumt->enume->base.next;
9597 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9598 entry = entry->base.next) {
9599 const expression_t *expression = entry->enum_value.value;
9600 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9602 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9603 if (l->expression == NULL)
9605 if (l->first_case <= value && value <= l->last_case) {
9611 warningf(&statement->base.source_position,
9612 "enumeration value '%Y' not handled in switch",
9613 entry->base.symbol);
9620 * Parse a switch statement.
9622 static statement_t *parse_switch(void)
9624 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9628 PUSH_PARENT(statement);
9630 expect('(', end_error);
9631 add_anchor_token(')');
9632 expression_t *const expr = parse_expression();
9633 mark_vars_read(expr, NULL);
9634 type_t * type = skip_typeref(expr->base.type);
9635 if (is_type_integer(type)) {
9636 type = promote_integer(type);
9637 if (warning.traditional) {
9638 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9639 warningf(&expr->base.source_position,
9640 "'%T' switch expression not converted to '%T' in ISO C",
9644 } else if (is_type_valid(type)) {
9645 errorf(&expr->base.source_position,
9646 "switch quantity is not an integer, but '%T'", type);
9647 type = type_error_type;
9649 statement->switchs.expression = create_implicit_cast(expr, type);
9650 expect(')', end_error);
9651 rem_anchor_token(')');
9653 switch_statement_t *rem = current_switch;
9654 current_switch = &statement->switchs;
9655 statement->switchs.body = parse_statement();
9656 current_switch = rem;
9658 if (warning.switch_default &&
9659 statement->switchs.default_label == NULL) {
9660 warningf(&statement->base.source_position, "switch has no default case");
9662 if (warning.switch_enum)
9663 check_enum_cases(&statement->switchs);
9669 return create_invalid_statement();
9672 static statement_t *parse_loop_body(statement_t *const loop)
9674 statement_t *const rem = current_loop;
9675 current_loop = loop;
9677 statement_t *const body = parse_statement();
9684 * Parse a while statement.
9686 static statement_t *parse_while(void)
9688 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9692 PUSH_PARENT(statement);
9694 expect('(', end_error);
9695 add_anchor_token(')');
9696 expression_t *const cond = parse_expression();
9697 statement->whiles.condition = cond;
9698 /* §6.8.5:2 The controlling expression of an iteration statement shall
9699 * have scalar type. */
9700 semantic_condition(cond, "condition of 'while'-statement");
9701 mark_vars_read(cond, NULL);
9702 rem_anchor_token(')');
9703 expect(')', end_error);
9705 statement->whiles.body = parse_loop_body(statement);
9711 return create_invalid_statement();
9715 * Parse a do statement.
9717 static statement_t *parse_do(void)
9719 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9723 PUSH_PARENT(statement);
9725 add_anchor_token(T_while);
9726 statement->do_while.body = parse_loop_body(statement);
9727 rem_anchor_token(T_while);
9729 expect(T_while, end_error);
9730 expect('(', end_error);
9731 add_anchor_token(')');
9732 expression_t *const cond = parse_expression();
9733 statement->do_while.condition = cond;
9734 /* §6.8.5:2 The controlling expression of an iteration statement shall
9735 * have scalar type. */
9736 semantic_condition(cond, "condition of 'do-while'-statement");
9737 mark_vars_read(cond, NULL);
9738 rem_anchor_token(')');
9739 expect(')', end_error);
9740 expect(';', end_error);
9746 return create_invalid_statement();
9750 * Parse a for statement.
9752 static statement_t *parse_for(void)
9754 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9758 expect('(', end_error1);
9759 add_anchor_token(')');
9761 PUSH_PARENT(statement);
9763 size_t const top = environment_top();
9764 scope_t *old_scope = scope_push(&statement->fors.scope);
9766 bool old_gcc_extension = in_gcc_extension;
9767 while (next_if(T___extension__)) {
9768 in_gcc_extension = true;
9772 } else if (is_declaration_specifier(&token, false)) {
9773 parse_declaration(record_entity, DECL_FLAGS_NONE);
9775 add_anchor_token(';');
9776 expression_t *const init = parse_expression();
9777 statement->fors.initialisation = init;
9778 mark_vars_read(init, ENT_ANY);
9779 if (warning.unused_value && !expression_has_effect(init)) {
9780 warningf(&init->base.source_position,
9781 "initialisation of 'for'-statement has no effect");
9783 rem_anchor_token(';');
9784 expect(';', end_error2);
9786 in_gcc_extension = old_gcc_extension;
9788 if (token.type != ';') {
9789 add_anchor_token(';');
9790 expression_t *const cond = parse_expression();
9791 statement->fors.condition = cond;
9792 /* §6.8.5:2 The controlling expression of an iteration statement
9793 * shall have scalar type. */
9794 semantic_condition(cond, "condition of 'for'-statement");
9795 mark_vars_read(cond, NULL);
9796 rem_anchor_token(';');
9798 expect(';', end_error2);
9799 if (token.type != ')') {
9800 expression_t *const step = parse_expression();
9801 statement->fors.step = step;
9802 mark_vars_read(step, ENT_ANY);
9803 if (warning.unused_value && !expression_has_effect(step)) {
9804 warningf(&step->base.source_position,
9805 "step of 'for'-statement has no effect");
9808 expect(')', end_error2);
9809 rem_anchor_token(')');
9810 statement->fors.body = parse_loop_body(statement);
9812 assert(current_scope == &statement->fors.scope);
9813 scope_pop(old_scope);
9814 environment_pop_to(top);
9821 rem_anchor_token(')');
9822 assert(current_scope == &statement->fors.scope);
9823 scope_pop(old_scope);
9824 environment_pop_to(top);
9828 return create_invalid_statement();
9832 * Parse a goto statement.
9834 static statement_t *parse_goto(void)
9836 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9839 if (GNU_MODE && next_if('*')) {
9840 expression_t *expression = parse_expression();
9841 mark_vars_read(expression, NULL);
9843 /* Argh: although documentation says the expression must be of type void*,
9844 * gcc accepts anything that can be casted into void* without error */
9845 type_t *type = expression->base.type;
9847 if (type != type_error_type) {
9848 if (!is_type_pointer(type) && !is_type_integer(type)) {
9849 errorf(&expression->base.source_position,
9850 "cannot convert to a pointer type");
9851 } else if (warning.other && type != type_void_ptr) {
9852 warningf(&expression->base.source_position,
9853 "type of computed goto expression should be 'void*' not '%T'", type);
9855 expression = create_implicit_cast(expression, type_void_ptr);
9858 statement->gotos.expression = expression;
9859 } else if (token.type == T_IDENTIFIER) {
9860 symbol_t *symbol = token.symbol;
9862 statement->gotos.label = get_label(symbol);
9865 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9867 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9869 return create_invalid_statement();
9872 /* remember the goto's in a list for later checking */
9873 *goto_anchor = &statement->gotos;
9874 goto_anchor = &statement->gotos.next;
9876 expect(';', end_error);
9883 * Parse a continue statement.
9885 static statement_t *parse_continue(void)
9887 if (current_loop == NULL) {
9888 errorf(HERE, "continue statement not within loop");
9891 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9894 expect(';', end_error);
9901 * Parse a break statement.
9903 static statement_t *parse_break(void)
9905 if (current_switch == NULL && current_loop == NULL) {
9906 errorf(HERE, "break statement not within loop or switch");
9909 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9912 expect(';', end_error);
9919 * Parse a __leave statement.
9921 static statement_t *parse_leave_statement(void)
9923 if (current_try == NULL) {
9924 errorf(HERE, "__leave statement not within __try");
9927 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9930 expect(';', end_error);
9937 * Check if a given entity represents a local variable.
9939 static bool is_local_variable(const entity_t *entity)
9941 if (entity->kind != ENTITY_VARIABLE)
9944 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9945 case STORAGE_CLASS_AUTO:
9946 case STORAGE_CLASS_REGISTER: {
9947 const type_t *type = skip_typeref(entity->declaration.type);
9948 if (is_type_function(type)) {
9960 * Check if a given expression represents a local variable.
9962 static bool expression_is_local_variable(const expression_t *expression)
9964 if (expression->base.kind != EXPR_REFERENCE) {
9967 const entity_t *entity = expression->reference.entity;
9968 return is_local_variable(entity);
9972 * Check if a given expression represents a local variable and
9973 * return its declaration then, else return NULL.
9975 entity_t *expression_is_variable(const expression_t *expression)
9977 if (expression->base.kind != EXPR_REFERENCE) {
9980 entity_t *entity = expression->reference.entity;
9981 if (entity->kind != ENTITY_VARIABLE)
9988 * Parse a return statement.
9990 static statement_t *parse_return(void)
9994 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9996 expression_t *return_value = NULL;
9997 if (token.type != ';') {
9998 return_value = parse_expression();
9999 mark_vars_read(return_value, NULL);
10002 const type_t *const func_type = skip_typeref(current_function->base.type);
10003 assert(is_type_function(func_type));
10004 type_t *const return_type = skip_typeref(func_type->function.return_type);
10006 source_position_t const *const pos = &statement->base.source_position;
10007 if (return_value != NULL) {
10008 type_t *return_value_type = skip_typeref(return_value->base.type);
10010 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10011 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10012 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10013 /* Only warn in C mode, because GCC does the same */
10014 if (c_mode & _CXX || strict_mode) {
10016 "'return' with a value, in function returning 'void'");
10017 } else if (warning.other) {
10019 "'return' with a value, in function returning 'void'");
10021 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10022 /* Only warn in C mode, because GCC does the same */
10025 "'return' with expression in function returning 'void'");
10026 } else if (warning.other) {
10028 "'return' with expression in function returning 'void'");
10032 assign_error_t error = semantic_assign(return_type, return_value);
10033 report_assign_error(error, return_type, return_value, "'return'",
10036 return_value = create_implicit_cast(return_value, return_type);
10037 /* check for returning address of a local var */
10038 if (warning.other && return_value != NULL
10039 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10040 const expression_t *expression = return_value->unary.value;
10041 if (expression_is_local_variable(expression)) {
10042 warningf(pos, "function returns address of local variable");
10045 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10046 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10047 if (c_mode & _CXX || strict_mode) {
10049 "'return' without value, in function returning non-void");
10052 "'return' without value, in function returning non-void");
10055 statement->returns.value = return_value;
10057 expect(';', end_error);
10064 * Parse a declaration statement.
10066 static statement_t *parse_declaration_statement(void)
10068 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10070 entity_t *before = current_scope->last_entity;
10072 parse_external_declaration();
10074 parse_declaration(record_entity, DECL_FLAGS_NONE);
10077 declaration_statement_t *const decl = &statement->declaration;
10078 entity_t *const begin =
10079 before != NULL ? before->base.next : current_scope->entities;
10080 decl->declarations_begin = begin;
10081 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10087 * Parse an expression statement, ie. expr ';'.
10089 static statement_t *parse_expression_statement(void)
10091 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10093 expression_t *const expr = parse_expression();
10094 statement->expression.expression = expr;
10095 mark_vars_read(expr, ENT_ANY);
10097 expect(';', end_error);
10104 * Parse a microsoft __try { } __finally { } or
10105 * __try{ } __except() { }
10107 static statement_t *parse_ms_try_statment(void)
10109 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10112 PUSH_PARENT(statement);
10114 ms_try_statement_t *rem = current_try;
10115 current_try = &statement->ms_try;
10116 statement->ms_try.try_statement = parse_compound_statement(false);
10121 if (next_if(T___except)) {
10122 expect('(', end_error);
10123 add_anchor_token(')');
10124 expression_t *const expr = parse_expression();
10125 mark_vars_read(expr, NULL);
10126 type_t * type = skip_typeref(expr->base.type);
10127 if (is_type_integer(type)) {
10128 type = promote_integer(type);
10129 } else if (is_type_valid(type)) {
10130 errorf(&expr->base.source_position,
10131 "__expect expression is not an integer, but '%T'", type);
10132 type = type_error_type;
10134 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10135 rem_anchor_token(')');
10136 expect(')', end_error);
10137 statement->ms_try.final_statement = parse_compound_statement(false);
10138 } else if (next_if(T__finally)) {
10139 statement->ms_try.final_statement = parse_compound_statement(false);
10141 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10142 return create_invalid_statement();
10146 return create_invalid_statement();
10149 static statement_t *parse_empty_statement(void)
10151 if (warning.empty_statement) {
10152 warningf(HERE, "statement is empty");
10154 statement_t *const statement = create_empty_statement();
10159 static statement_t *parse_local_label_declaration(void)
10161 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10165 entity_t *begin = NULL;
10166 entity_t *end = NULL;
10167 entity_t **anchor = &begin;
10169 if (token.type != T_IDENTIFIER) {
10170 parse_error_expected("while parsing local label declaration",
10171 T_IDENTIFIER, NULL);
10174 symbol_t *symbol = token.symbol;
10175 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10176 if (entity != NULL && entity->base.parent_scope == current_scope) {
10177 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10178 symbol, &entity->base.source_position);
10180 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10182 entity->base.parent_scope = current_scope;
10183 entity->base.namespc = NAMESPACE_LABEL;
10184 entity->base.source_position = token.source_position;
10185 entity->base.symbol = symbol;
10188 anchor = &entity->base.next;
10191 environment_push(entity);
10194 } while (next_if(','));
10195 expect(';', end_error);
10197 statement->declaration.declarations_begin = begin;
10198 statement->declaration.declarations_end = end;
10202 static void parse_namespace_definition(void)
10206 entity_t *entity = NULL;
10207 symbol_t *symbol = NULL;
10209 if (token.type == T_IDENTIFIER) {
10210 symbol = token.symbol;
10213 entity = get_entity(symbol, NAMESPACE_NORMAL);
10215 && entity->kind != ENTITY_NAMESPACE
10216 && entity->base.parent_scope == current_scope) {
10217 if (is_entity_valid(entity)) {
10218 error_redefined_as_different_kind(&token.source_position,
10219 entity, ENTITY_NAMESPACE);
10225 if (entity == NULL) {
10226 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10227 entity->base.symbol = symbol;
10228 entity->base.source_position = token.source_position;
10229 entity->base.namespc = NAMESPACE_NORMAL;
10230 entity->base.parent_scope = current_scope;
10233 if (token.type == '=') {
10234 /* TODO: parse namespace alias */
10235 panic("namespace alias definition not supported yet");
10238 environment_push(entity);
10239 append_entity(current_scope, entity);
10241 size_t const top = environment_top();
10242 scope_t *old_scope = scope_push(&entity->namespacee.members);
10244 entity_t *old_current_entity = current_entity;
10245 current_entity = entity;
10247 expect('{', end_error);
10249 expect('}', end_error);
10252 assert(current_scope == &entity->namespacee.members);
10253 assert(current_entity == entity);
10254 current_entity = old_current_entity;
10255 scope_pop(old_scope);
10256 environment_pop_to(top);
10260 * Parse a statement.
10261 * There's also parse_statement() which additionally checks for
10262 * "statement has no effect" warnings
10264 static statement_t *intern_parse_statement(void)
10266 statement_t *statement = NULL;
10268 /* declaration or statement */
10269 add_anchor_token(';');
10270 switch (token.type) {
10271 case T_IDENTIFIER: {
10272 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10273 if (la1_type == ':') {
10274 statement = parse_label_statement();
10275 } else if (is_typedef_symbol(token.symbol)) {
10276 statement = parse_declaration_statement();
10278 /* it's an identifier, the grammar says this must be an
10279 * expression statement. However it is common that users mistype
10280 * declaration types, so we guess a bit here to improve robustness
10281 * for incorrect programs */
10282 switch (la1_type) {
10285 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10287 statement = parse_expression_statement();
10291 statement = parse_declaration_statement();
10299 case T___extension__:
10300 /* This can be a prefix to a declaration or an expression statement.
10301 * We simply eat it now and parse the rest with tail recursion. */
10302 while (next_if(T___extension__)) {}
10303 bool old_gcc_extension = in_gcc_extension;
10304 in_gcc_extension = true;
10305 statement = intern_parse_statement();
10306 in_gcc_extension = old_gcc_extension;
10310 statement = parse_declaration_statement();
10314 statement = parse_local_label_declaration();
10317 case ';': statement = parse_empty_statement(); break;
10318 case '{': statement = parse_compound_statement(false); break;
10319 case T___leave: statement = parse_leave_statement(); break;
10320 case T___try: statement = parse_ms_try_statment(); break;
10321 case T_asm: statement = parse_asm_statement(); break;
10322 case T_break: statement = parse_break(); break;
10323 case T_case: statement = parse_case_statement(); break;
10324 case T_continue: statement = parse_continue(); break;
10325 case T_default: statement = parse_default_statement(); break;
10326 case T_do: statement = parse_do(); break;
10327 case T_for: statement = parse_for(); break;
10328 case T_goto: statement = parse_goto(); break;
10329 case T_if: statement = parse_if(); break;
10330 case T_return: statement = parse_return(); break;
10331 case T_switch: statement = parse_switch(); break;
10332 case T_while: statement = parse_while(); break;
10335 statement = parse_expression_statement();
10339 errorf(HERE, "unexpected token %K while parsing statement", &token);
10340 statement = create_invalid_statement();
10345 rem_anchor_token(';');
10347 assert(statement != NULL
10348 && statement->base.source_position.input_name != NULL);
10354 * parse a statement and emits "statement has no effect" warning if needed
10355 * (This is really a wrapper around intern_parse_statement with check for 1
10356 * single warning. It is needed, because for statement expressions we have
10357 * to avoid the warning on the last statement)
10359 static statement_t *parse_statement(void)
10361 statement_t *statement = intern_parse_statement();
10363 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10364 expression_t *expression = statement->expression.expression;
10365 if (!expression_has_effect(expression)) {
10366 warningf(&expression->base.source_position,
10367 "statement has no effect");
10375 * Parse a compound statement.
10377 static statement_t *parse_compound_statement(bool inside_expression_statement)
10379 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10381 PUSH_PARENT(statement);
10384 add_anchor_token('}');
10385 /* tokens, which can start a statement */
10386 /* TODO MS, __builtin_FOO */
10387 add_anchor_token('!');
10388 add_anchor_token('&');
10389 add_anchor_token('(');
10390 add_anchor_token('*');
10391 add_anchor_token('+');
10392 add_anchor_token('-');
10393 add_anchor_token('{');
10394 add_anchor_token('~');
10395 add_anchor_token(T_CHARACTER_CONSTANT);
10396 add_anchor_token(T_COLONCOLON);
10397 add_anchor_token(T_FLOATINGPOINT);
10398 add_anchor_token(T_IDENTIFIER);
10399 add_anchor_token(T_INTEGER);
10400 add_anchor_token(T_MINUSMINUS);
10401 add_anchor_token(T_PLUSPLUS);
10402 add_anchor_token(T_STRING_LITERAL);
10403 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10404 add_anchor_token(T_WIDE_STRING_LITERAL);
10405 add_anchor_token(T__Bool);
10406 add_anchor_token(T__Complex);
10407 add_anchor_token(T__Imaginary);
10408 add_anchor_token(T___FUNCTION__);
10409 add_anchor_token(T___PRETTY_FUNCTION__);
10410 add_anchor_token(T___alignof__);
10411 add_anchor_token(T___attribute__);
10412 add_anchor_token(T___builtin_va_start);
10413 add_anchor_token(T___extension__);
10414 add_anchor_token(T___func__);
10415 add_anchor_token(T___imag__);
10416 add_anchor_token(T___label__);
10417 add_anchor_token(T___real__);
10418 add_anchor_token(T___thread);
10419 add_anchor_token(T_asm);
10420 add_anchor_token(T_auto);
10421 add_anchor_token(T_bool);
10422 add_anchor_token(T_break);
10423 add_anchor_token(T_case);
10424 add_anchor_token(T_char);
10425 add_anchor_token(T_class);
10426 add_anchor_token(T_const);
10427 add_anchor_token(T_const_cast);
10428 add_anchor_token(T_continue);
10429 add_anchor_token(T_default);
10430 add_anchor_token(T_delete);
10431 add_anchor_token(T_double);
10432 add_anchor_token(T_do);
10433 add_anchor_token(T_dynamic_cast);
10434 add_anchor_token(T_enum);
10435 add_anchor_token(T_extern);
10436 add_anchor_token(T_false);
10437 add_anchor_token(T_float);
10438 add_anchor_token(T_for);
10439 add_anchor_token(T_goto);
10440 add_anchor_token(T_if);
10441 add_anchor_token(T_inline);
10442 add_anchor_token(T_int);
10443 add_anchor_token(T_long);
10444 add_anchor_token(T_new);
10445 add_anchor_token(T_operator);
10446 add_anchor_token(T_register);
10447 add_anchor_token(T_reinterpret_cast);
10448 add_anchor_token(T_restrict);
10449 add_anchor_token(T_return);
10450 add_anchor_token(T_short);
10451 add_anchor_token(T_signed);
10452 add_anchor_token(T_sizeof);
10453 add_anchor_token(T_static);
10454 add_anchor_token(T_static_cast);
10455 add_anchor_token(T_struct);
10456 add_anchor_token(T_switch);
10457 add_anchor_token(T_template);
10458 add_anchor_token(T_this);
10459 add_anchor_token(T_throw);
10460 add_anchor_token(T_true);
10461 add_anchor_token(T_try);
10462 add_anchor_token(T_typedef);
10463 add_anchor_token(T_typeid);
10464 add_anchor_token(T_typename);
10465 add_anchor_token(T_typeof);
10466 add_anchor_token(T_union);
10467 add_anchor_token(T_unsigned);
10468 add_anchor_token(T_using);
10469 add_anchor_token(T_void);
10470 add_anchor_token(T_volatile);
10471 add_anchor_token(T_wchar_t);
10472 add_anchor_token(T_while);
10474 size_t const top = environment_top();
10475 scope_t *old_scope = scope_push(&statement->compound.scope);
10477 statement_t **anchor = &statement->compound.statements;
10478 bool only_decls_so_far = true;
10479 while (token.type != '}') {
10480 if (token.type == T_EOF) {
10481 errorf(&statement->base.source_position,
10482 "EOF while parsing compound statement");
10485 statement_t *sub_statement = intern_parse_statement();
10486 if (is_invalid_statement(sub_statement)) {
10487 /* an error occurred. if we are at an anchor, return */
10493 if (warning.declaration_after_statement) {
10494 if (sub_statement->kind != STATEMENT_DECLARATION) {
10495 only_decls_so_far = false;
10496 } else if (!only_decls_so_far) {
10497 warningf(&sub_statement->base.source_position,
10498 "ISO C90 forbids mixed declarations and code");
10502 *anchor = sub_statement;
10504 while (sub_statement->base.next != NULL)
10505 sub_statement = sub_statement->base.next;
10507 anchor = &sub_statement->base.next;
10511 /* look over all statements again to produce no effect warnings */
10512 if (warning.unused_value) {
10513 statement_t *sub_statement = statement->compound.statements;
10514 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10515 if (sub_statement->kind != STATEMENT_EXPRESSION)
10517 /* don't emit a warning for the last expression in an expression
10518 * statement as it has always an effect */
10519 if (inside_expression_statement && sub_statement->base.next == NULL)
10522 expression_t *expression = sub_statement->expression.expression;
10523 if (!expression_has_effect(expression)) {
10524 warningf(&expression->base.source_position,
10525 "statement has no effect");
10531 rem_anchor_token(T_while);
10532 rem_anchor_token(T_wchar_t);
10533 rem_anchor_token(T_volatile);
10534 rem_anchor_token(T_void);
10535 rem_anchor_token(T_using);
10536 rem_anchor_token(T_unsigned);
10537 rem_anchor_token(T_union);
10538 rem_anchor_token(T_typeof);
10539 rem_anchor_token(T_typename);
10540 rem_anchor_token(T_typeid);
10541 rem_anchor_token(T_typedef);
10542 rem_anchor_token(T_try);
10543 rem_anchor_token(T_true);
10544 rem_anchor_token(T_throw);
10545 rem_anchor_token(T_this);
10546 rem_anchor_token(T_template);
10547 rem_anchor_token(T_switch);
10548 rem_anchor_token(T_struct);
10549 rem_anchor_token(T_static_cast);
10550 rem_anchor_token(T_static);
10551 rem_anchor_token(T_sizeof);
10552 rem_anchor_token(T_signed);
10553 rem_anchor_token(T_short);
10554 rem_anchor_token(T_return);
10555 rem_anchor_token(T_restrict);
10556 rem_anchor_token(T_reinterpret_cast);
10557 rem_anchor_token(T_register);
10558 rem_anchor_token(T_operator);
10559 rem_anchor_token(T_new);
10560 rem_anchor_token(T_long);
10561 rem_anchor_token(T_int);
10562 rem_anchor_token(T_inline);
10563 rem_anchor_token(T_if);
10564 rem_anchor_token(T_goto);
10565 rem_anchor_token(T_for);
10566 rem_anchor_token(T_float);
10567 rem_anchor_token(T_false);
10568 rem_anchor_token(T_extern);
10569 rem_anchor_token(T_enum);
10570 rem_anchor_token(T_dynamic_cast);
10571 rem_anchor_token(T_do);
10572 rem_anchor_token(T_double);
10573 rem_anchor_token(T_delete);
10574 rem_anchor_token(T_default);
10575 rem_anchor_token(T_continue);
10576 rem_anchor_token(T_const_cast);
10577 rem_anchor_token(T_const);
10578 rem_anchor_token(T_class);
10579 rem_anchor_token(T_char);
10580 rem_anchor_token(T_case);
10581 rem_anchor_token(T_break);
10582 rem_anchor_token(T_bool);
10583 rem_anchor_token(T_auto);
10584 rem_anchor_token(T_asm);
10585 rem_anchor_token(T___thread);
10586 rem_anchor_token(T___real__);
10587 rem_anchor_token(T___label__);
10588 rem_anchor_token(T___imag__);
10589 rem_anchor_token(T___func__);
10590 rem_anchor_token(T___extension__);
10591 rem_anchor_token(T___builtin_va_start);
10592 rem_anchor_token(T___attribute__);
10593 rem_anchor_token(T___alignof__);
10594 rem_anchor_token(T___PRETTY_FUNCTION__);
10595 rem_anchor_token(T___FUNCTION__);
10596 rem_anchor_token(T__Imaginary);
10597 rem_anchor_token(T__Complex);
10598 rem_anchor_token(T__Bool);
10599 rem_anchor_token(T_WIDE_STRING_LITERAL);
10600 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10601 rem_anchor_token(T_STRING_LITERAL);
10602 rem_anchor_token(T_PLUSPLUS);
10603 rem_anchor_token(T_MINUSMINUS);
10604 rem_anchor_token(T_INTEGER);
10605 rem_anchor_token(T_IDENTIFIER);
10606 rem_anchor_token(T_FLOATINGPOINT);
10607 rem_anchor_token(T_COLONCOLON);
10608 rem_anchor_token(T_CHARACTER_CONSTANT);
10609 rem_anchor_token('~');
10610 rem_anchor_token('{');
10611 rem_anchor_token('-');
10612 rem_anchor_token('+');
10613 rem_anchor_token('*');
10614 rem_anchor_token('(');
10615 rem_anchor_token('&');
10616 rem_anchor_token('!');
10617 rem_anchor_token('}');
10618 assert(current_scope == &statement->compound.scope);
10619 scope_pop(old_scope);
10620 environment_pop_to(top);
10627 * Check for unused global static functions and variables
10629 static void check_unused_globals(void)
10631 if (!warning.unused_function && !warning.unused_variable)
10634 for (const entity_t *entity = file_scope->entities; entity != NULL;
10635 entity = entity->base.next) {
10636 if (!is_declaration(entity))
10639 const declaration_t *declaration = &entity->declaration;
10640 if (declaration->used ||
10641 declaration->modifiers & DM_UNUSED ||
10642 declaration->modifiers & DM_USED ||
10643 declaration->storage_class != STORAGE_CLASS_STATIC)
10646 type_t *const type = declaration->type;
10648 if (entity->kind == ENTITY_FUNCTION) {
10649 /* inhibit warning for static inline functions */
10650 if (entity->function.is_inline)
10653 s = entity->function.statement != NULL ? "defined" : "declared";
10658 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10659 type, declaration->base.symbol, s);
10663 static void parse_global_asm(void)
10665 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10668 expect('(', end_error);
10670 statement->asms.asm_text = parse_string_literals();
10671 statement->base.next = unit->global_asm;
10672 unit->global_asm = statement;
10674 expect(')', end_error);
10675 expect(';', end_error);
10680 static void parse_linkage_specification(void)
10684 const char *linkage = parse_string_literals().begin;
10686 linkage_kind_t old_linkage = current_linkage;
10687 linkage_kind_t new_linkage;
10688 if (strcmp(linkage, "C") == 0) {
10689 new_linkage = LINKAGE_C;
10690 } else if (strcmp(linkage, "C++") == 0) {
10691 new_linkage = LINKAGE_CXX;
10693 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10694 new_linkage = LINKAGE_INVALID;
10696 current_linkage = new_linkage;
10698 if (next_if('{')) {
10700 expect('}', end_error);
10706 assert(current_linkage == new_linkage);
10707 current_linkage = old_linkage;
10710 static void parse_external(void)
10712 switch (token.type) {
10713 DECLARATION_START_NO_EXTERN
10715 case T___extension__:
10716 /* tokens below are for implicit int */
10717 case '&': /* & x; -> int& x; (and error later, because C++ has no
10719 case '*': /* * x; -> int* x; */
10720 case '(': /* (x); -> int (x); */
10721 parse_external_declaration();
10725 if (look_ahead(1)->type == T_STRING_LITERAL) {
10726 parse_linkage_specification();
10728 parse_external_declaration();
10733 parse_global_asm();
10737 parse_namespace_definition();
10741 if (!strict_mode) {
10743 warningf(HERE, "stray ';' outside of function");
10750 errorf(HERE, "stray %K outside of function", &token);
10751 if (token.type == '(' || token.type == '{' || token.type == '[')
10752 eat_until_matching_token(token.type);
10758 static void parse_externals(void)
10760 add_anchor_token('}');
10761 add_anchor_token(T_EOF);
10764 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10765 unsigned char token_anchor_copy[T_LAST_TOKEN];
10766 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10769 while (token.type != T_EOF && token.type != '}') {
10771 bool anchor_leak = false;
10772 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10773 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10775 /* the anchor set and its copy differs */
10776 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10777 anchor_leak = true;
10780 if (in_gcc_extension) {
10781 /* an gcc extension scope was not closed */
10782 internal_errorf(HERE, "Leaked __extension__");
10783 anchor_leak = true;
10793 rem_anchor_token(T_EOF);
10794 rem_anchor_token('}');
10798 * Parse a translation unit.
10800 static void parse_translation_unit(void)
10802 add_anchor_token(T_EOF);
10807 if (token.type == T_EOF)
10810 errorf(HERE, "stray %K outside of function", &token);
10811 if (token.type == '(' || token.type == '{' || token.type == '[')
10812 eat_until_matching_token(token.type);
10817 void set_default_visibility(elf_visibility_tag_t visibility)
10819 default_visibility = visibility;
10825 * @return the translation unit or NULL if errors occurred.
10827 void start_parsing(void)
10829 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10830 label_stack = NEW_ARR_F(stack_entry_t, 0);
10831 diagnostic_count = 0;
10835 print_to_file(stderr);
10837 assert(unit == NULL);
10838 unit = allocate_ast_zero(sizeof(unit[0]));
10840 assert(file_scope == NULL);
10841 file_scope = &unit->scope;
10843 assert(current_scope == NULL);
10844 scope_push(&unit->scope);
10846 create_gnu_builtins();
10848 create_microsoft_intrinsics();
10851 translation_unit_t *finish_parsing(void)
10853 assert(current_scope == &unit->scope);
10856 assert(file_scope == &unit->scope);
10857 check_unused_globals();
10860 DEL_ARR_F(environment_stack);
10861 DEL_ARR_F(label_stack);
10863 translation_unit_t *result = unit;
10868 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10869 * are given length one. */
10870 static void complete_incomplete_arrays(void)
10872 size_t n = ARR_LEN(incomplete_arrays);
10873 for (size_t i = 0; i != n; ++i) {
10874 declaration_t *const decl = incomplete_arrays[i];
10875 type_t *const orig_type = decl->type;
10876 type_t *const type = skip_typeref(orig_type);
10878 if (!is_type_incomplete(type))
10881 if (warning.other) {
10882 warningf(&decl->base.source_position,
10883 "array '%#T' assumed to have one element",
10884 orig_type, decl->base.symbol);
10887 type_t *const new_type = duplicate_type(type);
10888 new_type->array.size_constant = true;
10889 new_type->array.has_implicit_size = true;
10890 new_type->array.size = 1;
10892 type_t *const result = identify_new_type(new_type);
10894 decl->type = result;
10898 void prepare_main_collect2(entity_t *entity)
10900 // create call to __main
10901 symbol_t *symbol = symbol_table_insert("__main");
10902 entity_t *subsubmain_ent
10903 = create_implicit_function(symbol, &builtin_source_position);
10905 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10906 type_t *ftype = subsubmain_ent->declaration.type;
10907 ref->base.source_position = builtin_source_position;
10908 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10909 ref->reference.entity = subsubmain_ent;
10911 expression_t *call = allocate_expression_zero(EXPR_CALL);
10912 call->base.source_position = builtin_source_position;
10913 call->base.type = type_void;
10914 call->call.function = ref;
10916 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10917 expr_statement->base.source_position = builtin_source_position;
10918 expr_statement->expression.expression = call;
10920 statement_t *statement = entity->function.statement;
10921 assert(statement->kind == STATEMENT_COMPOUND);
10922 compound_statement_t *compounds = &statement->compound;
10924 expr_statement->base.next = compounds->statements;
10925 compounds->statements = expr_statement;
10930 lookahead_bufpos = 0;
10931 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10934 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10935 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10936 parse_translation_unit();
10937 complete_incomplete_arrays();
10938 DEL_ARR_F(incomplete_arrays);
10939 incomplete_arrays = NULL;
10943 * Initialize the parser.
10945 void init_parser(void)
10947 sym_anonymous = symbol_table_insert("<anonymous>");
10949 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10951 init_expression_parsers();
10952 obstack_init(&temp_obst);
10956 * Terminate the parser.
10958 void exit_parser(void)
10960 obstack_free(&temp_obst, NULL);