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_INTEGER] = sizeof(literal_expression_t),
313 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
314 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
315 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
316 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
317 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
318 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
319 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
320 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
321 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
322 [EXPR_CALL] = sizeof(call_expression_t),
323 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
324 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
325 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
326 [EXPR_SELECT] = sizeof(select_expression_t),
327 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
328 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
329 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
330 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
331 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
332 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
333 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
334 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
335 [EXPR_VA_START] = sizeof(va_start_expression_t),
336 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
337 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
338 [EXPR_STATEMENT] = sizeof(statement_expression_t),
339 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
341 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
342 return sizes[EXPR_UNARY_FIRST];
344 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
345 return sizes[EXPR_BINARY_FIRST];
347 assert(kind < lengthof(sizes));
348 assert(sizes[kind] != 0);
353 * Allocate a statement node of given kind and initialize all
354 * fields with zero. Sets its source position to the position
355 * of the current token.
357 static statement_t *allocate_statement_zero(statement_kind_t kind)
359 size_t size = get_statement_struct_size(kind);
360 statement_t *res = allocate_ast_zero(size);
362 res->base.kind = kind;
363 res->base.parent = current_parent;
364 res->base.source_position = token.source_position;
369 * Allocate an expression node of given kind and initialize all
372 * @param kind the kind of the expression to allocate
374 static expression_t *allocate_expression_zero(expression_kind_t kind)
376 size_t size = get_expression_struct_size(kind);
377 expression_t *res = allocate_ast_zero(size);
379 res->base.kind = kind;
380 res->base.type = type_error_type;
381 res->base.source_position = token.source_position;
386 * Creates a new invalid expression at the source position
387 * of the current token.
389 static expression_t *create_invalid_expression(void)
391 return allocate_expression_zero(EXPR_INVALID);
395 * Creates a new invalid statement.
397 static statement_t *create_invalid_statement(void)
399 return allocate_statement_zero(STATEMENT_INVALID);
403 * Allocate a new empty statement.
405 static statement_t *create_empty_statement(void)
407 return allocate_statement_zero(STATEMENT_EMPTY);
410 static function_parameter_t *allocate_parameter(type_t *const type)
412 function_parameter_t *const param
413 = obstack_alloc(type_obst, sizeof(*param));
414 memset(param, 0, sizeof(*param));
420 * Returns the size of an initializer node.
422 * @param kind the initializer kind
424 static size_t get_initializer_size(initializer_kind_t kind)
426 static const size_t sizes[] = {
427 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
428 [INITIALIZER_STRING] = sizeof(initializer_string_t),
429 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
430 [INITIALIZER_LIST] = sizeof(initializer_list_t),
431 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
433 assert(kind < lengthof(sizes));
434 assert(sizes[kind] != 0);
439 * Allocate an initializer node of given kind and initialize all
442 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
444 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
451 * Returns the index of the top element of the environment stack.
453 static size_t environment_top(void)
455 return ARR_LEN(environment_stack);
459 * Returns the index of the top element of the global label stack.
461 static size_t label_top(void)
463 return ARR_LEN(label_stack);
467 * Return the next token.
469 static inline void next_token(void)
471 token = lookahead_buffer[lookahead_bufpos];
472 lookahead_buffer[lookahead_bufpos] = lexer_token;
475 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
478 print_token(stderr, &token);
479 fprintf(stderr, "\n");
483 static inline bool next_if(int const type)
485 if (token.type == type) {
494 * Return the next token with a given lookahead.
496 static inline const token_t *look_ahead(size_t num)
498 assert(0 < num && num <= MAX_LOOKAHEAD);
499 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
500 return &lookahead_buffer[pos];
504 * Adds a token type to the token type anchor set (a multi-set).
506 static void add_anchor_token(int token_type)
508 assert(0 <= token_type && token_type < T_LAST_TOKEN);
509 ++token_anchor_set[token_type];
513 * Set the number of tokens types of the given type
514 * to zero and return the old count.
516 static int save_and_reset_anchor_state(int token_type)
518 assert(0 <= token_type && token_type < T_LAST_TOKEN);
519 int count = token_anchor_set[token_type];
520 token_anchor_set[token_type] = 0;
525 * Restore the number of token types to the given count.
527 static void restore_anchor_state(int token_type, int count)
529 assert(0 <= token_type && token_type < T_LAST_TOKEN);
530 token_anchor_set[token_type] = count;
534 * Remove a token type from the token type anchor set (a multi-set).
536 static void rem_anchor_token(int token_type)
538 assert(0 <= token_type && token_type < T_LAST_TOKEN);
539 assert(token_anchor_set[token_type] != 0);
540 --token_anchor_set[token_type];
544 * Return true if the token type of the current token is
547 static bool at_anchor(void)
551 return token_anchor_set[token.type];
555 * Eat tokens until a matching token type is found.
557 static void eat_until_matching_token(int type)
561 case '(': end_token = ')'; break;
562 case '{': end_token = '}'; break;
563 case '[': end_token = ']'; break;
564 default: end_token = type; break;
567 unsigned parenthesis_count = 0;
568 unsigned brace_count = 0;
569 unsigned bracket_count = 0;
570 while (token.type != end_token ||
571 parenthesis_count != 0 ||
573 bracket_count != 0) {
574 switch (token.type) {
576 case '(': ++parenthesis_count; break;
577 case '{': ++brace_count; break;
578 case '[': ++bracket_count; break;
581 if (parenthesis_count > 0)
591 if (bracket_count > 0)
594 if (token.type == end_token &&
595 parenthesis_count == 0 &&
609 * Eat input tokens until an anchor is found.
611 static void eat_until_anchor(void)
613 while (token_anchor_set[token.type] == 0) {
614 if (token.type == '(' || token.type == '{' || token.type == '[')
615 eat_until_matching_token(token.type);
621 * Eat a whole block from input tokens.
623 static void eat_block(void)
625 eat_until_matching_token('{');
629 #define eat(token_type) (assert(token.type == (token_type)), next_token())
632 * Report a parse error because an expected token was not found.
635 #if defined __GNUC__ && __GNUC__ >= 4
636 __attribute__((sentinel))
638 void parse_error_expected(const char *message, ...)
640 if (message != NULL) {
641 errorf(HERE, "%s", message);
644 va_start(ap, message);
645 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
650 * Report an incompatible type.
652 static void type_error_incompatible(const char *msg,
653 const source_position_t *source_position, type_t *type1, type_t *type2)
655 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
660 * Expect the current token is the expected token.
661 * If not, generate an error, eat the current statement,
662 * and goto the error_label label.
664 #define expect(expected, error_label) \
666 if (UNLIKELY(token.type != (expected))) { \
667 parse_error_expected(NULL, (expected), NULL); \
668 add_anchor_token(expected); \
669 eat_until_anchor(); \
670 next_if((expected)); \
671 rem_anchor_token(expected); \
678 * Push a given scope on the scope stack and make it the
681 static scope_t *scope_push(scope_t *new_scope)
683 if (current_scope != NULL) {
684 new_scope->depth = current_scope->depth + 1;
687 scope_t *old_scope = current_scope;
688 current_scope = new_scope;
693 * Pop the current scope from the scope stack.
695 static void scope_pop(scope_t *old_scope)
697 current_scope = old_scope;
701 * Search an entity by its symbol in a given namespace.
703 static entity_t *get_entity(const symbol_t *const symbol,
704 namespace_tag_t namespc)
706 assert(namespc != NAMESPACE_INVALID);
707 entity_t *entity = symbol->entity;
708 for (; entity != NULL; entity = entity->base.symbol_next) {
709 if (entity->base.namespc == namespc)
716 /* §6.2.3:1 24) There is only one name space for tags even though three are
718 static entity_t *get_tag(symbol_t const *const symbol,
719 entity_kind_tag_t const kind)
721 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
722 if (entity != NULL && entity->kind != kind) {
724 "'%Y' defined as wrong kind of tag (previous definition %P)",
725 symbol, &entity->base.source_position);
732 * pushs an entity on the environment stack and links the corresponding symbol
735 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
737 symbol_t *symbol = entity->base.symbol;
738 entity_namespace_t namespc = entity->base.namespc;
739 assert(namespc != NAMESPACE_INVALID);
741 /* replace/add entity into entity list of the symbol */
744 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
749 /* replace an entry? */
750 if (iter->base.namespc == namespc) {
751 entity->base.symbol_next = iter->base.symbol_next;
757 /* remember old declaration */
759 entry.symbol = symbol;
760 entry.old_entity = iter;
761 entry.namespc = namespc;
762 ARR_APP1(stack_entry_t, *stack_ptr, entry);
766 * Push an entity on the environment stack.
768 static void environment_push(entity_t *entity)
770 assert(entity->base.source_position.input_name != NULL);
771 assert(entity->base.parent_scope != NULL);
772 stack_push(&environment_stack, entity);
776 * Push a declaration on the global label stack.
778 * @param declaration the declaration
780 static void label_push(entity_t *label)
782 /* we abuse the parameters scope as parent for the labels */
783 label->base.parent_scope = ¤t_function->parameters;
784 stack_push(&label_stack, label);
788 * pops symbols from the environment stack until @p new_top is the top element
790 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
792 stack_entry_t *stack = *stack_ptr;
793 size_t top = ARR_LEN(stack);
796 assert(new_top <= top);
800 for (i = top; i > new_top; --i) {
801 stack_entry_t *entry = &stack[i - 1];
803 entity_t *old_entity = entry->old_entity;
804 symbol_t *symbol = entry->symbol;
805 entity_namespace_t namespc = entry->namespc;
807 /* replace with old_entity/remove */
810 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
812 assert(iter != NULL);
813 /* replace an entry? */
814 if (iter->base.namespc == namespc)
818 /* restore definition from outer scopes (if there was one) */
819 if (old_entity != NULL) {
820 old_entity->base.symbol_next = iter->base.symbol_next;
821 *anchor = old_entity;
823 /* remove entry from list */
824 *anchor = iter->base.symbol_next;
828 ARR_SHRINKLEN(*stack_ptr, new_top);
832 * Pop all entries from the environment stack until the new_top
835 * @param new_top the new stack top
837 static void environment_pop_to(size_t new_top)
839 stack_pop_to(&environment_stack, new_top);
843 * Pop all entries from the global label stack until the new_top
846 * @param new_top the new stack top
848 static void label_pop_to(size_t new_top)
850 stack_pop_to(&label_stack, new_top);
853 static int get_akind_rank(atomic_type_kind_t akind)
859 * Return the type rank for an atomic type.
861 static int get_rank(const type_t *type)
863 assert(!is_typeref(type));
864 if (type->kind == TYPE_ENUM)
865 return get_akind_rank(type->enumt.akind);
867 assert(type->kind == TYPE_ATOMIC);
868 return get_akind_rank(type->atomic.akind);
872 * §6.3.1.1:2 Do integer promotion for a given type.
874 * @param type the type to promote
875 * @return the promoted type
877 static type_t *promote_integer(type_t *type)
879 if (type->kind == TYPE_BITFIELD)
880 type = type->bitfield.base_type;
882 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
889 * Create a cast expression.
891 * @param expression the expression to cast
892 * @param dest_type the destination type
894 static expression_t *create_cast_expression(expression_t *expression,
897 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
899 cast->unary.value = expression;
900 cast->base.type = dest_type;
906 * Check if a given expression represents a null pointer constant.
908 * @param expression the expression to check
910 static bool is_null_pointer_constant(const expression_t *expression)
912 /* skip void* cast */
913 if (expression->kind == EXPR_UNARY_CAST ||
914 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
915 type_t *const type = skip_typeref(expression->base.type);
916 if (types_compatible(type, type_void_ptr))
917 expression = expression->unary.value;
920 type_t *const type = skip_typeref(expression->base.type);
921 if (!is_type_integer(type))
923 switch (is_constant_expression(expression)) {
924 case EXPR_CLASS_ERROR: return true;
925 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
926 default: return false;
931 * Create an implicit cast expression.
933 * @param expression the expression to cast
934 * @param dest_type the destination type
936 static expression_t *create_implicit_cast(expression_t *expression,
939 type_t *const source_type = expression->base.type;
941 if (source_type == dest_type)
944 return create_cast_expression(expression, dest_type);
947 typedef enum assign_error_t {
949 ASSIGN_ERROR_INCOMPATIBLE,
950 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
951 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
952 ASSIGN_WARNING_POINTER_FROM_INT,
953 ASSIGN_WARNING_INT_FROM_POINTER
956 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
957 const expression_t *const right,
959 const source_position_t *source_position)
961 type_t *const orig_type_right = right->base.type;
962 type_t *const type_left = skip_typeref(orig_type_left);
963 type_t *const type_right = skip_typeref(orig_type_right);
968 case ASSIGN_ERROR_INCOMPATIBLE:
969 errorf(source_position,
970 "destination type '%T' in %s is incompatible with type '%T'",
971 orig_type_left, context, orig_type_right);
974 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
976 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
977 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
979 /* the left type has all qualifiers from the right type */
980 unsigned missing_qualifiers
981 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
982 warningf(source_position,
983 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
984 orig_type_left, context, orig_type_right, missing_qualifiers);
989 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
991 warningf(source_position,
992 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
993 orig_type_left, context, right, orig_type_right);
997 case ASSIGN_WARNING_POINTER_FROM_INT:
999 warningf(source_position,
1000 "%s makes pointer '%T' from integer '%T' without a cast",
1001 context, orig_type_left, orig_type_right);
1005 case ASSIGN_WARNING_INT_FROM_POINTER:
1006 if (warning.other) {
1007 warningf(source_position,
1008 "%s makes integer '%T' from pointer '%T' without a cast",
1009 context, orig_type_left, orig_type_right);
1014 panic("invalid error value");
1018 /** Implements the rules from §6.5.16.1 */
1019 static assign_error_t semantic_assign(type_t *orig_type_left,
1020 const expression_t *const right)
1022 type_t *const orig_type_right = right->base.type;
1023 type_t *const type_left = skip_typeref(orig_type_left);
1024 type_t *const type_right = skip_typeref(orig_type_right);
1026 if (is_type_pointer(type_left)) {
1027 if (is_null_pointer_constant(right)) {
1028 return ASSIGN_SUCCESS;
1029 } else if (is_type_pointer(type_right)) {
1030 type_t *points_to_left
1031 = skip_typeref(type_left->pointer.points_to);
1032 type_t *points_to_right
1033 = skip_typeref(type_right->pointer.points_to);
1034 assign_error_t res = ASSIGN_SUCCESS;
1036 /* the left type has all qualifiers from the right type */
1037 unsigned missing_qualifiers
1038 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1039 if (missing_qualifiers != 0) {
1040 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1043 points_to_left = get_unqualified_type(points_to_left);
1044 points_to_right = get_unqualified_type(points_to_right);
1046 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1049 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1050 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1051 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1054 if (!types_compatible(points_to_left, points_to_right)) {
1055 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1059 } else if (is_type_integer(type_right)) {
1060 return ASSIGN_WARNING_POINTER_FROM_INT;
1062 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1063 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1064 && is_type_pointer(type_right))) {
1065 return ASSIGN_SUCCESS;
1066 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1067 type_t *const unqual_type_left = get_unqualified_type(type_left);
1068 type_t *const unqual_type_right = get_unqualified_type(type_right);
1069 if (types_compatible(unqual_type_left, unqual_type_right)) {
1070 return ASSIGN_SUCCESS;
1072 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1073 return ASSIGN_WARNING_INT_FROM_POINTER;
1076 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1077 return ASSIGN_SUCCESS;
1079 return ASSIGN_ERROR_INCOMPATIBLE;
1082 static expression_t *parse_constant_expression(void)
1084 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1086 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1087 errorf(&result->base.source_position,
1088 "expression '%E' is not constant", result);
1094 static expression_t *parse_assignment_expression(void)
1096 return parse_subexpression(PREC_ASSIGNMENT);
1099 static void warn_string_concat(const source_position_t *pos)
1101 if (warning.traditional) {
1102 warningf(pos, "traditional C rejects string constant concatenation");
1106 static string_t parse_string_literals(void)
1108 assert(token.type == T_STRING_LITERAL);
1109 string_t result = token.literal;
1113 while (token.type == T_STRING_LITERAL) {
1114 warn_string_concat(&token.source_position);
1115 result = concat_strings(&result, &token.literal);
1123 * compare two string, ignoring double underscores on the second.
1125 static int strcmp_underscore(const char *s1, const char *s2)
1127 if (s2[0] == '_' && s2[1] == '_') {
1128 size_t len2 = strlen(s2);
1129 size_t len1 = strlen(s1);
1130 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1131 return strncmp(s1, s2+2, len2-4);
1135 return strcmp(s1, s2);
1138 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1140 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1141 attribute->kind = kind;
1146 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1149 * __attribute__ ( ( attribute-list ) )
1153 * attribute_list , attrib
1158 * any-word ( identifier )
1159 * any-word ( identifier , nonempty-expr-list )
1160 * any-word ( expr-list )
1162 * where the "identifier" must not be declared as a type, and
1163 * "any-word" may be any identifier (including one declared as a
1164 * type), a reserved word storage class specifier, type specifier or
1165 * type qualifier. ??? This still leaves out most reserved keywords
1166 * (following the old parser), shouldn't we include them, and why not
1167 * allow identifiers declared as types to start the arguments?
1169 * Matze: this all looks confusing and little systematic, so we're even less
1170 * strict and parse any list of things which are identifiers or
1171 * (assignment-)expressions.
1173 static attribute_argument_t *parse_attribute_arguments(void)
1175 attribute_argument_t *first = NULL;
1176 attribute_argument_t **anchor = &first;
1177 if (token.type != ')') do {
1178 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1180 /* is it an identifier */
1181 if (token.type == T_IDENTIFIER
1182 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1183 symbol_t *symbol = token.symbol;
1184 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1185 argument->v.symbol = symbol;
1188 /* must be an expression */
1189 expression_t *expression = parse_assignment_expression();
1191 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1192 argument->v.expression = expression;
1195 /* append argument */
1197 anchor = &argument->next;
1198 } while (next_if(','));
1199 expect(')', end_error);
1208 static attribute_t *parse_attribute_asm(void)
1212 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1214 expect('(', end_error);
1215 attribute->a.arguments = parse_attribute_arguments();
1222 static symbol_t *get_symbol_from_token(void)
1224 switch(token.type) {
1226 return token.symbol;
1255 /* maybe we need more tokens ... add them on demand */
1256 return get_token_symbol(&token);
1262 static attribute_t *parse_attribute_gnu_single(void)
1264 /* parse "any-word" */
1265 symbol_t *symbol = get_symbol_from_token();
1266 if (symbol == NULL) {
1267 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1271 const char *name = symbol->string;
1274 attribute_kind_t kind;
1275 for (kind = ATTRIBUTE_GNU_FIRST; kind <= ATTRIBUTE_GNU_LAST; ++kind) {
1276 const char *attribute_name = get_attribute_name(kind);
1277 if (attribute_name != NULL
1278 && strcmp_underscore(attribute_name, name) == 0)
1282 if (kind >= ATTRIBUTE_GNU_LAST) {
1283 if (warning.attribute) {
1284 warningf(HERE, "unknown attribute '%s' ignored", name);
1286 /* TODO: we should still save the attribute in the list... */
1287 kind = ATTRIBUTE_UNKNOWN;
1290 attribute_t *attribute = allocate_attribute_zero(kind);
1292 /* parse arguments */
1294 attribute->a.arguments = parse_attribute_arguments();
1299 static attribute_t *parse_attribute_gnu(void)
1301 attribute_t *first = NULL;
1302 attribute_t **anchor = &first;
1304 eat(T___attribute__);
1305 expect('(', end_error);
1306 expect('(', end_error);
1308 if (token.type != ')') do {
1309 attribute_t *attribute = parse_attribute_gnu_single();
1310 if (attribute == NULL)
1313 *anchor = attribute;
1314 anchor = &attribute->next;
1315 } while (next_if(','));
1316 expect(')', end_error);
1317 expect(')', end_error);
1323 /** Parse attributes. */
1324 static attribute_t *parse_attributes(attribute_t *first)
1326 attribute_t **anchor = &first;
1328 while (*anchor != NULL)
1329 anchor = &(*anchor)->next;
1331 attribute_t *attribute;
1332 switch (token.type) {
1333 case T___attribute__:
1334 attribute = parse_attribute_gnu();
1335 if (attribute == NULL)
1340 attribute = parse_attribute_asm();
1345 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1350 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1353 case T__forceinline:
1355 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1360 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1365 /* TODO record modifier */
1367 warningf(HERE, "Ignoring declaration modifier %K", &token);
1368 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1375 *anchor = attribute;
1376 anchor = &attribute->next;
1380 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1382 static entity_t *determine_lhs_ent(expression_t *const expr,
1385 switch (expr->kind) {
1386 case EXPR_REFERENCE: {
1387 entity_t *const entity = expr->reference.entity;
1388 /* we should only find variables as lvalues... */
1389 if (entity->base.kind != ENTITY_VARIABLE
1390 && entity->base.kind != ENTITY_PARAMETER)
1396 case EXPR_ARRAY_ACCESS: {
1397 expression_t *const ref = expr->array_access.array_ref;
1398 entity_t * ent = NULL;
1399 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1400 ent = determine_lhs_ent(ref, lhs_ent);
1403 mark_vars_read(expr->select.compound, lhs_ent);
1405 mark_vars_read(expr->array_access.index, lhs_ent);
1410 if (is_type_compound(skip_typeref(expr->base.type))) {
1411 return determine_lhs_ent(expr->select.compound, lhs_ent);
1413 mark_vars_read(expr->select.compound, lhs_ent);
1418 case EXPR_UNARY_DEREFERENCE: {
1419 expression_t *const val = expr->unary.value;
1420 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1422 return determine_lhs_ent(val->unary.value, lhs_ent);
1424 mark_vars_read(val, NULL);
1430 mark_vars_read(expr, NULL);
1435 #define ENT_ANY ((entity_t*)-1)
1438 * Mark declarations, which are read. This is used to detect variables, which
1442 * x is not marked as "read", because it is only read to calculate its own new
1446 * x and y are not detected as "not read", because multiple variables are
1449 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1451 switch (expr->kind) {
1452 case EXPR_REFERENCE: {
1453 entity_t *const entity = expr->reference.entity;
1454 if (entity->kind != ENTITY_VARIABLE
1455 && entity->kind != ENTITY_PARAMETER)
1458 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1459 if (entity->kind == ENTITY_VARIABLE) {
1460 entity->variable.read = true;
1462 entity->parameter.read = true;
1469 // TODO respect pure/const
1470 mark_vars_read(expr->call.function, NULL);
1471 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1472 mark_vars_read(arg->expression, NULL);
1476 case EXPR_CONDITIONAL:
1477 // TODO lhs_decl should depend on whether true/false have an effect
1478 mark_vars_read(expr->conditional.condition, NULL);
1479 if (expr->conditional.true_expression != NULL)
1480 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1481 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1485 if (lhs_ent == ENT_ANY
1486 && !is_type_compound(skip_typeref(expr->base.type)))
1488 mark_vars_read(expr->select.compound, lhs_ent);
1491 case EXPR_ARRAY_ACCESS: {
1492 expression_t *const ref = expr->array_access.array_ref;
1493 mark_vars_read(ref, lhs_ent);
1494 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1495 mark_vars_read(expr->array_access.index, lhs_ent);
1500 mark_vars_read(expr->va_arge.ap, lhs_ent);
1504 mark_vars_read(expr->va_copye.src, lhs_ent);
1507 case EXPR_UNARY_CAST:
1508 /* Special case: Use void cast to mark a variable as "read" */
1509 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1514 case EXPR_UNARY_THROW:
1515 if (expr->unary.value == NULL)
1518 case EXPR_UNARY_DEREFERENCE:
1519 case EXPR_UNARY_DELETE:
1520 case EXPR_UNARY_DELETE_ARRAY:
1521 if (lhs_ent == ENT_ANY)
1525 case EXPR_UNARY_NEGATE:
1526 case EXPR_UNARY_PLUS:
1527 case EXPR_UNARY_BITWISE_NEGATE:
1528 case EXPR_UNARY_NOT:
1529 case EXPR_UNARY_TAKE_ADDRESS:
1530 case EXPR_UNARY_POSTFIX_INCREMENT:
1531 case EXPR_UNARY_POSTFIX_DECREMENT:
1532 case EXPR_UNARY_PREFIX_INCREMENT:
1533 case EXPR_UNARY_PREFIX_DECREMENT:
1534 case EXPR_UNARY_CAST_IMPLICIT:
1535 case EXPR_UNARY_ASSUME:
1537 mark_vars_read(expr->unary.value, lhs_ent);
1540 case EXPR_BINARY_ADD:
1541 case EXPR_BINARY_SUB:
1542 case EXPR_BINARY_MUL:
1543 case EXPR_BINARY_DIV:
1544 case EXPR_BINARY_MOD:
1545 case EXPR_BINARY_EQUAL:
1546 case EXPR_BINARY_NOTEQUAL:
1547 case EXPR_BINARY_LESS:
1548 case EXPR_BINARY_LESSEQUAL:
1549 case EXPR_BINARY_GREATER:
1550 case EXPR_BINARY_GREATEREQUAL:
1551 case EXPR_BINARY_BITWISE_AND:
1552 case EXPR_BINARY_BITWISE_OR:
1553 case EXPR_BINARY_BITWISE_XOR:
1554 case EXPR_BINARY_LOGICAL_AND:
1555 case EXPR_BINARY_LOGICAL_OR:
1556 case EXPR_BINARY_SHIFTLEFT:
1557 case EXPR_BINARY_SHIFTRIGHT:
1558 case EXPR_BINARY_COMMA:
1559 case EXPR_BINARY_ISGREATER:
1560 case EXPR_BINARY_ISGREATEREQUAL:
1561 case EXPR_BINARY_ISLESS:
1562 case EXPR_BINARY_ISLESSEQUAL:
1563 case EXPR_BINARY_ISLESSGREATER:
1564 case EXPR_BINARY_ISUNORDERED:
1565 mark_vars_read(expr->binary.left, lhs_ent);
1566 mark_vars_read(expr->binary.right, lhs_ent);
1569 case EXPR_BINARY_ASSIGN:
1570 case EXPR_BINARY_MUL_ASSIGN:
1571 case EXPR_BINARY_DIV_ASSIGN:
1572 case EXPR_BINARY_MOD_ASSIGN:
1573 case EXPR_BINARY_ADD_ASSIGN:
1574 case EXPR_BINARY_SUB_ASSIGN:
1575 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1576 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1577 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1578 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1579 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1580 if (lhs_ent == ENT_ANY)
1582 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1583 mark_vars_read(expr->binary.right, lhs_ent);
1588 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1594 case EXPR_STRING_LITERAL:
1595 case EXPR_WIDE_STRING_LITERAL:
1596 case EXPR_COMPOUND_LITERAL: // TODO init?
1598 case EXPR_CLASSIFY_TYPE:
1601 case EXPR_BUILTIN_CONSTANT_P:
1602 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1604 case EXPR_STATEMENT: // TODO
1605 case EXPR_LABEL_ADDRESS:
1606 case EXPR_REFERENCE_ENUM_VALUE:
1610 panic("unhandled expression");
1613 static designator_t *parse_designation(void)
1615 designator_t *result = NULL;
1616 designator_t **anchor = &result;
1619 designator_t *designator;
1620 switch (token.type) {
1622 designator = allocate_ast_zero(sizeof(designator[0]));
1623 designator->source_position = token.source_position;
1625 add_anchor_token(']');
1626 designator->array_index = parse_constant_expression();
1627 rem_anchor_token(']');
1628 expect(']', end_error);
1631 designator = allocate_ast_zero(sizeof(designator[0]));
1632 designator->source_position = token.source_position;
1634 if (token.type != T_IDENTIFIER) {
1635 parse_error_expected("while parsing designator",
1636 T_IDENTIFIER, NULL);
1639 designator->symbol = token.symbol;
1643 expect('=', end_error);
1647 assert(designator != NULL);
1648 *anchor = designator;
1649 anchor = &designator->next;
1655 static initializer_t *initializer_from_string(array_type_t *const type,
1656 const string_t *const string)
1658 /* TODO: check len vs. size of array type */
1661 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1662 initializer->string.string = *string;
1667 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1668 const string_t *const string)
1670 /* TODO: check len vs. size of array type */
1673 initializer_t *const initializer =
1674 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1675 initializer->wide_string.string = *string;
1681 * Build an initializer from a given expression.
1683 static initializer_t *initializer_from_expression(type_t *orig_type,
1684 expression_t *expression)
1686 /* TODO check that expression is a constant expression */
1688 /* §6.7.8.14/15 char array may be initialized by string literals */
1689 type_t *type = skip_typeref(orig_type);
1690 type_t *expr_type_orig = expression->base.type;
1691 type_t *expr_type = skip_typeref(expr_type_orig);
1693 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1694 array_type_t *const array_type = &type->array;
1695 type_t *const element_type = skip_typeref(array_type->element_type);
1697 if (element_type->kind == TYPE_ATOMIC) {
1698 atomic_type_kind_t akind = element_type->atomic.akind;
1699 switch (expression->kind) {
1700 case EXPR_STRING_LITERAL:
1701 if (akind == ATOMIC_TYPE_CHAR
1702 || akind == ATOMIC_TYPE_SCHAR
1703 || akind == ATOMIC_TYPE_UCHAR) {
1704 return initializer_from_string(array_type,
1705 &expression->string_literal.value);
1709 case EXPR_WIDE_STRING_LITERAL: {
1710 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1711 if (get_unqualified_type(element_type) == bare_wchar_type) {
1712 return initializer_from_wide_string(array_type,
1713 &expression->string_literal.value);
1724 assign_error_t error = semantic_assign(type, expression);
1725 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1727 report_assign_error(error, type, expression, "initializer",
1728 &expression->base.source_position);
1730 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1731 result->value.value = create_implicit_cast(expression, type);
1737 * Checks if a given expression can be used as an constant initializer.
1739 static bool is_initializer_constant(const expression_t *expression)
1742 is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1743 is_address_constant(expression) != EXPR_CLASS_VARIABLE;
1747 * Parses an scalar initializer.
1749 * §6.7.8.11; eat {} without warning
1751 static initializer_t *parse_scalar_initializer(type_t *type,
1752 bool must_be_constant)
1754 /* there might be extra {} hierarchies */
1758 warningf(HERE, "extra curly braces around scalar initializer");
1761 } while (next_if('{'));
1764 expression_t *expression = parse_assignment_expression();
1765 mark_vars_read(expression, NULL);
1766 if (must_be_constant && !is_initializer_constant(expression)) {
1767 errorf(&expression->base.source_position,
1768 "initialisation expression '%E' is not constant",
1772 initializer_t *initializer = initializer_from_expression(type, expression);
1774 if (initializer == NULL) {
1775 errorf(&expression->base.source_position,
1776 "expression '%E' (type '%T') doesn't match expected type '%T'",
1777 expression, expression->base.type, type);
1782 bool additional_warning_displayed = false;
1783 while (braces > 0) {
1785 if (token.type != '}') {
1786 if (!additional_warning_displayed && warning.other) {
1787 warningf(HERE, "additional elements in scalar initializer");
1788 additional_warning_displayed = true;
1799 * An entry in the type path.
1801 typedef struct type_path_entry_t type_path_entry_t;
1802 struct type_path_entry_t {
1803 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1805 size_t index; /**< For array types: the current index. */
1806 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1811 * A type path expression a position inside compound or array types.
1813 typedef struct type_path_t type_path_t;
1814 struct type_path_t {
1815 type_path_entry_t *path; /**< An flexible array containing the current path. */
1816 type_t *top_type; /**< type of the element the path points */
1817 size_t max_index; /**< largest index in outermost array */
1821 * Prints a type path for debugging.
1823 static __attribute__((unused)) void debug_print_type_path(
1824 const type_path_t *path)
1826 size_t len = ARR_LEN(path->path);
1828 for (size_t i = 0; i < len; ++i) {
1829 const type_path_entry_t *entry = & path->path[i];
1831 type_t *type = skip_typeref(entry->type);
1832 if (is_type_compound(type)) {
1833 /* in gcc mode structs can have no members */
1834 if (entry->v.compound_entry == NULL) {
1838 fprintf(stderr, ".%s",
1839 entry->v.compound_entry->base.symbol->string);
1840 } else if (is_type_array(type)) {
1841 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1843 fprintf(stderr, "-INVALID-");
1846 if (path->top_type != NULL) {
1847 fprintf(stderr, " (");
1848 print_type(path->top_type);
1849 fprintf(stderr, ")");
1854 * Return the top type path entry, ie. in a path
1855 * (type).a.b returns the b.
1857 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1859 size_t len = ARR_LEN(path->path);
1861 return &path->path[len-1];
1865 * Enlarge the type path by an (empty) element.
1867 static type_path_entry_t *append_to_type_path(type_path_t *path)
1869 size_t len = ARR_LEN(path->path);
1870 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1872 type_path_entry_t *result = & path->path[len];
1873 memset(result, 0, sizeof(result[0]));
1878 * Descending into a sub-type. Enter the scope of the current top_type.
1880 static void descend_into_subtype(type_path_t *path)
1882 type_t *orig_top_type = path->top_type;
1883 type_t *top_type = skip_typeref(orig_top_type);
1885 type_path_entry_t *top = append_to_type_path(path);
1886 top->type = top_type;
1888 if (is_type_compound(top_type)) {
1889 compound_t *compound = top_type->compound.compound;
1890 entity_t *entry = compound->members.entities;
1892 if (entry != NULL) {
1893 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1894 top->v.compound_entry = &entry->declaration;
1895 path->top_type = entry->declaration.type;
1897 path->top_type = NULL;
1899 } else if (is_type_array(top_type)) {
1901 path->top_type = top_type->array.element_type;
1903 assert(!is_type_valid(top_type));
1908 * Pop an entry from the given type path, ie. returning from
1909 * (type).a.b to (type).a
1911 static void ascend_from_subtype(type_path_t *path)
1913 type_path_entry_t *top = get_type_path_top(path);
1915 path->top_type = top->type;
1917 size_t len = ARR_LEN(path->path);
1918 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1922 * Pop entries from the given type path until the given
1923 * path level is reached.
1925 static void ascend_to(type_path_t *path, size_t top_path_level)
1927 size_t len = ARR_LEN(path->path);
1929 while (len > top_path_level) {
1930 ascend_from_subtype(path);
1931 len = ARR_LEN(path->path);
1935 static bool walk_designator(type_path_t *path, const designator_t *designator,
1936 bool used_in_offsetof)
1938 for (; designator != NULL; designator = designator->next) {
1939 type_path_entry_t *top = get_type_path_top(path);
1940 type_t *orig_type = top->type;
1942 type_t *type = skip_typeref(orig_type);
1944 if (designator->symbol != NULL) {
1945 symbol_t *symbol = designator->symbol;
1946 if (!is_type_compound(type)) {
1947 if (is_type_valid(type)) {
1948 errorf(&designator->source_position,
1949 "'.%Y' designator used for non-compound type '%T'",
1953 top->type = type_error_type;
1954 top->v.compound_entry = NULL;
1955 orig_type = type_error_type;
1957 compound_t *compound = type->compound.compound;
1958 entity_t *iter = compound->members.entities;
1959 for (; iter != NULL; iter = iter->base.next) {
1960 if (iter->base.symbol == symbol) {
1965 errorf(&designator->source_position,
1966 "'%T' has no member named '%Y'", orig_type, symbol);
1969 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1970 if (used_in_offsetof) {
1971 type_t *real_type = skip_typeref(iter->declaration.type);
1972 if (real_type->kind == TYPE_BITFIELD) {
1973 errorf(&designator->source_position,
1974 "offsetof designator '%Y' must not specify bitfield",
1980 top->type = orig_type;
1981 top->v.compound_entry = &iter->declaration;
1982 orig_type = iter->declaration.type;
1985 expression_t *array_index = designator->array_index;
1986 assert(designator->array_index != NULL);
1988 if (!is_type_array(type)) {
1989 if (is_type_valid(type)) {
1990 errorf(&designator->source_position,
1991 "[%E] designator used for non-array type '%T'",
1992 array_index, orig_type);
1997 long index = fold_constant_to_int(array_index);
1998 if (!used_in_offsetof) {
2000 errorf(&designator->source_position,
2001 "array index [%E] must be positive", array_index);
2002 } else if (type->array.size_constant) {
2003 long array_size = type->array.size;
2004 if (index >= array_size) {
2005 errorf(&designator->source_position,
2006 "designator [%E] (%d) exceeds array size %d",
2007 array_index, index, array_size);
2012 top->type = orig_type;
2013 top->v.index = (size_t) index;
2014 orig_type = type->array.element_type;
2016 path->top_type = orig_type;
2018 if (designator->next != NULL) {
2019 descend_into_subtype(path);
2025 static void advance_current_object(type_path_t *path, size_t top_path_level)
2027 type_path_entry_t *top = get_type_path_top(path);
2029 type_t *type = skip_typeref(top->type);
2030 if (is_type_union(type)) {
2031 /* in unions only the first element is initialized */
2032 top->v.compound_entry = NULL;
2033 } else if (is_type_struct(type)) {
2034 declaration_t *entry = top->v.compound_entry;
2036 entity_t *next_entity = entry->base.next;
2037 if (next_entity != NULL) {
2038 assert(is_declaration(next_entity));
2039 entry = &next_entity->declaration;
2044 top->v.compound_entry = entry;
2045 if (entry != NULL) {
2046 path->top_type = entry->type;
2049 } else if (is_type_array(type)) {
2050 assert(is_type_array(type));
2054 if (!type->array.size_constant || top->v.index < type->array.size) {
2058 assert(!is_type_valid(type));
2062 /* we're past the last member of the current sub-aggregate, try if we
2063 * can ascend in the type hierarchy and continue with another subobject */
2064 size_t len = ARR_LEN(path->path);
2066 if (len > top_path_level) {
2067 ascend_from_subtype(path);
2068 advance_current_object(path, top_path_level);
2070 path->top_type = NULL;
2075 * skip any {...} blocks until a closing bracket is reached.
2077 static void skip_initializers(void)
2081 while (token.type != '}') {
2082 if (token.type == T_EOF)
2084 if (token.type == '{') {
2092 static initializer_t *create_empty_initializer(void)
2094 static initializer_t empty_initializer
2095 = { .list = { { INITIALIZER_LIST }, 0 } };
2096 return &empty_initializer;
2100 * Parse a part of an initialiser for a struct or union,
2102 static initializer_t *parse_sub_initializer(type_path_t *path,
2103 type_t *outer_type, size_t top_path_level,
2104 parse_initializer_env_t *env)
2106 if (token.type == '}') {
2107 /* empty initializer */
2108 return create_empty_initializer();
2111 type_t *orig_type = path->top_type;
2112 type_t *type = NULL;
2114 if (orig_type == NULL) {
2115 /* We are initializing an empty compound. */
2117 type = skip_typeref(orig_type);
2120 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2123 designator_t *designator = NULL;
2124 if (token.type == '.' || token.type == '[') {
2125 designator = parse_designation();
2126 goto finish_designator;
2127 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2128 /* GNU-style designator ("identifier: value") */
2129 designator = allocate_ast_zero(sizeof(designator[0]));
2130 designator->source_position = token.source_position;
2131 designator->symbol = token.symbol;
2136 /* reset path to toplevel, evaluate designator from there */
2137 ascend_to(path, top_path_level);
2138 if (!walk_designator(path, designator, false)) {
2139 /* can't continue after designation error */
2143 initializer_t *designator_initializer
2144 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2145 designator_initializer->designator.designator = designator;
2146 ARR_APP1(initializer_t*, initializers, designator_initializer);
2148 orig_type = path->top_type;
2149 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2154 if (token.type == '{') {
2155 if (type != NULL && is_type_scalar(type)) {
2156 sub = parse_scalar_initializer(type, env->must_be_constant);
2159 if (env->entity != NULL) {
2161 "extra brace group at end of initializer for '%Y'",
2162 env->entity->base.symbol);
2164 errorf(HERE, "extra brace group at end of initializer");
2169 descend_into_subtype(path);
2172 add_anchor_token('}');
2173 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2175 rem_anchor_token('}');
2178 ascend_from_subtype(path);
2179 expect('}', end_error);
2181 expect('}', end_error);
2182 goto error_parse_next;
2186 /* must be an expression */
2187 expression_t *expression = parse_assignment_expression();
2188 mark_vars_read(expression, NULL);
2190 if (env->must_be_constant && !is_initializer_constant(expression)) {
2191 errorf(&expression->base.source_position,
2192 "Initialisation expression '%E' is not constant",
2197 /* we are already outside, ... */
2198 if (outer_type == NULL)
2199 goto error_parse_next;
2200 type_t *const outer_type_skip = skip_typeref(outer_type);
2201 if (is_type_compound(outer_type_skip) &&
2202 !outer_type_skip->compound.compound->complete) {
2203 goto error_parse_next;
2208 /* handle { "string" } special case */
2209 if ((expression->kind == EXPR_STRING_LITERAL
2210 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2211 && outer_type != NULL) {
2212 sub = initializer_from_expression(outer_type, expression);
2215 if (token.type != '}' && warning.other) {
2216 warningf(HERE, "excessive elements in initializer for type '%T'",
2219 /* TODO: eat , ... */
2224 /* descend into subtypes until expression matches type */
2226 orig_type = path->top_type;
2227 type = skip_typeref(orig_type);
2229 sub = initializer_from_expression(orig_type, expression);
2233 if (!is_type_valid(type)) {
2236 if (is_type_scalar(type)) {
2237 errorf(&expression->base.source_position,
2238 "expression '%E' doesn't match expected type '%T'",
2239 expression, orig_type);
2243 descend_into_subtype(path);
2247 /* update largest index of top array */
2248 const type_path_entry_t *first = &path->path[0];
2249 type_t *first_type = first->type;
2250 first_type = skip_typeref(first_type);
2251 if (is_type_array(first_type)) {
2252 size_t index = first->v.index;
2253 if (index > path->max_index)
2254 path->max_index = index;
2258 /* append to initializers list */
2259 ARR_APP1(initializer_t*, initializers, sub);
2262 if (warning.other) {
2263 if (env->entity != NULL) {
2264 warningf(HERE, "excess elements in initializer for '%Y'",
2265 env->entity->base.symbol);
2267 warningf(HERE, "excess elements in initializer");
2273 if (token.type == '}') {
2276 expect(',', end_error);
2277 if (token.type == '}') {
2282 /* advance to the next declaration if we are not at the end */
2283 advance_current_object(path, top_path_level);
2284 orig_type = path->top_type;
2285 if (orig_type != NULL)
2286 type = skip_typeref(orig_type);
2292 size_t len = ARR_LEN(initializers);
2293 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2294 initializer_t *result = allocate_ast_zero(size);
2295 result->kind = INITIALIZER_LIST;
2296 result->list.len = len;
2297 memcpy(&result->list.initializers, initializers,
2298 len * sizeof(initializers[0]));
2300 DEL_ARR_F(initializers);
2301 ascend_to(path, top_path_level+1);
2306 skip_initializers();
2307 DEL_ARR_F(initializers);
2308 ascend_to(path, top_path_level+1);
2312 static expression_t *make_size_literal(size_t value)
2314 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2315 literal->base.type = type_size_t;
2318 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2319 literal->literal.value = make_string(buf);
2325 * Parses an initializer. Parsers either a compound literal
2326 * (env->declaration == NULL) or an initializer of a declaration.
2328 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2330 type_t *type = skip_typeref(env->type);
2331 size_t max_index = 0;
2332 initializer_t *result;
2334 if (is_type_scalar(type)) {
2335 result = parse_scalar_initializer(type, env->must_be_constant);
2336 } else if (token.type == '{') {
2340 memset(&path, 0, sizeof(path));
2341 path.top_type = env->type;
2342 path.path = NEW_ARR_F(type_path_entry_t, 0);
2344 descend_into_subtype(&path);
2346 add_anchor_token('}');
2347 result = parse_sub_initializer(&path, env->type, 1, env);
2348 rem_anchor_token('}');
2350 max_index = path.max_index;
2351 DEL_ARR_F(path.path);
2353 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;
2403 static void append_entity(scope_t *scope, entity_t *entity)
2405 if (scope->last_entity != NULL) {
2406 scope->last_entity->base.next = entity;
2408 scope->entities = entity;
2410 entity->base.parent_entity = current_entity;
2411 scope->last_entity = entity;
2415 static compound_t *parse_compound_type_specifier(bool is_struct)
2417 source_position_t const pos = *HERE;
2418 eat(is_struct ? T_struct : T_union);
2420 symbol_t *symbol = NULL;
2421 entity_t *entity = NULL;
2422 attribute_t *attributes = NULL;
2424 if (token.type == T___attribute__) {
2425 attributes = parse_attributes(NULL);
2428 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2429 if (token.type == T_IDENTIFIER) {
2430 /* the compound has a name, check if we have seen it already */
2431 symbol = token.symbol;
2432 entity = get_tag(symbol, kind);
2435 if (entity != NULL) {
2436 if (entity->base.parent_scope != current_scope &&
2437 (token.type == '{' || token.type == ';')) {
2438 /* we're in an inner scope and have a definition. Shadow
2439 * existing definition in outer scope */
2441 } else if (entity->compound.complete && token.type == '{') {
2442 errorf(&pos, "multiple definitions of '%s %Y' (previous definition %P)",
2443 is_struct ? "struct" : "union", symbol,
2444 &entity->base.source_position);
2445 /* clear members in the hope to avoid further errors */
2446 entity->compound.members.entities = NULL;
2449 } else if (token.type != '{') {
2450 char const *const msg =
2451 is_struct ? "while parsing struct type specifier" :
2452 "while parsing union type specifier";
2453 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2458 if (entity == NULL) {
2459 entity = allocate_entity_zero(kind);
2461 entity->compound.alignment = 1;
2462 entity->base.namespc = NAMESPACE_TAG;
2463 entity->base.source_position = pos;
2464 entity->base.symbol = symbol;
2465 entity->base.parent_scope = current_scope;
2466 if (symbol != NULL) {
2467 environment_push(entity);
2469 append_entity(current_scope, entity);
2472 if (token.type == '{') {
2473 parse_compound_type_entries(&entity->compound);
2475 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2476 if (symbol == NULL) {
2477 assert(anonymous_entity == NULL);
2478 anonymous_entity = entity;
2482 if (attributes != NULL) {
2483 handle_entity_attributes(attributes, entity);
2486 return &entity->compound;
2489 static void parse_enum_entries(type_t *const enum_type)
2493 if (token.type == '}') {
2494 errorf(HERE, "empty enum not allowed");
2499 add_anchor_token('}');
2501 if (token.type != T_IDENTIFIER) {
2502 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2504 rem_anchor_token('}');
2508 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2509 entity->enum_value.enum_type = enum_type;
2510 entity->base.namespc = NAMESPACE_NORMAL;
2511 entity->base.symbol = token.symbol;
2512 entity->base.source_position = token.source_position;
2516 expression_t *value = parse_constant_expression();
2518 value = create_implicit_cast(value, enum_type);
2519 entity->enum_value.value = value;
2524 record_entity(entity, false);
2525 } while (next_if(',') && token.type != '}');
2526 rem_anchor_token('}');
2528 expect('}', end_error);
2534 static type_t *parse_enum_specifier(void)
2536 source_position_t const pos = *HERE;
2541 switch (token.type) {
2543 symbol = token.symbol;
2544 entity = get_tag(symbol, ENTITY_ENUM);
2547 if (entity != NULL) {
2548 if (entity->base.parent_scope != current_scope &&
2549 (token.type == '{' || token.type == ';')) {
2550 /* we're in an inner scope and have a definition. Shadow
2551 * existing definition in outer scope */
2553 } else if (entity->enume.complete && token.type == '{') {
2554 errorf(&pos, "multiple definitions of 'enum %Y' (previous definition %P)",
2555 symbol, &entity->base.source_position);
2566 parse_error_expected("while parsing enum type specifier",
2567 T_IDENTIFIER, '{', NULL);
2571 if (entity == NULL) {
2572 entity = allocate_entity_zero(ENTITY_ENUM);
2573 entity->base.namespc = NAMESPACE_TAG;
2574 entity->base.source_position = pos;
2575 entity->base.symbol = symbol;
2576 entity->base.parent_scope = current_scope;
2579 type_t *const type = allocate_type_zero(TYPE_ENUM);
2580 type->enumt.enume = &entity->enume;
2581 type->enumt.akind = ATOMIC_TYPE_INT;
2583 if (token.type == '{') {
2584 if (symbol != NULL) {
2585 environment_push(entity);
2587 append_entity(current_scope, entity);
2588 entity->enume.complete = true;
2590 parse_enum_entries(type);
2591 parse_attributes(NULL);
2593 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2594 if (symbol == NULL) {
2595 assert(anonymous_entity == NULL);
2596 anonymous_entity = entity;
2598 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2599 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2607 * if a symbol is a typedef to another type, return true
2609 static bool is_typedef_symbol(symbol_t *symbol)
2611 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2612 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2615 static type_t *parse_typeof(void)
2621 expect('(', end_error);
2622 add_anchor_token(')');
2624 expression_t *expression = NULL;
2626 bool old_type_prop = in_type_prop;
2627 bool old_gcc_extension = in_gcc_extension;
2628 in_type_prop = true;
2630 while (next_if(T___extension__)) {
2631 /* This can be a prefix to a typename or an expression. */
2632 in_gcc_extension = true;
2634 switch (token.type) {
2636 if (is_typedef_symbol(token.symbol)) {
2638 type = parse_typename();
2641 expression = parse_expression();
2642 type = revert_automatic_type_conversion(expression);
2646 in_type_prop = old_type_prop;
2647 in_gcc_extension = old_gcc_extension;
2649 rem_anchor_token(')');
2650 expect(')', end_error);
2652 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2653 typeof_type->typeoft.expression = expression;
2654 typeof_type->typeoft.typeof_type = type;
2661 typedef enum specifiers_t {
2662 SPECIFIER_SIGNED = 1 << 0,
2663 SPECIFIER_UNSIGNED = 1 << 1,
2664 SPECIFIER_LONG = 1 << 2,
2665 SPECIFIER_INT = 1 << 3,
2666 SPECIFIER_DOUBLE = 1 << 4,
2667 SPECIFIER_CHAR = 1 << 5,
2668 SPECIFIER_WCHAR_T = 1 << 6,
2669 SPECIFIER_SHORT = 1 << 7,
2670 SPECIFIER_LONG_LONG = 1 << 8,
2671 SPECIFIER_FLOAT = 1 << 9,
2672 SPECIFIER_BOOL = 1 << 10,
2673 SPECIFIER_VOID = 1 << 11,
2674 SPECIFIER_INT8 = 1 << 12,
2675 SPECIFIER_INT16 = 1 << 13,
2676 SPECIFIER_INT32 = 1 << 14,
2677 SPECIFIER_INT64 = 1 << 15,
2678 SPECIFIER_INT128 = 1 << 16,
2679 SPECIFIER_COMPLEX = 1 << 17,
2680 SPECIFIER_IMAGINARY = 1 << 18,
2683 static type_t *get_typedef_type(symbol_t *symbol)
2685 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2686 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2689 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2690 type->typedeft.typedefe = &entity->typedefe;
2695 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2697 expect('(', end_error);
2699 attribute_property_argument_t *property
2700 = allocate_ast_zero(sizeof(*property));
2703 if (token.type != T_IDENTIFIER) {
2704 parse_error_expected("while parsing property declspec",
2705 T_IDENTIFIER, NULL);
2710 symbol_t *symbol = token.symbol;
2712 if (strcmp(symbol->string, "put") == 0) {
2714 } else if (strcmp(symbol->string, "get") == 0) {
2717 errorf(HERE, "expected put or get in property declspec");
2720 expect('=', end_error);
2721 if (token.type != T_IDENTIFIER) {
2722 parse_error_expected("while parsing property declspec",
2723 T_IDENTIFIER, NULL);
2727 property->put_symbol = token.symbol;
2729 property->get_symbol = token.symbol;
2732 } while (next_if(','));
2734 attribute->a.property = property;
2736 expect(')', end_error);
2742 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2744 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2745 if (next_if(T_restrict)) {
2746 kind = ATTRIBUTE_MS_RESTRICT;
2747 } else if (token.type == T_IDENTIFIER) {
2748 const char *name = token.symbol->string;
2750 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2752 const char *attribute_name = get_attribute_name(k);
2753 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2759 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2760 warningf(HERE, "unknown __declspec '%s' ignored", name);
2763 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2767 attribute_t *attribute = allocate_attribute_zero(kind);
2769 if (kind == ATTRIBUTE_MS_PROPERTY) {
2770 return parse_attribute_ms_property(attribute);
2773 /* parse arguments */
2775 attribute->a.arguments = parse_attribute_arguments();
2780 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2784 expect('(', end_error);
2789 add_anchor_token(')');
2791 attribute_t **anchor = &first;
2793 while (*anchor != NULL)
2794 anchor = &(*anchor)->next;
2796 attribute_t *attribute
2797 = parse_microsoft_extended_decl_modifier_single();
2798 if (attribute == NULL)
2801 *anchor = attribute;
2802 anchor = &attribute->next;
2803 } while (next_if(','));
2805 rem_anchor_token(')');
2806 expect(')', end_error);
2810 rem_anchor_token(')');
2814 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2816 entity_t *entity = allocate_entity_zero(kind);
2817 entity->base.namespc = NAMESPACE_NORMAL;
2818 entity->base.source_position = *HERE;
2819 entity->base.symbol = symbol;
2820 if (is_declaration(entity)) {
2821 entity->declaration.type = type_error_type;
2822 entity->declaration.implicit = true;
2823 } else if (kind == ENTITY_TYPEDEF) {
2824 entity->typedefe.type = type_error_type;
2825 entity->typedefe.builtin = true;
2827 if (kind != ENTITY_COMPOUND_MEMBER)
2828 record_entity(entity, false);
2832 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2834 type_t *type = NULL;
2835 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2836 unsigned type_specifiers = 0;
2837 bool newtype = false;
2838 bool saw_error = false;
2839 bool old_gcc_extension = in_gcc_extension;
2841 specifiers->source_position = token.source_position;
2844 specifiers->attributes = parse_attributes(specifiers->attributes);
2846 switch (token.type) {
2848 #define MATCH_STORAGE_CLASS(token, class) \
2850 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2851 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2853 specifiers->storage_class = class; \
2854 if (specifiers->thread_local) \
2855 goto check_thread_storage_class; \
2859 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2860 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2861 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2862 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2863 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2866 specifiers->attributes
2867 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2871 if (specifiers->thread_local) {
2872 errorf(HERE, "duplicate '__thread'");
2874 specifiers->thread_local = true;
2875 check_thread_storage_class:
2876 switch (specifiers->storage_class) {
2877 case STORAGE_CLASS_EXTERN:
2878 case STORAGE_CLASS_NONE:
2879 case STORAGE_CLASS_STATIC:
2883 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2884 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2885 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2886 wrong_thread_storage_class:
2887 errorf(HERE, "'__thread' used with '%s'", wrong);
2894 /* type qualifiers */
2895 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2897 qualifiers |= qualifier; \
2901 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2902 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2903 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2904 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2905 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2906 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2907 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2908 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2910 case T___extension__:
2912 in_gcc_extension = true;
2915 /* type specifiers */
2916 #define MATCH_SPECIFIER(token, specifier, name) \
2918 if (type_specifiers & specifier) { \
2919 errorf(HERE, "multiple " name " type specifiers given"); \
2921 type_specifiers |= specifier; \
2926 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2927 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2928 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2929 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2930 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2931 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2932 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2933 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2934 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2935 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2936 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2937 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2938 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2939 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2940 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2941 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2942 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2943 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2947 specifiers->is_inline = true;
2951 case T__forceinline:
2953 specifiers->modifiers |= DM_FORCEINLINE;
2958 if (type_specifiers & SPECIFIER_LONG_LONG) {
2959 errorf(HERE, "too many long type specifiers given");
2960 } else if (type_specifiers & SPECIFIER_LONG) {
2961 type_specifiers |= SPECIFIER_LONG_LONG;
2963 type_specifiers |= SPECIFIER_LONG;
2968 #define CHECK_DOUBLE_TYPE() \
2969 if ( type != NULL) \
2970 errorf(HERE, "multiple data types in declaration specifiers");
2973 CHECK_DOUBLE_TYPE();
2974 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2976 type->compound.compound = parse_compound_type_specifier(true);
2979 CHECK_DOUBLE_TYPE();
2980 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2981 type->compound.compound = parse_compound_type_specifier(false);
2984 CHECK_DOUBLE_TYPE();
2985 type = parse_enum_specifier();
2988 CHECK_DOUBLE_TYPE();
2989 type = parse_typeof();
2991 case T___builtin_va_list:
2992 CHECK_DOUBLE_TYPE();
2993 type = duplicate_type(type_valist);
2997 case T_IDENTIFIER: {
2998 /* only parse identifier if we haven't found a type yet */
2999 if (type != NULL || type_specifiers != 0) {
3000 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3001 * declaration, so it doesn't generate errors about expecting '(' or
3003 switch (look_ahead(1)->type) {
3010 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3014 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3019 goto finish_specifiers;
3023 type_t *const typedef_type = get_typedef_type(token.symbol);
3024 if (typedef_type == NULL) {
3025 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3026 * declaration, so it doesn't generate 'implicit int' followed by more
3027 * errors later on. */
3028 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3034 errorf(HERE, "%K does not name a type", &token);
3037 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3039 type = allocate_type_zero(TYPE_TYPEDEF);
3040 type->typedeft.typedefe = &entity->typedefe;
3048 goto finish_specifiers;
3053 type = typedef_type;
3057 /* function specifier */
3059 goto finish_specifiers;
3064 specifiers->attributes = parse_attributes(specifiers->attributes);
3066 in_gcc_extension = old_gcc_extension;
3068 if (type == NULL || (saw_error && type_specifiers != 0)) {
3069 atomic_type_kind_t atomic_type;
3071 /* match valid basic types */
3072 switch (type_specifiers) {
3073 case SPECIFIER_VOID:
3074 atomic_type = ATOMIC_TYPE_VOID;
3076 case SPECIFIER_WCHAR_T:
3077 atomic_type = ATOMIC_TYPE_WCHAR_T;
3079 case SPECIFIER_CHAR:
3080 atomic_type = ATOMIC_TYPE_CHAR;
3082 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3083 atomic_type = ATOMIC_TYPE_SCHAR;
3085 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3086 atomic_type = ATOMIC_TYPE_UCHAR;
3088 case SPECIFIER_SHORT:
3089 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3090 case SPECIFIER_SHORT | SPECIFIER_INT:
3091 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3092 atomic_type = ATOMIC_TYPE_SHORT;
3094 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3095 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3096 atomic_type = ATOMIC_TYPE_USHORT;
3099 case SPECIFIER_SIGNED:
3100 case SPECIFIER_SIGNED | SPECIFIER_INT:
3101 atomic_type = ATOMIC_TYPE_INT;
3103 case SPECIFIER_UNSIGNED:
3104 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3105 atomic_type = ATOMIC_TYPE_UINT;
3107 case SPECIFIER_LONG:
3108 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3109 case SPECIFIER_LONG | SPECIFIER_INT:
3110 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3111 atomic_type = ATOMIC_TYPE_LONG;
3113 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3114 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3115 atomic_type = ATOMIC_TYPE_ULONG;
3118 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3119 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3120 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3121 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3123 atomic_type = ATOMIC_TYPE_LONGLONG;
3124 goto warn_about_long_long;
3126 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3127 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3129 atomic_type = ATOMIC_TYPE_ULONGLONG;
3130 warn_about_long_long:
3131 if (warning.long_long) {
3132 warningf(&specifiers->source_position,
3133 "ISO C90 does not support 'long long'");
3137 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3138 atomic_type = unsigned_int8_type_kind;
3141 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3142 atomic_type = unsigned_int16_type_kind;
3145 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3146 atomic_type = unsigned_int32_type_kind;
3149 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3150 atomic_type = unsigned_int64_type_kind;
3153 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3154 atomic_type = unsigned_int128_type_kind;
3157 case SPECIFIER_INT8:
3158 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3159 atomic_type = int8_type_kind;
3162 case SPECIFIER_INT16:
3163 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3164 atomic_type = int16_type_kind;
3167 case SPECIFIER_INT32:
3168 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3169 atomic_type = int32_type_kind;
3172 case SPECIFIER_INT64:
3173 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3174 atomic_type = int64_type_kind;
3177 case SPECIFIER_INT128:
3178 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3179 atomic_type = int128_type_kind;
3182 case SPECIFIER_FLOAT:
3183 atomic_type = ATOMIC_TYPE_FLOAT;
3185 case SPECIFIER_DOUBLE:
3186 atomic_type = ATOMIC_TYPE_DOUBLE;
3188 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3189 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3191 case SPECIFIER_BOOL:
3192 atomic_type = ATOMIC_TYPE_BOOL;
3194 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3195 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3196 atomic_type = ATOMIC_TYPE_FLOAT;
3198 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3199 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3200 atomic_type = ATOMIC_TYPE_DOUBLE;
3202 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3203 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3204 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3207 /* invalid specifier combination, give an error message */
3208 if (type_specifiers == 0) {
3212 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3213 if (!(c_mode & _CXX) && !strict_mode) {
3214 if (warning.implicit_int) {
3215 warningf(HERE, "no type specifiers in declaration, using 'int'");
3217 atomic_type = ATOMIC_TYPE_INT;
3220 errorf(HERE, "no type specifiers given in declaration");
3222 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3223 (type_specifiers & SPECIFIER_UNSIGNED)) {
3224 errorf(HERE, "signed and unsigned specifiers given");
3225 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3226 errorf(HERE, "only integer types can be signed or unsigned");
3228 errorf(HERE, "multiple datatypes in declaration");
3233 if (type_specifiers & SPECIFIER_COMPLEX) {
3234 type = allocate_type_zero(TYPE_COMPLEX);
3235 type->complex.akind = atomic_type;
3236 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3237 type = allocate_type_zero(TYPE_IMAGINARY);
3238 type->imaginary.akind = atomic_type;
3240 type = allocate_type_zero(TYPE_ATOMIC);
3241 type->atomic.akind = atomic_type;
3244 } else if (type_specifiers != 0) {
3245 errorf(HERE, "multiple datatypes in declaration");
3248 /* FIXME: check type qualifiers here */
3249 type->base.qualifiers = qualifiers;
3252 type = identify_new_type(type);
3254 type = typehash_insert(type);
3257 if (specifiers->attributes != NULL)
3258 type = handle_type_attributes(specifiers->attributes, type);
3259 specifiers->type = type;
3263 specifiers->type = type_error_type;
3266 static type_qualifiers_t parse_type_qualifiers(void)
3268 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3271 switch (token.type) {
3272 /* type qualifiers */
3273 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3274 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3275 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3276 /* microsoft extended type modifiers */
3277 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3278 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3279 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3280 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3281 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3290 * Parses an K&R identifier list
3292 static void parse_identifier_list(scope_t *scope)
3295 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3296 entity->base.source_position = token.source_position;
3297 entity->base.namespc = NAMESPACE_NORMAL;
3298 entity->base.symbol = token.symbol;
3299 /* a K&R parameter has no type, yet */
3303 append_entity(scope, entity);
3304 } while (next_if(',') && token.type == T_IDENTIFIER);
3307 static entity_t *parse_parameter(void)
3309 declaration_specifiers_t specifiers;
3310 memset(&specifiers, 0, sizeof(specifiers));
3312 parse_declaration_specifiers(&specifiers);
3314 entity_t *entity = parse_declarator(&specifiers,
3315 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3316 anonymous_entity = NULL;
3320 static void semantic_parameter_incomplete(const entity_t *entity)
3322 assert(entity->kind == ENTITY_PARAMETER);
3324 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3325 * list in a function declarator that is part of a
3326 * definition of that function shall not have
3327 * incomplete type. */
3328 type_t *type = skip_typeref(entity->declaration.type);
3329 if (is_type_incomplete(type)) {
3330 errorf(&entity->base.source_position,
3331 "parameter '%#T' has incomplete type",
3332 entity->declaration.type, entity->base.symbol);
3336 static bool has_parameters(void)
3338 /* func(void) is not a parameter */
3339 if (token.type == T_IDENTIFIER) {
3340 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3343 if (entity->kind != ENTITY_TYPEDEF)
3345 if (skip_typeref(entity->typedefe.type) != type_void)
3347 } else if (token.type != T_void) {
3350 if (look_ahead(1)->type != ')')
3357 * Parses function type parameters (and optionally creates variable_t entities
3358 * for them in a scope)
3360 static void parse_parameters(function_type_t *type, scope_t *scope)
3363 add_anchor_token(')');
3364 int saved_comma_state = save_and_reset_anchor_state(',');
3366 if (token.type == T_IDENTIFIER &&
3367 !is_typedef_symbol(token.symbol)) {
3368 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3369 if (la1_type == ',' || la1_type == ')') {
3370 type->kr_style_parameters = true;
3371 parse_identifier_list(scope);
3372 goto parameters_finished;
3376 if (token.type == ')') {
3377 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3378 if (!(c_mode & _CXX))
3379 type->unspecified_parameters = true;
3380 } else if (has_parameters()) {
3381 function_parameter_t **anchor = &type->parameters;
3383 switch (token.type) {
3386 type->variadic = true;
3387 goto parameters_finished;
3390 case T___extension__:
3393 entity_t *entity = parse_parameter();
3394 if (entity->kind == ENTITY_TYPEDEF) {
3395 errorf(&entity->base.source_position,
3396 "typedef not allowed as function parameter");
3399 assert(is_declaration(entity));
3401 semantic_parameter_incomplete(entity);
3403 function_parameter_t *const parameter =
3404 allocate_parameter(entity->declaration.type);
3406 if (scope != NULL) {
3407 append_entity(scope, entity);
3410 *anchor = parameter;
3411 anchor = ¶meter->next;
3416 goto parameters_finished;
3418 } while (next_if(','));
3421 parameters_finished:
3422 rem_anchor_token(')');
3423 expect(')', end_error);
3426 restore_anchor_state(',', saved_comma_state);
3429 typedef enum construct_type_kind_t {
3432 CONSTRUCT_REFERENCE,
3435 } construct_type_kind_t;
3437 typedef union construct_type_t construct_type_t;
3439 typedef struct construct_type_base_t {
3440 construct_type_kind_t kind;
3441 source_position_t pos;
3442 construct_type_t *next;
3443 } construct_type_base_t;
3445 typedef struct parsed_pointer_t {
3446 construct_type_base_t base;
3447 type_qualifiers_t type_qualifiers;
3448 variable_t *base_variable; /**< MS __based extension. */
3451 typedef struct parsed_reference_t {
3452 construct_type_base_t base;
3453 } parsed_reference_t;
3455 typedef struct construct_function_type_t {
3456 construct_type_base_t base;
3457 type_t *function_type;
3458 } construct_function_type_t;
3460 typedef struct parsed_array_t {
3461 construct_type_base_t base;
3462 type_qualifiers_t type_qualifiers;
3468 union construct_type_t {
3469 construct_type_kind_t kind;
3470 construct_type_base_t base;
3471 parsed_pointer_t pointer;
3472 parsed_reference_t reference;
3473 construct_function_type_t function;
3474 parsed_array_t array;
3477 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3479 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3480 memset(cons, 0, size);
3482 cons->base.pos = *HERE;
3487 static construct_type_t *parse_pointer_declarator(void)
3489 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3491 cons->pointer.type_qualifiers = parse_type_qualifiers();
3492 //cons->pointer.base_variable = base_variable;
3497 /* ISO/IEC 14882:1998(E) §8.3.2 */
3498 static construct_type_t *parse_reference_declarator(void)
3500 if (!(c_mode & _CXX))
3501 errorf(HERE, "references are only available for C++");
3503 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3510 static construct_type_t *parse_array_declarator(void)
3512 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3513 parsed_array_t *const array = &cons->array;
3516 add_anchor_token(']');
3518 bool is_static = next_if(T_static);
3520 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3523 is_static = next_if(T_static);
3525 array->type_qualifiers = type_qualifiers;
3526 array->is_static = is_static;
3528 expression_t *size = NULL;
3529 if (token.type == '*' && look_ahead(1)->type == ']') {
3530 array->is_variable = true;
3532 } else if (token.type != ']') {
3533 size = parse_assignment_expression();
3535 /* §6.7.5.2:1 Array size must have integer type */
3536 type_t *const orig_type = size->base.type;
3537 type_t *const type = skip_typeref(orig_type);
3538 if (!is_type_integer(type) && is_type_valid(type)) {
3539 errorf(&size->base.source_position,
3540 "array size '%E' must have integer type but has type '%T'",
3545 mark_vars_read(size, NULL);
3548 if (is_static && size == NULL)
3549 errorf(&array->base.pos, "static array parameters require a size");
3551 rem_anchor_token(']');
3552 expect(']', end_error);
3559 static construct_type_t *parse_function_declarator(scope_t *scope)
3561 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3563 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3564 function_type_t *ftype = &type->function;
3566 ftype->linkage = current_linkage;
3567 ftype->calling_convention = CC_DEFAULT;
3569 parse_parameters(ftype, scope);
3571 cons->function.function_type = type;
3576 typedef struct parse_declarator_env_t {
3577 bool may_be_abstract : 1;
3578 bool must_be_abstract : 1;
3579 decl_modifiers_t modifiers;
3581 source_position_t source_position;
3583 attribute_t *attributes;
3584 } parse_declarator_env_t;
3587 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3589 /* construct a single linked list of construct_type_t's which describe
3590 * how to construct the final declarator type */
3591 construct_type_t *first = NULL;
3592 construct_type_t **anchor = &first;
3594 env->attributes = parse_attributes(env->attributes);
3597 construct_type_t *type;
3598 //variable_t *based = NULL; /* MS __based extension */
3599 switch (token.type) {
3601 type = parse_reference_declarator();
3605 panic("based not supported anymore");
3610 type = parse_pointer_declarator();
3614 goto ptr_operator_end;
3618 anchor = &type->base.next;
3620 /* TODO: find out if this is correct */
3621 env->attributes = parse_attributes(env->attributes);
3625 construct_type_t *inner_types = NULL;
3627 switch (token.type) {
3629 if (env->must_be_abstract) {
3630 errorf(HERE, "no identifier expected in typename");
3632 env->symbol = token.symbol;
3633 env->source_position = token.source_position;
3639 /* Parenthesized declarator or function declarator? */
3640 token_t const *const la1 = look_ahead(1);
3641 switch (la1->type) {
3643 if (is_typedef_symbol(la1->symbol)) {
3645 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3646 * interpreted as ``function with no parameter specification'', rather
3647 * than redundant parentheses around the omitted identifier. */
3649 /* Function declarator. */
3650 if (!env->may_be_abstract) {
3651 errorf(HERE, "function declarator must have a name");
3659 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3660 /* Paranthesized declarator. */
3662 add_anchor_token(')');
3663 inner_types = parse_inner_declarator(env);
3664 if (inner_types != NULL) {
3665 /* All later declarators only modify the return type */
3666 env->must_be_abstract = true;
3668 rem_anchor_token(')');
3669 expect(')', end_error);
3677 if (env->may_be_abstract)
3679 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3685 construct_type_t **const p = anchor;
3688 construct_type_t *type;
3689 switch (token.type) {
3691 scope_t *scope = NULL;
3692 if (!env->must_be_abstract) {
3693 scope = &env->parameters;
3696 type = parse_function_declarator(scope);
3700 type = parse_array_declarator();
3703 goto declarator_finished;
3706 /* insert in the middle of the list (at p) */
3707 type->base.next = *p;
3710 anchor = &type->base.next;
3713 declarator_finished:
3714 /* append inner_types at the end of the list, we don't to set anchor anymore
3715 * as it's not needed anymore */
3716 *anchor = inner_types;
3723 static type_t *construct_declarator_type(construct_type_t *construct_list,
3726 construct_type_t *iter = construct_list;
3727 for (; iter != NULL; iter = iter->base.next) {
3728 source_position_t const* const pos = &iter->base.pos;
3729 switch (iter->kind) {
3730 case CONSTRUCT_INVALID:
3732 case CONSTRUCT_FUNCTION: {
3733 construct_function_type_t *function = &iter->function;
3734 type_t *function_type = function->function_type;
3736 function_type->function.return_type = type;
3738 type_t *skipped_return_type = skip_typeref(type);
3740 if (is_type_function(skipped_return_type)) {
3741 errorf(pos, "function returning function is not allowed");
3742 } else if (is_type_array(skipped_return_type)) {
3743 errorf(pos, "function returning array is not allowed");
3745 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3746 warningf(pos, "type qualifiers in return type of function type are meaningless");
3750 /* The function type was constructed earlier. Freeing it here will
3751 * destroy other types. */
3752 type = typehash_insert(function_type);
3756 case CONSTRUCT_POINTER: {
3757 if (is_type_reference(skip_typeref(type)))
3758 errorf(pos, "cannot declare a pointer to reference");
3760 parsed_pointer_t *pointer = &iter->pointer;
3761 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3765 case CONSTRUCT_REFERENCE:
3766 if (is_type_reference(skip_typeref(type)))
3767 errorf(pos, "cannot declare a reference to reference");
3769 type = make_reference_type(type);
3772 case CONSTRUCT_ARRAY: {
3773 if (is_type_reference(skip_typeref(type)))
3774 errorf(pos, "cannot declare an array of references");
3776 parsed_array_t *array = &iter->array;
3777 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3779 expression_t *size_expression = array->size;
3780 if (size_expression != NULL) {
3782 = create_implicit_cast(size_expression, type_size_t);
3785 array_type->base.qualifiers = array->type_qualifiers;
3786 array_type->array.element_type = type;
3787 array_type->array.is_static = array->is_static;
3788 array_type->array.is_variable = array->is_variable;
3789 array_type->array.size_expression = size_expression;
3791 if (size_expression != NULL) {
3792 switch (is_constant_expression(size_expression)) {
3793 case EXPR_CLASS_CONSTANT: {
3794 long const size = fold_constant_to_int(size_expression);
3795 array_type->array.size = size;
3796 array_type->array.size_constant = true;
3797 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3798 * have a value greater than zero. */
3800 if (size < 0 || !GNU_MODE) {
3801 errorf(&size_expression->base.source_position,
3802 "size of array must be greater than zero");
3803 } else if (warning.other) {
3804 warningf(&size_expression->base.source_position,
3805 "zero length arrays are a GCC extension");
3811 case EXPR_CLASS_VARIABLE:
3812 array_type->array.is_vla = true;
3815 case EXPR_CLASS_ERROR:
3820 type_t *skipped_type = skip_typeref(type);
3822 if (is_type_incomplete(skipped_type)) {
3823 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3824 } else if (is_type_function(skipped_type)) {
3825 errorf(pos, "array of functions is not allowed");
3827 type = identify_new_type(array_type);
3831 internal_errorf(pos, "invalid type construction found");
3837 static type_t *automatic_type_conversion(type_t *orig_type);
3839 static type_t *semantic_parameter(const source_position_t *pos,
3841 const declaration_specifiers_t *specifiers,
3844 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3845 * shall be adjusted to ``qualified pointer to type'',
3847 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3848 * type'' shall be adjusted to ``pointer to function
3849 * returning type'', as in 6.3.2.1. */
3850 type = automatic_type_conversion(type);
3852 if (specifiers->is_inline && is_type_valid(type)) {
3853 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3856 /* §6.9.1:6 The declarations in the declaration list shall contain
3857 * no storage-class specifier other than register and no
3858 * initializations. */
3859 if (specifiers->thread_local || (
3860 specifiers->storage_class != STORAGE_CLASS_NONE &&
3861 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3863 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3866 /* delay test for incomplete type, because we might have (void)
3867 * which is legal but incomplete... */
3872 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3873 declarator_flags_t flags)
3875 parse_declarator_env_t env;
3876 memset(&env, 0, sizeof(env));
3877 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3879 construct_type_t *construct_type = parse_inner_declarator(&env);
3881 construct_declarator_type(construct_type, specifiers->type);
3882 type_t *type = skip_typeref(orig_type);
3884 if (construct_type != NULL) {
3885 obstack_free(&temp_obst, construct_type);
3888 attribute_t *attributes = parse_attributes(env.attributes);
3889 /* append (shared) specifier attribute behind attributes of this
3891 attribute_t **anchor = &attributes;
3892 while (*anchor != NULL)
3893 anchor = &(*anchor)->next;
3894 *anchor = specifiers->attributes;
3897 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3898 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3899 entity->base.namespc = NAMESPACE_NORMAL;
3900 entity->base.symbol = env.symbol;
3901 entity->base.source_position = env.source_position;
3902 entity->typedefe.type = orig_type;
3904 if (anonymous_entity != NULL) {
3905 if (is_type_compound(type)) {
3906 assert(anonymous_entity->compound.alias == NULL);
3907 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3908 anonymous_entity->kind == ENTITY_UNION);
3909 anonymous_entity->compound.alias = entity;
3910 anonymous_entity = NULL;
3911 } else if (is_type_enum(type)) {
3912 assert(anonymous_entity->enume.alias == NULL);
3913 assert(anonymous_entity->kind == ENTITY_ENUM);
3914 anonymous_entity->enume.alias = entity;
3915 anonymous_entity = NULL;
3919 /* create a declaration type entity */
3920 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3921 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3923 if (env.symbol != NULL) {
3924 if (specifiers->is_inline && is_type_valid(type)) {
3925 errorf(&env.source_position,
3926 "compound member '%Y' declared 'inline'", env.symbol);
3929 if (specifiers->thread_local ||
3930 specifiers->storage_class != STORAGE_CLASS_NONE) {
3931 errorf(&env.source_position,
3932 "compound member '%Y' must have no storage class",
3936 } else if (flags & DECL_IS_PARAMETER) {
3937 orig_type = semantic_parameter(&env.source_position, orig_type,
3938 specifiers, env.symbol);
3940 entity = allocate_entity_zero(ENTITY_PARAMETER);
3941 } else if (is_type_function(type)) {
3942 entity = allocate_entity_zero(ENTITY_FUNCTION);
3944 entity->function.is_inline = specifiers->is_inline;
3945 entity->function.elf_visibility = default_visibility;
3946 entity->function.parameters = env.parameters;
3948 if (env.symbol != NULL) {
3949 /* this needs fixes for C++ */
3950 bool in_function_scope = current_function != NULL;
3952 if (specifiers->thread_local || (
3953 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3954 specifiers->storage_class != STORAGE_CLASS_NONE &&
3955 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3957 errorf(&env.source_position,
3958 "invalid storage class for function '%Y'", env.symbol);
3962 entity = allocate_entity_zero(ENTITY_VARIABLE);
3964 entity->variable.elf_visibility = default_visibility;
3965 entity->variable.thread_local = specifiers->thread_local;
3967 if (env.symbol != NULL) {
3968 if (specifiers->is_inline && is_type_valid(type)) {
3969 errorf(&env.source_position,
3970 "variable '%Y' declared 'inline'", env.symbol);
3973 bool invalid_storage_class = false;
3974 if (current_scope == file_scope) {
3975 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3976 specifiers->storage_class != STORAGE_CLASS_NONE &&
3977 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3978 invalid_storage_class = true;
3981 if (specifiers->thread_local &&
3982 specifiers->storage_class == STORAGE_CLASS_NONE) {
3983 invalid_storage_class = true;
3986 if (invalid_storage_class) {
3987 errorf(&env.source_position,
3988 "invalid storage class for variable '%Y'", env.symbol);
3993 if (env.symbol != NULL) {
3994 entity->base.symbol = env.symbol;
3995 entity->base.source_position = env.source_position;
3997 entity->base.source_position = specifiers->source_position;
3999 entity->base.namespc = NAMESPACE_NORMAL;
4000 entity->declaration.type = orig_type;
4001 entity->declaration.alignment = get_type_alignment(orig_type);
4002 entity->declaration.modifiers = env.modifiers;
4003 entity->declaration.attributes = attributes;
4005 storage_class_t storage_class = specifiers->storage_class;
4006 entity->declaration.declared_storage_class = storage_class;
4008 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
4009 storage_class = STORAGE_CLASS_AUTO;
4010 entity->declaration.storage_class = storage_class;
4013 if (attributes != NULL) {
4014 handle_entity_attributes(attributes, entity);
4020 static type_t *parse_abstract_declarator(type_t *base_type)
4022 parse_declarator_env_t env;
4023 memset(&env, 0, sizeof(env));
4024 env.may_be_abstract = true;
4025 env.must_be_abstract = true;
4027 construct_type_t *construct_type = parse_inner_declarator(&env);
4029 type_t *result = construct_declarator_type(construct_type, base_type);
4030 if (construct_type != NULL) {
4031 obstack_free(&temp_obst, construct_type);
4033 result = handle_type_attributes(env.attributes, result);
4039 * Check if the declaration of main is suspicious. main should be a
4040 * function with external linkage, returning int, taking either zero
4041 * arguments, two, or three arguments of appropriate types, ie.
4043 * int main([ int argc, char **argv [, char **env ] ]).
4045 * @param decl the declaration to check
4046 * @param type the function type of the declaration
4048 static void check_main(const entity_t *entity)
4050 const source_position_t *pos = &entity->base.source_position;
4051 if (entity->kind != ENTITY_FUNCTION) {
4052 warningf(pos, "'main' is not a function");
4056 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4057 warningf(pos, "'main' is normally a non-static function");
4060 type_t *type = skip_typeref(entity->declaration.type);
4061 assert(is_type_function(type));
4063 function_type_t *func_type = &type->function;
4064 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4065 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4066 func_type->return_type);
4068 const function_parameter_t *parm = func_type->parameters;
4070 type_t *const first_type = skip_typeref(parm->type);
4071 type_t *const first_type_unqual = get_unqualified_type(first_type);
4072 if (!types_compatible(first_type_unqual, type_int)) {
4074 "first argument of 'main' should be 'int', but is '%T'",
4079 type_t *const second_type = skip_typeref(parm->type);
4080 type_t *const second_type_unqual
4081 = get_unqualified_type(second_type);
4082 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
4083 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'",
4088 type_t *const third_type = skip_typeref(parm->type);
4089 type_t *const third_type_unqual
4090 = get_unqualified_type(third_type);
4091 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
4092 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'",
4097 goto warn_arg_count;
4101 warningf(pos, "'main' takes only zero, two or three arguments");
4107 * Check if a symbol is the equal to "main".
4109 static bool is_sym_main(const symbol_t *const sym)
4111 return strcmp(sym->string, "main") == 0;
4114 static void error_redefined_as_different_kind(const source_position_t *pos,
4115 const entity_t *old, entity_kind_t new_kind)
4117 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4118 get_entity_kind_name(old->kind), old->base.symbol,
4119 get_entity_kind_name(new_kind), &old->base.source_position);
4122 static bool is_entity_valid(entity_t *const ent)
4124 if (is_declaration(ent)) {
4125 return is_type_valid(skip_typeref(ent->declaration.type));
4126 } else if (ent->kind == ENTITY_TYPEDEF) {
4127 return is_type_valid(skip_typeref(ent->typedefe.type));
4132 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4134 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4135 if (attributes_equal(tattr, attr))
4142 * test wether new_list contains any attributes not included in old_list
4144 static bool has_new_attributes(const attribute_t *old_list,
4145 const attribute_t *new_list)
4147 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4148 if (!contains_attribute(old_list, attr))
4155 * Merge in attributes from an attribute list (probably from a previous
4156 * declaration with the same name). Warning: destroys the old structure
4157 * of the attribute list - don't reuse attributes after this call.
4159 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4162 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4164 if (contains_attribute(decl->attributes, attr))
4167 /* move attribute to new declarations attributes list */
4168 attr->next = decl->attributes;
4169 decl->attributes = attr;
4174 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4175 * for various problems that occur for multiple definitions
4177 entity_t *record_entity(entity_t *entity, const bool is_definition)
4179 const symbol_t *const symbol = entity->base.symbol;
4180 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4181 const source_position_t *pos = &entity->base.source_position;
4183 /* can happen in error cases */
4187 entity_t *const previous_entity = get_entity(symbol, namespc);
4188 /* pushing the same entity twice will break the stack structure */
4189 assert(previous_entity != entity);
4191 if (entity->kind == ENTITY_FUNCTION) {
4192 type_t *const orig_type = entity->declaration.type;
4193 type_t *const type = skip_typeref(orig_type);
4195 assert(is_type_function(type));
4196 if (type->function.unspecified_parameters &&
4197 warning.strict_prototypes &&
4198 previous_entity == NULL) {
4199 warningf(pos, "function declaration '%#T' is not a prototype",
4203 if (warning.main && current_scope == file_scope
4204 && is_sym_main(symbol)) {
4209 if (is_declaration(entity) &&
4210 warning.nested_externs &&
4211 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4212 current_scope != file_scope) {
4213 warningf(pos, "nested extern declaration of '%#T'",
4214 entity->declaration.type, symbol);
4217 if (previous_entity != NULL) {
4218 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4219 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4220 assert(previous_entity->kind == ENTITY_PARAMETER);
4222 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4223 entity->declaration.type, symbol,
4224 previous_entity->declaration.type, symbol,
4225 &previous_entity->base.source_position);
4229 if (previous_entity->base.parent_scope == current_scope) {
4230 if (previous_entity->kind != entity->kind) {
4231 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4232 error_redefined_as_different_kind(pos, previous_entity,
4237 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4238 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4239 symbol, &previous_entity->base.source_position);
4242 if (previous_entity->kind == ENTITY_TYPEDEF) {
4243 /* TODO: C++ allows this for exactly the same type */
4244 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4245 symbol, &previous_entity->base.source_position);
4249 /* at this point we should have only VARIABLES or FUNCTIONS */
4250 assert(is_declaration(previous_entity) && is_declaration(entity));
4252 declaration_t *const prev_decl = &previous_entity->declaration;
4253 declaration_t *const decl = &entity->declaration;
4255 /* can happen for K&R style declarations */
4256 if (prev_decl->type == NULL &&
4257 previous_entity->kind == ENTITY_PARAMETER &&
4258 entity->kind == ENTITY_PARAMETER) {
4259 prev_decl->type = decl->type;
4260 prev_decl->storage_class = decl->storage_class;
4261 prev_decl->declared_storage_class = decl->declared_storage_class;
4262 prev_decl->modifiers = decl->modifiers;
4263 return previous_entity;
4266 type_t *const orig_type = decl->type;
4267 assert(orig_type != NULL);
4268 type_t *const type = skip_typeref(orig_type);
4269 type_t *const prev_type = skip_typeref(prev_decl->type);
4271 if (!types_compatible(type, prev_type)) {
4273 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4274 orig_type, symbol, prev_decl->type, symbol,
4275 &previous_entity->base.source_position);
4277 unsigned old_storage_class = prev_decl->storage_class;
4279 if (warning.redundant_decls &&
4282 !(prev_decl->modifiers & DM_USED) &&
4283 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4284 warningf(&previous_entity->base.source_position,
4285 "unnecessary static forward declaration for '%#T'",
4286 prev_decl->type, symbol);
4289 storage_class_t new_storage_class = decl->storage_class;
4291 /* pretend no storage class means extern for function
4292 * declarations (except if the previous declaration is neither
4293 * none nor extern) */
4294 if (entity->kind == ENTITY_FUNCTION) {
4295 /* the previous declaration could have unspecified parameters or
4296 * be a typedef, so use the new type */
4297 if (prev_type->function.unspecified_parameters || is_definition)
4298 prev_decl->type = type;
4300 switch (old_storage_class) {
4301 case STORAGE_CLASS_NONE:
4302 old_storage_class = STORAGE_CLASS_EXTERN;
4305 case STORAGE_CLASS_EXTERN:
4306 if (is_definition) {
4307 if (warning.missing_prototypes &&
4308 prev_type->function.unspecified_parameters &&
4309 !is_sym_main(symbol)) {
4310 warningf(pos, "no previous prototype for '%#T'",
4313 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4314 new_storage_class = STORAGE_CLASS_EXTERN;
4321 } else if (is_type_incomplete(prev_type)) {
4322 prev_decl->type = type;
4325 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4326 new_storage_class == STORAGE_CLASS_EXTERN) {
4328 warn_redundant_declaration: ;
4330 = has_new_attributes(prev_decl->attributes,
4332 if (has_new_attrs) {
4333 merge_in_attributes(decl, prev_decl->attributes);
4334 } else if (!is_definition &&
4335 warning.redundant_decls &&
4336 is_type_valid(prev_type) &&
4337 strcmp(previous_entity->base.source_position.input_name,
4338 "<builtin>") != 0) {
4340 "redundant declaration for '%Y' (declared %P)",
4341 symbol, &previous_entity->base.source_position);
4343 } else if (current_function == NULL) {
4344 if (old_storage_class != STORAGE_CLASS_STATIC &&
4345 new_storage_class == STORAGE_CLASS_STATIC) {
4347 "static declaration of '%Y' follows non-static declaration (declared %P)",
4348 symbol, &previous_entity->base.source_position);
4349 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4350 prev_decl->storage_class = STORAGE_CLASS_NONE;
4351 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4353 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4355 goto error_redeclaration;
4356 goto warn_redundant_declaration;
4358 } else if (is_type_valid(prev_type)) {
4359 if (old_storage_class == new_storage_class) {
4360 error_redeclaration:
4361 errorf(pos, "redeclaration of '%Y' (declared %P)",
4362 symbol, &previous_entity->base.source_position);
4365 "redeclaration of '%Y' with different linkage (declared %P)",
4366 symbol, &previous_entity->base.source_position);
4371 prev_decl->modifiers |= decl->modifiers;
4372 if (entity->kind == ENTITY_FUNCTION) {
4373 previous_entity->function.is_inline |= entity->function.is_inline;
4375 return previous_entity;
4378 if (warning.shadow) {
4379 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4380 get_entity_kind_name(entity->kind), symbol,
4381 get_entity_kind_name(previous_entity->kind),
4382 &previous_entity->base.source_position);
4386 if (entity->kind == ENTITY_FUNCTION) {
4387 if (is_definition &&
4388 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4389 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4390 warningf(pos, "no previous prototype for '%#T'",
4391 entity->declaration.type, symbol);
4392 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4393 warningf(pos, "no previous declaration for '%#T'",
4394 entity->declaration.type, symbol);
4397 } else if (warning.missing_declarations &&
4398 entity->kind == ENTITY_VARIABLE &&
4399 current_scope == file_scope) {
4400 declaration_t *declaration = &entity->declaration;
4401 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4402 warningf(pos, "no previous declaration for '%#T'",
4403 declaration->type, symbol);
4408 assert(entity->base.parent_scope == NULL);
4409 assert(current_scope != NULL);
4411 entity->base.parent_scope = current_scope;
4412 entity->base.namespc = NAMESPACE_NORMAL;
4413 environment_push(entity);
4414 append_entity(current_scope, entity);
4419 static void parser_error_multiple_definition(entity_t *entity,
4420 const source_position_t *source_position)
4422 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4423 entity->base.symbol, &entity->base.source_position);
4426 static bool is_declaration_specifier(const token_t *token,
4427 bool only_specifiers_qualifiers)
4429 switch (token->type) {
4434 return is_typedef_symbol(token->symbol);
4436 case T___extension__:
4438 return !only_specifiers_qualifiers;
4445 static void parse_init_declarator_rest(entity_t *entity)
4447 type_t *orig_type = type_error_type;
4449 if (entity->base.kind == ENTITY_TYPEDEF) {
4450 errorf(&entity->base.source_position,
4451 "typedef '%Y' is initialized (use __typeof__ instead)",
4452 entity->base.symbol);
4454 assert(is_declaration(entity));
4455 orig_type = entity->declaration.type;
4459 type_t *type = skip_typeref(orig_type);
4461 if (entity->kind == ENTITY_VARIABLE
4462 && entity->variable.initializer != NULL) {
4463 parser_error_multiple_definition(entity, HERE);
4466 declaration_t *const declaration = &entity->declaration;
4467 bool must_be_constant = false;
4468 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4469 entity->base.parent_scope == file_scope) {
4470 must_be_constant = true;
4473 if (is_type_function(type)) {
4474 errorf(&entity->base.source_position,
4475 "function '%#T' is initialized like a variable",
4476 orig_type, entity->base.symbol);
4477 orig_type = type_error_type;
4480 parse_initializer_env_t env;
4481 env.type = orig_type;
4482 env.must_be_constant = must_be_constant;
4483 env.entity = entity;
4484 current_init_decl = entity;
4486 initializer_t *initializer = parse_initializer(&env);
4487 current_init_decl = NULL;
4489 if (entity->kind == ENTITY_VARIABLE) {
4490 /* §6.7.5:22 array initializers for arrays with unknown size
4491 * determine the array type size */
4492 declaration->type = env.type;
4493 entity->variable.initializer = initializer;
4497 /* parse rest of a declaration without any declarator */
4498 static void parse_anonymous_declaration_rest(
4499 const declaration_specifiers_t *specifiers)
4502 anonymous_entity = NULL;
4504 if (warning.other) {
4505 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4506 specifiers->thread_local) {
4507 warningf(&specifiers->source_position,
4508 "useless storage class in empty declaration");
4511 type_t *type = specifiers->type;
4512 switch (type->kind) {
4513 case TYPE_COMPOUND_STRUCT:
4514 case TYPE_COMPOUND_UNION: {
4515 if (type->compound.compound->base.symbol == NULL) {
4516 warningf(&specifiers->source_position,
4517 "unnamed struct/union that defines no instances");
4526 warningf(&specifiers->source_position, "empty declaration");
4532 static void check_variable_type_complete(entity_t *ent)
4534 if (ent->kind != ENTITY_VARIABLE)
4537 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4538 * type for the object shall be complete [...] */
4539 declaration_t *decl = &ent->declaration;
4540 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4541 decl->storage_class == STORAGE_CLASS_STATIC)
4544 type_t *const orig_type = decl->type;
4545 type_t *const type = skip_typeref(orig_type);
4546 if (!is_type_incomplete(type))
4549 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4550 * are given length one. */
4551 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4552 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4556 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4557 orig_type, ent->base.symbol);
4561 static void parse_declaration_rest(entity_t *ndeclaration,
4562 const declaration_specifiers_t *specifiers,
4563 parsed_declaration_func finished_declaration,
4564 declarator_flags_t flags)
4566 add_anchor_token(';');
4567 add_anchor_token(',');
4569 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4571 if (token.type == '=') {
4572 parse_init_declarator_rest(entity);
4573 } else if (entity->kind == ENTITY_VARIABLE) {
4574 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4575 * [...] where the extern specifier is explicitly used. */
4576 declaration_t *decl = &entity->declaration;
4577 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4578 type_t *type = decl->type;
4579 if (is_type_reference(skip_typeref(type))) {
4580 errorf(&entity->base.source_position,
4581 "reference '%#T' must be initialized",
4582 type, entity->base.symbol);
4587 check_variable_type_complete(entity);
4592 add_anchor_token('=');
4593 ndeclaration = parse_declarator(specifiers, flags);
4594 rem_anchor_token('=');
4596 expect(';', end_error);
4599 anonymous_entity = NULL;
4600 rem_anchor_token(';');
4601 rem_anchor_token(',');
4604 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4606 symbol_t *symbol = entity->base.symbol;
4607 if (symbol == NULL) {
4608 errorf(HERE, "anonymous declaration not valid as function parameter");
4612 assert(entity->base.namespc == NAMESPACE_NORMAL);
4613 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4614 if (previous_entity == NULL
4615 || previous_entity->base.parent_scope != current_scope) {
4616 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4621 if (is_definition) {
4622 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4625 return record_entity(entity, false);
4628 static void parse_declaration(parsed_declaration_func finished_declaration,
4629 declarator_flags_t flags)
4631 declaration_specifiers_t specifiers;
4632 memset(&specifiers, 0, sizeof(specifiers));
4634 add_anchor_token(';');
4635 parse_declaration_specifiers(&specifiers);
4636 rem_anchor_token(';');
4638 if (token.type == ';') {
4639 parse_anonymous_declaration_rest(&specifiers);
4641 entity_t *entity = parse_declarator(&specifiers, flags);
4642 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4647 static type_t *get_default_promoted_type(type_t *orig_type)
4649 type_t *result = orig_type;
4651 type_t *type = skip_typeref(orig_type);
4652 if (is_type_integer(type)) {
4653 result = promote_integer(type);
4654 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4655 result = type_double;
4661 static void parse_kr_declaration_list(entity_t *entity)
4663 if (entity->kind != ENTITY_FUNCTION)
4666 type_t *type = skip_typeref(entity->declaration.type);
4667 assert(is_type_function(type));
4668 if (!type->function.kr_style_parameters)
4671 add_anchor_token('{');
4673 /* push function parameters */
4674 size_t const top = environment_top();
4675 scope_t *old_scope = scope_push(&entity->function.parameters);
4677 entity_t *parameter = entity->function.parameters.entities;
4678 for ( ; parameter != NULL; parameter = parameter->base.next) {
4679 assert(parameter->base.parent_scope == NULL);
4680 parameter->base.parent_scope = current_scope;
4681 environment_push(parameter);
4684 /* parse declaration list */
4686 switch (token.type) {
4688 case T___extension__:
4689 /* This covers symbols, which are no type, too, and results in
4690 * better error messages. The typical cases are misspelled type
4691 * names and missing includes. */
4693 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4701 /* pop function parameters */
4702 assert(current_scope == &entity->function.parameters);
4703 scope_pop(old_scope);
4704 environment_pop_to(top);
4706 /* update function type */
4707 type_t *new_type = duplicate_type(type);
4709 function_parameter_t *parameters = NULL;
4710 function_parameter_t **anchor = ¶meters;
4712 /* did we have an earlier prototype? */
4713 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4714 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4717 function_parameter_t *proto_parameter = NULL;
4718 if (proto_type != NULL) {
4719 type_t *proto_type_type = proto_type->declaration.type;
4720 proto_parameter = proto_type_type->function.parameters;
4721 /* If a K&R function definition has a variadic prototype earlier, then
4722 * make the function definition variadic, too. This should conform to
4723 * §6.7.5.3:15 and §6.9.1:8. */
4724 new_type->function.variadic = proto_type_type->function.variadic;
4726 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4728 new_type->function.unspecified_parameters = true;
4731 bool need_incompatible_warning = false;
4732 parameter = entity->function.parameters.entities;
4733 for (; parameter != NULL; parameter = parameter->base.next,
4735 proto_parameter == NULL ? NULL : proto_parameter->next) {
4736 if (parameter->kind != ENTITY_PARAMETER)
4739 type_t *parameter_type = parameter->declaration.type;
4740 if (parameter_type == NULL) {
4742 errorf(HERE, "no type specified for function parameter '%Y'",
4743 parameter->base.symbol);
4744 parameter_type = type_error_type;
4746 if (warning.implicit_int) {
4747 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4748 parameter->base.symbol);
4750 parameter_type = type_int;
4752 parameter->declaration.type = parameter_type;
4755 semantic_parameter_incomplete(parameter);
4757 /* we need the default promoted types for the function type */
4758 type_t *not_promoted = parameter_type;
4759 parameter_type = get_default_promoted_type(parameter_type);
4761 /* gcc special: if the type of the prototype matches the unpromoted
4762 * type don't promote */
4763 if (!strict_mode && proto_parameter != NULL) {
4764 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4765 type_t *promo_skip = skip_typeref(parameter_type);
4766 type_t *param_skip = skip_typeref(not_promoted);
4767 if (!types_compatible(proto_p_type, promo_skip)
4768 && types_compatible(proto_p_type, param_skip)) {
4770 need_incompatible_warning = true;
4771 parameter_type = not_promoted;
4774 function_parameter_t *const parameter
4775 = allocate_parameter(parameter_type);
4777 *anchor = parameter;
4778 anchor = ¶meter->next;
4781 new_type->function.parameters = parameters;
4782 new_type = identify_new_type(new_type);
4784 if (warning.other && need_incompatible_warning) {
4785 type_t *proto_type_type = proto_type->declaration.type;
4787 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4788 proto_type_type, proto_type->base.symbol,
4789 new_type, entity->base.symbol,
4790 &proto_type->base.source_position);
4793 entity->declaration.type = new_type;
4795 rem_anchor_token('{');
4798 static bool first_err = true;
4801 * When called with first_err set, prints the name of the current function,
4804 static void print_in_function(void)
4808 diagnosticf("%s: In function '%Y':\n",
4809 current_function->base.base.source_position.input_name,
4810 current_function->base.base.symbol);
4815 * Check if all labels are defined in the current function.
4816 * Check if all labels are used in the current function.
4818 static void check_labels(void)
4820 for (const goto_statement_t *goto_statement = goto_first;
4821 goto_statement != NULL;
4822 goto_statement = goto_statement->next) {
4823 /* skip computed gotos */
4824 if (goto_statement->expression != NULL)
4827 label_t *label = goto_statement->label;
4830 if (label->base.source_position.input_name == NULL) {
4831 print_in_function();
4832 errorf(&goto_statement->base.source_position,
4833 "label '%Y' used but not defined", label->base.symbol);
4837 if (warning.unused_label) {
4838 for (const label_statement_t *label_statement = label_first;
4839 label_statement != NULL;
4840 label_statement = label_statement->next) {
4841 label_t *label = label_statement->label;
4843 if (! label->used) {
4844 print_in_function();
4845 warningf(&label_statement->base.source_position,
4846 "label '%Y' defined but not used", label->base.symbol);
4852 static void warn_unused_entity(entity_t *entity, entity_t *last)
4854 entity_t const *const end = last != NULL ? last->base.next : NULL;
4855 for (; entity != end; entity = entity->base.next) {
4856 if (!is_declaration(entity))
4859 declaration_t *declaration = &entity->declaration;
4860 if (declaration->implicit)
4863 if (!declaration->used) {
4864 print_in_function();
4865 const char *what = get_entity_kind_name(entity->kind);
4866 warningf(&entity->base.source_position, "%s '%Y' is unused",
4867 what, entity->base.symbol);
4868 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4869 print_in_function();
4870 const char *what = get_entity_kind_name(entity->kind);
4871 warningf(&entity->base.source_position, "%s '%Y' is never read",
4872 what, entity->base.symbol);
4877 static void check_unused_variables(statement_t *const stmt, void *const env)
4881 switch (stmt->kind) {
4882 case STATEMENT_DECLARATION: {
4883 declaration_statement_t const *const decls = &stmt->declaration;
4884 warn_unused_entity(decls->declarations_begin,
4885 decls->declarations_end);
4890 warn_unused_entity(stmt->fors.scope.entities, NULL);
4899 * Check declarations of current_function for unused entities.
4901 static void check_declarations(void)
4903 if (warning.unused_parameter) {
4904 const scope_t *scope = ¤t_function->parameters;
4906 /* do not issue unused warnings for main */
4907 if (!is_sym_main(current_function->base.base.symbol)) {
4908 warn_unused_entity(scope->entities, NULL);
4911 if (warning.unused_variable) {
4912 walk_statements(current_function->statement, check_unused_variables,
4917 static int determine_truth(expression_t const* const cond)
4920 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4921 fold_constant_to_bool(cond) ? 1 :
4925 static void check_reachable(statement_t *);
4926 static bool reaches_end;
4928 static bool expression_returns(expression_t const *const expr)
4930 switch (expr->kind) {
4932 expression_t const *const func = expr->call.function;
4933 if (func->kind == EXPR_REFERENCE) {
4934 entity_t *entity = func->reference.entity;
4935 if (entity->kind == ENTITY_FUNCTION
4936 && entity->declaration.modifiers & DM_NORETURN)
4940 if (!expression_returns(func))
4943 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4944 if (!expression_returns(arg->expression))
4951 case EXPR_REFERENCE:
4952 case EXPR_REFERENCE_ENUM_VALUE:
4954 case EXPR_STRING_LITERAL:
4955 case EXPR_WIDE_STRING_LITERAL:
4956 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4957 case EXPR_LABEL_ADDRESS:
4958 case EXPR_CLASSIFY_TYPE:
4959 case EXPR_SIZEOF: // TODO handle obscure VLA case
4962 case EXPR_BUILTIN_CONSTANT_P:
4963 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4968 case EXPR_STATEMENT: {
4969 bool old_reaches_end = reaches_end;
4970 reaches_end = false;
4971 check_reachable(expr->statement.statement);
4972 bool returns = reaches_end;
4973 reaches_end = old_reaches_end;
4977 case EXPR_CONDITIONAL:
4978 // TODO handle constant expression
4980 if (!expression_returns(expr->conditional.condition))
4983 if (expr->conditional.true_expression != NULL
4984 && expression_returns(expr->conditional.true_expression))
4987 return expression_returns(expr->conditional.false_expression);
4990 return expression_returns(expr->select.compound);
4992 case EXPR_ARRAY_ACCESS:
4994 expression_returns(expr->array_access.array_ref) &&
4995 expression_returns(expr->array_access.index);
4998 return expression_returns(expr->va_starte.ap);
5001 return expression_returns(expr->va_arge.ap);
5004 return expression_returns(expr->va_copye.src);
5006 EXPR_UNARY_CASES_MANDATORY
5007 return expression_returns(expr->unary.value);
5009 case EXPR_UNARY_THROW:
5013 // TODO handle constant lhs of && and ||
5015 expression_returns(expr->binary.left) &&
5016 expression_returns(expr->binary.right);
5022 panic("unhandled expression");
5025 static bool initializer_returns(initializer_t const *const init)
5027 switch (init->kind) {
5028 case INITIALIZER_VALUE:
5029 return expression_returns(init->value.value);
5031 case INITIALIZER_LIST: {
5032 initializer_t * const* i = init->list.initializers;
5033 initializer_t * const* const end = i + init->list.len;
5034 bool returns = true;
5035 for (; i != end; ++i) {
5036 if (!initializer_returns(*i))
5042 case INITIALIZER_STRING:
5043 case INITIALIZER_WIDE_STRING:
5044 case INITIALIZER_DESIGNATOR: // designators have no payload
5047 panic("unhandled initializer");
5050 static bool noreturn_candidate;
5052 static void check_reachable(statement_t *const stmt)
5054 if (stmt->base.reachable)
5056 if (stmt->kind != STATEMENT_DO_WHILE)
5057 stmt->base.reachable = true;
5059 statement_t *last = stmt;
5061 switch (stmt->kind) {
5062 case STATEMENT_INVALID:
5063 case STATEMENT_EMPTY:
5065 next = stmt->base.next;
5068 case STATEMENT_DECLARATION: {
5069 declaration_statement_t const *const decl = &stmt->declaration;
5070 entity_t const * ent = decl->declarations_begin;
5071 entity_t const *const last = decl->declarations_end;
5073 for (;; ent = ent->base.next) {
5074 if (ent->kind == ENTITY_VARIABLE &&
5075 ent->variable.initializer != NULL &&
5076 !initializer_returns(ent->variable.initializer)) {
5083 next = stmt->base.next;
5087 case STATEMENT_COMPOUND:
5088 next = stmt->compound.statements;
5090 next = stmt->base.next;
5093 case STATEMENT_RETURN: {
5094 expression_t const *const val = stmt->returns.value;
5095 if (val == NULL || expression_returns(val))
5096 noreturn_candidate = false;
5100 case STATEMENT_IF: {
5101 if_statement_t const *const ifs = &stmt->ifs;
5102 expression_t const *const cond = ifs->condition;
5104 if (!expression_returns(cond))
5107 int const val = determine_truth(cond);
5110 check_reachable(ifs->true_statement);
5115 if (ifs->false_statement != NULL) {
5116 check_reachable(ifs->false_statement);
5120 next = stmt->base.next;
5124 case STATEMENT_SWITCH: {
5125 switch_statement_t const *const switchs = &stmt->switchs;
5126 expression_t const *const expr = switchs->expression;
5128 if (!expression_returns(expr))
5131 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
5132 long const val = fold_constant_to_int(expr);
5133 case_label_statement_t * defaults = NULL;
5134 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5135 if (i->expression == NULL) {
5140 if (i->first_case <= val && val <= i->last_case) {
5141 check_reachable((statement_t*)i);
5146 if (defaults != NULL) {
5147 check_reachable((statement_t*)defaults);
5151 bool has_default = false;
5152 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5153 if (i->expression == NULL)
5156 check_reachable((statement_t*)i);
5163 next = stmt->base.next;
5167 case STATEMENT_EXPRESSION: {
5168 /* Check for noreturn function call */
5169 expression_t const *const expr = stmt->expression.expression;
5170 if (!expression_returns(expr))
5173 next = stmt->base.next;
5177 case STATEMENT_CONTINUE:
5178 for (statement_t *parent = stmt;;) {
5179 parent = parent->base.parent;
5180 if (parent == NULL) /* continue not within loop */
5184 switch (parent->kind) {
5185 case STATEMENT_WHILE: goto continue_while;
5186 case STATEMENT_DO_WHILE: goto continue_do_while;
5187 case STATEMENT_FOR: goto continue_for;
5193 case STATEMENT_BREAK:
5194 for (statement_t *parent = stmt;;) {
5195 parent = parent->base.parent;
5196 if (parent == NULL) /* break not within loop/switch */
5199 switch (parent->kind) {
5200 case STATEMENT_SWITCH:
5201 case STATEMENT_WHILE:
5202 case STATEMENT_DO_WHILE:
5205 next = parent->base.next;
5206 goto found_break_parent;
5214 case STATEMENT_GOTO:
5215 if (stmt->gotos.expression) {
5216 if (!expression_returns(stmt->gotos.expression))
5219 statement_t *parent = stmt->base.parent;
5220 if (parent == NULL) /* top level goto */
5224 next = stmt->gotos.label->statement;
5225 if (next == NULL) /* missing label */
5230 case STATEMENT_LABEL:
5231 next = stmt->label.statement;
5234 case STATEMENT_CASE_LABEL:
5235 next = stmt->case_label.statement;
5238 case STATEMENT_WHILE: {
5239 while_statement_t const *const whiles = &stmt->whiles;
5240 expression_t const *const cond = whiles->condition;
5242 if (!expression_returns(cond))
5245 int const val = determine_truth(cond);
5248 check_reachable(whiles->body);
5253 next = stmt->base.next;
5257 case STATEMENT_DO_WHILE:
5258 next = stmt->do_while.body;
5261 case STATEMENT_FOR: {
5262 for_statement_t *const fors = &stmt->fors;
5264 if (fors->condition_reachable)
5266 fors->condition_reachable = true;
5268 expression_t const *const cond = fors->condition;
5273 } else if (expression_returns(cond)) {
5274 val = determine_truth(cond);
5280 check_reachable(fors->body);
5285 next = stmt->base.next;
5289 case STATEMENT_MS_TRY: {
5290 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5291 check_reachable(ms_try->try_statement);
5292 next = ms_try->final_statement;
5296 case STATEMENT_LEAVE: {
5297 statement_t *parent = stmt;
5299 parent = parent->base.parent;
5300 if (parent == NULL) /* __leave not within __try */
5303 if (parent->kind == STATEMENT_MS_TRY) {
5305 next = parent->ms_try.final_statement;
5313 panic("invalid statement kind");
5316 while (next == NULL) {
5317 next = last->base.parent;
5319 noreturn_candidate = false;
5321 type_t *const type = skip_typeref(current_function->base.type);
5322 assert(is_type_function(type));
5323 type_t *const ret = skip_typeref(type->function.return_type);
5324 if (warning.return_type &&
5325 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5326 is_type_valid(ret) &&
5327 !is_sym_main(current_function->base.base.symbol)) {
5328 warningf(&stmt->base.source_position,
5329 "control reaches end of non-void function");
5334 switch (next->kind) {
5335 case STATEMENT_INVALID:
5336 case STATEMENT_EMPTY:
5337 case STATEMENT_DECLARATION:
5338 case STATEMENT_EXPRESSION:
5340 case STATEMENT_RETURN:
5341 case STATEMENT_CONTINUE:
5342 case STATEMENT_BREAK:
5343 case STATEMENT_GOTO:
5344 case STATEMENT_LEAVE:
5345 panic("invalid control flow in function");
5347 case STATEMENT_COMPOUND:
5348 if (next->compound.stmt_expr) {
5354 case STATEMENT_SWITCH:
5355 case STATEMENT_LABEL:
5356 case STATEMENT_CASE_LABEL:
5358 next = next->base.next;
5361 case STATEMENT_WHILE: {
5363 if (next->base.reachable)
5365 next->base.reachable = true;
5367 while_statement_t const *const whiles = &next->whiles;
5368 expression_t const *const cond = whiles->condition;
5370 if (!expression_returns(cond))
5373 int const val = determine_truth(cond);
5376 check_reachable(whiles->body);
5382 next = next->base.next;
5386 case STATEMENT_DO_WHILE: {
5388 if (next->base.reachable)
5390 next->base.reachable = true;
5392 do_while_statement_t const *const dw = &next->do_while;
5393 expression_t const *const cond = dw->condition;
5395 if (!expression_returns(cond))
5398 int const val = determine_truth(cond);
5401 check_reachable(dw->body);
5407 next = next->base.next;
5411 case STATEMENT_FOR: {
5413 for_statement_t *const fors = &next->fors;
5415 fors->step_reachable = true;
5417 if (fors->condition_reachable)
5419 fors->condition_reachable = true;
5421 expression_t const *const cond = fors->condition;
5426 } else if (expression_returns(cond)) {
5427 val = determine_truth(cond);
5433 check_reachable(fors->body);
5439 next = next->base.next;
5443 case STATEMENT_MS_TRY:
5445 next = next->ms_try.final_statement;
5450 check_reachable(next);
5453 static void check_unreachable(statement_t* const stmt, void *const env)
5457 switch (stmt->kind) {
5458 case STATEMENT_DO_WHILE:
5459 if (!stmt->base.reachable) {
5460 expression_t const *const cond = stmt->do_while.condition;
5461 if (determine_truth(cond) >= 0) {
5462 warningf(&cond->base.source_position,
5463 "condition of do-while-loop is unreachable");
5468 case STATEMENT_FOR: {
5469 for_statement_t const* const fors = &stmt->fors;
5471 // if init and step are unreachable, cond is unreachable, too
5472 if (!stmt->base.reachable && !fors->step_reachable) {
5473 warningf(&stmt->base.source_position, "statement is unreachable");
5475 if (!stmt->base.reachable && fors->initialisation != NULL) {
5476 warningf(&fors->initialisation->base.source_position,
5477 "initialisation of for-statement is unreachable");
5480 if (!fors->condition_reachable && fors->condition != NULL) {
5481 warningf(&fors->condition->base.source_position,
5482 "condition of for-statement is unreachable");
5485 if (!fors->step_reachable && fors->step != NULL) {
5486 warningf(&fors->step->base.source_position,
5487 "step of for-statement is unreachable");
5493 case STATEMENT_COMPOUND:
5494 if (stmt->compound.statements != NULL)
5496 goto warn_unreachable;
5498 case STATEMENT_DECLARATION: {
5499 /* Only warn if there is at least one declarator with an initializer.
5500 * This typically occurs in switch statements. */
5501 declaration_statement_t const *const decl = &stmt->declaration;
5502 entity_t const * ent = decl->declarations_begin;
5503 entity_t const *const last = decl->declarations_end;
5505 for (;; ent = ent->base.next) {
5506 if (ent->kind == ENTITY_VARIABLE &&
5507 ent->variable.initializer != NULL) {
5508 goto warn_unreachable;
5518 if (!stmt->base.reachable)
5519 warningf(&stmt->base.source_position, "statement is unreachable");
5524 static void parse_external_declaration(void)
5526 /* function-definitions and declarations both start with declaration
5528 declaration_specifiers_t specifiers;
5529 memset(&specifiers, 0, sizeof(specifiers));
5531 add_anchor_token(';');
5532 parse_declaration_specifiers(&specifiers);
5533 rem_anchor_token(';');
5535 /* must be a declaration */
5536 if (token.type == ';') {
5537 parse_anonymous_declaration_rest(&specifiers);
5541 add_anchor_token(',');
5542 add_anchor_token('=');
5543 add_anchor_token(';');
5544 add_anchor_token('{');
5546 /* declarator is common to both function-definitions and declarations */
5547 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5549 rem_anchor_token('{');
5550 rem_anchor_token(';');
5551 rem_anchor_token('=');
5552 rem_anchor_token(',');
5554 /* must be a declaration */
5555 switch (token.type) {
5559 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5564 /* must be a function definition */
5565 parse_kr_declaration_list(ndeclaration);
5567 if (token.type != '{') {
5568 parse_error_expected("while parsing function definition", '{', NULL);
5569 eat_until_matching_token(';');
5573 assert(is_declaration(ndeclaration));
5574 type_t *const orig_type = ndeclaration->declaration.type;
5575 type_t * type = skip_typeref(orig_type);
5577 if (!is_type_function(type)) {
5578 if (is_type_valid(type)) {
5579 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5580 type, ndeclaration->base.symbol);
5584 } else if (is_typeref(orig_type)) {
5586 errorf(&ndeclaration->base.source_position,
5587 "type of function definition '%#T' is a typedef",
5588 orig_type, ndeclaration->base.symbol);
5591 if (warning.aggregate_return &&
5592 is_type_compound(skip_typeref(type->function.return_type))) {
5593 warningf(&ndeclaration->base.source_position, "function '%Y' returns an aggregate",
5594 ndeclaration->base.symbol);
5596 if (warning.traditional && !type->function.unspecified_parameters) {
5597 warningf(&ndeclaration->base.source_position, "traditional C rejects ISO C style function definition of function '%Y'",
5598 ndeclaration->base.symbol);
5600 if (warning.old_style_definition && type->function.unspecified_parameters) {
5601 warningf(&ndeclaration->base.source_position, "old-style function definition '%Y'",
5602 ndeclaration->base.symbol);
5605 /* §6.7.5.3:14 a function definition with () means no
5606 * parameters (and not unspecified parameters) */
5607 if (type->function.unspecified_parameters &&
5608 type->function.parameters == NULL) {
5609 type_t *copy = duplicate_type(type);
5610 copy->function.unspecified_parameters = false;
5611 type = identify_new_type(copy);
5613 ndeclaration->declaration.type = type;
5616 entity_t *const entity = record_entity(ndeclaration, true);
5617 assert(entity->kind == ENTITY_FUNCTION);
5618 assert(ndeclaration->kind == ENTITY_FUNCTION);
5620 function_t *const function = &entity->function;
5621 if (ndeclaration != entity) {
5622 function->parameters = ndeclaration->function.parameters;
5624 assert(is_declaration(entity));
5625 type = skip_typeref(entity->declaration.type);
5627 /* push function parameters and switch scope */
5628 size_t const top = environment_top();
5629 scope_t *old_scope = scope_push(&function->parameters);
5631 entity_t *parameter = function->parameters.entities;
5632 for (; parameter != NULL; parameter = parameter->base.next) {
5633 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5634 parameter->base.parent_scope = current_scope;
5636 assert(parameter->base.parent_scope == NULL
5637 || parameter->base.parent_scope == current_scope);
5638 parameter->base.parent_scope = current_scope;
5639 if (parameter->base.symbol == NULL) {
5640 errorf(¶meter->base.source_position, "parameter name omitted");
5643 environment_push(parameter);
5646 if (function->statement != NULL) {
5647 parser_error_multiple_definition(entity, HERE);
5650 /* parse function body */
5651 int label_stack_top = label_top();
5652 function_t *old_current_function = current_function;
5653 entity_t *old_current_entity = current_entity;
5654 current_function = function;
5655 current_entity = entity;
5656 current_parent = NULL;
5659 goto_anchor = &goto_first;
5661 label_anchor = &label_first;
5663 statement_t *const body = parse_compound_statement(false);
5664 function->statement = body;
5667 check_declarations();
5668 if (warning.return_type ||
5669 warning.unreachable_code ||
5670 (warning.missing_noreturn
5671 && !(function->base.modifiers & DM_NORETURN))) {
5672 noreturn_candidate = true;
5673 check_reachable(body);
5674 if (warning.unreachable_code)
5675 walk_statements(body, check_unreachable, NULL);
5676 if (warning.missing_noreturn &&
5677 noreturn_candidate &&
5678 !(function->base.modifiers & DM_NORETURN)) {
5679 warningf(&body->base.source_position,
5680 "function '%#T' is candidate for attribute 'noreturn'",
5681 type, entity->base.symbol);
5685 assert(current_parent == NULL);
5686 assert(current_function == function);
5687 assert(current_entity == entity);
5688 current_entity = old_current_entity;
5689 current_function = old_current_function;
5690 label_pop_to(label_stack_top);
5693 assert(current_scope == &function->parameters);
5694 scope_pop(old_scope);
5695 environment_pop_to(top);
5698 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5699 source_position_t *source_position,
5700 const symbol_t *symbol)
5702 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5704 type->bitfield.base_type = base_type;
5705 type->bitfield.size_expression = size;
5708 type_t *skipped_type = skip_typeref(base_type);
5709 if (!is_type_integer(skipped_type)) {
5710 errorf(HERE, "bitfield base type '%T' is not an integer type",
5714 bit_size = get_type_size(base_type) * 8;
5717 if (is_constant_expression(size) == EXPR_CLASS_CONSTANT) {
5718 long v = fold_constant_to_int(size);
5719 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5722 errorf(source_position, "negative width in bit-field '%Y'",
5724 } else if (v == 0 && symbol != NULL) {
5725 errorf(source_position, "zero width for bit-field '%Y'",
5727 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5728 errorf(source_position, "width of '%Y' exceeds its type",
5731 type->bitfield.bit_size = v;
5738 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5740 entity_t *iter = compound->members.entities;
5741 for (; iter != NULL; iter = iter->base.next) {
5742 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5745 if (iter->base.symbol == symbol) {
5747 } else if (iter->base.symbol == NULL) {
5748 /* search in anonymous structs and unions */
5749 type_t *type = skip_typeref(iter->declaration.type);
5750 if (is_type_compound(type)) {
5751 if (find_compound_entry(type->compound.compound, symbol)
5762 static void check_deprecated(const source_position_t *source_position,
5763 const entity_t *entity)
5765 if (!warning.deprecated_declarations)
5767 if (!is_declaration(entity))
5769 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5772 char const *const prefix = get_entity_kind_name(entity->kind);
5773 const char *deprecated_string
5774 = get_deprecated_string(entity->declaration.attributes);
5775 if (deprecated_string != NULL) {
5776 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5777 prefix, entity->base.symbol, &entity->base.source_position,
5780 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5781 entity->base.symbol, &entity->base.source_position);
5786 static expression_t *create_select(const source_position_t *pos,
5788 type_qualifiers_t qualifiers,
5791 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5793 check_deprecated(pos, entry);
5795 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5796 select->select.compound = addr;
5797 select->select.compound_entry = entry;
5799 type_t *entry_type = entry->declaration.type;
5800 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5802 /* we always do the auto-type conversions; the & and sizeof parser contains
5803 * code to revert this! */
5804 select->base.type = automatic_type_conversion(res_type);
5805 if (res_type->kind == TYPE_BITFIELD) {
5806 select->base.type = res_type->bitfield.base_type;
5813 * Find entry with symbol in compound. Search anonymous structs and unions and
5814 * creates implicit select expressions for them.
5815 * Returns the adress for the innermost compound.
5817 static expression_t *find_create_select(const source_position_t *pos,
5819 type_qualifiers_t qualifiers,
5820 compound_t *compound, symbol_t *symbol)
5822 entity_t *iter = compound->members.entities;
5823 for (; iter != NULL; iter = iter->base.next) {
5824 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5827 symbol_t *iter_symbol = iter->base.symbol;
5828 if (iter_symbol == NULL) {
5829 type_t *type = iter->declaration.type;
5830 if (type->kind != TYPE_COMPOUND_STRUCT
5831 && type->kind != TYPE_COMPOUND_UNION)
5834 compound_t *sub_compound = type->compound.compound;
5836 if (find_compound_entry(sub_compound, symbol) == NULL)
5839 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5840 sub_addr->base.source_position = *pos;
5841 sub_addr->select.implicit = true;
5842 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5846 if (iter_symbol == symbol) {
5847 return create_select(pos, addr, qualifiers, iter);
5854 static void parse_compound_declarators(compound_t *compound,
5855 const declaration_specifiers_t *specifiers)
5860 if (token.type == ':') {
5861 source_position_t source_position = *HERE;
5864 type_t *base_type = specifiers->type;
5865 expression_t *size = parse_constant_expression();
5867 type_t *type = make_bitfield_type(base_type, size,
5868 &source_position, NULL);
5870 attribute_t *attributes = parse_attributes(NULL);
5871 attribute_t **anchor = &attributes;
5872 while (*anchor != NULL)
5873 anchor = &(*anchor)->next;
5874 *anchor = specifiers->attributes;
5876 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5877 entity->base.namespc = NAMESPACE_NORMAL;
5878 entity->base.source_position = source_position;
5879 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5880 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5881 entity->declaration.type = type;
5882 entity->declaration.attributes = attributes;
5884 if (attributes != NULL) {
5885 handle_entity_attributes(attributes, entity);
5887 append_entity(&compound->members, entity);
5889 entity = parse_declarator(specifiers,
5890 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5891 if (entity->kind == ENTITY_TYPEDEF) {
5892 errorf(&entity->base.source_position,
5893 "typedef not allowed as compound member");
5895 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5897 /* make sure we don't define a symbol multiple times */
5898 symbol_t *symbol = entity->base.symbol;
5899 if (symbol != NULL) {
5900 entity_t *prev = find_compound_entry(compound, symbol);
5902 errorf(&entity->base.source_position,
5903 "multiple declarations of symbol '%Y' (declared %P)",
5904 symbol, &prev->base.source_position);
5908 if (token.type == ':') {
5909 source_position_t source_position = *HERE;
5911 expression_t *size = parse_constant_expression();
5913 type_t *type = entity->declaration.type;
5914 type_t *bitfield_type = make_bitfield_type(type, size,
5915 &source_position, entity->base.symbol);
5917 attribute_t *attributes = parse_attributes(NULL);
5918 entity->declaration.type = bitfield_type;
5919 handle_entity_attributes(attributes, entity);
5921 type_t *orig_type = entity->declaration.type;
5922 type_t *type = skip_typeref(orig_type);
5923 if (is_type_function(type)) {
5924 errorf(&entity->base.source_position,
5925 "compound member '%Y' must not have function type '%T'",
5926 entity->base.symbol, orig_type);
5927 } else if (is_type_incomplete(type)) {
5928 /* §6.7.2.1:16 flexible array member */
5929 if (!is_type_array(type) ||
5930 token.type != ';' ||
5931 look_ahead(1)->type != '}') {
5932 errorf(&entity->base.source_position,
5933 "compound member '%Y' has incomplete type '%T'",
5934 entity->base.symbol, orig_type);
5939 append_entity(&compound->members, entity);
5942 } while (next_if(','));
5943 expect(';', end_error);
5946 anonymous_entity = NULL;
5949 static void parse_compound_type_entries(compound_t *compound)
5952 add_anchor_token('}');
5954 while (token.type != '}') {
5955 if (token.type == T_EOF) {
5956 errorf(HERE, "EOF while parsing struct");
5959 declaration_specifiers_t specifiers;
5960 memset(&specifiers, 0, sizeof(specifiers));
5961 parse_declaration_specifiers(&specifiers);
5963 parse_compound_declarators(compound, &specifiers);
5965 rem_anchor_token('}');
5969 compound->complete = true;
5972 static type_t *parse_typename(void)
5974 declaration_specifiers_t specifiers;
5975 memset(&specifiers, 0, sizeof(specifiers));
5976 parse_declaration_specifiers(&specifiers);
5977 if (specifiers.storage_class != STORAGE_CLASS_NONE
5978 || specifiers.thread_local) {
5979 /* TODO: improve error message, user does probably not know what a
5980 * storage class is...
5982 errorf(HERE, "typename must not have a storage class");
5985 type_t *result = parse_abstract_declarator(specifiers.type);
5993 typedef expression_t* (*parse_expression_function)(void);
5994 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5996 typedef struct expression_parser_function_t expression_parser_function_t;
5997 struct expression_parser_function_t {
5998 parse_expression_function parser;
5999 precedence_t infix_precedence;
6000 parse_expression_infix_function infix_parser;
6003 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6006 * Prints an error message if an expression was expected but not read
6008 static expression_t *expected_expression_error(void)
6010 /* skip the error message if the error token was read */
6011 if (token.type != T_ERROR) {
6012 errorf(HERE, "expected expression, got token %K", &token);
6016 return create_invalid_expression();
6019 static type_t *get_string_type(void)
6021 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
6024 static type_t *get_wide_string_type(void)
6026 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6030 * Parse a string constant.
6032 static expression_t *parse_string_literal(void)
6034 source_position_t begin = token.source_position;
6035 string_t res = token.literal;
6036 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
6039 while (token.type == T_STRING_LITERAL
6040 || token.type == T_WIDE_STRING_LITERAL) {
6041 warn_string_concat(&token.source_position);
6042 res = concat_strings(&res, &token.literal);
6044 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6047 expression_t *literal;
6049 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6050 literal->base.type = get_wide_string_type();
6052 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6053 literal->base.type = get_string_type();
6055 literal->base.source_position = begin;
6056 literal->literal.value = res;
6062 * Parse a boolean constant.
6064 static expression_t *parse_boolean_literal(bool value)
6066 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6067 literal->base.source_position = token.source_position;
6068 literal->base.type = type_bool;
6069 literal->literal.value.begin = value ? "true" : "false";
6070 literal->literal.value.size = value ? 4 : 5;
6076 static void warn_traditional_suffix(void)
6078 if (!warning.traditional)
6080 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6084 static void check_integer_suffix(void)
6086 symbol_t *suffix = token.symbol;
6090 bool not_traditional = false;
6091 const char *c = suffix->string;
6092 if (*c == 'l' || *c == 'L') {
6095 not_traditional = true;
6097 if (*c == 'u' || *c == 'U') {
6100 } else if (*c == 'u' || *c == 'U') {
6101 not_traditional = true;
6104 } else if (*c == 'u' || *c == 'U') {
6105 not_traditional = true;
6107 if (*c == 'l' || *c == 'L') {
6115 errorf(&token.source_position,
6116 "invalid suffix '%s' on integer constant", suffix->string);
6117 } else if (not_traditional) {
6118 warn_traditional_suffix();
6122 static type_t *check_floatingpoint_suffix(void)
6124 symbol_t *suffix = token.symbol;
6125 type_t *type = type_double;
6129 bool not_traditional = false;
6130 const char *c = suffix->string;
6131 if (*c == 'f' || *c == 'F') {
6134 } else if (*c == 'l' || *c == 'L') {
6136 type = type_long_double;
6139 errorf(&token.source_position,
6140 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6141 } else if (not_traditional) {
6142 warn_traditional_suffix();
6149 * Parse an integer constant.
6151 static expression_t *parse_number_literal(void)
6153 expression_kind_t kind;
6156 switch (token.type) {
6158 kind = EXPR_LITERAL_INTEGER;
6159 check_integer_suffix();
6162 case T_INTEGER_OCTAL:
6163 kind = EXPR_LITERAL_INTEGER_OCTAL;
6164 check_integer_suffix();
6167 case T_INTEGER_HEXADECIMAL:
6168 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6169 check_integer_suffix();
6172 case T_FLOATINGPOINT:
6173 kind = EXPR_LITERAL_FLOATINGPOINT;
6174 type = check_floatingpoint_suffix();
6176 case T_FLOATINGPOINT_HEXADECIMAL:
6177 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6178 type = check_floatingpoint_suffix();
6181 panic("unexpected token type in parse_number_literal");
6184 expression_t *literal = allocate_expression_zero(kind);
6185 literal->base.source_position = token.source_position;
6186 literal->base.type = type;
6187 literal->literal.value = token.literal;
6188 literal->literal.suffix = token.symbol;
6191 /* integer type depends on the size of the number and the size
6192 * representable by the types. The backend/codegeneration has to determine
6195 determine_literal_type(&literal->literal);
6200 * Parse a character constant.
6202 static expression_t *parse_character_constant(void)
6204 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6205 literal->base.source_position = token.source_position;
6206 literal->base.type = c_mode & _CXX ? type_char : type_int;
6207 literal->literal.value = token.literal;
6209 size_t len = literal->literal.value.size;
6211 if (!GNU_MODE && !(c_mode & _C99)) {
6212 errorf(HERE, "more than 1 character in character constant");
6213 } else if (warning.multichar) {
6214 literal->base.type = type_int;
6215 warningf(HERE, "multi-character character constant");
6224 * Parse a wide character constant.
6226 static expression_t *parse_wide_character_constant(void)
6228 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6229 literal->base.source_position = token.source_position;
6230 literal->base.type = type_int;
6231 literal->literal.value = token.literal;
6233 size_t len = wstrlen(&literal->literal.value);
6235 warningf(HERE, "multi-character character constant");
6242 static entity_t *create_implicit_function(symbol_t *symbol,
6243 const source_position_t *source_position)
6245 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6246 ntype->function.return_type = type_int;
6247 ntype->function.unspecified_parameters = true;
6248 ntype->function.linkage = LINKAGE_C;
6249 type_t *type = identify_new_type(ntype);
6251 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6252 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6253 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6254 entity->declaration.type = type;
6255 entity->declaration.implicit = true;
6256 entity->base.namespc = NAMESPACE_NORMAL;
6257 entity->base.symbol = symbol;
6258 entity->base.source_position = *source_position;
6260 if (current_scope != NULL) {
6261 bool strict_prototypes_old = warning.strict_prototypes;
6262 warning.strict_prototypes = false;
6263 record_entity(entity, false);
6264 warning.strict_prototypes = strict_prototypes_old;
6271 * Performs automatic type cast as described in §6.3.2.1.
6273 * @param orig_type the original type
6275 static type_t *automatic_type_conversion(type_t *orig_type)
6277 type_t *type = skip_typeref(orig_type);
6278 if (is_type_array(type)) {
6279 array_type_t *array_type = &type->array;
6280 type_t *element_type = array_type->element_type;
6281 unsigned qualifiers = array_type->base.qualifiers;
6283 return make_pointer_type(element_type, qualifiers);
6286 if (is_type_function(type)) {
6287 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6294 * reverts the automatic casts of array to pointer types and function
6295 * to function-pointer types as defined §6.3.2.1
6297 type_t *revert_automatic_type_conversion(const expression_t *expression)
6299 switch (expression->kind) {
6300 case EXPR_REFERENCE: {
6301 entity_t *entity = expression->reference.entity;
6302 if (is_declaration(entity)) {
6303 return entity->declaration.type;
6304 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6305 return entity->enum_value.enum_type;
6307 panic("no declaration or enum in reference");
6312 entity_t *entity = expression->select.compound_entry;
6313 assert(is_declaration(entity));
6314 type_t *type = entity->declaration.type;
6315 return get_qualified_type(type,
6316 expression->base.type->base.qualifiers);
6319 case EXPR_UNARY_DEREFERENCE: {
6320 const expression_t *const value = expression->unary.value;
6321 type_t *const type = skip_typeref(value->base.type);
6322 if (!is_type_pointer(type))
6323 return type_error_type;
6324 return type->pointer.points_to;
6327 case EXPR_ARRAY_ACCESS: {
6328 const expression_t *array_ref = expression->array_access.array_ref;
6329 type_t *type_left = skip_typeref(array_ref->base.type);
6330 if (!is_type_pointer(type_left))
6331 return type_error_type;
6332 return type_left->pointer.points_to;
6335 case EXPR_STRING_LITERAL: {
6336 size_t size = expression->string_literal.value.size;
6337 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6340 case EXPR_WIDE_STRING_LITERAL: {
6341 size_t size = wstrlen(&expression->string_literal.value);
6342 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6345 case EXPR_COMPOUND_LITERAL:
6346 return expression->compound_literal.type;
6351 return expression->base.type;
6355 * Find an entity matching a symbol in a scope.
6356 * Uses current scope if scope is NULL
6358 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6359 namespace_tag_t namespc)
6361 if (scope == NULL) {
6362 return get_entity(symbol, namespc);
6365 /* we should optimize here, if scope grows above a certain size we should
6366 construct a hashmap here... */
6367 entity_t *entity = scope->entities;
6368 for ( ; entity != NULL; entity = entity->base.next) {
6369 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6376 static entity_t *parse_qualified_identifier(void)
6378 /* namespace containing the symbol */
6380 source_position_t pos;
6381 const scope_t *lookup_scope = NULL;
6383 if (next_if(T_COLONCOLON))
6384 lookup_scope = &unit->scope;
6388 if (token.type != T_IDENTIFIER) {
6389 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6390 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6392 symbol = token.symbol;
6397 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6399 if (!next_if(T_COLONCOLON))
6402 switch (entity->kind) {
6403 case ENTITY_NAMESPACE:
6404 lookup_scope = &entity->namespacee.members;
6409 lookup_scope = &entity->compound.members;
6412 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6413 symbol, get_entity_kind_name(entity->kind));
6418 if (entity == NULL) {
6419 if (!strict_mode && token.type == '(') {
6420 /* an implicitly declared function */
6421 if (warning.error_implicit_function_declaration) {
6422 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6423 } else if (warning.implicit_function_declaration) {
6424 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6427 entity = create_implicit_function(symbol, &pos);
6429 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6430 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6437 /* skip further qualifications */
6438 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6440 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6443 static expression_t *parse_reference(void)
6445 source_position_t const pos = token.source_position;
6446 entity_t *const entity = parse_qualified_identifier();
6449 if (is_declaration(entity)) {
6450 orig_type = entity->declaration.type;
6451 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6452 orig_type = entity->enum_value.enum_type;
6454 panic("expected declaration or enum value in reference");
6457 /* we always do the auto-type conversions; the & and sizeof parser contains
6458 * code to revert this! */
6459 type_t *type = automatic_type_conversion(orig_type);
6461 expression_kind_t kind = EXPR_REFERENCE;
6462 if (entity->kind == ENTITY_ENUM_VALUE)
6463 kind = EXPR_REFERENCE_ENUM_VALUE;
6465 expression_t *expression = allocate_expression_zero(kind);
6466 expression->base.source_position = pos;
6467 expression->base.type = type;
6468 expression->reference.entity = entity;
6470 /* this declaration is used */
6471 if (is_declaration(entity)) {
6472 entity->declaration.used = true;
6475 if (entity->base.parent_scope != file_scope
6476 && (current_function != NULL
6477 && entity->base.parent_scope->depth < current_function->parameters.depth)
6478 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6479 if (entity->kind == ENTITY_VARIABLE) {
6480 /* access of a variable from an outer function */
6481 entity->variable.address_taken = true;
6482 } else if (entity->kind == ENTITY_PARAMETER) {
6483 entity->parameter.address_taken = true;
6485 current_function->need_closure = true;
6488 check_deprecated(HERE, entity);
6490 if (warning.init_self && entity == current_init_decl && !in_type_prop
6491 && entity->kind == ENTITY_VARIABLE) {
6492 current_init_decl = NULL;
6493 warningf(&pos, "variable '%#T' is initialized by itself",
6494 entity->declaration.type, entity->base.symbol);
6500 static bool semantic_cast(expression_t *cast)
6502 expression_t *expression = cast->unary.value;
6503 type_t *orig_dest_type = cast->base.type;
6504 type_t *orig_type_right = expression->base.type;
6505 type_t const *dst_type = skip_typeref(orig_dest_type);
6506 type_t const *src_type = skip_typeref(orig_type_right);
6507 source_position_t const *pos = &cast->base.source_position;
6509 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6510 if (dst_type == type_void)
6513 /* only integer and pointer can be casted to pointer */
6514 if (is_type_pointer(dst_type) &&
6515 !is_type_pointer(src_type) &&
6516 !is_type_integer(src_type) &&
6517 is_type_valid(src_type)) {
6518 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6522 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6523 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6527 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6528 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6532 if (warning.cast_qual &&
6533 is_type_pointer(src_type) &&
6534 is_type_pointer(dst_type)) {
6535 type_t *src = skip_typeref(src_type->pointer.points_to);
6536 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6537 unsigned missing_qualifiers =
6538 src->base.qualifiers & ~dst->base.qualifiers;
6539 if (missing_qualifiers != 0) {
6541 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6542 missing_qualifiers, orig_type_right);
6548 static expression_t *parse_compound_literal(type_t *type)
6550 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6552 parse_initializer_env_t env;
6555 env.must_be_constant = false;
6556 initializer_t *initializer = parse_initializer(&env);
6559 expression->compound_literal.initializer = initializer;
6560 expression->compound_literal.type = type;
6561 expression->base.type = automatic_type_conversion(type);
6567 * Parse a cast expression.
6569 static expression_t *parse_cast(void)
6571 source_position_t source_position = token.source_position;
6574 add_anchor_token(')');
6576 type_t *type = parse_typename();
6578 rem_anchor_token(')');
6579 expect(')', end_error);
6581 if (token.type == '{') {
6582 return parse_compound_literal(type);
6585 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6586 cast->base.source_position = source_position;
6588 expression_t *value = parse_subexpression(PREC_CAST);
6589 cast->base.type = type;
6590 cast->unary.value = value;
6592 if (! semantic_cast(cast)) {
6593 /* TODO: record the error in the AST. else it is impossible to detect it */
6598 return create_invalid_expression();
6602 * Parse a statement expression.
6604 static expression_t *parse_statement_expression(void)
6606 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6609 add_anchor_token(')');
6611 statement_t *statement = parse_compound_statement(true);
6612 statement->compound.stmt_expr = true;
6613 expression->statement.statement = statement;
6615 /* find last statement and use its type */
6616 type_t *type = type_void;
6617 const statement_t *stmt = statement->compound.statements;
6619 while (stmt->base.next != NULL)
6620 stmt = stmt->base.next;
6622 if (stmt->kind == STATEMENT_EXPRESSION) {
6623 type = stmt->expression.expression->base.type;
6625 } else if (warning.other) {
6626 warningf(&expression->base.source_position, "empty statement expression ({})");
6628 expression->base.type = type;
6630 rem_anchor_token(')');
6631 expect(')', end_error);
6638 * Parse a parenthesized expression.
6640 static expression_t *parse_parenthesized_expression(void)
6642 token_t const* const la1 = look_ahead(1);
6643 switch (la1->type) {
6645 /* gcc extension: a statement expression */
6646 return parse_statement_expression();
6649 if (is_typedef_symbol(la1->symbol)) {
6652 return parse_cast();
6657 add_anchor_token(')');
6658 expression_t *result = parse_expression();
6659 result->base.parenthesized = true;
6660 rem_anchor_token(')');
6661 expect(')', end_error);
6667 static expression_t *parse_function_keyword(void)
6671 if (current_function == NULL) {
6672 errorf(HERE, "'__func__' used outside of a function");
6675 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6676 expression->base.type = type_char_ptr;
6677 expression->funcname.kind = FUNCNAME_FUNCTION;
6684 static expression_t *parse_pretty_function_keyword(void)
6686 if (current_function == NULL) {
6687 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6690 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6691 expression->base.type = type_char_ptr;
6692 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6694 eat(T___PRETTY_FUNCTION__);
6699 static expression_t *parse_funcsig_keyword(void)
6701 if (current_function == NULL) {
6702 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6705 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6706 expression->base.type = type_char_ptr;
6707 expression->funcname.kind = FUNCNAME_FUNCSIG;
6714 static expression_t *parse_funcdname_keyword(void)
6716 if (current_function == NULL) {
6717 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6720 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6721 expression->base.type = type_char_ptr;
6722 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6724 eat(T___FUNCDNAME__);
6729 static designator_t *parse_designator(void)
6731 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6732 result->source_position = *HERE;
6734 if (token.type != T_IDENTIFIER) {
6735 parse_error_expected("while parsing member designator",
6736 T_IDENTIFIER, NULL);
6739 result->symbol = token.symbol;
6742 designator_t *last_designator = result;
6745 if (token.type != T_IDENTIFIER) {
6746 parse_error_expected("while parsing member designator",
6747 T_IDENTIFIER, NULL);
6750 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6751 designator->source_position = *HERE;
6752 designator->symbol = token.symbol;
6755 last_designator->next = designator;
6756 last_designator = designator;
6760 add_anchor_token(']');
6761 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6762 designator->source_position = *HERE;
6763 designator->array_index = parse_expression();
6764 rem_anchor_token(']');
6765 expect(']', end_error);
6766 if (designator->array_index == NULL) {
6770 last_designator->next = designator;
6771 last_designator = designator;
6783 * Parse the __builtin_offsetof() expression.
6785 static expression_t *parse_offsetof(void)
6787 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6788 expression->base.type = type_size_t;
6790 eat(T___builtin_offsetof);
6792 expect('(', end_error);
6793 add_anchor_token(',');
6794 type_t *type = parse_typename();
6795 rem_anchor_token(',');
6796 expect(',', end_error);
6797 add_anchor_token(')');
6798 designator_t *designator = parse_designator();
6799 rem_anchor_token(')');
6800 expect(')', end_error);
6802 expression->offsetofe.type = type;
6803 expression->offsetofe.designator = designator;
6806 memset(&path, 0, sizeof(path));
6807 path.top_type = type;
6808 path.path = NEW_ARR_F(type_path_entry_t, 0);
6810 descend_into_subtype(&path);
6812 if (!walk_designator(&path, designator, true)) {
6813 return create_invalid_expression();
6816 DEL_ARR_F(path.path);
6820 return create_invalid_expression();
6824 * Parses a _builtin_va_start() expression.
6826 static expression_t *parse_va_start(void)
6828 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6830 eat(T___builtin_va_start);
6832 expect('(', end_error);
6833 add_anchor_token(',');
6834 expression->va_starte.ap = parse_assignment_expression();
6835 rem_anchor_token(',');
6836 expect(',', end_error);
6837 expression_t *const expr = parse_assignment_expression();
6838 if (expr->kind == EXPR_REFERENCE) {
6839 entity_t *const entity = expr->reference.entity;
6840 if (!current_function->base.type->function.variadic) {
6841 errorf(&expr->base.source_position,
6842 "'va_start' used in non-variadic function");
6843 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6844 entity->base.next != NULL ||
6845 entity->kind != ENTITY_PARAMETER) {
6846 errorf(&expr->base.source_position,
6847 "second argument of 'va_start' must be last parameter of the current function");
6849 expression->va_starte.parameter = &entity->variable;
6851 expect(')', end_error);
6854 expect(')', end_error);
6856 return create_invalid_expression();
6860 * Parses a __builtin_va_arg() expression.
6862 static expression_t *parse_va_arg(void)
6864 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6866 eat(T___builtin_va_arg);
6868 expect('(', end_error);
6870 ap.expression = parse_assignment_expression();
6871 expression->va_arge.ap = ap.expression;
6872 check_call_argument(type_valist, &ap, 1);
6874 expect(',', end_error);
6875 expression->base.type = parse_typename();
6876 expect(')', end_error);
6880 return create_invalid_expression();
6884 * Parses a __builtin_va_copy() expression.
6886 static expression_t *parse_va_copy(void)
6888 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6890 eat(T___builtin_va_copy);
6892 expect('(', end_error);
6893 expression_t *dst = parse_assignment_expression();
6894 assign_error_t error = semantic_assign(type_valist, dst);
6895 report_assign_error(error, type_valist, dst, "call argument 1",
6896 &dst->base.source_position);
6897 expression->va_copye.dst = dst;
6899 expect(',', end_error);
6901 call_argument_t src;
6902 src.expression = parse_assignment_expression();
6903 check_call_argument(type_valist, &src, 2);
6904 expression->va_copye.src = src.expression;
6905 expect(')', end_error);
6909 return create_invalid_expression();
6913 * Parses a __builtin_constant_p() expression.
6915 static expression_t *parse_builtin_constant(void)
6917 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6919 eat(T___builtin_constant_p);
6921 expect('(', end_error);
6922 add_anchor_token(')');
6923 expression->builtin_constant.value = parse_assignment_expression();
6924 rem_anchor_token(')');
6925 expect(')', end_error);
6926 expression->base.type = type_int;
6930 return create_invalid_expression();
6934 * Parses a __builtin_types_compatible_p() expression.
6936 static expression_t *parse_builtin_types_compatible(void)
6938 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6940 eat(T___builtin_types_compatible_p);
6942 expect('(', end_error);
6943 add_anchor_token(')');
6944 add_anchor_token(',');
6945 expression->builtin_types_compatible.left = parse_typename();
6946 rem_anchor_token(',');
6947 expect(',', end_error);
6948 expression->builtin_types_compatible.right = parse_typename();
6949 rem_anchor_token(')');
6950 expect(')', end_error);
6951 expression->base.type = type_int;
6955 return create_invalid_expression();
6959 * Parses a __builtin_is_*() compare expression.
6961 static expression_t *parse_compare_builtin(void)
6963 expression_t *expression;
6965 switch (token.type) {
6966 case T___builtin_isgreater:
6967 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6969 case T___builtin_isgreaterequal:
6970 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6972 case T___builtin_isless:
6973 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6975 case T___builtin_islessequal:
6976 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6978 case T___builtin_islessgreater:
6979 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6981 case T___builtin_isunordered:
6982 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6985 internal_errorf(HERE, "invalid compare builtin found");
6987 expression->base.source_position = *HERE;
6990 expect('(', end_error);
6991 expression->binary.left = parse_assignment_expression();
6992 expect(',', end_error);
6993 expression->binary.right = parse_assignment_expression();
6994 expect(')', end_error);
6996 type_t *const orig_type_left = expression->binary.left->base.type;
6997 type_t *const orig_type_right = expression->binary.right->base.type;
6999 type_t *const type_left = skip_typeref(orig_type_left);
7000 type_t *const type_right = skip_typeref(orig_type_right);
7001 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7002 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7003 type_error_incompatible("invalid operands in comparison",
7004 &expression->base.source_position, orig_type_left, orig_type_right);
7007 semantic_comparison(&expression->binary);
7012 return create_invalid_expression();
7016 * Parses a MS assume() expression.
7018 static expression_t *parse_assume(void)
7020 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7024 expect('(', end_error);
7025 add_anchor_token(')');
7026 expression->unary.value = parse_assignment_expression();
7027 rem_anchor_token(')');
7028 expect(')', end_error);
7030 expression->base.type = type_void;
7033 return create_invalid_expression();
7037 * Return the declaration for a given label symbol or create a new one.
7039 * @param symbol the symbol of the label
7041 static label_t *get_label(symbol_t *symbol)
7044 assert(current_function != NULL);
7046 label = get_entity(symbol, NAMESPACE_LABEL);
7047 /* if we found a local label, we already created the declaration */
7048 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7049 if (label->base.parent_scope != current_scope) {
7050 assert(label->base.parent_scope->depth < current_scope->depth);
7051 current_function->goto_to_outer = true;
7053 return &label->label;
7056 label = get_entity(symbol, NAMESPACE_LABEL);
7057 /* if we found a label in the same function, then we already created the
7060 && label->base.parent_scope == ¤t_function->parameters) {
7061 return &label->label;
7064 /* otherwise we need to create a new one */
7065 label = allocate_entity_zero(ENTITY_LABEL);
7066 label->base.namespc = NAMESPACE_LABEL;
7067 label->base.symbol = symbol;
7071 return &label->label;
7075 * Parses a GNU && label address expression.
7077 static expression_t *parse_label_address(void)
7079 source_position_t source_position = token.source_position;
7081 if (token.type != T_IDENTIFIER) {
7082 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7085 symbol_t *symbol = token.symbol;
7088 label_t *label = get_label(symbol);
7090 label->address_taken = true;
7092 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7093 expression->base.source_position = source_position;
7095 /* label address is threaten as a void pointer */
7096 expression->base.type = type_void_ptr;
7097 expression->label_address.label = label;
7100 return create_invalid_expression();
7104 * Parse a microsoft __noop expression.
7106 static expression_t *parse_noop_expression(void)
7108 /* the result is a (int)0 */
7109 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7110 literal->base.type = type_int;
7111 literal->base.source_position = token.source_position;
7112 literal->literal.value.begin = "__noop";
7113 literal->literal.value.size = 6;
7117 if (token.type == '(') {
7118 /* parse arguments */
7120 add_anchor_token(')');
7121 add_anchor_token(',');
7123 if (token.type != ')') do {
7124 (void)parse_assignment_expression();
7125 } while (next_if(','));
7127 rem_anchor_token(',');
7128 rem_anchor_token(')');
7129 expect(')', end_error);
7136 * Parses a primary expression.
7138 static expression_t *parse_primary_expression(void)
7140 switch (token.type) {
7141 case T_false: return parse_boolean_literal(false);
7142 case T_true: return parse_boolean_literal(true);
7144 case T_INTEGER_OCTAL:
7145 case T_INTEGER_HEXADECIMAL:
7146 case T_FLOATINGPOINT:
7147 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7148 case T_CHARACTER_CONSTANT: return parse_character_constant();
7149 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7150 case T_STRING_LITERAL:
7151 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7152 case T___FUNCTION__:
7153 case T___func__: return parse_function_keyword();
7154 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7155 case T___FUNCSIG__: return parse_funcsig_keyword();
7156 case T___FUNCDNAME__: return parse_funcdname_keyword();
7157 case T___builtin_offsetof: return parse_offsetof();
7158 case T___builtin_va_start: return parse_va_start();
7159 case T___builtin_va_arg: return parse_va_arg();
7160 case T___builtin_va_copy: return parse_va_copy();
7161 case T___builtin_isgreater:
7162 case T___builtin_isgreaterequal:
7163 case T___builtin_isless:
7164 case T___builtin_islessequal:
7165 case T___builtin_islessgreater:
7166 case T___builtin_isunordered: return parse_compare_builtin();
7167 case T___builtin_constant_p: return parse_builtin_constant();
7168 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7169 case T__assume: return parse_assume();
7172 return parse_label_address();
7175 case '(': return parse_parenthesized_expression();
7176 case T___noop: return parse_noop_expression();
7178 /* Gracefully handle type names while parsing expressions. */
7180 return parse_reference();
7182 if (!is_typedef_symbol(token.symbol)) {
7183 return parse_reference();
7187 source_position_t const pos = *HERE;
7188 type_t const *const type = parse_typename();
7189 errorf(&pos, "encountered type '%T' while parsing expression", type);
7190 return create_invalid_expression();
7194 errorf(HERE, "unexpected token %K, expected an expression", &token);
7196 return create_invalid_expression();
7199 static expression_t *parse_array_expression(expression_t *left)
7201 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7202 array_access_expression_t *const arr = &expr->array_access;
7205 add_anchor_token(']');
7207 expression_t *const inside = parse_expression();
7209 type_t *const orig_type_left = left->base.type;
7210 type_t *const orig_type_inside = inside->base.type;
7212 type_t *const type_left = skip_typeref(orig_type_left);
7213 type_t *const type_inside = skip_typeref(orig_type_inside);
7219 if (is_type_pointer(type_left)) {
7222 idx_type = type_inside;
7223 res_type = type_left->pointer.points_to;
7225 } else if (is_type_pointer(type_inside)) {
7226 arr->flipped = true;
7229 idx_type = type_left;
7230 res_type = type_inside->pointer.points_to;
7232 res_type = automatic_type_conversion(res_type);
7233 if (!is_type_integer(idx_type)) {
7234 errorf(&idx->base.source_position, "array subscript must have integer type");
7235 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR) && warning.char_subscripts) {
7236 warningf(&idx->base.source_position, "array subscript has char type");
7239 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7241 "array access on object with non-pointer types '%T', '%T'",
7242 orig_type_left, orig_type_inside);
7244 res_type = type_error_type;
7249 arr->array_ref = ref;
7251 arr->base.type = res_type;
7253 rem_anchor_token(']');
7254 expect(']', end_error);
7259 static expression_t *parse_typeprop(expression_kind_t const kind)
7261 expression_t *tp_expression = allocate_expression_zero(kind);
7262 tp_expression->base.type = type_size_t;
7264 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7266 /* we only refer to a type property, mark this case */
7267 bool old = in_type_prop;
7268 in_type_prop = true;
7271 expression_t *expression;
7272 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7274 add_anchor_token(')');
7275 orig_type = parse_typename();
7276 rem_anchor_token(')');
7277 expect(')', end_error);
7279 if (token.type == '{') {
7280 /* It was not sizeof(type) after all. It is sizeof of an expression
7281 * starting with a compound literal */
7282 expression = parse_compound_literal(orig_type);
7283 goto typeprop_expression;
7286 expression = parse_subexpression(PREC_UNARY);
7288 typeprop_expression:
7289 tp_expression->typeprop.tp_expression = expression;
7291 orig_type = revert_automatic_type_conversion(expression);
7292 expression->base.type = orig_type;
7295 tp_expression->typeprop.type = orig_type;
7296 type_t const* const type = skip_typeref(orig_type);
7297 char const* wrong_type = NULL;
7298 if (is_type_incomplete(type)) {
7299 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7300 wrong_type = "incomplete";
7301 } else if (type->kind == TYPE_FUNCTION) {
7303 /* function types are allowed (and return 1) */
7304 if (warning.other) {
7305 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7306 warningf(&tp_expression->base.source_position,
7307 "%s expression with function argument returns invalid result", what);
7310 wrong_type = "function";
7313 if (is_type_incomplete(type))
7314 wrong_type = "incomplete";
7316 if (type->kind == TYPE_BITFIELD)
7317 wrong_type = "bitfield";
7319 if (wrong_type != NULL) {
7320 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7321 errorf(&tp_expression->base.source_position,
7322 "operand of %s expression must not be of %s type '%T'",
7323 what, wrong_type, orig_type);
7328 return tp_expression;
7331 static expression_t *parse_sizeof(void)
7333 return parse_typeprop(EXPR_SIZEOF);
7336 static expression_t *parse_alignof(void)
7338 return parse_typeprop(EXPR_ALIGNOF);
7341 static expression_t *parse_select_expression(expression_t *addr)
7343 assert(token.type == '.' || token.type == T_MINUSGREATER);
7344 bool select_left_arrow = (token.type == T_MINUSGREATER);
7345 source_position_t const pos = *HERE;
7348 if (token.type != T_IDENTIFIER) {
7349 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7350 return create_invalid_expression();
7352 symbol_t *symbol = token.symbol;
7355 type_t *const orig_type = addr->base.type;
7356 type_t *const type = skip_typeref(orig_type);
7359 bool saw_error = false;
7360 if (is_type_pointer(type)) {
7361 if (!select_left_arrow) {
7363 "request for member '%Y' in something not a struct or union, but '%T'",
7367 type_left = skip_typeref(type->pointer.points_to);
7369 if (select_left_arrow && is_type_valid(type)) {
7370 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7376 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7377 type_left->kind != TYPE_COMPOUND_UNION) {
7379 if (is_type_valid(type_left) && !saw_error) {
7381 "request for member '%Y' in something not a struct or union, but '%T'",
7384 return create_invalid_expression();
7387 compound_t *compound = type_left->compound.compound;
7388 if (!compound->complete) {
7389 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7391 return create_invalid_expression();
7394 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7395 expression_t *result =
7396 find_create_select(&pos, addr, qualifiers, compound, symbol);
7398 if (result == NULL) {
7399 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7400 return create_invalid_expression();
7406 static void check_call_argument(type_t *expected_type,
7407 call_argument_t *argument, unsigned pos)
7409 type_t *expected_type_skip = skip_typeref(expected_type);
7410 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7411 expression_t *arg_expr = argument->expression;
7412 type_t *arg_type = skip_typeref(arg_expr->base.type);
7414 /* handle transparent union gnu extension */
7415 if (is_type_union(expected_type_skip)
7416 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7417 compound_t *union_decl = expected_type_skip->compound.compound;
7418 type_t *best_type = NULL;
7419 entity_t *entry = union_decl->members.entities;
7420 for ( ; entry != NULL; entry = entry->base.next) {
7421 assert(is_declaration(entry));
7422 type_t *decl_type = entry->declaration.type;
7423 error = semantic_assign(decl_type, arg_expr);
7424 if (error == ASSIGN_ERROR_INCOMPATIBLE
7425 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7428 if (error == ASSIGN_SUCCESS) {
7429 best_type = decl_type;
7430 } else if (best_type == NULL) {
7431 best_type = decl_type;
7435 if (best_type != NULL) {
7436 expected_type = best_type;
7440 error = semantic_assign(expected_type, arg_expr);
7441 argument->expression = create_implicit_cast(arg_expr, expected_type);
7443 if (error != ASSIGN_SUCCESS) {
7444 /* report exact scope in error messages (like "in argument 3") */
7446 snprintf(buf, sizeof(buf), "call argument %u", pos);
7447 report_assign_error(error, expected_type, arg_expr, buf,
7448 &arg_expr->base.source_position);
7449 } else if (warning.traditional || warning.conversion) {
7450 type_t *const promoted_type = get_default_promoted_type(arg_type);
7451 if (!types_compatible(expected_type_skip, promoted_type) &&
7452 !types_compatible(expected_type_skip, type_void_ptr) &&
7453 !types_compatible(type_void_ptr, promoted_type)) {
7454 /* Deliberately show the skipped types in this warning */
7455 warningf(&arg_expr->base.source_position,
7456 "passing call argument %u as '%T' rather than '%T' due to prototype",
7457 pos, expected_type_skip, promoted_type);
7463 * Handle the semantic restrictions of builtin calls
7465 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7466 switch (call->function->reference.entity->function.btk) {
7467 case bk_gnu_builtin_return_address:
7468 case bk_gnu_builtin_frame_address: {
7469 /* argument must be constant */
7470 call_argument_t *argument = call->arguments;
7472 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7473 errorf(&call->base.source_position,
7474 "argument of '%Y' must be a constant expression",
7475 call->function->reference.entity->base.symbol);
7479 case bk_gnu_builtin_object_size:
7480 if (call->arguments == NULL)
7483 call_argument_t *arg = call->arguments->next;
7484 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7485 errorf(&call->base.source_position,
7486 "second argument of '%Y' must be a constant expression",
7487 call->function->reference.entity->base.symbol);
7490 case bk_gnu_builtin_prefetch:
7491 /* second and third argument must be constant if existent */
7492 if (call->arguments == NULL)
7494 call_argument_t *rw = call->arguments->next;
7495 call_argument_t *locality = NULL;
7498 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7499 errorf(&call->base.source_position,
7500 "second argument of '%Y' must be a constant expression",
7501 call->function->reference.entity->base.symbol);
7503 locality = rw->next;
7505 if (locality != NULL) {
7506 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7507 errorf(&call->base.source_position,
7508 "third argument of '%Y' must be a constant expression",
7509 call->function->reference.entity->base.symbol);
7511 locality = rw->next;
7520 * Parse a call expression, ie. expression '( ... )'.
7522 * @param expression the function address
7524 static expression_t *parse_call_expression(expression_t *expression)
7526 expression_t *result = allocate_expression_zero(EXPR_CALL);
7527 call_expression_t *call = &result->call;
7528 call->function = expression;
7530 type_t *const orig_type = expression->base.type;
7531 type_t *const type = skip_typeref(orig_type);
7533 function_type_t *function_type = NULL;
7534 if (is_type_pointer(type)) {
7535 type_t *const to_type = skip_typeref(type->pointer.points_to);
7537 if (is_type_function(to_type)) {
7538 function_type = &to_type->function;
7539 call->base.type = function_type->return_type;
7543 if (function_type == NULL && is_type_valid(type)) {
7545 "called object '%E' (type '%T') is not a pointer to a function",
7546 expression, orig_type);
7549 /* parse arguments */
7551 add_anchor_token(')');
7552 add_anchor_token(',');
7554 if (token.type != ')') {
7555 call_argument_t **anchor = &call->arguments;
7557 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7558 argument->expression = parse_assignment_expression();
7561 anchor = &argument->next;
7562 } while (next_if(','));
7564 rem_anchor_token(',');
7565 rem_anchor_token(')');
7566 expect(')', end_error);
7568 if (function_type == NULL)
7571 /* check type and count of call arguments */
7572 function_parameter_t *parameter = function_type->parameters;
7573 call_argument_t *argument = call->arguments;
7574 if (!function_type->unspecified_parameters) {
7575 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7576 parameter = parameter->next, argument = argument->next) {
7577 check_call_argument(parameter->type, argument, ++pos);
7580 if (parameter != NULL) {
7581 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7582 } else if (argument != NULL && !function_type->variadic) {
7583 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7587 /* do default promotion for other arguments */
7588 for (; argument != NULL; argument = argument->next) {
7589 type_t *type = argument->expression->base.type;
7590 if (!is_type_object(skip_typeref(type))) {
7591 errorf(&argument->expression->base.source_position,
7592 "call argument '%E' must not be void", argument->expression);
7595 type = get_default_promoted_type(type);
7597 argument->expression
7598 = create_implicit_cast(argument->expression, type);
7603 if (warning.aggregate_return &&
7604 is_type_compound(skip_typeref(function_type->return_type))) {
7605 warningf(&expression->base.source_position,
7606 "function call has aggregate value");
7609 if (expression->kind == EXPR_REFERENCE) {
7610 reference_expression_t *reference = &expression->reference;
7611 if (reference->entity->kind == ENTITY_FUNCTION &&
7612 reference->entity->function.btk != bk_none)
7613 handle_builtin_argument_restrictions(call);
7620 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7622 static bool same_compound_type(const type_t *type1, const type_t *type2)
7625 is_type_compound(type1) &&
7626 type1->kind == type2->kind &&
7627 type1->compound.compound == type2->compound.compound;
7630 static expression_t const *get_reference_address(expression_t const *expr)
7632 bool regular_take_address = true;
7634 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7635 expr = expr->unary.value;
7637 regular_take_address = false;
7640 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7643 expr = expr->unary.value;
7646 if (expr->kind != EXPR_REFERENCE)
7649 /* special case for functions which are automatically converted to a
7650 * pointer to function without an extra TAKE_ADDRESS operation */
7651 if (!regular_take_address &&
7652 expr->reference.entity->kind != ENTITY_FUNCTION) {
7659 static void warn_reference_address_as_bool(expression_t const* expr)
7661 if (!warning.address)
7664 expr = get_reference_address(expr);
7666 warningf(&expr->base.source_position,
7667 "the address of '%Y' will always evaluate as 'true'",
7668 expr->reference.entity->base.symbol);
7672 static void warn_assignment_in_condition(const expression_t *const expr)
7674 if (!warning.parentheses)
7676 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7678 if (expr->base.parenthesized)
7680 warningf(&expr->base.source_position,
7681 "suggest parentheses around assignment used as truth value");
7684 static void semantic_condition(expression_t const *const expr,
7685 char const *const context)
7687 type_t *const type = skip_typeref(expr->base.type);
7688 if (is_type_scalar(type)) {
7689 warn_reference_address_as_bool(expr);
7690 warn_assignment_in_condition(expr);
7691 } else if (is_type_valid(type)) {
7692 errorf(&expr->base.source_position,
7693 "%s must have scalar type", context);
7698 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7700 * @param expression the conditional expression
7702 static expression_t *parse_conditional_expression(expression_t *expression)
7704 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7706 conditional_expression_t *conditional = &result->conditional;
7707 conditional->condition = expression;
7710 add_anchor_token(':');
7712 /* §6.5.15:2 The first operand shall have scalar type. */
7713 semantic_condition(expression, "condition of conditional operator");
7715 expression_t *true_expression = expression;
7716 bool gnu_cond = false;
7717 if (GNU_MODE && token.type == ':') {
7720 true_expression = parse_expression();
7722 rem_anchor_token(':');
7723 expect(':', end_error);
7725 expression_t *false_expression =
7726 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7728 type_t *const orig_true_type = true_expression->base.type;
7729 type_t *const orig_false_type = false_expression->base.type;
7730 type_t *const true_type = skip_typeref(orig_true_type);
7731 type_t *const false_type = skip_typeref(orig_false_type);
7734 type_t *result_type;
7735 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7736 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7737 /* ISO/IEC 14882:1998(E) §5.16:2 */
7738 if (true_expression->kind == EXPR_UNARY_THROW) {
7739 result_type = false_type;
7740 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7741 result_type = true_type;
7743 if (warning.other && (
7744 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7745 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7747 warningf(&conditional->base.source_position,
7748 "ISO C forbids conditional expression with only one void side");
7750 result_type = type_void;
7752 } else if (is_type_arithmetic(true_type)
7753 && is_type_arithmetic(false_type)) {
7754 result_type = semantic_arithmetic(true_type, false_type);
7755 } else if (same_compound_type(true_type, false_type)) {
7756 /* just take 1 of the 2 types */
7757 result_type = true_type;
7758 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7759 type_t *pointer_type;
7761 expression_t *other_expression;
7762 if (is_type_pointer(true_type) &&
7763 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7764 pointer_type = true_type;
7765 other_type = false_type;
7766 other_expression = false_expression;
7768 pointer_type = false_type;
7769 other_type = true_type;
7770 other_expression = true_expression;
7773 if (is_null_pointer_constant(other_expression)) {
7774 result_type = pointer_type;
7775 } else if (is_type_pointer(other_type)) {
7776 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7777 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7780 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7781 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7783 } else if (types_compatible(get_unqualified_type(to1),
7784 get_unqualified_type(to2))) {
7787 if (warning.other) {
7788 warningf(&conditional->base.source_position,
7789 "pointer types '%T' and '%T' in conditional expression are incompatible",
7790 true_type, false_type);
7795 type_t *const type =
7796 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7797 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7798 } else if (is_type_integer(other_type)) {
7799 if (warning.other) {
7800 warningf(&conditional->base.source_position,
7801 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7803 result_type = pointer_type;
7805 if (is_type_valid(other_type)) {
7806 type_error_incompatible("while parsing conditional",
7807 &expression->base.source_position, true_type, false_type);
7809 result_type = type_error_type;
7812 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7813 type_error_incompatible("while parsing conditional",
7814 &conditional->base.source_position, true_type,
7817 result_type = type_error_type;
7820 conditional->true_expression
7821 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7822 conditional->false_expression
7823 = create_implicit_cast(false_expression, result_type);
7824 conditional->base.type = result_type;
7829 * Parse an extension expression.
7831 static expression_t *parse_extension(void)
7833 eat(T___extension__);
7835 bool old_gcc_extension = in_gcc_extension;
7836 in_gcc_extension = true;
7837 expression_t *expression = parse_subexpression(PREC_UNARY);
7838 in_gcc_extension = old_gcc_extension;
7843 * Parse a __builtin_classify_type() expression.
7845 static expression_t *parse_builtin_classify_type(void)
7847 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7848 result->base.type = type_int;
7850 eat(T___builtin_classify_type);
7852 expect('(', end_error);
7853 add_anchor_token(')');
7854 expression_t *expression = parse_expression();
7855 rem_anchor_token(')');
7856 expect(')', end_error);
7857 result->classify_type.type_expression = expression;
7861 return create_invalid_expression();
7865 * Parse a delete expression
7866 * ISO/IEC 14882:1998(E) §5.3.5
7868 static expression_t *parse_delete(void)
7870 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7871 result->base.type = type_void;
7876 result->kind = EXPR_UNARY_DELETE_ARRAY;
7877 expect(']', end_error);
7881 expression_t *const value = parse_subexpression(PREC_CAST);
7882 result->unary.value = value;
7884 type_t *const type = skip_typeref(value->base.type);
7885 if (!is_type_pointer(type)) {
7886 if (is_type_valid(type)) {
7887 errorf(&value->base.source_position,
7888 "operand of delete must have pointer type");
7890 } else if (warning.other &&
7891 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7892 warningf(&value->base.source_position,
7893 "deleting 'void*' is undefined");
7900 * Parse a throw expression
7901 * ISO/IEC 14882:1998(E) §15:1
7903 static expression_t *parse_throw(void)
7905 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7906 result->base.type = type_void;
7910 expression_t *value = NULL;
7911 switch (token.type) {
7913 value = parse_assignment_expression();
7914 /* ISO/IEC 14882:1998(E) §15.1:3 */
7915 type_t *const orig_type = value->base.type;
7916 type_t *const type = skip_typeref(orig_type);
7917 if (is_type_incomplete(type)) {
7918 errorf(&value->base.source_position,
7919 "cannot throw object of incomplete type '%T'", orig_type);
7920 } else if (is_type_pointer(type)) {
7921 type_t *const points_to = skip_typeref(type->pointer.points_to);
7922 if (is_type_incomplete(points_to) &&
7923 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7924 errorf(&value->base.source_position,
7925 "cannot throw pointer to incomplete type '%T'", orig_type);
7933 result->unary.value = value;
7938 static bool check_pointer_arithmetic(const source_position_t *source_position,
7939 type_t *pointer_type,
7940 type_t *orig_pointer_type)
7942 type_t *points_to = pointer_type->pointer.points_to;
7943 points_to = skip_typeref(points_to);
7945 if (is_type_incomplete(points_to)) {
7946 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7947 errorf(source_position,
7948 "arithmetic with pointer to incomplete type '%T' not allowed",
7951 } else if (warning.pointer_arith) {
7952 warningf(source_position,
7953 "pointer of type '%T' used in arithmetic",
7956 } else if (is_type_function(points_to)) {
7958 errorf(source_position,
7959 "arithmetic with pointer to function type '%T' not allowed",
7962 } else if (warning.pointer_arith) {
7963 warningf(source_position,
7964 "pointer to a function '%T' used in arithmetic",
7971 static bool is_lvalue(const expression_t *expression)
7973 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7974 switch (expression->kind) {
7975 case EXPR_ARRAY_ACCESS:
7976 case EXPR_COMPOUND_LITERAL:
7977 case EXPR_REFERENCE:
7979 case EXPR_UNARY_DEREFERENCE:
7983 type_t *type = skip_typeref(expression->base.type);
7985 /* ISO/IEC 14882:1998(E) §3.10:3 */
7986 is_type_reference(type) ||
7987 /* Claim it is an lvalue, if the type is invalid. There was a parse
7988 * error before, which maybe prevented properly recognizing it as
7990 !is_type_valid(type);
7995 static void semantic_incdec(unary_expression_t *expression)
7997 type_t *const orig_type = expression->value->base.type;
7998 type_t *const type = skip_typeref(orig_type);
7999 if (is_type_pointer(type)) {
8000 if (!check_pointer_arithmetic(&expression->base.source_position,
8004 } else if (!is_type_real(type) && is_type_valid(type)) {
8005 /* TODO: improve error message */
8006 errorf(&expression->base.source_position,
8007 "operation needs an arithmetic or pointer type");
8010 if (!is_lvalue(expression->value)) {
8011 /* TODO: improve error message */
8012 errorf(&expression->base.source_position, "lvalue required as operand");
8014 expression->base.type = orig_type;
8017 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8019 type_t *const orig_type = expression->value->base.type;
8020 type_t *const type = skip_typeref(orig_type);
8021 if (!is_type_arithmetic(type)) {
8022 if (is_type_valid(type)) {
8023 /* TODO: improve error message */
8024 errorf(&expression->base.source_position,
8025 "operation needs an arithmetic type");
8030 expression->base.type = orig_type;
8033 static void semantic_unexpr_plus(unary_expression_t *expression)
8035 semantic_unexpr_arithmetic(expression);
8036 if (warning.traditional)
8037 warningf(&expression->base.source_position,
8038 "traditional C rejects the unary plus operator");
8041 static void semantic_not(unary_expression_t *expression)
8043 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8044 semantic_condition(expression->value, "operand of !");
8045 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8048 static void semantic_unexpr_integer(unary_expression_t *expression)
8050 type_t *const orig_type = expression->value->base.type;
8051 type_t *const type = skip_typeref(orig_type);
8052 if (!is_type_integer(type)) {
8053 if (is_type_valid(type)) {
8054 errorf(&expression->base.source_position,
8055 "operand of ~ must be of integer type");
8060 expression->base.type = orig_type;
8063 static void semantic_dereference(unary_expression_t *expression)
8065 type_t *const orig_type = expression->value->base.type;
8066 type_t *const type = skip_typeref(orig_type);
8067 if (!is_type_pointer(type)) {
8068 if (is_type_valid(type)) {
8069 errorf(&expression->base.source_position,
8070 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8075 type_t *result_type = type->pointer.points_to;
8076 result_type = automatic_type_conversion(result_type);
8077 expression->base.type = result_type;
8081 * Record that an address is taken (expression represents an lvalue).
8083 * @param expression the expression
8084 * @param may_be_register if true, the expression might be an register
8086 static void set_address_taken(expression_t *expression, bool may_be_register)
8088 if (expression->kind != EXPR_REFERENCE)
8091 entity_t *const entity = expression->reference.entity;
8093 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8096 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8097 && !may_be_register) {
8098 errorf(&expression->base.source_position,
8099 "address of register %s '%Y' requested",
8100 get_entity_kind_name(entity->kind), entity->base.symbol);
8103 if (entity->kind == ENTITY_VARIABLE) {
8104 entity->variable.address_taken = true;
8106 assert(entity->kind == ENTITY_PARAMETER);
8107 entity->parameter.address_taken = true;
8112 * Check the semantic of the address taken expression.
8114 static void semantic_take_addr(unary_expression_t *expression)
8116 expression_t *value = expression->value;
8117 value->base.type = revert_automatic_type_conversion(value);
8119 type_t *orig_type = value->base.type;
8120 type_t *type = skip_typeref(orig_type);
8121 if (!is_type_valid(type))
8125 if (!is_lvalue(value)) {
8126 errorf(&expression->base.source_position, "'&' requires an lvalue");
8128 if (type->kind == TYPE_BITFIELD) {
8129 errorf(&expression->base.source_position,
8130 "'&' not allowed on object with bitfield type '%T'",
8134 set_address_taken(value, false);
8136 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8139 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8140 static expression_t *parse_##unexpression_type(void) \
8142 expression_t *unary_expression \
8143 = allocate_expression_zero(unexpression_type); \
8145 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8147 sfunc(&unary_expression->unary); \
8149 return unary_expression; \
8152 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8153 semantic_unexpr_arithmetic)
8154 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8155 semantic_unexpr_plus)
8156 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8158 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8159 semantic_dereference)
8160 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8162 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8163 semantic_unexpr_integer)
8164 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8166 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8169 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8171 static expression_t *parse_##unexpression_type(expression_t *left) \
8173 expression_t *unary_expression \
8174 = allocate_expression_zero(unexpression_type); \
8176 unary_expression->unary.value = left; \
8178 sfunc(&unary_expression->unary); \
8180 return unary_expression; \
8183 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8184 EXPR_UNARY_POSTFIX_INCREMENT,
8186 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8187 EXPR_UNARY_POSTFIX_DECREMENT,
8190 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8192 /* TODO: handle complex + imaginary types */
8194 type_left = get_unqualified_type(type_left);
8195 type_right = get_unqualified_type(type_right);
8197 /* §6.3.1.8 Usual arithmetic conversions */
8198 if (type_left == type_long_double || type_right == type_long_double) {
8199 return type_long_double;
8200 } else if (type_left == type_double || type_right == type_double) {
8202 } else if (type_left == type_float || type_right == type_float) {
8206 type_left = promote_integer(type_left);
8207 type_right = promote_integer(type_right);
8209 if (type_left == type_right)
8212 bool const signed_left = is_type_signed(type_left);
8213 bool const signed_right = is_type_signed(type_right);
8214 int const rank_left = get_rank(type_left);
8215 int const rank_right = get_rank(type_right);
8217 if (signed_left == signed_right)
8218 return rank_left >= rank_right ? type_left : type_right;
8227 u_rank = rank_right;
8228 u_type = type_right;
8230 s_rank = rank_right;
8231 s_type = type_right;
8236 if (u_rank >= s_rank)
8239 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8241 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8242 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8246 case ATOMIC_TYPE_INT: return type_unsigned_int;
8247 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8248 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8250 default: panic("invalid atomic type");
8255 * Check the semantic restrictions for a binary expression.
8257 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8259 expression_t *const left = expression->left;
8260 expression_t *const right = expression->right;
8261 type_t *const orig_type_left = left->base.type;
8262 type_t *const orig_type_right = right->base.type;
8263 type_t *const type_left = skip_typeref(orig_type_left);
8264 type_t *const type_right = skip_typeref(orig_type_right);
8266 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8267 /* TODO: improve error message */
8268 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8269 errorf(&expression->base.source_position,
8270 "operation needs arithmetic types");
8275 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8276 expression->left = create_implicit_cast(left, arithmetic_type);
8277 expression->right = create_implicit_cast(right, arithmetic_type);
8278 expression->base.type = arithmetic_type;
8281 static void semantic_binexpr_integer(binary_expression_t *const expression)
8283 expression_t *const left = expression->left;
8284 expression_t *const right = expression->right;
8285 type_t *const orig_type_left = left->base.type;
8286 type_t *const orig_type_right = right->base.type;
8287 type_t *const type_left = skip_typeref(orig_type_left);
8288 type_t *const type_right = skip_typeref(orig_type_right);
8290 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8291 /* TODO: improve error message */
8292 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8293 errorf(&expression->base.source_position,
8294 "operation needs integer types");
8299 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8300 expression->left = create_implicit_cast(left, result_type);
8301 expression->right = create_implicit_cast(right, result_type);
8302 expression->base.type = result_type;
8305 static void warn_div_by_zero(binary_expression_t const *const expression)
8307 if (!warning.div_by_zero ||
8308 !is_type_integer(expression->base.type))
8311 expression_t const *const right = expression->right;
8312 /* The type of the right operand can be different for /= */
8313 if (is_type_integer(right->base.type) &&
8314 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8315 !fold_constant_to_bool(right)) {
8316 warningf(&expression->base.source_position, "division by zero");
8321 * Check the semantic restrictions for a div/mod expression.
8323 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8325 semantic_binexpr_arithmetic(expression);
8326 warn_div_by_zero(expression);
8329 static void warn_addsub_in_shift(const expression_t *const expr)
8331 if (expr->base.parenthesized)
8335 switch (expr->kind) {
8336 case EXPR_BINARY_ADD: op = '+'; break;
8337 case EXPR_BINARY_SUB: op = '-'; break;
8341 warningf(&expr->base.source_position,
8342 "suggest parentheses around '%c' inside shift", op);
8345 static bool semantic_shift(binary_expression_t *expression)
8347 expression_t *const left = expression->left;
8348 expression_t *const right = expression->right;
8349 type_t *const orig_type_left = left->base.type;
8350 type_t *const orig_type_right = right->base.type;
8351 type_t * type_left = skip_typeref(orig_type_left);
8352 type_t * type_right = skip_typeref(orig_type_right);
8354 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8355 /* TODO: improve error message */
8356 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8357 errorf(&expression->base.source_position,
8358 "operands of shift operation must have integer types");
8363 type_left = promote_integer(type_left);
8365 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8366 long count = fold_constant_to_int(right);
8368 warningf(&right->base.source_position,
8369 "shift count must be non-negative");
8370 } else if ((unsigned long)count >=
8371 get_atomic_type_size(type_left->atomic.akind) * 8) {
8372 warningf(&right->base.source_position,
8373 "shift count must be less than type width");
8377 type_right = promote_integer(type_right);
8378 expression->right = create_implicit_cast(right, type_right);
8383 static void semantic_shift_op(binary_expression_t *expression)
8385 expression_t *const left = expression->left;
8386 expression_t *const right = expression->right;
8388 if (!semantic_shift(expression))
8391 if (warning.parentheses) {
8392 warn_addsub_in_shift(left);
8393 warn_addsub_in_shift(right);
8396 type_t *const orig_type_left = left->base.type;
8397 type_t * type_left = skip_typeref(orig_type_left);
8399 type_left = promote_integer(type_left);
8400 expression->left = create_implicit_cast(left, type_left);
8401 expression->base.type = type_left;
8404 static void semantic_add(binary_expression_t *expression)
8406 expression_t *const left = expression->left;
8407 expression_t *const right = expression->right;
8408 type_t *const orig_type_left = left->base.type;
8409 type_t *const orig_type_right = right->base.type;
8410 type_t *const type_left = skip_typeref(orig_type_left);
8411 type_t *const type_right = skip_typeref(orig_type_right);
8414 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8415 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8416 expression->left = create_implicit_cast(left, arithmetic_type);
8417 expression->right = create_implicit_cast(right, arithmetic_type);
8418 expression->base.type = arithmetic_type;
8419 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8420 check_pointer_arithmetic(&expression->base.source_position,
8421 type_left, orig_type_left);
8422 expression->base.type = type_left;
8423 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8424 check_pointer_arithmetic(&expression->base.source_position,
8425 type_right, orig_type_right);
8426 expression->base.type = type_right;
8427 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8428 errorf(&expression->base.source_position,
8429 "invalid operands to binary + ('%T', '%T')",
8430 orig_type_left, orig_type_right);
8434 static void semantic_sub(binary_expression_t *expression)
8436 expression_t *const left = expression->left;
8437 expression_t *const right = expression->right;
8438 type_t *const orig_type_left = left->base.type;
8439 type_t *const orig_type_right = right->base.type;
8440 type_t *const type_left = skip_typeref(orig_type_left);
8441 type_t *const type_right = skip_typeref(orig_type_right);
8442 source_position_t const *const pos = &expression->base.source_position;
8445 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8446 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8447 expression->left = create_implicit_cast(left, arithmetic_type);
8448 expression->right = create_implicit_cast(right, arithmetic_type);
8449 expression->base.type = arithmetic_type;
8450 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8451 check_pointer_arithmetic(&expression->base.source_position,
8452 type_left, orig_type_left);
8453 expression->base.type = type_left;
8454 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8455 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8456 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8457 if (!types_compatible(unqual_left, unqual_right)) {
8459 "subtracting pointers to incompatible types '%T' and '%T'",
8460 orig_type_left, orig_type_right);
8461 } else if (!is_type_object(unqual_left)) {
8462 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8463 errorf(pos, "subtracting pointers to non-object types '%T'",
8465 } else if (warning.other) {
8466 warningf(pos, "subtracting pointers to void");
8469 expression->base.type = type_ptrdiff_t;
8470 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8471 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8472 orig_type_left, orig_type_right);
8476 static void warn_string_literal_address(expression_t const* expr)
8478 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8479 expr = expr->unary.value;
8480 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8482 expr = expr->unary.value;
8485 if (expr->kind == EXPR_STRING_LITERAL
8486 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8487 warningf(&expr->base.source_position,
8488 "comparison with string literal results in unspecified behaviour");
8492 static void warn_comparison_in_comparison(const expression_t *const expr)
8494 if (expr->base.parenthesized)
8496 switch (expr->base.kind) {
8497 case EXPR_BINARY_LESS:
8498 case EXPR_BINARY_GREATER:
8499 case EXPR_BINARY_LESSEQUAL:
8500 case EXPR_BINARY_GREATEREQUAL:
8501 case EXPR_BINARY_NOTEQUAL:
8502 case EXPR_BINARY_EQUAL:
8503 warningf(&expr->base.source_position,
8504 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8511 static bool maybe_negative(expression_t const *const expr)
8513 switch (is_constant_expression(expr)) {
8514 case EXPR_CLASS_ERROR: return false;
8515 case EXPR_CLASS_CONSTANT: return fold_constant_to_int(expr) < 0;
8516 default: return true;
8521 * Check the semantics of comparison expressions.
8523 * @param expression The expression to check.
8525 static void semantic_comparison(binary_expression_t *expression)
8527 expression_t *left = expression->left;
8528 expression_t *right = expression->right;
8530 if (warning.address) {
8531 warn_string_literal_address(left);
8532 warn_string_literal_address(right);
8534 expression_t const* const func_left = get_reference_address(left);
8535 if (func_left != NULL && is_null_pointer_constant(right)) {
8536 warningf(&expression->base.source_position,
8537 "the address of '%Y' will never be NULL",
8538 func_left->reference.entity->base.symbol);
8541 expression_t const* const func_right = get_reference_address(right);
8542 if (func_right != NULL && is_null_pointer_constant(right)) {
8543 warningf(&expression->base.source_position,
8544 "the address of '%Y' will never be NULL",
8545 func_right->reference.entity->base.symbol);
8549 if (warning.parentheses) {
8550 warn_comparison_in_comparison(left);
8551 warn_comparison_in_comparison(right);
8554 type_t *orig_type_left = left->base.type;
8555 type_t *orig_type_right = right->base.type;
8556 type_t *type_left = skip_typeref(orig_type_left);
8557 type_t *type_right = skip_typeref(orig_type_right);
8559 /* TODO non-arithmetic types */
8560 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8561 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8563 /* test for signed vs unsigned compares */
8564 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8565 bool const signed_left = is_type_signed(type_left);
8566 bool const signed_right = is_type_signed(type_right);
8567 if (signed_left != signed_right) {
8568 /* FIXME long long needs better const folding magic */
8569 /* TODO check whether constant value can be represented by other type */
8570 if ((signed_left && maybe_negative(left)) ||
8571 (signed_right && maybe_negative(right))) {
8572 warningf(&expression->base.source_position,
8573 "comparison between signed and unsigned");
8578 expression->left = create_implicit_cast(left, arithmetic_type);
8579 expression->right = create_implicit_cast(right, arithmetic_type);
8580 expression->base.type = arithmetic_type;
8581 if (warning.float_equal &&
8582 (expression->base.kind == EXPR_BINARY_EQUAL ||
8583 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8584 is_type_float(arithmetic_type)) {
8585 warningf(&expression->base.source_position,
8586 "comparing floating point with == or != is unsafe");
8588 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8589 /* TODO check compatibility */
8590 } else if (is_type_pointer(type_left)) {
8591 expression->right = create_implicit_cast(right, type_left);
8592 } else if (is_type_pointer(type_right)) {
8593 expression->left = create_implicit_cast(left, type_right);
8594 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8595 type_error_incompatible("invalid operands in comparison",
8596 &expression->base.source_position,
8597 type_left, type_right);
8599 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8603 * Checks if a compound type has constant fields.
8605 static bool has_const_fields(const compound_type_t *type)
8607 compound_t *compound = type->compound;
8608 entity_t *entry = compound->members.entities;
8610 for (; entry != NULL; entry = entry->base.next) {
8611 if (!is_declaration(entry))
8614 const type_t *decl_type = skip_typeref(entry->declaration.type);
8615 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8622 static bool is_valid_assignment_lhs(expression_t const* const left)
8624 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8625 type_t *const type_left = skip_typeref(orig_type_left);
8627 if (!is_lvalue(left)) {
8628 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8633 if (left->kind == EXPR_REFERENCE
8634 && left->reference.entity->kind == ENTITY_FUNCTION) {
8635 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8639 if (is_type_array(type_left)) {
8640 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8643 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8644 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8648 if (is_type_incomplete(type_left)) {
8649 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8650 left, orig_type_left);
8653 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8654 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8655 left, orig_type_left);
8662 static void semantic_arithmetic_assign(binary_expression_t *expression)
8664 expression_t *left = expression->left;
8665 expression_t *right = expression->right;
8666 type_t *orig_type_left = left->base.type;
8667 type_t *orig_type_right = right->base.type;
8669 if (!is_valid_assignment_lhs(left))
8672 type_t *type_left = skip_typeref(orig_type_left);
8673 type_t *type_right = skip_typeref(orig_type_right);
8675 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8676 /* TODO: improve error message */
8677 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8678 errorf(&expression->base.source_position,
8679 "operation needs arithmetic types");
8684 /* combined instructions are tricky. We can't create an implicit cast on
8685 * the left side, because we need the uncasted form for the store.
8686 * The ast2firm pass has to know that left_type must be right_type
8687 * for the arithmetic operation and create a cast by itself */
8688 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8689 expression->right = create_implicit_cast(right, arithmetic_type);
8690 expression->base.type = type_left;
8693 static void semantic_divmod_assign(binary_expression_t *expression)
8695 semantic_arithmetic_assign(expression);
8696 warn_div_by_zero(expression);
8699 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8701 expression_t *const left = expression->left;
8702 expression_t *const right = expression->right;
8703 type_t *const orig_type_left = left->base.type;
8704 type_t *const orig_type_right = right->base.type;
8705 type_t *const type_left = skip_typeref(orig_type_left);
8706 type_t *const type_right = skip_typeref(orig_type_right);
8708 if (!is_valid_assignment_lhs(left))
8711 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8712 /* combined instructions are tricky. We can't create an implicit cast on
8713 * the left side, because we need the uncasted form for the store.
8714 * The ast2firm pass has to know that left_type must be right_type
8715 * for the arithmetic operation and create a cast by itself */
8716 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8717 expression->right = create_implicit_cast(right, arithmetic_type);
8718 expression->base.type = type_left;
8719 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8720 check_pointer_arithmetic(&expression->base.source_position,
8721 type_left, orig_type_left);
8722 expression->base.type = type_left;
8723 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8724 errorf(&expression->base.source_position,
8725 "incompatible types '%T' and '%T' in assignment",
8726 orig_type_left, orig_type_right);
8730 static void semantic_integer_assign(binary_expression_t *expression)
8732 expression_t *left = expression->left;
8733 expression_t *right = expression->right;
8734 type_t *orig_type_left = left->base.type;
8735 type_t *orig_type_right = right->base.type;
8737 if (!is_valid_assignment_lhs(left))
8740 type_t *type_left = skip_typeref(orig_type_left);
8741 type_t *type_right = skip_typeref(orig_type_right);
8743 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8744 /* TODO: improve error message */
8745 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8746 errorf(&expression->base.source_position,
8747 "operation needs integer types");
8752 /* combined instructions are tricky. We can't create an implicit cast on
8753 * the left side, because we need the uncasted form for the store.
8754 * The ast2firm pass has to know that left_type must be right_type
8755 * for the arithmetic operation and create a cast by itself */
8756 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8757 expression->right = create_implicit_cast(right, arithmetic_type);
8758 expression->base.type = type_left;
8761 static void semantic_shift_assign(binary_expression_t *expression)
8763 expression_t *left = expression->left;
8765 if (!is_valid_assignment_lhs(left))
8768 if (!semantic_shift(expression))
8771 expression->base.type = skip_typeref(left->base.type);
8774 static void warn_logical_and_within_or(const expression_t *const expr)
8776 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8778 if (expr->base.parenthesized)
8780 warningf(&expr->base.source_position,
8781 "suggest parentheses around && within ||");
8785 * Check the semantic restrictions of a logical expression.
8787 static void semantic_logical_op(binary_expression_t *expression)
8789 /* §6.5.13:2 Each of the operands shall have scalar type.
8790 * §6.5.14:2 Each of the operands shall have scalar type. */
8791 semantic_condition(expression->left, "left operand of logical operator");
8792 semantic_condition(expression->right, "right operand of logical operator");
8793 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8794 warning.parentheses) {
8795 warn_logical_and_within_or(expression->left);
8796 warn_logical_and_within_or(expression->right);
8798 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8802 * Check the semantic restrictions of a binary assign expression.
8804 static void semantic_binexpr_assign(binary_expression_t *expression)
8806 expression_t *left = expression->left;
8807 type_t *orig_type_left = left->base.type;
8809 if (!is_valid_assignment_lhs(left))
8812 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8813 report_assign_error(error, orig_type_left, expression->right,
8814 "assignment", &left->base.source_position);
8815 expression->right = create_implicit_cast(expression->right, orig_type_left);
8816 expression->base.type = orig_type_left;
8820 * Determine if the outermost operation (or parts thereof) of the given
8821 * expression has no effect in order to generate a warning about this fact.
8822 * Therefore in some cases this only examines some of the operands of the
8823 * expression (see comments in the function and examples below).
8825 * f() + 23; // warning, because + has no effect
8826 * x || f(); // no warning, because x controls execution of f()
8827 * x ? y : f(); // warning, because y has no effect
8828 * (void)x; // no warning to be able to suppress the warning
8829 * This function can NOT be used for an "expression has definitely no effect"-
8831 static bool expression_has_effect(const expression_t *const expr)
8833 switch (expr->kind) {
8834 case EXPR_UNKNOWN: break;
8835 case EXPR_INVALID: return true; /* do NOT warn */
8836 case EXPR_REFERENCE: return false;
8837 case EXPR_REFERENCE_ENUM_VALUE: return false;
8838 case EXPR_LABEL_ADDRESS: return false;
8840 /* suppress the warning for microsoft __noop operations */
8841 case EXPR_LITERAL_MS_NOOP: return true;
8842 case EXPR_LITERAL_BOOLEAN:
8843 case EXPR_LITERAL_CHARACTER:
8844 case EXPR_LITERAL_WIDE_CHARACTER:
8845 case EXPR_LITERAL_INTEGER:
8846 case EXPR_LITERAL_INTEGER_OCTAL:
8847 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8848 case EXPR_LITERAL_FLOATINGPOINT:
8849 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8850 case EXPR_STRING_LITERAL: return false;
8851 case EXPR_WIDE_STRING_LITERAL: return false;
8854 const call_expression_t *const call = &expr->call;
8855 if (call->function->kind != EXPR_REFERENCE)
8858 switch (call->function->reference.entity->function.btk) {
8859 /* FIXME: which builtins have no effect? */
8860 default: return true;
8864 /* Generate the warning if either the left or right hand side of a
8865 * conditional expression has no effect */
8866 case EXPR_CONDITIONAL: {
8867 conditional_expression_t const *const cond = &expr->conditional;
8868 expression_t const *const t = cond->true_expression;
8870 (t == NULL || expression_has_effect(t)) &&
8871 expression_has_effect(cond->false_expression);
8874 case EXPR_SELECT: return false;
8875 case EXPR_ARRAY_ACCESS: return false;
8876 case EXPR_SIZEOF: return false;
8877 case EXPR_CLASSIFY_TYPE: return false;
8878 case EXPR_ALIGNOF: return false;
8880 case EXPR_FUNCNAME: return false;
8881 case EXPR_BUILTIN_CONSTANT_P: return false;
8882 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8883 case EXPR_OFFSETOF: return false;
8884 case EXPR_VA_START: return true;
8885 case EXPR_VA_ARG: return true;
8886 case EXPR_VA_COPY: return true;
8887 case EXPR_STATEMENT: return true; // TODO
8888 case EXPR_COMPOUND_LITERAL: return false;
8890 case EXPR_UNARY_NEGATE: return false;
8891 case EXPR_UNARY_PLUS: return false;
8892 case EXPR_UNARY_BITWISE_NEGATE: return false;
8893 case EXPR_UNARY_NOT: return false;
8894 case EXPR_UNARY_DEREFERENCE: return false;
8895 case EXPR_UNARY_TAKE_ADDRESS: return false;
8896 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8897 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8898 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8899 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8901 /* Treat void casts as if they have an effect in order to being able to
8902 * suppress the warning */
8903 case EXPR_UNARY_CAST: {
8904 type_t *const type = skip_typeref(expr->base.type);
8905 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8908 case EXPR_UNARY_CAST_IMPLICIT: return true;
8909 case EXPR_UNARY_ASSUME: return true;
8910 case EXPR_UNARY_DELETE: return true;
8911 case EXPR_UNARY_DELETE_ARRAY: return true;
8912 case EXPR_UNARY_THROW: return true;
8914 case EXPR_BINARY_ADD: return false;
8915 case EXPR_BINARY_SUB: return false;
8916 case EXPR_BINARY_MUL: return false;
8917 case EXPR_BINARY_DIV: return false;
8918 case EXPR_BINARY_MOD: return false;
8919 case EXPR_BINARY_EQUAL: return false;
8920 case EXPR_BINARY_NOTEQUAL: return false;
8921 case EXPR_BINARY_LESS: return false;
8922 case EXPR_BINARY_LESSEQUAL: return false;
8923 case EXPR_BINARY_GREATER: return false;
8924 case EXPR_BINARY_GREATEREQUAL: return false;
8925 case EXPR_BINARY_BITWISE_AND: return false;
8926 case EXPR_BINARY_BITWISE_OR: return false;
8927 case EXPR_BINARY_BITWISE_XOR: return false;
8928 case EXPR_BINARY_SHIFTLEFT: return false;
8929 case EXPR_BINARY_SHIFTRIGHT: return false;
8930 case EXPR_BINARY_ASSIGN: return true;
8931 case EXPR_BINARY_MUL_ASSIGN: return true;
8932 case EXPR_BINARY_DIV_ASSIGN: return true;
8933 case EXPR_BINARY_MOD_ASSIGN: return true;
8934 case EXPR_BINARY_ADD_ASSIGN: return true;
8935 case EXPR_BINARY_SUB_ASSIGN: return true;
8936 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8937 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8938 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8939 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8940 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8942 /* Only examine the right hand side of && and ||, because the left hand
8943 * side already has the effect of controlling the execution of the right
8945 case EXPR_BINARY_LOGICAL_AND:
8946 case EXPR_BINARY_LOGICAL_OR:
8947 /* Only examine the right hand side of a comma expression, because the left
8948 * hand side has a separate warning */
8949 case EXPR_BINARY_COMMA:
8950 return expression_has_effect(expr->binary.right);
8952 case EXPR_BINARY_ISGREATER: return false;
8953 case EXPR_BINARY_ISGREATEREQUAL: return false;
8954 case EXPR_BINARY_ISLESS: return false;
8955 case EXPR_BINARY_ISLESSEQUAL: return false;
8956 case EXPR_BINARY_ISLESSGREATER: return false;
8957 case EXPR_BINARY_ISUNORDERED: return false;
8960 internal_errorf(HERE, "unexpected expression");
8963 static void semantic_comma(binary_expression_t *expression)
8965 if (warning.unused_value) {
8966 const expression_t *const left = expression->left;
8967 if (!expression_has_effect(left)) {
8968 warningf(&left->base.source_position,
8969 "left-hand operand of comma expression has no effect");
8972 expression->base.type = expression->right->base.type;
8976 * @param prec_r precedence of the right operand
8978 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8979 static expression_t *parse_##binexpression_type(expression_t *left) \
8981 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8982 binexpr->binary.left = left; \
8985 expression_t *right = parse_subexpression(prec_r); \
8987 binexpr->binary.right = right; \
8988 sfunc(&binexpr->binary); \
8993 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8994 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8995 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8996 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8997 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8998 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8999 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
9000 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
9001 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
9002 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
9003 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
9004 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
9005 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
9006 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
9007 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
9008 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
9009 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
9010 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
9011 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
9012 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9013 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9014 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9015 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9016 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9017 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9018 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9019 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9020 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9021 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9022 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9025 static expression_t *parse_subexpression(precedence_t precedence)
9027 if (token.type < 0) {
9028 return expected_expression_error();
9031 expression_parser_function_t *parser
9032 = &expression_parsers[token.type];
9033 source_position_t source_position = token.source_position;
9036 if (parser->parser != NULL) {
9037 left = parser->parser();
9039 left = parse_primary_expression();
9041 assert(left != NULL);
9042 left->base.source_position = source_position;
9045 if (token.type < 0) {
9046 return expected_expression_error();
9049 parser = &expression_parsers[token.type];
9050 if (parser->infix_parser == NULL)
9052 if (parser->infix_precedence < precedence)
9055 left = parser->infix_parser(left);
9057 assert(left != NULL);
9058 assert(left->kind != EXPR_UNKNOWN);
9059 left->base.source_position = source_position;
9066 * Parse an expression.
9068 static expression_t *parse_expression(void)
9070 return parse_subexpression(PREC_EXPRESSION);
9074 * Register a parser for a prefix-like operator.
9076 * @param parser the parser function
9077 * @param token_type the token type of the prefix token
9079 static void register_expression_parser(parse_expression_function parser,
9082 expression_parser_function_t *entry = &expression_parsers[token_type];
9084 if (entry->parser != NULL) {
9085 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9086 panic("trying to register multiple expression parsers for a token");
9088 entry->parser = parser;
9092 * Register a parser for an infix operator with given precedence.
9094 * @param parser the parser function
9095 * @param token_type the token type of the infix operator
9096 * @param precedence the precedence of the operator
9098 static void register_infix_parser(parse_expression_infix_function parser,
9099 int token_type, precedence_t precedence)
9101 expression_parser_function_t *entry = &expression_parsers[token_type];
9103 if (entry->infix_parser != NULL) {
9104 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9105 panic("trying to register multiple infix expression parsers for a "
9108 entry->infix_parser = parser;
9109 entry->infix_precedence = precedence;
9113 * Initialize the expression parsers.
9115 static void init_expression_parsers(void)
9117 memset(&expression_parsers, 0, sizeof(expression_parsers));
9119 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9120 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9121 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9122 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9123 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9124 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9125 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9126 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9127 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9128 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9129 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9130 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9131 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9132 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9133 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9134 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9135 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9136 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9137 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9138 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9139 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9140 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9141 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9142 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9143 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9144 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9145 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9146 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9147 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9148 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9149 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9150 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9151 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9152 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9153 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9154 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9155 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9157 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9158 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9159 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9160 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9161 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9162 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9163 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9164 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9165 register_expression_parser(parse_sizeof, T_sizeof);
9166 register_expression_parser(parse_alignof, T___alignof__);
9167 register_expression_parser(parse_extension, T___extension__);
9168 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9169 register_expression_parser(parse_delete, T_delete);
9170 register_expression_parser(parse_throw, T_throw);
9174 * Parse a asm statement arguments specification.
9176 static asm_argument_t *parse_asm_arguments(bool is_out)
9178 asm_argument_t *result = NULL;
9179 asm_argument_t **anchor = &result;
9181 while (token.type == T_STRING_LITERAL || token.type == '[') {
9182 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9183 memset(argument, 0, sizeof(argument[0]));
9186 if (token.type != T_IDENTIFIER) {
9187 parse_error_expected("while parsing asm argument",
9188 T_IDENTIFIER, NULL);
9191 argument->symbol = token.symbol;
9193 expect(']', end_error);
9196 argument->constraints = parse_string_literals();
9197 expect('(', end_error);
9198 add_anchor_token(')');
9199 expression_t *expression = parse_expression();
9200 rem_anchor_token(')');
9202 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9203 * change size or type representation (e.g. int -> long is ok, but
9204 * int -> float is not) */
9205 if (expression->kind == EXPR_UNARY_CAST) {
9206 type_t *const type = expression->base.type;
9207 type_kind_t const kind = type->kind;
9208 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9211 if (kind == TYPE_ATOMIC) {
9212 atomic_type_kind_t const akind = type->atomic.akind;
9213 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9214 size = get_atomic_type_size(akind);
9216 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9217 size = get_atomic_type_size(get_intptr_kind());
9221 expression_t *const value = expression->unary.value;
9222 type_t *const value_type = value->base.type;
9223 type_kind_t const value_kind = value_type->kind;
9225 unsigned value_flags;
9226 unsigned value_size;
9227 if (value_kind == TYPE_ATOMIC) {
9228 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9229 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9230 value_size = get_atomic_type_size(value_akind);
9231 } else if (value_kind == TYPE_POINTER) {
9232 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9233 value_size = get_atomic_type_size(get_intptr_kind());
9238 if (value_flags != flags || value_size != size)
9242 } while (expression->kind == EXPR_UNARY_CAST);
9246 if (!is_lvalue(expression)) {
9247 errorf(&expression->base.source_position,
9248 "asm output argument is not an lvalue");
9251 if (argument->constraints.begin[0] == '=')
9252 determine_lhs_ent(expression, NULL);
9254 mark_vars_read(expression, NULL);
9256 mark_vars_read(expression, NULL);
9258 argument->expression = expression;
9259 expect(')', end_error);
9261 set_address_taken(expression, true);
9264 anchor = &argument->next;
9276 * Parse a asm statement clobber specification.
9278 static asm_clobber_t *parse_asm_clobbers(void)
9280 asm_clobber_t *result = NULL;
9281 asm_clobber_t **anchor = &result;
9283 while (token.type == T_STRING_LITERAL) {
9284 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9285 clobber->clobber = parse_string_literals();
9288 anchor = &clobber->next;
9298 * Parse an asm statement.
9300 static statement_t *parse_asm_statement(void)
9302 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9303 asm_statement_t *asm_statement = &statement->asms;
9307 if (next_if(T_volatile))
9308 asm_statement->is_volatile = true;
9310 expect('(', end_error);
9311 add_anchor_token(')');
9312 if (token.type != T_STRING_LITERAL) {
9313 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9316 asm_statement->asm_text = parse_string_literals();
9318 add_anchor_token(':');
9319 if (!next_if(':')) {
9320 rem_anchor_token(':');
9324 asm_statement->outputs = parse_asm_arguments(true);
9325 if (!next_if(':')) {
9326 rem_anchor_token(':');
9330 asm_statement->inputs = parse_asm_arguments(false);
9331 if (!next_if(':')) {
9332 rem_anchor_token(':');
9335 rem_anchor_token(':');
9337 asm_statement->clobbers = parse_asm_clobbers();
9340 rem_anchor_token(')');
9341 expect(')', end_error);
9342 expect(';', end_error);
9344 if (asm_statement->outputs == NULL) {
9345 /* GCC: An 'asm' instruction without any output operands will be treated
9346 * identically to a volatile 'asm' instruction. */
9347 asm_statement->is_volatile = true;
9352 return create_invalid_statement();
9355 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9357 statement_t *inner_stmt;
9358 switch (token.type) {
9360 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9361 inner_stmt = create_invalid_statement();
9365 if (label->kind == STATEMENT_LABEL) {
9366 /* Eat an empty statement here, to avoid the warning about an empty
9367 * statement after a label. label:; is commonly used to have a label
9368 * before a closing brace. */
9369 inner_stmt = create_empty_statement();
9376 inner_stmt = parse_statement();
9377 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9378 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9379 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9387 * Parse a case statement.
9389 static statement_t *parse_case_statement(void)
9391 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9392 source_position_t *const pos = &statement->base.source_position;
9396 expression_t *const expression = parse_expression();
9397 statement->case_label.expression = expression;
9398 expression_classification_t const expr_class = is_constant_expression(expression);
9399 if (expr_class != EXPR_CLASS_CONSTANT) {
9400 if (expr_class != EXPR_CLASS_ERROR) {
9401 errorf(pos, "case label does not reduce to an integer constant");
9403 statement->case_label.is_bad = true;
9405 long const val = fold_constant_to_int(expression);
9406 statement->case_label.first_case = val;
9407 statement->case_label.last_case = val;
9411 if (next_if(T_DOTDOTDOT)) {
9412 expression_t *const end_range = parse_expression();
9413 statement->case_label.end_range = end_range;
9414 expression_classification_t const end_class = is_constant_expression(end_range);
9415 if (end_class != EXPR_CLASS_CONSTANT) {
9416 if (end_class != EXPR_CLASS_ERROR) {
9417 errorf(pos, "case range does not reduce to an integer constant");
9419 statement->case_label.is_bad = true;
9421 long const val = fold_constant_to_int(end_range);
9422 statement->case_label.last_case = val;
9424 if (warning.other && val < statement->case_label.first_case) {
9425 statement->case_label.is_empty_range = true;
9426 warningf(pos, "empty range specified");
9432 PUSH_PARENT(statement);
9434 expect(':', end_error);
9437 if (current_switch != NULL) {
9438 if (! statement->case_label.is_bad) {
9439 /* Check for duplicate case values */
9440 case_label_statement_t *c = &statement->case_label;
9441 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9442 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9445 if (c->last_case < l->first_case || c->first_case > l->last_case)
9448 errorf(pos, "duplicate case value (previously used %P)",
9449 &l->base.source_position);
9453 /* link all cases into the switch statement */
9454 if (current_switch->last_case == NULL) {
9455 current_switch->first_case = &statement->case_label;
9457 current_switch->last_case->next = &statement->case_label;
9459 current_switch->last_case = &statement->case_label;
9461 errorf(pos, "case label not within a switch statement");
9464 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9471 * Parse a default statement.
9473 static statement_t *parse_default_statement(void)
9475 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9479 PUSH_PARENT(statement);
9481 expect(':', end_error);
9484 if (current_switch != NULL) {
9485 const case_label_statement_t *def_label = current_switch->default_label;
9486 if (def_label != NULL) {
9487 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9488 &def_label->base.source_position);
9490 current_switch->default_label = &statement->case_label;
9492 /* link all cases into the switch statement */
9493 if (current_switch->last_case == NULL) {
9494 current_switch->first_case = &statement->case_label;
9496 current_switch->last_case->next = &statement->case_label;
9498 current_switch->last_case = &statement->case_label;
9501 errorf(&statement->base.source_position,
9502 "'default' label not within a switch statement");
9505 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9512 * Parse a label statement.
9514 static statement_t *parse_label_statement(void)
9516 assert(token.type == T_IDENTIFIER);
9517 symbol_t *symbol = token.symbol;
9518 label_t *label = get_label(symbol);
9520 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9521 statement->label.label = label;
9525 PUSH_PARENT(statement);
9527 /* if statement is already set then the label is defined twice,
9528 * otherwise it was just mentioned in a goto/local label declaration so far
9530 if (label->statement != NULL) {
9531 errorf(HERE, "duplicate label '%Y' (declared %P)",
9532 symbol, &label->base.source_position);
9534 label->base.source_position = token.source_position;
9535 label->statement = statement;
9540 statement->label.statement = parse_label_inner_statement(statement, "label");
9542 /* remember the labels in a list for later checking */
9543 *label_anchor = &statement->label;
9544 label_anchor = &statement->label.next;
9551 * Parse an if statement.
9553 static statement_t *parse_if(void)
9555 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9559 PUSH_PARENT(statement);
9561 add_anchor_token('{');
9563 expect('(', end_error);
9564 add_anchor_token(')');
9565 expression_t *const expr = parse_expression();
9566 statement->ifs.condition = expr;
9567 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9569 semantic_condition(expr, "condition of 'if'-statment");
9570 mark_vars_read(expr, NULL);
9571 rem_anchor_token(')');
9572 expect(')', end_error);
9575 rem_anchor_token('{');
9577 add_anchor_token(T_else);
9578 statement_t *const true_stmt = parse_statement();
9579 statement->ifs.true_statement = true_stmt;
9580 rem_anchor_token(T_else);
9582 if (next_if(T_else)) {
9583 statement->ifs.false_statement = parse_statement();
9584 } else if (warning.parentheses &&
9585 true_stmt->kind == STATEMENT_IF &&
9586 true_stmt->ifs.false_statement != NULL) {
9587 warningf(&true_stmt->base.source_position,
9588 "suggest explicit braces to avoid ambiguous 'else'");
9596 * Check that all enums are handled in a switch.
9598 * @param statement the switch statement to check
9600 static void check_enum_cases(const switch_statement_t *statement)
9602 const type_t *type = skip_typeref(statement->expression->base.type);
9603 if (! is_type_enum(type))
9605 const enum_type_t *enumt = &type->enumt;
9607 /* if we have a default, no warnings */
9608 if (statement->default_label != NULL)
9611 /* FIXME: calculation of value should be done while parsing */
9612 /* TODO: quadratic algorithm here. Change to an n log n one */
9613 long last_value = -1;
9614 const entity_t *entry = enumt->enume->base.next;
9615 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9616 entry = entry->base.next) {
9617 const expression_t *expression = entry->enum_value.value;
9618 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9620 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9621 if (l->expression == NULL)
9623 if (l->first_case <= value && value <= l->last_case) {
9629 warningf(&statement->base.source_position,
9630 "enumeration value '%Y' not handled in switch",
9631 entry->base.symbol);
9638 * Parse a switch statement.
9640 static statement_t *parse_switch(void)
9642 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9646 PUSH_PARENT(statement);
9648 expect('(', end_error);
9649 add_anchor_token(')');
9650 expression_t *const expr = parse_expression();
9651 mark_vars_read(expr, NULL);
9652 type_t * type = skip_typeref(expr->base.type);
9653 if (is_type_integer(type)) {
9654 type = promote_integer(type);
9655 if (warning.traditional) {
9656 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9657 warningf(&expr->base.source_position,
9658 "'%T' switch expression not converted to '%T' in ISO C",
9662 } else if (is_type_valid(type)) {
9663 errorf(&expr->base.source_position,
9664 "switch quantity is not an integer, but '%T'", type);
9665 type = type_error_type;
9667 statement->switchs.expression = create_implicit_cast(expr, type);
9668 expect(')', end_error);
9669 rem_anchor_token(')');
9671 switch_statement_t *rem = current_switch;
9672 current_switch = &statement->switchs;
9673 statement->switchs.body = parse_statement();
9674 current_switch = rem;
9676 if (warning.switch_default &&
9677 statement->switchs.default_label == NULL) {
9678 warningf(&statement->base.source_position, "switch has no default case");
9680 if (warning.switch_enum)
9681 check_enum_cases(&statement->switchs);
9687 return create_invalid_statement();
9690 static statement_t *parse_loop_body(statement_t *const loop)
9692 statement_t *const rem = current_loop;
9693 current_loop = loop;
9695 statement_t *const body = parse_statement();
9702 * Parse a while statement.
9704 static statement_t *parse_while(void)
9706 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9710 PUSH_PARENT(statement);
9712 expect('(', end_error);
9713 add_anchor_token(')');
9714 expression_t *const cond = parse_expression();
9715 statement->whiles.condition = cond;
9716 /* §6.8.5:2 The controlling expression of an iteration statement shall
9717 * have scalar type. */
9718 semantic_condition(cond, "condition of 'while'-statement");
9719 mark_vars_read(cond, NULL);
9720 rem_anchor_token(')');
9721 expect(')', end_error);
9723 statement->whiles.body = parse_loop_body(statement);
9729 return create_invalid_statement();
9733 * Parse a do statement.
9735 static statement_t *parse_do(void)
9737 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9741 PUSH_PARENT(statement);
9743 add_anchor_token(T_while);
9744 statement->do_while.body = parse_loop_body(statement);
9745 rem_anchor_token(T_while);
9747 expect(T_while, end_error);
9748 expect('(', end_error);
9749 add_anchor_token(')');
9750 expression_t *const cond = parse_expression();
9751 statement->do_while.condition = cond;
9752 /* §6.8.5:2 The controlling expression of an iteration statement shall
9753 * have scalar type. */
9754 semantic_condition(cond, "condition of 'do-while'-statement");
9755 mark_vars_read(cond, NULL);
9756 rem_anchor_token(')');
9757 expect(')', end_error);
9758 expect(';', end_error);
9764 return create_invalid_statement();
9768 * Parse a for statement.
9770 static statement_t *parse_for(void)
9772 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9776 expect('(', end_error1);
9777 add_anchor_token(')');
9779 PUSH_PARENT(statement);
9781 size_t const top = environment_top();
9782 scope_t *old_scope = scope_push(&statement->fors.scope);
9784 bool old_gcc_extension = in_gcc_extension;
9785 while (next_if(T___extension__)) {
9786 in_gcc_extension = true;
9790 } else if (is_declaration_specifier(&token, false)) {
9791 parse_declaration(record_entity, DECL_FLAGS_NONE);
9793 add_anchor_token(';');
9794 expression_t *const init = parse_expression();
9795 statement->fors.initialisation = init;
9796 mark_vars_read(init, ENT_ANY);
9797 if (warning.unused_value && !expression_has_effect(init)) {
9798 warningf(&init->base.source_position,
9799 "initialisation of 'for'-statement has no effect");
9801 rem_anchor_token(';');
9802 expect(';', end_error2);
9804 in_gcc_extension = old_gcc_extension;
9806 if (token.type != ';') {
9807 add_anchor_token(';');
9808 expression_t *const cond = parse_expression();
9809 statement->fors.condition = cond;
9810 /* §6.8.5:2 The controlling expression of an iteration statement
9811 * shall have scalar type. */
9812 semantic_condition(cond, "condition of 'for'-statement");
9813 mark_vars_read(cond, NULL);
9814 rem_anchor_token(';');
9816 expect(';', end_error2);
9817 if (token.type != ')') {
9818 expression_t *const step = parse_expression();
9819 statement->fors.step = step;
9820 mark_vars_read(step, ENT_ANY);
9821 if (warning.unused_value && !expression_has_effect(step)) {
9822 warningf(&step->base.source_position,
9823 "step of 'for'-statement has no effect");
9826 expect(')', end_error2);
9827 rem_anchor_token(')');
9828 statement->fors.body = parse_loop_body(statement);
9830 assert(current_scope == &statement->fors.scope);
9831 scope_pop(old_scope);
9832 environment_pop_to(top);
9839 rem_anchor_token(')');
9840 assert(current_scope == &statement->fors.scope);
9841 scope_pop(old_scope);
9842 environment_pop_to(top);
9846 return create_invalid_statement();
9850 * Parse a goto statement.
9852 static statement_t *parse_goto(void)
9854 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9857 if (GNU_MODE && next_if('*')) {
9858 expression_t *expression = parse_expression();
9859 mark_vars_read(expression, NULL);
9861 /* Argh: although documentation says the expression must be of type void*,
9862 * gcc accepts anything that can be casted into void* without error */
9863 type_t *type = expression->base.type;
9865 if (type != type_error_type) {
9866 if (!is_type_pointer(type) && !is_type_integer(type)) {
9867 errorf(&expression->base.source_position,
9868 "cannot convert to a pointer type");
9869 } else if (warning.other && type != type_void_ptr) {
9870 warningf(&expression->base.source_position,
9871 "type of computed goto expression should be 'void*' not '%T'", type);
9873 expression = create_implicit_cast(expression, type_void_ptr);
9876 statement->gotos.expression = expression;
9877 } else if (token.type == T_IDENTIFIER) {
9878 symbol_t *symbol = token.symbol;
9880 statement->gotos.label = get_label(symbol);
9883 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9885 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9887 return create_invalid_statement();
9890 /* remember the goto's in a list for later checking */
9891 *goto_anchor = &statement->gotos;
9892 goto_anchor = &statement->gotos.next;
9894 expect(';', end_error);
9901 * Parse a continue statement.
9903 static statement_t *parse_continue(void)
9905 if (current_loop == NULL) {
9906 errorf(HERE, "continue statement not within loop");
9909 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9912 expect(';', end_error);
9919 * Parse a break statement.
9921 static statement_t *parse_break(void)
9923 if (current_switch == NULL && current_loop == NULL) {
9924 errorf(HERE, "break statement not within loop or switch");
9927 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9930 expect(';', end_error);
9937 * Parse a __leave statement.
9939 static statement_t *parse_leave_statement(void)
9941 if (current_try == NULL) {
9942 errorf(HERE, "__leave statement not within __try");
9945 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9948 expect(';', end_error);
9955 * Check if a given entity represents a local variable.
9957 static bool is_local_variable(const entity_t *entity)
9959 if (entity->kind != ENTITY_VARIABLE)
9962 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9963 case STORAGE_CLASS_AUTO:
9964 case STORAGE_CLASS_REGISTER: {
9965 const type_t *type = skip_typeref(entity->declaration.type);
9966 if (is_type_function(type)) {
9978 * Check if a given expression represents a local variable.
9980 static bool expression_is_local_variable(const expression_t *expression)
9982 if (expression->base.kind != EXPR_REFERENCE) {
9985 const entity_t *entity = expression->reference.entity;
9986 return is_local_variable(entity);
9990 * Check if a given expression represents a local variable and
9991 * return its declaration then, else return NULL.
9993 entity_t *expression_is_variable(const expression_t *expression)
9995 if (expression->base.kind != EXPR_REFERENCE) {
9998 entity_t *entity = expression->reference.entity;
9999 if (entity->kind != ENTITY_VARIABLE)
10006 * Parse a return statement.
10008 static statement_t *parse_return(void)
10012 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10014 expression_t *return_value = NULL;
10015 if (token.type != ';') {
10016 return_value = parse_expression();
10017 mark_vars_read(return_value, NULL);
10020 const type_t *const func_type = skip_typeref(current_function->base.type);
10021 assert(is_type_function(func_type));
10022 type_t *const return_type = skip_typeref(func_type->function.return_type);
10024 source_position_t const *const pos = &statement->base.source_position;
10025 if (return_value != NULL) {
10026 type_t *return_value_type = skip_typeref(return_value->base.type);
10028 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10029 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10030 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10031 /* Only warn in C mode, because GCC does the same */
10032 if (c_mode & _CXX || strict_mode) {
10034 "'return' with a value, in function returning 'void'");
10035 } else if (warning.other) {
10037 "'return' with a value, in function returning 'void'");
10039 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10040 /* Only warn in C mode, because GCC does the same */
10043 "'return' with expression in function returning 'void'");
10044 } else if (warning.other) {
10046 "'return' with expression in function returning 'void'");
10050 assign_error_t error = semantic_assign(return_type, return_value);
10051 report_assign_error(error, return_type, return_value, "'return'",
10054 return_value = create_implicit_cast(return_value, return_type);
10055 /* check for returning address of a local var */
10056 if (warning.other && return_value != NULL
10057 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10058 const expression_t *expression = return_value->unary.value;
10059 if (expression_is_local_variable(expression)) {
10060 warningf(pos, "function returns address of local variable");
10063 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10064 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10065 if (c_mode & _CXX || strict_mode) {
10067 "'return' without value, in function returning non-void");
10070 "'return' without value, in function returning non-void");
10073 statement->returns.value = return_value;
10075 expect(';', end_error);
10082 * Parse a declaration statement.
10084 static statement_t *parse_declaration_statement(void)
10086 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10088 entity_t *before = current_scope->last_entity;
10090 parse_external_declaration();
10092 parse_declaration(record_entity, DECL_FLAGS_NONE);
10095 declaration_statement_t *const decl = &statement->declaration;
10096 entity_t *const begin =
10097 before != NULL ? before->base.next : current_scope->entities;
10098 decl->declarations_begin = begin;
10099 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10105 * Parse an expression statement, ie. expr ';'.
10107 static statement_t *parse_expression_statement(void)
10109 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10111 expression_t *const expr = parse_expression();
10112 statement->expression.expression = expr;
10113 mark_vars_read(expr, ENT_ANY);
10115 expect(';', end_error);
10122 * Parse a microsoft __try { } __finally { } or
10123 * __try{ } __except() { }
10125 static statement_t *parse_ms_try_statment(void)
10127 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10130 PUSH_PARENT(statement);
10132 ms_try_statement_t *rem = current_try;
10133 current_try = &statement->ms_try;
10134 statement->ms_try.try_statement = parse_compound_statement(false);
10139 if (next_if(T___except)) {
10140 expect('(', end_error);
10141 add_anchor_token(')');
10142 expression_t *const expr = parse_expression();
10143 mark_vars_read(expr, NULL);
10144 type_t * type = skip_typeref(expr->base.type);
10145 if (is_type_integer(type)) {
10146 type = promote_integer(type);
10147 } else if (is_type_valid(type)) {
10148 errorf(&expr->base.source_position,
10149 "__expect expression is not an integer, but '%T'", type);
10150 type = type_error_type;
10152 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10153 rem_anchor_token(')');
10154 expect(')', end_error);
10155 statement->ms_try.final_statement = parse_compound_statement(false);
10156 } else if (next_if(T__finally)) {
10157 statement->ms_try.final_statement = parse_compound_statement(false);
10159 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10160 return create_invalid_statement();
10164 return create_invalid_statement();
10167 static statement_t *parse_empty_statement(void)
10169 if (warning.empty_statement) {
10170 warningf(HERE, "statement is empty");
10172 statement_t *const statement = create_empty_statement();
10177 static statement_t *parse_local_label_declaration(void)
10179 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10183 entity_t *begin = NULL;
10184 entity_t *end = NULL;
10185 entity_t **anchor = &begin;
10187 if (token.type != T_IDENTIFIER) {
10188 parse_error_expected("while parsing local label declaration",
10189 T_IDENTIFIER, NULL);
10192 symbol_t *symbol = token.symbol;
10193 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10194 if (entity != NULL && entity->base.parent_scope == current_scope) {
10195 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10196 symbol, &entity->base.source_position);
10198 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10200 entity->base.parent_scope = current_scope;
10201 entity->base.namespc = NAMESPACE_LABEL;
10202 entity->base.source_position = token.source_position;
10203 entity->base.symbol = symbol;
10206 anchor = &entity->base.next;
10209 environment_push(entity);
10212 } while (next_if(','));
10213 expect(';', end_error);
10215 statement->declaration.declarations_begin = begin;
10216 statement->declaration.declarations_end = end;
10220 static void parse_namespace_definition(void)
10224 entity_t *entity = NULL;
10225 symbol_t *symbol = NULL;
10227 if (token.type == T_IDENTIFIER) {
10228 symbol = token.symbol;
10231 entity = get_entity(symbol, NAMESPACE_NORMAL);
10233 && entity->kind != ENTITY_NAMESPACE
10234 && entity->base.parent_scope == current_scope) {
10235 if (is_entity_valid(entity)) {
10236 error_redefined_as_different_kind(&token.source_position,
10237 entity, ENTITY_NAMESPACE);
10243 if (entity == NULL) {
10244 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10245 entity->base.symbol = symbol;
10246 entity->base.source_position = token.source_position;
10247 entity->base.namespc = NAMESPACE_NORMAL;
10248 entity->base.parent_scope = current_scope;
10251 if (token.type == '=') {
10252 /* TODO: parse namespace alias */
10253 panic("namespace alias definition not supported yet");
10256 environment_push(entity);
10257 append_entity(current_scope, entity);
10259 size_t const top = environment_top();
10260 scope_t *old_scope = scope_push(&entity->namespacee.members);
10262 entity_t *old_current_entity = current_entity;
10263 current_entity = entity;
10265 expect('{', end_error);
10267 expect('}', end_error);
10270 assert(current_scope == &entity->namespacee.members);
10271 assert(current_entity == entity);
10272 current_entity = old_current_entity;
10273 scope_pop(old_scope);
10274 environment_pop_to(top);
10278 * Parse a statement.
10279 * There's also parse_statement() which additionally checks for
10280 * "statement has no effect" warnings
10282 static statement_t *intern_parse_statement(void)
10284 statement_t *statement = NULL;
10286 /* declaration or statement */
10287 add_anchor_token(';');
10288 switch (token.type) {
10289 case T_IDENTIFIER: {
10290 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10291 if (la1_type == ':') {
10292 statement = parse_label_statement();
10293 } else if (is_typedef_symbol(token.symbol)) {
10294 statement = parse_declaration_statement();
10296 /* it's an identifier, the grammar says this must be an
10297 * expression statement. However it is common that users mistype
10298 * declaration types, so we guess a bit here to improve robustness
10299 * for incorrect programs */
10300 switch (la1_type) {
10303 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10305 statement = parse_expression_statement();
10309 statement = parse_declaration_statement();
10317 case T___extension__:
10318 /* This can be a prefix to a declaration or an expression statement.
10319 * We simply eat it now and parse the rest with tail recursion. */
10320 while (next_if(T___extension__)) {}
10321 bool old_gcc_extension = in_gcc_extension;
10322 in_gcc_extension = true;
10323 statement = intern_parse_statement();
10324 in_gcc_extension = old_gcc_extension;
10328 statement = parse_declaration_statement();
10332 statement = parse_local_label_declaration();
10335 case ';': statement = parse_empty_statement(); break;
10336 case '{': statement = parse_compound_statement(false); break;
10337 case T___leave: statement = parse_leave_statement(); break;
10338 case T___try: statement = parse_ms_try_statment(); break;
10339 case T_asm: statement = parse_asm_statement(); break;
10340 case T_break: statement = parse_break(); break;
10341 case T_case: statement = parse_case_statement(); break;
10342 case T_continue: statement = parse_continue(); break;
10343 case T_default: statement = parse_default_statement(); break;
10344 case T_do: statement = parse_do(); break;
10345 case T_for: statement = parse_for(); break;
10346 case T_goto: statement = parse_goto(); break;
10347 case T_if: statement = parse_if(); break;
10348 case T_return: statement = parse_return(); break;
10349 case T_switch: statement = parse_switch(); break;
10350 case T_while: statement = parse_while(); break;
10353 statement = parse_expression_statement();
10357 errorf(HERE, "unexpected token %K while parsing statement", &token);
10358 statement = create_invalid_statement();
10363 rem_anchor_token(';');
10365 assert(statement != NULL
10366 && statement->base.source_position.input_name != NULL);
10372 * parse a statement and emits "statement has no effect" warning if needed
10373 * (This is really a wrapper around intern_parse_statement with check for 1
10374 * single warning. It is needed, because for statement expressions we have
10375 * to avoid the warning on the last statement)
10377 static statement_t *parse_statement(void)
10379 statement_t *statement = intern_parse_statement();
10381 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10382 expression_t *expression = statement->expression.expression;
10383 if (!expression_has_effect(expression)) {
10384 warningf(&expression->base.source_position,
10385 "statement has no effect");
10393 * Parse a compound statement.
10395 static statement_t *parse_compound_statement(bool inside_expression_statement)
10397 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10399 PUSH_PARENT(statement);
10402 add_anchor_token('}');
10403 /* tokens, which can start a statement */
10404 /* TODO MS, __builtin_FOO */
10405 add_anchor_token('!');
10406 add_anchor_token('&');
10407 add_anchor_token('(');
10408 add_anchor_token('*');
10409 add_anchor_token('+');
10410 add_anchor_token('-');
10411 add_anchor_token('{');
10412 add_anchor_token('~');
10413 add_anchor_token(T_CHARACTER_CONSTANT);
10414 add_anchor_token(T_COLONCOLON);
10415 add_anchor_token(T_FLOATINGPOINT);
10416 add_anchor_token(T_IDENTIFIER);
10417 add_anchor_token(T_INTEGER);
10418 add_anchor_token(T_MINUSMINUS);
10419 add_anchor_token(T_PLUSPLUS);
10420 add_anchor_token(T_STRING_LITERAL);
10421 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10422 add_anchor_token(T_WIDE_STRING_LITERAL);
10423 add_anchor_token(T__Bool);
10424 add_anchor_token(T__Complex);
10425 add_anchor_token(T__Imaginary);
10426 add_anchor_token(T___FUNCTION__);
10427 add_anchor_token(T___PRETTY_FUNCTION__);
10428 add_anchor_token(T___alignof__);
10429 add_anchor_token(T___attribute__);
10430 add_anchor_token(T___builtin_va_start);
10431 add_anchor_token(T___extension__);
10432 add_anchor_token(T___func__);
10433 add_anchor_token(T___imag__);
10434 add_anchor_token(T___label__);
10435 add_anchor_token(T___real__);
10436 add_anchor_token(T___thread);
10437 add_anchor_token(T_asm);
10438 add_anchor_token(T_auto);
10439 add_anchor_token(T_bool);
10440 add_anchor_token(T_break);
10441 add_anchor_token(T_case);
10442 add_anchor_token(T_char);
10443 add_anchor_token(T_class);
10444 add_anchor_token(T_const);
10445 add_anchor_token(T_const_cast);
10446 add_anchor_token(T_continue);
10447 add_anchor_token(T_default);
10448 add_anchor_token(T_delete);
10449 add_anchor_token(T_double);
10450 add_anchor_token(T_do);
10451 add_anchor_token(T_dynamic_cast);
10452 add_anchor_token(T_enum);
10453 add_anchor_token(T_extern);
10454 add_anchor_token(T_false);
10455 add_anchor_token(T_float);
10456 add_anchor_token(T_for);
10457 add_anchor_token(T_goto);
10458 add_anchor_token(T_if);
10459 add_anchor_token(T_inline);
10460 add_anchor_token(T_int);
10461 add_anchor_token(T_long);
10462 add_anchor_token(T_new);
10463 add_anchor_token(T_operator);
10464 add_anchor_token(T_register);
10465 add_anchor_token(T_reinterpret_cast);
10466 add_anchor_token(T_restrict);
10467 add_anchor_token(T_return);
10468 add_anchor_token(T_short);
10469 add_anchor_token(T_signed);
10470 add_anchor_token(T_sizeof);
10471 add_anchor_token(T_static);
10472 add_anchor_token(T_static_cast);
10473 add_anchor_token(T_struct);
10474 add_anchor_token(T_switch);
10475 add_anchor_token(T_template);
10476 add_anchor_token(T_this);
10477 add_anchor_token(T_throw);
10478 add_anchor_token(T_true);
10479 add_anchor_token(T_try);
10480 add_anchor_token(T_typedef);
10481 add_anchor_token(T_typeid);
10482 add_anchor_token(T_typename);
10483 add_anchor_token(T_typeof);
10484 add_anchor_token(T_union);
10485 add_anchor_token(T_unsigned);
10486 add_anchor_token(T_using);
10487 add_anchor_token(T_void);
10488 add_anchor_token(T_volatile);
10489 add_anchor_token(T_wchar_t);
10490 add_anchor_token(T_while);
10492 size_t const top = environment_top();
10493 scope_t *old_scope = scope_push(&statement->compound.scope);
10495 statement_t **anchor = &statement->compound.statements;
10496 bool only_decls_so_far = true;
10497 while (token.type != '}') {
10498 if (token.type == T_EOF) {
10499 errorf(&statement->base.source_position,
10500 "EOF while parsing compound statement");
10503 statement_t *sub_statement = intern_parse_statement();
10504 if (is_invalid_statement(sub_statement)) {
10505 /* an error occurred. if we are at an anchor, return */
10511 if (warning.declaration_after_statement) {
10512 if (sub_statement->kind != STATEMENT_DECLARATION) {
10513 only_decls_so_far = false;
10514 } else if (!only_decls_so_far) {
10515 warningf(&sub_statement->base.source_position,
10516 "ISO C90 forbids mixed declarations and code");
10520 *anchor = sub_statement;
10522 while (sub_statement->base.next != NULL)
10523 sub_statement = sub_statement->base.next;
10525 anchor = &sub_statement->base.next;
10529 /* look over all statements again to produce no effect warnings */
10530 if (warning.unused_value) {
10531 statement_t *sub_statement = statement->compound.statements;
10532 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10533 if (sub_statement->kind != STATEMENT_EXPRESSION)
10535 /* don't emit a warning for the last expression in an expression
10536 * statement as it has always an effect */
10537 if (inside_expression_statement && sub_statement->base.next == NULL)
10540 expression_t *expression = sub_statement->expression.expression;
10541 if (!expression_has_effect(expression)) {
10542 warningf(&expression->base.source_position,
10543 "statement has no effect");
10549 rem_anchor_token(T_while);
10550 rem_anchor_token(T_wchar_t);
10551 rem_anchor_token(T_volatile);
10552 rem_anchor_token(T_void);
10553 rem_anchor_token(T_using);
10554 rem_anchor_token(T_unsigned);
10555 rem_anchor_token(T_union);
10556 rem_anchor_token(T_typeof);
10557 rem_anchor_token(T_typename);
10558 rem_anchor_token(T_typeid);
10559 rem_anchor_token(T_typedef);
10560 rem_anchor_token(T_try);
10561 rem_anchor_token(T_true);
10562 rem_anchor_token(T_throw);
10563 rem_anchor_token(T_this);
10564 rem_anchor_token(T_template);
10565 rem_anchor_token(T_switch);
10566 rem_anchor_token(T_struct);
10567 rem_anchor_token(T_static_cast);
10568 rem_anchor_token(T_static);
10569 rem_anchor_token(T_sizeof);
10570 rem_anchor_token(T_signed);
10571 rem_anchor_token(T_short);
10572 rem_anchor_token(T_return);
10573 rem_anchor_token(T_restrict);
10574 rem_anchor_token(T_reinterpret_cast);
10575 rem_anchor_token(T_register);
10576 rem_anchor_token(T_operator);
10577 rem_anchor_token(T_new);
10578 rem_anchor_token(T_long);
10579 rem_anchor_token(T_int);
10580 rem_anchor_token(T_inline);
10581 rem_anchor_token(T_if);
10582 rem_anchor_token(T_goto);
10583 rem_anchor_token(T_for);
10584 rem_anchor_token(T_float);
10585 rem_anchor_token(T_false);
10586 rem_anchor_token(T_extern);
10587 rem_anchor_token(T_enum);
10588 rem_anchor_token(T_dynamic_cast);
10589 rem_anchor_token(T_do);
10590 rem_anchor_token(T_double);
10591 rem_anchor_token(T_delete);
10592 rem_anchor_token(T_default);
10593 rem_anchor_token(T_continue);
10594 rem_anchor_token(T_const_cast);
10595 rem_anchor_token(T_const);
10596 rem_anchor_token(T_class);
10597 rem_anchor_token(T_char);
10598 rem_anchor_token(T_case);
10599 rem_anchor_token(T_break);
10600 rem_anchor_token(T_bool);
10601 rem_anchor_token(T_auto);
10602 rem_anchor_token(T_asm);
10603 rem_anchor_token(T___thread);
10604 rem_anchor_token(T___real__);
10605 rem_anchor_token(T___label__);
10606 rem_anchor_token(T___imag__);
10607 rem_anchor_token(T___func__);
10608 rem_anchor_token(T___extension__);
10609 rem_anchor_token(T___builtin_va_start);
10610 rem_anchor_token(T___attribute__);
10611 rem_anchor_token(T___alignof__);
10612 rem_anchor_token(T___PRETTY_FUNCTION__);
10613 rem_anchor_token(T___FUNCTION__);
10614 rem_anchor_token(T__Imaginary);
10615 rem_anchor_token(T__Complex);
10616 rem_anchor_token(T__Bool);
10617 rem_anchor_token(T_WIDE_STRING_LITERAL);
10618 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10619 rem_anchor_token(T_STRING_LITERAL);
10620 rem_anchor_token(T_PLUSPLUS);
10621 rem_anchor_token(T_MINUSMINUS);
10622 rem_anchor_token(T_INTEGER);
10623 rem_anchor_token(T_IDENTIFIER);
10624 rem_anchor_token(T_FLOATINGPOINT);
10625 rem_anchor_token(T_COLONCOLON);
10626 rem_anchor_token(T_CHARACTER_CONSTANT);
10627 rem_anchor_token('~');
10628 rem_anchor_token('{');
10629 rem_anchor_token('-');
10630 rem_anchor_token('+');
10631 rem_anchor_token('*');
10632 rem_anchor_token('(');
10633 rem_anchor_token('&');
10634 rem_anchor_token('!');
10635 rem_anchor_token('}');
10636 assert(current_scope == &statement->compound.scope);
10637 scope_pop(old_scope);
10638 environment_pop_to(top);
10645 * Check for unused global static functions and variables
10647 static void check_unused_globals(void)
10649 if (!warning.unused_function && !warning.unused_variable)
10652 for (const entity_t *entity = file_scope->entities; entity != NULL;
10653 entity = entity->base.next) {
10654 if (!is_declaration(entity))
10657 const declaration_t *declaration = &entity->declaration;
10658 if (declaration->used ||
10659 declaration->modifiers & DM_UNUSED ||
10660 declaration->modifiers & DM_USED ||
10661 declaration->storage_class != STORAGE_CLASS_STATIC)
10664 type_t *const type = declaration->type;
10666 if (entity->kind == ENTITY_FUNCTION) {
10667 /* inhibit warning for static inline functions */
10668 if (entity->function.is_inline)
10671 s = entity->function.statement != NULL ? "defined" : "declared";
10676 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10677 type, declaration->base.symbol, s);
10681 static void parse_global_asm(void)
10683 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10686 expect('(', end_error);
10688 statement->asms.asm_text = parse_string_literals();
10689 statement->base.next = unit->global_asm;
10690 unit->global_asm = statement;
10692 expect(')', end_error);
10693 expect(';', end_error);
10698 static void parse_linkage_specification(void)
10702 const char *linkage = parse_string_literals().begin;
10704 linkage_kind_t old_linkage = current_linkage;
10705 linkage_kind_t new_linkage;
10706 if (strcmp(linkage, "C") == 0) {
10707 new_linkage = LINKAGE_C;
10708 } else if (strcmp(linkage, "C++") == 0) {
10709 new_linkage = LINKAGE_CXX;
10711 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10712 new_linkage = LINKAGE_INVALID;
10714 current_linkage = new_linkage;
10716 if (next_if('{')) {
10718 expect('}', end_error);
10724 assert(current_linkage == new_linkage);
10725 current_linkage = old_linkage;
10728 static void parse_external(void)
10730 switch (token.type) {
10731 DECLARATION_START_NO_EXTERN
10733 case T___extension__:
10734 /* tokens below are for implicit int */
10735 case '&': /* & x; -> int& x; (and error later, because C++ has no
10737 case '*': /* * x; -> int* x; */
10738 case '(': /* (x); -> int (x); */
10739 parse_external_declaration();
10743 if (look_ahead(1)->type == T_STRING_LITERAL) {
10744 parse_linkage_specification();
10746 parse_external_declaration();
10751 parse_global_asm();
10755 parse_namespace_definition();
10759 if (!strict_mode) {
10761 warningf(HERE, "stray ';' outside of function");
10768 errorf(HERE, "stray %K outside of function", &token);
10769 if (token.type == '(' || token.type == '{' || token.type == '[')
10770 eat_until_matching_token(token.type);
10776 static void parse_externals(void)
10778 add_anchor_token('}');
10779 add_anchor_token(T_EOF);
10782 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10783 unsigned char token_anchor_copy[T_LAST_TOKEN];
10784 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10787 while (token.type != T_EOF && token.type != '}') {
10789 bool anchor_leak = false;
10790 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10791 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10793 /* the anchor set and its copy differs */
10794 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10795 anchor_leak = true;
10798 if (in_gcc_extension) {
10799 /* an gcc extension scope was not closed */
10800 internal_errorf(HERE, "Leaked __extension__");
10801 anchor_leak = true;
10811 rem_anchor_token(T_EOF);
10812 rem_anchor_token('}');
10816 * Parse a translation unit.
10818 static void parse_translation_unit(void)
10820 add_anchor_token(T_EOF);
10825 if (token.type == T_EOF)
10828 errorf(HERE, "stray %K outside of function", &token);
10829 if (token.type == '(' || token.type == '{' || token.type == '[')
10830 eat_until_matching_token(token.type);
10835 void set_default_visibility(elf_visibility_tag_t visibility)
10837 default_visibility = visibility;
10843 * @return the translation unit or NULL if errors occurred.
10845 void start_parsing(void)
10847 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10848 label_stack = NEW_ARR_F(stack_entry_t, 0);
10849 diagnostic_count = 0;
10853 print_to_file(stderr);
10855 assert(unit == NULL);
10856 unit = allocate_ast_zero(sizeof(unit[0]));
10858 assert(file_scope == NULL);
10859 file_scope = &unit->scope;
10861 assert(current_scope == NULL);
10862 scope_push(&unit->scope);
10864 create_gnu_builtins();
10866 create_microsoft_intrinsics();
10869 translation_unit_t *finish_parsing(void)
10871 assert(current_scope == &unit->scope);
10874 assert(file_scope == &unit->scope);
10875 check_unused_globals();
10878 DEL_ARR_F(environment_stack);
10879 DEL_ARR_F(label_stack);
10881 translation_unit_t *result = unit;
10886 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10887 * are given length one. */
10888 static void complete_incomplete_arrays(void)
10890 size_t n = ARR_LEN(incomplete_arrays);
10891 for (size_t i = 0; i != n; ++i) {
10892 declaration_t *const decl = incomplete_arrays[i];
10893 type_t *const orig_type = decl->type;
10894 type_t *const type = skip_typeref(orig_type);
10896 if (!is_type_incomplete(type))
10899 if (warning.other) {
10900 warningf(&decl->base.source_position,
10901 "array '%#T' assumed to have one element",
10902 orig_type, decl->base.symbol);
10905 type_t *const new_type = duplicate_type(type);
10906 new_type->array.size_constant = true;
10907 new_type->array.has_implicit_size = true;
10908 new_type->array.size = 1;
10910 type_t *const result = identify_new_type(new_type);
10912 decl->type = result;
10916 void prepare_main_collect2(entity_t *entity)
10918 // create call to __main
10919 symbol_t *symbol = symbol_table_insert("__main");
10920 entity_t *subsubmain_ent
10921 = create_implicit_function(symbol, &builtin_source_position);
10923 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10924 type_t *ftype = subsubmain_ent->declaration.type;
10925 ref->base.source_position = builtin_source_position;
10926 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10927 ref->reference.entity = subsubmain_ent;
10929 expression_t *call = allocate_expression_zero(EXPR_CALL);
10930 call->base.source_position = builtin_source_position;
10931 call->base.type = type_void;
10932 call->call.function = ref;
10934 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10935 expr_statement->base.source_position = builtin_source_position;
10936 expr_statement->expression.expression = call;
10938 statement_t *statement = entity->function.statement;
10939 assert(statement->kind == STATEMENT_COMPOUND);
10940 compound_statement_t *compounds = &statement->compound;
10942 expr_statement->base.next = compounds->statements;
10943 compounds->statements = expr_statement;
10948 lookahead_bufpos = 0;
10949 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10952 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10953 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10954 parse_translation_unit();
10955 complete_incomplete_arrays();
10956 DEL_ARR_F(incomplete_arrays);
10957 incomplete_arrays = NULL;
10961 * Initialize the parser.
10963 void init_parser(void)
10965 sym_anonymous = symbol_table_insert("<anonymous>");
10967 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10969 init_expression_parsers();
10970 obstack_init(&temp_obst);
10974 * Terminate the parser.
10976 void exit_parser(void)
10978 obstack_free(&temp_obst, NULL);