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) {
2711 } else if (strcmp(symbol->string, "get") == 0) {
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 property->put_symbol = token.symbol;
2726 property->get_symbol = token.symbol;
2729 } while (next_if(','));
2731 attribute->a.property = property;
2733 expect(')', end_error);
2739 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2741 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2742 if (next_if(T_restrict)) {
2743 kind = ATTRIBUTE_MS_RESTRICT;
2744 } else if (token.type == T_IDENTIFIER) {
2745 const char *name = token.symbol->string;
2747 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2749 const char *attribute_name = get_attribute_name(k);
2750 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2756 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2757 warningf(HERE, "unknown __declspec '%s' ignored", name);
2760 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2764 attribute_t *attribute = allocate_attribute_zero(kind);
2766 if (kind == ATTRIBUTE_MS_PROPERTY) {
2767 return parse_attribute_ms_property(attribute);
2770 /* parse arguments */
2772 attribute->a.arguments = parse_attribute_arguments();
2777 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2781 expect('(', end_error);
2786 add_anchor_token(')');
2788 attribute_t **anchor = &first;
2790 while (*anchor != NULL)
2791 anchor = &(*anchor)->next;
2793 attribute_t *attribute
2794 = parse_microsoft_extended_decl_modifier_single();
2795 if (attribute == NULL)
2798 *anchor = attribute;
2799 anchor = &attribute->next;
2800 } while (next_if(','));
2802 rem_anchor_token(')');
2803 expect(')', end_error);
2807 rem_anchor_token(')');
2811 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2813 entity_t *entity = allocate_entity_zero(kind);
2814 entity->base.namespc = NAMESPACE_NORMAL;
2815 entity->base.source_position = *HERE;
2816 entity->base.symbol = symbol;
2817 if (is_declaration(entity)) {
2818 entity->declaration.type = type_error_type;
2819 entity->declaration.implicit = true;
2820 } else if (kind == ENTITY_TYPEDEF) {
2821 entity->typedefe.type = type_error_type;
2822 entity->typedefe.builtin = true;
2824 if (kind != ENTITY_COMPOUND_MEMBER)
2825 record_entity(entity, false);
2829 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2831 type_t *type = NULL;
2832 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2833 unsigned type_specifiers = 0;
2834 bool newtype = false;
2835 bool saw_error = false;
2836 bool old_gcc_extension = in_gcc_extension;
2838 memset(specifiers, 0, sizeof(*specifiers));
2839 specifiers->source_position = token.source_position;
2842 specifiers->attributes = parse_attributes(specifiers->attributes);
2844 switch (token.type) {
2846 #define MATCH_STORAGE_CLASS(token, class) \
2848 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2849 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2851 specifiers->storage_class = class; \
2852 if (specifiers->thread_local) \
2853 goto check_thread_storage_class; \
2857 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2858 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2859 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2860 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2861 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2864 specifiers->attributes
2865 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2869 if (specifiers->thread_local) {
2870 errorf(HERE, "duplicate '__thread'");
2872 specifiers->thread_local = true;
2873 check_thread_storage_class:
2874 switch (specifiers->storage_class) {
2875 case STORAGE_CLASS_EXTERN:
2876 case STORAGE_CLASS_NONE:
2877 case STORAGE_CLASS_STATIC:
2881 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2882 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2883 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2884 wrong_thread_storage_class:
2885 errorf(HERE, "'__thread' used with '%s'", wrong);
2892 /* type qualifiers */
2893 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2895 qualifiers |= qualifier; \
2899 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2900 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2901 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2902 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2903 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2904 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2905 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2906 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2908 case T___extension__:
2910 in_gcc_extension = true;
2913 /* type specifiers */
2914 #define MATCH_SPECIFIER(token, specifier, name) \
2916 if (type_specifiers & specifier) { \
2917 errorf(HERE, "multiple " name " type specifiers given"); \
2919 type_specifiers |= specifier; \
2924 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2925 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2926 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2927 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2928 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2929 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2930 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2931 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2932 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2933 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2934 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2935 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2936 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2937 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2938 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2939 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2940 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2941 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2945 specifiers->is_inline = true;
2949 case T__forceinline:
2951 specifiers->modifiers |= DM_FORCEINLINE;
2956 if (type_specifiers & SPECIFIER_LONG_LONG) {
2957 errorf(HERE, "too many long type specifiers given");
2958 } else if (type_specifiers & SPECIFIER_LONG) {
2959 type_specifiers |= SPECIFIER_LONG_LONG;
2961 type_specifiers |= SPECIFIER_LONG;
2966 #define CHECK_DOUBLE_TYPE() \
2967 if ( type != NULL) \
2968 errorf(HERE, "multiple data types in declaration specifiers");
2971 CHECK_DOUBLE_TYPE();
2972 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2974 type->compound.compound = parse_compound_type_specifier(true);
2977 CHECK_DOUBLE_TYPE();
2978 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2979 type->compound.compound = parse_compound_type_specifier(false);
2982 CHECK_DOUBLE_TYPE();
2983 type = parse_enum_specifier();
2986 CHECK_DOUBLE_TYPE();
2987 type = parse_typeof();
2989 case T___builtin_va_list:
2990 CHECK_DOUBLE_TYPE();
2991 type = duplicate_type(type_valist);
2995 case T_IDENTIFIER: {
2996 /* only parse identifier if we haven't found a type yet */
2997 if (type != NULL || type_specifiers != 0) {
2998 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2999 * declaration, so it doesn't generate errors about expecting '(' or
3001 switch (look_ahead(1)->type) {
3008 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3012 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3017 goto finish_specifiers;
3021 type_t *const typedef_type = get_typedef_type(token.symbol);
3022 if (typedef_type == NULL) {
3023 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3024 * declaration, so it doesn't generate 'implicit int' followed by more
3025 * errors later on. */
3026 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3032 errorf(HERE, "%K does not name a type", &token);
3035 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3037 type = allocate_type_zero(TYPE_TYPEDEF);
3038 type->typedeft.typedefe = &entity->typedefe;
3046 goto finish_specifiers;
3051 type = typedef_type;
3055 /* function specifier */
3057 goto finish_specifiers;
3062 specifiers->attributes = parse_attributes(specifiers->attributes);
3064 in_gcc_extension = old_gcc_extension;
3066 if (type == NULL || (saw_error && type_specifiers != 0)) {
3067 atomic_type_kind_t atomic_type;
3069 /* match valid basic types */
3070 switch (type_specifiers) {
3071 case SPECIFIER_VOID:
3072 atomic_type = ATOMIC_TYPE_VOID;
3074 case SPECIFIER_WCHAR_T:
3075 atomic_type = ATOMIC_TYPE_WCHAR_T;
3077 case SPECIFIER_CHAR:
3078 atomic_type = ATOMIC_TYPE_CHAR;
3080 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3081 atomic_type = ATOMIC_TYPE_SCHAR;
3083 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3084 atomic_type = ATOMIC_TYPE_UCHAR;
3086 case SPECIFIER_SHORT:
3087 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3088 case SPECIFIER_SHORT | SPECIFIER_INT:
3089 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3090 atomic_type = ATOMIC_TYPE_SHORT;
3092 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3093 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3094 atomic_type = ATOMIC_TYPE_USHORT;
3097 case SPECIFIER_SIGNED:
3098 case SPECIFIER_SIGNED | SPECIFIER_INT:
3099 atomic_type = ATOMIC_TYPE_INT;
3101 case SPECIFIER_UNSIGNED:
3102 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3103 atomic_type = ATOMIC_TYPE_UINT;
3105 case SPECIFIER_LONG:
3106 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3107 case SPECIFIER_LONG | SPECIFIER_INT:
3108 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3109 atomic_type = ATOMIC_TYPE_LONG;
3111 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3112 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3113 atomic_type = ATOMIC_TYPE_ULONG;
3116 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3117 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3118 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3119 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3121 atomic_type = ATOMIC_TYPE_LONGLONG;
3122 goto warn_about_long_long;
3124 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3125 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3127 atomic_type = ATOMIC_TYPE_ULONGLONG;
3128 warn_about_long_long:
3129 if (warning.long_long) {
3130 warningf(&specifiers->source_position,
3131 "ISO C90 does not support 'long long'");
3135 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3136 atomic_type = unsigned_int8_type_kind;
3139 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3140 atomic_type = unsigned_int16_type_kind;
3143 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3144 atomic_type = unsigned_int32_type_kind;
3147 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3148 atomic_type = unsigned_int64_type_kind;
3151 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3152 atomic_type = unsigned_int128_type_kind;
3155 case SPECIFIER_INT8:
3156 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3157 atomic_type = int8_type_kind;
3160 case SPECIFIER_INT16:
3161 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3162 atomic_type = int16_type_kind;
3165 case SPECIFIER_INT32:
3166 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3167 atomic_type = int32_type_kind;
3170 case SPECIFIER_INT64:
3171 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3172 atomic_type = int64_type_kind;
3175 case SPECIFIER_INT128:
3176 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3177 atomic_type = int128_type_kind;
3180 case SPECIFIER_FLOAT:
3181 atomic_type = ATOMIC_TYPE_FLOAT;
3183 case SPECIFIER_DOUBLE:
3184 atomic_type = ATOMIC_TYPE_DOUBLE;
3186 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3187 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3189 case SPECIFIER_BOOL:
3190 atomic_type = ATOMIC_TYPE_BOOL;
3192 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3193 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3194 atomic_type = ATOMIC_TYPE_FLOAT;
3196 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3197 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3198 atomic_type = ATOMIC_TYPE_DOUBLE;
3200 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3201 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3202 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3205 /* invalid specifier combination, give an error message */
3206 if (type_specifiers == 0) {
3208 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3209 if (!(c_mode & _CXX) && !strict_mode) {
3210 if (warning.implicit_int) {
3211 warningf(HERE, "no type specifiers in declaration, using 'int'");
3213 atomic_type = ATOMIC_TYPE_INT;
3216 errorf(HERE, "no type specifiers given in declaration");
3219 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3220 (type_specifiers & SPECIFIER_UNSIGNED)) {
3221 errorf(HERE, "signed and unsigned specifiers given");
3222 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3223 errorf(HERE, "only integer types can be signed or unsigned");
3225 errorf(HERE, "multiple datatypes in declaration");
3230 if (type_specifiers & SPECIFIER_COMPLEX) {
3231 type = allocate_type_zero(TYPE_COMPLEX);
3232 type->complex.akind = atomic_type;
3233 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3234 type = allocate_type_zero(TYPE_IMAGINARY);
3235 type->imaginary.akind = atomic_type;
3237 type = allocate_type_zero(TYPE_ATOMIC);
3238 type->atomic.akind = atomic_type;
3241 } else if (type_specifiers != 0) {
3242 errorf(HERE, "multiple datatypes in declaration");
3245 /* FIXME: check type qualifiers here */
3246 type->base.qualifiers = qualifiers;
3249 type = identify_new_type(type);
3251 type = typehash_insert(type);
3254 if (specifiers->attributes != NULL)
3255 type = handle_type_attributes(specifiers->attributes, type);
3256 specifiers->type = type;
3260 specifiers->type = type_error_type;
3263 static type_qualifiers_t parse_type_qualifiers(void)
3265 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3268 switch (token.type) {
3269 /* type qualifiers */
3270 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3271 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3272 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3273 /* microsoft extended type modifiers */
3274 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3275 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3276 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3277 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3278 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3287 * Parses an K&R identifier list
3289 static void parse_identifier_list(scope_t *scope)
3292 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3293 entity->base.source_position = token.source_position;
3294 entity->base.namespc = NAMESPACE_NORMAL;
3295 entity->base.symbol = token.symbol;
3296 /* a K&R parameter has no type, yet */
3300 append_entity(scope, entity);
3301 } while (next_if(',') && token.type == T_IDENTIFIER);
3304 static entity_t *parse_parameter(void)
3306 declaration_specifiers_t specifiers;
3307 parse_declaration_specifiers(&specifiers);
3309 entity_t *entity = parse_declarator(&specifiers,
3310 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3311 anonymous_entity = NULL;
3315 static void semantic_parameter_incomplete(const entity_t *entity)
3317 assert(entity->kind == ENTITY_PARAMETER);
3319 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3320 * list in a function declarator that is part of a
3321 * definition of that function shall not have
3322 * incomplete type. */
3323 type_t *type = skip_typeref(entity->declaration.type);
3324 if (is_type_incomplete(type)) {
3325 errorf(&entity->base.source_position,
3326 "parameter '%#T' has incomplete type",
3327 entity->declaration.type, entity->base.symbol);
3331 static bool has_parameters(void)
3333 /* func(void) is not a parameter */
3334 if (token.type == T_IDENTIFIER) {
3335 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3338 if (entity->kind != ENTITY_TYPEDEF)
3340 if (skip_typeref(entity->typedefe.type) != type_void)
3342 } else if (token.type != T_void) {
3345 if (look_ahead(1)->type != ')')
3352 * Parses function type parameters (and optionally creates variable_t entities
3353 * for them in a scope)
3355 static void parse_parameters(function_type_t *type, scope_t *scope)
3358 add_anchor_token(')');
3359 int saved_comma_state = save_and_reset_anchor_state(',');
3361 if (token.type == T_IDENTIFIER &&
3362 !is_typedef_symbol(token.symbol)) {
3363 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3364 if (la1_type == ',' || la1_type == ')') {
3365 type->kr_style_parameters = true;
3366 parse_identifier_list(scope);
3367 goto parameters_finished;
3371 if (token.type == ')') {
3372 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3373 if (!(c_mode & _CXX))
3374 type->unspecified_parameters = true;
3375 } else if (has_parameters()) {
3376 function_parameter_t **anchor = &type->parameters;
3378 switch (token.type) {
3381 type->variadic = true;
3382 goto parameters_finished;
3385 case T___extension__:
3388 entity_t *entity = parse_parameter();
3389 if (entity->kind == ENTITY_TYPEDEF) {
3390 errorf(&entity->base.source_position,
3391 "typedef not allowed as function parameter");
3394 assert(is_declaration(entity));
3396 semantic_parameter_incomplete(entity);
3398 function_parameter_t *const parameter =
3399 allocate_parameter(entity->declaration.type);
3401 if (scope != NULL) {
3402 append_entity(scope, entity);
3405 *anchor = parameter;
3406 anchor = ¶meter->next;
3411 goto parameters_finished;
3413 } while (next_if(','));
3416 parameters_finished:
3417 rem_anchor_token(')');
3418 expect(')', end_error);
3421 restore_anchor_state(',', saved_comma_state);
3424 typedef enum construct_type_kind_t {
3427 CONSTRUCT_REFERENCE,
3430 } construct_type_kind_t;
3432 typedef union construct_type_t construct_type_t;
3434 typedef struct construct_type_base_t {
3435 construct_type_kind_t kind;
3436 source_position_t pos;
3437 construct_type_t *next;
3438 } construct_type_base_t;
3440 typedef struct parsed_pointer_t {
3441 construct_type_base_t base;
3442 type_qualifiers_t type_qualifiers;
3443 variable_t *base_variable; /**< MS __based extension. */
3446 typedef struct parsed_reference_t {
3447 construct_type_base_t base;
3448 } parsed_reference_t;
3450 typedef struct construct_function_type_t {
3451 construct_type_base_t base;
3452 type_t *function_type;
3453 } construct_function_type_t;
3455 typedef struct parsed_array_t {
3456 construct_type_base_t base;
3457 type_qualifiers_t type_qualifiers;
3463 union construct_type_t {
3464 construct_type_kind_t kind;
3465 construct_type_base_t base;
3466 parsed_pointer_t pointer;
3467 parsed_reference_t reference;
3468 construct_function_type_t function;
3469 parsed_array_t array;
3472 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3474 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3475 memset(cons, 0, size);
3477 cons->base.pos = *HERE;
3482 static construct_type_t *parse_pointer_declarator(void)
3484 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3486 cons->pointer.type_qualifiers = parse_type_qualifiers();
3487 //cons->pointer.base_variable = base_variable;
3492 /* ISO/IEC 14882:1998(E) §8.3.2 */
3493 static construct_type_t *parse_reference_declarator(void)
3495 if (!(c_mode & _CXX))
3496 errorf(HERE, "references are only available for C++");
3498 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3505 static construct_type_t *parse_array_declarator(void)
3507 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3508 parsed_array_t *const array = &cons->array;
3511 add_anchor_token(']');
3513 bool is_static = next_if(T_static);
3515 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3518 is_static = next_if(T_static);
3520 array->type_qualifiers = type_qualifiers;
3521 array->is_static = is_static;
3523 expression_t *size = NULL;
3524 if (token.type == '*' && look_ahead(1)->type == ']') {
3525 array->is_variable = true;
3527 } else if (token.type != ']') {
3528 size = parse_assignment_expression();
3530 /* §6.7.5.2:1 Array size must have integer type */
3531 type_t *const orig_type = size->base.type;
3532 type_t *const type = skip_typeref(orig_type);
3533 if (!is_type_integer(type) && is_type_valid(type)) {
3534 errorf(&size->base.source_position,
3535 "array size '%E' must have integer type but has type '%T'",
3540 mark_vars_read(size, NULL);
3543 if (is_static && size == NULL)
3544 errorf(&array->base.pos, "static array parameters require a size");
3546 rem_anchor_token(']');
3547 expect(']', end_error);
3554 static construct_type_t *parse_function_declarator(scope_t *scope)
3556 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3558 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3559 function_type_t *ftype = &type->function;
3561 ftype->linkage = current_linkage;
3562 ftype->calling_convention = CC_DEFAULT;
3564 parse_parameters(ftype, scope);
3566 cons->function.function_type = type;
3571 typedef struct parse_declarator_env_t {
3572 bool may_be_abstract : 1;
3573 bool must_be_abstract : 1;
3574 decl_modifiers_t modifiers;
3576 source_position_t source_position;
3578 attribute_t *attributes;
3579 } parse_declarator_env_t;
3582 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3584 /* construct a single linked list of construct_type_t's which describe
3585 * how to construct the final declarator type */
3586 construct_type_t *first = NULL;
3587 construct_type_t **anchor = &first;
3589 env->attributes = parse_attributes(env->attributes);
3592 construct_type_t *type;
3593 //variable_t *based = NULL; /* MS __based extension */
3594 switch (token.type) {
3596 type = parse_reference_declarator();
3600 panic("based not supported anymore");
3605 type = parse_pointer_declarator();
3609 goto ptr_operator_end;
3613 anchor = &type->base.next;
3615 /* TODO: find out if this is correct */
3616 env->attributes = parse_attributes(env->attributes);
3620 construct_type_t *inner_types = NULL;
3622 switch (token.type) {
3624 if (env->must_be_abstract) {
3625 errorf(HERE, "no identifier expected in typename");
3627 env->symbol = token.symbol;
3628 env->source_position = token.source_position;
3634 /* Parenthesized declarator or function declarator? */
3635 token_t const *const la1 = look_ahead(1);
3636 switch (la1->type) {
3638 if (is_typedef_symbol(la1->symbol)) {
3640 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3641 * interpreted as ``function with no parameter specification'', rather
3642 * than redundant parentheses around the omitted identifier. */
3644 /* Function declarator. */
3645 if (!env->may_be_abstract) {
3646 errorf(HERE, "function declarator must have a name");
3653 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3654 /* Paranthesized declarator. */
3656 add_anchor_token(')');
3657 inner_types = parse_inner_declarator(env);
3658 if (inner_types != NULL) {
3659 /* All later declarators only modify the return type */
3660 env->must_be_abstract = true;
3662 rem_anchor_token(')');
3663 expect(')', end_error);
3671 if (env->may_be_abstract)
3673 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3678 construct_type_t **const p = anchor;
3681 construct_type_t *type;
3682 switch (token.type) {
3684 scope_t *scope = NULL;
3685 if (!env->must_be_abstract) {
3686 scope = &env->parameters;
3689 type = parse_function_declarator(scope);
3693 type = parse_array_declarator();
3696 goto declarator_finished;
3699 /* insert in the middle of the list (at p) */
3700 type->base.next = *p;
3703 anchor = &type->base.next;
3706 declarator_finished:
3707 /* append inner_types at the end of the list, we don't to set anchor anymore
3708 * as it's not needed anymore */
3709 *anchor = inner_types;
3716 static type_t *construct_declarator_type(construct_type_t *construct_list,
3719 construct_type_t *iter = construct_list;
3720 for (; iter != NULL; iter = iter->base.next) {
3721 source_position_t const* const pos = &iter->base.pos;
3722 switch (iter->kind) {
3723 case CONSTRUCT_INVALID:
3725 case CONSTRUCT_FUNCTION: {
3726 construct_function_type_t *function = &iter->function;
3727 type_t *function_type = function->function_type;
3729 function_type->function.return_type = type;
3731 type_t *skipped_return_type = skip_typeref(type);
3733 if (is_type_function(skipped_return_type)) {
3734 errorf(pos, "function returning function is not allowed");
3735 } else if (is_type_array(skipped_return_type)) {
3736 errorf(pos, "function returning array is not allowed");
3738 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3739 warningf(pos, "type qualifiers in return type of function type are meaningless");
3743 /* The function type was constructed earlier. Freeing it here will
3744 * destroy other types. */
3745 type = typehash_insert(function_type);
3749 case CONSTRUCT_POINTER: {
3750 if (is_type_reference(skip_typeref(type)))
3751 errorf(pos, "cannot declare a pointer to reference");
3753 parsed_pointer_t *pointer = &iter->pointer;
3754 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3758 case CONSTRUCT_REFERENCE:
3759 if (is_type_reference(skip_typeref(type)))
3760 errorf(pos, "cannot declare a reference to reference");
3762 type = make_reference_type(type);
3765 case CONSTRUCT_ARRAY: {
3766 if (is_type_reference(skip_typeref(type)))
3767 errorf(pos, "cannot declare an array of references");
3769 parsed_array_t *array = &iter->array;
3770 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3772 expression_t *size_expression = array->size;
3773 if (size_expression != NULL) {
3775 = create_implicit_cast(size_expression, type_size_t);
3778 array_type->base.qualifiers = array->type_qualifiers;
3779 array_type->array.element_type = type;
3780 array_type->array.is_static = array->is_static;
3781 array_type->array.is_variable = array->is_variable;
3782 array_type->array.size_expression = size_expression;
3784 if (size_expression != NULL) {
3785 switch (is_constant_expression(size_expression)) {
3786 case EXPR_CLASS_CONSTANT: {
3787 long const size = fold_constant_to_int(size_expression);
3788 array_type->array.size = size;
3789 array_type->array.size_constant = true;
3790 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3791 * have a value greater than zero. */
3793 if (size < 0 || !GNU_MODE) {
3794 errorf(&size_expression->base.source_position,
3795 "size of array must be greater than zero");
3796 } else if (warning.other) {
3797 warningf(&size_expression->base.source_position,
3798 "zero length arrays are a GCC extension");
3804 case EXPR_CLASS_VARIABLE:
3805 array_type->array.is_vla = true;
3808 case EXPR_CLASS_ERROR:
3813 type_t *skipped_type = skip_typeref(type);
3815 if (is_type_incomplete(skipped_type)) {
3816 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3817 } else if (is_type_function(skipped_type)) {
3818 errorf(pos, "array of functions is not allowed");
3820 type = identify_new_type(array_type);
3824 internal_errorf(pos, "invalid type construction found");
3830 static type_t *automatic_type_conversion(type_t *orig_type);
3832 static type_t *semantic_parameter(const source_position_t *pos,
3834 const declaration_specifiers_t *specifiers,
3837 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3838 * shall be adjusted to ``qualified pointer to type'',
3840 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3841 * type'' shall be adjusted to ``pointer to function
3842 * returning type'', as in 6.3.2.1. */
3843 type = automatic_type_conversion(type);
3845 if (specifiers->is_inline && is_type_valid(type)) {
3846 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3849 /* §6.9.1:6 The declarations in the declaration list shall contain
3850 * no storage-class specifier other than register and no
3851 * initializations. */
3852 if (specifiers->thread_local || (
3853 specifiers->storage_class != STORAGE_CLASS_NONE &&
3854 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3856 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3859 /* delay test for incomplete type, because we might have (void)
3860 * which is legal but incomplete... */
3865 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3866 declarator_flags_t flags)
3868 parse_declarator_env_t env;
3869 memset(&env, 0, sizeof(env));
3870 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3872 construct_type_t *construct_type = parse_inner_declarator(&env);
3874 construct_declarator_type(construct_type, specifiers->type);
3875 type_t *type = skip_typeref(orig_type);
3877 if (construct_type != NULL) {
3878 obstack_free(&temp_obst, construct_type);
3881 attribute_t *attributes = parse_attributes(env.attributes);
3882 /* append (shared) specifier attribute behind attributes of this
3884 attribute_t **anchor = &attributes;
3885 while (*anchor != NULL)
3886 anchor = &(*anchor)->next;
3887 *anchor = specifiers->attributes;
3890 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3891 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3892 entity->base.namespc = NAMESPACE_NORMAL;
3893 entity->base.symbol = env.symbol;
3894 entity->base.source_position = env.source_position;
3895 entity->typedefe.type = orig_type;
3897 if (anonymous_entity != NULL) {
3898 if (is_type_compound(type)) {
3899 assert(anonymous_entity->compound.alias == NULL);
3900 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3901 anonymous_entity->kind == ENTITY_UNION);
3902 anonymous_entity->compound.alias = entity;
3903 anonymous_entity = NULL;
3904 } else if (is_type_enum(type)) {
3905 assert(anonymous_entity->enume.alias == NULL);
3906 assert(anonymous_entity->kind == ENTITY_ENUM);
3907 anonymous_entity->enume.alias = entity;
3908 anonymous_entity = NULL;
3912 /* create a declaration type entity */
3913 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3914 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3916 if (env.symbol != NULL) {
3917 if (specifiers->is_inline && is_type_valid(type)) {
3918 errorf(&env.source_position,
3919 "compound member '%Y' declared 'inline'", env.symbol);
3922 if (specifiers->thread_local ||
3923 specifiers->storage_class != STORAGE_CLASS_NONE) {
3924 errorf(&env.source_position,
3925 "compound member '%Y' must have no storage class",
3929 } else if (flags & DECL_IS_PARAMETER) {
3930 orig_type = semantic_parameter(&env.source_position, orig_type,
3931 specifiers, env.symbol);
3933 entity = allocate_entity_zero(ENTITY_PARAMETER);
3934 } else if (is_type_function(type)) {
3935 entity = allocate_entity_zero(ENTITY_FUNCTION);
3937 entity->function.is_inline = specifiers->is_inline;
3938 entity->function.elf_visibility = default_visibility;
3939 entity->function.parameters = env.parameters;
3941 if (env.symbol != NULL) {
3942 /* this needs fixes for C++ */
3943 bool in_function_scope = current_function != NULL;
3945 if (specifiers->thread_local || (
3946 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3947 specifiers->storage_class != STORAGE_CLASS_NONE &&
3948 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3950 errorf(&env.source_position,
3951 "invalid storage class for function '%Y'", env.symbol);
3955 entity = allocate_entity_zero(ENTITY_VARIABLE);
3957 entity->variable.elf_visibility = default_visibility;
3958 entity->variable.thread_local = specifiers->thread_local;
3960 if (env.symbol != NULL) {
3961 if (specifiers->is_inline && is_type_valid(type)) {
3962 errorf(&env.source_position,
3963 "variable '%Y' declared 'inline'", env.symbol);
3966 bool invalid_storage_class = false;
3967 if (current_scope == file_scope) {
3968 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3969 specifiers->storage_class != STORAGE_CLASS_NONE &&
3970 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3971 invalid_storage_class = true;
3974 if (specifiers->thread_local &&
3975 specifiers->storage_class == STORAGE_CLASS_NONE) {
3976 invalid_storage_class = true;
3979 if (invalid_storage_class) {
3980 errorf(&env.source_position,
3981 "invalid storage class for variable '%Y'", env.symbol);
3986 if (env.symbol != NULL) {
3987 entity->base.symbol = env.symbol;
3988 entity->base.source_position = env.source_position;
3990 entity->base.source_position = specifiers->source_position;
3992 entity->base.namespc = NAMESPACE_NORMAL;
3993 entity->declaration.type = orig_type;
3994 entity->declaration.alignment = get_type_alignment(orig_type);
3995 entity->declaration.modifiers = env.modifiers;
3996 entity->declaration.attributes = attributes;
3998 storage_class_t storage_class = specifiers->storage_class;
3999 entity->declaration.declared_storage_class = storage_class;
4001 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
4002 storage_class = STORAGE_CLASS_AUTO;
4003 entity->declaration.storage_class = storage_class;
4006 if (attributes != NULL) {
4007 handle_entity_attributes(attributes, entity);
4013 static type_t *parse_abstract_declarator(type_t *base_type)
4015 parse_declarator_env_t env;
4016 memset(&env, 0, sizeof(env));
4017 env.may_be_abstract = true;
4018 env.must_be_abstract = true;
4020 construct_type_t *construct_type = parse_inner_declarator(&env);
4022 type_t *result = construct_declarator_type(construct_type, base_type);
4023 if (construct_type != NULL) {
4024 obstack_free(&temp_obst, construct_type);
4026 result = handle_type_attributes(env.attributes, result);
4032 * Check if the declaration of main is suspicious. main should be a
4033 * function with external linkage, returning int, taking either zero
4034 * arguments, two, or three arguments of appropriate types, ie.
4036 * int main([ int argc, char **argv [, char **env ] ]).
4038 * @param decl the declaration to check
4039 * @param type the function type of the declaration
4041 static void check_main(const entity_t *entity)
4043 const source_position_t *pos = &entity->base.source_position;
4044 if (entity->kind != ENTITY_FUNCTION) {
4045 warningf(pos, "'main' is not a function");
4049 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4050 warningf(pos, "'main' is normally a non-static function");
4053 type_t *type = skip_typeref(entity->declaration.type);
4054 assert(is_type_function(type));
4056 function_type_t *func_type = &type->function;
4057 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4058 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4059 func_type->return_type);
4061 const function_parameter_t *parm = func_type->parameters;
4063 type_t *const first_type = skip_typeref(parm->type);
4064 type_t *const first_type_unqual = get_unqualified_type(first_type);
4065 if (!types_compatible(first_type_unqual, type_int)) {
4067 "first argument of 'main' should be 'int', but is '%T'",
4072 type_t *const second_type = skip_typeref(parm->type);
4073 type_t *const second_type_unqual
4074 = get_unqualified_type(second_type);
4075 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
4076 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'",
4081 type_t *const third_type = skip_typeref(parm->type);
4082 type_t *const third_type_unqual
4083 = get_unqualified_type(third_type);
4084 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
4085 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'",
4090 goto warn_arg_count;
4094 warningf(pos, "'main' takes only zero, two or three arguments");
4100 * Check if a symbol is the equal to "main".
4102 static bool is_sym_main(const symbol_t *const sym)
4104 return strcmp(sym->string, "main") == 0;
4107 static void error_redefined_as_different_kind(const source_position_t *pos,
4108 const entity_t *old, entity_kind_t new_kind)
4110 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4111 get_entity_kind_name(old->kind), old->base.symbol,
4112 get_entity_kind_name(new_kind), &old->base.source_position);
4115 static bool is_entity_valid(entity_t *const ent)
4117 if (is_declaration(ent)) {
4118 return is_type_valid(skip_typeref(ent->declaration.type));
4119 } else if (ent->kind == ENTITY_TYPEDEF) {
4120 return is_type_valid(skip_typeref(ent->typedefe.type));
4125 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4127 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4128 if (attributes_equal(tattr, attr))
4135 * test wether new_list contains any attributes not included in old_list
4137 static bool has_new_attributes(const attribute_t *old_list,
4138 const attribute_t *new_list)
4140 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4141 if (!contains_attribute(old_list, attr))
4148 * Merge in attributes from an attribute list (probably from a previous
4149 * declaration with the same name). Warning: destroys the old structure
4150 * of the attribute list - don't reuse attributes after this call.
4152 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4155 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4157 if (contains_attribute(decl->attributes, attr))
4160 /* move attribute to new declarations attributes list */
4161 attr->next = decl->attributes;
4162 decl->attributes = attr;
4167 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4168 * for various problems that occur for multiple definitions
4170 entity_t *record_entity(entity_t *entity, const bool is_definition)
4172 const symbol_t *const symbol = entity->base.symbol;
4173 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4174 const source_position_t *pos = &entity->base.source_position;
4176 /* can happen in error cases */
4180 entity_t *const previous_entity = get_entity(symbol, namespc);
4181 /* pushing the same entity twice will break the stack structure */
4182 assert(previous_entity != entity);
4184 if (entity->kind == ENTITY_FUNCTION) {
4185 type_t *const orig_type = entity->declaration.type;
4186 type_t *const type = skip_typeref(orig_type);
4188 assert(is_type_function(type));
4189 if (type->function.unspecified_parameters &&
4190 warning.strict_prototypes &&
4191 previous_entity == NULL) {
4192 warningf(pos, "function declaration '%#T' is not a prototype",
4196 if (warning.main && current_scope == file_scope
4197 && is_sym_main(symbol)) {
4202 if (is_declaration(entity) &&
4203 warning.nested_externs &&
4204 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4205 current_scope != file_scope) {
4206 warningf(pos, "nested extern declaration of '%#T'",
4207 entity->declaration.type, symbol);
4210 if (previous_entity != NULL) {
4211 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4212 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4213 assert(previous_entity->kind == ENTITY_PARAMETER);
4215 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4216 entity->declaration.type, symbol,
4217 previous_entity->declaration.type, symbol,
4218 &previous_entity->base.source_position);
4222 if (previous_entity->base.parent_scope == current_scope) {
4223 if (previous_entity->kind != entity->kind) {
4224 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4225 error_redefined_as_different_kind(pos, previous_entity,
4230 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4231 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4232 symbol, &previous_entity->base.source_position);
4235 if (previous_entity->kind == ENTITY_TYPEDEF) {
4236 /* TODO: C++ allows this for exactly the same type */
4237 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4238 symbol, &previous_entity->base.source_position);
4242 /* at this point we should have only VARIABLES or FUNCTIONS */
4243 assert(is_declaration(previous_entity) && is_declaration(entity));
4245 declaration_t *const prev_decl = &previous_entity->declaration;
4246 declaration_t *const decl = &entity->declaration;
4248 /* can happen for K&R style declarations */
4249 if (prev_decl->type == NULL &&
4250 previous_entity->kind == ENTITY_PARAMETER &&
4251 entity->kind == ENTITY_PARAMETER) {
4252 prev_decl->type = decl->type;
4253 prev_decl->storage_class = decl->storage_class;
4254 prev_decl->declared_storage_class = decl->declared_storage_class;
4255 prev_decl->modifiers = decl->modifiers;
4256 return previous_entity;
4259 type_t *const orig_type = decl->type;
4260 assert(orig_type != NULL);
4261 type_t *const type = skip_typeref(orig_type);
4262 type_t *const prev_type = skip_typeref(prev_decl->type);
4264 if (!types_compatible(type, prev_type)) {
4266 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4267 orig_type, symbol, prev_decl->type, symbol,
4268 &previous_entity->base.source_position);
4270 unsigned old_storage_class = prev_decl->storage_class;
4272 if (warning.redundant_decls &&
4275 !(prev_decl->modifiers & DM_USED) &&
4276 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4277 warningf(&previous_entity->base.source_position,
4278 "unnecessary static forward declaration for '%#T'",
4279 prev_decl->type, symbol);
4282 storage_class_t new_storage_class = decl->storage_class;
4284 /* pretend no storage class means extern for function
4285 * declarations (except if the previous declaration is neither
4286 * none nor extern) */
4287 if (entity->kind == ENTITY_FUNCTION) {
4288 /* the previous declaration could have unspecified parameters or
4289 * be a typedef, so use the new type */
4290 if (prev_type->function.unspecified_parameters || is_definition)
4291 prev_decl->type = type;
4293 switch (old_storage_class) {
4294 case STORAGE_CLASS_NONE:
4295 old_storage_class = STORAGE_CLASS_EXTERN;
4298 case STORAGE_CLASS_EXTERN:
4299 if (is_definition) {
4300 if (warning.missing_prototypes &&
4301 prev_type->function.unspecified_parameters &&
4302 !is_sym_main(symbol)) {
4303 warningf(pos, "no previous prototype for '%#T'",
4306 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4307 new_storage_class = STORAGE_CLASS_EXTERN;
4314 } else if (is_type_incomplete(prev_type)) {
4315 prev_decl->type = type;
4318 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4319 new_storage_class == STORAGE_CLASS_EXTERN) {
4321 warn_redundant_declaration: ;
4323 = has_new_attributes(prev_decl->attributes,
4325 if (has_new_attrs) {
4326 merge_in_attributes(decl, prev_decl->attributes);
4327 } else if (!is_definition &&
4328 warning.redundant_decls &&
4329 is_type_valid(prev_type) &&
4330 strcmp(previous_entity->base.source_position.input_name,
4331 "<builtin>") != 0) {
4333 "redundant declaration for '%Y' (declared %P)",
4334 symbol, &previous_entity->base.source_position);
4336 } else if (current_function == NULL) {
4337 if (old_storage_class != STORAGE_CLASS_STATIC &&
4338 new_storage_class == STORAGE_CLASS_STATIC) {
4340 "static declaration of '%Y' follows non-static declaration (declared %P)",
4341 symbol, &previous_entity->base.source_position);
4342 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4343 prev_decl->storage_class = STORAGE_CLASS_NONE;
4344 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4346 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4348 goto error_redeclaration;
4349 goto warn_redundant_declaration;
4351 } else if (is_type_valid(prev_type)) {
4352 if (old_storage_class == new_storage_class) {
4353 error_redeclaration:
4354 errorf(pos, "redeclaration of '%Y' (declared %P)",
4355 symbol, &previous_entity->base.source_position);
4358 "redeclaration of '%Y' with different linkage (declared %P)",
4359 symbol, &previous_entity->base.source_position);
4364 prev_decl->modifiers |= decl->modifiers;
4365 if (entity->kind == ENTITY_FUNCTION) {
4366 previous_entity->function.is_inline |= entity->function.is_inline;
4368 return previous_entity;
4371 if (warning.shadow ||
4372 (warning.shadow_local && previous_entity->base.parent_scope != file_scope)) {
4373 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4374 get_entity_kind_name(entity->kind), symbol,
4375 get_entity_kind_name(previous_entity->kind),
4376 &previous_entity->base.source_position);
4380 if (entity->kind == ENTITY_FUNCTION) {
4381 if (is_definition &&
4382 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4383 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4384 warningf(pos, "no previous prototype for '%#T'",
4385 entity->declaration.type, symbol);
4386 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4387 warningf(pos, "no previous declaration for '%#T'",
4388 entity->declaration.type, symbol);
4391 } else if (warning.missing_declarations &&
4392 entity->kind == ENTITY_VARIABLE &&
4393 current_scope == file_scope) {
4394 declaration_t *declaration = &entity->declaration;
4395 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4396 warningf(pos, "no previous declaration for '%#T'",
4397 declaration->type, symbol);
4402 assert(entity->base.parent_scope == NULL);
4403 assert(current_scope != NULL);
4405 entity->base.parent_scope = current_scope;
4406 entity->base.namespc = NAMESPACE_NORMAL;
4407 environment_push(entity);
4408 append_entity(current_scope, entity);
4413 static void parser_error_multiple_definition(entity_t *entity,
4414 const source_position_t *source_position)
4416 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4417 entity->base.symbol, &entity->base.source_position);
4420 static bool is_declaration_specifier(const token_t *token,
4421 bool only_specifiers_qualifiers)
4423 switch (token->type) {
4428 return is_typedef_symbol(token->symbol);
4430 case T___extension__:
4432 return !only_specifiers_qualifiers;
4439 static void parse_init_declarator_rest(entity_t *entity)
4441 type_t *orig_type = type_error_type;
4443 if (entity->base.kind == ENTITY_TYPEDEF) {
4444 errorf(&entity->base.source_position,
4445 "typedef '%Y' is initialized (use __typeof__ instead)",
4446 entity->base.symbol);
4448 assert(is_declaration(entity));
4449 orig_type = entity->declaration.type;
4453 type_t *type = skip_typeref(orig_type);
4455 if (entity->kind == ENTITY_VARIABLE
4456 && entity->variable.initializer != NULL) {
4457 parser_error_multiple_definition(entity, HERE);
4460 declaration_t *const declaration = &entity->declaration;
4461 bool must_be_constant = false;
4462 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4463 entity->base.parent_scope == file_scope) {
4464 must_be_constant = true;
4467 if (is_type_function(type)) {
4468 errorf(&entity->base.source_position,
4469 "function '%#T' is initialized like a variable",
4470 orig_type, entity->base.symbol);
4471 orig_type = type_error_type;
4474 parse_initializer_env_t env;
4475 env.type = orig_type;
4476 env.must_be_constant = must_be_constant;
4477 env.entity = entity;
4478 current_init_decl = entity;
4480 initializer_t *initializer = parse_initializer(&env);
4481 current_init_decl = NULL;
4483 if (entity->kind == ENTITY_VARIABLE) {
4484 /* §6.7.5:22 array initializers for arrays with unknown size
4485 * determine the array type size */
4486 declaration->type = env.type;
4487 entity->variable.initializer = initializer;
4491 /* parse rest of a declaration without any declarator */
4492 static void parse_anonymous_declaration_rest(
4493 const declaration_specifiers_t *specifiers)
4496 anonymous_entity = NULL;
4498 if (warning.other) {
4499 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4500 specifiers->thread_local) {
4501 warningf(&specifiers->source_position,
4502 "useless storage class in empty declaration");
4505 type_t *type = specifiers->type;
4506 switch (type->kind) {
4507 case TYPE_COMPOUND_STRUCT:
4508 case TYPE_COMPOUND_UNION: {
4509 if (type->compound.compound->base.symbol == NULL) {
4510 warningf(&specifiers->source_position,
4511 "unnamed struct/union that defines no instances");
4520 warningf(&specifiers->source_position, "empty declaration");
4526 static void check_variable_type_complete(entity_t *ent)
4528 if (ent->kind != ENTITY_VARIABLE)
4531 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4532 * type for the object shall be complete [...] */
4533 declaration_t *decl = &ent->declaration;
4534 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4535 decl->storage_class == STORAGE_CLASS_STATIC)
4538 type_t *const orig_type = decl->type;
4539 type_t *const type = skip_typeref(orig_type);
4540 if (!is_type_incomplete(type))
4543 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4544 * are given length one. */
4545 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4546 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4550 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4551 orig_type, ent->base.symbol);
4555 static void parse_declaration_rest(entity_t *ndeclaration,
4556 const declaration_specifiers_t *specifiers,
4557 parsed_declaration_func finished_declaration,
4558 declarator_flags_t flags)
4560 add_anchor_token(';');
4561 add_anchor_token(',');
4563 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4565 if (token.type == '=') {
4566 parse_init_declarator_rest(entity);
4567 } else if (entity->kind == ENTITY_VARIABLE) {
4568 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4569 * [...] where the extern specifier is explicitly used. */
4570 declaration_t *decl = &entity->declaration;
4571 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4572 type_t *type = decl->type;
4573 if (is_type_reference(skip_typeref(type))) {
4574 errorf(&entity->base.source_position,
4575 "reference '%#T' must be initialized",
4576 type, entity->base.symbol);
4581 check_variable_type_complete(entity);
4586 add_anchor_token('=');
4587 ndeclaration = parse_declarator(specifiers, flags);
4588 rem_anchor_token('=');
4590 expect(';', end_error);
4593 anonymous_entity = NULL;
4594 rem_anchor_token(';');
4595 rem_anchor_token(',');
4598 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4600 symbol_t *symbol = entity->base.symbol;
4601 if (symbol == NULL) {
4602 errorf(HERE, "anonymous declaration not valid as function parameter");
4606 assert(entity->base.namespc == NAMESPACE_NORMAL);
4607 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4608 if (previous_entity == NULL
4609 || previous_entity->base.parent_scope != current_scope) {
4610 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4615 if (is_definition) {
4616 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4619 return record_entity(entity, false);
4622 static void parse_declaration(parsed_declaration_func finished_declaration,
4623 declarator_flags_t flags)
4625 add_anchor_token(';');
4626 declaration_specifiers_t specifiers;
4627 parse_declaration_specifiers(&specifiers);
4628 rem_anchor_token(';');
4630 if (token.type == ';') {
4631 parse_anonymous_declaration_rest(&specifiers);
4633 entity_t *entity = parse_declarator(&specifiers, flags);
4634 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4639 static type_t *get_default_promoted_type(type_t *orig_type)
4641 type_t *result = orig_type;
4643 type_t *type = skip_typeref(orig_type);
4644 if (is_type_integer(type)) {
4645 result = promote_integer(type);
4646 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4647 result = type_double;
4653 static void parse_kr_declaration_list(entity_t *entity)
4655 if (entity->kind != ENTITY_FUNCTION)
4658 type_t *type = skip_typeref(entity->declaration.type);
4659 assert(is_type_function(type));
4660 if (!type->function.kr_style_parameters)
4663 add_anchor_token('{');
4665 /* push function parameters */
4666 size_t const top = environment_top();
4667 scope_t *old_scope = scope_push(&entity->function.parameters);
4669 entity_t *parameter = entity->function.parameters.entities;
4670 for ( ; parameter != NULL; parameter = parameter->base.next) {
4671 assert(parameter->base.parent_scope == NULL);
4672 parameter->base.parent_scope = current_scope;
4673 environment_push(parameter);
4676 /* parse declaration list */
4678 switch (token.type) {
4680 case T___extension__:
4681 /* This covers symbols, which are no type, too, and results in
4682 * better error messages. The typical cases are misspelled type
4683 * names and missing includes. */
4685 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4693 /* pop function parameters */
4694 assert(current_scope == &entity->function.parameters);
4695 scope_pop(old_scope);
4696 environment_pop_to(top);
4698 /* update function type */
4699 type_t *new_type = duplicate_type(type);
4701 function_parameter_t *parameters = NULL;
4702 function_parameter_t **anchor = ¶meters;
4704 /* did we have an earlier prototype? */
4705 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4706 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4709 function_parameter_t *proto_parameter = NULL;
4710 if (proto_type != NULL) {
4711 type_t *proto_type_type = proto_type->declaration.type;
4712 proto_parameter = proto_type_type->function.parameters;
4713 /* If a K&R function definition has a variadic prototype earlier, then
4714 * make the function definition variadic, too. This should conform to
4715 * §6.7.5.3:15 and §6.9.1:8. */
4716 new_type->function.variadic = proto_type_type->function.variadic;
4718 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4720 new_type->function.unspecified_parameters = true;
4723 bool need_incompatible_warning = false;
4724 parameter = entity->function.parameters.entities;
4725 for (; parameter != NULL; parameter = parameter->base.next,
4727 proto_parameter == NULL ? NULL : proto_parameter->next) {
4728 if (parameter->kind != ENTITY_PARAMETER)
4731 type_t *parameter_type = parameter->declaration.type;
4732 if (parameter_type == NULL) {
4734 errorf(HERE, "no type specified for function parameter '%Y'",
4735 parameter->base.symbol);
4736 parameter_type = type_error_type;
4738 if (warning.implicit_int) {
4739 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4740 parameter->base.symbol);
4742 parameter_type = type_int;
4744 parameter->declaration.type = parameter_type;
4747 semantic_parameter_incomplete(parameter);
4749 /* we need the default promoted types for the function type */
4750 type_t *not_promoted = parameter_type;
4751 parameter_type = get_default_promoted_type(parameter_type);
4753 /* gcc special: if the type of the prototype matches the unpromoted
4754 * type don't promote */
4755 if (!strict_mode && proto_parameter != NULL) {
4756 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4757 type_t *promo_skip = skip_typeref(parameter_type);
4758 type_t *param_skip = skip_typeref(not_promoted);
4759 if (!types_compatible(proto_p_type, promo_skip)
4760 && types_compatible(proto_p_type, param_skip)) {
4762 need_incompatible_warning = true;
4763 parameter_type = not_promoted;
4766 function_parameter_t *const parameter
4767 = allocate_parameter(parameter_type);
4769 *anchor = parameter;
4770 anchor = ¶meter->next;
4773 new_type->function.parameters = parameters;
4774 new_type = identify_new_type(new_type);
4776 if (warning.other && need_incompatible_warning) {
4777 type_t *proto_type_type = proto_type->declaration.type;
4779 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4780 proto_type_type, proto_type->base.symbol,
4781 new_type, entity->base.symbol,
4782 &proto_type->base.source_position);
4785 entity->declaration.type = new_type;
4787 rem_anchor_token('{');
4790 static bool first_err = true;
4793 * When called with first_err set, prints the name of the current function,
4796 static void print_in_function(void)
4800 diagnosticf("%s: In function '%Y':\n",
4801 current_function->base.base.source_position.input_name,
4802 current_function->base.base.symbol);
4807 * Check if all labels are defined in the current function.
4808 * Check if all labels are used in the current function.
4810 static void check_labels(void)
4812 for (const goto_statement_t *goto_statement = goto_first;
4813 goto_statement != NULL;
4814 goto_statement = goto_statement->next) {
4815 /* skip computed gotos */
4816 if (goto_statement->expression != NULL)
4819 label_t *label = goto_statement->label;
4822 if (label->base.source_position.input_name == NULL) {
4823 print_in_function();
4824 errorf(&goto_statement->base.source_position,
4825 "label '%Y' used but not defined", label->base.symbol);
4829 if (warning.unused_label) {
4830 for (const label_statement_t *label_statement = label_first;
4831 label_statement != NULL;
4832 label_statement = label_statement->next) {
4833 label_t *label = label_statement->label;
4835 if (! label->used) {
4836 print_in_function();
4837 warningf(&label_statement->base.source_position,
4838 "label '%Y' defined but not used", label->base.symbol);
4844 static void warn_unused_entity(entity_t *entity, entity_t *last)
4846 entity_t const *const end = last != NULL ? last->base.next : NULL;
4847 for (; entity != end; entity = entity->base.next) {
4848 if (!is_declaration(entity))
4851 declaration_t *declaration = &entity->declaration;
4852 if (declaration->implicit)
4855 if (!declaration->used) {
4856 print_in_function();
4857 const char *what = get_entity_kind_name(entity->kind);
4858 warningf(&entity->base.source_position, "%s '%Y' is unused",
4859 what, entity->base.symbol);
4860 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4861 print_in_function();
4862 const char *what = get_entity_kind_name(entity->kind);
4863 warningf(&entity->base.source_position, "%s '%Y' is never read",
4864 what, entity->base.symbol);
4869 static void check_unused_variables(statement_t *const stmt, void *const env)
4873 switch (stmt->kind) {
4874 case STATEMENT_DECLARATION: {
4875 declaration_statement_t const *const decls = &stmt->declaration;
4876 warn_unused_entity(decls->declarations_begin,
4877 decls->declarations_end);
4882 warn_unused_entity(stmt->fors.scope.entities, NULL);
4891 * Check declarations of current_function for unused entities.
4893 static void check_declarations(void)
4895 if (warning.unused_parameter) {
4896 const scope_t *scope = ¤t_function->parameters;
4898 /* do not issue unused warnings for main */
4899 if (!is_sym_main(current_function->base.base.symbol)) {
4900 warn_unused_entity(scope->entities, NULL);
4903 if (warning.unused_variable) {
4904 walk_statements(current_function->statement, check_unused_variables,
4909 static int determine_truth(expression_t const* const cond)
4912 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4913 fold_constant_to_bool(cond) ? 1 :
4917 static void check_reachable(statement_t *);
4918 static bool reaches_end;
4920 static bool expression_returns(expression_t const *const expr)
4922 switch (expr->kind) {
4924 expression_t const *const func = expr->call.function;
4925 if (func->kind == EXPR_REFERENCE) {
4926 entity_t *entity = func->reference.entity;
4927 if (entity->kind == ENTITY_FUNCTION
4928 && entity->declaration.modifiers & DM_NORETURN)
4932 if (!expression_returns(func))
4935 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4936 if (!expression_returns(arg->expression))
4943 case EXPR_REFERENCE:
4944 case EXPR_REFERENCE_ENUM_VALUE:
4946 case EXPR_STRING_LITERAL:
4947 case EXPR_WIDE_STRING_LITERAL:
4948 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4949 case EXPR_LABEL_ADDRESS:
4950 case EXPR_CLASSIFY_TYPE:
4951 case EXPR_SIZEOF: // TODO handle obscure VLA case
4954 case EXPR_BUILTIN_CONSTANT_P:
4955 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4960 case EXPR_STATEMENT: {
4961 bool old_reaches_end = reaches_end;
4962 reaches_end = false;
4963 check_reachable(expr->statement.statement);
4964 bool returns = reaches_end;
4965 reaches_end = old_reaches_end;
4969 case EXPR_CONDITIONAL:
4970 // TODO handle constant expression
4972 if (!expression_returns(expr->conditional.condition))
4975 if (expr->conditional.true_expression != NULL
4976 && expression_returns(expr->conditional.true_expression))
4979 return expression_returns(expr->conditional.false_expression);
4982 return expression_returns(expr->select.compound);
4984 case EXPR_ARRAY_ACCESS:
4986 expression_returns(expr->array_access.array_ref) &&
4987 expression_returns(expr->array_access.index);
4990 return expression_returns(expr->va_starte.ap);
4993 return expression_returns(expr->va_arge.ap);
4996 return expression_returns(expr->va_copye.src);
4998 EXPR_UNARY_CASES_MANDATORY
4999 return expression_returns(expr->unary.value);
5001 case EXPR_UNARY_THROW:
5005 // TODO handle constant lhs of && and ||
5007 expression_returns(expr->binary.left) &&
5008 expression_returns(expr->binary.right);
5014 panic("unhandled expression");
5017 static bool initializer_returns(initializer_t const *const init)
5019 switch (init->kind) {
5020 case INITIALIZER_VALUE:
5021 return expression_returns(init->value.value);
5023 case INITIALIZER_LIST: {
5024 initializer_t * const* i = init->list.initializers;
5025 initializer_t * const* const end = i + init->list.len;
5026 bool returns = true;
5027 for (; i != end; ++i) {
5028 if (!initializer_returns(*i))
5034 case INITIALIZER_STRING:
5035 case INITIALIZER_WIDE_STRING:
5036 case INITIALIZER_DESIGNATOR: // designators have no payload
5039 panic("unhandled initializer");
5042 static bool noreturn_candidate;
5044 static void check_reachable(statement_t *const stmt)
5046 if (stmt->base.reachable)
5048 if (stmt->kind != STATEMENT_DO_WHILE)
5049 stmt->base.reachable = true;
5051 statement_t *last = stmt;
5053 switch (stmt->kind) {
5054 case STATEMENT_INVALID:
5055 case STATEMENT_EMPTY:
5057 next = stmt->base.next;
5060 case STATEMENT_DECLARATION: {
5061 declaration_statement_t const *const decl = &stmt->declaration;
5062 entity_t const * ent = decl->declarations_begin;
5063 entity_t const *const last = decl->declarations_end;
5065 for (;; ent = ent->base.next) {
5066 if (ent->kind == ENTITY_VARIABLE &&
5067 ent->variable.initializer != NULL &&
5068 !initializer_returns(ent->variable.initializer)) {
5075 next = stmt->base.next;
5079 case STATEMENT_COMPOUND:
5080 next = stmt->compound.statements;
5082 next = stmt->base.next;
5085 case STATEMENT_RETURN: {
5086 expression_t const *const val = stmt->returns.value;
5087 if (val == NULL || expression_returns(val))
5088 noreturn_candidate = false;
5092 case STATEMENT_IF: {
5093 if_statement_t const *const ifs = &stmt->ifs;
5094 expression_t const *const cond = ifs->condition;
5096 if (!expression_returns(cond))
5099 int const val = determine_truth(cond);
5102 check_reachable(ifs->true_statement);
5107 if (ifs->false_statement != NULL) {
5108 check_reachable(ifs->false_statement);
5112 next = stmt->base.next;
5116 case STATEMENT_SWITCH: {
5117 switch_statement_t const *const switchs = &stmt->switchs;
5118 expression_t const *const expr = switchs->expression;
5120 if (!expression_returns(expr))
5123 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
5124 long const val = fold_constant_to_int(expr);
5125 case_label_statement_t * defaults = NULL;
5126 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5127 if (i->expression == NULL) {
5132 if (i->first_case <= val && val <= i->last_case) {
5133 check_reachable((statement_t*)i);
5138 if (defaults != NULL) {
5139 check_reachable((statement_t*)defaults);
5143 bool has_default = false;
5144 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5145 if (i->expression == NULL)
5148 check_reachable((statement_t*)i);
5155 next = stmt->base.next;
5159 case STATEMENT_EXPRESSION: {
5160 /* Check for noreturn function call */
5161 expression_t const *const expr = stmt->expression.expression;
5162 if (!expression_returns(expr))
5165 next = stmt->base.next;
5169 case STATEMENT_CONTINUE:
5170 for (statement_t *parent = stmt;;) {
5171 parent = parent->base.parent;
5172 if (parent == NULL) /* continue not within loop */
5176 switch (parent->kind) {
5177 case STATEMENT_WHILE: goto continue_while;
5178 case STATEMENT_DO_WHILE: goto continue_do_while;
5179 case STATEMENT_FOR: goto continue_for;
5185 case STATEMENT_BREAK:
5186 for (statement_t *parent = stmt;;) {
5187 parent = parent->base.parent;
5188 if (parent == NULL) /* break not within loop/switch */
5191 switch (parent->kind) {
5192 case STATEMENT_SWITCH:
5193 case STATEMENT_WHILE:
5194 case STATEMENT_DO_WHILE:
5197 next = parent->base.next;
5198 goto found_break_parent;
5206 case STATEMENT_GOTO:
5207 if (stmt->gotos.expression) {
5208 if (!expression_returns(stmt->gotos.expression))
5211 statement_t *parent = stmt->base.parent;
5212 if (parent == NULL) /* top level goto */
5216 next = stmt->gotos.label->statement;
5217 if (next == NULL) /* missing label */
5222 case STATEMENT_LABEL:
5223 next = stmt->label.statement;
5226 case STATEMENT_CASE_LABEL:
5227 next = stmt->case_label.statement;
5230 case STATEMENT_WHILE: {
5231 while_statement_t const *const whiles = &stmt->whiles;
5232 expression_t const *const cond = whiles->condition;
5234 if (!expression_returns(cond))
5237 int const val = determine_truth(cond);
5240 check_reachable(whiles->body);
5245 next = stmt->base.next;
5249 case STATEMENT_DO_WHILE:
5250 next = stmt->do_while.body;
5253 case STATEMENT_FOR: {
5254 for_statement_t *const fors = &stmt->fors;
5256 if (fors->condition_reachable)
5258 fors->condition_reachable = true;
5260 expression_t const *const cond = fors->condition;
5265 } else if (expression_returns(cond)) {
5266 val = determine_truth(cond);
5272 check_reachable(fors->body);
5277 next = stmt->base.next;
5281 case STATEMENT_MS_TRY: {
5282 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5283 check_reachable(ms_try->try_statement);
5284 next = ms_try->final_statement;
5288 case STATEMENT_LEAVE: {
5289 statement_t *parent = stmt;
5291 parent = parent->base.parent;
5292 if (parent == NULL) /* __leave not within __try */
5295 if (parent->kind == STATEMENT_MS_TRY) {
5297 next = parent->ms_try.final_statement;
5305 panic("invalid statement kind");
5308 while (next == NULL) {
5309 next = last->base.parent;
5311 noreturn_candidate = false;
5313 type_t *const type = skip_typeref(current_function->base.type);
5314 assert(is_type_function(type));
5315 type_t *const ret = skip_typeref(type->function.return_type);
5316 if (warning.return_type &&
5317 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5318 is_type_valid(ret) &&
5319 !is_sym_main(current_function->base.base.symbol)) {
5320 warningf(&stmt->base.source_position,
5321 "control reaches end of non-void function");
5326 switch (next->kind) {
5327 case STATEMENT_INVALID:
5328 case STATEMENT_EMPTY:
5329 case STATEMENT_DECLARATION:
5330 case STATEMENT_EXPRESSION:
5332 case STATEMENT_RETURN:
5333 case STATEMENT_CONTINUE:
5334 case STATEMENT_BREAK:
5335 case STATEMENT_GOTO:
5336 case STATEMENT_LEAVE:
5337 panic("invalid control flow in function");
5339 case STATEMENT_COMPOUND:
5340 if (next->compound.stmt_expr) {
5346 case STATEMENT_SWITCH:
5347 case STATEMENT_LABEL:
5348 case STATEMENT_CASE_LABEL:
5350 next = next->base.next;
5353 case STATEMENT_WHILE: {
5355 if (next->base.reachable)
5357 next->base.reachable = true;
5359 while_statement_t const *const whiles = &next->whiles;
5360 expression_t const *const cond = whiles->condition;
5362 if (!expression_returns(cond))
5365 int const val = determine_truth(cond);
5368 check_reachable(whiles->body);
5374 next = next->base.next;
5378 case STATEMENT_DO_WHILE: {
5380 if (next->base.reachable)
5382 next->base.reachable = true;
5384 do_while_statement_t const *const dw = &next->do_while;
5385 expression_t const *const cond = dw->condition;
5387 if (!expression_returns(cond))
5390 int const val = determine_truth(cond);
5393 check_reachable(dw->body);
5399 next = next->base.next;
5403 case STATEMENT_FOR: {
5405 for_statement_t *const fors = &next->fors;
5407 fors->step_reachable = true;
5409 if (fors->condition_reachable)
5411 fors->condition_reachable = true;
5413 expression_t const *const cond = fors->condition;
5418 } else if (expression_returns(cond)) {
5419 val = determine_truth(cond);
5425 check_reachable(fors->body);
5431 next = next->base.next;
5435 case STATEMENT_MS_TRY:
5437 next = next->ms_try.final_statement;
5442 check_reachable(next);
5445 static void check_unreachable(statement_t* const stmt, void *const env)
5449 switch (stmt->kind) {
5450 case STATEMENT_DO_WHILE:
5451 if (!stmt->base.reachable) {
5452 expression_t const *const cond = stmt->do_while.condition;
5453 if (determine_truth(cond) >= 0) {
5454 warningf(&cond->base.source_position,
5455 "condition of do-while-loop is unreachable");
5460 case STATEMENT_FOR: {
5461 for_statement_t const* const fors = &stmt->fors;
5463 // if init and step are unreachable, cond is unreachable, too
5464 if (!stmt->base.reachable && !fors->step_reachable) {
5465 warningf(&stmt->base.source_position, "statement is unreachable");
5467 if (!stmt->base.reachable && fors->initialisation != NULL) {
5468 warningf(&fors->initialisation->base.source_position,
5469 "initialisation of for-statement is unreachable");
5472 if (!fors->condition_reachable && fors->condition != NULL) {
5473 warningf(&fors->condition->base.source_position,
5474 "condition of for-statement is unreachable");
5477 if (!fors->step_reachable && fors->step != NULL) {
5478 warningf(&fors->step->base.source_position,
5479 "step of for-statement is unreachable");
5485 case STATEMENT_COMPOUND:
5486 if (stmt->compound.statements != NULL)
5488 goto warn_unreachable;
5490 case STATEMENT_DECLARATION: {
5491 /* Only warn if there is at least one declarator with an initializer.
5492 * This typically occurs in switch statements. */
5493 declaration_statement_t const *const decl = &stmt->declaration;
5494 entity_t const * ent = decl->declarations_begin;
5495 entity_t const *const last = decl->declarations_end;
5497 for (;; ent = ent->base.next) {
5498 if (ent->kind == ENTITY_VARIABLE &&
5499 ent->variable.initializer != NULL) {
5500 goto warn_unreachable;
5510 if (!stmt->base.reachable)
5511 warningf(&stmt->base.source_position, "statement is unreachable");
5516 static void parse_external_declaration(void)
5518 /* function-definitions and declarations both start with declaration
5520 add_anchor_token(';');
5521 declaration_specifiers_t specifiers;
5522 parse_declaration_specifiers(&specifiers);
5523 rem_anchor_token(';');
5525 /* must be a declaration */
5526 if (token.type == ';') {
5527 parse_anonymous_declaration_rest(&specifiers);
5531 add_anchor_token(',');
5532 add_anchor_token('=');
5533 add_anchor_token(';');
5534 add_anchor_token('{');
5536 /* declarator is common to both function-definitions and declarations */
5537 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5539 rem_anchor_token('{');
5540 rem_anchor_token(';');
5541 rem_anchor_token('=');
5542 rem_anchor_token(',');
5544 /* must be a declaration */
5545 switch (token.type) {
5549 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5554 /* must be a function definition */
5555 parse_kr_declaration_list(ndeclaration);
5557 if (token.type != '{') {
5558 parse_error_expected("while parsing function definition", '{', NULL);
5559 eat_until_matching_token(';');
5563 assert(is_declaration(ndeclaration));
5564 type_t *const orig_type = ndeclaration->declaration.type;
5565 type_t * type = skip_typeref(orig_type);
5567 if (!is_type_function(type)) {
5568 if (is_type_valid(type)) {
5569 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5570 type, ndeclaration->base.symbol);
5574 } else if (is_typeref(orig_type)) {
5576 errorf(&ndeclaration->base.source_position,
5577 "type of function definition '%#T' is a typedef",
5578 orig_type, ndeclaration->base.symbol);
5581 if (warning.aggregate_return &&
5582 is_type_compound(skip_typeref(type->function.return_type))) {
5583 warningf(&ndeclaration->base.source_position, "function '%Y' returns an aggregate",
5584 ndeclaration->base.symbol);
5586 if (warning.traditional && !type->function.unspecified_parameters) {
5587 warningf(&ndeclaration->base.source_position, "traditional C rejects ISO C style function definition of function '%Y'",
5588 ndeclaration->base.symbol);
5590 if (warning.old_style_definition && type->function.unspecified_parameters) {
5591 warningf(&ndeclaration->base.source_position, "old-style function definition '%Y'",
5592 ndeclaration->base.symbol);
5595 /* §6.7.5.3:14 a function definition with () means no
5596 * parameters (and not unspecified parameters) */
5597 if (type->function.unspecified_parameters &&
5598 type->function.parameters == NULL) {
5599 type_t *copy = duplicate_type(type);
5600 copy->function.unspecified_parameters = false;
5601 type = identify_new_type(copy);
5603 ndeclaration->declaration.type = type;
5606 entity_t *const entity = record_entity(ndeclaration, true);
5607 assert(entity->kind == ENTITY_FUNCTION);
5608 assert(ndeclaration->kind == ENTITY_FUNCTION);
5610 function_t *const function = &entity->function;
5611 if (ndeclaration != entity) {
5612 function->parameters = ndeclaration->function.parameters;
5614 assert(is_declaration(entity));
5615 type = skip_typeref(entity->declaration.type);
5617 /* push function parameters and switch scope */
5618 size_t const top = environment_top();
5619 scope_t *old_scope = scope_push(&function->parameters);
5621 entity_t *parameter = function->parameters.entities;
5622 for (; parameter != NULL; parameter = parameter->base.next) {
5623 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5624 parameter->base.parent_scope = current_scope;
5626 assert(parameter->base.parent_scope == NULL
5627 || parameter->base.parent_scope == current_scope);
5628 parameter->base.parent_scope = current_scope;
5629 if (parameter->base.symbol == NULL) {
5630 errorf(¶meter->base.source_position, "parameter name omitted");
5633 environment_push(parameter);
5636 if (function->statement != NULL) {
5637 parser_error_multiple_definition(entity, HERE);
5640 /* parse function body */
5641 int label_stack_top = label_top();
5642 function_t *old_current_function = current_function;
5643 entity_t *old_current_entity = current_entity;
5644 current_function = function;
5645 current_entity = entity;
5646 current_parent = NULL;
5649 goto_anchor = &goto_first;
5651 label_anchor = &label_first;
5653 statement_t *const body = parse_compound_statement(false);
5654 function->statement = body;
5657 check_declarations();
5658 if (warning.return_type ||
5659 warning.unreachable_code ||
5660 (warning.missing_noreturn
5661 && !(function->base.modifiers & DM_NORETURN))) {
5662 noreturn_candidate = true;
5663 check_reachable(body);
5664 if (warning.unreachable_code)
5665 walk_statements(body, check_unreachable, NULL);
5666 if (warning.missing_noreturn &&
5667 noreturn_candidate &&
5668 !(function->base.modifiers & DM_NORETURN)) {
5669 warningf(&body->base.source_position,
5670 "function '%#T' is candidate for attribute 'noreturn'",
5671 type, entity->base.symbol);
5675 assert(current_parent == NULL);
5676 assert(current_function == function);
5677 assert(current_entity == entity);
5678 current_entity = old_current_entity;
5679 current_function = old_current_function;
5680 label_pop_to(label_stack_top);
5683 assert(current_scope == &function->parameters);
5684 scope_pop(old_scope);
5685 environment_pop_to(top);
5688 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5689 source_position_t *source_position,
5690 const symbol_t *symbol)
5692 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5694 type->bitfield.base_type = base_type;
5695 type->bitfield.size_expression = size;
5698 type_t *skipped_type = skip_typeref(base_type);
5699 if (!is_type_integer(skipped_type)) {
5700 errorf(HERE, "bitfield base type '%T' is not an integer type",
5704 bit_size = get_type_size(base_type) * 8;
5707 if (is_constant_expression(size) == EXPR_CLASS_CONSTANT) {
5708 long v = fold_constant_to_int(size);
5709 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5712 errorf(source_position, "negative width in bit-field '%Y'",
5714 } else if (v == 0 && symbol != NULL) {
5715 errorf(source_position, "zero width for bit-field '%Y'",
5717 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5718 errorf(source_position, "width of '%Y' exceeds its type",
5721 type->bitfield.bit_size = v;
5728 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5730 entity_t *iter = compound->members.entities;
5731 for (; iter != NULL; iter = iter->base.next) {
5732 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5735 if (iter->base.symbol == symbol) {
5737 } else if (iter->base.symbol == NULL) {
5738 /* search in anonymous structs and unions */
5739 type_t *type = skip_typeref(iter->declaration.type);
5740 if (is_type_compound(type)) {
5741 if (find_compound_entry(type->compound.compound, symbol)
5752 static void check_deprecated(const source_position_t *source_position,
5753 const entity_t *entity)
5755 if (!warning.deprecated_declarations)
5757 if (!is_declaration(entity))
5759 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5762 char const *const prefix = get_entity_kind_name(entity->kind);
5763 const char *deprecated_string
5764 = get_deprecated_string(entity->declaration.attributes);
5765 if (deprecated_string != NULL) {
5766 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5767 prefix, entity->base.symbol, &entity->base.source_position,
5770 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5771 entity->base.symbol, &entity->base.source_position);
5776 static expression_t *create_select(const source_position_t *pos,
5778 type_qualifiers_t qualifiers,
5781 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5783 check_deprecated(pos, entry);
5785 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5786 select->select.compound = addr;
5787 select->select.compound_entry = entry;
5789 type_t *entry_type = entry->declaration.type;
5790 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5792 /* we always do the auto-type conversions; the & and sizeof parser contains
5793 * code to revert this! */
5794 select->base.type = automatic_type_conversion(res_type);
5795 if (res_type->kind == TYPE_BITFIELD) {
5796 select->base.type = res_type->bitfield.base_type;
5803 * Find entry with symbol in compound. Search anonymous structs and unions and
5804 * creates implicit select expressions for them.
5805 * Returns the adress for the innermost compound.
5807 static expression_t *find_create_select(const source_position_t *pos,
5809 type_qualifiers_t qualifiers,
5810 compound_t *compound, symbol_t *symbol)
5812 entity_t *iter = compound->members.entities;
5813 for (; iter != NULL; iter = iter->base.next) {
5814 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5817 symbol_t *iter_symbol = iter->base.symbol;
5818 if (iter_symbol == NULL) {
5819 type_t *type = iter->declaration.type;
5820 if (type->kind != TYPE_COMPOUND_STRUCT
5821 && type->kind != TYPE_COMPOUND_UNION)
5824 compound_t *sub_compound = type->compound.compound;
5826 if (find_compound_entry(sub_compound, symbol) == NULL)
5829 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5830 sub_addr->base.source_position = *pos;
5831 sub_addr->select.implicit = true;
5832 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5836 if (iter_symbol == symbol) {
5837 return create_select(pos, addr, qualifiers, iter);
5844 static void parse_compound_declarators(compound_t *compound,
5845 const declaration_specifiers_t *specifiers)
5850 if (token.type == ':') {
5851 source_position_t source_position = *HERE;
5854 type_t *base_type = specifiers->type;
5855 expression_t *size = parse_constant_expression();
5857 type_t *type = make_bitfield_type(base_type, size,
5858 &source_position, NULL);
5860 attribute_t *attributes = parse_attributes(NULL);
5861 attribute_t **anchor = &attributes;
5862 while (*anchor != NULL)
5863 anchor = &(*anchor)->next;
5864 *anchor = specifiers->attributes;
5866 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5867 entity->base.namespc = NAMESPACE_NORMAL;
5868 entity->base.source_position = source_position;
5869 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5870 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5871 entity->declaration.type = type;
5872 entity->declaration.attributes = attributes;
5874 if (attributes != NULL) {
5875 handle_entity_attributes(attributes, entity);
5877 append_entity(&compound->members, entity);
5879 entity = parse_declarator(specifiers,
5880 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5881 if (entity->kind == ENTITY_TYPEDEF) {
5882 errorf(&entity->base.source_position,
5883 "typedef not allowed as compound member");
5885 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5887 /* make sure we don't define a symbol multiple times */
5888 symbol_t *symbol = entity->base.symbol;
5889 if (symbol != NULL) {
5890 entity_t *prev = find_compound_entry(compound, symbol);
5892 errorf(&entity->base.source_position,
5893 "multiple declarations of symbol '%Y' (declared %P)",
5894 symbol, &prev->base.source_position);
5898 if (token.type == ':') {
5899 source_position_t source_position = *HERE;
5901 expression_t *size = parse_constant_expression();
5903 type_t *type = entity->declaration.type;
5904 type_t *bitfield_type = make_bitfield_type(type, size,
5905 &source_position, entity->base.symbol);
5907 attribute_t *attributes = parse_attributes(NULL);
5908 entity->declaration.type = bitfield_type;
5909 handle_entity_attributes(attributes, entity);
5911 type_t *orig_type = entity->declaration.type;
5912 type_t *type = skip_typeref(orig_type);
5913 if (is_type_function(type)) {
5914 errorf(&entity->base.source_position,
5915 "compound member '%Y' must not have function type '%T'",
5916 entity->base.symbol, orig_type);
5917 } else if (is_type_incomplete(type)) {
5918 /* §6.7.2.1:16 flexible array member */
5919 if (!is_type_array(type) ||
5920 token.type != ';' ||
5921 look_ahead(1)->type != '}') {
5922 errorf(&entity->base.source_position,
5923 "compound member '%Y' has incomplete type '%T'",
5924 entity->base.symbol, orig_type);
5929 append_entity(&compound->members, entity);
5932 } while (next_if(','));
5933 expect(';', end_error);
5936 anonymous_entity = NULL;
5939 static void parse_compound_type_entries(compound_t *compound)
5942 add_anchor_token('}');
5944 while (token.type != '}') {
5945 if (token.type == T_EOF) {
5946 errorf(HERE, "EOF while parsing struct");
5949 declaration_specifiers_t specifiers;
5950 parse_declaration_specifiers(&specifiers);
5951 parse_compound_declarators(compound, &specifiers);
5953 rem_anchor_token('}');
5957 compound->complete = true;
5960 static type_t *parse_typename(void)
5962 declaration_specifiers_t specifiers;
5963 parse_declaration_specifiers(&specifiers);
5964 if (specifiers.storage_class != STORAGE_CLASS_NONE
5965 || specifiers.thread_local) {
5966 /* TODO: improve error message, user does probably not know what a
5967 * storage class is...
5969 errorf(HERE, "typename must not have a storage class");
5972 type_t *result = parse_abstract_declarator(specifiers.type);
5980 typedef expression_t* (*parse_expression_function)(void);
5981 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5983 typedef struct expression_parser_function_t expression_parser_function_t;
5984 struct expression_parser_function_t {
5985 parse_expression_function parser;
5986 precedence_t infix_precedence;
5987 parse_expression_infix_function infix_parser;
5990 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5993 * Prints an error message if an expression was expected but not read
5995 static expression_t *expected_expression_error(void)
5997 /* skip the error message if the error token was read */
5998 if (token.type != T_ERROR) {
5999 errorf(HERE, "expected expression, got token %K", &token);
6003 return create_invalid_expression();
6006 static type_t *get_string_type(void)
6008 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
6011 static type_t *get_wide_string_type(void)
6013 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6017 * Parse a string constant.
6019 static expression_t *parse_string_literal(void)
6021 source_position_t begin = token.source_position;
6022 string_t res = token.literal;
6023 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
6026 while (token.type == T_STRING_LITERAL
6027 || token.type == T_WIDE_STRING_LITERAL) {
6028 warn_string_concat(&token.source_position);
6029 res = concat_strings(&res, &token.literal);
6031 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6034 expression_t *literal;
6036 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6037 literal->base.type = get_wide_string_type();
6039 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6040 literal->base.type = get_string_type();
6042 literal->base.source_position = begin;
6043 literal->literal.value = res;
6049 * Parse a boolean constant.
6051 static expression_t *parse_boolean_literal(bool value)
6053 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6054 literal->base.source_position = token.source_position;
6055 literal->base.type = type_bool;
6056 literal->literal.value.begin = value ? "true" : "false";
6057 literal->literal.value.size = value ? 4 : 5;
6063 static void warn_traditional_suffix(void)
6065 if (!warning.traditional)
6067 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6071 static void check_integer_suffix(void)
6073 symbol_t *suffix = token.symbol;
6077 bool not_traditional = false;
6078 const char *c = suffix->string;
6079 if (*c == 'l' || *c == 'L') {
6082 not_traditional = true;
6084 if (*c == 'u' || *c == 'U') {
6087 } else if (*c == 'u' || *c == 'U') {
6088 not_traditional = true;
6091 } else if (*c == 'u' || *c == 'U') {
6092 not_traditional = true;
6094 if (*c == 'l' || *c == 'L') {
6102 errorf(&token.source_position,
6103 "invalid suffix '%s' on integer constant", suffix->string);
6104 } else if (not_traditional) {
6105 warn_traditional_suffix();
6109 static type_t *check_floatingpoint_suffix(void)
6111 symbol_t *suffix = token.symbol;
6112 type_t *type = type_double;
6116 bool not_traditional = false;
6117 const char *c = suffix->string;
6118 if (*c == 'f' || *c == 'F') {
6121 } else if (*c == 'l' || *c == 'L') {
6123 type = type_long_double;
6126 errorf(&token.source_position,
6127 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6128 } else if (not_traditional) {
6129 warn_traditional_suffix();
6136 * Parse an integer constant.
6138 static expression_t *parse_number_literal(void)
6140 expression_kind_t kind;
6143 switch (token.type) {
6145 kind = EXPR_LITERAL_INTEGER;
6146 check_integer_suffix();
6149 case T_INTEGER_OCTAL:
6150 kind = EXPR_LITERAL_INTEGER_OCTAL;
6151 check_integer_suffix();
6154 case T_INTEGER_HEXADECIMAL:
6155 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6156 check_integer_suffix();
6159 case T_FLOATINGPOINT:
6160 kind = EXPR_LITERAL_FLOATINGPOINT;
6161 type = check_floatingpoint_suffix();
6163 case T_FLOATINGPOINT_HEXADECIMAL:
6164 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6165 type = check_floatingpoint_suffix();
6168 panic("unexpected token type in parse_number_literal");
6171 expression_t *literal = allocate_expression_zero(kind);
6172 literal->base.source_position = token.source_position;
6173 literal->base.type = type;
6174 literal->literal.value = token.literal;
6175 literal->literal.suffix = token.symbol;
6178 /* integer type depends on the size of the number and the size
6179 * representable by the types. The backend/codegeneration has to determine
6182 determine_literal_type(&literal->literal);
6187 * Parse a character constant.
6189 static expression_t *parse_character_constant(void)
6191 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6192 literal->base.source_position = token.source_position;
6193 literal->base.type = c_mode & _CXX ? type_char : type_int;
6194 literal->literal.value = token.literal;
6196 size_t len = literal->literal.value.size;
6198 if (!GNU_MODE && !(c_mode & _C99)) {
6199 errorf(HERE, "more than 1 character in character constant");
6200 } else if (warning.multichar) {
6201 literal->base.type = type_int;
6202 warningf(HERE, "multi-character character constant");
6211 * Parse a wide character constant.
6213 static expression_t *parse_wide_character_constant(void)
6215 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6216 literal->base.source_position = token.source_position;
6217 literal->base.type = type_int;
6218 literal->literal.value = token.literal;
6220 size_t len = wstrlen(&literal->literal.value);
6222 warningf(HERE, "multi-character character constant");
6229 static entity_t *create_implicit_function(symbol_t *symbol,
6230 const source_position_t *source_position)
6232 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6233 ntype->function.return_type = type_int;
6234 ntype->function.unspecified_parameters = true;
6235 ntype->function.linkage = LINKAGE_C;
6236 type_t *type = identify_new_type(ntype);
6238 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6239 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6240 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6241 entity->declaration.type = type;
6242 entity->declaration.implicit = true;
6243 entity->base.namespc = NAMESPACE_NORMAL;
6244 entity->base.symbol = symbol;
6245 entity->base.source_position = *source_position;
6247 if (current_scope != NULL) {
6248 bool strict_prototypes_old = warning.strict_prototypes;
6249 warning.strict_prototypes = false;
6250 record_entity(entity, false);
6251 warning.strict_prototypes = strict_prototypes_old;
6258 * Performs automatic type cast as described in §6.3.2.1.
6260 * @param orig_type the original type
6262 static type_t *automatic_type_conversion(type_t *orig_type)
6264 type_t *type = skip_typeref(orig_type);
6265 if (is_type_array(type)) {
6266 array_type_t *array_type = &type->array;
6267 type_t *element_type = array_type->element_type;
6268 unsigned qualifiers = array_type->base.qualifiers;
6270 return make_pointer_type(element_type, qualifiers);
6273 if (is_type_function(type)) {
6274 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6281 * reverts the automatic casts of array to pointer types and function
6282 * to function-pointer types as defined §6.3.2.1
6284 type_t *revert_automatic_type_conversion(const expression_t *expression)
6286 switch (expression->kind) {
6287 case EXPR_REFERENCE: {
6288 entity_t *entity = expression->reference.entity;
6289 if (is_declaration(entity)) {
6290 return entity->declaration.type;
6291 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6292 return entity->enum_value.enum_type;
6294 panic("no declaration or enum in reference");
6299 entity_t *entity = expression->select.compound_entry;
6300 assert(is_declaration(entity));
6301 type_t *type = entity->declaration.type;
6302 return get_qualified_type(type,
6303 expression->base.type->base.qualifiers);
6306 case EXPR_UNARY_DEREFERENCE: {
6307 const expression_t *const value = expression->unary.value;
6308 type_t *const type = skip_typeref(value->base.type);
6309 if (!is_type_pointer(type))
6310 return type_error_type;
6311 return type->pointer.points_to;
6314 case EXPR_ARRAY_ACCESS: {
6315 const expression_t *array_ref = expression->array_access.array_ref;
6316 type_t *type_left = skip_typeref(array_ref->base.type);
6317 if (!is_type_pointer(type_left))
6318 return type_error_type;
6319 return type_left->pointer.points_to;
6322 case EXPR_STRING_LITERAL: {
6323 size_t size = expression->string_literal.value.size;
6324 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6327 case EXPR_WIDE_STRING_LITERAL: {
6328 size_t size = wstrlen(&expression->string_literal.value);
6329 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6332 case EXPR_COMPOUND_LITERAL:
6333 return expression->compound_literal.type;
6338 return expression->base.type;
6342 * Find an entity matching a symbol in a scope.
6343 * Uses current scope if scope is NULL
6345 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6346 namespace_tag_t namespc)
6348 if (scope == NULL) {
6349 return get_entity(symbol, namespc);
6352 /* we should optimize here, if scope grows above a certain size we should
6353 construct a hashmap here... */
6354 entity_t *entity = scope->entities;
6355 for ( ; entity != NULL; entity = entity->base.next) {
6356 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6363 static entity_t *parse_qualified_identifier(void)
6365 /* namespace containing the symbol */
6367 source_position_t pos;
6368 const scope_t *lookup_scope = NULL;
6370 if (next_if(T_COLONCOLON))
6371 lookup_scope = &unit->scope;
6375 if (token.type != T_IDENTIFIER) {
6376 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6377 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6379 symbol = token.symbol;
6384 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6386 if (!next_if(T_COLONCOLON))
6389 switch (entity->kind) {
6390 case ENTITY_NAMESPACE:
6391 lookup_scope = &entity->namespacee.members;
6396 lookup_scope = &entity->compound.members;
6399 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6400 symbol, get_entity_kind_name(entity->kind));
6405 if (entity == NULL) {
6406 if (!strict_mode && token.type == '(') {
6407 /* an implicitly declared function */
6408 if (warning.error_implicit_function_declaration) {
6409 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6410 } else if (warning.implicit_function_declaration) {
6411 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6414 entity = create_implicit_function(symbol, &pos);
6416 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6417 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6424 /* skip further qualifications */
6425 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6427 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6430 static expression_t *parse_reference(void)
6432 source_position_t const pos = token.source_position;
6433 entity_t *const entity = parse_qualified_identifier();
6436 if (is_declaration(entity)) {
6437 orig_type = entity->declaration.type;
6438 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6439 orig_type = entity->enum_value.enum_type;
6441 panic("expected declaration or enum value in reference");
6444 /* we always do the auto-type conversions; the & and sizeof parser contains
6445 * code to revert this! */
6446 type_t *type = automatic_type_conversion(orig_type);
6448 expression_kind_t kind = EXPR_REFERENCE;
6449 if (entity->kind == ENTITY_ENUM_VALUE)
6450 kind = EXPR_REFERENCE_ENUM_VALUE;
6452 expression_t *expression = allocate_expression_zero(kind);
6453 expression->base.source_position = pos;
6454 expression->base.type = type;
6455 expression->reference.entity = entity;
6457 /* this declaration is used */
6458 if (is_declaration(entity)) {
6459 entity->declaration.used = true;
6462 if (entity->base.parent_scope != file_scope
6463 && (current_function != NULL
6464 && entity->base.parent_scope->depth < current_function->parameters.depth)
6465 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6466 if (entity->kind == ENTITY_VARIABLE) {
6467 /* access of a variable from an outer function */
6468 entity->variable.address_taken = true;
6469 } else if (entity->kind == ENTITY_PARAMETER) {
6470 entity->parameter.address_taken = true;
6472 current_function->need_closure = true;
6475 check_deprecated(HERE, entity);
6477 if (warning.init_self && entity == current_init_decl && !in_type_prop
6478 && entity->kind == ENTITY_VARIABLE) {
6479 current_init_decl = NULL;
6480 warningf(&pos, "variable '%#T' is initialized by itself",
6481 entity->declaration.type, entity->base.symbol);
6487 static bool semantic_cast(expression_t *cast)
6489 expression_t *expression = cast->unary.value;
6490 type_t *orig_dest_type = cast->base.type;
6491 type_t *orig_type_right = expression->base.type;
6492 type_t const *dst_type = skip_typeref(orig_dest_type);
6493 type_t const *src_type = skip_typeref(orig_type_right);
6494 source_position_t const *pos = &cast->base.source_position;
6496 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6497 if (dst_type == type_void)
6500 /* only integer and pointer can be casted to pointer */
6501 if (is_type_pointer(dst_type) &&
6502 !is_type_pointer(src_type) &&
6503 !is_type_integer(src_type) &&
6504 is_type_valid(src_type)) {
6505 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6509 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6510 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6514 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6515 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6519 if (warning.cast_qual &&
6520 is_type_pointer(src_type) &&
6521 is_type_pointer(dst_type)) {
6522 type_t *src = skip_typeref(src_type->pointer.points_to);
6523 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6524 unsigned missing_qualifiers =
6525 src->base.qualifiers & ~dst->base.qualifiers;
6526 if (missing_qualifiers != 0) {
6528 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6529 missing_qualifiers, orig_type_right);
6535 static expression_t *parse_compound_literal(type_t *type)
6537 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6539 parse_initializer_env_t env;
6542 env.must_be_constant = false;
6543 initializer_t *initializer = parse_initializer(&env);
6546 expression->compound_literal.initializer = initializer;
6547 expression->compound_literal.type = type;
6548 expression->base.type = automatic_type_conversion(type);
6554 * Parse a cast expression.
6556 static expression_t *parse_cast(void)
6558 source_position_t source_position = token.source_position;
6561 add_anchor_token(')');
6563 type_t *type = parse_typename();
6565 rem_anchor_token(')');
6566 expect(')', end_error);
6568 if (token.type == '{') {
6569 return parse_compound_literal(type);
6572 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6573 cast->base.source_position = source_position;
6575 expression_t *value = parse_subexpression(PREC_CAST);
6576 cast->base.type = type;
6577 cast->unary.value = value;
6579 if (! semantic_cast(cast)) {
6580 /* TODO: record the error in the AST. else it is impossible to detect it */
6585 return create_invalid_expression();
6589 * Parse a statement expression.
6591 static expression_t *parse_statement_expression(void)
6593 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6596 add_anchor_token(')');
6598 statement_t *statement = parse_compound_statement(true);
6599 statement->compound.stmt_expr = true;
6600 expression->statement.statement = statement;
6602 /* find last statement and use its type */
6603 type_t *type = type_void;
6604 const statement_t *stmt = statement->compound.statements;
6606 while (stmt->base.next != NULL)
6607 stmt = stmt->base.next;
6609 if (stmt->kind == STATEMENT_EXPRESSION) {
6610 type = stmt->expression.expression->base.type;
6612 } else if (warning.other) {
6613 warningf(&expression->base.source_position, "empty statement expression ({})");
6615 expression->base.type = type;
6617 rem_anchor_token(')');
6618 expect(')', end_error);
6625 * Parse a parenthesized expression.
6627 static expression_t *parse_parenthesized_expression(void)
6629 token_t const* const la1 = look_ahead(1);
6630 switch (la1->type) {
6632 /* gcc extension: a statement expression */
6633 return parse_statement_expression();
6636 if (is_typedef_symbol(la1->symbol)) {
6639 return parse_cast();
6644 add_anchor_token(')');
6645 expression_t *result = parse_expression();
6646 result->base.parenthesized = true;
6647 rem_anchor_token(')');
6648 expect(')', end_error);
6654 static expression_t *parse_function_keyword(void)
6658 if (current_function == NULL) {
6659 errorf(HERE, "'__func__' used outside of a function");
6662 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6663 expression->base.type = type_char_ptr;
6664 expression->funcname.kind = FUNCNAME_FUNCTION;
6671 static expression_t *parse_pretty_function_keyword(void)
6673 if (current_function == NULL) {
6674 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6677 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6678 expression->base.type = type_char_ptr;
6679 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6681 eat(T___PRETTY_FUNCTION__);
6686 static expression_t *parse_funcsig_keyword(void)
6688 if (current_function == NULL) {
6689 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6692 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6693 expression->base.type = type_char_ptr;
6694 expression->funcname.kind = FUNCNAME_FUNCSIG;
6701 static expression_t *parse_funcdname_keyword(void)
6703 if (current_function == NULL) {
6704 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6707 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6708 expression->base.type = type_char_ptr;
6709 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6711 eat(T___FUNCDNAME__);
6716 static designator_t *parse_designator(void)
6718 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6719 result->source_position = *HERE;
6721 if (token.type != T_IDENTIFIER) {
6722 parse_error_expected("while parsing member designator",
6723 T_IDENTIFIER, NULL);
6726 result->symbol = token.symbol;
6729 designator_t *last_designator = result;
6732 if (token.type != T_IDENTIFIER) {
6733 parse_error_expected("while parsing member designator",
6734 T_IDENTIFIER, NULL);
6737 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6738 designator->source_position = *HERE;
6739 designator->symbol = token.symbol;
6742 last_designator->next = designator;
6743 last_designator = designator;
6747 add_anchor_token(']');
6748 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6749 designator->source_position = *HERE;
6750 designator->array_index = parse_expression();
6751 rem_anchor_token(']');
6752 expect(']', end_error);
6753 if (designator->array_index == NULL) {
6757 last_designator->next = designator;
6758 last_designator = designator;
6770 * Parse the __builtin_offsetof() expression.
6772 static expression_t *parse_offsetof(void)
6774 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6775 expression->base.type = type_size_t;
6777 eat(T___builtin_offsetof);
6779 expect('(', end_error);
6780 add_anchor_token(',');
6781 type_t *type = parse_typename();
6782 rem_anchor_token(',');
6783 expect(',', end_error);
6784 add_anchor_token(')');
6785 designator_t *designator = parse_designator();
6786 rem_anchor_token(')');
6787 expect(')', end_error);
6789 expression->offsetofe.type = type;
6790 expression->offsetofe.designator = designator;
6793 memset(&path, 0, sizeof(path));
6794 path.top_type = type;
6795 path.path = NEW_ARR_F(type_path_entry_t, 0);
6797 descend_into_subtype(&path);
6799 if (!walk_designator(&path, designator, true)) {
6800 return create_invalid_expression();
6803 DEL_ARR_F(path.path);
6807 return create_invalid_expression();
6811 * Parses a _builtin_va_start() expression.
6813 static expression_t *parse_va_start(void)
6815 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6817 eat(T___builtin_va_start);
6819 expect('(', end_error);
6820 add_anchor_token(',');
6821 expression->va_starte.ap = parse_assignment_expression();
6822 rem_anchor_token(',');
6823 expect(',', end_error);
6824 expression_t *const expr = parse_assignment_expression();
6825 if (expr->kind == EXPR_REFERENCE) {
6826 entity_t *const entity = expr->reference.entity;
6827 if (!current_function->base.type->function.variadic) {
6828 errorf(&expr->base.source_position,
6829 "'va_start' used in non-variadic function");
6830 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6831 entity->base.next != NULL ||
6832 entity->kind != ENTITY_PARAMETER) {
6833 errorf(&expr->base.source_position,
6834 "second argument of 'va_start' must be last parameter of the current function");
6836 expression->va_starte.parameter = &entity->variable;
6838 expect(')', end_error);
6841 expect(')', end_error);
6843 return create_invalid_expression();
6847 * Parses a __builtin_va_arg() expression.
6849 static expression_t *parse_va_arg(void)
6851 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6853 eat(T___builtin_va_arg);
6855 expect('(', end_error);
6857 ap.expression = parse_assignment_expression();
6858 expression->va_arge.ap = ap.expression;
6859 check_call_argument(type_valist, &ap, 1);
6861 expect(',', end_error);
6862 expression->base.type = parse_typename();
6863 expect(')', end_error);
6867 return create_invalid_expression();
6871 * Parses a __builtin_va_copy() expression.
6873 static expression_t *parse_va_copy(void)
6875 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6877 eat(T___builtin_va_copy);
6879 expect('(', end_error);
6880 expression_t *dst = parse_assignment_expression();
6881 assign_error_t error = semantic_assign(type_valist, dst);
6882 report_assign_error(error, type_valist, dst, "call argument 1",
6883 &dst->base.source_position);
6884 expression->va_copye.dst = dst;
6886 expect(',', end_error);
6888 call_argument_t src;
6889 src.expression = parse_assignment_expression();
6890 check_call_argument(type_valist, &src, 2);
6891 expression->va_copye.src = src.expression;
6892 expect(')', end_error);
6896 return create_invalid_expression();
6900 * Parses a __builtin_constant_p() expression.
6902 static expression_t *parse_builtin_constant(void)
6904 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6906 eat(T___builtin_constant_p);
6908 expect('(', end_error);
6909 add_anchor_token(')');
6910 expression->builtin_constant.value = parse_assignment_expression();
6911 rem_anchor_token(')');
6912 expect(')', end_error);
6913 expression->base.type = type_int;
6917 return create_invalid_expression();
6921 * Parses a __builtin_types_compatible_p() expression.
6923 static expression_t *parse_builtin_types_compatible(void)
6925 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6927 eat(T___builtin_types_compatible_p);
6929 expect('(', end_error);
6930 add_anchor_token(')');
6931 add_anchor_token(',');
6932 expression->builtin_types_compatible.left = parse_typename();
6933 rem_anchor_token(',');
6934 expect(',', end_error);
6935 expression->builtin_types_compatible.right = parse_typename();
6936 rem_anchor_token(')');
6937 expect(')', end_error);
6938 expression->base.type = type_int;
6942 return create_invalid_expression();
6946 * Parses a __builtin_is_*() compare expression.
6948 static expression_t *parse_compare_builtin(void)
6950 expression_t *expression;
6952 switch (token.type) {
6953 case T___builtin_isgreater:
6954 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6956 case T___builtin_isgreaterequal:
6957 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6959 case T___builtin_isless:
6960 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6962 case T___builtin_islessequal:
6963 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6965 case T___builtin_islessgreater:
6966 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6968 case T___builtin_isunordered:
6969 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6972 internal_errorf(HERE, "invalid compare builtin found");
6974 expression->base.source_position = *HERE;
6977 expect('(', end_error);
6978 expression->binary.left = parse_assignment_expression();
6979 expect(',', end_error);
6980 expression->binary.right = parse_assignment_expression();
6981 expect(')', end_error);
6983 type_t *const orig_type_left = expression->binary.left->base.type;
6984 type_t *const orig_type_right = expression->binary.right->base.type;
6986 type_t *const type_left = skip_typeref(orig_type_left);
6987 type_t *const type_right = skip_typeref(orig_type_right);
6988 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6989 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6990 type_error_incompatible("invalid operands in comparison",
6991 &expression->base.source_position, orig_type_left, orig_type_right);
6994 semantic_comparison(&expression->binary);
6999 return create_invalid_expression();
7003 * Parses a MS assume() expression.
7005 static expression_t *parse_assume(void)
7007 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7011 expect('(', end_error);
7012 add_anchor_token(')');
7013 expression->unary.value = parse_assignment_expression();
7014 rem_anchor_token(')');
7015 expect(')', end_error);
7017 expression->base.type = type_void;
7020 return create_invalid_expression();
7024 * Return the declaration for a given label symbol or create a new one.
7026 * @param symbol the symbol of the label
7028 static label_t *get_label(symbol_t *symbol)
7031 assert(current_function != NULL);
7033 label = get_entity(symbol, NAMESPACE_LABEL);
7034 /* if we found a local label, we already created the declaration */
7035 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7036 if (label->base.parent_scope != current_scope) {
7037 assert(label->base.parent_scope->depth < current_scope->depth);
7038 current_function->goto_to_outer = true;
7040 return &label->label;
7043 label = get_entity(symbol, NAMESPACE_LABEL);
7044 /* if we found a label in the same function, then we already created the
7047 && label->base.parent_scope == ¤t_function->parameters) {
7048 return &label->label;
7051 /* otherwise we need to create a new one */
7052 label = allocate_entity_zero(ENTITY_LABEL);
7053 label->base.namespc = NAMESPACE_LABEL;
7054 label->base.symbol = symbol;
7058 return &label->label;
7062 * Parses a GNU && label address expression.
7064 static expression_t *parse_label_address(void)
7066 source_position_t source_position = token.source_position;
7068 if (token.type != T_IDENTIFIER) {
7069 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7072 symbol_t *symbol = token.symbol;
7075 label_t *label = get_label(symbol);
7077 label->address_taken = true;
7079 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7080 expression->base.source_position = source_position;
7082 /* label address is threaten as a void pointer */
7083 expression->base.type = type_void_ptr;
7084 expression->label_address.label = label;
7087 return create_invalid_expression();
7091 * Parse a microsoft __noop expression.
7093 static expression_t *parse_noop_expression(void)
7095 /* the result is a (int)0 */
7096 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7097 literal->base.type = type_int;
7098 literal->base.source_position = token.source_position;
7099 literal->literal.value.begin = "__noop";
7100 literal->literal.value.size = 6;
7104 if (token.type == '(') {
7105 /* parse arguments */
7107 add_anchor_token(')');
7108 add_anchor_token(',');
7110 if (token.type != ')') do {
7111 (void)parse_assignment_expression();
7112 } while (next_if(','));
7114 rem_anchor_token(',');
7115 rem_anchor_token(')');
7116 expect(')', end_error);
7123 * Parses a primary expression.
7125 static expression_t *parse_primary_expression(void)
7127 switch (token.type) {
7128 case T_false: return parse_boolean_literal(false);
7129 case T_true: return parse_boolean_literal(true);
7131 case T_INTEGER_OCTAL:
7132 case T_INTEGER_HEXADECIMAL:
7133 case T_FLOATINGPOINT:
7134 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7135 case T_CHARACTER_CONSTANT: return parse_character_constant();
7136 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7137 case T_STRING_LITERAL:
7138 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7139 case T___FUNCTION__:
7140 case T___func__: return parse_function_keyword();
7141 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7142 case T___FUNCSIG__: return parse_funcsig_keyword();
7143 case T___FUNCDNAME__: return parse_funcdname_keyword();
7144 case T___builtin_offsetof: return parse_offsetof();
7145 case T___builtin_va_start: return parse_va_start();
7146 case T___builtin_va_arg: return parse_va_arg();
7147 case T___builtin_va_copy: return parse_va_copy();
7148 case T___builtin_isgreater:
7149 case T___builtin_isgreaterequal:
7150 case T___builtin_isless:
7151 case T___builtin_islessequal:
7152 case T___builtin_islessgreater:
7153 case T___builtin_isunordered: return parse_compare_builtin();
7154 case T___builtin_constant_p: return parse_builtin_constant();
7155 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7156 case T__assume: return parse_assume();
7159 return parse_label_address();
7162 case '(': return parse_parenthesized_expression();
7163 case T___noop: return parse_noop_expression();
7165 /* Gracefully handle type names while parsing expressions. */
7167 return parse_reference();
7169 if (!is_typedef_symbol(token.symbol)) {
7170 return parse_reference();
7174 source_position_t const pos = *HERE;
7175 type_t const *const type = parse_typename();
7176 errorf(&pos, "encountered type '%T' while parsing expression", type);
7177 return create_invalid_expression();
7181 errorf(HERE, "unexpected token %K, expected an expression", &token);
7183 return create_invalid_expression();
7186 static expression_t *parse_array_expression(expression_t *left)
7188 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7189 array_access_expression_t *const arr = &expr->array_access;
7192 add_anchor_token(']');
7194 expression_t *const inside = parse_expression();
7196 type_t *const orig_type_left = left->base.type;
7197 type_t *const orig_type_inside = inside->base.type;
7199 type_t *const type_left = skip_typeref(orig_type_left);
7200 type_t *const type_inside = skip_typeref(orig_type_inside);
7206 if (is_type_pointer(type_left)) {
7209 idx_type = type_inside;
7210 res_type = type_left->pointer.points_to;
7212 } else if (is_type_pointer(type_inside)) {
7213 arr->flipped = true;
7216 idx_type = type_left;
7217 res_type = type_inside->pointer.points_to;
7219 res_type = automatic_type_conversion(res_type);
7220 if (!is_type_integer(idx_type)) {
7221 errorf(&idx->base.source_position, "array subscript must have integer type");
7222 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR) && warning.char_subscripts) {
7223 warningf(&idx->base.source_position, "array subscript has char type");
7226 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7228 "array access on object with non-pointer types '%T', '%T'",
7229 orig_type_left, orig_type_inside);
7231 res_type = type_error_type;
7236 arr->array_ref = ref;
7238 arr->base.type = res_type;
7240 rem_anchor_token(']');
7241 expect(']', end_error);
7246 static expression_t *parse_typeprop(expression_kind_t const kind)
7248 expression_t *tp_expression = allocate_expression_zero(kind);
7249 tp_expression->base.type = type_size_t;
7251 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7253 /* we only refer to a type property, mark this case */
7254 bool old = in_type_prop;
7255 in_type_prop = true;
7258 expression_t *expression;
7259 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7261 add_anchor_token(')');
7262 orig_type = parse_typename();
7263 rem_anchor_token(')');
7264 expect(')', end_error);
7266 if (token.type == '{') {
7267 /* It was not sizeof(type) after all. It is sizeof of an expression
7268 * starting with a compound literal */
7269 expression = parse_compound_literal(orig_type);
7270 goto typeprop_expression;
7273 expression = parse_subexpression(PREC_UNARY);
7275 typeprop_expression:
7276 tp_expression->typeprop.tp_expression = expression;
7278 orig_type = revert_automatic_type_conversion(expression);
7279 expression->base.type = orig_type;
7282 tp_expression->typeprop.type = orig_type;
7283 type_t const* const type = skip_typeref(orig_type);
7284 char const* wrong_type = NULL;
7285 if (is_type_incomplete(type)) {
7286 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7287 wrong_type = "incomplete";
7288 } else if (type->kind == TYPE_FUNCTION) {
7290 /* function types are allowed (and return 1) */
7291 if (warning.other) {
7292 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7293 warningf(&tp_expression->base.source_position,
7294 "%s expression with function argument returns invalid result", what);
7297 wrong_type = "function";
7300 if (is_type_incomplete(type))
7301 wrong_type = "incomplete";
7303 if (type->kind == TYPE_BITFIELD)
7304 wrong_type = "bitfield";
7306 if (wrong_type != NULL) {
7307 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7308 errorf(&tp_expression->base.source_position,
7309 "operand of %s expression must not be of %s type '%T'",
7310 what, wrong_type, orig_type);
7315 return tp_expression;
7318 static expression_t *parse_sizeof(void)
7320 return parse_typeprop(EXPR_SIZEOF);
7323 static expression_t *parse_alignof(void)
7325 return parse_typeprop(EXPR_ALIGNOF);
7328 static expression_t *parse_select_expression(expression_t *addr)
7330 assert(token.type == '.' || token.type == T_MINUSGREATER);
7331 bool select_left_arrow = (token.type == T_MINUSGREATER);
7332 source_position_t const pos = *HERE;
7335 if (token.type != T_IDENTIFIER) {
7336 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7337 return create_invalid_expression();
7339 symbol_t *symbol = token.symbol;
7342 type_t *const orig_type = addr->base.type;
7343 type_t *const type = skip_typeref(orig_type);
7346 bool saw_error = false;
7347 if (is_type_pointer(type)) {
7348 if (!select_left_arrow) {
7350 "request for member '%Y' in something not a struct or union, but '%T'",
7354 type_left = skip_typeref(type->pointer.points_to);
7356 if (select_left_arrow && is_type_valid(type)) {
7357 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7363 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7364 type_left->kind != TYPE_COMPOUND_UNION) {
7366 if (is_type_valid(type_left) && !saw_error) {
7368 "request for member '%Y' in something not a struct or union, but '%T'",
7371 return create_invalid_expression();
7374 compound_t *compound = type_left->compound.compound;
7375 if (!compound->complete) {
7376 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7378 return create_invalid_expression();
7381 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7382 expression_t *result =
7383 find_create_select(&pos, addr, qualifiers, compound, symbol);
7385 if (result == NULL) {
7386 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7387 return create_invalid_expression();
7393 static void check_call_argument(type_t *expected_type,
7394 call_argument_t *argument, unsigned pos)
7396 type_t *expected_type_skip = skip_typeref(expected_type);
7397 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7398 expression_t *arg_expr = argument->expression;
7399 type_t *arg_type = skip_typeref(arg_expr->base.type);
7401 /* handle transparent union gnu extension */
7402 if (is_type_union(expected_type_skip)
7403 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7404 compound_t *union_decl = expected_type_skip->compound.compound;
7405 type_t *best_type = NULL;
7406 entity_t *entry = union_decl->members.entities;
7407 for ( ; entry != NULL; entry = entry->base.next) {
7408 assert(is_declaration(entry));
7409 type_t *decl_type = entry->declaration.type;
7410 error = semantic_assign(decl_type, arg_expr);
7411 if (error == ASSIGN_ERROR_INCOMPATIBLE
7412 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7415 if (error == ASSIGN_SUCCESS) {
7416 best_type = decl_type;
7417 } else if (best_type == NULL) {
7418 best_type = decl_type;
7422 if (best_type != NULL) {
7423 expected_type = best_type;
7427 error = semantic_assign(expected_type, arg_expr);
7428 argument->expression = create_implicit_cast(arg_expr, expected_type);
7430 if (error != ASSIGN_SUCCESS) {
7431 /* report exact scope in error messages (like "in argument 3") */
7433 snprintf(buf, sizeof(buf), "call argument %u", pos);
7434 report_assign_error(error, expected_type, arg_expr, buf,
7435 &arg_expr->base.source_position);
7436 } else if (warning.traditional || warning.conversion) {
7437 type_t *const promoted_type = get_default_promoted_type(arg_type);
7438 if (!types_compatible(expected_type_skip, promoted_type) &&
7439 !types_compatible(expected_type_skip, type_void_ptr) &&
7440 !types_compatible(type_void_ptr, promoted_type)) {
7441 /* Deliberately show the skipped types in this warning */
7442 warningf(&arg_expr->base.source_position,
7443 "passing call argument %u as '%T' rather than '%T' due to prototype",
7444 pos, expected_type_skip, promoted_type);
7450 * Handle the semantic restrictions of builtin calls
7452 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7453 switch (call->function->reference.entity->function.btk) {
7454 case bk_gnu_builtin_return_address:
7455 case bk_gnu_builtin_frame_address: {
7456 /* argument must be constant */
7457 call_argument_t *argument = call->arguments;
7459 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7460 errorf(&call->base.source_position,
7461 "argument of '%Y' must be a constant expression",
7462 call->function->reference.entity->base.symbol);
7466 case bk_gnu_builtin_object_size:
7467 if (call->arguments == NULL)
7470 call_argument_t *arg = call->arguments->next;
7471 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7472 errorf(&call->base.source_position,
7473 "second argument of '%Y' must be a constant expression",
7474 call->function->reference.entity->base.symbol);
7477 case bk_gnu_builtin_prefetch:
7478 /* second and third argument must be constant if existent */
7479 if (call->arguments == NULL)
7481 call_argument_t *rw = call->arguments->next;
7482 call_argument_t *locality = NULL;
7485 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7486 errorf(&call->base.source_position,
7487 "second argument of '%Y' must be a constant expression",
7488 call->function->reference.entity->base.symbol);
7490 locality = rw->next;
7492 if (locality != NULL) {
7493 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7494 errorf(&call->base.source_position,
7495 "third argument of '%Y' must be a constant expression",
7496 call->function->reference.entity->base.symbol);
7498 locality = rw->next;
7507 * Parse a call expression, ie. expression '( ... )'.
7509 * @param expression the function address
7511 static expression_t *parse_call_expression(expression_t *expression)
7513 expression_t *result = allocate_expression_zero(EXPR_CALL);
7514 call_expression_t *call = &result->call;
7515 call->function = expression;
7517 type_t *const orig_type = expression->base.type;
7518 type_t *const type = skip_typeref(orig_type);
7520 function_type_t *function_type = NULL;
7521 if (is_type_pointer(type)) {
7522 type_t *const to_type = skip_typeref(type->pointer.points_to);
7524 if (is_type_function(to_type)) {
7525 function_type = &to_type->function;
7526 call->base.type = function_type->return_type;
7530 if (function_type == NULL && is_type_valid(type)) {
7532 "called object '%E' (type '%T') is not a pointer to a function",
7533 expression, orig_type);
7536 /* parse arguments */
7538 add_anchor_token(')');
7539 add_anchor_token(',');
7541 if (token.type != ')') {
7542 call_argument_t **anchor = &call->arguments;
7544 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7545 argument->expression = parse_assignment_expression();
7548 anchor = &argument->next;
7549 } while (next_if(','));
7551 rem_anchor_token(',');
7552 rem_anchor_token(')');
7553 expect(')', end_error);
7555 if (function_type == NULL)
7558 /* check type and count of call arguments */
7559 function_parameter_t *parameter = function_type->parameters;
7560 call_argument_t *argument = call->arguments;
7561 if (!function_type->unspecified_parameters) {
7562 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7563 parameter = parameter->next, argument = argument->next) {
7564 check_call_argument(parameter->type, argument, ++pos);
7567 if (parameter != NULL) {
7568 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7569 } else if (argument != NULL && !function_type->variadic) {
7570 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7574 /* do default promotion for other arguments */
7575 for (; argument != NULL; argument = argument->next) {
7576 type_t *type = argument->expression->base.type;
7577 if (!is_type_object(skip_typeref(type))) {
7578 errorf(&argument->expression->base.source_position,
7579 "call argument '%E' must not be void", argument->expression);
7582 type = get_default_promoted_type(type);
7584 argument->expression
7585 = create_implicit_cast(argument->expression, type);
7590 if (warning.aggregate_return &&
7591 is_type_compound(skip_typeref(function_type->return_type))) {
7592 warningf(&expression->base.source_position,
7593 "function call has aggregate value");
7596 if (expression->kind == EXPR_REFERENCE) {
7597 reference_expression_t *reference = &expression->reference;
7598 if (reference->entity->kind == ENTITY_FUNCTION &&
7599 reference->entity->function.btk != bk_none)
7600 handle_builtin_argument_restrictions(call);
7607 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7609 static bool same_compound_type(const type_t *type1, const type_t *type2)
7612 is_type_compound(type1) &&
7613 type1->kind == type2->kind &&
7614 type1->compound.compound == type2->compound.compound;
7617 static expression_t const *get_reference_address(expression_t const *expr)
7619 bool regular_take_address = true;
7621 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7622 expr = expr->unary.value;
7624 regular_take_address = false;
7627 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7630 expr = expr->unary.value;
7633 if (expr->kind != EXPR_REFERENCE)
7636 /* special case for functions which are automatically converted to a
7637 * pointer to function without an extra TAKE_ADDRESS operation */
7638 if (!regular_take_address &&
7639 expr->reference.entity->kind != ENTITY_FUNCTION) {
7646 static void warn_reference_address_as_bool(expression_t const* expr)
7648 if (!warning.address)
7651 expr = get_reference_address(expr);
7653 warningf(&expr->base.source_position,
7654 "the address of '%Y' will always evaluate as 'true'",
7655 expr->reference.entity->base.symbol);
7659 static void warn_assignment_in_condition(const expression_t *const expr)
7661 if (!warning.parentheses)
7663 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7665 if (expr->base.parenthesized)
7667 warningf(&expr->base.source_position,
7668 "suggest parentheses around assignment used as truth value");
7671 static void semantic_condition(expression_t const *const expr,
7672 char const *const context)
7674 type_t *const type = skip_typeref(expr->base.type);
7675 if (is_type_scalar(type)) {
7676 warn_reference_address_as_bool(expr);
7677 warn_assignment_in_condition(expr);
7678 } else if (is_type_valid(type)) {
7679 errorf(&expr->base.source_position,
7680 "%s must have scalar type", context);
7685 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7687 * @param expression the conditional expression
7689 static expression_t *parse_conditional_expression(expression_t *expression)
7691 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7693 conditional_expression_t *conditional = &result->conditional;
7694 conditional->condition = expression;
7697 add_anchor_token(':');
7699 /* §6.5.15:2 The first operand shall have scalar type. */
7700 semantic_condition(expression, "condition of conditional operator");
7702 expression_t *true_expression = expression;
7703 bool gnu_cond = false;
7704 if (GNU_MODE && token.type == ':') {
7707 true_expression = parse_expression();
7709 rem_anchor_token(':');
7710 expect(':', end_error);
7712 expression_t *false_expression =
7713 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7715 type_t *const orig_true_type = true_expression->base.type;
7716 type_t *const orig_false_type = false_expression->base.type;
7717 type_t *const true_type = skip_typeref(orig_true_type);
7718 type_t *const false_type = skip_typeref(orig_false_type);
7721 type_t *result_type;
7722 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7723 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7724 /* ISO/IEC 14882:1998(E) §5.16:2 */
7725 if (true_expression->kind == EXPR_UNARY_THROW) {
7726 result_type = false_type;
7727 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7728 result_type = true_type;
7730 if (warning.other && (
7731 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7732 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7734 warningf(&conditional->base.source_position,
7735 "ISO C forbids conditional expression with only one void side");
7737 result_type = type_void;
7739 } else if (is_type_arithmetic(true_type)
7740 && is_type_arithmetic(false_type)) {
7741 result_type = semantic_arithmetic(true_type, false_type);
7742 } else if (same_compound_type(true_type, false_type)) {
7743 /* just take 1 of the 2 types */
7744 result_type = true_type;
7745 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7746 type_t *pointer_type;
7748 expression_t *other_expression;
7749 if (is_type_pointer(true_type) &&
7750 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7751 pointer_type = true_type;
7752 other_type = false_type;
7753 other_expression = false_expression;
7755 pointer_type = false_type;
7756 other_type = true_type;
7757 other_expression = true_expression;
7760 if (is_null_pointer_constant(other_expression)) {
7761 result_type = pointer_type;
7762 } else if (is_type_pointer(other_type)) {
7763 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7764 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7767 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7768 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7770 } else if (types_compatible(get_unqualified_type(to1),
7771 get_unqualified_type(to2))) {
7774 if (warning.other) {
7775 warningf(&conditional->base.source_position,
7776 "pointer types '%T' and '%T' in conditional expression are incompatible",
7777 true_type, false_type);
7782 type_t *const type =
7783 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7784 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7785 } else if (is_type_integer(other_type)) {
7786 if (warning.other) {
7787 warningf(&conditional->base.source_position,
7788 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7790 result_type = pointer_type;
7792 if (is_type_valid(other_type)) {
7793 type_error_incompatible("while parsing conditional",
7794 &expression->base.source_position, true_type, false_type);
7796 result_type = type_error_type;
7799 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7800 type_error_incompatible("while parsing conditional",
7801 &conditional->base.source_position, true_type,
7804 result_type = type_error_type;
7807 conditional->true_expression
7808 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7809 conditional->false_expression
7810 = create_implicit_cast(false_expression, result_type);
7811 conditional->base.type = result_type;
7816 * Parse an extension expression.
7818 static expression_t *parse_extension(void)
7820 eat(T___extension__);
7822 bool old_gcc_extension = in_gcc_extension;
7823 in_gcc_extension = true;
7824 expression_t *expression = parse_subexpression(PREC_UNARY);
7825 in_gcc_extension = old_gcc_extension;
7830 * Parse a __builtin_classify_type() expression.
7832 static expression_t *parse_builtin_classify_type(void)
7834 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7835 result->base.type = type_int;
7837 eat(T___builtin_classify_type);
7839 expect('(', end_error);
7840 add_anchor_token(')');
7841 expression_t *expression = parse_expression();
7842 rem_anchor_token(')');
7843 expect(')', end_error);
7844 result->classify_type.type_expression = expression;
7848 return create_invalid_expression();
7852 * Parse a delete expression
7853 * ISO/IEC 14882:1998(E) §5.3.5
7855 static expression_t *parse_delete(void)
7857 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7858 result->base.type = type_void;
7863 result->kind = EXPR_UNARY_DELETE_ARRAY;
7864 expect(']', end_error);
7868 expression_t *const value = parse_subexpression(PREC_CAST);
7869 result->unary.value = value;
7871 type_t *const type = skip_typeref(value->base.type);
7872 if (!is_type_pointer(type)) {
7873 if (is_type_valid(type)) {
7874 errorf(&value->base.source_position,
7875 "operand of delete must have pointer type");
7877 } else if (warning.other &&
7878 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7879 warningf(&value->base.source_position,
7880 "deleting 'void*' is undefined");
7887 * Parse a throw expression
7888 * ISO/IEC 14882:1998(E) §15:1
7890 static expression_t *parse_throw(void)
7892 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7893 result->base.type = type_void;
7897 expression_t *value = NULL;
7898 switch (token.type) {
7900 value = parse_assignment_expression();
7901 /* ISO/IEC 14882:1998(E) §15.1:3 */
7902 type_t *const orig_type = value->base.type;
7903 type_t *const type = skip_typeref(orig_type);
7904 if (is_type_incomplete(type)) {
7905 errorf(&value->base.source_position,
7906 "cannot throw object of incomplete type '%T'", orig_type);
7907 } else if (is_type_pointer(type)) {
7908 type_t *const points_to = skip_typeref(type->pointer.points_to);
7909 if (is_type_incomplete(points_to) &&
7910 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7911 errorf(&value->base.source_position,
7912 "cannot throw pointer to incomplete type '%T'", orig_type);
7920 result->unary.value = value;
7925 static bool check_pointer_arithmetic(const source_position_t *source_position,
7926 type_t *pointer_type,
7927 type_t *orig_pointer_type)
7929 type_t *points_to = pointer_type->pointer.points_to;
7930 points_to = skip_typeref(points_to);
7932 if (is_type_incomplete(points_to)) {
7933 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7934 errorf(source_position,
7935 "arithmetic with pointer to incomplete type '%T' not allowed",
7938 } else if (warning.pointer_arith) {
7939 warningf(source_position,
7940 "pointer of type '%T' used in arithmetic",
7943 } else if (is_type_function(points_to)) {
7945 errorf(source_position,
7946 "arithmetic with pointer to function type '%T' not allowed",
7949 } else if (warning.pointer_arith) {
7950 warningf(source_position,
7951 "pointer to a function '%T' used in arithmetic",
7958 static bool is_lvalue(const expression_t *expression)
7960 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7961 switch (expression->kind) {
7962 case EXPR_ARRAY_ACCESS:
7963 case EXPR_COMPOUND_LITERAL:
7964 case EXPR_REFERENCE:
7966 case EXPR_UNARY_DEREFERENCE:
7970 type_t *type = skip_typeref(expression->base.type);
7972 /* ISO/IEC 14882:1998(E) §3.10:3 */
7973 is_type_reference(type) ||
7974 /* Claim it is an lvalue, if the type is invalid. There was a parse
7975 * error before, which maybe prevented properly recognizing it as
7977 !is_type_valid(type);
7982 static void semantic_incdec(unary_expression_t *expression)
7984 type_t *const orig_type = expression->value->base.type;
7985 type_t *const type = skip_typeref(orig_type);
7986 if (is_type_pointer(type)) {
7987 if (!check_pointer_arithmetic(&expression->base.source_position,
7991 } else if (!is_type_real(type) && is_type_valid(type)) {
7992 /* TODO: improve error message */
7993 errorf(&expression->base.source_position,
7994 "operation needs an arithmetic or pointer type");
7997 if (!is_lvalue(expression->value)) {
7998 /* TODO: improve error message */
7999 errorf(&expression->base.source_position, "lvalue required as operand");
8001 expression->base.type = orig_type;
8004 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8006 type_t *const orig_type = expression->value->base.type;
8007 type_t *const type = skip_typeref(orig_type);
8008 if (!is_type_arithmetic(type)) {
8009 if (is_type_valid(type)) {
8010 /* TODO: improve error message */
8011 errorf(&expression->base.source_position,
8012 "operation needs an arithmetic type");
8017 expression->base.type = orig_type;
8020 static void semantic_unexpr_plus(unary_expression_t *expression)
8022 semantic_unexpr_arithmetic(expression);
8023 if (warning.traditional)
8024 warningf(&expression->base.source_position,
8025 "traditional C rejects the unary plus operator");
8028 static void semantic_not(unary_expression_t *expression)
8030 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8031 semantic_condition(expression->value, "operand of !");
8032 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8035 static void semantic_unexpr_integer(unary_expression_t *expression)
8037 type_t *const orig_type = expression->value->base.type;
8038 type_t *const type = skip_typeref(orig_type);
8039 if (!is_type_integer(type)) {
8040 if (is_type_valid(type)) {
8041 errorf(&expression->base.source_position,
8042 "operand of ~ must be of integer type");
8047 expression->base.type = orig_type;
8050 static void semantic_dereference(unary_expression_t *expression)
8052 type_t *const orig_type = expression->value->base.type;
8053 type_t *const type = skip_typeref(orig_type);
8054 if (!is_type_pointer(type)) {
8055 if (is_type_valid(type)) {
8056 errorf(&expression->base.source_position,
8057 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8062 type_t *result_type = type->pointer.points_to;
8063 result_type = automatic_type_conversion(result_type);
8064 expression->base.type = result_type;
8068 * Record that an address is taken (expression represents an lvalue).
8070 * @param expression the expression
8071 * @param may_be_register if true, the expression might be an register
8073 static void set_address_taken(expression_t *expression, bool may_be_register)
8075 if (expression->kind != EXPR_REFERENCE)
8078 entity_t *const entity = expression->reference.entity;
8080 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8083 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8084 && !may_be_register) {
8085 errorf(&expression->base.source_position,
8086 "address of register %s '%Y' requested",
8087 get_entity_kind_name(entity->kind), entity->base.symbol);
8090 if (entity->kind == ENTITY_VARIABLE) {
8091 entity->variable.address_taken = true;
8093 assert(entity->kind == ENTITY_PARAMETER);
8094 entity->parameter.address_taken = true;
8099 * Check the semantic of the address taken expression.
8101 static void semantic_take_addr(unary_expression_t *expression)
8103 expression_t *value = expression->value;
8104 value->base.type = revert_automatic_type_conversion(value);
8106 type_t *orig_type = value->base.type;
8107 type_t *type = skip_typeref(orig_type);
8108 if (!is_type_valid(type))
8112 if (!is_lvalue(value)) {
8113 errorf(&expression->base.source_position, "'&' requires an lvalue");
8115 if (type->kind == TYPE_BITFIELD) {
8116 errorf(&expression->base.source_position,
8117 "'&' not allowed on object with bitfield type '%T'",
8121 set_address_taken(value, false);
8123 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8126 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8127 static expression_t *parse_##unexpression_type(void) \
8129 expression_t *unary_expression \
8130 = allocate_expression_zero(unexpression_type); \
8132 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8134 sfunc(&unary_expression->unary); \
8136 return unary_expression; \
8139 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8140 semantic_unexpr_arithmetic)
8141 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8142 semantic_unexpr_plus)
8143 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8145 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8146 semantic_dereference)
8147 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8149 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8150 semantic_unexpr_integer)
8151 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8153 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8156 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8158 static expression_t *parse_##unexpression_type(expression_t *left) \
8160 expression_t *unary_expression \
8161 = allocate_expression_zero(unexpression_type); \
8163 unary_expression->unary.value = left; \
8165 sfunc(&unary_expression->unary); \
8167 return unary_expression; \
8170 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8171 EXPR_UNARY_POSTFIX_INCREMENT,
8173 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8174 EXPR_UNARY_POSTFIX_DECREMENT,
8177 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8179 /* TODO: handle complex + imaginary types */
8181 type_left = get_unqualified_type(type_left);
8182 type_right = get_unqualified_type(type_right);
8184 /* §6.3.1.8 Usual arithmetic conversions */
8185 if (type_left == type_long_double || type_right == type_long_double) {
8186 return type_long_double;
8187 } else if (type_left == type_double || type_right == type_double) {
8189 } else if (type_left == type_float || type_right == type_float) {
8193 type_left = promote_integer(type_left);
8194 type_right = promote_integer(type_right);
8196 if (type_left == type_right)
8199 bool const signed_left = is_type_signed(type_left);
8200 bool const signed_right = is_type_signed(type_right);
8201 int const rank_left = get_rank(type_left);
8202 int const rank_right = get_rank(type_right);
8204 if (signed_left == signed_right)
8205 return rank_left >= rank_right ? type_left : type_right;
8214 u_rank = rank_right;
8215 u_type = type_right;
8217 s_rank = rank_right;
8218 s_type = type_right;
8223 if (u_rank >= s_rank)
8226 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8228 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8229 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8233 case ATOMIC_TYPE_INT: return type_unsigned_int;
8234 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8235 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8237 default: panic("invalid atomic type");
8242 * Check the semantic restrictions for a binary expression.
8244 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8246 expression_t *const left = expression->left;
8247 expression_t *const right = expression->right;
8248 type_t *const orig_type_left = left->base.type;
8249 type_t *const orig_type_right = right->base.type;
8250 type_t *const type_left = skip_typeref(orig_type_left);
8251 type_t *const type_right = skip_typeref(orig_type_right);
8253 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8254 /* TODO: improve error message */
8255 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8256 errorf(&expression->base.source_position,
8257 "operation needs arithmetic types");
8262 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8263 expression->left = create_implicit_cast(left, arithmetic_type);
8264 expression->right = create_implicit_cast(right, arithmetic_type);
8265 expression->base.type = arithmetic_type;
8268 static void semantic_binexpr_integer(binary_expression_t *const expression)
8270 expression_t *const left = expression->left;
8271 expression_t *const right = expression->right;
8272 type_t *const orig_type_left = left->base.type;
8273 type_t *const orig_type_right = right->base.type;
8274 type_t *const type_left = skip_typeref(orig_type_left);
8275 type_t *const type_right = skip_typeref(orig_type_right);
8277 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8278 /* TODO: improve error message */
8279 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8280 errorf(&expression->base.source_position,
8281 "operation needs integer types");
8286 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8287 expression->left = create_implicit_cast(left, result_type);
8288 expression->right = create_implicit_cast(right, result_type);
8289 expression->base.type = result_type;
8292 static void warn_div_by_zero(binary_expression_t const *const expression)
8294 if (!warning.div_by_zero ||
8295 !is_type_integer(expression->base.type))
8298 expression_t const *const right = expression->right;
8299 /* The type of the right operand can be different for /= */
8300 if (is_type_integer(right->base.type) &&
8301 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8302 !fold_constant_to_bool(right)) {
8303 warningf(&expression->base.source_position, "division by zero");
8308 * Check the semantic restrictions for a div/mod expression.
8310 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8312 semantic_binexpr_arithmetic(expression);
8313 warn_div_by_zero(expression);
8316 static void warn_addsub_in_shift(const expression_t *const expr)
8318 if (expr->base.parenthesized)
8322 switch (expr->kind) {
8323 case EXPR_BINARY_ADD: op = '+'; break;
8324 case EXPR_BINARY_SUB: op = '-'; break;
8328 warningf(&expr->base.source_position,
8329 "suggest parentheses around '%c' inside shift", op);
8332 static bool semantic_shift(binary_expression_t *expression)
8334 expression_t *const left = expression->left;
8335 expression_t *const right = expression->right;
8336 type_t *const orig_type_left = left->base.type;
8337 type_t *const orig_type_right = right->base.type;
8338 type_t * type_left = skip_typeref(orig_type_left);
8339 type_t * type_right = skip_typeref(orig_type_right);
8341 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8342 /* TODO: improve error message */
8343 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8344 errorf(&expression->base.source_position,
8345 "operands of shift operation must have integer types");
8350 type_left = promote_integer(type_left);
8352 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8353 long count = fold_constant_to_int(right);
8355 warningf(&right->base.source_position,
8356 "shift count must be non-negative");
8357 } else if ((unsigned long)count >=
8358 get_atomic_type_size(type_left->atomic.akind) * 8) {
8359 warningf(&right->base.source_position,
8360 "shift count must be less than type width");
8364 type_right = promote_integer(type_right);
8365 expression->right = create_implicit_cast(right, type_right);
8370 static void semantic_shift_op(binary_expression_t *expression)
8372 expression_t *const left = expression->left;
8373 expression_t *const right = expression->right;
8375 if (!semantic_shift(expression))
8378 if (warning.parentheses) {
8379 warn_addsub_in_shift(left);
8380 warn_addsub_in_shift(right);
8383 type_t *const orig_type_left = left->base.type;
8384 type_t * type_left = skip_typeref(orig_type_left);
8386 type_left = promote_integer(type_left);
8387 expression->left = create_implicit_cast(left, type_left);
8388 expression->base.type = type_left;
8391 static void semantic_add(binary_expression_t *expression)
8393 expression_t *const left = expression->left;
8394 expression_t *const right = expression->right;
8395 type_t *const orig_type_left = left->base.type;
8396 type_t *const orig_type_right = right->base.type;
8397 type_t *const type_left = skip_typeref(orig_type_left);
8398 type_t *const type_right = skip_typeref(orig_type_right);
8401 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8402 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8403 expression->left = create_implicit_cast(left, arithmetic_type);
8404 expression->right = create_implicit_cast(right, arithmetic_type);
8405 expression->base.type = arithmetic_type;
8406 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8407 check_pointer_arithmetic(&expression->base.source_position,
8408 type_left, orig_type_left);
8409 expression->base.type = type_left;
8410 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8411 check_pointer_arithmetic(&expression->base.source_position,
8412 type_right, orig_type_right);
8413 expression->base.type = type_right;
8414 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8415 errorf(&expression->base.source_position,
8416 "invalid operands to binary + ('%T', '%T')",
8417 orig_type_left, orig_type_right);
8421 static void semantic_sub(binary_expression_t *expression)
8423 expression_t *const left = expression->left;
8424 expression_t *const right = expression->right;
8425 type_t *const orig_type_left = left->base.type;
8426 type_t *const orig_type_right = right->base.type;
8427 type_t *const type_left = skip_typeref(orig_type_left);
8428 type_t *const type_right = skip_typeref(orig_type_right);
8429 source_position_t const *const pos = &expression->base.source_position;
8432 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8433 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8434 expression->left = create_implicit_cast(left, arithmetic_type);
8435 expression->right = create_implicit_cast(right, arithmetic_type);
8436 expression->base.type = arithmetic_type;
8437 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8438 check_pointer_arithmetic(&expression->base.source_position,
8439 type_left, orig_type_left);
8440 expression->base.type = type_left;
8441 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8442 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8443 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8444 if (!types_compatible(unqual_left, unqual_right)) {
8446 "subtracting pointers to incompatible types '%T' and '%T'",
8447 orig_type_left, orig_type_right);
8448 } else if (!is_type_object(unqual_left)) {
8449 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8450 errorf(pos, "subtracting pointers to non-object types '%T'",
8452 } else if (warning.other) {
8453 warningf(pos, "subtracting pointers to void");
8456 expression->base.type = type_ptrdiff_t;
8457 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8458 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8459 orig_type_left, orig_type_right);
8463 static void warn_string_literal_address(expression_t const* expr)
8465 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8466 expr = expr->unary.value;
8467 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8469 expr = expr->unary.value;
8472 if (expr->kind == EXPR_STRING_LITERAL
8473 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8474 warningf(&expr->base.source_position,
8475 "comparison with string literal results in unspecified behaviour");
8479 static void warn_comparison_in_comparison(const expression_t *const expr)
8481 if (expr->base.parenthesized)
8483 switch (expr->base.kind) {
8484 case EXPR_BINARY_LESS:
8485 case EXPR_BINARY_GREATER:
8486 case EXPR_BINARY_LESSEQUAL:
8487 case EXPR_BINARY_GREATEREQUAL:
8488 case EXPR_BINARY_NOTEQUAL:
8489 case EXPR_BINARY_EQUAL:
8490 warningf(&expr->base.source_position,
8491 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8498 static bool maybe_negative(expression_t const *const expr)
8500 switch (is_constant_expression(expr)) {
8501 case EXPR_CLASS_ERROR: return false;
8502 case EXPR_CLASS_CONSTANT: return fold_constant_to_int(expr) < 0;
8503 default: return true;
8508 * Check the semantics of comparison expressions.
8510 * @param expression The expression to check.
8512 static void semantic_comparison(binary_expression_t *expression)
8514 expression_t *left = expression->left;
8515 expression_t *right = expression->right;
8517 if (warning.address) {
8518 warn_string_literal_address(left);
8519 warn_string_literal_address(right);
8521 expression_t const* const func_left = get_reference_address(left);
8522 if (func_left != NULL && is_null_pointer_constant(right)) {
8523 warningf(&expression->base.source_position,
8524 "the address of '%Y' will never be NULL",
8525 func_left->reference.entity->base.symbol);
8528 expression_t const* const func_right = get_reference_address(right);
8529 if (func_right != NULL && is_null_pointer_constant(right)) {
8530 warningf(&expression->base.source_position,
8531 "the address of '%Y' will never be NULL",
8532 func_right->reference.entity->base.symbol);
8536 if (warning.parentheses) {
8537 warn_comparison_in_comparison(left);
8538 warn_comparison_in_comparison(right);
8541 type_t *orig_type_left = left->base.type;
8542 type_t *orig_type_right = right->base.type;
8543 type_t *type_left = skip_typeref(orig_type_left);
8544 type_t *type_right = skip_typeref(orig_type_right);
8546 /* TODO non-arithmetic types */
8547 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8548 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8550 /* test for signed vs unsigned compares */
8551 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8552 bool const signed_left = is_type_signed(type_left);
8553 bool const signed_right = is_type_signed(type_right);
8554 if (signed_left != signed_right) {
8555 /* FIXME long long needs better const folding magic */
8556 /* TODO check whether constant value can be represented by other type */
8557 if ((signed_left && maybe_negative(left)) ||
8558 (signed_right && maybe_negative(right))) {
8559 warningf(&expression->base.source_position,
8560 "comparison between signed and unsigned");
8565 expression->left = create_implicit_cast(left, arithmetic_type);
8566 expression->right = create_implicit_cast(right, arithmetic_type);
8567 expression->base.type = arithmetic_type;
8568 if (warning.float_equal &&
8569 (expression->base.kind == EXPR_BINARY_EQUAL ||
8570 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8571 is_type_float(arithmetic_type)) {
8572 warningf(&expression->base.source_position,
8573 "comparing floating point with == or != is unsafe");
8575 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8576 /* TODO check compatibility */
8577 } else if (is_type_pointer(type_left)) {
8578 expression->right = create_implicit_cast(right, type_left);
8579 } else if (is_type_pointer(type_right)) {
8580 expression->left = create_implicit_cast(left, type_right);
8581 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8582 type_error_incompatible("invalid operands in comparison",
8583 &expression->base.source_position,
8584 type_left, type_right);
8586 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8590 * Checks if a compound type has constant fields.
8592 static bool has_const_fields(const compound_type_t *type)
8594 compound_t *compound = type->compound;
8595 entity_t *entry = compound->members.entities;
8597 for (; entry != NULL; entry = entry->base.next) {
8598 if (!is_declaration(entry))
8601 const type_t *decl_type = skip_typeref(entry->declaration.type);
8602 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8609 static bool is_valid_assignment_lhs(expression_t const* const left)
8611 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8612 type_t *const type_left = skip_typeref(orig_type_left);
8614 if (!is_lvalue(left)) {
8615 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8620 if (left->kind == EXPR_REFERENCE
8621 && left->reference.entity->kind == ENTITY_FUNCTION) {
8622 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8626 if (is_type_array(type_left)) {
8627 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8630 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8631 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8635 if (is_type_incomplete(type_left)) {
8636 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8637 left, orig_type_left);
8640 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8641 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8642 left, orig_type_left);
8649 static void semantic_arithmetic_assign(binary_expression_t *expression)
8651 expression_t *left = expression->left;
8652 expression_t *right = expression->right;
8653 type_t *orig_type_left = left->base.type;
8654 type_t *orig_type_right = right->base.type;
8656 if (!is_valid_assignment_lhs(left))
8659 type_t *type_left = skip_typeref(orig_type_left);
8660 type_t *type_right = skip_typeref(orig_type_right);
8662 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8663 /* TODO: improve error message */
8664 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8665 errorf(&expression->base.source_position,
8666 "operation needs arithmetic types");
8671 /* combined instructions are tricky. We can't create an implicit cast on
8672 * the left side, because we need the uncasted form for the store.
8673 * The ast2firm pass has to know that left_type must be right_type
8674 * for the arithmetic operation and create a cast by itself */
8675 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8676 expression->right = create_implicit_cast(right, arithmetic_type);
8677 expression->base.type = type_left;
8680 static void semantic_divmod_assign(binary_expression_t *expression)
8682 semantic_arithmetic_assign(expression);
8683 warn_div_by_zero(expression);
8686 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8688 expression_t *const left = expression->left;
8689 expression_t *const right = expression->right;
8690 type_t *const orig_type_left = left->base.type;
8691 type_t *const orig_type_right = right->base.type;
8692 type_t *const type_left = skip_typeref(orig_type_left);
8693 type_t *const type_right = skip_typeref(orig_type_right);
8695 if (!is_valid_assignment_lhs(left))
8698 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8699 /* combined instructions are tricky. We can't create an implicit cast on
8700 * the left side, because we need the uncasted form for the store.
8701 * The ast2firm pass has to know that left_type must be right_type
8702 * for the arithmetic operation and create a cast by itself */
8703 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8704 expression->right = create_implicit_cast(right, arithmetic_type);
8705 expression->base.type = type_left;
8706 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8707 check_pointer_arithmetic(&expression->base.source_position,
8708 type_left, orig_type_left);
8709 expression->base.type = type_left;
8710 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8711 errorf(&expression->base.source_position,
8712 "incompatible types '%T' and '%T' in assignment",
8713 orig_type_left, orig_type_right);
8717 static void semantic_integer_assign(binary_expression_t *expression)
8719 expression_t *left = expression->left;
8720 expression_t *right = expression->right;
8721 type_t *orig_type_left = left->base.type;
8722 type_t *orig_type_right = right->base.type;
8724 if (!is_valid_assignment_lhs(left))
8727 type_t *type_left = skip_typeref(orig_type_left);
8728 type_t *type_right = skip_typeref(orig_type_right);
8730 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8731 /* TODO: improve error message */
8732 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8733 errorf(&expression->base.source_position,
8734 "operation needs integer types");
8739 /* combined instructions are tricky. We can't create an implicit cast on
8740 * the left side, because we need the uncasted form for the store.
8741 * The ast2firm pass has to know that left_type must be right_type
8742 * for the arithmetic operation and create a cast by itself */
8743 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8744 expression->right = create_implicit_cast(right, arithmetic_type);
8745 expression->base.type = type_left;
8748 static void semantic_shift_assign(binary_expression_t *expression)
8750 expression_t *left = expression->left;
8752 if (!is_valid_assignment_lhs(left))
8755 if (!semantic_shift(expression))
8758 expression->base.type = skip_typeref(left->base.type);
8761 static void warn_logical_and_within_or(const expression_t *const expr)
8763 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8765 if (expr->base.parenthesized)
8767 warningf(&expr->base.source_position,
8768 "suggest parentheses around && within ||");
8772 * Check the semantic restrictions of a logical expression.
8774 static void semantic_logical_op(binary_expression_t *expression)
8776 /* §6.5.13:2 Each of the operands shall have scalar type.
8777 * §6.5.14:2 Each of the operands shall have scalar type. */
8778 semantic_condition(expression->left, "left operand of logical operator");
8779 semantic_condition(expression->right, "right operand of logical operator");
8780 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8781 warning.parentheses) {
8782 warn_logical_and_within_or(expression->left);
8783 warn_logical_and_within_or(expression->right);
8785 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8789 * Check the semantic restrictions of a binary assign expression.
8791 static void semantic_binexpr_assign(binary_expression_t *expression)
8793 expression_t *left = expression->left;
8794 type_t *orig_type_left = left->base.type;
8796 if (!is_valid_assignment_lhs(left))
8799 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8800 report_assign_error(error, orig_type_left, expression->right,
8801 "assignment", &left->base.source_position);
8802 expression->right = create_implicit_cast(expression->right, orig_type_left);
8803 expression->base.type = orig_type_left;
8807 * Determine if the outermost operation (or parts thereof) of the given
8808 * expression has no effect in order to generate a warning about this fact.
8809 * Therefore in some cases this only examines some of the operands of the
8810 * expression (see comments in the function and examples below).
8812 * f() + 23; // warning, because + has no effect
8813 * x || f(); // no warning, because x controls execution of f()
8814 * x ? y : f(); // warning, because y has no effect
8815 * (void)x; // no warning to be able to suppress the warning
8816 * This function can NOT be used for an "expression has definitely no effect"-
8818 static bool expression_has_effect(const expression_t *const expr)
8820 switch (expr->kind) {
8821 case EXPR_UNKNOWN: break;
8822 case EXPR_INVALID: return true; /* do NOT warn */
8823 case EXPR_REFERENCE: return false;
8824 case EXPR_REFERENCE_ENUM_VALUE: return false;
8825 case EXPR_LABEL_ADDRESS: return false;
8827 /* suppress the warning for microsoft __noop operations */
8828 case EXPR_LITERAL_MS_NOOP: return true;
8829 case EXPR_LITERAL_BOOLEAN:
8830 case EXPR_LITERAL_CHARACTER:
8831 case EXPR_LITERAL_WIDE_CHARACTER:
8832 case EXPR_LITERAL_INTEGER:
8833 case EXPR_LITERAL_INTEGER_OCTAL:
8834 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8835 case EXPR_LITERAL_FLOATINGPOINT:
8836 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8837 case EXPR_STRING_LITERAL: return false;
8838 case EXPR_WIDE_STRING_LITERAL: return false;
8841 const call_expression_t *const call = &expr->call;
8842 if (call->function->kind != EXPR_REFERENCE)
8845 switch (call->function->reference.entity->function.btk) {
8846 /* FIXME: which builtins have no effect? */
8847 default: return true;
8851 /* Generate the warning if either the left or right hand side of a
8852 * conditional expression has no effect */
8853 case EXPR_CONDITIONAL: {
8854 conditional_expression_t const *const cond = &expr->conditional;
8855 expression_t const *const t = cond->true_expression;
8857 (t == NULL || expression_has_effect(t)) &&
8858 expression_has_effect(cond->false_expression);
8861 case EXPR_SELECT: return false;
8862 case EXPR_ARRAY_ACCESS: return false;
8863 case EXPR_SIZEOF: return false;
8864 case EXPR_CLASSIFY_TYPE: return false;
8865 case EXPR_ALIGNOF: return false;
8867 case EXPR_FUNCNAME: return false;
8868 case EXPR_BUILTIN_CONSTANT_P: return false;
8869 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8870 case EXPR_OFFSETOF: return false;
8871 case EXPR_VA_START: return true;
8872 case EXPR_VA_ARG: return true;
8873 case EXPR_VA_COPY: return true;
8874 case EXPR_STATEMENT: return true; // TODO
8875 case EXPR_COMPOUND_LITERAL: return false;
8877 case EXPR_UNARY_NEGATE: return false;
8878 case EXPR_UNARY_PLUS: return false;
8879 case EXPR_UNARY_BITWISE_NEGATE: return false;
8880 case EXPR_UNARY_NOT: return false;
8881 case EXPR_UNARY_DEREFERENCE: return false;
8882 case EXPR_UNARY_TAKE_ADDRESS: return false;
8883 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8884 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8885 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8886 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8888 /* Treat void casts as if they have an effect in order to being able to
8889 * suppress the warning */
8890 case EXPR_UNARY_CAST: {
8891 type_t *const type = skip_typeref(expr->base.type);
8892 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8895 case EXPR_UNARY_CAST_IMPLICIT: return true;
8896 case EXPR_UNARY_ASSUME: return true;
8897 case EXPR_UNARY_DELETE: return true;
8898 case EXPR_UNARY_DELETE_ARRAY: return true;
8899 case EXPR_UNARY_THROW: return true;
8901 case EXPR_BINARY_ADD: return false;
8902 case EXPR_BINARY_SUB: return false;
8903 case EXPR_BINARY_MUL: return false;
8904 case EXPR_BINARY_DIV: return false;
8905 case EXPR_BINARY_MOD: return false;
8906 case EXPR_BINARY_EQUAL: return false;
8907 case EXPR_BINARY_NOTEQUAL: return false;
8908 case EXPR_BINARY_LESS: return false;
8909 case EXPR_BINARY_LESSEQUAL: return false;
8910 case EXPR_BINARY_GREATER: return false;
8911 case EXPR_BINARY_GREATEREQUAL: return false;
8912 case EXPR_BINARY_BITWISE_AND: return false;
8913 case EXPR_BINARY_BITWISE_OR: return false;
8914 case EXPR_BINARY_BITWISE_XOR: return false;
8915 case EXPR_BINARY_SHIFTLEFT: return false;
8916 case EXPR_BINARY_SHIFTRIGHT: return false;
8917 case EXPR_BINARY_ASSIGN: return true;
8918 case EXPR_BINARY_MUL_ASSIGN: return true;
8919 case EXPR_BINARY_DIV_ASSIGN: return true;
8920 case EXPR_BINARY_MOD_ASSIGN: return true;
8921 case EXPR_BINARY_ADD_ASSIGN: return true;
8922 case EXPR_BINARY_SUB_ASSIGN: return true;
8923 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8924 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8925 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8926 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8927 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8929 /* Only examine the right hand side of && and ||, because the left hand
8930 * side already has the effect of controlling the execution of the right
8932 case EXPR_BINARY_LOGICAL_AND:
8933 case EXPR_BINARY_LOGICAL_OR:
8934 /* Only examine the right hand side of a comma expression, because the left
8935 * hand side has a separate warning */
8936 case EXPR_BINARY_COMMA:
8937 return expression_has_effect(expr->binary.right);
8939 case EXPR_BINARY_ISGREATER: return false;
8940 case EXPR_BINARY_ISGREATEREQUAL: return false;
8941 case EXPR_BINARY_ISLESS: return false;
8942 case EXPR_BINARY_ISLESSEQUAL: return false;
8943 case EXPR_BINARY_ISLESSGREATER: return false;
8944 case EXPR_BINARY_ISUNORDERED: return false;
8947 internal_errorf(HERE, "unexpected expression");
8950 static void semantic_comma(binary_expression_t *expression)
8952 if (warning.unused_value) {
8953 const expression_t *const left = expression->left;
8954 if (!expression_has_effect(left)) {
8955 warningf(&left->base.source_position,
8956 "left-hand operand of comma expression has no effect");
8959 expression->base.type = expression->right->base.type;
8963 * @param prec_r precedence of the right operand
8965 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8966 static expression_t *parse_##binexpression_type(expression_t *left) \
8968 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8969 binexpr->binary.left = left; \
8972 expression_t *right = parse_subexpression(prec_r); \
8974 binexpr->binary.right = right; \
8975 sfunc(&binexpr->binary); \
8980 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8981 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8982 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8983 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8984 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8985 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8986 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8987 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8988 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8989 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8990 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8991 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8992 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8993 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8994 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8995 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8996 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8997 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8998 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8999 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9000 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9001 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9002 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9003 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9004 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9005 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9006 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9007 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9008 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9009 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9012 static expression_t *parse_subexpression(precedence_t precedence)
9014 if (token.type < 0) {
9015 return expected_expression_error();
9018 expression_parser_function_t *parser
9019 = &expression_parsers[token.type];
9020 source_position_t source_position = token.source_position;
9023 if (parser->parser != NULL) {
9024 left = parser->parser();
9026 left = parse_primary_expression();
9028 assert(left != NULL);
9029 left->base.source_position = source_position;
9032 if (token.type < 0) {
9033 return expected_expression_error();
9036 parser = &expression_parsers[token.type];
9037 if (parser->infix_parser == NULL)
9039 if (parser->infix_precedence < precedence)
9042 left = parser->infix_parser(left);
9044 assert(left != NULL);
9045 assert(left->kind != EXPR_UNKNOWN);
9046 left->base.source_position = source_position;
9053 * Parse an expression.
9055 static expression_t *parse_expression(void)
9057 return parse_subexpression(PREC_EXPRESSION);
9061 * Register a parser for a prefix-like operator.
9063 * @param parser the parser function
9064 * @param token_type the token type of the prefix token
9066 static void register_expression_parser(parse_expression_function parser,
9069 expression_parser_function_t *entry = &expression_parsers[token_type];
9071 if (entry->parser != NULL) {
9072 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9073 panic("trying to register multiple expression parsers for a token");
9075 entry->parser = parser;
9079 * Register a parser for an infix operator with given precedence.
9081 * @param parser the parser function
9082 * @param token_type the token type of the infix operator
9083 * @param precedence the precedence of the operator
9085 static void register_infix_parser(parse_expression_infix_function parser,
9086 int token_type, precedence_t precedence)
9088 expression_parser_function_t *entry = &expression_parsers[token_type];
9090 if (entry->infix_parser != NULL) {
9091 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9092 panic("trying to register multiple infix expression parsers for a "
9095 entry->infix_parser = parser;
9096 entry->infix_precedence = precedence;
9100 * Initialize the expression parsers.
9102 static void init_expression_parsers(void)
9104 memset(&expression_parsers, 0, sizeof(expression_parsers));
9106 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9107 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9108 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9109 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9110 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9111 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9112 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9113 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9114 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9115 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9116 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9117 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9118 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9119 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9120 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9121 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9122 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9123 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9124 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9125 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9126 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9127 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9128 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9129 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9130 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9131 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9132 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9133 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9134 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9135 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9136 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9137 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9138 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9139 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9140 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9141 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9142 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9144 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9145 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9146 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9147 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9148 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9149 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9150 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9151 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9152 register_expression_parser(parse_sizeof, T_sizeof);
9153 register_expression_parser(parse_alignof, T___alignof__);
9154 register_expression_parser(parse_extension, T___extension__);
9155 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9156 register_expression_parser(parse_delete, T_delete);
9157 register_expression_parser(parse_throw, T_throw);
9161 * Parse a asm statement arguments specification.
9163 static asm_argument_t *parse_asm_arguments(bool is_out)
9165 asm_argument_t *result = NULL;
9166 asm_argument_t **anchor = &result;
9168 while (token.type == T_STRING_LITERAL || token.type == '[') {
9169 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9170 memset(argument, 0, sizeof(argument[0]));
9173 if (token.type != T_IDENTIFIER) {
9174 parse_error_expected("while parsing asm argument",
9175 T_IDENTIFIER, NULL);
9178 argument->symbol = token.symbol;
9180 expect(']', end_error);
9183 argument->constraints = parse_string_literals();
9184 expect('(', end_error);
9185 add_anchor_token(')');
9186 expression_t *expression = parse_expression();
9187 rem_anchor_token(')');
9189 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9190 * change size or type representation (e.g. int -> long is ok, but
9191 * int -> float is not) */
9192 if (expression->kind == EXPR_UNARY_CAST) {
9193 type_t *const type = expression->base.type;
9194 type_kind_t const kind = type->kind;
9195 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9198 if (kind == TYPE_ATOMIC) {
9199 atomic_type_kind_t const akind = type->atomic.akind;
9200 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9201 size = get_atomic_type_size(akind);
9203 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9204 size = get_atomic_type_size(get_intptr_kind());
9208 expression_t *const value = expression->unary.value;
9209 type_t *const value_type = value->base.type;
9210 type_kind_t const value_kind = value_type->kind;
9212 unsigned value_flags;
9213 unsigned value_size;
9214 if (value_kind == TYPE_ATOMIC) {
9215 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9216 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9217 value_size = get_atomic_type_size(value_akind);
9218 } else if (value_kind == TYPE_POINTER) {
9219 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9220 value_size = get_atomic_type_size(get_intptr_kind());
9225 if (value_flags != flags || value_size != size)
9229 } while (expression->kind == EXPR_UNARY_CAST);
9233 if (!is_lvalue(expression)) {
9234 errorf(&expression->base.source_position,
9235 "asm output argument is not an lvalue");
9238 if (argument->constraints.begin[0] == '=')
9239 determine_lhs_ent(expression, NULL);
9241 mark_vars_read(expression, NULL);
9243 mark_vars_read(expression, NULL);
9245 argument->expression = expression;
9246 expect(')', end_error);
9248 set_address_taken(expression, true);
9251 anchor = &argument->next;
9263 * Parse a asm statement clobber specification.
9265 static asm_clobber_t *parse_asm_clobbers(void)
9267 asm_clobber_t *result = NULL;
9268 asm_clobber_t **anchor = &result;
9270 while (token.type == T_STRING_LITERAL) {
9271 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9272 clobber->clobber = parse_string_literals();
9275 anchor = &clobber->next;
9285 * Parse an asm statement.
9287 static statement_t *parse_asm_statement(void)
9289 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9290 asm_statement_t *asm_statement = &statement->asms;
9294 if (next_if(T_volatile))
9295 asm_statement->is_volatile = true;
9297 expect('(', end_error);
9298 add_anchor_token(')');
9299 if (token.type != T_STRING_LITERAL) {
9300 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9303 asm_statement->asm_text = parse_string_literals();
9305 add_anchor_token(':');
9306 if (!next_if(':')) {
9307 rem_anchor_token(':');
9311 asm_statement->outputs = parse_asm_arguments(true);
9312 if (!next_if(':')) {
9313 rem_anchor_token(':');
9317 asm_statement->inputs = parse_asm_arguments(false);
9318 if (!next_if(':')) {
9319 rem_anchor_token(':');
9322 rem_anchor_token(':');
9324 asm_statement->clobbers = parse_asm_clobbers();
9327 rem_anchor_token(')');
9328 expect(')', end_error);
9329 expect(';', end_error);
9331 if (asm_statement->outputs == NULL) {
9332 /* GCC: An 'asm' instruction without any output operands will be treated
9333 * identically to a volatile 'asm' instruction. */
9334 asm_statement->is_volatile = true;
9339 return create_invalid_statement();
9342 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9344 statement_t *inner_stmt;
9345 switch (token.type) {
9347 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9348 inner_stmt = create_invalid_statement();
9352 if (label->kind == STATEMENT_LABEL) {
9353 /* Eat an empty statement here, to avoid the warning about an empty
9354 * statement after a label. label:; is commonly used to have a label
9355 * before a closing brace. */
9356 inner_stmt = create_empty_statement();
9363 inner_stmt = parse_statement();
9364 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9365 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9366 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9374 * Parse a case statement.
9376 static statement_t *parse_case_statement(void)
9378 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9379 source_position_t *const pos = &statement->base.source_position;
9383 expression_t *const expression = parse_expression();
9384 statement->case_label.expression = expression;
9385 expression_classification_t const expr_class = is_constant_expression(expression);
9386 if (expr_class != EXPR_CLASS_CONSTANT) {
9387 if (expr_class != EXPR_CLASS_ERROR) {
9388 errorf(pos, "case label does not reduce to an integer constant");
9390 statement->case_label.is_bad = true;
9392 long const val = fold_constant_to_int(expression);
9393 statement->case_label.first_case = val;
9394 statement->case_label.last_case = val;
9398 if (next_if(T_DOTDOTDOT)) {
9399 expression_t *const end_range = parse_expression();
9400 statement->case_label.end_range = end_range;
9401 expression_classification_t const end_class = is_constant_expression(end_range);
9402 if (end_class != EXPR_CLASS_CONSTANT) {
9403 if (end_class != EXPR_CLASS_ERROR) {
9404 errorf(pos, "case range does not reduce to an integer constant");
9406 statement->case_label.is_bad = true;
9408 long const val = fold_constant_to_int(end_range);
9409 statement->case_label.last_case = val;
9411 if (warning.other && val < statement->case_label.first_case) {
9412 statement->case_label.is_empty_range = true;
9413 warningf(pos, "empty range specified");
9419 PUSH_PARENT(statement);
9421 expect(':', end_error);
9424 if (current_switch != NULL) {
9425 if (! statement->case_label.is_bad) {
9426 /* Check for duplicate case values */
9427 case_label_statement_t *c = &statement->case_label;
9428 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9429 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9432 if (c->last_case < l->first_case || c->first_case > l->last_case)
9435 errorf(pos, "duplicate case value (previously used %P)",
9436 &l->base.source_position);
9440 /* link all cases into the switch statement */
9441 if (current_switch->last_case == NULL) {
9442 current_switch->first_case = &statement->case_label;
9444 current_switch->last_case->next = &statement->case_label;
9446 current_switch->last_case = &statement->case_label;
9448 errorf(pos, "case label not within a switch statement");
9451 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9458 * Parse a default statement.
9460 static statement_t *parse_default_statement(void)
9462 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9466 PUSH_PARENT(statement);
9468 expect(':', end_error);
9471 if (current_switch != NULL) {
9472 const case_label_statement_t *def_label = current_switch->default_label;
9473 if (def_label != NULL) {
9474 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9475 &def_label->base.source_position);
9477 current_switch->default_label = &statement->case_label;
9479 /* link all cases into the switch statement */
9480 if (current_switch->last_case == NULL) {
9481 current_switch->first_case = &statement->case_label;
9483 current_switch->last_case->next = &statement->case_label;
9485 current_switch->last_case = &statement->case_label;
9488 errorf(&statement->base.source_position,
9489 "'default' label not within a switch statement");
9492 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9499 * Parse a label statement.
9501 static statement_t *parse_label_statement(void)
9503 assert(token.type == T_IDENTIFIER);
9504 symbol_t *symbol = token.symbol;
9505 label_t *label = get_label(symbol);
9507 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9508 statement->label.label = label;
9512 PUSH_PARENT(statement);
9514 /* if statement is already set then the label is defined twice,
9515 * otherwise it was just mentioned in a goto/local label declaration so far
9517 if (label->statement != NULL) {
9518 errorf(HERE, "duplicate label '%Y' (declared %P)",
9519 symbol, &label->base.source_position);
9521 label->base.source_position = token.source_position;
9522 label->statement = statement;
9527 statement->label.statement = parse_label_inner_statement(statement, "label");
9529 /* remember the labels in a list for later checking */
9530 *label_anchor = &statement->label;
9531 label_anchor = &statement->label.next;
9538 * Parse an if statement.
9540 static statement_t *parse_if(void)
9542 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9546 PUSH_PARENT(statement);
9548 add_anchor_token('{');
9550 expect('(', end_error);
9551 add_anchor_token(')');
9552 expression_t *const expr = parse_expression();
9553 statement->ifs.condition = expr;
9554 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9556 semantic_condition(expr, "condition of 'if'-statment");
9557 mark_vars_read(expr, NULL);
9558 rem_anchor_token(')');
9559 expect(')', end_error);
9562 rem_anchor_token('{');
9564 add_anchor_token(T_else);
9565 statement_t *const true_stmt = parse_statement();
9566 statement->ifs.true_statement = true_stmt;
9567 rem_anchor_token(T_else);
9569 if (next_if(T_else)) {
9570 statement->ifs.false_statement = parse_statement();
9571 } else if (warning.parentheses &&
9572 true_stmt->kind == STATEMENT_IF &&
9573 true_stmt->ifs.false_statement != NULL) {
9574 warningf(&true_stmt->base.source_position,
9575 "suggest explicit braces to avoid ambiguous 'else'");
9583 * Check that all enums are handled in a switch.
9585 * @param statement the switch statement to check
9587 static void check_enum_cases(const switch_statement_t *statement)
9589 const type_t *type = skip_typeref(statement->expression->base.type);
9590 if (! is_type_enum(type))
9592 const enum_type_t *enumt = &type->enumt;
9594 /* if we have a default, no warnings */
9595 if (statement->default_label != NULL)
9598 /* FIXME: calculation of value should be done while parsing */
9599 /* TODO: quadratic algorithm here. Change to an n log n one */
9600 long last_value = -1;
9601 const entity_t *entry = enumt->enume->base.next;
9602 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9603 entry = entry->base.next) {
9604 const expression_t *expression = entry->enum_value.value;
9605 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9607 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9608 if (l->expression == NULL)
9610 if (l->first_case <= value && value <= l->last_case) {
9616 warningf(&statement->base.source_position,
9617 "enumeration value '%Y' not handled in switch",
9618 entry->base.symbol);
9625 * Parse a switch statement.
9627 static statement_t *parse_switch(void)
9629 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9633 PUSH_PARENT(statement);
9635 expect('(', end_error);
9636 add_anchor_token(')');
9637 expression_t *const expr = parse_expression();
9638 mark_vars_read(expr, NULL);
9639 type_t * type = skip_typeref(expr->base.type);
9640 if (is_type_integer(type)) {
9641 type = promote_integer(type);
9642 if (warning.traditional) {
9643 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9644 warningf(&expr->base.source_position,
9645 "'%T' switch expression not converted to '%T' in ISO C",
9649 } else if (is_type_valid(type)) {
9650 errorf(&expr->base.source_position,
9651 "switch quantity is not an integer, but '%T'", type);
9652 type = type_error_type;
9654 statement->switchs.expression = create_implicit_cast(expr, type);
9655 expect(')', end_error);
9656 rem_anchor_token(')');
9658 switch_statement_t *rem = current_switch;
9659 current_switch = &statement->switchs;
9660 statement->switchs.body = parse_statement();
9661 current_switch = rem;
9663 if (warning.switch_default &&
9664 statement->switchs.default_label == NULL) {
9665 warningf(&statement->base.source_position, "switch has no default case");
9667 if (warning.switch_enum)
9668 check_enum_cases(&statement->switchs);
9674 return create_invalid_statement();
9677 static statement_t *parse_loop_body(statement_t *const loop)
9679 statement_t *const rem = current_loop;
9680 current_loop = loop;
9682 statement_t *const body = parse_statement();
9689 * Parse a while statement.
9691 static statement_t *parse_while(void)
9693 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9697 PUSH_PARENT(statement);
9699 expect('(', end_error);
9700 add_anchor_token(')');
9701 expression_t *const cond = parse_expression();
9702 statement->whiles.condition = cond;
9703 /* §6.8.5:2 The controlling expression of an iteration statement shall
9704 * have scalar type. */
9705 semantic_condition(cond, "condition of 'while'-statement");
9706 mark_vars_read(cond, NULL);
9707 rem_anchor_token(')');
9708 expect(')', end_error);
9710 statement->whiles.body = parse_loop_body(statement);
9716 return create_invalid_statement();
9720 * Parse a do statement.
9722 static statement_t *parse_do(void)
9724 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9728 PUSH_PARENT(statement);
9730 add_anchor_token(T_while);
9731 statement->do_while.body = parse_loop_body(statement);
9732 rem_anchor_token(T_while);
9734 expect(T_while, end_error);
9735 expect('(', end_error);
9736 add_anchor_token(')');
9737 expression_t *const cond = parse_expression();
9738 statement->do_while.condition = cond;
9739 /* §6.8.5:2 The controlling expression of an iteration statement shall
9740 * have scalar type. */
9741 semantic_condition(cond, "condition of 'do-while'-statement");
9742 mark_vars_read(cond, NULL);
9743 rem_anchor_token(')');
9744 expect(')', end_error);
9745 expect(';', end_error);
9751 return create_invalid_statement();
9755 * Parse a for statement.
9757 static statement_t *parse_for(void)
9759 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9763 expect('(', end_error1);
9764 add_anchor_token(')');
9766 PUSH_PARENT(statement);
9768 size_t const top = environment_top();
9769 scope_t *old_scope = scope_push(&statement->fors.scope);
9771 bool old_gcc_extension = in_gcc_extension;
9772 while (next_if(T___extension__)) {
9773 in_gcc_extension = true;
9777 } else if (is_declaration_specifier(&token, false)) {
9778 parse_declaration(record_entity, DECL_FLAGS_NONE);
9780 add_anchor_token(';');
9781 expression_t *const init = parse_expression();
9782 statement->fors.initialisation = init;
9783 mark_vars_read(init, ENT_ANY);
9784 if (warning.unused_value && !expression_has_effect(init)) {
9785 warningf(&init->base.source_position,
9786 "initialisation of 'for'-statement has no effect");
9788 rem_anchor_token(';');
9789 expect(';', end_error2);
9791 in_gcc_extension = old_gcc_extension;
9793 if (token.type != ';') {
9794 add_anchor_token(';');
9795 expression_t *const cond = parse_expression();
9796 statement->fors.condition = cond;
9797 /* §6.8.5:2 The controlling expression of an iteration statement
9798 * shall have scalar type. */
9799 semantic_condition(cond, "condition of 'for'-statement");
9800 mark_vars_read(cond, NULL);
9801 rem_anchor_token(';');
9803 expect(';', end_error2);
9804 if (token.type != ')') {
9805 expression_t *const step = parse_expression();
9806 statement->fors.step = step;
9807 mark_vars_read(step, ENT_ANY);
9808 if (warning.unused_value && !expression_has_effect(step)) {
9809 warningf(&step->base.source_position,
9810 "step of 'for'-statement has no effect");
9813 expect(')', end_error2);
9814 rem_anchor_token(')');
9815 statement->fors.body = parse_loop_body(statement);
9817 assert(current_scope == &statement->fors.scope);
9818 scope_pop(old_scope);
9819 environment_pop_to(top);
9826 rem_anchor_token(')');
9827 assert(current_scope == &statement->fors.scope);
9828 scope_pop(old_scope);
9829 environment_pop_to(top);
9833 return create_invalid_statement();
9837 * Parse a goto statement.
9839 static statement_t *parse_goto(void)
9841 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9844 if (GNU_MODE && next_if('*')) {
9845 expression_t *expression = parse_expression();
9846 mark_vars_read(expression, NULL);
9848 /* Argh: although documentation says the expression must be of type void*,
9849 * gcc accepts anything that can be casted into void* without error */
9850 type_t *type = expression->base.type;
9852 if (type != type_error_type) {
9853 if (!is_type_pointer(type) && !is_type_integer(type)) {
9854 errorf(&expression->base.source_position,
9855 "cannot convert to a pointer type");
9856 } else if (warning.other && type != type_void_ptr) {
9857 warningf(&expression->base.source_position,
9858 "type of computed goto expression should be 'void*' not '%T'", type);
9860 expression = create_implicit_cast(expression, type_void_ptr);
9863 statement->gotos.expression = expression;
9864 } else if (token.type == T_IDENTIFIER) {
9865 symbol_t *symbol = token.symbol;
9867 statement->gotos.label = get_label(symbol);
9870 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9872 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9874 return create_invalid_statement();
9877 /* remember the goto's in a list for later checking */
9878 *goto_anchor = &statement->gotos;
9879 goto_anchor = &statement->gotos.next;
9881 expect(';', end_error);
9888 * Parse a continue statement.
9890 static statement_t *parse_continue(void)
9892 if (current_loop == NULL) {
9893 errorf(HERE, "continue statement not within loop");
9896 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9899 expect(';', end_error);
9906 * Parse a break statement.
9908 static statement_t *parse_break(void)
9910 if (current_switch == NULL && current_loop == NULL) {
9911 errorf(HERE, "break statement not within loop or switch");
9914 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9917 expect(';', end_error);
9924 * Parse a __leave statement.
9926 static statement_t *parse_leave_statement(void)
9928 if (current_try == NULL) {
9929 errorf(HERE, "__leave statement not within __try");
9932 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9935 expect(';', end_error);
9942 * Check if a given entity represents a local variable.
9944 static bool is_local_variable(const entity_t *entity)
9946 if (entity->kind != ENTITY_VARIABLE)
9949 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9950 case STORAGE_CLASS_AUTO:
9951 case STORAGE_CLASS_REGISTER: {
9952 const type_t *type = skip_typeref(entity->declaration.type);
9953 if (is_type_function(type)) {
9965 * Check if a given expression represents a local variable.
9967 static bool expression_is_local_variable(const expression_t *expression)
9969 if (expression->base.kind != EXPR_REFERENCE) {
9972 const entity_t *entity = expression->reference.entity;
9973 return is_local_variable(entity);
9977 * Check if a given expression represents a local variable and
9978 * return its declaration then, else return NULL.
9980 entity_t *expression_is_variable(const expression_t *expression)
9982 if (expression->base.kind != EXPR_REFERENCE) {
9985 entity_t *entity = expression->reference.entity;
9986 if (entity->kind != ENTITY_VARIABLE)
9993 * Parse a return statement.
9995 static statement_t *parse_return(void)
9999 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10001 expression_t *return_value = NULL;
10002 if (token.type != ';') {
10003 return_value = parse_expression();
10004 mark_vars_read(return_value, NULL);
10007 const type_t *const func_type = skip_typeref(current_function->base.type);
10008 assert(is_type_function(func_type));
10009 type_t *const return_type = skip_typeref(func_type->function.return_type);
10011 source_position_t const *const pos = &statement->base.source_position;
10012 if (return_value != NULL) {
10013 type_t *return_value_type = skip_typeref(return_value->base.type);
10015 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10016 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10017 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10018 /* Only warn in C mode, because GCC does the same */
10019 if (c_mode & _CXX || strict_mode) {
10021 "'return' with a value, in function returning 'void'");
10022 } else if (warning.other) {
10024 "'return' with a value, in function returning 'void'");
10026 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10027 /* Only warn in C mode, because GCC does the same */
10030 "'return' with expression in function returning 'void'");
10031 } else if (warning.other) {
10033 "'return' with expression in function returning 'void'");
10037 assign_error_t error = semantic_assign(return_type, return_value);
10038 report_assign_error(error, return_type, return_value, "'return'",
10041 return_value = create_implicit_cast(return_value, return_type);
10042 /* check for returning address of a local var */
10043 if (warning.other && return_value != NULL
10044 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10045 const expression_t *expression = return_value->unary.value;
10046 if (expression_is_local_variable(expression)) {
10047 warningf(pos, "function returns address of local variable");
10050 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10051 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10052 if (c_mode & _CXX || strict_mode) {
10054 "'return' without value, in function returning non-void");
10057 "'return' without value, in function returning non-void");
10060 statement->returns.value = return_value;
10062 expect(';', end_error);
10069 * Parse a declaration statement.
10071 static statement_t *parse_declaration_statement(void)
10073 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10075 entity_t *before = current_scope->last_entity;
10077 parse_external_declaration();
10079 parse_declaration(record_entity, DECL_FLAGS_NONE);
10082 declaration_statement_t *const decl = &statement->declaration;
10083 entity_t *const begin =
10084 before != NULL ? before->base.next : current_scope->entities;
10085 decl->declarations_begin = begin;
10086 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10092 * Parse an expression statement, ie. expr ';'.
10094 static statement_t *parse_expression_statement(void)
10096 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10098 expression_t *const expr = parse_expression();
10099 statement->expression.expression = expr;
10100 mark_vars_read(expr, ENT_ANY);
10102 expect(';', end_error);
10109 * Parse a microsoft __try { } __finally { } or
10110 * __try{ } __except() { }
10112 static statement_t *parse_ms_try_statment(void)
10114 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10117 PUSH_PARENT(statement);
10119 ms_try_statement_t *rem = current_try;
10120 current_try = &statement->ms_try;
10121 statement->ms_try.try_statement = parse_compound_statement(false);
10126 if (next_if(T___except)) {
10127 expect('(', end_error);
10128 add_anchor_token(')');
10129 expression_t *const expr = parse_expression();
10130 mark_vars_read(expr, NULL);
10131 type_t * type = skip_typeref(expr->base.type);
10132 if (is_type_integer(type)) {
10133 type = promote_integer(type);
10134 } else if (is_type_valid(type)) {
10135 errorf(&expr->base.source_position,
10136 "__expect expression is not an integer, but '%T'", type);
10137 type = type_error_type;
10139 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10140 rem_anchor_token(')');
10141 expect(')', end_error);
10142 statement->ms_try.final_statement = parse_compound_statement(false);
10143 } else if (next_if(T__finally)) {
10144 statement->ms_try.final_statement = parse_compound_statement(false);
10146 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10147 return create_invalid_statement();
10151 return create_invalid_statement();
10154 static statement_t *parse_empty_statement(void)
10156 if (warning.empty_statement) {
10157 warningf(HERE, "statement is empty");
10159 statement_t *const statement = create_empty_statement();
10164 static statement_t *parse_local_label_declaration(void)
10166 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10170 entity_t *begin = NULL;
10171 entity_t *end = NULL;
10172 entity_t **anchor = &begin;
10174 if (token.type != T_IDENTIFIER) {
10175 parse_error_expected("while parsing local label declaration",
10176 T_IDENTIFIER, NULL);
10179 symbol_t *symbol = token.symbol;
10180 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10181 if (entity != NULL && entity->base.parent_scope == current_scope) {
10182 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10183 symbol, &entity->base.source_position);
10185 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10187 entity->base.parent_scope = current_scope;
10188 entity->base.namespc = NAMESPACE_LABEL;
10189 entity->base.source_position = token.source_position;
10190 entity->base.symbol = symbol;
10193 anchor = &entity->base.next;
10196 environment_push(entity);
10199 } while (next_if(','));
10200 expect(';', end_error);
10202 statement->declaration.declarations_begin = begin;
10203 statement->declaration.declarations_end = end;
10207 static void parse_namespace_definition(void)
10211 entity_t *entity = NULL;
10212 symbol_t *symbol = NULL;
10214 if (token.type == T_IDENTIFIER) {
10215 symbol = token.symbol;
10218 entity = get_entity(symbol, NAMESPACE_NORMAL);
10220 && entity->kind != ENTITY_NAMESPACE
10221 && entity->base.parent_scope == current_scope) {
10222 if (is_entity_valid(entity)) {
10223 error_redefined_as_different_kind(&token.source_position,
10224 entity, ENTITY_NAMESPACE);
10230 if (entity == NULL) {
10231 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10232 entity->base.symbol = symbol;
10233 entity->base.source_position = token.source_position;
10234 entity->base.namespc = NAMESPACE_NORMAL;
10235 entity->base.parent_scope = current_scope;
10238 if (token.type == '=') {
10239 /* TODO: parse namespace alias */
10240 panic("namespace alias definition not supported yet");
10243 environment_push(entity);
10244 append_entity(current_scope, entity);
10246 size_t const top = environment_top();
10247 scope_t *old_scope = scope_push(&entity->namespacee.members);
10249 entity_t *old_current_entity = current_entity;
10250 current_entity = entity;
10252 expect('{', end_error);
10254 expect('}', end_error);
10257 assert(current_scope == &entity->namespacee.members);
10258 assert(current_entity == entity);
10259 current_entity = old_current_entity;
10260 scope_pop(old_scope);
10261 environment_pop_to(top);
10265 * Parse a statement.
10266 * There's also parse_statement() which additionally checks for
10267 * "statement has no effect" warnings
10269 static statement_t *intern_parse_statement(void)
10271 statement_t *statement = NULL;
10273 /* declaration or statement */
10274 add_anchor_token(';');
10275 switch (token.type) {
10276 case T_IDENTIFIER: {
10277 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10278 if (la1_type == ':') {
10279 statement = parse_label_statement();
10280 } else if (is_typedef_symbol(token.symbol)) {
10281 statement = parse_declaration_statement();
10283 /* it's an identifier, the grammar says this must be an
10284 * expression statement. However it is common that users mistype
10285 * declaration types, so we guess a bit here to improve robustness
10286 * for incorrect programs */
10287 switch (la1_type) {
10290 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10292 statement = parse_expression_statement();
10296 statement = parse_declaration_statement();
10304 case T___extension__:
10305 /* This can be a prefix to a declaration or an expression statement.
10306 * We simply eat it now and parse the rest with tail recursion. */
10307 while (next_if(T___extension__)) {}
10308 bool old_gcc_extension = in_gcc_extension;
10309 in_gcc_extension = true;
10310 statement = intern_parse_statement();
10311 in_gcc_extension = old_gcc_extension;
10315 statement = parse_declaration_statement();
10319 statement = parse_local_label_declaration();
10322 case ';': statement = parse_empty_statement(); break;
10323 case '{': statement = parse_compound_statement(false); break;
10324 case T___leave: statement = parse_leave_statement(); break;
10325 case T___try: statement = parse_ms_try_statment(); break;
10326 case T_asm: statement = parse_asm_statement(); break;
10327 case T_break: statement = parse_break(); break;
10328 case T_case: statement = parse_case_statement(); break;
10329 case T_continue: statement = parse_continue(); break;
10330 case T_default: statement = parse_default_statement(); break;
10331 case T_do: statement = parse_do(); break;
10332 case T_for: statement = parse_for(); break;
10333 case T_goto: statement = parse_goto(); break;
10334 case T_if: statement = parse_if(); break;
10335 case T_return: statement = parse_return(); break;
10336 case T_switch: statement = parse_switch(); break;
10337 case T_while: statement = parse_while(); break;
10340 statement = parse_expression_statement();
10344 errorf(HERE, "unexpected token %K while parsing statement", &token);
10345 statement = create_invalid_statement();
10350 rem_anchor_token(';');
10352 assert(statement != NULL
10353 && statement->base.source_position.input_name != NULL);
10359 * parse a statement and emits "statement has no effect" warning if needed
10360 * (This is really a wrapper around intern_parse_statement with check for 1
10361 * single warning. It is needed, because for statement expressions we have
10362 * to avoid the warning on the last statement)
10364 static statement_t *parse_statement(void)
10366 statement_t *statement = intern_parse_statement();
10368 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10369 expression_t *expression = statement->expression.expression;
10370 if (!expression_has_effect(expression)) {
10371 warningf(&expression->base.source_position,
10372 "statement has no effect");
10380 * Parse a compound statement.
10382 static statement_t *parse_compound_statement(bool inside_expression_statement)
10384 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10386 PUSH_PARENT(statement);
10389 add_anchor_token('}');
10390 /* tokens, which can start a statement */
10391 /* TODO MS, __builtin_FOO */
10392 add_anchor_token('!');
10393 add_anchor_token('&');
10394 add_anchor_token('(');
10395 add_anchor_token('*');
10396 add_anchor_token('+');
10397 add_anchor_token('-');
10398 add_anchor_token('{');
10399 add_anchor_token('~');
10400 add_anchor_token(T_CHARACTER_CONSTANT);
10401 add_anchor_token(T_COLONCOLON);
10402 add_anchor_token(T_FLOATINGPOINT);
10403 add_anchor_token(T_IDENTIFIER);
10404 add_anchor_token(T_INTEGER);
10405 add_anchor_token(T_MINUSMINUS);
10406 add_anchor_token(T_PLUSPLUS);
10407 add_anchor_token(T_STRING_LITERAL);
10408 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10409 add_anchor_token(T_WIDE_STRING_LITERAL);
10410 add_anchor_token(T__Bool);
10411 add_anchor_token(T__Complex);
10412 add_anchor_token(T__Imaginary);
10413 add_anchor_token(T___FUNCTION__);
10414 add_anchor_token(T___PRETTY_FUNCTION__);
10415 add_anchor_token(T___alignof__);
10416 add_anchor_token(T___attribute__);
10417 add_anchor_token(T___builtin_va_start);
10418 add_anchor_token(T___extension__);
10419 add_anchor_token(T___func__);
10420 add_anchor_token(T___imag__);
10421 add_anchor_token(T___label__);
10422 add_anchor_token(T___real__);
10423 add_anchor_token(T___thread);
10424 add_anchor_token(T_asm);
10425 add_anchor_token(T_auto);
10426 add_anchor_token(T_bool);
10427 add_anchor_token(T_break);
10428 add_anchor_token(T_case);
10429 add_anchor_token(T_char);
10430 add_anchor_token(T_class);
10431 add_anchor_token(T_const);
10432 add_anchor_token(T_const_cast);
10433 add_anchor_token(T_continue);
10434 add_anchor_token(T_default);
10435 add_anchor_token(T_delete);
10436 add_anchor_token(T_double);
10437 add_anchor_token(T_do);
10438 add_anchor_token(T_dynamic_cast);
10439 add_anchor_token(T_enum);
10440 add_anchor_token(T_extern);
10441 add_anchor_token(T_false);
10442 add_anchor_token(T_float);
10443 add_anchor_token(T_for);
10444 add_anchor_token(T_goto);
10445 add_anchor_token(T_if);
10446 add_anchor_token(T_inline);
10447 add_anchor_token(T_int);
10448 add_anchor_token(T_long);
10449 add_anchor_token(T_new);
10450 add_anchor_token(T_operator);
10451 add_anchor_token(T_register);
10452 add_anchor_token(T_reinterpret_cast);
10453 add_anchor_token(T_restrict);
10454 add_anchor_token(T_return);
10455 add_anchor_token(T_short);
10456 add_anchor_token(T_signed);
10457 add_anchor_token(T_sizeof);
10458 add_anchor_token(T_static);
10459 add_anchor_token(T_static_cast);
10460 add_anchor_token(T_struct);
10461 add_anchor_token(T_switch);
10462 add_anchor_token(T_template);
10463 add_anchor_token(T_this);
10464 add_anchor_token(T_throw);
10465 add_anchor_token(T_true);
10466 add_anchor_token(T_try);
10467 add_anchor_token(T_typedef);
10468 add_anchor_token(T_typeid);
10469 add_anchor_token(T_typename);
10470 add_anchor_token(T_typeof);
10471 add_anchor_token(T_union);
10472 add_anchor_token(T_unsigned);
10473 add_anchor_token(T_using);
10474 add_anchor_token(T_void);
10475 add_anchor_token(T_volatile);
10476 add_anchor_token(T_wchar_t);
10477 add_anchor_token(T_while);
10479 size_t const top = environment_top();
10480 scope_t *old_scope = scope_push(&statement->compound.scope);
10482 statement_t **anchor = &statement->compound.statements;
10483 bool only_decls_so_far = true;
10484 while (token.type != '}') {
10485 if (token.type == T_EOF) {
10486 errorf(&statement->base.source_position,
10487 "EOF while parsing compound statement");
10490 statement_t *sub_statement = intern_parse_statement();
10491 if (is_invalid_statement(sub_statement)) {
10492 /* an error occurred. if we are at an anchor, return */
10498 if (warning.declaration_after_statement) {
10499 if (sub_statement->kind != STATEMENT_DECLARATION) {
10500 only_decls_so_far = false;
10501 } else if (!only_decls_so_far) {
10502 warningf(&sub_statement->base.source_position,
10503 "ISO C90 forbids mixed declarations and code");
10507 *anchor = sub_statement;
10509 while (sub_statement->base.next != NULL)
10510 sub_statement = sub_statement->base.next;
10512 anchor = &sub_statement->base.next;
10516 /* look over all statements again to produce no effect warnings */
10517 if (warning.unused_value) {
10518 statement_t *sub_statement = statement->compound.statements;
10519 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10520 if (sub_statement->kind != STATEMENT_EXPRESSION)
10522 /* don't emit a warning for the last expression in an expression
10523 * statement as it has always an effect */
10524 if (inside_expression_statement && sub_statement->base.next == NULL)
10527 expression_t *expression = sub_statement->expression.expression;
10528 if (!expression_has_effect(expression)) {
10529 warningf(&expression->base.source_position,
10530 "statement has no effect");
10536 rem_anchor_token(T_while);
10537 rem_anchor_token(T_wchar_t);
10538 rem_anchor_token(T_volatile);
10539 rem_anchor_token(T_void);
10540 rem_anchor_token(T_using);
10541 rem_anchor_token(T_unsigned);
10542 rem_anchor_token(T_union);
10543 rem_anchor_token(T_typeof);
10544 rem_anchor_token(T_typename);
10545 rem_anchor_token(T_typeid);
10546 rem_anchor_token(T_typedef);
10547 rem_anchor_token(T_try);
10548 rem_anchor_token(T_true);
10549 rem_anchor_token(T_throw);
10550 rem_anchor_token(T_this);
10551 rem_anchor_token(T_template);
10552 rem_anchor_token(T_switch);
10553 rem_anchor_token(T_struct);
10554 rem_anchor_token(T_static_cast);
10555 rem_anchor_token(T_static);
10556 rem_anchor_token(T_sizeof);
10557 rem_anchor_token(T_signed);
10558 rem_anchor_token(T_short);
10559 rem_anchor_token(T_return);
10560 rem_anchor_token(T_restrict);
10561 rem_anchor_token(T_reinterpret_cast);
10562 rem_anchor_token(T_register);
10563 rem_anchor_token(T_operator);
10564 rem_anchor_token(T_new);
10565 rem_anchor_token(T_long);
10566 rem_anchor_token(T_int);
10567 rem_anchor_token(T_inline);
10568 rem_anchor_token(T_if);
10569 rem_anchor_token(T_goto);
10570 rem_anchor_token(T_for);
10571 rem_anchor_token(T_float);
10572 rem_anchor_token(T_false);
10573 rem_anchor_token(T_extern);
10574 rem_anchor_token(T_enum);
10575 rem_anchor_token(T_dynamic_cast);
10576 rem_anchor_token(T_do);
10577 rem_anchor_token(T_double);
10578 rem_anchor_token(T_delete);
10579 rem_anchor_token(T_default);
10580 rem_anchor_token(T_continue);
10581 rem_anchor_token(T_const_cast);
10582 rem_anchor_token(T_const);
10583 rem_anchor_token(T_class);
10584 rem_anchor_token(T_char);
10585 rem_anchor_token(T_case);
10586 rem_anchor_token(T_break);
10587 rem_anchor_token(T_bool);
10588 rem_anchor_token(T_auto);
10589 rem_anchor_token(T_asm);
10590 rem_anchor_token(T___thread);
10591 rem_anchor_token(T___real__);
10592 rem_anchor_token(T___label__);
10593 rem_anchor_token(T___imag__);
10594 rem_anchor_token(T___func__);
10595 rem_anchor_token(T___extension__);
10596 rem_anchor_token(T___builtin_va_start);
10597 rem_anchor_token(T___attribute__);
10598 rem_anchor_token(T___alignof__);
10599 rem_anchor_token(T___PRETTY_FUNCTION__);
10600 rem_anchor_token(T___FUNCTION__);
10601 rem_anchor_token(T__Imaginary);
10602 rem_anchor_token(T__Complex);
10603 rem_anchor_token(T__Bool);
10604 rem_anchor_token(T_WIDE_STRING_LITERAL);
10605 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10606 rem_anchor_token(T_STRING_LITERAL);
10607 rem_anchor_token(T_PLUSPLUS);
10608 rem_anchor_token(T_MINUSMINUS);
10609 rem_anchor_token(T_INTEGER);
10610 rem_anchor_token(T_IDENTIFIER);
10611 rem_anchor_token(T_FLOATINGPOINT);
10612 rem_anchor_token(T_COLONCOLON);
10613 rem_anchor_token(T_CHARACTER_CONSTANT);
10614 rem_anchor_token('~');
10615 rem_anchor_token('{');
10616 rem_anchor_token('-');
10617 rem_anchor_token('+');
10618 rem_anchor_token('*');
10619 rem_anchor_token('(');
10620 rem_anchor_token('&');
10621 rem_anchor_token('!');
10622 rem_anchor_token('}');
10623 assert(current_scope == &statement->compound.scope);
10624 scope_pop(old_scope);
10625 environment_pop_to(top);
10632 * Check for unused global static functions and variables
10634 static void check_unused_globals(void)
10636 if (!warning.unused_function && !warning.unused_variable)
10639 for (const entity_t *entity = file_scope->entities; entity != NULL;
10640 entity = entity->base.next) {
10641 if (!is_declaration(entity))
10644 const declaration_t *declaration = &entity->declaration;
10645 if (declaration->used ||
10646 declaration->modifiers & DM_UNUSED ||
10647 declaration->modifiers & DM_USED ||
10648 declaration->storage_class != STORAGE_CLASS_STATIC)
10651 type_t *const type = declaration->type;
10653 if (entity->kind == ENTITY_FUNCTION) {
10654 /* inhibit warning for static inline functions */
10655 if (entity->function.is_inline)
10658 s = entity->function.statement != NULL ? "defined" : "declared";
10663 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10664 type, declaration->base.symbol, s);
10668 static void parse_global_asm(void)
10670 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10673 expect('(', end_error);
10675 statement->asms.asm_text = parse_string_literals();
10676 statement->base.next = unit->global_asm;
10677 unit->global_asm = statement;
10679 expect(')', end_error);
10680 expect(';', end_error);
10685 static void parse_linkage_specification(void)
10689 const char *linkage = parse_string_literals().begin;
10691 linkage_kind_t old_linkage = current_linkage;
10692 linkage_kind_t new_linkage;
10693 if (strcmp(linkage, "C") == 0) {
10694 new_linkage = LINKAGE_C;
10695 } else if (strcmp(linkage, "C++") == 0) {
10696 new_linkage = LINKAGE_CXX;
10698 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10699 new_linkage = LINKAGE_INVALID;
10701 current_linkage = new_linkage;
10703 if (next_if('{')) {
10705 expect('}', end_error);
10711 assert(current_linkage == new_linkage);
10712 current_linkage = old_linkage;
10715 static void parse_external(void)
10717 switch (token.type) {
10718 DECLARATION_START_NO_EXTERN
10720 case T___extension__:
10721 /* tokens below are for implicit int */
10722 case '&': /* & x; -> int& x; (and error later, because C++ has no
10724 case '*': /* * x; -> int* x; */
10725 case '(': /* (x); -> int (x); */
10726 parse_external_declaration();
10730 if (look_ahead(1)->type == T_STRING_LITERAL) {
10731 parse_linkage_specification();
10733 parse_external_declaration();
10738 parse_global_asm();
10742 parse_namespace_definition();
10746 if (!strict_mode) {
10748 warningf(HERE, "stray ';' outside of function");
10755 errorf(HERE, "stray %K outside of function", &token);
10756 if (token.type == '(' || token.type == '{' || token.type == '[')
10757 eat_until_matching_token(token.type);
10763 static void parse_externals(void)
10765 add_anchor_token('}');
10766 add_anchor_token(T_EOF);
10769 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10770 unsigned char token_anchor_copy[T_LAST_TOKEN];
10771 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10774 while (token.type != T_EOF && token.type != '}') {
10776 bool anchor_leak = false;
10777 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10778 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10780 /* the anchor set and its copy differs */
10781 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10782 anchor_leak = true;
10785 if (in_gcc_extension) {
10786 /* an gcc extension scope was not closed */
10787 internal_errorf(HERE, "Leaked __extension__");
10788 anchor_leak = true;
10798 rem_anchor_token(T_EOF);
10799 rem_anchor_token('}');
10803 * Parse a translation unit.
10805 static void parse_translation_unit(void)
10807 add_anchor_token(T_EOF);
10812 if (token.type == T_EOF)
10815 errorf(HERE, "stray %K outside of function", &token);
10816 if (token.type == '(' || token.type == '{' || token.type == '[')
10817 eat_until_matching_token(token.type);
10822 void set_default_visibility(elf_visibility_tag_t visibility)
10824 default_visibility = visibility;
10830 * @return the translation unit or NULL if errors occurred.
10832 void start_parsing(void)
10834 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10835 label_stack = NEW_ARR_F(stack_entry_t, 0);
10836 diagnostic_count = 0;
10840 print_to_file(stderr);
10842 assert(unit == NULL);
10843 unit = allocate_ast_zero(sizeof(unit[0]));
10845 assert(file_scope == NULL);
10846 file_scope = &unit->scope;
10848 assert(current_scope == NULL);
10849 scope_push(&unit->scope);
10851 create_gnu_builtins();
10853 create_microsoft_intrinsics();
10856 translation_unit_t *finish_parsing(void)
10858 assert(current_scope == &unit->scope);
10861 assert(file_scope == &unit->scope);
10862 check_unused_globals();
10865 DEL_ARR_F(environment_stack);
10866 DEL_ARR_F(label_stack);
10868 translation_unit_t *result = unit;
10873 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10874 * are given length one. */
10875 static void complete_incomplete_arrays(void)
10877 size_t n = ARR_LEN(incomplete_arrays);
10878 for (size_t i = 0; i != n; ++i) {
10879 declaration_t *const decl = incomplete_arrays[i];
10880 type_t *const orig_type = decl->type;
10881 type_t *const type = skip_typeref(orig_type);
10883 if (!is_type_incomplete(type))
10886 if (warning.other) {
10887 warningf(&decl->base.source_position,
10888 "array '%#T' assumed to have one element",
10889 orig_type, decl->base.symbol);
10892 type_t *const new_type = duplicate_type(type);
10893 new_type->array.size_constant = true;
10894 new_type->array.has_implicit_size = true;
10895 new_type->array.size = 1;
10897 type_t *const result = identify_new_type(new_type);
10899 decl->type = result;
10903 void prepare_main_collect2(entity_t *entity)
10905 // create call to __main
10906 symbol_t *symbol = symbol_table_insert("__main");
10907 entity_t *subsubmain_ent
10908 = create_implicit_function(symbol, &builtin_source_position);
10910 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10911 type_t *ftype = subsubmain_ent->declaration.type;
10912 ref->base.source_position = builtin_source_position;
10913 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10914 ref->reference.entity = subsubmain_ent;
10916 expression_t *call = allocate_expression_zero(EXPR_CALL);
10917 call->base.source_position = builtin_source_position;
10918 call->base.type = type_void;
10919 call->call.function = ref;
10921 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10922 expr_statement->base.source_position = builtin_source_position;
10923 expr_statement->expression.expression = call;
10925 statement_t *statement = entity->function.statement;
10926 assert(statement->kind == STATEMENT_COMPOUND);
10927 compound_statement_t *compounds = &statement->compound;
10929 expr_statement->base.next = compounds->statements;
10930 compounds->statements = expr_statement;
10935 lookahead_bufpos = 0;
10936 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10939 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10940 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10941 parse_translation_unit();
10942 complete_incomplete_arrays();
10943 DEL_ARR_F(incomplete_arrays);
10944 incomplete_arrays = NULL;
10948 * Initialize the parser.
10950 void init_parser(void)
10952 sym_anonymous = symbol_table_insert("<anonymous>");
10954 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10956 init_expression_parsers();
10957 obstack_init(&temp_obst);
10961 * Terminate the parser.
10963 void exit_parser(void)
10965 obstack_free(&temp_obst, NULL);