2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "attribute_t.h"
38 #include "lang_features.h"
39 #include "walk_statements.h"
42 #include "adt/bitfiddle.h"
43 #include "adt/error.h"
44 #include "adt/array.h"
46 //#define PRINT_TOKENS
47 #define MAX_LOOKAHEAD 1
52 entity_namespace_t namespc;
55 typedef struct declaration_specifiers_t declaration_specifiers_t;
56 struct declaration_specifiers_t {
57 source_position_t source_position;
58 storage_class_t storage_class;
59 unsigned char alignment; /**< Alignment, 0 if not set. */
61 bool thread_local : 1; /**< GCC __thread */
62 attribute_t *attributes; /**< list of attributes */
67 * An environment for parsing initializers (and compound literals).
69 typedef struct parse_initializer_env_t {
70 type_t *type; /**< the type of the initializer. In case of an
71 array type with unspecified size this gets
72 adjusted to the actual size. */
73 entity_t *entity; /**< the variable that is initialized if any */
74 bool must_be_constant;
75 } parse_initializer_env_t;
77 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
79 /** The current token. */
81 /** The lookahead ring-buffer. */
82 static token_t lookahead_buffer[MAX_LOOKAHEAD];
83 /** Position of the next token in the lookahead buffer. */
84 static size_t lookahead_bufpos;
85 static stack_entry_t *environment_stack = NULL;
86 static stack_entry_t *label_stack = NULL;
87 static scope_t *file_scope = NULL;
88 static scope_t *current_scope = NULL;
89 /** Point to the current function declaration if inside a function. */
90 static function_t *current_function = NULL;
91 static entity_t *current_entity = NULL;
92 static entity_t *current_init_decl = NULL;
93 static switch_statement_t *current_switch = NULL;
94 static statement_t *current_loop = NULL;
95 static statement_t *current_parent = NULL;
96 static ms_try_statement_t *current_try = NULL;
97 static linkage_kind_t current_linkage = LINKAGE_INVALID;
98 static goto_statement_t *goto_first = NULL;
99 static goto_statement_t **goto_anchor = NULL;
100 static label_statement_t *label_first = NULL;
101 static label_statement_t **label_anchor = NULL;
102 /** current translation unit. */
103 static translation_unit_t *unit = NULL;
104 /** true if we are in a type property context (evaluation only for type) */
105 static bool in_type_prop = false;
106 /** true if we are in an __extension__ context. */
107 static bool in_gcc_extension = false;
108 static struct obstack temp_obst;
109 static entity_t *anonymous_entity;
110 static declaration_t **incomplete_arrays;
111 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
114 #define PUSH_PARENT(stmt) \
115 statement_t *const prev_parent = current_parent; \
116 ((void)(current_parent = (stmt)))
117 #define POP_PARENT ((void)(current_parent = prev_parent))
119 /** special symbol used for anonymous entities. */
120 static symbol_t *sym_anonymous = NULL;
122 /** The token anchor set */
123 static unsigned char token_anchor_set[T_LAST_TOKEN];
125 /** The current source position. */
126 #define HERE (&token.source_position)
128 /** true if we are in GCC mode. */
129 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
131 static statement_t *parse_compound_statement(bool inside_expression_statement);
132 static statement_t *parse_statement(void);
134 static expression_t *parse_subexpression(precedence_t);
135 static expression_t *parse_expression(void);
136 static type_t *parse_typename(void);
137 static void parse_externals(void);
138 static void parse_external(void);
140 static void parse_compound_type_entries(compound_t *compound_declaration);
142 static void check_call_argument(type_t *expected_type,
143 call_argument_t *argument, unsigned pos);
145 typedef enum declarator_flags_t {
147 DECL_MAY_BE_ABSTRACT = 1U << 0,
148 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
149 DECL_IS_PARAMETER = 1U << 2
150 } declarator_flags_t;
152 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
153 declarator_flags_t flags);
155 static void semantic_comparison(binary_expression_t *expression);
157 #define STORAGE_CLASSES \
158 STORAGE_CLASSES_NO_EXTERN \
161 #define STORAGE_CLASSES_NO_EXTERN \
168 #define TYPE_QUALIFIERS \
173 case T__forceinline: \
174 case T___attribute__:
176 #define COMPLEX_SPECIFIERS \
178 #define IMAGINARY_SPECIFIERS \
181 #define TYPE_SPECIFIERS \
183 case T___builtin_va_list: \
208 #define DECLARATION_START \
213 #define DECLARATION_START_NO_EXTERN \
214 STORAGE_CLASSES_NO_EXTERN \
218 #define TYPENAME_START \
222 #define EXPRESSION_START \
231 case T_CHARACTER_CONSTANT: \
232 case T_FLOATINGPOINT: \
233 case T_FLOATINGPOINT_HEXADECIMAL: \
235 case T_INTEGER_HEXADECIMAL: \
236 case T_INTEGER_OCTAL: \
239 case T_STRING_LITERAL: \
240 case T_WIDE_CHARACTER_CONSTANT: \
241 case T_WIDE_STRING_LITERAL: \
242 case T___FUNCDNAME__: \
243 case T___FUNCSIG__: \
244 case T___FUNCTION__: \
245 case T___PRETTY_FUNCTION__: \
246 case T___alignof__: \
247 case T___builtin_classify_type: \
248 case T___builtin_constant_p: \
249 case T___builtin_isgreater: \
250 case T___builtin_isgreaterequal: \
251 case T___builtin_isless: \
252 case T___builtin_islessequal: \
253 case T___builtin_islessgreater: \
254 case T___builtin_isunordered: \
255 case T___builtin_offsetof: \
256 case T___builtin_va_arg: \
257 case T___builtin_va_copy: \
258 case T___builtin_va_start: \
269 * Returns the size of a statement node.
271 * @param kind the statement kind
273 static size_t get_statement_struct_size(statement_kind_t kind)
275 static const size_t sizes[] = {
276 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
277 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
278 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
279 [STATEMENT_RETURN] = sizeof(return_statement_t),
280 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
281 [STATEMENT_IF] = sizeof(if_statement_t),
282 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
283 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
284 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
285 [STATEMENT_BREAK] = sizeof(statement_base_t),
286 [STATEMENT_GOTO] = sizeof(goto_statement_t),
287 [STATEMENT_LABEL] = sizeof(label_statement_t),
288 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
289 [STATEMENT_WHILE] = sizeof(while_statement_t),
290 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
291 [STATEMENT_FOR] = sizeof(for_statement_t),
292 [STATEMENT_ASM] = sizeof(asm_statement_t),
293 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
294 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
296 assert(kind < lengthof(sizes));
297 assert(sizes[kind] != 0);
302 * Returns the size of an expression node.
304 * @param kind the expression kind
306 static size_t get_expression_struct_size(expression_kind_t kind)
308 static const size_t sizes[] = {
309 [EXPR_INVALID] = sizeof(expression_base_t),
310 [EXPR_REFERENCE] = sizeof(reference_expression_t),
311 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
312 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
313 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
314 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
315 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
316 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
317 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
318 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
319 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
320 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
321 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
322 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
323 [EXPR_CALL] = sizeof(call_expression_t),
324 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
325 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
326 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
327 [EXPR_SELECT] = sizeof(select_expression_t),
328 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
329 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
330 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
331 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
332 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
333 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
334 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
335 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
336 [EXPR_VA_START] = sizeof(va_start_expression_t),
337 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
338 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
339 [EXPR_STATEMENT] = sizeof(statement_expression_t),
340 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
342 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
343 return sizes[EXPR_UNARY_FIRST];
345 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
346 return sizes[EXPR_BINARY_FIRST];
348 assert(kind < lengthof(sizes));
349 assert(sizes[kind] != 0);
354 * Allocate a statement node of given kind and initialize all
355 * fields with zero. Sets its source position to the position
356 * of the current token.
358 static statement_t *allocate_statement_zero(statement_kind_t kind)
360 size_t size = get_statement_struct_size(kind);
361 statement_t *res = allocate_ast_zero(size);
363 res->base.kind = kind;
364 res->base.parent = current_parent;
365 res->base.source_position = token.source_position;
370 * Allocate an expression node of given kind and initialize all
373 * @param kind the kind of the expression to allocate
375 static expression_t *allocate_expression_zero(expression_kind_t kind)
377 size_t size = get_expression_struct_size(kind);
378 expression_t *res = allocate_ast_zero(size);
380 res->base.kind = kind;
381 res->base.type = type_error_type;
382 res->base.source_position = token.source_position;
387 * Creates a new invalid expression at the source position
388 * of the current token.
390 static expression_t *create_invalid_expression(void)
392 return allocate_expression_zero(EXPR_INVALID);
396 * Creates a new invalid statement.
398 static statement_t *create_invalid_statement(void)
400 return allocate_statement_zero(STATEMENT_INVALID);
404 * Allocate a new empty statement.
406 static statement_t *create_empty_statement(void)
408 return allocate_statement_zero(STATEMENT_EMPTY);
411 static function_parameter_t *allocate_parameter(type_t *const type)
413 function_parameter_t *const param
414 = obstack_alloc(type_obst, sizeof(*param));
415 memset(param, 0, sizeof(*param));
421 * Returns the size of an initializer node.
423 * @param kind the initializer kind
425 static size_t get_initializer_size(initializer_kind_t kind)
427 static const size_t sizes[] = {
428 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
429 [INITIALIZER_STRING] = sizeof(initializer_string_t),
430 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
431 [INITIALIZER_LIST] = sizeof(initializer_list_t),
432 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
434 assert(kind < lengthof(sizes));
435 assert(sizes[kind] != 0);
440 * Allocate an initializer node of given kind and initialize all
443 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
445 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
452 * Returns the index of the top element of the environment stack.
454 static size_t environment_top(void)
456 return ARR_LEN(environment_stack);
460 * Returns the index of the top element of the global label stack.
462 static size_t label_top(void)
464 return ARR_LEN(label_stack);
468 * Return the next token.
470 static inline void next_token(void)
472 token = lookahead_buffer[lookahead_bufpos];
473 lookahead_buffer[lookahead_bufpos] = lexer_token;
476 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
479 print_token(stderr, &token);
480 fprintf(stderr, "\n");
484 static inline bool next_if(int const type)
486 if (token.type == type) {
495 * Return the next token with a given lookahead.
497 static inline const token_t *look_ahead(size_t num)
499 assert(0 < num && num <= MAX_LOOKAHEAD);
500 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
501 return &lookahead_buffer[pos];
505 * Adds a token type to the token type anchor set (a multi-set).
507 static void add_anchor_token(int token_type)
509 assert(0 <= token_type && token_type < T_LAST_TOKEN);
510 ++token_anchor_set[token_type];
514 * Set the number of tokens types of the given type
515 * to zero and return the old count.
517 static int save_and_reset_anchor_state(int token_type)
519 assert(0 <= token_type && token_type < T_LAST_TOKEN);
520 int count = token_anchor_set[token_type];
521 token_anchor_set[token_type] = 0;
526 * Restore the number of token types to the given count.
528 static void restore_anchor_state(int token_type, int count)
530 assert(0 <= token_type && token_type < T_LAST_TOKEN);
531 token_anchor_set[token_type] = count;
535 * Remove a token type from the token type anchor set (a multi-set).
537 static void rem_anchor_token(int token_type)
539 assert(0 <= token_type && token_type < T_LAST_TOKEN);
540 assert(token_anchor_set[token_type] != 0);
541 --token_anchor_set[token_type];
545 * Return true if the token type of the current token is
548 static bool at_anchor(void)
552 return token_anchor_set[token.type];
556 * Eat tokens until a matching token type is found.
558 static void eat_until_matching_token(int type)
562 case '(': end_token = ')'; break;
563 case '{': end_token = '}'; break;
564 case '[': end_token = ']'; break;
565 default: end_token = type; break;
568 unsigned parenthesis_count = 0;
569 unsigned brace_count = 0;
570 unsigned bracket_count = 0;
571 while (token.type != end_token ||
572 parenthesis_count != 0 ||
574 bracket_count != 0) {
575 switch (token.type) {
577 case '(': ++parenthesis_count; break;
578 case '{': ++brace_count; break;
579 case '[': ++bracket_count; break;
582 if (parenthesis_count > 0)
592 if (bracket_count > 0)
595 if (token.type == end_token &&
596 parenthesis_count == 0 &&
610 * Eat input tokens until an anchor is found.
612 static void eat_until_anchor(void)
614 while (token_anchor_set[token.type] == 0) {
615 if (token.type == '(' || token.type == '{' || token.type == '[')
616 eat_until_matching_token(token.type);
622 * Eat a whole block from input tokens.
624 static void eat_block(void)
626 eat_until_matching_token('{');
630 #define eat(token_type) (assert(token.type == (token_type)), next_token())
633 * Report a parse error because an expected token was not found.
636 #if defined __GNUC__ && __GNUC__ >= 4
637 __attribute__((sentinel))
639 void parse_error_expected(const char *message, ...)
641 if (message != NULL) {
642 errorf(HERE, "%s", message);
645 va_start(ap, message);
646 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
651 * Report an incompatible type.
653 static void type_error_incompatible(const char *msg,
654 const source_position_t *source_position, type_t *type1, type_t *type2)
656 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
661 * Expect the current token is the expected token.
662 * If not, generate an error, eat the current statement,
663 * and goto the error_label label.
665 #define expect(expected, error_label) \
667 if (UNLIKELY(token.type != (expected))) { \
668 parse_error_expected(NULL, (expected), NULL); \
669 add_anchor_token(expected); \
670 eat_until_anchor(); \
671 next_if((expected)); \
672 rem_anchor_token(expected); \
679 * Push a given scope on the scope stack and make it the
682 static scope_t *scope_push(scope_t *new_scope)
684 if (current_scope != NULL) {
685 new_scope->depth = current_scope->depth + 1;
688 scope_t *old_scope = current_scope;
689 current_scope = new_scope;
694 * Pop the current scope from the scope stack.
696 static void scope_pop(scope_t *old_scope)
698 current_scope = old_scope;
702 * Search an entity by its symbol in a given namespace.
704 static entity_t *get_entity(const symbol_t *const symbol,
705 namespace_tag_t namespc)
707 assert(namespc != NAMESPACE_INVALID);
708 entity_t *entity = symbol->entity;
709 for (; entity != NULL; entity = entity->base.symbol_next) {
710 if (entity->base.namespc == namespc)
717 /* §6.2.3:1 24) There is only one name space for tags even though three are
719 static entity_t *get_tag(symbol_t const *const symbol,
720 entity_kind_tag_t const kind)
722 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
723 if (entity != NULL && entity->kind != kind) {
725 "'%Y' defined as wrong kind of tag (previous definition %P)",
726 symbol, &entity->base.source_position);
733 * pushs an entity on the environment stack and links the corresponding symbol
736 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
738 symbol_t *symbol = entity->base.symbol;
739 entity_namespace_t namespc = entity->base.namespc;
740 assert(namespc != NAMESPACE_INVALID);
742 /* replace/add entity into entity list of the symbol */
745 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
750 /* replace an entry? */
751 if (iter->base.namespc == namespc) {
752 entity->base.symbol_next = iter->base.symbol_next;
758 /* remember old declaration */
760 entry.symbol = symbol;
761 entry.old_entity = iter;
762 entry.namespc = namespc;
763 ARR_APP1(stack_entry_t, *stack_ptr, entry);
767 * Push an entity on the environment stack.
769 static void environment_push(entity_t *entity)
771 assert(entity->base.source_position.input_name != NULL);
772 assert(entity->base.parent_scope != NULL);
773 stack_push(&environment_stack, entity);
777 * Push a declaration on the global label stack.
779 * @param declaration the declaration
781 static void label_push(entity_t *label)
783 /* we abuse the parameters scope as parent for the labels */
784 label->base.parent_scope = ¤t_function->parameters;
785 stack_push(&label_stack, label);
789 * pops symbols from the environment stack until @p new_top is the top element
791 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
793 stack_entry_t *stack = *stack_ptr;
794 size_t top = ARR_LEN(stack);
797 assert(new_top <= top);
801 for (i = top; i > new_top; --i) {
802 stack_entry_t *entry = &stack[i - 1];
804 entity_t *old_entity = entry->old_entity;
805 symbol_t *symbol = entry->symbol;
806 entity_namespace_t namespc = entry->namespc;
808 /* replace with old_entity/remove */
811 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
813 assert(iter != NULL);
814 /* replace an entry? */
815 if (iter->base.namespc == namespc)
819 /* restore definition from outer scopes (if there was one) */
820 if (old_entity != NULL) {
821 old_entity->base.symbol_next = iter->base.symbol_next;
822 *anchor = old_entity;
824 /* remove entry from list */
825 *anchor = iter->base.symbol_next;
829 ARR_SHRINKLEN(*stack_ptr, new_top);
833 * Pop all entries from the environment stack until the new_top
836 * @param new_top the new stack top
838 static void environment_pop_to(size_t new_top)
840 stack_pop_to(&environment_stack, new_top);
844 * Pop all entries from the global label stack until the new_top
847 * @param new_top the new stack top
849 static void label_pop_to(size_t new_top)
851 stack_pop_to(&label_stack, new_top);
854 static int get_akind_rank(atomic_type_kind_t akind)
860 * Return the type rank for an atomic type.
862 static int get_rank(const type_t *type)
864 assert(!is_typeref(type));
865 if (type->kind == TYPE_ENUM)
866 return get_akind_rank(type->enumt.akind);
868 assert(type->kind == TYPE_ATOMIC);
869 return get_akind_rank(type->atomic.akind);
873 * §6.3.1.1:2 Do integer promotion for a given type.
875 * @param type the type to promote
876 * @return the promoted type
878 static type_t *promote_integer(type_t *type)
880 if (type->kind == TYPE_BITFIELD)
881 type = type->bitfield.base_type;
883 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
890 * Create a cast expression.
892 * @param expression the expression to cast
893 * @param dest_type the destination type
895 static expression_t *create_cast_expression(expression_t *expression,
898 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
900 cast->unary.value = expression;
901 cast->base.type = dest_type;
907 * Check if a given expression represents a null pointer constant.
909 * @param expression the expression to check
911 static bool is_null_pointer_constant(const expression_t *expression)
913 /* skip void* cast */
914 if (expression->kind == EXPR_UNARY_CAST ||
915 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
916 type_t *const type = skip_typeref(expression->base.type);
917 if (types_compatible(type, type_void_ptr))
918 expression = expression->unary.value;
921 type_t *const type = skip_typeref(expression->base.type);
922 if (!is_type_integer(type))
924 switch (is_constant_expression(expression)) {
925 case EXPR_CLASS_ERROR: return true;
926 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
927 default: return false;
932 * Create an implicit cast expression.
934 * @param expression the expression to cast
935 * @param dest_type the destination type
937 static expression_t *create_implicit_cast(expression_t *expression,
940 type_t *const source_type = expression->base.type;
942 if (source_type == dest_type)
945 return create_cast_expression(expression, dest_type);
948 typedef enum assign_error_t {
950 ASSIGN_ERROR_INCOMPATIBLE,
951 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
952 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
953 ASSIGN_WARNING_POINTER_FROM_INT,
954 ASSIGN_WARNING_INT_FROM_POINTER
957 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
958 const expression_t *const right,
960 const source_position_t *source_position)
962 type_t *const orig_type_right = right->base.type;
963 type_t *const type_left = skip_typeref(orig_type_left);
964 type_t *const type_right = skip_typeref(orig_type_right);
969 case ASSIGN_ERROR_INCOMPATIBLE:
970 errorf(source_position,
971 "destination type '%T' in %s is incompatible with type '%T'",
972 orig_type_left, context, orig_type_right);
975 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
977 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
978 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
980 /* the left type has all qualifiers from the right type */
981 unsigned missing_qualifiers
982 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
983 warningf(source_position,
984 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
985 orig_type_left, context, orig_type_right, missing_qualifiers);
990 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
992 warningf(source_position,
993 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
994 orig_type_left, context, right, orig_type_right);
998 case ASSIGN_WARNING_POINTER_FROM_INT:
1000 warningf(source_position,
1001 "%s makes pointer '%T' from integer '%T' without a cast",
1002 context, orig_type_left, orig_type_right);
1006 case ASSIGN_WARNING_INT_FROM_POINTER:
1007 if (warning.other) {
1008 warningf(source_position,
1009 "%s makes integer '%T' from pointer '%T' without a cast",
1010 context, orig_type_left, orig_type_right);
1015 panic("invalid error value");
1019 /** Implements the rules from §6.5.16.1 */
1020 static assign_error_t semantic_assign(type_t *orig_type_left,
1021 const expression_t *const right)
1023 type_t *const orig_type_right = right->base.type;
1024 type_t *const type_left = skip_typeref(orig_type_left);
1025 type_t *const type_right = skip_typeref(orig_type_right);
1027 if (is_type_pointer(type_left)) {
1028 if (is_null_pointer_constant(right)) {
1029 return ASSIGN_SUCCESS;
1030 } else if (is_type_pointer(type_right)) {
1031 type_t *points_to_left
1032 = skip_typeref(type_left->pointer.points_to);
1033 type_t *points_to_right
1034 = skip_typeref(type_right->pointer.points_to);
1035 assign_error_t res = ASSIGN_SUCCESS;
1037 /* the left type has all qualifiers from the right type */
1038 unsigned missing_qualifiers
1039 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1040 if (missing_qualifiers != 0) {
1041 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1044 points_to_left = get_unqualified_type(points_to_left);
1045 points_to_right = get_unqualified_type(points_to_right);
1047 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1050 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1051 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1052 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1055 if (!types_compatible(points_to_left, points_to_right)) {
1056 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1060 } else if (is_type_integer(type_right)) {
1061 return ASSIGN_WARNING_POINTER_FROM_INT;
1063 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1064 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1065 && is_type_pointer(type_right))) {
1066 return ASSIGN_SUCCESS;
1067 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1068 type_t *const unqual_type_left = get_unqualified_type(type_left);
1069 type_t *const unqual_type_right = get_unqualified_type(type_right);
1070 if (types_compatible(unqual_type_left, unqual_type_right)) {
1071 return ASSIGN_SUCCESS;
1073 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1074 return ASSIGN_WARNING_INT_FROM_POINTER;
1077 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1078 return ASSIGN_SUCCESS;
1080 return ASSIGN_ERROR_INCOMPATIBLE;
1083 static expression_t *parse_constant_expression(void)
1085 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1087 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1088 errorf(&result->base.source_position,
1089 "expression '%E' is not constant", result);
1095 static expression_t *parse_assignment_expression(void)
1097 return parse_subexpression(PREC_ASSIGNMENT);
1100 static void warn_string_concat(const source_position_t *pos)
1102 if (warning.traditional) {
1103 warningf(pos, "traditional C rejects string constant concatenation");
1107 static string_t parse_string_literals(void)
1109 assert(token.type == T_STRING_LITERAL);
1110 string_t result = token.literal;
1114 while (token.type == T_STRING_LITERAL) {
1115 warn_string_concat(&token.source_position);
1116 result = concat_strings(&result, &token.literal);
1124 * compare two string, ignoring double underscores on the second.
1126 static int strcmp_underscore(const char *s1, const char *s2)
1128 if (s2[0] == '_' && s2[1] == '_') {
1129 size_t len2 = strlen(s2);
1130 size_t len1 = strlen(s1);
1131 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1132 return strncmp(s1, s2+2, len2-4);
1136 return strcmp(s1, s2);
1139 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1141 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1142 attribute->kind = kind;
1147 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1150 * __attribute__ ( ( attribute-list ) )
1154 * attribute_list , attrib
1159 * any-word ( identifier )
1160 * any-word ( identifier , nonempty-expr-list )
1161 * any-word ( expr-list )
1163 * where the "identifier" must not be declared as a type, and
1164 * "any-word" may be any identifier (including one declared as a
1165 * type), a reserved word storage class specifier, type specifier or
1166 * type qualifier. ??? This still leaves out most reserved keywords
1167 * (following the old parser), shouldn't we include them, and why not
1168 * allow identifiers declared as types to start the arguments?
1170 * Matze: this all looks confusing and little systematic, so we're even less
1171 * strict and parse any list of things which are identifiers or
1172 * (assignment-)expressions.
1174 static attribute_argument_t *parse_attribute_arguments(void)
1176 attribute_argument_t *first = NULL;
1177 attribute_argument_t **anchor = &first;
1178 if (token.type != ')') do {
1179 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1181 /* is it an identifier */
1182 if (token.type == T_IDENTIFIER
1183 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1184 symbol_t *symbol = token.symbol;
1185 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1186 argument->v.symbol = symbol;
1189 /* must be an expression */
1190 expression_t *expression = parse_assignment_expression();
1192 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1193 argument->v.expression = expression;
1196 /* append argument */
1198 anchor = &argument->next;
1199 } while (next_if(','));
1200 expect(')', end_error);
1209 static attribute_t *parse_attribute_asm(void)
1213 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1215 expect('(', end_error);
1216 attribute->a.arguments = parse_attribute_arguments();
1223 static symbol_t *get_symbol_from_token(void)
1225 switch(token.type) {
1227 return token.symbol;
1256 /* maybe we need more tokens ... add them on demand */
1257 return get_token_symbol(&token);
1263 static attribute_t *parse_attribute_gnu_single(void)
1265 /* parse "any-word" */
1266 symbol_t *symbol = get_symbol_from_token();
1267 if (symbol == NULL) {
1268 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1272 const char *name = symbol->string;
1275 attribute_kind_t kind;
1276 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1277 if (kind > ATTRIBUTE_GNU_LAST) {
1278 if (warning.attribute) {
1279 warningf(HERE, "unknown attribute '%s' ignored", name);
1281 /* TODO: we should still save the attribute in the list... */
1282 kind = ATTRIBUTE_UNKNOWN;
1286 const char *attribute_name = get_attribute_name(kind);
1287 if (attribute_name != NULL
1288 && strcmp_underscore(attribute_name, name) == 0)
1292 attribute_t *attribute = allocate_attribute_zero(kind);
1294 /* parse arguments */
1296 attribute->a.arguments = parse_attribute_arguments();
1301 static attribute_t *parse_attribute_gnu(void)
1303 attribute_t *first = NULL;
1304 attribute_t **anchor = &first;
1306 eat(T___attribute__);
1307 expect('(', end_error);
1308 expect('(', end_error);
1310 if (token.type != ')') do {
1311 attribute_t *attribute = parse_attribute_gnu_single();
1312 if (attribute == NULL)
1315 *anchor = attribute;
1316 anchor = &attribute->next;
1317 } while (next_if(','));
1318 expect(')', end_error);
1319 expect(')', end_error);
1325 /** Parse attributes. */
1326 static attribute_t *parse_attributes(attribute_t *first)
1328 attribute_t **anchor = &first;
1330 while (*anchor != NULL)
1331 anchor = &(*anchor)->next;
1333 attribute_t *attribute;
1334 switch (token.type) {
1335 case T___attribute__:
1336 attribute = parse_attribute_gnu();
1337 if (attribute == NULL)
1342 attribute = parse_attribute_asm();
1347 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1352 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1355 case T__forceinline:
1357 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1362 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1367 /* TODO record modifier */
1369 warningf(HERE, "Ignoring declaration modifier %K", &token);
1370 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1377 *anchor = attribute;
1378 anchor = &attribute->next;
1382 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1384 static entity_t *determine_lhs_ent(expression_t *const expr,
1387 switch (expr->kind) {
1388 case EXPR_REFERENCE: {
1389 entity_t *const entity = expr->reference.entity;
1390 /* we should only find variables as lvalues... */
1391 if (entity->base.kind != ENTITY_VARIABLE
1392 && entity->base.kind != ENTITY_PARAMETER)
1398 case EXPR_ARRAY_ACCESS: {
1399 expression_t *const ref = expr->array_access.array_ref;
1400 entity_t * ent = NULL;
1401 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1402 ent = determine_lhs_ent(ref, lhs_ent);
1405 mark_vars_read(expr->select.compound, lhs_ent);
1407 mark_vars_read(expr->array_access.index, lhs_ent);
1412 if (is_type_compound(skip_typeref(expr->base.type))) {
1413 return determine_lhs_ent(expr->select.compound, lhs_ent);
1415 mark_vars_read(expr->select.compound, lhs_ent);
1420 case EXPR_UNARY_DEREFERENCE: {
1421 expression_t *const val = expr->unary.value;
1422 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1424 return determine_lhs_ent(val->unary.value, lhs_ent);
1426 mark_vars_read(val, NULL);
1432 mark_vars_read(expr, NULL);
1437 #define ENT_ANY ((entity_t*)-1)
1440 * Mark declarations, which are read. This is used to detect variables, which
1444 * x is not marked as "read", because it is only read to calculate its own new
1448 * x and y are not detected as "not read", because multiple variables are
1451 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1453 switch (expr->kind) {
1454 case EXPR_REFERENCE: {
1455 entity_t *const entity = expr->reference.entity;
1456 if (entity->kind != ENTITY_VARIABLE
1457 && entity->kind != ENTITY_PARAMETER)
1460 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1461 if (entity->kind == ENTITY_VARIABLE) {
1462 entity->variable.read = true;
1464 entity->parameter.read = true;
1471 // TODO respect pure/const
1472 mark_vars_read(expr->call.function, NULL);
1473 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1474 mark_vars_read(arg->expression, NULL);
1478 case EXPR_CONDITIONAL:
1479 // TODO lhs_decl should depend on whether true/false have an effect
1480 mark_vars_read(expr->conditional.condition, NULL);
1481 if (expr->conditional.true_expression != NULL)
1482 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1483 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1487 if (lhs_ent == ENT_ANY
1488 && !is_type_compound(skip_typeref(expr->base.type)))
1490 mark_vars_read(expr->select.compound, lhs_ent);
1493 case EXPR_ARRAY_ACCESS: {
1494 expression_t *const ref = expr->array_access.array_ref;
1495 mark_vars_read(ref, lhs_ent);
1496 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1497 mark_vars_read(expr->array_access.index, lhs_ent);
1502 mark_vars_read(expr->va_arge.ap, lhs_ent);
1506 mark_vars_read(expr->va_copye.src, lhs_ent);
1509 case EXPR_UNARY_CAST:
1510 /* Special case: Use void cast to mark a variable as "read" */
1511 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1516 case EXPR_UNARY_THROW:
1517 if (expr->unary.value == NULL)
1520 case EXPR_UNARY_DEREFERENCE:
1521 case EXPR_UNARY_DELETE:
1522 case EXPR_UNARY_DELETE_ARRAY:
1523 if (lhs_ent == ENT_ANY)
1527 case EXPR_UNARY_NEGATE:
1528 case EXPR_UNARY_PLUS:
1529 case EXPR_UNARY_BITWISE_NEGATE:
1530 case EXPR_UNARY_NOT:
1531 case EXPR_UNARY_TAKE_ADDRESS:
1532 case EXPR_UNARY_POSTFIX_INCREMENT:
1533 case EXPR_UNARY_POSTFIX_DECREMENT:
1534 case EXPR_UNARY_PREFIX_INCREMENT:
1535 case EXPR_UNARY_PREFIX_DECREMENT:
1536 case EXPR_UNARY_CAST_IMPLICIT:
1537 case EXPR_UNARY_ASSUME:
1539 mark_vars_read(expr->unary.value, lhs_ent);
1542 case EXPR_BINARY_ADD:
1543 case EXPR_BINARY_SUB:
1544 case EXPR_BINARY_MUL:
1545 case EXPR_BINARY_DIV:
1546 case EXPR_BINARY_MOD:
1547 case EXPR_BINARY_EQUAL:
1548 case EXPR_BINARY_NOTEQUAL:
1549 case EXPR_BINARY_LESS:
1550 case EXPR_BINARY_LESSEQUAL:
1551 case EXPR_BINARY_GREATER:
1552 case EXPR_BINARY_GREATEREQUAL:
1553 case EXPR_BINARY_BITWISE_AND:
1554 case EXPR_BINARY_BITWISE_OR:
1555 case EXPR_BINARY_BITWISE_XOR:
1556 case EXPR_BINARY_LOGICAL_AND:
1557 case EXPR_BINARY_LOGICAL_OR:
1558 case EXPR_BINARY_SHIFTLEFT:
1559 case EXPR_BINARY_SHIFTRIGHT:
1560 case EXPR_BINARY_COMMA:
1561 case EXPR_BINARY_ISGREATER:
1562 case EXPR_BINARY_ISGREATEREQUAL:
1563 case EXPR_BINARY_ISLESS:
1564 case EXPR_BINARY_ISLESSEQUAL:
1565 case EXPR_BINARY_ISLESSGREATER:
1566 case EXPR_BINARY_ISUNORDERED:
1567 mark_vars_read(expr->binary.left, lhs_ent);
1568 mark_vars_read(expr->binary.right, lhs_ent);
1571 case EXPR_BINARY_ASSIGN:
1572 case EXPR_BINARY_MUL_ASSIGN:
1573 case EXPR_BINARY_DIV_ASSIGN:
1574 case EXPR_BINARY_MOD_ASSIGN:
1575 case EXPR_BINARY_ADD_ASSIGN:
1576 case EXPR_BINARY_SUB_ASSIGN:
1577 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1578 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1579 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1580 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1581 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1582 if (lhs_ent == ENT_ANY)
1584 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1585 mark_vars_read(expr->binary.right, lhs_ent);
1590 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1596 case EXPR_STRING_LITERAL:
1597 case EXPR_WIDE_STRING_LITERAL:
1598 case EXPR_COMPOUND_LITERAL: // TODO init?
1600 case EXPR_CLASSIFY_TYPE:
1603 case EXPR_BUILTIN_CONSTANT_P:
1604 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1606 case EXPR_STATEMENT: // TODO
1607 case EXPR_LABEL_ADDRESS:
1608 case EXPR_REFERENCE_ENUM_VALUE:
1612 panic("unhandled expression");
1615 static designator_t *parse_designation(void)
1617 designator_t *result = NULL;
1618 designator_t **anchor = &result;
1621 designator_t *designator;
1622 switch (token.type) {
1624 designator = allocate_ast_zero(sizeof(designator[0]));
1625 designator->source_position = token.source_position;
1627 add_anchor_token(']');
1628 designator->array_index = parse_constant_expression();
1629 rem_anchor_token(']');
1630 expect(']', end_error);
1633 designator = allocate_ast_zero(sizeof(designator[0]));
1634 designator->source_position = token.source_position;
1636 if (token.type != T_IDENTIFIER) {
1637 parse_error_expected("while parsing designator",
1638 T_IDENTIFIER, NULL);
1641 designator->symbol = token.symbol;
1645 expect('=', end_error);
1649 assert(designator != NULL);
1650 *anchor = designator;
1651 anchor = &designator->next;
1657 static initializer_t *initializer_from_string(array_type_t *const type,
1658 const string_t *const string)
1660 /* TODO: check len vs. size of array type */
1663 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1664 initializer->string.string = *string;
1669 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1670 const string_t *const string)
1672 /* TODO: check len vs. size of array type */
1675 initializer_t *const initializer =
1676 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1677 initializer->wide_string.string = *string;
1683 * Build an initializer from a given expression.
1685 static initializer_t *initializer_from_expression(type_t *orig_type,
1686 expression_t *expression)
1688 /* TODO check that expression is a constant expression */
1690 /* §6.7.8.14/15 char array may be initialized by string literals */
1691 type_t *type = skip_typeref(orig_type);
1692 type_t *expr_type_orig = expression->base.type;
1693 type_t *expr_type = skip_typeref(expr_type_orig);
1695 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1696 array_type_t *const array_type = &type->array;
1697 type_t *const element_type = skip_typeref(array_type->element_type);
1699 if (element_type->kind == TYPE_ATOMIC) {
1700 atomic_type_kind_t akind = element_type->atomic.akind;
1701 switch (expression->kind) {
1702 case EXPR_STRING_LITERAL:
1703 if (akind == ATOMIC_TYPE_CHAR
1704 || akind == ATOMIC_TYPE_SCHAR
1705 || akind == ATOMIC_TYPE_UCHAR) {
1706 return initializer_from_string(array_type,
1707 &expression->string_literal.value);
1711 case EXPR_WIDE_STRING_LITERAL: {
1712 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1713 if (get_unqualified_type(element_type) == bare_wchar_type) {
1714 return initializer_from_wide_string(array_type,
1715 &expression->string_literal.value);
1726 assign_error_t error = semantic_assign(type, expression);
1727 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1729 report_assign_error(error, type, expression, "initializer",
1730 &expression->base.source_position);
1732 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1733 result->value.value = create_implicit_cast(expression, type);
1739 * Checks if a given expression can be used as an constant initializer.
1741 static bool is_initializer_constant(const expression_t *expression)
1744 is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1745 is_address_constant(expression) != EXPR_CLASS_VARIABLE;
1749 * Parses an scalar initializer.
1751 * §6.7.8.11; eat {} without warning
1753 static initializer_t *parse_scalar_initializer(type_t *type,
1754 bool must_be_constant)
1756 /* there might be extra {} hierarchies */
1758 if (token.type == '{') {
1760 warningf(HERE, "extra curly braces around scalar initializer");
1764 } while (token.type == '{');
1767 expression_t *expression = parse_assignment_expression();
1768 mark_vars_read(expression, NULL);
1769 if (must_be_constant && !is_initializer_constant(expression)) {
1770 errorf(&expression->base.source_position,
1771 "initialisation expression '%E' is not constant",
1775 initializer_t *initializer = initializer_from_expression(type, expression);
1777 if (initializer == NULL) {
1778 errorf(&expression->base.source_position,
1779 "expression '%E' (type '%T') doesn't match expected type '%T'",
1780 expression, expression->base.type, type);
1785 bool additional_warning_displayed = false;
1786 while (braces > 0) {
1788 if (token.type != '}') {
1789 if (!additional_warning_displayed && warning.other) {
1790 warningf(HERE, "additional elements in scalar initializer");
1791 additional_warning_displayed = true;
1802 * An entry in the type path.
1804 typedef struct type_path_entry_t type_path_entry_t;
1805 struct type_path_entry_t {
1806 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1808 size_t index; /**< For array types: the current index. */
1809 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1814 * A type path expression a position inside compound or array types.
1816 typedef struct type_path_t type_path_t;
1817 struct type_path_t {
1818 type_path_entry_t *path; /**< An flexible array containing the current path. */
1819 type_t *top_type; /**< type of the element the path points */
1820 size_t max_index; /**< largest index in outermost array */
1824 * Prints a type path for debugging.
1826 static __attribute__((unused)) void debug_print_type_path(
1827 const type_path_t *path)
1829 size_t len = ARR_LEN(path->path);
1831 for (size_t i = 0; i < len; ++i) {
1832 const type_path_entry_t *entry = & path->path[i];
1834 type_t *type = skip_typeref(entry->type);
1835 if (is_type_compound(type)) {
1836 /* in gcc mode structs can have no members */
1837 if (entry->v.compound_entry == NULL) {
1841 fprintf(stderr, ".%s",
1842 entry->v.compound_entry->base.symbol->string);
1843 } else if (is_type_array(type)) {
1844 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1846 fprintf(stderr, "-INVALID-");
1849 if (path->top_type != NULL) {
1850 fprintf(stderr, " (");
1851 print_type(path->top_type);
1852 fprintf(stderr, ")");
1857 * Return the top type path entry, ie. in a path
1858 * (type).a.b returns the b.
1860 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1862 size_t len = ARR_LEN(path->path);
1864 return &path->path[len-1];
1868 * Enlarge the type path by an (empty) element.
1870 static type_path_entry_t *append_to_type_path(type_path_t *path)
1872 size_t len = ARR_LEN(path->path);
1873 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1875 type_path_entry_t *result = & path->path[len];
1876 memset(result, 0, sizeof(result[0]));
1881 * Descending into a sub-type. Enter the scope of the current top_type.
1883 static void descend_into_subtype(type_path_t *path)
1885 type_t *orig_top_type = path->top_type;
1886 type_t *top_type = skip_typeref(orig_top_type);
1888 type_path_entry_t *top = append_to_type_path(path);
1889 top->type = top_type;
1891 if (is_type_compound(top_type)) {
1892 compound_t *compound = top_type->compound.compound;
1893 entity_t *entry = compound->members.entities;
1895 if (entry != NULL) {
1896 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1897 top->v.compound_entry = &entry->declaration;
1898 path->top_type = entry->declaration.type;
1900 path->top_type = NULL;
1902 } else if (is_type_array(top_type)) {
1904 path->top_type = top_type->array.element_type;
1906 assert(!is_type_valid(top_type));
1911 * Pop an entry from the given type path, ie. returning from
1912 * (type).a.b to (type).a
1914 static void ascend_from_subtype(type_path_t *path)
1916 type_path_entry_t *top = get_type_path_top(path);
1918 path->top_type = top->type;
1920 size_t len = ARR_LEN(path->path);
1921 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1925 * Pop entries from the given type path until the given
1926 * path level is reached.
1928 static void ascend_to(type_path_t *path, size_t top_path_level)
1930 size_t len = ARR_LEN(path->path);
1932 while (len > top_path_level) {
1933 ascend_from_subtype(path);
1934 len = ARR_LEN(path->path);
1938 static bool walk_designator(type_path_t *path, const designator_t *designator,
1939 bool used_in_offsetof)
1941 for (; designator != NULL; designator = designator->next) {
1942 type_path_entry_t *top = get_type_path_top(path);
1943 type_t *orig_type = top->type;
1945 type_t *type = skip_typeref(orig_type);
1947 if (designator->symbol != NULL) {
1948 symbol_t *symbol = designator->symbol;
1949 if (!is_type_compound(type)) {
1950 if (is_type_valid(type)) {
1951 errorf(&designator->source_position,
1952 "'.%Y' designator used for non-compound type '%T'",
1956 top->type = type_error_type;
1957 top->v.compound_entry = NULL;
1958 orig_type = type_error_type;
1960 compound_t *compound = type->compound.compound;
1961 entity_t *iter = compound->members.entities;
1962 for (; iter != NULL; iter = iter->base.next) {
1963 if (iter->base.symbol == symbol) {
1968 errorf(&designator->source_position,
1969 "'%T' has no member named '%Y'", orig_type, symbol);
1972 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1973 if (used_in_offsetof) {
1974 type_t *real_type = skip_typeref(iter->declaration.type);
1975 if (real_type->kind == TYPE_BITFIELD) {
1976 errorf(&designator->source_position,
1977 "offsetof designator '%Y' must not specify bitfield",
1983 top->type = orig_type;
1984 top->v.compound_entry = &iter->declaration;
1985 orig_type = iter->declaration.type;
1988 expression_t *array_index = designator->array_index;
1989 assert(designator->array_index != NULL);
1991 if (!is_type_array(type)) {
1992 if (is_type_valid(type)) {
1993 errorf(&designator->source_position,
1994 "[%E] designator used for non-array type '%T'",
1995 array_index, orig_type);
2000 long index = fold_constant_to_int(array_index);
2001 if (!used_in_offsetof) {
2003 errorf(&designator->source_position,
2004 "array index [%E] must be positive", array_index);
2005 } else if (type->array.size_constant) {
2006 long array_size = type->array.size;
2007 if (index >= array_size) {
2008 errorf(&designator->source_position,
2009 "designator [%E] (%d) exceeds array size %d",
2010 array_index, index, array_size);
2015 top->type = orig_type;
2016 top->v.index = (size_t) index;
2017 orig_type = type->array.element_type;
2019 path->top_type = orig_type;
2021 if (designator->next != NULL) {
2022 descend_into_subtype(path);
2028 static void advance_current_object(type_path_t *path, size_t top_path_level)
2030 type_path_entry_t *top = get_type_path_top(path);
2032 type_t *type = skip_typeref(top->type);
2033 if (is_type_union(type)) {
2034 /* in unions only the first element is initialized */
2035 top->v.compound_entry = NULL;
2036 } else if (is_type_struct(type)) {
2037 declaration_t *entry = top->v.compound_entry;
2039 entity_t *next_entity = entry->base.next;
2040 if (next_entity != NULL) {
2041 assert(is_declaration(next_entity));
2042 entry = &next_entity->declaration;
2047 top->v.compound_entry = entry;
2048 if (entry != NULL) {
2049 path->top_type = entry->type;
2052 } else if (is_type_array(type)) {
2053 assert(is_type_array(type));
2057 if (!type->array.size_constant || top->v.index < type->array.size) {
2061 assert(!is_type_valid(type));
2065 /* we're past the last member of the current sub-aggregate, try if we
2066 * can ascend in the type hierarchy and continue with another subobject */
2067 size_t len = ARR_LEN(path->path);
2069 if (len > top_path_level) {
2070 ascend_from_subtype(path);
2071 advance_current_object(path, top_path_level);
2073 path->top_type = NULL;
2078 * skip any {...} blocks until a closing bracket is reached.
2080 static void skip_initializers(void)
2084 while (token.type != '}') {
2085 if (token.type == T_EOF)
2087 if (token.type == '{') {
2095 static initializer_t *create_empty_initializer(void)
2097 static initializer_t empty_initializer
2098 = { .list = { { INITIALIZER_LIST }, 0 } };
2099 return &empty_initializer;
2103 * Parse a part of an initialiser for a struct or union,
2105 static initializer_t *parse_sub_initializer(type_path_t *path,
2106 type_t *outer_type, size_t top_path_level,
2107 parse_initializer_env_t *env)
2109 if (token.type == '}') {
2110 /* empty initializer */
2111 return create_empty_initializer();
2114 type_t *orig_type = path->top_type;
2115 type_t *type = NULL;
2117 if (orig_type == NULL) {
2118 /* We are initializing an empty compound. */
2120 type = skip_typeref(orig_type);
2123 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2126 designator_t *designator = NULL;
2127 if (token.type == '.' || token.type == '[') {
2128 designator = parse_designation();
2129 goto finish_designator;
2130 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2131 /* GNU-style designator ("identifier: value") */
2132 designator = allocate_ast_zero(sizeof(designator[0]));
2133 designator->source_position = token.source_position;
2134 designator->symbol = token.symbol;
2139 /* reset path to toplevel, evaluate designator from there */
2140 ascend_to(path, top_path_level);
2141 if (!walk_designator(path, designator, false)) {
2142 /* can't continue after designation error */
2146 initializer_t *designator_initializer
2147 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2148 designator_initializer->designator.designator = designator;
2149 ARR_APP1(initializer_t*, initializers, designator_initializer);
2151 orig_type = path->top_type;
2152 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2157 if (token.type == '{') {
2158 if (type != NULL && is_type_scalar(type)) {
2159 sub = parse_scalar_initializer(type, env->must_be_constant);
2162 if (env->entity != NULL) {
2164 "extra brace group at end of initializer for '%Y'",
2165 env->entity->base.symbol);
2167 errorf(HERE, "extra brace group at end of initializer");
2172 descend_into_subtype(path);
2175 add_anchor_token('}');
2176 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2178 rem_anchor_token('}');
2181 ascend_from_subtype(path);
2182 expect('}', end_error);
2184 expect('}', end_error);
2185 goto error_parse_next;
2189 /* must be an expression */
2190 expression_t *expression = parse_assignment_expression();
2191 mark_vars_read(expression, NULL);
2193 if (env->must_be_constant && !is_initializer_constant(expression)) {
2194 errorf(&expression->base.source_position,
2195 "Initialisation expression '%E' is not constant",
2200 /* we are already outside, ... */
2201 if (outer_type == NULL)
2202 goto error_parse_next;
2203 type_t *const outer_type_skip = skip_typeref(outer_type);
2204 if (is_type_compound(outer_type_skip) &&
2205 !outer_type_skip->compound.compound->complete) {
2206 goto error_parse_next;
2209 if (warning.other) {
2210 if (env->entity != NULL) {
2211 warningf(HERE, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2213 warningf(HERE, "excess elements in initializer");
2216 goto error_parse_next;
2219 /* handle { "string" } special case */
2220 if ((expression->kind == EXPR_STRING_LITERAL
2221 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2222 && outer_type != NULL) {
2223 sub = initializer_from_expression(outer_type, expression);
2226 if (token.type != '}' && warning.other) {
2227 warningf(HERE, "excessive elements in initializer for type '%T'",
2230 /* TODO: eat , ... */
2235 /* descend into subtypes until expression matches type */
2237 orig_type = path->top_type;
2238 type = skip_typeref(orig_type);
2240 sub = initializer_from_expression(orig_type, expression);
2244 if (!is_type_valid(type)) {
2247 if (is_type_scalar(type)) {
2248 errorf(&expression->base.source_position,
2249 "expression '%E' doesn't match expected type '%T'",
2250 expression, orig_type);
2254 descend_into_subtype(path);
2258 /* update largest index of top array */
2259 const type_path_entry_t *first = &path->path[0];
2260 type_t *first_type = first->type;
2261 first_type = skip_typeref(first_type);
2262 if (is_type_array(first_type)) {
2263 size_t index = first->v.index;
2264 if (index > path->max_index)
2265 path->max_index = index;
2268 /* append to initializers list */
2269 ARR_APP1(initializer_t*, initializers, sub);
2272 if (token.type == '}') {
2275 expect(',', end_error);
2276 if (token.type == '}') {
2281 /* advance to the next declaration if we are not at the end */
2282 advance_current_object(path, top_path_level);
2283 orig_type = path->top_type;
2284 if (orig_type != NULL)
2285 type = skip_typeref(orig_type);
2291 size_t len = ARR_LEN(initializers);
2292 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2293 initializer_t *result = allocate_ast_zero(size);
2294 result->kind = INITIALIZER_LIST;
2295 result->list.len = len;
2296 memcpy(&result->list.initializers, initializers,
2297 len * sizeof(initializers[0]));
2299 DEL_ARR_F(initializers);
2300 ascend_to(path, top_path_level+1);
2305 skip_initializers();
2306 DEL_ARR_F(initializers);
2307 ascend_to(path, top_path_level+1);
2311 static expression_t *make_size_literal(size_t value)
2313 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2314 literal->base.type = type_size_t;
2317 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2318 literal->literal.value = make_string(buf);
2324 * Parses an initializer. Parsers either a compound literal
2325 * (env->declaration == NULL) or an initializer of a declaration.
2327 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2329 type_t *type = skip_typeref(env->type);
2330 size_t max_index = 0;
2331 initializer_t *result;
2333 if (is_type_scalar(type)) {
2334 result = parse_scalar_initializer(type, env->must_be_constant);
2335 } else if (token.type == '{') {
2339 memset(&path, 0, sizeof(path));
2340 path.top_type = env->type;
2341 path.path = NEW_ARR_F(type_path_entry_t, 0);
2343 descend_into_subtype(&path);
2345 add_anchor_token('}');
2346 result = parse_sub_initializer(&path, env->type, 1, env);
2347 rem_anchor_token('}');
2349 max_index = path.max_index;
2350 DEL_ARR_F(path.path);
2352 expect('}', end_error);
2355 /* parse_scalar_initializer() also works in this case: we simply
2356 * have an expression without {} around it */
2357 result = parse_scalar_initializer(type, env->must_be_constant);
2360 /* §6.7.8:22 array initializers for arrays with unknown size determine
2361 * the array type size */
2362 if (is_type_array(type) && type->array.size_expression == NULL
2363 && result != NULL) {
2365 switch (result->kind) {
2366 case INITIALIZER_LIST:
2367 assert(max_index != 0xdeadbeaf);
2368 size = max_index + 1;
2371 case INITIALIZER_STRING:
2372 size = result->string.string.size;
2375 case INITIALIZER_WIDE_STRING:
2376 size = result->wide_string.string.size;
2379 case INITIALIZER_DESIGNATOR:
2380 case INITIALIZER_VALUE:
2381 /* can happen for parse errors */
2386 internal_errorf(HERE, "invalid initializer type");
2389 type_t *new_type = duplicate_type(type);
2391 new_type->array.size_expression = make_size_literal(size);
2392 new_type->array.size_constant = true;
2393 new_type->array.has_implicit_size = true;
2394 new_type->array.size = size;
2395 env->type = new_type;
2401 static void append_entity(scope_t *scope, entity_t *entity)
2403 if (scope->last_entity != NULL) {
2404 scope->last_entity->base.next = entity;
2406 scope->entities = entity;
2408 entity->base.parent_entity = current_entity;
2409 scope->last_entity = entity;
2413 static compound_t *parse_compound_type_specifier(bool is_struct)
2415 source_position_t const pos = *HERE;
2416 eat(is_struct ? T_struct : T_union);
2418 symbol_t *symbol = NULL;
2419 entity_t *entity = NULL;
2420 attribute_t *attributes = NULL;
2422 if (token.type == T___attribute__) {
2423 attributes = parse_attributes(NULL);
2426 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2427 if (token.type == T_IDENTIFIER) {
2428 /* the compound has a name, check if we have seen it already */
2429 symbol = token.symbol;
2430 entity = get_tag(symbol, kind);
2433 if (entity != NULL) {
2434 if (entity->base.parent_scope != current_scope &&
2435 (token.type == '{' || token.type == ';')) {
2436 /* we're in an inner scope and have a definition. Shadow
2437 * existing definition in outer scope */
2439 } else if (entity->compound.complete && token.type == '{') {
2440 errorf(&pos, "multiple definitions of '%s %Y' (previous definition %P)",
2441 is_struct ? "struct" : "union", symbol,
2442 &entity->base.source_position);
2443 /* clear members in the hope to avoid further errors */
2444 entity->compound.members.entities = NULL;
2447 } else if (token.type != '{') {
2448 char const *const msg =
2449 is_struct ? "while parsing struct type specifier" :
2450 "while parsing union type specifier";
2451 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2456 if (entity == NULL) {
2457 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2458 entity->compound.alignment = 1;
2459 entity->base.source_position = pos;
2460 entity->base.parent_scope = current_scope;
2461 if (symbol != NULL) {
2462 environment_push(entity);
2464 append_entity(current_scope, entity);
2467 if (token.type == '{') {
2468 parse_compound_type_entries(&entity->compound);
2470 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2471 if (symbol == NULL) {
2472 assert(anonymous_entity == NULL);
2473 anonymous_entity = entity;
2477 if (attributes != NULL) {
2478 handle_entity_attributes(attributes, entity);
2481 return &entity->compound;
2484 static void parse_enum_entries(type_t *const enum_type)
2488 if (token.type == '}') {
2489 errorf(HERE, "empty enum not allowed");
2494 add_anchor_token('}');
2496 if (token.type != T_IDENTIFIER) {
2497 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2499 rem_anchor_token('}');
2503 entity_t *const entity = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, token.symbol);
2504 entity->enum_value.enum_type = enum_type;
2505 entity->base.source_position = token.source_position;
2509 expression_t *value = parse_constant_expression();
2511 value = create_implicit_cast(value, enum_type);
2512 entity->enum_value.value = value;
2517 record_entity(entity, false);
2518 } while (next_if(',') && token.type != '}');
2519 rem_anchor_token('}');
2521 expect('}', end_error);
2527 static type_t *parse_enum_specifier(void)
2529 source_position_t const pos = *HERE;
2534 switch (token.type) {
2536 symbol = token.symbol;
2537 entity = get_tag(symbol, ENTITY_ENUM);
2540 if (entity != NULL) {
2541 if (entity->base.parent_scope != current_scope &&
2542 (token.type == '{' || token.type == ';')) {
2543 /* we're in an inner scope and have a definition. Shadow
2544 * existing definition in outer scope */
2546 } else if (entity->enume.complete && token.type == '{') {
2547 errorf(&pos, "multiple definitions of 'enum %Y' (previous definition %P)",
2548 symbol, &entity->base.source_position);
2559 parse_error_expected("while parsing enum type specifier",
2560 T_IDENTIFIER, '{', NULL);
2564 if (entity == NULL) {
2565 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2566 entity->base.source_position = pos;
2567 entity->base.parent_scope = current_scope;
2570 type_t *const type = allocate_type_zero(TYPE_ENUM);
2571 type->enumt.enume = &entity->enume;
2572 type->enumt.akind = ATOMIC_TYPE_INT;
2574 if (token.type == '{') {
2575 if (symbol != NULL) {
2576 environment_push(entity);
2578 append_entity(current_scope, entity);
2579 entity->enume.complete = true;
2581 parse_enum_entries(type);
2582 parse_attributes(NULL);
2584 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2585 if (symbol == NULL) {
2586 assert(anonymous_entity == NULL);
2587 anonymous_entity = entity;
2589 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2590 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2597 * if a symbol is a typedef to another type, return true
2599 static bool is_typedef_symbol(symbol_t *symbol)
2601 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2602 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2605 static type_t *parse_typeof(void)
2611 expect('(', end_error);
2612 add_anchor_token(')');
2614 expression_t *expression = NULL;
2616 bool old_type_prop = in_type_prop;
2617 bool old_gcc_extension = in_gcc_extension;
2618 in_type_prop = true;
2620 while (next_if(T___extension__)) {
2621 /* This can be a prefix to a typename or an expression. */
2622 in_gcc_extension = true;
2624 switch (token.type) {
2626 if (is_typedef_symbol(token.symbol)) {
2628 type = parse_typename();
2631 expression = parse_expression();
2632 type = revert_automatic_type_conversion(expression);
2636 in_type_prop = old_type_prop;
2637 in_gcc_extension = old_gcc_extension;
2639 rem_anchor_token(')');
2640 expect(')', end_error);
2642 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2643 typeof_type->typeoft.expression = expression;
2644 typeof_type->typeoft.typeof_type = type;
2651 typedef enum specifiers_t {
2652 SPECIFIER_SIGNED = 1 << 0,
2653 SPECIFIER_UNSIGNED = 1 << 1,
2654 SPECIFIER_LONG = 1 << 2,
2655 SPECIFIER_INT = 1 << 3,
2656 SPECIFIER_DOUBLE = 1 << 4,
2657 SPECIFIER_CHAR = 1 << 5,
2658 SPECIFIER_WCHAR_T = 1 << 6,
2659 SPECIFIER_SHORT = 1 << 7,
2660 SPECIFIER_LONG_LONG = 1 << 8,
2661 SPECIFIER_FLOAT = 1 << 9,
2662 SPECIFIER_BOOL = 1 << 10,
2663 SPECIFIER_VOID = 1 << 11,
2664 SPECIFIER_INT8 = 1 << 12,
2665 SPECIFIER_INT16 = 1 << 13,
2666 SPECIFIER_INT32 = 1 << 14,
2667 SPECIFIER_INT64 = 1 << 15,
2668 SPECIFIER_INT128 = 1 << 16,
2669 SPECIFIER_COMPLEX = 1 << 17,
2670 SPECIFIER_IMAGINARY = 1 << 18,
2673 static type_t *get_typedef_type(symbol_t *symbol)
2675 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2676 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2679 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2680 type->typedeft.typedefe = &entity->typedefe;
2685 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2687 expect('(', end_error);
2689 attribute_property_argument_t *property
2690 = allocate_ast_zero(sizeof(*property));
2693 if (token.type != T_IDENTIFIER) {
2694 parse_error_expected("while parsing property declspec",
2695 T_IDENTIFIER, NULL);
2700 symbol_t *symbol = token.symbol;
2702 if (strcmp(symbol->string, "put") == 0) {
2703 prop = &property->put_symbol;
2704 } else if (strcmp(symbol->string, "get") == 0) {
2705 prop = &property->get_symbol;
2707 errorf(HERE, "expected put or get in property declspec");
2710 expect('=', end_error);
2711 if (token.type != T_IDENTIFIER) {
2712 parse_error_expected("while parsing property declspec",
2713 T_IDENTIFIER, NULL);
2717 *prop = token.symbol;
2719 } while (next_if(','));
2721 attribute->a.property = property;
2723 expect(')', end_error);
2729 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2731 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2732 if (next_if(T_restrict)) {
2733 kind = ATTRIBUTE_MS_RESTRICT;
2734 } else if (token.type == T_IDENTIFIER) {
2735 const char *name = token.symbol->string;
2737 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2739 const char *attribute_name = get_attribute_name(k);
2740 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2746 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2747 warningf(HERE, "unknown __declspec '%s' ignored", name);
2750 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2754 attribute_t *attribute = allocate_attribute_zero(kind);
2756 if (kind == ATTRIBUTE_MS_PROPERTY) {
2757 return parse_attribute_ms_property(attribute);
2760 /* parse arguments */
2762 attribute->a.arguments = parse_attribute_arguments();
2767 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2771 expect('(', end_error);
2776 add_anchor_token(')');
2778 attribute_t **anchor = &first;
2780 while (*anchor != NULL)
2781 anchor = &(*anchor)->next;
2783 attribute_t *attribute
2784 = parse_microsoft_extended_decl_modifier_single();
2785 if (attribute == NULL)
2788 *anchor = attribute;
2789 anchor = &attribute->next;
2790 } while (next_if(','));
2792 rem_anchor_token(')');
2793 expect(')', end_error);
2797 rem_anchor_token(')');
2801 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2803 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2804 entity->base.source_position = *HERE;
2805 if (is_declaration(entity)) {
2806 entity->declaration.type = type_error_type;
2807 entity->declaration.implicit = true;
2808 } else if (kind == ENTITY_TYPEDEF) {
2809 entity->typedefe.type = type_error_type;
2810 entity->typedefe.builtin = true;
2812 if (kind != ENTITY_COMPOUND_MEMBER)
2813 record_entity(entity, false);
2817 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2819 type_t *type = NULL;
2820 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2821 unsigned type_specifiers = 0;
2822 bool newtype = false;
2823 bool saw_error = false;
2824 bool old_gcc_extension = in_gcc_extension;
2826 memset(specifiers, 0, sizeof(*specifiers));
2827 specifiers->source_position = token.source_position;
2830 specifiers->attributes = parse_attributes(specifiers->attributes);
2832 switch (token.type) {
2834 #define MATCH_STORAGE_CLASS(token, class) \
2836 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2837 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2839 specifiers->storage_class = class; \
2840 if (specifiers->thread_local) \
2841 goto check_thread_storage_class; \
2845 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2846 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2847 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2848 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2849 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2852 specifiers->attributes
2853 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2857 if (specifiers->thread_local) {
2858 errorf(HERE, "duplicate '__thread'");
2860 specifiers->thread_local = true;
2861 check_thread_storage_class:
2862 switch (specifiers->storage_class) {
2863 case STORAGE_CLASS_EXTERN:
2864 case STORAGE_CLASS_NONE:
2865 case STORAGE_CLASS_STATIC:
2869 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2870 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2871 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2872 wrong_thread_storage_class:
2873 errorf(HERE, "'__thread' used with '%s'", wrong);
2880 /* type qualifiers */
2881 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2883 qualifiers |= qualifier; \
2887 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2888 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2889 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2890 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2891 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2892 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2893 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2894 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2896 case T___extension__:
2898 in_gcc_extension = true;
2901 /* type specifiers */
2902 #define MATCH_SPECIFIER(token, specifier, name) \
2904 if (type_specifiers & specifier) { \
2905 errorf(HERE, "multiple " name " type specifiers given"); \
2907 type_specifiers |= specifier; \
2912 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2913 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2914 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2915 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2916 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2917 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2918 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2919 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2920 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2921 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2922 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2923 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2924 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2925 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2926 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2927 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2928 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2929 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2933 specifiers->is_inline = true;
2937 case T__forceinline:
2939 specifiers->modifiers |= DM_FORCEINLINE;
2944 if (type_specifiers & SPECIFIER_LONG_LONG) {
2945 errorf(HERE, "too many long type specifiers given");
2946 } else if (type_specifiers & SPECIFIER_LONG) {
2947 type_specifiers |= SPECIFIER_LONG_LONG;
2949 type_specifiers |= SPECIFIER_LONG;
2954 #define CHECK_DOUBLE_TYPE() \
2955 if ( type != NULL) \
2956 errorf(HERE, "multiple data types in declaration specifiers");
2959 CHECK_DOUBLE_TYPE();
2960 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2962 type->compound.compound = parse_compound_type_specifier(true);
2965 CHECK_DOUBLE_TYPE();
2966 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2967 type->compound.compound = parse_compound_type_specifier(false);
2970 CHECK_DOUBLE_TYPE();
2971 type = parse_enum_specifier();
2974 CHECK_DOUBLE_TYPE();
2975 type = parse_typeof();
2977 case T___builtin_va_list:
2978 CHECK_DOUBLE_TYPE();
2979 type = duplicate_type(type_valist);
2983 case T_IDENTIFIER: {
2984 /* only parse identifier if we haven't found a type yet */
2985 if (type != NULL || type_specifiers != 0) {
2986 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2987 * declaration, so it doesn't generate errors about expecting '(' or
2989 switch (look_ahead(1)->type) {
2996 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3000 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3005 goto finish_specifiers;
3009 type_t *const typedef_type = get_typedef_type(token.symbol);
3010 if (typedef_type == NULL) {
3011 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3012 * declaration, so it doesn't generate 'implicit int' followed by more
3013 * errors later on. */
3014 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3020 errorf(HERE, "%K does not name a type", &token);
3023 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3025 type = allocate_type_zero(TYPE_TYPEDEF);
3026 type->typedeft.typedefe = &entity->typedefe;
3034 goto finish_specifiers;
3039 type = typedef_type;
3043 /* function specifier */
3045 goto finish_specifiers;
3050 specifiers->attributes = parse_attributes(specifiers->attributes);
3052 in_gcc_extension = old_gcc_extension;
3054 if (type == NULL || (saw_error && type_specifiers != 0)) {
3055 atomic_type_kind_t atomic_type;
3057 /* match valid basic types */
3058 switch (type_specifiers) {
3059 case SPECIFIER_VOID:
3060 atomic_type = ATOMIC_TYPE_VOID;
3062 case SPECIFIER_WCHAR_T:
3063 atomic_type = ATOMIC_TYPE_WCHAR_T;
3065 case SPECIFIER_CHAR:
3066 atomic_type = ATOMIC_TYPE_CHAR;
3068 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3069 atomic_type = ATOMIC_TYPE_SCHAR;
3071 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3072 atomic_type = ATOMIC_TYPE_UCHAR;
3074 case SPECIFIER_SHORT:
3075 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3076 case SPECIFIER_SHORT | SPECIFIER_INT:
3077 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3078 atomic_type = ATOMIC_TYPE_SHORT;
3080 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3081 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3082 atomic_type = ATOMIC_TYPE_USHORT;
3085 case SPECIFIER_SIGNED:
3086 case SPECIFIER_SIGNED | SPECIFIER_INT:
3087 atomic_type = ATOMIC_TYPE_INT;
3089 case SPECIFIER_UNSIGNED:
3090 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3091 atomic_type = ATOMIC_TYPE_UINT;
3093 case SPECIFIER_LONG:
3094 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3095 case SPECIFIER_LONG | SPECIFIER_INT:
3096 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3097 atomic_type = ATOMIC_TYPE_LONG;
3099 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3100 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3101 atomic_type = ATOMIC_TYPE_ULONG;
3104 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3105 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3106 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3107 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3109 atomic_type = ATOMIC_TYPE_LONGLONG;
3110 goto warn_about_long_long;
3112 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3113 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3115 atomic_type = ATOMIC_TYPE_ULONGLONG;
3116 warn_about_long_long:
3117 if (warning.long_long) {
3118 warningf(&specifiers->source_position,
3119 "ISO C90 does not support 'long long'");
3123 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3124 atomic_type = unsigned_int8_type_kind;
3127 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3128 atomic_type = unsigned_int16_type_kind;
3131 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3132 atomic_type = unsigned_int32_type_kind;
3135 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3136 atomic_type = unsigned_int64_type_kind;
3139 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3140 atomic_type = unsigned_int128_type_kind;
3143 case SPECIFIER_INT8:
3144 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3145 atomic_type = int8_type_kind;
3148 case SPECIFIER_INT16:
3149 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3150 atomic_type = int16_type_kind;
3153 case SPECIFIER_INT32:
3154 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3155 atomic_type = int32_type_kind;
3158 case SPECIFIER_INT64:
3159 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3160 atomic_type = int64_type_kind;
3163 case SPECIFIER_INT128:
3164 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3165 atomic_type = int128_type_kind;
3168 case SPECIFIER_FLOAT:
3169 atomic_type = ATOMIC_TYPE_FLOAT;
3171 case SPECIFIER_DOUBLE:
3172 atomic_type = ATOMIC_TYPE_DOUBLE;
3174 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3175 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3177 case SPECIFIER_BOOL:
3178 atomic_type = ATOMIC_TYPE_BOOL;
3180 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3181 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3182 atomic_type = ATOMIC_TYPE_FLOAT;
3184 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3185 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3186 atomic_type = ATOMIC_TYPE_DOUBLE;
3188 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3189 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3190 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3193 /* invalid specifier combination, give an error message */
3194 if (type_specifiers == 0) {
3196 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3197 if (!(c_mode & _CXX) && !strict_mode) {
3198 if (warning.implicit_int) {
3199 warningf(HERE, "no type specifiers in declaration, using 'int'");
3201 atomic_type = ATOMIC_TYPE_INT;
3204 errorf(HERE, "no type specifiers given in declaration");
3207 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3208 (type_specifiers & SPECIFIER_UNSIGNED)) {
3209 errorf(HERE, "signed and unsigned specifiers given");
3210 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3211 errorf(HERE, "only integer types can be signed or unsigned");
3213 errorf(HERE, "multiple datatypes in declaration");
3218 if (type_specifiers & SPECIFIER_COMPLEX) {
3219 type = allocate_type_zero(TYPE_COMPLEX);
3220 type->complex.akind = atomic_type;
3221 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3222 type = allocate_type_zero(TYPE_IMAGINARY);
3223 type->imaginary.akind = atomic_type;
3225 type = allocate_type_zero(TYPE_ATOMIC);
3226 type->atomic.akind = atomic_type;
3229 } else if (type_specifiers != 0) {
3230 errorf(HERE, "multiple datatypes in declaration");
3233 /* FIXME: check type qualifiers here */
3234 type->base.qualifiers = qualifiers;
3237 type = identify_new_type(type);
3239 type = typehash_insert(type);
3242 if (specifiers->attributes != NULL)
3243 type = handle_type_attributes(specifiers->attributes, type);
3244 specifiers->type = type;
3248 specifiers->type = type_error_type;
3251 static type_qualifiers_t parse_type_qualifiers(void)
3253 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3256 switch (token.type) {
3257 /* type qualifiers */
3258 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3259 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3260 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3261 /* microsoft extended type modifiers */
3262 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3263 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3264 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3265 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3266 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3275 * Parses an K&R identifier list
3277 static void parse_identifier_list(scope_t *scope)
3280 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.symbol);
3281 entity->base.source_position = token.source_position;
3282 /* a K&R parameter has no type, yet */
3286 append_entity(scope, entity);
3287 } while (next_if(',') && token.type == T_IDENTIFIER);
3290 static entity_t *parse_parameter(void)
3292 declaration_specifiers_t specifiers;
3293 parse_declaration_specifiers(&specifiers);
3295 entity_t *entity = parse_declarator(&specifiers,
3296 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3297 anonymous_entity = NULL;
3301 static void semantic_parameter_incomplete(const entity_t *entity)
3303 assert(entity->kind == ENTITY_PARAMETER);
3305 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3306 * list in a function declarator that is part of a
3307 * definition of that function shall not have
3308 * incomplete type. */
3309 type_t *type = skip_typeref(entity->declaration.type);
3310 if (is_type_incomplete(type)) {
3311 errorf(&entity->base.source_position,
3312 "parameter '%#T' has incomplete type",
3313 entity->declaration.type, entity->base.symbol);
3317 static bool has_parameters(void)
3319 /* func(void) is not a parameter */
3320 if (token.type == T_IDENTIFIER) {
3321 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3324 if (entity->kind != ENTITY_TYPEDEF)
3326 if (skip_typeref(entity->typedefe.type) != type_void)
3328 } else if (token.type != T_void) {
3331 if (look_ahead(1)->type != ')')
3338 * Parses function type parameters (and optionally creates variable_t entities
3339 * for them in a scope)
3341 static void parse_parameters(function_type_t *type, scope_t *scope)
3344 add_anchor_token(')');
3345 int saved_comma_state = save_and_reset_anchor_state(',');
3347 if (token.type == T_IDENTIFIER &&
3348 !is_typedef_symbol(token.symbol)) {
3349 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3350 if (la1_type == ',' || la1_type == ')') {
3351 type->kr_style_parameters = true;
3352 parse_identifier_list(scope);
3353 goto parameters_finished;
3357 if (token.type == ')') {
3358 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3359 if (!(c_mode & _CXX))
3360 type->unspecified_parameters = true;
3361 } else if (has_parameters()) {
3362 function_parameter_t **anchor = &type->parameters;
3364 switch (token.type) {
3367 type->variadic = true;
3368 goto parameters_finished;
3371 case T___extension__:
3374 entity_t *entity = parse_parameter();
3375 if (entity->kind == ENTITY_TYPEDEF) {
3376 errorf(&entity->base.source_position,
3377 "typedef not allowed as function parameter");
3380 assert(is_declaration(entity));
3382 semantic_parameter_incomplete(entity);
3384 function_parameter_t *const parameter =
3385 allocate_parameter(entity->declaration.type);
3387 if (scope != NULL) {
3388 append_entity(scope, entity);
3391 *anchor = parameter;
3392 anchor = ¶meter->next;
3397 goto parameters_finished;
3399 } while (next_if(','));
3402 parameters_finished:
3403 rem_anchor_token(')');
3404 expect(')', end_error);
3407 restore_anchor_state(',', saved_comma_state);
3410 typedef enum construct_type_kind_t {
3413 CONSTRUCT_REFERENCE,
3416 } construct_type_kind_t;
3418 typedef union construct_type_t construct_type_t;
3420 typedef struct construct_type_base_t {
3421 construct_type_kind_t kind;
3422 source_position_t pos;
3423 construct_type_t *next;
3424 } construct_type_base_t;
3426 typedef struct parsed_pointer_t {
3427 construct_type_base_t base;
3428 type_qualifiers_t type_qualifiers;
3429 variable_t *base_variable; /**< MS __based extension. */
3432 typedef struct parsed_reference_t {
3433 construct_type_base_t base;
3434 } parsed_reference_t;
3436 typedef struct construct_function_type_t {
3437 construct_type_base_t base;
3438 type_t *function_type;
3439 } construct_function_type_t;
3441 typedef struct parsed_array_t {
3442 construct_type_base_t base;
3443 type_qualifiers_t type_qualifiers;
3449 union construct_type_t {
3450 construct_type_kind_t kind;
3451 construct_type_base_t base;
3452 parsed_pointer_t pointer;
3453 parsed_reference_t reference;
3454 construct_function_type_t function;
3455 parsed_array_t array;
3458 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3460 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3461 memset(cons, 0, size);
3463 cons->base.pos = *HERE;
3468 static construct_type_t *parse_pointer_declarator(void)
3470 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3472 cons->pointer.type_qualifiers = parse_type_qualifiers();
3473 //cons->pointer.base_variable = base_variable;
3478 /* ISO/IEC 14882:1998(E) §8.3.2 */
3479 static construct_type_t *parse_reference_declarator(void)
3481 if (!(c_mode & _CXX))
3482 errorf(HERE, "references are only available for C++");
3484 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3491 static construct_type_t *parse_array_declarator(void)
3493 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3494 parsed_array_t *const array = &cons->array;
3497 add_anchor_token(']');
3499 bool is_static = next_if(T_static);
3501 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3504 is_static = next_if(T_static);
3506 array->type_qualifiers = type_qualifiers;
3507 array->is_static = is_static;
3509 expression_t *size = NULL;
3510 if (token.type == '*' && look_ahead(1)->type == ']') {
3511 array->is_variable = true;
3513 } else if (token.type != ']') {
3514 size = parse_assignment_expression();
3516 /* §6.7.5.2:1 Array size must have integer type */
3517 type_t *const orig_type = size->base.type;
3518 type_t *const type = skip_typeref(orig_type);
3519 if (!is_type_integer(type) && is_type_valid(type)) {
3520 errorf(&size->base.source_position,
3521 "array size '%E' must have integer type but has type '%T'",
3526 mark_vars_read(size, NULL);
3529 if (is_static && size == NULL)
3530 errorf(&array->base.pos, "static array parameters require a size");
3532 rem_anchor_token(']');
3533 expect(']', end_error);
3540 static construct_type_t *parse_function_declarator(scope_t *scope)
3542 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3544 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3545 function_type_t *ftype = &type->function;
3547 ftype->linkage = current_linkage;
3548 ftype->calling_convention = CC_DEFAULT;
3550 parse_parameters(ftype, scope);
3552 cons->function.function_type = type;
3557 typedef struct parse_declarator_env_t {
3558 bool may_be_abstract : 1;
3559 bool must_be_abstract : 1;
3560 decl_modifiers_t modifiers;
3562 source_position_t source_position;
3564 attribute_t *attributes;
3565 } parse_declarator_env_t;
3568 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3570 /* construct a single linked list of construct_type_t's which describe
3571 * how to construct the final declarator type */
3572 construct_type_t *first = NULL;
3573 construct_type_t **anchor = &first;
3575 env->attributes = parse_attributes(env->attributes);
3578 construct_type_t *type;
3579 //variable_t *based = NULL; /* MS __based extension */
3580 switch (token.type) {
3582 type = parse_reference_declarator();
3586 panic("based not supported anymore");
3591 type = parse_pointer_declarator();
3595 goto ptr_operator_end;
3599 anchor = &type->base.next;
3601 /* TODO: find out if this is correct */
3602 env->attributes = parse_attributes(env->attributes);
3606 construct_type_t *inner_types = NULL;
3608 switch (token.type) {
3610 if (env->must_be_abstract) {
3611 errorf(HERE, "no identifier expected in typename");
3613 env->symbol = token.symbol;
3614 env->source_position = token.source_position;
3620 /* Parenthesized declarator or function declarator? */
3621 token_t const *const la1 = look_ahead(1);
3622 switch (la1->type) {
3624 if (is_typedef_symbol(la1->symbol)) {
3626 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3627 * interpreted as ``function with no parameter specification'', rather
3628 * than redundant parentheses around the omitted identifier. */
3630 /* Function declarator. */
3631 if (!env->may_be_abstract) {
3632 errorf(HERE, "function declarator must have a name");
3639 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3640 /* Paranthesized declarator. */
3642 add_anchor_token(')');
3643 inner_types = parse_inner_declarator(env);
3644 if (inner_types != NULL) {
3645 /* All later declarators only modify the return type */
3646 env->must_be_abstract = true;
3648 rem_anchor_token(')');
3649 expect(')', end_error);
3657 if (env->may_be_abstract)
3659 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3664 construct_type_t **const p = anchor;
3667 construct_type_t *type;
3668 switch (token.type) {
3670 scope_t *scope = NULL;
3671 if (!env->must_be_abstract) {
3672 scope = &env->parameters;
3675 type = parse_function_declarator(scope);
3679 type = parse_array_declarator();
3682 goto declarator_finished;
3685 /* insert in the middle of the list (at p) */
3686 type->base.next = *p;
3689 anchor = &type->base.next;
3692 declarator_finished:
3693 /* append inner_types at the end of the list, we don't to set anchor anymore
3694 * as it's not needed anymore */
3695 *anchor = inner_types;
3702 static type_t *construct_declarator_type(construct_type_t *construct_list,
3705 construct_type_t *iter = construct_list;
3706 for (; iter != NULL; iter = iter->base.next) {
3707 source_position_t const* const pos = &iter->base.pos;
3708 switch (iter->kind) {
3709 case CONSTRUCT_INVALID:
3711 case CONSTRUCT_FUNCTION: {
3712 construct_function_type_t *function = &iter->function;
3713 type_t *function_type = function->function_type;
3715 function_type->function.return_type = type;
3717 type_t *skipped_return_type = skip_typeref(type);
3719 if (is_type_function(skipped_return_type)) {
3720 errorf(pos, "function returning function is not allowed");
3721 } else if (is_type_array(skipped_return_type)) {
3722 errorf(pos, "function returning array is not allowed");
3724 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3725 warningf(pos, "type qualifiers in return type of function type are meaningless");
3729 /* The function type was constructed earlier. Freeing it here will
3730 * destroy other types. */
3731 type = typehash_insert(function_type);
3735 case CONSTRUCT_POINTER: {
3736 if (is_type_reference(skip_typeref(type)))
3737 errorf(pos, "cannot declare a pointer to reference");
3739 parsed_pointer_t *pointer = &iter->pointer;
3740 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3744 case CONSTRUCT_REFERENCE:
3745 if (is_type_reference(skip_typeref(type)))
3746 errorf(pos, "cannot declare a reference to reference");
3748 type = make_reference_type(type);
3751 case CONSTRUCT_ARRAY: {
3752 if (is_type_reference(skip_typeref(type)))
3753 errorf(pos, "cannot declare an array of references");
3755 parsed_array_t *array = &iter->array;
3756 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3758 expression_t *size_expression = array->size;
3759 if (size_expression != NULL) {
3761 = create_implicit_cast(size_expression, type_size_t);
3764 array_type->base.qualifiers = array->type_qualifiers;
3765 array_type->array.element_type = type;
3766 array_type->array.is_static = array->is_static;
3767 array_type->array.is_variable = array->is_variable;
3768 array_type->array.size_expression = size_expression;
3770 if (size_expression != NULL) {
3771 switch (is_constant_expression(size_expression)) {
3772 case EXPR_CLASS_CONSTANT: {
3773 long const size = fold_constant_to_int(size_expression);
3774 array_type->array.size = size;
3775 array_type->array.size_constant = true;
3776 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3777 * have a value greater than zero. */
3779 if (size < 0 || !GNU_MODE) {
3780 errorf(&size_expression->base.source_position,
3781 "size of array must be greater than zero");
3782 } else if (warning.other) {
3783 warningf(&size_expression->base.source_position,
3784 "zero length arrays are a GCC extension");
3790 case EXPR_CLASS_VARIABLE:
3791 array_type->array.is_vla = true;
3794 case EXPR_CLASS_ERROR:
3799 type_t *skipped_type = skip_typeref(type);
3801 if (is_type_incomplete(skipped_type)) {
3802 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3803 } else if (is_type_function(skipped_type)) {
3804 errorf(pos, "array of functions is not allowed");
3806 type = identify_new_type(array_type);
3810 internal_errorf(pos, "invalid type construction found");
3816 static type_t *automatic_type_conversion(type_t *orig_type);
3818 static type_t *semantic_parameter(const source_position_t *pos,
3820 const declaration_specifiers_t *specifiers,
3823 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3824 * shall be adjusted to ``qualified pointer to type'',
3826 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3827 * type'' shall be adjusted to ``pointer to function
3828 * returning type'', as in 6.3.2.1. */
3829 type = automatic_type_conversion(type);
3831 if (specifiers->is_inline && is_type_valid(type)) {
3832 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3835 /* §6.9.1:6 The declarations in the declaration list shall contain
3836 * no storage-class specifier other than register and no
3837 * initializations. */
3838 if (specifiers->thread_local || (
3839 specifiers->storage_class != STORAGE_CLASS_NONE &&
3840 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3842 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3845 /* delay test for incomplete type, because we might have (void)
3846 * which is legal but incomplete... */
3851 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3852 declarator_flags_t flags)
3854 parse_declarator_env_t env;
3855 memset(&env, 0, sizeof(env));
3856 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3858 construct_type_t *construct_type = parse_inner_declarator(&env);
3860 construct_declarator_type(construct_type, specifiers->type);
3861 type_t *type = skip_typeref(orig_type);
3863 if (construct_type != NULL) {
3864 obstack_free(&temp_obst, construct_type);
3867 attribute_t *attributes = parse_attributes(env.attributes);
3868 /* append (shared) specifier attribute behind attributes of this
3870 attribute_t **anchor = &attributes;
3871 while (*anchor != NULL)
3872 anchor = &(*anchor)->next;
3873 *anchor = specifiers->attributes;
3876 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3877 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3878 entity->base.source_position = env.source_position;
3879 entity->typedefe.type = orig_type;
3881 if (anonymous_entity != NULL) {
3882 if (is_type_compound(type)) {
3883 assert(anonymous_entity->compound.alias == NULL);
3884 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3885 anonymous_entity->kind == ENTITY_UNION);
3886 anonymous_entity->compound.alias = entity;
3887 anonymous_entity = NULL;
3888 } else if (is_type_enum(type)) {
3889 assert(anonymous_entity->enume.alias == NULL);
3890 assert(anonymous_entity->kind == ENTITY_ENUM);
3891 anonymous_entity->enume.alias = entity;
3892 anonymous_entity = NULL;
3896 /* create a declaration type entity */
3897 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3898 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3900 if (env.symbol != NULL) {
3901 if (specifiers->is_inline && is_type_valid(type)) {
3902 errorf(&env.source_position,
3903 "compound member '%Y' declared 'inline'", env.symbol);
3906 if (specifiers->thread_local ||
3907 specifiers->storage_class != STORAGE_CLASS_NONE) {
3908 errorf(&env.source_position,
3909 "compound member '%Y' must have no storage class",
3913 } else if (flags & DECL_IS_PARAMETER) {
3914 orig_type = semantic_parameter(&env.source_position, orig_type,
3915 specifiers, env.symbol);
3917 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3918 } else if (is_type_function(type)) {
3919 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3920 entity->function.is_inline = specifiers->is_inline;
3921 entity->function.elf_visibility = default_visibility;
3922 entity->function.parameters = env.parameters;
3924 if (env.symbol != NULL) {
3925 /* this needs fixes for C++ */
3926 bool in_function_scope = current_function != NULL;
3928 if (specifiers->thread_local || (
3929 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3930 specifiers->storage_class != STORAGE_CLASS_NONE &&
3931 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3933 errorf(&env.source_position,
3934 "invalid storage class for function '%Y'", env.symbol);
3938 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3939 entity->variable.elf_visibility = default_visibility;
3940 entity->variable.thread_local = specifiers->thread_local;
3942 if (env.symbol != NULL) {
3943 if (specifiers->is_inline && is_type_valid(type)) {
3944 errorf(&env.source_position,
3945 "variable '%Y' declared 'inline'", env.symbol);
3948 bool invalid_storage_class = false;
3949 if (current_scope == file_scope) {
3950 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3951 specifiers->storage_class != STORAGE_CLASS_NONE &&
3952 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3953 invalid_storage_class = true;
3956 if (specifiers->thread_local &&
3957 specifiers->storage_class == STORAGE_CLASS_NONE) {
3958 invalid_storage_class = true;
3961 if (invalid_storage_class) {
3962 errorf(&env.source_position,
3963 "invalid storage class for variable '%Y'", env.symbol);
3968 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3969 entity->declaration.type = orig_type;
3970 entity->declaration.alignment = get_type_alignment(orig_type);
3971 entity->declaration.modifiers = env.modifiers;
3972 entity->declaration.attributes = attributes;
3974 storage_class_t storage_class = specifiers->storage_class;
3975 entity->declaration.declared_storage_class = storage_class;
3977 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3978 storage_class = STORAGE_CLASS_AUTO;
3979 entity->declaration.storage_class = storage_class;
3982 if (attributes != NULL) {
3983 handle_entity_attributes(attributes, entity);
3989 static type_t *parse_abstract_declarator(type_t *base_type)
3991 parse_declarator_env_t env;
3992 memset(&env, 0, sizeof(env));
3993 env.may_be_abstract = true;
3994 env.must_be_abstract = true;
3996 construct_type_t *construct_type = parse_inner_declarator(&env);
3998 type_t *result = construct_declarator_type(construct_type, base_type);
3999 if (construct_type != NULL) {
4000 obstack_free(&temp_obst, construct_type);
4002 result = handle_type_attributes(env.attributes, result);
4008 * Check if the declaration of main is suspicious. main should be a
4009 * function with external linkage, returning int, taking either zero
4010 * arguments, two, or three arguments of appropriate types, ie.
4012 * int main([ int argc, char **argv [, char **env ] ]).
4014 * @param decl the declaration to check
4015 * @param type the function type of the declaration
4017 static void check_main(const entity_t *entity)
4019 const source_position_t *pos = &entity->base.source_position;
4020 if (entity->kind != ENTITY_FUNCTION) {
4021 warningf(pos, "'main' is not a function");
4025 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4026 warningf(pos, "'main' is normally a non-static function");
4029 type_t *type = skip_typeref(entity->declaration.type);
4030 assert(is_type_function(type));
4032 function_type_t *func_type = &type->function;
4033 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4034 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4035 func_type->return_type);
4037 const function_parameter_t *parm = func_type->parameters;
4039 type_t *const first_type = skip_typeref(parm->type);
4040 type_t *const first_type_unqual = get_unqualified_type(first_type);
4041 if (!types_compatible(first_type_unqual, type_int)) {
4043 "first argument of 'main' should be 'int', but is '%T'",
4048 type_t *const second_type = skip_typeref(parm->type);
4049 type_t *const second_type_unqual
4050 = get_unqualified_type(second_type);
4051 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
4052 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'",
4057 type_t *const third_type = skip_typeref(parm->type);
4058 type_t *const third_type_unqual
4059 = get_unqualified_type(third_type);
4060 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
4061 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'",
4066 goto warn_arg_count;
4070 warningf(pos, "'main' takes only zero, two or three arguments");
4076 * Check if a symbol is the equal to "main".
4078 static bool is_sym_main(const symbol_t *const sym)
4080 return strcmp(sym->string, "main") == 0;
4083 static void error_redefined_as_different_kind(const source_position_t *pos,
4084 const entity_t *old, entity_kind_t new_kind)
4086 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4087 get_entity_kind_name(old->kind), old->base.symbol,
4088 get_entity_kind_name(new_kind), &old->base.source_position);
4091 static bool is_entity_valid(entity_t *const ent)
4093 if (is_declaration(ent)) {
4094 return is_type_valid(skip_typeref(ent->declaration.type));
4095 } else if (ent->kind == ENTITY_TYPEDEF) {
4096 return is_type_valid(skip_typeref(ent->typedefe.type));
4101 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4103 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4104 if (attributes_equal(tattr, attr))
4111 * test wether new_list contains any attributes not included in old_list
4113 static bool has_new_attributes(const attribute_t *old_list,
4114 const attribute_t *new_list)
4116 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4117 if (!contains_attribute(old_list, attr))
4124 * Merge in attributes from an attribute list (probably from a previous
4125 * declaration with the same name). Warning: destroys the old structure
4126 * of the attribute list - don't reuse attributes after this call.
4128 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4131 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4133 if (contains_attribute(decl->attributes, attr))
4136 /* move attribute to new declarations attributes list */
4137 attr->next = decl->attributes;
4138 decl->attributes = attr;
4143 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4144 * for various problems that occur for multiple definitions
4146 entity_t *record_entity(entity_t *entity, const bool is_definition)
4148 const symbol_t *const symbol = entity->base.symbol;
4149 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4150 const source_position_t *pos = &entity->base.source_position;
4152 /* can happen in error cases */
4156 entity_t *const previous_entity = get_entity(symbol, namespc);
4157 /* pushing the same entity twice will break the stack structure */
4158 assert(previous_entity != entity);
4160 if (entity->kind == ENTITY_FUNCTION) {
4161 type_t *const orig_type = entity->declaration.type;
4162 type_t *const type = skip_typeref(orig_type);
4164 assert(is_type_function(type));
4165 if (type->function.unspecified_parameters &&
4166 warning.strict_prototypes &&
4167 previous_entity == NULL) {
4168 warningf(pos, "function declaration '%#T' is not a prototype",
4172 if (warning.main && current_scope == file_scope
4173 && is_sym_main(symbol)) {
4178 if (is_declaration(entity) &&
4179 warning.nested_externs &&
4180 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4181 current_scope != file_scope) {
4182 warningf(pos, "nested extern declaration of '%#T'",
4183 entity->declaration.type, symbol);
4186 if (previous_entity != NULL) {
4187 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4188 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4189 assert(previous_entity->kind == ENTITY_PARAMETER);
4191 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4192 entity->declaration.type, symbol,
4193 previous_entity->declaration.type, symbol,
4194 &previous_entity->base.source_position);
4198 if (previous_entity->base.parent_scope == current_scope) {
4199 if (previous_entity->kind != entity->kind) {
4200 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4201 error_redefined_as_different_kind(pos, previous_entity,
4206 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4207 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4208 symbol, &previous_entity->base.source_position);
4211 if (previous_entity->kind == ENTITY_TYPEDEF) {
4212 /* TODO: C++ allows this for exactly the same type */
4213 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4214 symbol, &previous_entity->base.source_position);
4218 /* at this point we should have only VARIABLES or FUNCTIONS */
4219 assert(is_declaration(previous_entity) && is_declaration(entity));
4221 declaration_t *const prev_decl = &previous_entity->declaration;
4222 declaration_t *const decl = &entity->declaration;
4224 /* can happen for K&R style declarations */
4225 if (prev_decl->type == NULL &&
4226 previous_entity->kind == ENTITY_PARAMETER &&
4227 entity->kind == ENTITY_PARAMETER) {
4228 prev_decl->type = decl->type;
4229 prev_decl->storage_class = decl->storage_class;
4230 prev_decl->declared_storage_class = decl->declared_storage_class;
4231 prev_decl->modifiers = decl->modifiers;
4232 return previous_entity;
4235 type_t *const orig_type = decl->type;
4236 assert(orig_type != NULL);
4237 type_t *const type = skip_typeref(orig_type);
4238 type_t *const prev_type = skip_typeref(prev_decl->type);
4240 if (!types_compatible(type, prev_type)) {
4242 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4243 orig_type, symbol, prev_decl->type, symbol,
4244 &previous_entity->base.source_position);
4246 unsigned old_storage_class = prev_decl->storage_class;
4248 if (warning.redundant_decls &&
4251 !(prev_decl->modifiers & DM_USED) &&
4252 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4253 warningf(&previous_entity->base.source_position,
4254 "unnecessary static forward declaration for '%#T'",
4255 prev_decl->type, symbol);
4258 storage_class_t new_storage_class = decl->storage_class;
4260 /* pretend no storage class means extern for function
4261 * declarations (except if the previous declaration is neither
4262 * none nor extern) */
4263 if (entity->kind == ENTITY_FUNCTION) {
4264 /* the previous declaration could have unspecified parameters or
4265 * be a typedef, so use the new type */
4266 if (prev_type->function.unspecified_parameters || is_definition)
4267 prev_decl->type = type;
4269 switch (old_storage_class) {
4270 case STORAGE_CLASS_NONE:
4271 old_storage_class = STORAGE_CLASS_EXTERN;
4274 case STORAGE_CLASS_EXTERN:
4275 if (is_definition) {
4276 if (warning.missing_prototypes &&
4277 prev_type->function.unspecified_parameters &&
4278 !is_sym_main(symbol)) {
4279 warningf(pos, "no previous prototype for '%#T'",
4282 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4283 new_storage_class = STORAGE_CLASS_EXTERN;
4290 } else if (is_type_incomplete(prev_type)) {
4291 prev_decl->type = type;
4294 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4295 new_storage_class == STORAGE_CLASS_EXTERN) {
4297 warn_redundant_declaration: ;
4299 = has_new_attributes(prev_decl->attributes,
4301 if (has_new_attrs) {
4302 merge_in_attributes(decl, prev_decl->attributes);
4303 } else if (!is_definition &&
4304 warning.redundant_decls &&
4305 is_type_valid(prev_type) &&
4306 strcmp(previous_entity->base.source_position.input_name,
4307 "<builtin>") != 0) {
4309 "redundant declaration for '%Y' (declared %P)",
4310 symbol, &previous_entity->base.source_position);
4312 } else if (current_function == NULL) {
4313 if (old_storage_class != STORAGE_CLASS_STATIC &&
4314 new_storage_class == STORAGE_CLASS_STATIC) {
4316 "static declaration of '%Y' follows non-static declaration (declared %P)",
4317 symbol, &previous_entity->base.source_position);
4318 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4319 prev_decl->storage_class = STORAGE_CLASS_NONE;
4320 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4322 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4324 goto error_redeclaration;
4325 goto warn_redundant_declaration;
4327 } else if (is_type_valid(prev_type)) {
4328 if (old_storage_class == new_storage_class) {
4329 error_redeclaration:
4330 errorf(pos, "redeclaration of '%Y' (declared %P)",
4331 symbol, &previous_entity->base.source_position);
4334 "redeclaration of '%Y' with different linkage (declared %P)",
4335 symbol, &previous_entity->base.source_position);
4340 prev_decl->modifiers |= decl->modifiers;
4341 if (entity->kind == ENTITY_FUNCTION) {
4342 previous_entity->function.is_inline |= entity->function.is_inline;
4344 return previous_entity;
4347 if (warning.shadow ||
4348 (warning.shadow_local && previous_entity->base.parent_scope != file_scope)) {
4349 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4350 get_entity_kind_name(entity->kind), symbol,
4351 get_entity_kind_name(previous_entity->kind),
4352 &previous_entity->base.source_position);
4356 if (entity->kind == ENTITY_FUNCTION) {
4357 if (is_definition &&
4358 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4359 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4360 warningf(pos, "no previous prototype for '%#T'",
4361 entity->declaration.type, symbol);
4362 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4363 warningf(pos, "no previous declaration for '%#T'",
4364 entity->declaration.type, symbol);
4367 } else if (warning.missing_declarations &&
4368 entity->kind == ENTITY_VARIABLE &&
4369 current_scope == file_scope) {
4370 declaration_t *declaration = &entity->declaration;
4371 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4372 warningf(pos, "no previous declaration for '%#T'",
4373 declaration->type, symbol);
4378 assert(entity->base.parent_scope == NULL);
4379 assert(current_scope != NULL);
4381 entity->base.parent_scope = current_scope;
4382 environment_push(entity);
4383 append_entity(current_scope, entity);
4388 static void parser_error_multiple_definition(entity_t *entity,
4389 const source_position_t *source_position)
4391 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4392 entity->base.symbol, &entity->base.source_position);
4395 static bool is_declaration_specifier(const token_t *token,
4396 bool only_specifiers_qualifiers)
4398 switch (token->type) {
4403 return is_typedef_symbol(token->symbol);
4405 case T___extension__:
4407 return !only_specifiers_qualifiers;
4414 static void parse_init_declarator_rest(entity_t *entity)
4416 type_t *orig_type = type_error_type;
4418 if (entity->base.kind == ENTITY_TYPEDEF) {
4419 errorf(&entity->base.source_position,
4420 "typedef '%Y' is initialized (use __typeof__ instead)",
4421 entity->base.symbol);
4423 assert(is_declaration(entity));
4424 orig_type = entity->declaration.type;
4428 type_t *type = skip_typeref(orig_type);
4430 if (entity->kind == ENTITY_VARIABLE
4431 && entity->variable.initializer != NULL) {
4432 parser_error_multiple_definition(entity, HERE);
4435 declaration_t *const declaration = &entity->declaration;
4436 bool must_be_constant = false;
4437 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4438 entity->base.parent_scope == file_scope) {
4439 must_be_constant = true;
4442 if (is_type_function(type)) {
4443 errorf(&entity->base.source_position,
4444 "function '%#T' is initialized like a variable",
4445 orig_type, entity->base.symbol);
4446 orig_type = type_error_type;
4449 parse_initializer_env_t env;
4450 env.type = orig_type;
4451 env.must_be_constant = must_be_constant;
4452 env.entity = entity;
4453 current_init_decl = entity;
4455 initializer_t *initializer = parse_initializer(&env);
4456 current_init_decl = NULL;
4458 if (entity->kind == ENTITY_VARIABLE) {
4459 /* §6.7.5:22 array initializers for arrays with unknown size
4460 * determine the array type size */
4461 declaration->type = env.type;
4462 entity->variable.initializer = initializer;
4466 /* parse rest of a declaration without any declarator */
4467 static void parse_anonymous_declaration_rest(
4468 const declaration_specifiers_t *specifiers)
4471 anonymous_entity = NULL;
4473 if (warning.other) {
4474 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4475 specifiers->thread_local) {
4476 warningf(&specifiers->source_position,
4477 "useless storage class in empty declaration");
4480 type_t *type = specifiers->type;
4481 switch (type->kind) {
4482 case TYPE_COMPOUND_STRUCT:
4483 case TYPE_COMPOUND_UNION: {
4484 if (type->compound.compound->base.symbol == NULL) {
4485 warningf(&specifiers->source_position,
4486 "unnamed struct/union that defines no instances");
4495 warningf(&specifiers->source_position, "empty declaration");
4501 static void check_variable_type_complete(entity_t *ent)
4503 if (ent->kind != ENTITY_VARIABLE)
4506 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4507 * type for the object shall be complete [...] */
4508 declaration_t *decl = &ent->declaration;
4509 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4510 decl->storage_class == STORAGE_CLASS_STATIC)
4513 type_t *const orig_type = decl->type;
4514 type_t *const type = skip_typeref(orig_type);
4515 if (!is_type_incomplete(type))
4518 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4519 * are given length one. */
4520 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4521 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4525 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4526 orig_type, ent->base.symbol);
4530 static void parse_declaration_rest(entity_t *ndeclaration,
4531 const declaration_specifiers_t *specifiers,
4532 parsed_declaration_func finished_declaration,
4533 declarator_flags_t flags)
4535 add_anchor_token(';');
4536 add_anchor_token(',');
4538 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4540 if (token.type == '=') {
4541 parse_init_declarator_rest(entity);
4542 } else if (entity->kind == ENTITY_VARIABLE) {
4543 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4544 * [...] where the extern specifier is explicitly used. */
4545 declaration_t *decl = &entity->declaration;
4546 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4547 type_t *type = decl->type;
4548 if (is_type_reference(skip_typeref(type))) {
4549 errorf(&entity->base.source_position,
4550 "reference '%#T' must be initialized",
4551 type, entity->base.symbol);
4556 check_variable_type_complete(entity);
4561 add_anchor_token('=');
4562 ndeclaration = parse_declarator(specifiers, flags);
4563 rem_anchor_token('=');
4565 expect(';', end_error);
4568 anonymous_entity = NULL;
4569 rem_anchor_token(';');
4570 rem_anchor_token(',');
4573 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4575 symbol_t *symbol = entity->base.symbol;
4579 assert(entity->base.namespc == NAMESPACE_NORMAL);
4580 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4581 if (previous_entity == NULL
4582 || previous_entity->base.parent_scope != current_scope) {
4583 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4588 if (is_definition) {
4589 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4592 return record_entity(entity, false);
4595 static void parse_declaration(parsed_declaration_func finished_declaration,
4596 declarator_flags_t flags)
4598 add_anchor_token(';');
4599 declaration_specifiers_t specifiers;
4600 parse_declaration_specifiers(&specifiers);
4601 rem_anchor_token(';');
4603 if (token.type == ';') {
4604 parse_anonymous_declaration_rest(&specifiers);
4606 entity_t *entity = parse_declarator(&specifiers, flags);
4607 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4612 static type_t *get_default_promoted_type(type_t *orig_type)
4614 type_t *result = orig_type;
4616 type_t *type = skip_typeref(orig_type);
4617 if (is_type_integer(type)) {
4618 result = promote_integer(type);
4619 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4620 result = type_double;
4626 static void parse_kr_declaration_list(entity_t *entity)
4628 if (entity->kind != ENTITY_FUNCTION)
4631 type_t *type = skip_typeref(entity->declaration.type);
4632 assert(is_type_function(type));
4633 if (!type->function.kr_style_parameters)
4636 add_anchor_token('{');
4638 /* push function parameters */
4639 size_t const top = environment_top();
4640 scope_t *old_scope = scope_push(&entity->function.parameters);
4642 entity_t *parameter = entity->function.parameters.entities;
4643 for ( ; parameter != NULL; parameter = parameter->base.next) {
4644 assert(parameter->base.parent_scope == NULL);
4645 parameter->base.parent_scope = current_scope;
4646 environment_push(parameter);
4649 /* parse declaration list */
4651 switch (token.type) {
4653 case T___extension__:
4654 /* This covers symbols, which are no type, too, and results in
4655 * better error messages. The typical cases are misspelled type
4656 * names and missing includes. */
4658 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4666 /* pop function parameters */
4667 assert(current_scope == &entity->function.parameters);
4668 scope_pop(old_scope);
4669 environment_pop_to(top);
4671 /* update function type */
4672 type_t *new_type = duplicate_type(type);
4674 function_parameter_t *parameters = NULL;
4675 function_parameter_t **anchor = ¶meters;
4677 /* did we have an earlier prototype? */
4678 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4679 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4682 function_parameter_t *proto_parameter = NULL;
4683 if (proto_type != NULL) {
4684 type_t *proto_type_type = proto_type->declaration.type;
4685 proto_parameter = proto_type_type->function.parameters;
4686 /* If a K&R function definition has a variadic prototype earlier, then
4687 * make the function definition variadic, too. This should conform to
4688 * §6.7.5.3:15 and §6.9.1:8. */
4689 new_type->function.variadic = proto_type_type->function.variadic;
4691 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4693 new_type->function.unspecified_parameters = true;
4696 bool need_incompatible_warning = false;
4697 parameter = entity->function.parameters.entities;
4698 for (; parameter != NULL; parameter = parameter->base.next,
4700 proto_parameter == NULL ? NULL : proto_parameter->next) {
4701 if (parameter->kind != ENTITY_PARAMETER)
4704 type_t *parameter_type = parameter->declaration.type;
4705 if (parameter_type == NULL) {
4707 errorf(HERE, "no type specified for function parameter '%Y'",
4708 parameter->base.symbol);
4709 parameter_type = type_error_type;
4711 if (warning.implicit_int) {
4712 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4713 parameter->base.symbol);
4715 parameter_type = type_int;
4717 parameter->declaration.type = parameter_type;
4720 semantic_parameter_incomplete(parameter);
4722 /* we need the default promoted types for the function type */
4723 type_t *not_promoted = parameter_type;
4724 parameter_type = get_default_promoted_type(parameter_type);
4726 /* gcc special: if the type of the prototype matches the unpromoted
4727 * type don't promote */
4728 if (!strict_mode && proto_parameter != NULL) {
4729 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4730 type_t *promo_skip = skip_typeref(parameter_type);
4731 type_t *param_skip = skip_typeref(not_promoted);
4732 if (!types_compatible(proto_p_type, promo_skip)
4733 && types_compatible(proto_p_type, param_skip)) {
4735 need_incompatible_warning = true;
4736 parameter_type = not_promoted;
4739 function_parameter_t *const parameter
4740 = allocate_parameter(parameter_type);
4742 *anchor = parameter;
4743 anchor = ¶meter->next;
4746 new_type->function.parameters = parameters;
4747 new_type = identify_new_type(new_type);
4749 if (warning.other && need_incompatible_warning) {
4750 type_t *proto_type_type = proto_type->declaration.type;
4752 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4753 proto_type_type, proto_type->base.symbol,
4754 new_type, entity->base.symbol,
4755 &proto_type->base.source_position);
4758 entity->declaration.type = new_type;
4760 rem_anchor_token('{');
4763 static bool first_err = true;
4766 * When called with first_err set, prints the name of the current function,
4769 static void print_in_function(void)
4773 diagnosticf("%s: In function '%Y':\n",
4774 current_function->base.base.source_position.input_name,
4775 current_function->base.base.symbol);
4780 * Check if all labels are defined in the current function.
4781 * Check if all labels are used in the current function.
4783 static void check_labels(void)
4785 for (const goto_statement_t *goto_statement = goto_first;
4786 goto_statement != NULL;
4787 goto_statement = goto_statement->next) {
4788 /* skip computed gotos */
4789 if (goto_statement->expression != NULL)
4792 label_t *label = goto_statement->label;
4793 if (label->base.source_position.input_name == NULL) {
4794 print_in_function();
4795 errorf(&goto_statement->base.source_position,
4796 "label '%Y' used but not defined", label->base.symbol);
4800 if (warning.unused_label) {
4801 for (const label_statement_t *label_statement = label_first;
4802 label_statement != NULL;
4803 label_statement = label_statement->next) {
4804 label_t *label = label_statement->label;
4806 if (! label->used) {
4807 print_in_function();
4808 warningf(&label_statement->base.source_position,
4809 "label '%Y' defined but not used", label->base.symbol);
4815 static void warn_unused_entity(entity_t *entity, entity_t *last)
4817 entity_t const *const end = last != NULL ? last->base.next : NULL;
4818 for (; entity != end; entity = entity->base.next) {
4819 if (!is_declaration(entity))
4822 declaration_t *declaration = &entity->declaration;
4823 if (declaration->implicit)
4826 if (!declaration->used) {
4827 print_in_function();
4828 const char *what = get_entity_kind_name(entity->kind);
4829 warningf(&entity->base.source_position, "%s '%Y' is unused",
4830 what, entity->base.symbol);
4831 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4832 print_in_function();
4833 const char *what = get_entity_kind_name(entity->kind);
4834 warningf(&entity->base.source_position, "%s '%Y' is never read",
4835 what, entity->base.symbol);
4840 static void check_unused_variables(statement_t *const stmt, void *const env)
4844 switch (stmt->kind) {
4845 case STATEMENT_DECLARATION: {
4846 declaration_statement_t const *const decls = &stmt->declaration;
4847 warn_unused_entity(decls->declarations_begin,
4848 decls->declarations_end);
4853 warn_unused_entity(stmt->fors.scope.entities, NULL);
4862 * Check declarations of current_function for unused entities.
4864 static void check_declarations(void)
4866 if (warning.unused_parameter) {
4867 const scope_t *scope = ¤t_function->parameters;
4869 /* do not issue unused warnings for main */
4870 if (!is_sym_main(current_function->base.base.symbol)) {
4871 warn_unused_entity(scope->entities, NULL);
4874 if (warning.unused_variable) {
4875 walk_statements(current_function->statement, check_unused_variables,
4880 static int determine_truth(expression_t const* const cond)
4883 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4884 fold_constant_to_bool(cond) ? 1 :
4888 static void check_reachable(statement_t *);
4889 static bool reaches_end;
4891 static bool expression_returns(expression_t const *const expr)
4893 switch (expr->kind) {
4895 expression_t const *const func = expr->call.function;
4896 if (func->kind == EXPR_REFERENCE) {
4897 entity_t *entity = func->reference.entity;
4898 if (entity->kind == ENTITY_FUNCTION
4899 && entity->declaration.modifiers & DM_NORETURN)
4903 if (!expression_returns(func))
4906 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4907 if (!expression_returns(arg->expression))
4914 case EXPR_REFERENCE:
4915 case EXPR_REFERENCE_ENUM_VALUE:
4917 case EXPR_STRING_LITERAL:
4918 case EXPR_WIDE_STRING_LITERAL:
4919 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4920 case EXPR_LABEL_ADDRESS:
4921 case EXPR_CLASSIFY_TYPE:
4922 case EXPR_SIZEOF: // TODO handle obscure VLA case
4925 case EXPR_BUILTIN_CONSTANT_P:
4926 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4931 case EXPR_STATEMENT: {
4932 bool old_reaches_end = reaches_end;
4933 reaches_end = false;
4934 check_reachable(expr->statement.statement);
4935 bool returns = reaches_end;
4936 reaches_end = old_reaches_end;
4940 case EXPR_CONDITIONAL:
4941 // TODO handle constant expression
4943 if (!expression_returns(expr->conditional.condition))
4946 if (expr->conditional.true_expression != NULL
4947 && expression_returns(expr->conditional.true_expression))
4950 return expression_returns(expr->conditional.false_expression);
4953 return expression_returns(expr->select.compound);
4955 case EXPR_ARRAY_ACCESS:
4957 expression_returns(expr->array_access.array_ref) &&
4958 expression_returns(expr->array_access.index);
4961 return expression_returns(expr->va_starte.ap);
4964 return expression_returns(expr->va_arge.ap);
4967 return expression_returns(expr->va_copye.src);
4969 EXPR_UNARY_CASES_MANDATORY
4970 return expression_returns(expr->unary.value);
4972 case EXPR_UNARY_THROW:
4976 // TODO handle constant lhs of && and ||
4978 expression_returns(expr->binary.left) &&
4979 expression_returns(expr->binary.right);
4985 panic("unhandled expression");
4988 static bool initializer_returns(initializer_t const *const init)
4990 switch (init->kind) {
4991 case INITIALIZER_VALUE:
4992 return expression_returns(init->value.value);
4994 case INITIALIZER_LIST: {
4995 initializer_t * const* i = init->list.initializers;
4996 initializer_t * const* const end = i + init->list.len;
4997 bool returns = true;
4998 for (; i != end; ++i) {
4999 if (!initializer_returns(*i))
5005 case INITIALIZER_STRING:
5006 case INITIALIZER_WIDE_STRING:
5007 case INITIALIZER_DESIGNATOR: // designators have no payload
5010 panic("unhandled initializer");
5013 static bool noreturn_candidate;
5015 static void check_reachable(statement_t *const stmt)
5017 if (stmt->base.reachable)
5019 if (stmt->kind != STATEMENT_DO_WHILE)
5020 stmt->base.reachable = true;
5022 statement_t *last = stmt;
5024 switch (stmt->kind) {
5025 case STATEMENT_INVALID:
5026 case STATEMENT_EMPTY:
5028 next = stmt->base.next;
5031 case STATEMENT_DECLARATION: {
5032 declaration_statement_t const *const decl = &stmt->declaration;
5033 entity_t const * ent = decl->declarations_begin;
5034 entity_t const *const last = decl->declarations_end;
5036 for (;; ent = ent->base.next) {
5037 if (ent->kind == ENTITY_VARIABLE &&
5038 ent->variable.initializer != NULL &&
5039 !initializer_returns(ent->variable.initializer)) {
5046 next = stmt->base.next;
5050 case STATEMENT_COMPOUND:
5051 next = stmt->compound.statements;
5053 next = stmt->base.next;
5056 case STATEMENT_RETURN: {
5057 expression_t const *const val = stmt->returns.value;
5058 if (val == NULL || expression_returns(val))
5059 noreturn_candidate = false;
5063 case STATEMENT_IF: {
5064 if_statement_t const *const ifs = &stmt->ifs;
5065 expression_t const *const cond = ifs->condition;
5067 if (!expression_returns(cond))
5070 int const val = determine_truth(cond);
5073 check_reachable(ifs->true_statement);
5078 if (ifs->false_statement != NULL) {
5079 check_reachable(ifs->false_statement);
5083 next = stmt->base.next;
5087 case STATEMENT_SWITCH: {
5088 switch_statement_t const *const switchs = &stmt->switchs;
5089 expression_t const *const expr = switchs->expression;
5091 if (!expression_returns(expr))
5094 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
5095 long const val = fold_constant_to_int(expr);
5096 case_label_statement_t * defaults = NULL;
5097 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5098 if (i->expression == NULL) {
5103 if (i->first_case <= val && val <= i->last_case) {
5104 check_reachable((statement_t*)i);
5109 if (defaults != NULL) {
5110 check_reachable((statement_t*)defaults);
5114 bool has_default = false;
5115 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5116 if (i->expression == NULL)
5119 check_reachable((statement_t*)i);
5126 next = stmt->base.next;
5130 case STATEMENT_EXPRESSION: {
5131 /* Check for noreturn function call */
5132 expression_t const *const expr = stmt->expression.expression;
5133 if (!expression_returns(expr))
5136 next = stmt->base.next;
5140 case STATEMENT_CONTINUE:
5141 for (statement_t *parent = stmt;;) {
5142 parent = parent->base.parent;
5143 if (parent == NULL) /* continue not within loop */
5147 switch (parent->kind) {
5148 case STATEMENT_WHILE: goto continue_while;
5149 case STATEMENT_DO_WHILE: goto continue_do_while;
5150 case STATEMENT_FOR: goto continue_for;
5156 case STATEMENT_BREAK:
5157 for (statement_t *parent = stmt;;) {
5158 parent = parent->base.parent;
5159 if (parent == NULL) /* break not within loop/switch */
5162 switch (parent->kind) {
5163 case STATEMENT_SWITCH:
5164 case STATEMENT_WHILE:
5165 case STATEMENT_DO_WHILE:
5168 next = parent->base.next;
5169 goto found_break_parent;
5177 case STATEMENT_GOTO:
5178 if (stmt->gotos.expression) {
5179 if (!expression_returns(stmt->gotos.expression))
5182 statement_t *parent = stmt->base.parent;
5183 if (parent == NULL) /* top level goto */
5187 next = stmt->gotos.label->statement;
5188 if (next == NULL) /* missing label */
5193 case STATEMENT_LABEL:
5194 next = stmt->label.statement;
5197 case STATEMENT_CASE_LABEL:
5198 next = stmt->case_label.statement;
5201 case STATEMENT_WHILE: {
5202 while_statement_t const *const whiles = &stmt->whiles;
5203 expression_t const *const cond = whiles->condition;
5205 if (!expression_returns(cond))
5208 int const val = determine_truth(cond);
5211 check_reachable(whiles->body);
5216 next = stmt->base.next;
5220 case STATEMENT_DO_WHILE:
5221 next = stmt->do_while.body;
5224 case STATEMENT_FOR: {
5225 for_statement_t *const fors = &stmt->fors;
5227 if (fors->condition_reachable)
5229 fors->condition_reachable = true;
5231 expression_t const *const cond = fors->condition;
5236 } else if (expression_returns(cond)) {
5237 val = determine_truth(cond);
5243 check_reachable(fors->body);
5248 next = stmt->base.next;
5252 case STATEMENT_MS_TRY: {
5253 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5254 check_reachable(ms_try->try_statement);
5255 next = ms_try->final_statement;
5259 case STATEMENT_LEAVE: {
5260 statement_t *parent = stmt;
5262 parent = parent->base.parent;
5263 if (parent == NULL) /* __leave not within __try */
5266 if (parent->kind == STATEMENT_MS_TRY) {
5268 next = parent->ms_try.final_statement;
5276 panic("invalid statement kind");
5279 while (next == NULL) {
5280 next = last->base.parent;
5282 noreturn_candidate = false;
5284 type_t *const type = skip_typeref(current_function->base.type);
5285 assert(is_type_function(type));
5286 type_t *const ret = skip_typeref(type->function.return_type);
5287 if (warning.return_type &&
5288 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5289 is_type_valid(ret) &&
5290 !is_sym_main(current_function->base.base.symbol)) {
5291 warningf(&stmt->base.source_position,
5292 "control reaches end of non-void function");
5297 switch (next->kind) {
5298 case STATEMENT_INVALID:
5299 case STATEMENT_EMPTY:
5300 case STATEMENT_DECLARATION:
5301 case STATEMENT_EXPRESSION:
5303 case STATEMENT_RETURN:
5304 case STATEMENT_CONTINUE:
5305 case STATEMENT_BREAK:
5306 case STATEMENT_GOTO:
5307 case STATEMENT_LEAVE:
5308 panic("invalid control flow in function");
5310 case STATEMENT_COMPOUND:
5311 if (next->compound.stmt_expr) {
5317 case STATEMENT_SWITCH:
5318 case STATEMENT_LABEL:
5319 case STATEMENT_CASE_LABEL:
5321 next = next->base.next;
5324 case STATEMENT_WHILE: {
5326 if (next->base.reachable)
5328 next->base.reachable = true;
5330 while_statement_t const *const whiles = &next->whiles;
5331 expression_t const *const cond = whiles->condition;
5333 if (!expression_returns(cond))
5336 int const val = determine_truth(cond);
5339 check_reachable(whiles->body);
5345 next = next->base.next;
5349 case STATEMENT_DO_WHILE: {
5351 if (next->base.reachable)
5353 next->base.reachable = true;
5355 do_while_statement_t const *const dw = &next->do_while;
5356 expression_t const *const cond = dw->condition;
5358 if (!expression_returns(cond))
5361 int const val = determine_truth(cond);
5364 check_reachable(dw->body);
5370 next = next->base.next;
5374 case STATEMENT_FOR: {
5376 for_statement_t *const fors = &next->fors;
5378 fors->step_reachable = true;
5380 if (fors->condition_reachable)
5382 fors->condition_reachable = true;
5384 expression_t const *const cond = fors->condition;
5389 } else if (expression_returns(cond)) {
5390 val = determine_truth(cond);
5396 check_reachable(fors->body);
5402 next = next->base.next;
5406 case STATEMENT_MS_TRY:
5408 next = next->ms_try.final_statement;
5413 check_reachable(next);
5416 static void check_unreachable(statement_t* const stmt, void *const env)
5420 switch (stmt->kind) {
5421 case STATEMENT_DO_WHILE:
5422 if (!stmt->base.reachable) {
5423 expression_t const *const cond = stmt->do_while.condition;
5424 if (determine_truth(cond) >= 0) {
5425 warningf(&cond->base.source_position,
5426 "condition of do-while-loop is unreachable");
5431 case STATEMENT_FOR: {
5432 for_statement_t const* const fors = &stmt->fors;
5434 // if init and step are unreachable, cond is unreachable, too
5435 if (!stmt->base.reachable && !fors->step_reachable) {
5436 warningf(&stmt->base.source_position, "statement is unreachable");
5438 if (!stmt->base.reachable && fors->initialisation != NULL) {
5439 warningf(&fors->initialisation->base.source_position,
5440 "initialisation of for-statement is unreachable");
5443 if (!fors->condition_reachable && fors->condition != NULL) {
5444 warningf(&fors->condition->base.source_position,
5445 "condition of for-statement is unreachable");
5448 if (!fors->step_reachable && fors->step != NULL) {
5449 warningf(&fors->step->base.source_position,
5450 "step of for-statement is unreachable");
5456 case STATEMENT_COMPOUND:
5457 if (stmt->compound.statements != NULL)
5459 goto warn_unreachable;
5461 case STATEMENT_DECLARATION: {
5462 /* Only warn if there is at least one declarator with an initializer.
5463 * This typically occurs in switch statements. */
5464 declaration_statement_t const *const decl = &stmt->declaration;
5465 entity_t const * ent = decl->declarations_begin;
5466 entity_t const *const last = decl->declarations_end;
5468 for (;; ent = ent->base.next) {
5469 if (ent->kind == ENTITY_VARIABLE &&
5470 ent->variable.initializer != NULL) {
5471 goto warn_unreachable;
5481 if (!stmt->base.reachable)
5482 warningf(&stmt->base.source_position, "statement is unreachable");
5487 static void parse_external_declaration(void)
5489 /* function-definitions and declarations both start with declaration
5491 add_anchor_token(';');
5492 declaration_specifiers_t specifiers;
5493 parse_declaration_specifiers(&specifiers);
5494 rem_anchor_token(';');
5496 /* must be a declaration */
5497 if (token.type == ';') {
5498 parse_anonymous_declaration_rest(&specifiers);
5502 add_anchor_token(',');
5503 add_anchor_token('=');
5504 add_anchor_token(';');
5505 add_anchor_token('{');
5507 /* declarator is common to both function-definitions and declarations */
5508 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5510 rem_anchor_token('{');
5511 rem_anchor_token(';');
5512 rem_anchor_token('=');
5513 rem_anchor_token(',');
5515 /* must be a declaration */
5516 switch (token.type) {
5520 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5525 /* must be a function definition */
5526 parse_kr_declaration_list(ndeclaration);
5528 if (token.type != '{') {
5529 parse_error_expected("while parsing function definition", '{', NULL);
5530 eat_until_matching_token(';');
5534 assert(is_declaration(ndeclaration));
5535 type_t *const orig_type = ndeclaration->declaration.type;
5536 type_t * type = skip_typeref(orig_type);
5538 if (!is_type_function(type)) {
5539 if (is_type_valid(type)) {
5540 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5541 type, ndeclaration->base.symbol);
5545 } else if (is_typeref(orig_type)) {
5547 errorf(&ndeclaration->base.source_position,
5548 "type of function definition '%#T' is a typedef",
5549 orig_type, ndeclaration->base.symbol);
5552 if (warning.aggregate_return &&
5553 is_type_compound(skip_typeref(type->function.return_type))) {
5554 warningf(&ndeclaration->base.source_position, "function '%Y' returns an aggregate",
5555 ndeclaration->base.symbol);
5557 if (warning.traditional && !type->function.unspecified_parameters) {
5558 warningf(&ndeclaration->base.source_position, "traditional C rejects ISO C style function definition of function '%Y'",
5559 ndeclaration->base.symbol);
5561 if (warning.old_style_definition && type->function.unspecified_parameters) {
5562 warningf(&ndeclaration->base.source_position, "old-style function definition '%Y'",
5563 ndeclaration->base.symbol);
5566 /* §6.7.5.3:14 a function definition with () means no
5567 * parameters (and not unspecified parameters) */
5568 if (type->function.unspecified_parameters &&
5569 type->function.parameters == NULL) {
5570 type_t *copy = duplicate_type(type);
5571 copy->function.unspecified_parameters = false;
5572 type = identify_new_type(copy);
5574 ndeclaration->declaration.type = type;
5577 entity_t *const entity = record_entity(ndeclaration, true);
5578 assert(entity->kind == ENTITY_FUNCTION);
5579 assert(ndeclaration->kind == ENTITY_FUNCTION);
5581 function_t *const function = &entity->function;
5582 if (ndeclaration != entity) {
5583 function->parameters = ndeclaration->function.parameters;
5585 assert(is_declaration(entity));
5586 type = skip_typeref(entity->declaration.type);
5588 /* push function parameters and switch scope */
5589 size_t const top = environment_top();
5590 scope_t *old_scope = scope_push(&function->parameters);
5592 entity_t *parameter = function->parameters.entities;
5593 for (; parameter != NULL; parameter = parameter->base.next) {
5594 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5595 parameter->base.parent_scope = current_scope;
5597 assert(parameter->base.parent_scope == NULL
5598 || parameter->base.parent_scope == current_scope);
5599 parameter->base.parent_scope = current_scope;
5600 if (parameter->base.symbol == NULL) {
5601 errorf(¶meter->base.source_position, "parameter name omitted");
5604 environment_push(parameter);
5607 if (function->statement != NULL) {
5608 parser_error_multiple_definition(entity, HERE);
5611 /* parse function body */
5612 int label_stack_top = label_top();
5613 function_t *old_current_function = current_function;
5614 entity_t *old_current_entity = current_entity;
5615 current_function = function;
5616 current_entity = entity;
5617 current_parent = NULL;
5620 goto_anchor = &goto_first;
5622 label_anchor = &label_first;
5624 statement_t *const body = parse_compound_statement(false);
5625 function->statement = body;
5628 check_declarations();
5629 if (warning.return_type ||
5630 warning.unreachable_code ||
5631 (warning.missing_noreturn
5632 && !(function->base.modifiers & DM_NORETURN))) {
5633 noreturn_candidate = true;
5634 check_reachable(body);
5635 if (warning.unreachable_code)
5636 walk_statements(body, check_unreachable, NULL);
5637 if (warning.missing_noreturn &&
5638 noreturn_candidate &&
5639 !(function->base.modifiers & DM_NORETURN)) {
5640 warningf(&body->base.source_position,
5641 "function '%#T' is candidate for attribute 'noreturn'",
5642 type, entity->base.symbol);
5646 assert(current_parent == NULL);
5647 assert(current_function == function);
5648 assert(current_entity == entity);
5649 current_entity = old_current_entity;
5650 current_function = old_current_function;
5651 label_pop_to(label_stack_top);
5654 assert(current_scope == &function->parameters);
5655 scope_pop(old_scope);
5656 environment_pop_to(top);
5659 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5660 source_position_t *source_position,
5661 const symbol_t *symbol)
5663 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5665 type->bitfield.base_type = base_type;
5666 type->bitfield.size_expression = size;
5669 type_t *skipped_type = skip_typeref(base_type);
5670 if (!is_type_integer(skipped_type)) {
5671 errorf(HERE, "bitfield base type '%T' is not an integer type",
5675 bit_size = get_type_size(base_type) * 8;
5678 if (is_constant_expression(size) == EXPR_CLASS_CONSTANT) {
5679 long v = fold_constant_to_int(size);
5680 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5683 errorf(source_position, "negative width in bit-field '%Y'",
5685 } else if (v == 0 && symbol != NULL) {
5686 errorf(source_position, "zero width for bit-field '%Y'",
5688 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5689 errorf(source_position, "width of '%Y' exceeds its type",
5692 type->bitfield.bit_size = v;
5699 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5701 entity_t *iter = compound->members.entities;
5702 for (; iter != NULL; iter = iter->base.next) {
5703 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5706 if (iter->base.symbol == symbol) {
5708 } else if (iter->base.symbol == NULL) {
5709 /* search in anonymous structs and unions */
5710 type_t *type = skip_typeref(iter->declaration.type);
5711 if (is_type_compound(type)) {
5712 if (find_compound_entry(type->compound.compound, symbol)
5723 static void check_deprecated(const source_position_t *source_position,
5724 const entity_t *entity)
5726 if (!warning.deprecated_declarations)
5728 if (!is_declaration(entity))
5730 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5733 char const *const prefix = get_entity_kind_name(entity->kind);
5734 const char *deprecated_string
5735 = get_deprecated_string(entity->declaration.attributes);
5736 if (deprecated_string != NULL) {
5737 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5738 prefix, entity->base.symbol, &entity->base.source_position,
5741 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5742 entity->base.symbol, &entity->base.source_position);
5747 static expression_t *create_select(const source_position_t *pos,
5749 type_qualifiers_t qualifiers,
5752 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5754 check_deprecated(pos, entry);
5756 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5757 select->select.compound = addr;
5758 select->select.compound_entry = entry;
5760 type_t *entry_type = entry->declaration.type;
5761 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5763 /* we always do the auto-type conversions; the & and sizeof parser contains
5764 * code to revert this! */
5765 select->base.type = automatic_type_conversion(res_type);
5766 if (res_type->kind == TYPE_BITFIELD) {
5767 select->base.type = res_type->bitfield.base_type;
5774 * Find entry with symbol in compound. Search anonymous structs and unions and
5775 * creates implicit select expressions for them.
5776 * Returns the adress for the innermost compound.
5778 static expression_t *find_create_select(const source_position_t *pos,
5780 type_qualifiers_t qualifiers,
5781 compound_t *compound, symbol_t *symbol)
5783 entity_t *iter = compound->members.entities;
5784 for (; iter != NULL; iter = iter->base.next) {
5785 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5788 symbol_t *iter_symbol = iter->base.symbol;
5789 if (iter_symbol == NULL) {
5790 type_t *type = iter->declaration.type;
5791 if (type->kind != TYPE_COMPOUND_STRUCT
5792 && type->kind != TYPE_COMPOUND_UNION)
5795 compound_t *sub_compound = type->compound.compound;
5797 if (find_compound_entry(sub_compound, symbol) == NULL)
5800 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5801 sub_addr->base.source_position = *pos;
5802 sub_addr->select.implicit = true;
5803 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5807 if (iter_symbol == symbol) {
5808 return create_select(pos, addr, qualifiers, iter);
5815 static void parse_compound_declarators(compound_t *compound,
5816 const declaration_specifiers_t *specifiers)
5821 if (token.type == ':') {
5822 source_position_t source_position = *HERE;
5825 type_t *base_type = specifiers->type;
5826 expression_t *size = parse_constant_expression();
5828 type_t *type = make_bitfield_type(base_type, size,
5829 &source_position, NULL);
5831 attribute_t *attributes = parse_attributes(NULL);
5832 attribute_t **anchor = &attributes;
5833 while (*anchor != NULL)
5834 anchor = &(*anchor)->next;
5835 *anchor = specifiers->attributes;
5837 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, NULL);
5838 entity->base.source_position = source_position;
5839 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5840 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5841 entity->declaration.type = type;
5842 entity->declaration.attributes = attributes;
5844 if (attributes != NULL) {
5845 handle_entity_attributes(attributes, entity);
5847 append_entity(&compound->members, entity);
5849 entity = parse_declarator(specifiers,
5850 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5851 if (entity->kind == ENTITY_TYPEDEF) {
5852 errorf(&entity->base.source_position,
5853 "typedef not allowed as compound member");
5855 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5857 /* make sure we don't define a symbol multiple times */
5858 symbol_t *symbol = entity->base.symbol;
5859 if (symbol != NULL) {
5860 entity_t *prev = find_compound_entry(compound, symbol);
5862 errorf(&entity->base.source_position,
5863 "multiple declarations of symbol '%Y' (declared %P)",
5864 symbol, &prev->base.source_position);
5868 if (token.type == ':') {
5869 source_position_t source_position = *HERE;
5871 expression_t *size = parse_constant_expression();
5873 type_t *type = entity->declaration.type;
5874 type_t *bitfield_type = make_bitfield_type(type, size,
5875 &source_position, entity->base.symbol);
5877 attribute_t *attributes = parse_attributes(NULL);
5878 entity->declaration.type = bitfield_type;
5879 handle_entity_attributes(attributes, entity);
5881 type_t *orig_type = entity->declaration.type;
5882 type_t *type = skip_typeref(orig_type);
5883 if (is_type_function(type)) {
5884 errorf(&entity->base.source_position,
5885 "compound member '%Y' must not have function type '%T'",
5886 entity->base.symbol, orig_type);
5887 } else if (is_type_incomplete(type)) {
5888 /* §6.7.2.1:16 flexible array member */
5889 if (!is_type_array(type) ||
5890 token.type != ';' ||
5891 look_ahead(1)->type != '}') {
5892 errorf(&entity->base.source_position,
5893 "compound member '%Y' has incomplete type '%T'",
5894 entity->base.symbol, orig_type);
5899 append_entity(&compound->members, entity);
5902 } while (next_if(','));
5903 expect(';', end_error);
5906 anonymous_entity = NULL;
5909 static void parse_compound_type_entries(compound_t *compound)
5912 add_anchor_token('}');
5914 while (token.type != '}') {
5915 if (token.type == T_EOF) {
5916 errorf(HERE, "EOF while parsing struct");
5919 declaration_specifiers_t specifiers;
5920 parse_declaration_specifiers(&specifiers);
5921 parse_compound_declarators(compound, &specifiers);
5923 rem_anchor_token('}');
5927 compound->complete = true;
5930 static type_t *parse_typename(void)
5932 declaration_specifiers_t specifiers;
5933 parse_declaration_specifiers(&specifiers);
5934 if (specifiers.storage_class != STORAGE_CLASS_NONE
5935 || specifiers.thread_local) {
5936 /* TODO: improve error message, user does probably not know what a
5937 * storage class is...
5939 errorf(HERE, "typename must not have a storage class");
5942 type_t *result = parse_abstract_declarator(specifiers.type);
5950 typedef expression_t* (*parse_expression_function)(void);
5951 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5953 typedef struct expression_parser_function_t expression_parser_function_t;
5954 struct expression_parser_function_t {
5955 parse_expression_function parser;
5956 precedence_t infix_precedence;
5957 parse_expression_infix_function infix_parser;
5960 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5963 * Prints an error message if an expression was expected but not read
5965 static expression_t *expected_expression_error(void)
5967 /* skip the error message if the error token was read */
5968 if (token.type != T_ERROR) {
5969 errorf(HERE, "expected expression, got token %K", &token);
5973 return create_invalid_expression();
5976 static type_t *get_string_type(void)
5978 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
5981 static type_t *get_wide_string_type(void)
5983 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5987 * Parse a string constant.
5989 static expression_t *parse_string_literal(void)
5991 source_position_t begin = token.source_position;
5992 string_t res = token.literal;
5993 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
5996 while (token.type == T_STRING_LITERAL
5997 || token.type == T_WIDE_STRING_LITERAL) {
5998 warn_string_concat(&token.source_position);
5999 res = concat_strings(&res, &token.literal);
6001 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6004 expression_t *literal;
6006 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6007 literal->base.type = get_wide_string_type();
6009 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6010 literal->base.type = get_string_type();
6012 literal->base.source_position = begin;
6013 literal->literal.value = res;
6019 * Parse a boolean constant.
6021 static expression_t *parse_boolean_literal(bool value)
6023 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6024 literal->base.source_position = token.source_position;
6025 literal->base.type = type_bool;
6026 literal->literal.value.begin = value ? "true" : "false";
6027 literal->literal.value.size = value ? 4 : 5;
6033 static void warn_traditional_suffix(void)
6035 if (!warning.traditional)
6037 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6041 static void check_integer_suffix(void)
6043 symbol_t *suffix = token.symbol;
6047 bool not_traditional = false;
6048 const char *c = suffix->string;
6049 if (*c == 'l' || *c == 'L') {
6052 not_traditional = true;
6054 if (*c == 'u' || *c == 'U') {
6057 } else if (*c == 'u' || *c == 'U') {
6058 not_traditional = true;
6061 } else if (*c == 'u' || *c == 'U') {
6062 not_traditional = true;
6064 if (*c == 'l' || *c == 'L') {
6072 errorf(&token.source_position,
6073 "invalid suffix '%s' on integer constant", suffix->string);
6074 } else if (not_traditional) {
6075 warn_traditional_suffix();
6079 static type_t *check_floatingpoint_suffix(void)
6081 symbol_t *suffix = token.symbol;
6082 type_t *type = type_double;
6086 bool not_traditional = false;
6087 const char *c = suffix->string;
6088 if (*c == 'f' || *c == 'F') {
6091 } else if (*c == 'l' || *c == 'L') {
6093 type = type_long_double;
6096 errorf(&token.source_position,
6097 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6098 } else if (not_traditional) {
6099 warn_traditional_suffix();
6106 * Parse an integer constant.
6108 static expression_t *parse_number_literal(void)
6110 expression_kind_t kind;
6113 switch (token.type) {
6115 kind = EXPR_LITERAL_INTEGER;
6116 check_integer_suffix();
6119 case T_INTEGER_OCTAL:
6120 kind = EXPR_LITERAL_INTEGER_OCTAL;
6121 check_integer_suffix();
6124 case T_INTEGER_HEXADECIMAL:
6125 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6126 check_integer_suffix();
6129 case T_FLOATINGPOINT:
6130 kind = EXPR_LITERAL_FLOATINGPOINT;
6131 type = check_floatingpoint_suffix();
6133 case T_FLOATINGPOINT_HEXADECIMAL:
6134 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6135 type = check_floatingpoint_suffix();
6138 panic("unexpected token type in parse_number_literal");
6141 expression_t *literal = allocate_expression_zero(kind);
6142 literal->base.source_position = token.source_position;
6143 literal->base.type = type;
6144 literal->literal.value = token.literal;
6145 literal->literal.suffix = token.symbol;
6148 /* integer type depends on the size of the number and the size
6149 * representable by the types. The backend/codegeneration has to determine
6152 determine_literal_type(&literal->literal);
6157 * Parse a character constant.
6159 static expression_t *parse_character_constant(void)
6161 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6162 literal->base.source_position = token.source_position;
6163 literal->base.type = c_mode & _CXX ? type_char : type_int;
6164 literal->literal.value = token.literal;
6166 size_t len = literal->literal.value.size;
6168 if (!GNU_MODE && !(c_mode & _C99)) {
6169 errorf(HERE, "more than 1 character in character constant");
6170 } else if (warning.multichar) {
6171 literal->base.type = type_int;
6172 warningf(HERE, "multi-character character constant");
6181 * Parse a wide character constant.
6183 static expression_t *parse_wide_character_constant(void)
6185 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6186 literal->base.source_position = token.source_position;
6187 literal->base.type = type_int;
6188 literal->literal.value = token.literal;
6190 size_t len = wstrlen(&literal->literal.value);
6192 warningf(HERE, "multi-character character constant");
6199 static entity_t *create_implicit_function(symbol_t *symbol,
6200 const source_position_t *source_position)
6202 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6203 ntype->function.return_type = type_int;
6204 ntype->function.unspecified_parameters = true;
6205 ntype->function.linkage = LINKAGE_C;
6206 type_t *type = identify_new_type(ntype);
6208 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6209 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6210 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6211 entity->declaration.type = type;
6212 entity->declaration.implicit = true;
6213 entity->base.source_position = *source_position;
6215 if (current_scope != NULL) {
6216 bool strict_prototypes_old = warning.strict_prototypes;
6217 warning.strict_prototypes = false;
6218 record_entity(entity, false);
6219 warning.strict_prototypes = strict_prototypes_old;
6226 * Performs automatic type cast as described in §6.3.2.1.
6228 * @param orig_type the original type
6230 static type_t *automatic_type_conversion(type_t *orig_type)
6232 type_t *type = skip_typeref(orig_type);
6233 if (is_type_array(type)) {
6234 array_type_t *array_type = &type->array;
6235 type_t *element_type = array_type->element_type;
6236 unsigned qualifiers = array_type->base.qualifiers;
6238 return make_pointer_type(element_type, qualifiers);
6241 if (is_type_function(type)) {
6242 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6249 * reverts the automatic casts of array to pointer types and function
6250 * to function-pointer types as defined §6.3.2.1
6252 type_t *revert_automatic_type_conversion(const expression_t *expression)
6254 switch (expression->kind) {
6255 case EXPR_REFERENCE: {
6256 entity_t *entity = expression->reference.entity;
6257 if (is_declaration(entity)) {
6258 return entity->declaration.type;
6259 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6260 return entity->enum_value.enum_type;
6262 panic("no declaration or enum in reference");
6267 entity_t *entity = expression->select.compound_entry;
6268 assert(is_declaration(entity));
6269 type_t *type = entity->declaration.type;
6270 return get_qualified_type(type,
6271 expression->base.type->base.qualifiers);
6274 case EXPR_UNARY_DEREFERENCE: {
6275 const expression_t *const value = expression->unary.value;
6276 type_t *const type = skip_typeref(value->base.type);
6277 if (!is_type_pointer(type))
6278 return type_error_type;
6279 return type->pointer.points_to;
6282 case EXPR_ARRAY_ACCESS: {
6283 const expression_t *array_ref = expression->array_access.array_ref;
6284 type_t *type_left = skip_typeref(array_ref->base.type);
6285 if (!is_type_pointer(type_left))
6286 return type_error_type;
6287 return type_left->pointer.points_to;
6290 case EXPR_STRING_LITERAL: {
6291 size_t size = expression->string_literal.value.size;
6292 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6295 case EXPR_WIDE_STRING_LITERAL: {
6296 size_t size = wstrlen(&expression->string_literal.value);
6297 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6300 case EXPR_COMPOUND_LITERAL:
6301 return expression->compound_literal.type;
6306 return expression->base.type;
6310 * Find an entity matching a symbol in a scope.
6311 * Uses current scope if scope is NULL
6313 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6314 namespace_tag_t namespc)
6316 if (scope == NULL) {
6317 return get_entity(symbol, namespc);
6320 /* we should optimize here, if scope grows above a certain size we should
6321 construct a hashmap here... */
6322 entity_t *entity = scope->entities;
6323 for ( ; entity != NULL; entity = entity->base.next) {
6324 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6331 static entity_t *parse_qualified_identifier(void)
6333 /* namespace containing the symbol */
6335 source_position_t pos;
6336 const scope_t *lookup_scope = NULL;
6338 if (next_if(T_COLONCOLON))
6339 lookup_scope = &unit->scope;
6343 if (token.type != T_IDENTIFIER) {
6344 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6345 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6347 symbol = token.symbol;
6352 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6354 if (!next_if(T_COLONCOLON))
6357 switch (entity->kind) {
6358 case ENTITY_NAMESPACE:
6359 lookup_scope = &entity->namespacee.members;
6364 lookup_scope = &entity->compound.members;
6367 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6368 symbol, get_entity_kind_name(entity->kind));
6373 if (entity == NULL) {
6374 if (!strict_mode && token.type == '(') {
6375 /* an implicitly declared function */
6376 if (warning.error_implicit_function_declaration) {
6377 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6378 } else if (warning.implicit_function_declaration) {
6379 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6382 entity = create_implicit_function(symbol, &pos);
6384 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6385 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6392 /* skip further qualifications */
6393 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6395 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6398 static expression_t *parse_reference(void)
6400 source_position_t const pos = token.source_position;
6401 entity_t *const entity = parse_qualified_identifier();
6404 if (is_declaration(entity)) {
6405 orig_type = entity->declaration.type;
6406 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6407 orig_type = entity->enum_value.enum_type;
6409 panic("expected declaration or enum value in reference");
6412 /* we always do the auto-type conversions; the & and sizeof parser contains
6413 * code to revert this! */
6414 type_t *type = automatic_type_conversion(orig_type);
6416 expression_kind_t kind = EXPR_REFERENCE;
6417 if (entity->kind == ENTITY_ENUM_VALUE)
6418 kind = EXPR_REFERENCE_ENUM_VALUE;
6420 expression_t *expression = allocate_expression_zero(kind);
6421 expression->base.source_position = pos;
6422 expression->base.type = type;
6423 expression->reference.entity = entity;
6425 /* this declaration is used */
6426 if (is_declaration(entity)) {
6427 entity->declaration.used = true;
6430 if (entity->base.parent_scope != file_scope
6431 && (current_function != NULL
6432 && entity->base.parent_scope->depth < current_function->parameters.depth)
6433 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6434 if (entity->kind == ENTITY_VARIABLE) {
6435 /* access of a variable from an outer function */
6436 entity->variable.address_taken = true;
6437 } else if (entity->kind == ENTITY_PARAMETER) {
6438 entity->parameter.address_taken = true;
6440 current_function->need_closure = true;
6443 check_deprecated(HERE, entity);
6445 if (warning.init_self && entity == current_init_decl && !in_type_prop
6446 && entity->kind == ENTITY_VARIABLE) {
6447 current_init_decl = NULL;
6448 warningf(&pos, "variable '%#T' is initialized by itself",
6449 entity->declaration.type, entity->base.symbol);
6455 static bool semantic_cast(expression_t *cast)
6457 expression_t *expression = cast->unary.value;
6458 type_t *orig_dest_type = cast->base.type;
6459 type_t *orig_type_right = expression->base.type;
6460 type_t const *dst_type = skip_typeref(orig_dest_type);
6461 type_t const *src_type = skip_typeref(orig_type_right);
6462 source_position_t const *pos = &cast->base.source_position;
6464 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6465 if (dst_type == type_void)
6468 /* only integer and pointer can be casted to pointer */
6469 if (is_type_pointer(dst_type) &&
6470 !is_type_pointer(src_type) &&
6471 !is_type_integer(src_type) &&
6472 is_type_valid(src_type)) {
6473 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6477 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6478 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6482 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6483 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6487 if (warning.cast_qual &&
6488 is_type_pointer(src_type) &&
6489 is_type_pointer(dst_type)) {
6490 type_t *src = skip_typeref(src_type->pointer.points_to);
6491 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6492 unsigned missing_qualifiers =
6493 src->base.qualifiers & ~dst->base.qualifiers;
6494 if (missing_qualifiers != 0) {
6496 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6497 missing_qualifiers, orig_type_right);
6503 static expression_t *parse_compound_literal(type_t *type)
6505 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6507 parse_initializer_env_t env;
6510 env.must_be_constant = false;
6511 initializer_t *initializer = parse_initializer(&env);
6514 expression->compound_literal.initializer = initializer;
6515 expression->compound_literal.type = type;
6516 expression->base.type = automatic_type_conversion(type);
6522 * Parse a cast expression.
6524 static expression_t *parse_cast(void)
6526 source_position_t source_position = token.source_position;
6529 add_anchor_token(')');
6531 type_t *type = parse_typename();
6533 rem_anchor_token(')');
6534 expect(')', end_error);
6536 if (token.type == '{') {
6537 return parse_compound_literal(type);
6540 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6541 cast->base.source_position = source_position;
6543 expression_t *value = parse_subexpression(PREC_CAST);
6544 cast->base.type = type;
6545 cast->unary.value = value;
6547 if (! semantic_cast(cast)) {
6548 /* TODO: record the error in the AST. else it is impossible to detect it */
6553 return create_invalid_expression();
6557 * Parse a statement expression.
6559 static expression_t *parse_statement_expression(void)
6561 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6564 add_anchor_token(')');
6566 statement_t *statement = parse_compound_statement(true);
6567 statement->compound.stmt_expr = true;
6568 expression->statement.statement = statement;
6570 /* find last statement and use its type */
6571 type_t *type = type_void;
6572 const statement_t *stmt = statement->compound.statements;
6574 while (stmt->base.next != NULL)
6575 stmt = stmt->base.next;
6577 if (stmt->kind == STATEMENT_EXPRESSION) {
6578 type = stmt->expression.expression->base.type;
6580 } else if (warning.other) {
6581 warningf(&expression->base.source_position, "empty statement expression ({})");
6583 expression->base.type = type;
6585 rem_anchor_token(')');
6586 expect(')', end_error);
6593 * Parse a parenthesized expression.
6595 static expression_t *parse_parenthesized_expression(void)
6597 token_t const* const la1 = look_ahead(1);
6598 switch (la1->type) {
6600 /* gcc extension: a statement expression */
6601 return parse_statement_expression();
6604 if (is_typedef_symbol(la1->symbol)) {
6607 return parse_cast();
6612 add_anchor_token(')');
6613 expression_t *result = parse_expression();
6614 result->base.parenthesized = true;
6615 rem_anchor_token(')');
6616 expect(')', end_error);
6622 static expression_t *parse_function_keyword(void)
6626 if (current_function == NULL) {
6627 errorf(HERE, "'__func__' used outside of a function");
6630 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6631 expression->base.type = type_char_ptr;
6632 expression->funcname.kind = FUNCNAME_FUNCTION;
6639 static expression_t *parse_pretty_function_keyword(void)
6641 if (current_function == NULL) {
6642 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6645 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6646 expression->base.type = type_char_ptr;
6647 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6649 eat(T___PRETTY_FUNCTION__);
6654 static expression_t *parse_funcsig_keyword(void)
6656 if (current_function == NULL) {
6657 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6660 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6661 expression->base.type = type_char_ptr;
6662 expression->funcname.kind = FUNCNAME_FUNCSIG;
6669 static expression_t *parse_funcdname_keyword(void)
6671 if (current_function == NULL) {
6672 errorf(HERE, "'__FUNCDNAME__' 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_FUNCDNAME;
6679 eat(T___FUNCDNAME__);
6684 static designator_t *parse_designator(void)
6686 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6687 result->source_position = *HERE;
6689 if (token.type != T_IDENTIFIER) {
6690 parse_error_expected("while parsing member designator",
6691 T_IDENTIFIER, NULL);
6694 result->symbol = token.symbol;
6697 designator_t *last_designator = result;
6700 if (token.type != T_IDENTIFIER) {
6701 parse_error_expected("while parsing member designator",
6702 T_IDENTIFIER, NULL);
6705 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6706 designator->source_position = *HERE;
6707 designator->symbol = token.symbol;
6710 last_designator->next = designator;
6711 last_designator = designator;
6715 add_anchor_token(']');
6716 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6717 designator->source_position = *HERE;
6718 designator->array_index = parse_expression();
6719 rem_anchor_token(']');
6720 expect(']', end_error);
6721 if (designator->array_index == NULL) {
6725 last_designator->next = designator;
6726 last_designator = designator;
6738 * Parse the __builtin_offsetof() expression.
6740 static expression_t *parse_offsetof(void)
6742 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6743 expression->base.type = type_size_t;
6745 eat(T___builtin_offsetof);
6747 expect('(', end_error);
6748 add_anchor_token(',');
6749 type_t *type = parse_typename();
6750 rem_anchor_token(',');
6751 expect(',', end_error);
6752 add_anchor_token(')');
6753 designator_t *designator = parse_designator();
6754 rem_anchor_token(')');
6755 expect(')', end_error);
6757 expression->offsetofe.type = type;
6758 expression->offsetofe.designator = designator;
6761 memset(&path, 0, sizeof(path));
6762 path.top_type = type;
6763 path.path = NEW_ARR_F(type_path_entry_t, 0);
6765 descend_into_subtype(&path);
6767 if (!walk_designator(&path, designator, true)) {
6768 return create_invalid_expression();
6771 DEL_ARR_F(path.path);
6775 return create_invalid_expression();
6779 * Parses a _builtin_va_start() expression.
6781 static expression_t *parse_va_start(void)
6783 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6785 eat(T___builtin_va_start);
6787 expect('(', end_error);
6788 add_anchor_token(',');
6789 expression->va_starte.ap = parse_assignment_expression();
6790 rem_anchor_token(',');
6791 expect(',', end_error);
6792 expression_t *const expr = parse_assignment_expression();
6793 if (expr->kind == EXPR_REFERENCE) {
6794 entity_t *const entity = expr->reference.entity;
6795 if (!current_function->base.type->function.variadic) {
6796 errorf(&expr->base.source_position,
6797 "'va_start' used in non-variadic function");
6798 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6799 entity->base.next != NULL ||
6800 entity->kind != ENTITY_PARAMETER) {
6801 errorf(&expr->base.source_position,
6802 "second argument of 'va_start' must be last parameter of the current function");
6804 expression->va_starte.parameter = &entity->variable;
6806 expect(')', end_error);
6809 expect(')', end_error);
6811 return create_invalid_expression();
6815 * Parses a __builtin_va_arg() expression.
6817 static expression_t *parse_va_arg(void)
6819 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6821 eat(T___builtin_va_arg);
6823 expect('(', end_error);
6825 ap.expression = parse_assignment_expression();
6826 expression->va_arge.ap = ap.expression;
6827 check_call_argument(type_valist, &ap, 1);
6829 expect(',', end_error);
6830 expression->base.type = parse_typename();
6831 expect(')', end_error);
6835 return create_invalid_expression();
6839 * Parses a __builtin_va_copy() expression.
6841 static expression_t *parse_va_copy(void)
6843 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6845 eat(T___builtin_va_copy);
6847 expect('(', end_error);
6848 expression_t *dst = parse_assignment_expression();
6849 assign_error_t error = semantic_assign(type_valist, dst);
6850 report_assign_error(error, type_valist, dst, "call argument 1",
6851 &dst->base.source_position);
6852 expression->va_copye.dst = dst;
6854 expect(',', end_error);
6856 call_argument_t src;
6857 src.expression = parse_assignment_expression();
6858 check_call_argument(type_valist, &src, 2);
6859 expression->va_copye.src = src.expression;
6860 expect(')', end_error);
6864 return create_invalid_expression();
6868 * Parses a __builtin_constant_p() expression.
6870 static expression_t *parse_builtin_constant(void)
6872 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6874 eat(T___builtin_constant_p);
6876 expect('(', end_error);
6877 add_anchor_token(')');
6878 expression->builtin_constant.value = parse_assignment_expression();
6879 rem_anchor_token(')');
6880 expect(')', end_error);
6881 expression->base.type = type_int;
6885 return create_invalid_expression();
6889 * Parses a __builtin_types_compatible_p() expression.
6891 static expression_t *parse_builtin_types_compatible(void)
6893 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6895 eat(T___builtin_types_compatible_p);
6897 expect('(', end_error);
6898 add_anchor_token(')');
6899 add_anchor_token(',');
6900 expression->builtin_types_compatible.left = parse_typename();
6901 rem_anchor_token(',');
6902 expect(',', end_error);
6903 expression->builtin_types_compatible.right = parse_typename();
6904 rem_anchor_token(')');
6905 expect(')', end_error);
6906 expression->base.type = type_int;
6910 return create_invalid_expression();
6914 * Parses a __builtin_is_*() compare expression.
6916 static expression_t *parse_compare_builtin(void)
6918 expression_t *expression;
6920 switch (token.type) {
6921 case T___builtin_isgreater:
6922 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6924 case T___builtin_isgreaterequal:
6925 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6927 case T___builtin_isless:
6928 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6930 case T___builtin_islessequal:
6931 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6933 case T___builtin_islessgreater:
6934 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6936 case T___builtin_isunordered:
6937 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6940 internal_errorf(HERE, "invalid compare builtin found");
6942 expression->base.source_position = *HERE;
6945 expect('(', end_error);
6946 expression->binary.left = parse_assignment_expression();
6947 expect(',', end_error);
6948 expression->binary.right = parse_assignment_expression();
6949 expect(')', end_error);
6951 type_t *const orig_type_left = expression->binary.left->base.type;
6952 type_t *const orig_type_right = expression->binary.right->base.type;
6954 type_t *const type_left = skip_typeref(orig_type_left);
6955 type_t *const type_right = skip_typeref(orig_type_right);
6956 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6957 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6958 type_error_incompatible("invalid operands in comparison",
6959 &expression->base.source_position, orig_type_left, orig_type_right);
6962 semantic_comparison(&expression->binary);
6967 return create_invalid_expression();
6971 * Parses a MS assume() expression.
6973 static expression_t *parse_assume(void)
6975 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6979 expect('(', end_error);
6980 add_anchor_token(')');
6981 expression->unary.value = parse_assignment_expression();
6982 rem_anchor_token(')');
6983 expect(')', end_error);
6985 expression->base.type = type_void;
6988 return create_invalid_expression();
6992 * Return the label for the current symbol or create a new one.
6994 static label_t *get_label(void)
6996 assert(token.type == T_IDENTIFIER);
6997 assert(current_function != NULL);
6999 entity_t *label = get_entity(token.symbol, NAMESPACE_LABEL);
7000 /* If we find a local label, we already created the declaration. */
7001 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7002 if (label->base.parent_scope != current_scope) {
7003 assert(label->base.parent_scope->depth < current_scope->depth);
7004 current_function->goto_to_outer = true;
7006 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
7007 /* There is no matching label in the same function, so create a new one. */
7008 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.symbol);
7013 return &label->label;
7017 * Parses a GNU && label address expression.
7019 static expression_t *parse_label_address(void)
7021 source_position_t source_position = token.source_position;
7023 if (token.type != T_IDENTIFIER) {
7024 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7025 return create_invalid_expression();
7028 label_t *const label = get_label();
7030 label->address_taken = true;
7032 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7033 expression->base.source_position = source_position;
7035 /* label address is threaten as a void pointer */
7036 expression->base.type = type_void_ptr;
7037 expression->label_address.label = label;
7042 * Parse a microsoft __noop expression.
7044 static expression_t *parse_noop_expression(void)
7046 /* the result is a (int)0 */
7047 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7048 literal->base.type = type_int;
7049 literal->base.source_position = token.source_position;
7050 literal->literal.value.begin = "__noop";
7051 literal->literal.value.size = 6;
7055 if (token.type == '(') {
7056 /* parse arguments */
7058 add_anchor_token(')');
7059 add_anchor_token(',');
7061 if (token.type != ')') do {
7062 (void)parse_assignment_expression();
7063 } while (next_if(','));
7065 rem_anchor_token(',');
7066 rem_anchor_token(')');
7067 expect(')', end_error);
7074 * Parses a primary expression.
7076 static expression_t *parse_primary_expression(void)
7078 switch (token.type) {
7079 case T_false: return parse_boolean_literal(false);
7080 case T_true: return parse_boolean_literal(true);
7082 case T_INTEGER_OCTAL:
7083 case T_INTEGER_HEXADECIMAL:
7084 case T_FLOATINGPOINT:
7085 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7086 case T_CHARACTER_CONSTANT: return parse_character_constant();
7087 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7088 case T_STRING_LITERAL:
7089 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7090 case T___FUNCTION__:
7091 case T___func__: return parse_function_keyword();
7092 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7093 case T___FUNCSIG__: return parse_funcsig_keyword();
7094 case T___FUNCDNAME__: return parse_funcdname_keyword();
7095 case T___builtin_offsetof: return parse_offsetof();
7096 case T___builtin_va_start: return parse_va_start();
7097 case T___builtin_va_arg: return parse_va_arg();
7098 case T___builtin_va_copy: return parse_va_copy();
7099 case T___builtin_isgreater:
7100 case T___builtin_isgreaterequal:
7101 case T___builtin_isless:
7102 case T___builtin_islessequal:
7103 case T___builtin_islessgreater:
7104 case T___builtin_isunordered: return parse_compare_builtin();
7105 case T___builtin_constant_p: return parse_builtin_constant();
7106 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7107 case T__assume: return parse_assume();
7110 return parse_label_address();
7113 case '(': return parse_parenthesized_expression();
7114 case T___noop: return parse_noop_expression();
7116 /* Gracefully handle type names while parsing expressions. */
7118 return parse_reference();
7120 if (!is_typedef_symbol(token.symbol)) {
7121 return parse_reference();
7125 source_position_t const pos = *HERE;
7126 type_t const *const type = parse_typename();
7127 errorf(&pos, "encountered type '%T' while parsing expression", type);
7128 return create_invalid_expression();
7132 errorf(HERE, "unexpected token %K, expected an expression", &token);
7134 return create_invalid_expression();
7137 static expression_t *parse_array_expression(expression_t *left)
7139 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7140 array_access_expression_t *const arr = &expr->array_access;
7143 add_anchor_token(']');
7145 expression_t *const inside = parse_expression();
7147 type_t *const orig_type_left = left->base.type;
7148 type_t *const orig_type_inside = inside->base.type;
7150 type_t *const type_left = skip_typeref(orig_type_left);
7151 type_t *const type_inside = skip_typeref(orig_type_inside);
7157 if (is_type_pointer(type_left)) {
7160 idx_type = type_inside;
7161 res_type = type_left->pointer.points_to;
7163 } else if (is_type_pointer(type_inside)) {
7164 arr->flipped = true;
7167 idx_type = type_left;
7168 res_type = type_inside->pointer.points_to;
7170 res_type = automatic_type_conversion(res_type);
7171 if (!is_type_integer(idx_type)) {
7172 errorf(&idx->base.source_position, "array subscript must have integer type");
7173 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR) && warning.char_subscripts) {
7174 warningf(&idx->base.source_position, "array subscript has char type");
7177 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7179 "array access on object with non-pointer types '%T', '%T'",
7180 orig_type_left, orig_type_inside);
7182 res_type = type_error_type;
7187 arr->array_ref = ref;
7189 arr->base.type = res_type;
7191 rem_anchor_token(']');
7192 expect(']', end_error);
7197 static expression_t *parse_typeprop(expression_kind_t const kind)
7199 expression_t *tp_expression = allocate_expression_zero(kind);
7200 tp_expression->base.type = type_size_t;
7202 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7204 /* we only refer to a type property, mark this case */
7205 bool old = in_type_prop;
7206 in_type_prop = true;
7209 expression_t *expression;
7210 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7212 add_anchor_token(')');
7213 orig_type = parse_typename();
7214 rem_anchor_token(')');
7215 expect(')', end_error);
7217 if (token.type == '{') {
7218 /* It was not sizeof(type) after all. It is sizeof of an expression
7219 * starting with a compound literal */
7220 expression = parse_compound_literal(orig_type);
7221 goto typeprop_expression;
7224 expression = parse_subexpression(PREC_UNARY);
7226 typeprop_expression:
7227 tp_expression->typeprop.tp_expression = expression;
7229 orig_type = revert_automatic_type_conversion(expression);
7230 expression->base.type = orig_type;
7233 tp_expression->typeprop.type = orig_type;
7234 type_t const* const type = skip_typeref(orig_type);
7235 char const* wrong_type = NULL;
7236 if (is_type_incomplete(type)) {
7237 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7238 wrong_type = "incomplete";
7239 } else if (type->kind == TYPE_FUNCTION) {
7241 /* function types are allowed (and return 1) */
7242 if (warning.other) {
7243 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7244 warningf(&tp_expression->base.source_position,
7245 "%s expression with function argument returns invalid result", what);
7248 wrong_type = "function";
7251 if (is_type_incomplete(type))
7252 wrong_type = "incomplete";
7254 if (type->kind == TYPE_BITFIELD)
7255 wrong_type = "bitfield";
7257 if (wrong_type != NULL) {
7258 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7259 errorf(&tp_expression->base.source_position,
7260 "operand of %s expression must not be of %s type '%T'",
7261 what, wrong_type, orig_type);
7266 return tp_expression;
7269 static expression_t *parse_sizeof(void)
7271 return parse_typeprop(EXPR_SIZEOF);
7274 static expression_t *parse_alignof(void)
7276 return parse_typeprop(EXPR_ALIGNOF);
7279 static expression_t *parse_select_expression(expression_t *addr)
7281 assert(token.type == '.' || token.type == T_MINUSGREATER);
7282 bool select_left_arrow = (token.type == T_MINUSGREATER);
7283 source_position_t const pos = *HERE;
7286 if (token.type != T_IDENTIFIER) {
7287 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7288 return create_invalid_expression();
7290 symbol_t *symbol = token.symbol;
7293 type_t *const orig_type = addr->base.type;
7294 type_t *const type = skip_typeref(orig_type);
7297 bool saw_error = false;
7298 if (is_type_pointer(type)) {
7299 if (!select_left_arrow) {
7301 "request for member '%Y' in something not a struct or union, but '%T'",
7305 type_left = skip_typeref(type->pointer.points_to);
7307 if (select_left_arrow && is_type_valid(type)) {
7308 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7314 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7315 type_left->kind != TYPE_COMPOUND_UNION) {
7317 if (is_type_valid(type_left) && !saw_error) {
7319 "request for member '%Y' in something not a struct or union, but '%T'",
7322 return create_invalid_expression();
7325 compound_t *compound = type_left->compound.compound;
7326 if (!compound->complete) {
7327 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7329 return create_invalid_expression();
7332 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7333 expression_t *result =
7334 find_create_select(&pos, addr, qualifiers, compound, symbol);
7336 if (result == NULL) {
7337 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7338 return create_invalid_expression();
7344 static void check_call_argument(type_t *expected_type,
7345 call_argument_t *argument, unsigned pos)
7347 type_t *expected_type_skip = skip_typeref(expected_type);
7348 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7349 expression_t *arg_expr = argument->expression;
7350 type_t *arg_type = skip_typeref(arg_expr->base.type);
7352 /* handle transparent union gnu extension */
7353 if (is_type_union(expected_type_skip)
7354 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7355 compound_t *union_decl = expected_type_skip->compound.compound;
7356 type_t *best_type = NULL;
7357 entity_t *entry = union_decl->members.entities;
7358 for ( ; entry != NULL; entry = entry->base.next) {
7359 assert(is_declaration(entry));
7360 type_t *decl_type = entry->declaration.type;
7361 error = semantic_assign(decl_type, arg_expr);
7362 if (error == ASSIGN_ERROR_INCOMPATIBLE
7363 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7366 if (error == ASSIGN_SUCCESS) {
7367 best_type = decl_type;
7368 } else if (best_type == NULL) {
7369 best_type = decl_type;
7373 if (best_type != NULL) {
7374 expected_type = best_type;
7378 error = semantic_assign(expected_type, arg_expr);
7379 argument->expression = create_implicit_cast(arg_expr, expected_type);
7381 if (error != ASSIGN_SUCCESS) {
7382 /* report exact scope in error messages (like "in argument 3") */
7384 snprintf(buf, sizeof(buf), "call argument %u", pos);
7385 report_assign_error(error, expected_type, arg_expr, buf,
7386 &arg_expr->base.source_position);
7387 } else if (warning.traditional || warning.conversion) {
7388 type_t *const promoted_type = get_default_promoted_type(arg_type);
7389 if (!types_compatible(expected_type_skip, promoted_type) &&
7390 !types_compatible(expected_type_skip, type_void_ptr) &&
7391 !types_compatible(type_void_ptr, promoted_type)) {
7392 /* Deliberately show the skipped types in this warning */
7393 warningf(&arg_expr->base.source_position,
7394 "passing call argument %u as '%T' rather than '%T' due to prototype",
7395 pos, expected_type_skip, promoted_type);
7401 * Handle the semantic restrictions of builtin calls
7403 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7404 switch (call->function->reference.entity->function.btk) {
7405 case bk_gnu_builtin_return_address:
7406 case bk_gnu_builtin_frame_address: {
7407 /* argument must be constant */
7408 call_argument_t *argument = call->arguments;
7410 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7411 errorf(&call->base.source_position,
7412 "argument of '%Y' must be a constant expression",
7413 call->function->reference.entity->base.symbol);
7417 case bk_gnu_builtin_object_size:
7418 if (call->arguments == NULL)
7421 call_argument_t *arg = call->arguments->next;
7422 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7423 errorf(&call->base.source_position,
7424 "second argument of '%Y' must be a constant expression",
7425 call->function->reference.entity->base.symbol);
7428 case bk_gnu_builtin_prefetch:
7429 /* second and third argument must be constant if existent */
7430 if (call->arguments == NULL)
7432 call_argument_t *rw = call->arguments->next;
7433 call_argument_t *locality = NULL;
7436 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7437 errorf(&call->base.source_position,
7438 "second argument of '%Y' must be a constant expression",
7439 call->function->reference.entity->base.symbol);
7441 locality = rw->next;
7443 if (locality != NULL) {
7444 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7445 errorf(&call->base.source_position,
7446 "third argument of '%Y' must be a constant expression",
7447 call->function->reference.entity->base.symbol);
7449 locality = rw->next;
7458 * Parse a call expression, ie. expression '( ... )'.
7460 * @param expression the function address
7462 static expression_t *parse_call_expression(expression_t *expression)
7464 expression_t *result = allocate_expression_zero(EXPR_CALL);
7465 call_expression_t *call = &result->call;
7466 call->function = expression;
7468 type_t *const orig_type = expression->base.type;
7469 type_t *const type = skip_typeref(orig_type);
7471 function_type_t *function_type = NULL;
7472 if (is_type_pointer(type)) {
7473 type_t *const to_type = skip_typeref(type->pointer.points_to);
7475 if (is_type_function(to_type)) {
7476 function_type = &to_type->function;
7477 call->base.type = function_type->return_type;
7481 if (function_type == NULL && is_type_valid(type)) {
7483 "called object '%E' (type '%T') is not a pointer to a function",
7484 expression, orig_type);
7487 /* parse arguments */
7489 add_anchor_token(')');
7490 add_anchor_token(',');
7492 if (token.type != ')') {
7493 call_argument_t **anchor = &call->arguments;
7495 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7496 argument->expression = parse_assignment_expression();
7499 anchor = &argument->next;
7500 } while (next_if(','));
7502 rem_anchor_token(',');
7503 rem_anchor_token(')');
7504 expect(')', end_error);
7506 if (function_type == NULL)
7509 /* check type and count of call arguments */
7510 function_parameter_t *parameter = function_type->parameters;
7511 call_argument_t *argument = call->arguments;
7512 if (!function_type->unspecified_parameters) {
7513 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7514 parameter = parameter->next, argument = argument->next) {
7515 check_call_argument(parameter->type, argument, ++pos);
7518 if (parameter != NULL) {
7519 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7520 } else if (argument != NULL && !function_type->variadic) {
7521 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7525 /* do default promotion for other arguments */
7526 for (; argument != NULL; argument = argument->next) {
7527 type_t *type = argument->expression->base.type;
7528 if (!is_type_object(skip_typeref(type))) {
7529 errorf(&argument->expression->base.source_position,
7530 "call argument '%E' must not be void", argument->expression);
7533 type = get_default_promoted_type(type);
7535 argument->expression
7536 = create_implicit_cast(argument->expression, type);
7541 if (warning.aggregate_return &&
7542 is_type_compound(skip_typeref(function_type->return_type))) {
7543 warningf(&expression->base.source_position,
7544 "function call has aggregate value");
7547 if (expression->kind == EXPR_REFERENCE) {
7548 reference_expression_t *reference = &expression->reference;
7549 if (reference->entity->kind == ENTITY_FUNCTION &&
7550 reference->entity->function.btk != bk_none)
7551 handle_builtin_argument_restrictions(call);
7558 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7560 static bool same_compound_type(const type_t *type1, const type_t *type2)
7563 is_type_compound(type1) &&
7564 type1->kind == type2->kind &&
7565 type1->compound.compound == type2->compound.compound;
7568 static expression_t const *get_reference_address(expression_t const *expr)
7570 bool regular_take_address = true;
7572 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7573 expr = expr->unary.value;
7575 regular_take_address = false;
7578 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7581 expr = expr->unary.value;
7584 if (expr->kind != EXPR_REFERENCE)
7587 /* special case for functions which are automatically converted to a
7588 * pointer to function without an extra TAKE_ADDRESS operation */
7589 if (!regular_take_address &&
7590 expr->reference.entity->kind != ENTITY_FUNCTION) {
7597 static void warn_reference_address_as_bool(expression_t const* expr)
7599 if (!warning.address)
7602 expr = get_reference_address(expr);
7604 warningf(&expr->base.source_position,
7605 "the address of '%Y' will always evaluate as 'true'",
7606 expr->reference.entity->base.symbol);
7610 static void warn_assignment_in_condition(const expression_t *const expr)
7612 if (!warning.parentheses)
7614 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7616 if (expr->base.parenthesized)
7618 warningf(&expr->base.source_position,
7619 "suggest parentheses around assignment used as truth value");
7622 static void semantic_condition(expression_t const *const expr,
7623 char const *const context)
7625 type_t *const type = skip_typeref(expr->base.type);
7626 if (is_type_scalar(type)) {
7627 warn_reference_address_as_bool(expr);
7628 warn_assignment_in_condition(expr);
7629 } else if (is_type_valid(type)) {
7630 errorf(&expr->base.source_position,
7631 "%s must have scalar type", context);
7636 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7638 * @param expression the conditional expression
7640 static expression_t *parse_conditional_expression(expression_t *expression)
7642 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7644 conditional_expression_t *conditional = &result->conditional;
7645 conditional->condition = expression;
7648 add_anchor_token(':');
7650 /* §6.5.15:2 The first operand shall have scalar type. */
7651 semantic_condition(expression, "condition of conditional operator");
7653 expression_t *true_expression = expression;
7654 bool gnu_cond = false;
7655 if (GNU_MODE && token.type == ':') {
7658 true_expression = parse_expression();
7660 rem_anchor_token(':');
7661 expect(':', end_error);
7663 expression_t *false_expression =
7664 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7666 type_t *const orig_true_type = true_expression->base.type;
7667 type_t *const orig_false_type = false_expression->base.type;
7668 type_t *const true_type = skip_typeref(orig_true_type);
7669 type_t *const false_type = skip_typeref(orig_false_type);
7672 type_t *result_type;
7673 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7674 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7675 /* ISO/IEC 14882:1998(E) §5.16:2 */
7676 if (true_expression->kind == EXPR_UNARY_THROW) {
7677 result_type = false_type;
7678 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7679 result_type = true_type;
7681 if (warning.other && (
7682 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7683 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7685 warningf(&conditional->base.source_position,
7686 "ISO C forbids conditional expression with only one void side");
7688 result_type = type_void;
7690 } else if (is_type_arithmetic(true_type)
7691 && is_type_arithmetic(false_type)) {
7692 result_type = semantic_arithmetic(true_type, false_type);
7693 } else if (same_compound_type(true_type, false_type)) {
7694 /* just take 1 of the 2 types */
7695 result_type = true_type;
7696 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7697 type_t *pointer_type;
7699 expression_t *other_expression;
7700 if (is_type_pointer(true_type) &&
7701 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7702 pointer_type = true_type;
7703 other_type = false_type;
7704 other_expression = false_expression;
7706 pointer_type = false_type;
7707 other_type = true_type;
7708 other_expression = true_expression;
7711 if (is_null_pointer_constant(other_expression)) {
7712 result_type = pointer_type;
7713 } else if (is_type_pointer(other_type)) {
7714 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7715 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7718 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7719 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7721 } else if (types_compatible(get_unqualified_type(to1),
7722 get_unqualified_type(to2))) {
7725 if (warning.other) {
7726 warningf(&conditional->base.source_position,
7727 "pointer types '%T' and '%T' in conditional expression are incompatible",
7728 true_type, false_type);
7733 type_t *const type =
7734 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7735 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7736 } else if (is_type_integer(other_type)) {
7737 if (warning.other) {
7738 warningf(&conditional->base.source_position,
7739 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7741 result_type = pointer_type;
7743 if (is_type_valid(other_type)) {
7744 type_error_incompatible("while parsing conditional",
7745 &expression->base.source_position, true_type, false_type);
7747 result_type = type_error_type;
7750 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7751 type_error_incompatible("while parsing conditional",
7752 &conditional->base.source_position, true_type,
7755 result_type = type_error_type;
7758 conditional->true_expression
7759 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7760 conditional->false_expression
7761 = create_implicit_cast(false_expression, result_type);
7762 conditional->base.type = result_type;
7767 * Parse an extension expression.
7769 static expression_t *parse_extension(void)
7771 eat(T___extension__);
7773 bool old_gcc_extension = in_gcc_extension;
7774 in_gcc_extension = true;
7775 expression_t *expression = parse_subexpression(PREC_UNARY);
7776 in_gcc_extension = old_gcc_extension;
7781 * Parse a __builtin_classify_type() expression.
7783 static expression_t *parse_builtin_classify_type(void)
7785 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7786 result->base.type = type_int;
7788 eat(T___builtin_classify_type);
7790 expect('(', end_error);
7791 add_anchor_token(')');
7792 expression_t *expression = parse_expression();
7793 rem_anchor_token(')');
7794 expect(')', end_error);
7795 result->classify_type.type_expression = expression;
7799 return create_invalid_expression();
7803 * Parse a delete expression
7804 * ISO/IEC 14882:1998(E) §5.3.5
7806 static expression_t *parse_delete(void)
7808 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7809 result->base.type = type_void;
7814 result->kind = EXPR_UNARY_DELETE_ARRAY;
7815 expect(']', end_error);
7819 expression_t *const value = parse_subexpression(PREC_CAST);
7820 result->unary.value = value;
7822 type_t *const type = skip_typeref(value->base.type);
7823 if (!is_type_pointer(type)) {
7824 if (is_type_valid(type)) {
7825 errorf(&value->base.source_position,
7826 "operand of delete must have pointer type");
7828 } else if (warning.other &&
7829 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7830 warningf(&value->base.source_position,
7831 "deleting 'void*' is undefined");
7838 * Parse a throw expression
7839 * ISO/IEC 14882:1998(E) §15:1
7841 static expression_t *parse_throw(void)
7843 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7844 result->base.type = type_void;
7848 expression_t *value = NULL;
7849 switch (token.type) {
7851 value = parse_assignment_expression();
7852 /* ISO/IEC 14882:1998(E) §15.1:3 */
7853 type_t *const orig_type = value->base.type;
7854 type_t *const type = skip_typeref(orig_type);
7855 if (is_type_incomplete(type)) {
7856 errorf(&value->base.source_position,
7857 "cannot throw object of incomplete type '%T'", orig_type);
7858 } else if (is_type_pointer(type)) {
7859 type_t *const points_to = skip_typeref(type->pointer.points_to);
7860 if (is_type_incomplete(points_to) &&
7861 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7862 errorf(&value->base.source_position,
7863 "cannot throw pointer to incomplete type '%T'", orig_type);
7871 result->unary.value = value;
7876 static bool check_pointer_arithmetic(const source_position_t *source_position,
7877 type_t *pointer_type,
7878 type_t *orig_pointer_type)
7880 type_t *points_to = pointer_type->pointer.points_to;
7881 points_to = skip_typeref(points_to);
7883 if (is_type_incomplete(points_to)) {
7884 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7885 errorf(source_position,
7886 "arithmetic with pointer to incomplete type '%T' not allowed",
7889 } else if (warning.pointer_arith) {
7890 warningf(source_position,
7891 "pointer of type '%T' used in arithmetic",
7894 } else if (is_type_function(points_to)) {
7896 errorf(source_position,
7897 "arithmetic with pointer to function type '%T' not allowed",
7900 } else if (warning.pointer_arith) {
7901 warningf(source_position,
7902 "pointer to a function '%T' used in arithmetic",
7909 static bool is_lvalue(const expression_t *expression)
7911 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7912 switch (expression->kind) {
7913 case EXPR_ARRAY_ACCESS:
7914 case EXPR_COMPOUND_LITERAL:
7915 case EXPR_REFERENCE:
7917 case EXPR_UNARY_DEREFERENCE:
7921 type_t *type = skip_typeref(expression->base.type);
7923 /* ISO/IEC 14882:1998(E) §3.10:3 */
7924 is_type_reference(type) ||
7925 /* Claim it is an lvalue, if the type is invalid. There was a parse
7926 * error before, which maybe prevented properly recognizing it as
7928 !is_type_valid(type);
7933 static void semantic_incdec(unary_expression_t *expression)
7935 type_t *const orig_type = expression->value->base.type;
7936 type_t *const type = skip_typeref(orig_type);
7937 if (is_type_pointer(type)) {
7938 if (!check_pointer_arithmetic(&expression->base.source_position,
7942 } else if (!is_type_real(type) && is_type_valid(type)) {
7943 /* TODO: improve error message */
7944 errorf(&expression->base.source_position,
7945 "operation needs an arithmetic or pointer type");
7948 if (!is_lvalue(expression->value)) {
7949 /* TODO: improve error message */
7950 errorf(&expression->base.source_position, "lvalue required as operand");
7952 expression->base.type = orig_type;
7955 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7957 type_t *const orig_type = expression->value->base.type;
7958 type_t *const type = skip_typeref(orig_type);
7959 if (!is_type_arithmetic(type)) {
7960 if (is_type_valid(type)) {
7961 /* TODO: improve error message */
7962 errorf(&expression->base.source_position,
7963 "operation needs an arithmetic type");
7968 expression->base.type = orig_type;
7971 static void semantic_unexpr_plus(unary_expression_t *expression)
7973 semantic_unexpr_arithmetic(expression);
7974 if (warning.traditional)
7975 warningf(&expression->base.source_position,
7976 "traditional C rejects the unary plus operator");
7979 static void semantic_not(unary_expression_t *expression)
7981 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7982 semantic_condition(expression->value, "operand of !");
7983 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7986 static void semantic_unexpr_integer(unary_expression_t *expression)
7988 type_t *const orig_type = expression->value->base.type;
7989 type_t *const type = skip_typeref(orig_type);
7990 if (!is_type_integer(type)) {
7991 if (is_type_valid(type)) {
7992 errorf(&expression->base.source_position,
7993 "operand of ~ must be of integer type");
7998 expression->base.type = orig_type;
8001 static void semantic_dereference(unary_expression_t *expression)
8003 type_t *const orig_type = expression->value->base.type;
8004 type_t *const type = skip_typeref(orig_type);
8005 if (!is_type_pointer(type)) {
8006 if (is_type_valid(type)) {
8007 errorf(&expression->base.source_position,
8008 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8013 type_t *result_type = type->pointer.points_to;
8014 result_type = automatic_type_conversion(result_type);
8015 expression->base.type = result_type;
8019 * Record that an address is taken (expression represents an lvalue).
8021 * @param expression the expression
8022 * @param may_be_register if true, the expression might be an register
8024 static void set_address_taken(expression_t *expression, bool may_be_register)
8026 if (expression->kind != EXPR_REFERENCE)
8029 entity_t *const entity = expression->reference.entity;
8031 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8034 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8035 && !may_be_register) {
8036 errorf(&expression->base.source_position,
8037 "address of register %s '%Y' requested",
8038 get_entity_kind_name(entity->kind), entity->base.symbol);
8041 if (entity->kind == ENTITY_VARIABLE) {
8042 entity->variable.address_taken = true;
8044 assert(entity->kind == ENTITY_PARAMETER);
8045 entity->parameter.address_taken = true;
8050 * Check the semantic of the address taken expression.
8052 static void semantic_take_addr(unary_expression_t *expression)
8054 expression_t *value = expression->value;
8055 value->base.type = revert_automatic_type_conversion(value);
8057 type_t *orig_type = value->base.type;
8058 type_t *type = skip_typeref(orig_type);
8059 if (!is_type_valid(type))
8063 if (!is_lvalue(value)) {
8064 errorf(&expression->base.source_position, "'&' requires an lvalue");
8066 if (type->kind == TYPE_BITFIELD) {
8067 errorf(&expression->base.source_position,
8068 "'&' not allowed on object with bitfield type '%T'",
8072 set_address_taken(value, false);
8074 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8077 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8078 static expression_t *parse_##unexpression_type(void) \
8080 expression_t *unary_expression \
8081 = allocate_expression_zero(unexpression_type); \
8083 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8085 sfunc(&unary_expression->unary); \
8087 return unary_expression; \
8090 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8091 semantic_unexpr_arithmetic)
8092 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8093 semantic_unexpr_plus)
8094 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8096 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8097 semantic_dereference)
8098 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8100 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8101 semantic_unexpr_integer)
8102 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8104 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8107 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8109 static expression_t *parse_##unexpression_type(expression_t *left) \
8111 expression_t *unary_expression \
8112 = allocate_expression_zero(unexpression_type); \
8114 unary_expression->unary.value = left; \
8116 sfunc(&unary_expression->unary); \
8118 return unary_expression; \
8121 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8122 EXPR_UNARY_POSTFIX_INCREMENT,
8124 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8125 EXPR_UNARY_POSTFIX_DECREMENT,
8128 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8130 /* TODO: handle complex + imaginary types */
8132 type_left = get_unqualified_type(type_left);
8133 type_right = get_unqualified_type(type_right);
8135 /* §6.3.1.8 Usual arithmetic conversions */
8136 if (type_left == type_long_double || type_right == type_long_double) {
8137 return type_long_double;
8138 } else if (type_left == type_double || type_right == type_double) {
8140 } else if (type_left == type_float || type_right == type_float) {
8144 type_left = promote_integer(type_left);
8145 type_right = promote_integer(type_right);
8147 if (type_left == type_right)
8150 bool const signed_left = is_type_signed(type_left);
8151 bool const signed_right = is_type_signed(type_right);
8152 int const rank_left = get_rank(type_left);
8153 int const rank_right = get_rank(type_right);
8155 if (signed_left == signed_right)
8156 return rank_left >= rank_right ? type_left : type_right;
8165 u_rank = rank_right;
8166 u_type = type_right;
8168 s_rank = rank_right;
8169 s_type = type_right;
8174 if (u_rank >= s_rank)
8177 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8179 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8180 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8184 case ATOMIC_TYPE_INT: return type_unsigned_int;
8185 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8186 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8188 default: panic("invalid atomic type");
8193 * Check the semantic restrictions for a binary expression.
8195 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8197 expression_t *const left = expression->left;
8198 expression_t *const right = expression->right;
8199 type_t *const orig_type_left = left->base.type;
8200 type_t *const orig_type_right = right->base.type;
8201 type_t *const type_left = skip_typeref(orig_type_left);
8202 type_t *const type_right = skip_typeref(orig_type_right);
8204 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8205 /* TODO: improve error message */
8206 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8207 errorf(&expression->base.source_position,
8208 "operation needs arithmetic types");
8213 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8214 expression->left = create_implicit_cast(left, arithmetic_type);
8215 expression->right = create_implicit_cast(right, arithmetic_type);
8216 expression->base.type = arithmetic_type;
8219 static void semantic_binexpr_integer(binary_expression_t *const expression)
8221 expression_t *const left = expression->left;
8222 expression_t *const right = expression->right;
8223 type_t *const orig_type_left = left->base.type;
8224 type_t *const orig_type_right = right->base.type;
8225 type_t *const type_left = skip_typeref(orig_type_left);
8226 type_t *const type_right = skip_typeref(orig_type_right);
8228 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8229 /* TODO: improve error message */
8230 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8231 errorf(&expression->base.source_position,
8232 "operation needs integer types");
8237 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8238 expression->left = create_implicit_cast(left, result_type);
8239 expression->right = create_implicit_cast(right, result_type);
8240 expression->base.type = result_type;
8243 static void warn_div_by_zero(binary_expression_t const *const expression)
8245 if (!warning.div_by_zero ||
8246 !is_type_integer(expression->base.type))
8249 expression_t const *const right = expression->right;
8250 /* The type of the right operand can be different for /= */
8251 if (is_type_integer(right->base.type) &&
8252 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8253 !fold_constant_to_bool(right)) {
8254 warningf(&expression->base.source_position, "division by zero");
8259 * Check the semantic restrictions for a div/mod expression.
8261 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8263 semantic_binexpr_arithmetic(expression);
8264 warn_div_by_zero(expression);
8267 static void warn_addsub_in_shift(const expression_t *const expr)
8269 if (expr->base.parenthesized)
8273 switch (expr->kind) {
8274 case EXPR_BINARY_ADD: op = '+'; break;
8275 case EXPR_BINARY_SUB: op = '-'; break;
8279 warningf(&expr->base.source_position,
8280 "suggest parentheses around '%c' inside shift", op);
8283 static bool semantic_shift(binary_expression_t *expression)
8285 expression_t *const left = expression->left;
8286 expression_t *const right = expression->right;
8287 type_t *const orig_type_left = left->base.type;
8288 type_t *const orig_type_right = right->base.type;
8289 type_t * type_left = skip_typeref(orig_type_left);
8290 type_t * type_right = skip_typeref(orig_type_right);
8292 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8293 /* TODO: improve error message */
8294 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8295 errorf(&expression->base.source_position,
8296 "operands of shift operation must have integer types");
8301 type_left = promote_integer(type_left);
8303 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8304 long count = fold_constant_to_int(right);
8306 warningf(&right->base.source_position,
8307 "shift count must be non-negative");
8308 } else if ((unsigned long)count >=
8309 get_atomic_type_size(type_left->atomic.akind) * 8) {
8310 warningf(&right->base.source_position,
8311 "shift count must be less than type width");
8315 type_right = promote_integer(type_right);
8316 expression->right = create_implicit_cast(right, type_right);
8321 static void semantic_shift_op(binary_expression_t *expression)
8323 expression_t *const left = expression->left;
8324 expression_t *const right = expression->right;
8326 if (!semantic_shift(expression))
8329 if (warning.parentheses) {
8330 warn_addsub_in_shift(left);
8331 warn_addsub_in_shift(right);
8334 type_t *const orig_type_left = left->base.type;
8335 type_t * type_left = skip_typeref(orig_type_left);
8337 type_left = promote_integer(type_left);
8338 expression->left = create_implicit_cast(left, type_left);
8339 expression->base.type = type_left;
8342 static void semantic_add(binary_expression_t *expression)
8344 expression_t *const left = expression->left;
8345 expression_t *const right = expression->right;
8346 type_t *const orig_type_left = left->base.type;
8347 type_t *const orig_type_right = right->base.type;
8348 type_t *const type_left = skip_typeref(orig_type_left);
8349 type_t *const type_right = skip_typeref(orig_type_right);
8352 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8353 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8354 expression->left = create_implicit_cast(left, arithmetic_type);
8355 expression->right = create_implicit_cast(right, arithmetic_type);
8356 expression->base.type = arithmetic_type;
8357 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8358 check_pointer_arithmetic(&expression->base.source_position,
8359 type_left, orig_type_left);
8360 expression->base.type = type_left;
8361 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8362 check_pointer_arithmetic(&expression->base.source_position,
8363 type_right, orig_type_right);
8364 expression->base.type = type_right;
8365 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8366 errorf(&expression->base.source_position,
8367 "invalid operands to binary + ('%T', '%T')",
8368 orig_type_left, orig_type_right);
8372 static void semantic_sub(binary_expression_t *expression)
8374 expression_t *const left = expression->left;
8375 expression_t *const right = expression->right;
8376 type_t *const orig_type_left = left->base.type;
8377 type_t *const orig_type_right = right->base.type;
8378 type_t *const type_left = skip_typeref(orig_type_left);
8379 type_t *const type_right = skip_typeref(orig_type_right);
8380 source_position_t const *const pos = &expression->base.source_position;
8383 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8384 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8385 expression->left = create_implicit_cast(left, arithmetic_type);
8386 expression->right = create_implicit_cast(right, arithmetic_type);
8387 expression->base.type = arithmetic_type;
8388 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8389 check_pointer_arithmetic(&expression->base.source_position,
8390 type_left, orig_type_left);
8391 expression->base.type = type_left;
8392 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8393 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8394 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8395 if (!types_compatible(unqual_left, unqual_right)) {
8397 "subtracting pointers to incompatible types '%T' and '%T'",
8398 orig_type_left, orig_type_right);
8399 } else if (!is_type_object(unqual_left)) {
8400 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8401 errorf(pos, "subtracting pointers to non-object types '%T'",
8403 } else if (warning.other) {
8404 warningf(pos, "subtracting pointers to void");
8407 expression->base.type = type_ptrdiff_t;
8408 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8409 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8410 orig_type_left, orig_type_right);
8414 static void warn_string_literal_address(expression_t const* expr)
8416 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8417 expr = expr->unary.value;
8418 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8420 expr = expr->unary.value;
8423 if (expr->kind == EXPR_STRING_LITERAL
8424 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8425 warningf(&expr->base.source_position,
8426 "comparison with string literal results in unspecified behaviour");
8430 static void warn_comparison_in_comparison(const expression_t *const expr)
8432 if (expr->base.parenthesized)
8434 switch (expr->base.kind) {
8435 case EXPR_BINARY_LESS:
8436 case EXPR_BINARY_GREATER:
8437 case EXPR_BINARY_LESSEQUAL:
8438 case EXPR_BINARY_GREATEREQUAL:
8439 case EXPR_BINARY_NOTEQUAL:
8440 case EXPR_BINARY_EQUAL:
8441 warningf(&expr->base.source_position,
8442 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8449 static bool maybe_negative(expression_t const *const expr)
8451 switch (is_constant_expression(expr)) {
8452 case EXPR_CLASS_ERROR: return false;
8453 case EXPR_CLASS_CONSTANT: return fold_constant_to_int(expr) < 0;
8454 default: return true;
8459 * Check the semantics of comparison expressions.
8461 * @param expression The expression to check.
8463 static void semantic_comparison(binary_expression_t *expression)
8465 expression_t *left = expression->left;
8466 expression_t *right = expression->right;
8468 if (warning.address) {
8469 warn_string_literal_address(left);
8470 warn_string_literal_address(right);
8472 expression_t const* const func_left = get_reference_address(left);
8473 if (func_left != NULL && is_null_pointer_constant(right)) {
8474 warningf(&expression->base.source_position,
8475 "the address of '%Y' will never be NULL",
8476 func_left->reference.entity->base.symbol);
8479 expression_t const* const func_right = get_reference_address(right);
8480 if (func_right != NULL && is_null_pointer_constant(right)) {
8481 warningf(&expression->base.source_position,
8482 "the address of '%Y' will never be NULL",
8483 func_right->reference.entity->base.symbol);
8487 if (warning.parentheses) {
8488 warn_comparison_in_comparison(left);
8489 warn_comparison_in_comparison(right);
8492 type_t *orig_type_left = left->base.type;
8493 type_t *orig_type_right = right->base.type;
8494 type_t *type_left = skip_typeref(orig_type_left);
8495 type_t *type_right = skip_typeref(orig_type_right);
8497 /* TODO non-arithmetic types */
8498 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8499 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8501 /* test for signed vs unsigned compares */
8502 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8503 bool const signed_left = is_type_signed(type_left);
8504 bool const signed_right = is_type_signed(type_right);
8505 if (signed_left != signed_right) {
8506 /* FIXME long long needs better const folding magic */
8507 /* TODO check whether constant value can be represented by other type */
8508 if ((signed_left && maybe_negative(left)) ||
8509 (signed_right && maybe_negative(right))) {
8510 warningf(&expression->base.source_position,
8511 "comparison between signed and unsigned");
8516 expression->left = create_implicit_cast(left, arithmetic_type);
8517 expression->right = create_implicit_cast(right, arithmetic_type);
8518 expression->base.type = arithmetic_type;
8519 if (warning.float_equal &&
8520 (expression->base.kind == EXPR_BINARY_EQUAL ||
8521 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8522 is_type_float(arithmetic_type)) {
8523 warningf(&expression->base.source_position,
8524 "comparing floating point with == or != is unsafe");
8526 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8527 /* TODO check compatibility */
8528 } else if (is_type_pointer(type_left)) {
8529 expression->right = create_implicit_cast(right, type_left);
8530 } else if (is_type_pointer(type_right)) {
8531 expression->left = create_implicit_cast(left, type_right);
8532 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8533 type_error_incompatible("invalid operands in comparison",
8534 &expression->base.source_position,
8535 type_left, type_right);
8537 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8541 * Checks if a compound type has constant fields.
8543 static bool has_const_fields(const compound_type_t *type)
8545 compound_t *compound = type->compound;
8546 entity_t *entry = compound->members.entities;
8548 for (; entry != NULL; entry = entry->base.next) {
8549 if (!is_declaration(entry))
8552 const type_t *decl_type = skip_typeref(entry->declaration.type);
8553 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8560 static bool is_valid_assignment_lhs(expression_t const* const left)
8562 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8563 type_t *const type_left = skip_typeref(orig_type_left);
8565 if (!is_lvalue(left)) {
8566 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8571 if (left->kind == EXPR_REFERENCE
8572 && left->reference.entity->kind == ENTITY_FUNCTION) {
8573 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8577 if (is_type_array(type_left)) {
8578 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8581 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8582 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8586 if (is_type_incomplete(type_left)) {
8587 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8588 left, orig_type_left);
8591 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8592 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8593 left, orig_type_left);
8600 static void semantic_arithmetic_assign(binary_expression_t *expression)
8602 expression_t *left = expression->left;
8603 expression_t *right = expression->right;
8604 type_t *orig_type_left = left->base.type;
8605 type_t *orig_type_right = right->base.type;
8607 if (!is_valid_assignment_lhs(left))
8610 type_t *type_left = skip_typeref(orig_type_left);
8611 type_t *type_right = skip_typeref(orig_type_right);
8613 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8614 /* TODO: improve error message */
8615 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8616 errorf(&expression->base.source_position,
8617 "operation needs arithmetic types");
8622 /* combined instructions are tricky. We can't create an implicit cast on
8623 * the left side, because we need the uncasted form for the store.
8624 * The ast2firm pass has to know that left_type must be right_type
8625 * for the arithmetic operation and create a cast by itself */
8626 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8627 expression->right = create_implicit_cast(right, arithmetic_type);
8628 expression->base.type = type_left;
8631 static void semantic_divmod_assign(binary_expression_t *expression)
8633 semantic_arithmetic_assign(expression);
8634 warn_div_by_zero(expression);
8637 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8639 expression_t *const left = expression->left;
8640 expression_t *const right = expression->right;
8641 type_t *const orig_type_left = left->base.type;
8642 type_t *const orig_type_right = right->base.type;
8643 type_t *const type_left = skip_typeref(orig_type_left);
8644 type_t *const type_right = skip_typeref(orig_type_right);
8646 if (!is_valid_assignment_lhs(left))
8649 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8650 /* combined instructions are tricky. We can't create an implicit cast on
8651 * the left side, because we need the uncasted form for the store.
8652 * The ast2firm pass has to know that left_type must be right_type
8653 * for the arithmetic operation and create a cast by itself */
8654 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8655 expression->right = create_implicit_cast(right, arithmetic_type);
8656 expression->base.type = type_left;
8657 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8658 check_pointer_arithmetic(&expression->base.source_position,
8659 type_left, orig_type_left);
8660 expression->base.type = type_left;
8661 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8662 errorf(&expression->base.source_position,
8663 "incompatible types '%T' and '%T' in assignment",
8664 orig_type_left, orig_type_right);
8668 static void semantic_integer_assign(binary_expression_t *expression)
8670 expression_t *left = expression->left;
8671 expression_t *right = expression->right;
8672 type_t *orig_type_left = left->base.type;
8673 type_t *orig_type_right = right->base.type;
8675 if (!is_valid_assignment_lhs(left))
8678 type_t *type_left = skip_typeref(orig_type_left);
8679 type_t *type_right = skip_typeref(orig_type_right);
8681 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8682 /* TODO: improve error message */
8683 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8684 errorf(&expression->base.source_position,
8685 "operation needs integer types");
8690 /* combined instructions are tricky. We can't create an implicit cast on
8691 * the left side, because we need the uncasted form for the store.
8692 * The ast2firm pass has to know that left_type must be right_type
8693 * for the arithmetic operation and create a cast by itself */
8694 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8695 expression->right = create_implicit_cast(right, arithmetic_type);
8696 expression->base.type = type_left;
8699 static void semantic_shift_assign(binary_expression_t *expression)
8701 expression_t *left = expression->left;
8703 if (!is_valid_assignment_lhs(left))
8706 if (!semantic_shift(expression))
8709 expression->base.type = skip_typeref(left->base.type);
8712 static void warn_logical_and_within_or(const expression_t *const expr)
8714 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8716 if (expr->base.parenthesized)
8718 warningf(&expr->base.source_position,
8719 "suggest parentheses around && within ||");
8723 * Check the semantic restrictions of a logical expression.
8725 static void semantic_logical_op(binary_expression_t *expression)
8727 /* §6.5.13:2 Each of the operands shall have scalar type.
8728 * §6.5.14:2 Each of the operands shall have scalar type. */
8729 semantic_condition(expression->left, "left operand of logical operator");
8730 semantic_condition(expression->right, "right operand of logical operator");
8731 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8732 warning.parentheses) {
8733 warn_logical_and_within_or(expression->left);
8734 warn_logical_and_within_or(expression->right);
8736 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8740 * Check the semantic restrictions of a binary assign expression.
8742 static void semantic_binexpr_assign(binary_expression_t *expression)
8744 expression_t *left = expression->left;
8745 type_t *orig_type_left = left->base.type;
8747 if (!is_valid_assignment_lhs(left))
8750 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8751 report_assign_error(error, orig_type_left, expression->right,
8752 "assignment", &left->base.source_position);
8753 expression->right = create_implicit_cast(expression->right, orig_type_left);
8754 expression->base.type = orig_type_left;
8758 * Determine if the outermost operation (or parts thereof) of the given
8759 * expression has no effect in order to generate a warning about this fact.
8760 * Therefore in some cases this only examines some of the operands of the
8761 * expression (see comments in the function and examples below).
8763 * f() + 23; // warning, because + has no effect
8764 * x || f(); // no warning, because x controls execution of f()
8765 * x ? y : f(); // warning, because y has no effect
8766 * (void)x; // no warning to be able to suppress the warning
8767 * This function can NOT be used for an "expression has definitely no effect"-
8769 static bool expression_has_effect(const expression_t *const expr)
8771 switch (expr->kind) {
8772 case EXPR_UNKNOWN: break;
8773 case EXPR_INVALID: return true; /* do NOT warn */
8774 case EXPR_REFERENCE: return false;
8775 case EXPR_REFERENCE_ENUM_VALUE: return false;
8776 case EXPR_LABEL_ADDRESS: return false;
8778 /* suppress the warning for microsoft __noop operations */
8779 case EXPR_LITERAL_MS_NOOP: return true;
8780 case EXPR_LITERAL_BOOLEAN:
8781 case EXPR_LITERAL_CHARACTER:
8782 case EXPR_LITERAL_WIDE_CHARACTER:
8783 case EXPR_LITERAL_INTEGER:
8784 case EXPR_LITERAL_INTEGER_OCTAL:
8785 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8786 case EXPR_LITERAL_FLOATINGPOINT:
8787 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8788 case EXPR_STRING_LITERAL: return false;
8789 case EXPR_WIDE_STRING_LITERAL: return false;
8792 const call_expression_t *const call = &expr->call;
8793 if (call->function->kind != EXPR_REFERENCE)
8796 switch (call->function->reference.entity->function.btk) {
8797 /* FIXME: which builtins have no effect? */
8798 default: return true;
8802 /* Generate the warning if either the left or right hand side of a
8803 * conditional expression has no effect */
8804 case EXPR_CONDITIONAL: {
8805 conditional_expression_t const *const cond = &expr->conditional;
8806 expression_t const *const t = cond->true_expression;
8808 (t == NULL || expression_has_effect(t)) &&
8809 expression_has_effect(cond->false_expression);
8812 case EXPR_SELECT: return false;
8813 case EXPR_ARRAY_ACCESS: return false;
8814 case EXPR_SIZEOF: return false;
8815 case EXPR_CLASSIFY_TYPE: return false;
8816 case EXPR_ALIGNOF: return false;
8818 case EXPR_FUNCNAME: return false;
8819 case EXPR_BUILTIN_CONSTANT_P: return false;
8820 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8821 case EXPR_OFFSETOF: return false;
8822 case EXPR_VA_START: return true;
8823 case EXPR_VA_ARG: return true;
8824 case EXPR_VA_COPY: return true;
8825 case EXPR_STATEMENT: return true; // TODO
8826 case EXPR_COMPOUND_LITERAL: return false;
8828 case EXPR_UNARY_NEGATE: return false;
8829 case EXPR_UNARY_PLUS: return false;
8830 case EXPR_UNARY_BITWISE_NEGATE: return false;
8831 case EXPR_UNARY_NOT: return false;
8832 case EXPR_UNARY_DEREFERENCE: return false;
8833 case EXPR_UNARY_TAKE_ADDRESS: return false;
8834 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8835 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8836 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8837 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8839 /* Treat void casts as if they have an effect in order to being able to
8840 * suppress the warning */
8841 case EXPR_UNARY_CAST: {
8842 type_t *const type = skip_typeref(expr->base.type);
8843 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8846 case EXPR_UNARY_CAST_IMPLICIT: return true;
8847 case EXPR_UNARY_ASSUME: return true;
8848 case EXPR_UNARY_DELETE: return true;
8849 case EXPR_UNARY_DELETE_ARRAY: return true;
8850 case EXPR_UNARY_THROW: return true;
8852 case EXPR_BINARY_ADD: return false;
8853 case EXPR_BINARY_SUB: return false;
8854 case EXPR_BINARY_MUL: return false;
8855 case EXPR_BINARY_DIV: return false;
8856 case EXPR_BINARY_MOD: return false;
8857 case EXPR_BINARY_EQUAL: return false;
8858 case EXPR_BINARY_NOTEQUAL: return false;
8859 case EXPR_BINARY_LESS: return false;
8860 case EXPR_BINARY_LESSEQUAL: return false;
8861 case EXPR_BINARY_GREATER: return false;
8862 case EXPR_BINARY_GREATEREQUAL: return false;
8863 case EXPR_BINARY_BITWISE_AND: return false;
8864 case EXPR_BINARY_BITWISE_OR: return false;
8865 case EXPR_BINARY_BITWISE_XOR: return false;
8866 case EXPR_BINARY_SHIFTLEFT: return false;
8867 case EXPR_BINARY_SHIFTRIGHT: return false;
8868 case EXPR_BINARY_ASSIGN: return true;
8869 case EXPR_BINARY_MUL_ASSIGN: return true;
8870 case EXPR_BINARY_DIV_ASSIGN: return true;
8871 case EXPR_BINARY_MOD_ASSIGN: return true;
8872 case EXPR_BINARY_ADD_ASSIGN: return true;
8873 case EXPR_BINARY_SUB_ASSIGN: return true;
8874 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8875 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8876 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8877 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8878 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8880 /* Only examine the right hand side of && and ||, because the left hand
8881 * side already has the effect of controlling the execution of the right
8883 case EXPR_BINARY_LOGICAL_AND:
8884 case EXPR_BINARY_LOGICAL_OR:
8885 /* Only examine the right hand side of a comma expression, because the left
8886 * hand side has a separate warning */
8887 case EXPR_BINARY_COMMA:
8888 return expression_has_effect(expr->binary.right);
8890 case EXPR_BINARY_ISGREATER: return false;
8891 case EXPR_BINARY_ISGREATEREQUAL: return false;
8892 case EXPR_BINARY_ISLESS: return false;
8893 case EXPR_BINARY_ISLESSEQUAL: return false;
8894 case EXPR_BINARY_ISLESSGREATER: return false;
8895 case EXPR_BINARY_ISUNORDERED: return false;
8898 internal_errorf(HERE, "unexpected expression");
8901 static void semantic_comma(binary_expression_t *expression)
8903 if (warning.unused_value) {
8904 const expression_t *const left = expression->left;
8905 if (!expression_has_effect(left)) {
8906 warningf(&left->base.source_position,
8907 "left-hand operand of comma expression has no effect");
8910 expression->base.type = expression->right->base.type;
8914 * @param prec_r precedence of the right operand
8916 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8917 static expression_t *parse_##binexpression_type(expression_t *left) \
8919 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8920 binexpr->binary.left = left; \
8923 expression_t *right = parse_subexpression(prec_r); \
8925 binexpr->binary.right = right; \
8926 sfunc(&binexpr->binary); \
8931 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8932 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8933 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8934 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8935 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8936 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8937 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8938 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8939 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8940 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8941 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8942 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8943 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8944 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8945 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8946 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8947 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8948 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8949 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8950 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8951 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8952 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8953 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8954 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8955 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8956 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8957 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8958 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8959 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8960 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8963 static expression_t *parse_subexpression(precedence_t precedence)
8965 if (token.type < 0) {
8966 return expected_expression_error();
8969 expression_parser_function_t *parser
8970 = &expression_parsers[token.type];
8971 source_position_t source_position = token.source_position;
8974 if (parser->parser != NULL) {
8975 left = parser->parser();
8977 left = parse_primary_expression();
8979 assert(left != NULL);
8980 left->base.source_position = source_position;
8983 if (token.type < 0) {
8984 return expected_expression_error();
8987 parser = &expression_parsers[token.type];
8988 if (parser->infix_parser == NULL)
8990 if (parser->infix_precedence < precedence)
8993 left = parser->infix_parser(left);
8995 assert(left != NULL);
8996 assert(left->kind != EXPR_UNKNOWN);
8997 left->base.source_position = source_position;
9004 * Parse an expression.
9006 static expression_t *parse_expression(void)
9008 return parse_subexpression(PREC_EXPRESSION);
9012 * Register a parser for a prefix-like operator.
9014 * @param parser the parser function
9015 * @param token_type the token type of the prefix token
9017 static void register_expression_parser(parse_expression_function parser,
9020 expression_parser_function_t *entry = &expression_parsers[token_type];
9022 if (entry->parser != NULL) {
9023 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9024 panic("trying to register multiple expression parsers for a token");
9026 entry->parser = parser;
9030 * Register a parser for an infix operator with given precedence.
9032 * @param parser the parser function
9033 * @param token_type the token type of the infix operator
9034 * @param precedence the precedence of the operator
9036 static void register_infix_parser(parse_expression_infix_function parser,
9037 int token_type, precedence_t precedence)
9039 expression_parser_function_t *entry = &expression_parsers[token_type];
9041 if (entry->infix_parser != NULL) {
9042 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9043 panic("trying to register multiple infix expression parsers for a "
9046 entry->infix_parser = parser;
9047 entry->infix_precedence = precedence;
9051 * Initialize the expression parsers.
9053 static void init_expression_parsers(void)
9055 memset(&expression_parsers, 0, sizeof(expression_parsers));
9057 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9058 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9059 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9060 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9061 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9062 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9063 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9064 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9065 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9066 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9067 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9068 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9069 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9070 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9071 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9072 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9073 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9074 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9075 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9076 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9077 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9078 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9079 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9080 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9081 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9082 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9083 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9084 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9085 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9086 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9087 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9088 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9089 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9090 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9091 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9092 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9093 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9095 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9096 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9097 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9098 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9099 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9100 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9101 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9102 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9103 register_expression_parser(parse_sizeof, T_sizeof);
9104 register_expression_parser(parse_alignof, T___alignof__);
9105 register_expression_parser(parse_extension, T___extension__);
9106 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9107 register_expression_parser(parse_delete, T_delete);
9108 register_expression_parser(parse_throw, T_throw);
9112 * Parse a asm statement arguments specification.
9114 static asm_argument_t *parse_asm_arguments(bool is_out)
9116 asm_argument_t *result = NULL;
9117 asm_argument_t **anchor = &result;
9119 while (token.type == T_STRING_LITERAL || token.type == '[') {
9120 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9121 memset(argument, 0, sizeof(argument[0]));
9124 if (token.type != T_IDENTIFIER) {
9125 parse_error_expected("while parsing asm argument",
9126 T_IDENTIFIER, NULL);
9129 argument->symbol = token.symbol;
9131 expect(']', end_error);
9134 argument->constraints = parse_string_literals();
9135 expect('(', end_error);
9136 add_anchor_token(')');
9137 expression_t *expression = parse_expression();
9138 rem_anchor_token(')');
9140 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9141 * change size or type representation (e.g. int -> long is ok, but
9142 * int -> float is not) */
9143 if (expression->kind == EXPR_UNARY_CAST) {
9144 type_t *const type = expression->base.type;
9145 type_kind_t const kind = type->kind;
9146 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9149 if (kind == TYPE_ATOMIC) {
9150 atomic_type_kind_t const akind = type->atomic.akind;
9151 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9152 size = get_atomic_type_size(akind);
9154 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9155 size = get_atomic_type_size(get_intptr_kind());
9159 expression_t *const value = expression->unary.value;
9160 type_t *const value_type = value->base.type;
9161 type_kind_t const value_kind = value_type->kind;
9163 unsigned value_flags;
9164 unsigned value_size;
9165 if (value_kind == TYPE_ATOMIC) {
9166 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9167 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9168 value_size = get_atomic_type_size(value_akind);
9169 } else if (value_kind == TYPE_POINTER) {
9170 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9171 value_size = get_atomic_type_size(get_intptr_kind());
9176 if (value_flags != flags || value_size != size)
9180 } while (expression->kind == EXPR_UNARY_CAST);
9184 if (!is_lvalue(expression)) {
9185 errorf(&expression->base.source_position,
9186 "asm output argument is not an lvalue");
9189 if (argument->constraints.begin[0] == '=')
9190 determine_lhs_ent(expression, NULL);
9192 mark_vars_read(expression, NULL);
9194 mark_vars_read(expression, NULL);
9196 argument->expression = expression;
9197 expect(')', end_error);
9199 set_address_taken(expression, true);
9202 anchor = &argument->next;
9214 * Parse a asm statement clobber specification.
9216 static asm_clobber_t *parse_asm_clobbers(void)
9218 asm_clobber_t *result = NULL;
9219 asm_clobber_t **anchor = &result;
9221 while (token.type == T_STRING_LITERAL) {
9222 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9223 clobber->clobber = parse_string_literals();
9226 anchor = &clobber->next;
9236 * Parse an asm statement.
9238 static statement_t *parse_asm_statement(void)
9240 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9241 asm_statement_t *asm_statement = &statement->asms;
9245 if (next_if(T_volatile))
9246 asm_statement->is_volatile = true;
9248 expect('(', end_error);
9249 add_anchor_token(')');
9250 if (token.type != T_STRING_LITERAL) {
9251 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9254 asm_statement->asm_text = parse_string_literals();
9256 add_anchor_token(':');
9257 if (!next_if(':')) {
9258 rem_anchor_token(':');
9262 asm_statement->outputs = parse_asm_arguments(true);
9263 if (!next_if(':')) {
9264 rem_anchor_token(':');
9268 asm_statement->inputs = parse_asm_arguments(false);
9269 if (!next_if(':')) {
9270 rem_anchor_token(':');
9273 rem_anchor_token(':');
9275 asm_statement->clobbers = parse_asm_clobbers();
9278 rem_anchor_token(')');
9279 expect(')', end_error);
9280 expect(';', end_error);
9282 if (asm_statement->outputs == NULL) {
9283 /* GCC: An 'asm' instruction without any output operands will be treated
9284 * identically to a volatile 'asm' instruction. */
9285 asm_statement->is_volatile = true;
9290 return create_invalid_statement();
9293 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9295 statement_t *inner_stmt;
9296 switch (token.type) {
9298 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9299 inner_stmt = create_invalid_statement();
9303 if (label->kind == STATEMENT_LABEL) {
9304 /* Eat an empty statement here, to avoid the warning about an empty
9305 * statement after a label. label:; is commonly used to have a label
9306 * before a closing brace. */
9307 inner_stmt = create_empty_statement();
9314 inner_stmt = parse_statement();
9315 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9316 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9317 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9325 * Parse a case statement.
9327 static statement_t *parse_case_statement(void)
9329 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9330 source_position_t *const pos = &statement->base.source_position;
9334 expression_t *const expression = parse_expression();
9335 statement->case_label.expression = expression;
9336 expression_classification_t const expr_class = is_constant_expression(expression);
9337 if (expr_class != EXPR_CLASS_CONSTANT) {
9338 if (expr_class != EXPR_CLASS_ERROR) {
9339 errorf(pos, "case label does not reduce to an integer constant");
9341 statement->case_label.is_bad = true;
9343 long const val = fold_constant_to_int(expression);
9344 statement->case_label.first_case = val;
9345 statement->case_label.last_case = val;
9349 if (next_if(T_DOTDOTDOT)) {
9350 expression_t *const end_range = parse_expression();
9351 statement->case_label.end_range = end_range;
9352 expression_classification_t const end_class = is_constant_expression(end_range);
9353 if (end_class != EXPR_CLASS_CONSTANT) {
9354 if (end_class != EXPR_CLASS_ERROR) {
9355 errorf(pos, "case range does not reduce to an integer constant");
9357 statement->case_label.is_bad = true;
9359 long const val = fold_constant_to_int(end_range);
9360 statement->case_label.last_case = val;
9362 if (warning.other && val < statement->case_label.first_case) {
9363 statement->case_label.is_empty_range = true;
9364 warningf(pos, "empty range specified");
9370 PUSH_PARENT(statement);
9372 expect(':', end_error);
9375 if (current_switch != NULL) {
9376 if (! statement->case_label.is_bad) {
9377 /* Check for duplicate case values */
9378 case_label_statement_t *c = &statement->case_label;
9379 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9380 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9383 if (c->last_case < l->first_case || c->first_case > l->last_case)
9386 errorf(pos, "duplicate case value (previously used %P)",
9387 &l->base.source_position);
9391 /* link all cases into the switch statement */
9392 if (current_switch->last_case == NULL) {
9393 current_switch->first_case = &statement->case_label;
9395 current_switch->last_case->next = &statement->case_label;
9397 current_switch->last_case = &statement->case_label;
9399 errorf(pos, "case label not within a switch statement");
9402 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9409 * Parse a default statement.
9411 static statement_t *parse_default_statement(void)
9413 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9417 PUSH_PARENT(statement);
9419 expect(':', end_error);
9422 if (current_switch != NULL) {
9423 const case_label_statement_t *def_label = current_switch->default_label;
9424 if (def_label != NULL) {
9425 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9426 &def_label->base.source_position);
9428 current_switch->default_label = &statement->case_label;
9430 /* link all cases into the switch statement */
9431 if (current_switch->last_case == NULL) {
9432 current_switch->first_case = &statement->case_label;
9434 current_switch->last_case->next = &statement->case_label;
9436 current_switch->last_case = &statement->case_label;
9439 errorf(&statement->base.source_position,
9440 "'default' label not within a switch statement");
9443 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9450 * Parse a label statement.
9452 static statement_t *parse_label_statement(void)
9454 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9455 label_t *const label = get_label();
9456 statement->label.label = label;
9458 PUSH_PARENT(statement);
9460 /* if statement is already set then the label is defined twice,
9461 * otherwise it was just mentioned in a goto/local label declaration so far
9463 if (label->statement != NULL) {
9464 errorf(HERE, "duplicate label '%Y' (declared %P)", label->base.symbol, &label->base.source_position);
9466 label->base.source_position = token.source_position;
9467 label->statement = statement;
9472 statement->label.statement = parse_label_inner_statement(statement, "label");
9474 /* remember the labels in a list for later checking */
9475 *label_anchor = &statement->label;
9476 label_anchor = &statement->label.next;
9483 * Parse an if statement.
9485 static statement_t *parse_if(void)
9487 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9491 PUSH_PARENT(statement);
9493 add_anchor_token('{');
9495 expect('(', end_error);
9496 add_anchor_token(')');
9497 expression_t *const expr = parse_expression();
9498 statement->ifs.condition = expr;
9499 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9501 semantic_condition(expr, "condition of 'if'-statment");
9502 mark_vars_read(expr, NULL);
9503 rem_anchor_token(')');
9504 expect(')', end_error);
9507 rem_anchor_token('{');
9509 add_anchor_token(T_else);
9510 statement_t *const true_stmt = parse_statement();
9511 statement->ifs.true_statement = true_stmt;
9512 rem_anchor_token(T_else);
9514 if (next_if(T_else)) {
9515 statement->ifs.false_statement = parse_statement();
9516 } else if (warning.parentheses &&
9517 true_stmt->kind == STATEMENT_IF &&
9518 true_stmt->ifs.false_statement != NULL) {
9519 warningf(&true_stmt->base.source_position,
9520 "suggest explicit braces to avoid ambiguous 'else'");
9528 * Check that all enums are handled in a switch.
9530 * @param statement the switch statement to check
9532 static void check_enum_cases(const switch_statement_t *statement)
9534 const type_t *type = skip_typeref(statement->expression->base.type);
9535 if (! is_type_enum(type))
9537 const enum_type_t *enumt = &type->enumt;
9539 /* if we have a default, no warnings */
9540 if (statement->default_label != NULL)
9543 /* FIXME: calculation of value should be done while parsing */
9544 /* TODO: quadratic algorithm here. Change to an n log n one */
9545 long last_value = -1;
9546 const entity_t *entry = enumt->enume->base.next;
9547 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9548 entry = entry->base.next) {
9549 const expression_t *expression = entry->enum_value.value;
9550 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9552 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9553 if (l->expression == NULL)
9555 if (l->first_case <= value && value <= l->last_case) {
9561 warningf(&statement->base.source_position,
9562 "enumeration value '%Y' not handled in switch",
9563 entry->base.symbol);
9570 * Parse a switch statement.
9572 static statement_t *parse_switch(void)
9574 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9578 PUSH_PARENT(statement);
9580 expect('(', end_error);
9581 add_anchor_token(')');
9582 expression_t *const expr = parse_expression();
9583 mark_vars_read(expr, NULL);
9584 type_t * type = skip_typeref(expr->base.type);
9585 if (is_type_integer(type)) {
9586 type = promote_integer(type);
9587 if (warning.traditional) {
9588 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9589 warningf(&expr->base.source_position,
9590 "'%T' switch expression not converted to '%T' in ISO C",
9594 } else if (is_type_valid(type)) {
9595 errorf(&expr->base.source_position,
9596 "switch quantity is not an integer, but '%T'", type);
9597 type = type_error_type;
9599 statement->switchs.expression = create_implicit_cast(expr, type);
9600 expect(')', end_error);
9601 rem_anchor_token(')');
9603 switch_statement_t *rem = current_switch;
9604 current_switch = &statement->switchs;
9605 statement->switchs.body = parse_statement();
9606 current_switch = rem;
9608 if (warning.switch_default &&
9609 statement->switchs.default_label == NULL) {
9610 warningf(&statement->base.source_position, "switch has no default case");
9612 if (warning.switch_enum)
9613 check_enum_cases(&statement->switchs);
9619 return create_invalid_statement();
9622 static statement_t *parse_loop_body(statement_t *const loop)
9624 statement_t *const rem = current_loop;
9625 current_loop = loop;
9627 statement_t *const body = parse_statement();
9634 * Parse a while statement.
9636 static statement_t *parse_while(void)
9638 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9642 PUSH_PARENT(statement);
9644 expect('(', end_error);
9645 add_anchor_token(')');
9646 expression_t *const cond = parse_expression();
9647 statement->whiles.condition = cond;
9648 /* §6.8.5:2 The controlling expression of an iteration statement shall
9649 * have scalar type. */
9650 semantic_condition(cond, "condition of 'while'-statement");
9651 mark_vars_read(cond, NULL);
9652 rem_anchor_token(')');
9653 expect(')', end_error);
9655 statement->whiles.body = parse_loop_body(statement);
9661 return create_invalid_statement();
9665 * Parse a do statement.
9667 static statement_t *parse_do(void)
9669 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9673 PUSH_PARENT(statement);
9675 add_anchor_token(T_while);
9676 statement->do_while.body = parse_loop_body(statement);
9677 rem_anchor_token(T_while);
9679 expect(T_while, end_error);
9680 expect('(', end_error);
9681 add_anchor_token(')');
9682 expression_t *const cond = parse_expression();
9683 statement->do_while.condition = cond;
9684 /* §6.8.5:2 The controlling expression of an iteration statement shall
9685 * have scalar type. */
9686 semantic_condition(cond, "condition of 'do-while'-statement");
9687 mark_vars_read(cond, NULL);
9688 rem_anchor_token(')');
9689 expect(')', end_error);
9690 expect(';', end_error);
9696 return create_invalid_statement();
9700 * Parse a for statement.
9702 static statement_t *parse_for(void)
9704 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9708 expect('(', end_error1);
9709 add_anchor_token(')');
9711 PUSH_PARENT(statement);
9713 size_t const top = environment_top();
9714 scope_t *old_scope = scope_push(&statement->fors.scope);
9716 bool old_gcc_extension = in_gcc_extension;
9717 while (next_if(T___extension__)) {
9718 in_gcc_extension = true;
9722 } else if (is_declaration_specifier(&token, false)) {
9723 parse_declaration(record_entity, DECL_FLAGS_NONE);
9725 add_anchor_token(';');
9726 expression_t *const init = parse_expression();
9727 statement->fors.initialisation = init;
9728 mark_vars_read(init, ENT_ANY);
9729 if (warning.unused_value && !expression_has_effect(init)) {
9730 warningf(&init->base.source_position,
9731 "initialisation of 'for'-statement has no effect");
9733 rem_anchor_token(';');
9734 expect(';', end_error2);
9736 in_gcc_extension = old_gcc_extension;
9738 if (token.type != ';') {
9739 add_anchor_token(';');
9740 expression_t *const cond = parse_expression();
9741 statement->fors.condition = cond;
9742 /* §6.8.5:2 The controlling expression of an iteration statement
9743 * shall have scalar type. */
9744 semantic_condition(cond, "condition of 'for'-statement");
9745 mark_vars_read(cond, NULL);
9746 rem_anchor_token(';');
9748 expect(';', end_error2);
9749 if (token.type != ')') {
9750 expression_t *const step = parse_expression();
9751 statement->fors.step = step;
9752 mark_vars_read(step, ENT_ANY);
9753 if (warning.unused_value && !expression_has_effect(step)) {
9754 warningf(&step->base.source_position,
9755 "step of 'for'-statement has no effect");
9758 expect(')', end_error2);
9759 rem_anchor_token(')');
9760 statement->fors.body = parse_loop_body(statement);
9762 assert(current_scope == &statement->fors.scope);
9763 scope_pop(old_scope);
9764 environment_pop_to(top);
9771 rem_anchor_token(')');
9772 assert(current_scope == &statement->fors.scope);
9773 scope_pop(old_scope);
9774 environment_pop_to(top);
9778 return create_invalid_statement();
9782 * Parse a goto statement.
9784 static statement_t *parse_goto(void)
9786 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9789 if (GNU_MODE && next_if('*')) {
9790 expression_t *expression = parse_expression();
9791 mark_vars_read(expression, NULL);
9793 /* Argh: although documentation says the expression must be of type void*,
9794 * gcc accepts anything that can be casted into void* without error */
9795 type_t *type = expression->base.type;
9797 if (type != type_error_type) {
9798 if (!is_type_pointer(type) && !is_type_integer(type)) {
9799 errorf(&expression->base.source_position,
9800 "cannot convert to a pointer type");
9801 } else if (warning.other && type != type_void_ptr) {
9802 warningf(&expression->base.source_position,
9803 "type of computed goto expression should be 'void*' not '%T'", type);
9805 expression = create_implicit_cast(expression, type_void_ptr);
9808 statement->gotos.expression = expression;
9809 } else if (token.type == T_IDENTIFIER) {
9810 label_t *const label = get_label();
9812 statement->gotos.label = label;
9815 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9817 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9819 return create_invalid_statement();
9822 /* remember the goto's in a list for later checking */
9823 *goto_anchor = &statement->gotos;
9824 goto_anchor = &statement->gotos.next;
9826 expect(';', end_error);
9833 * Parse a continue statement.
9835 static statement_t *parse_continue(void)
9837 if (current_loop == NULL) {
9838 errorf(HERE, "continue statement not within loop");
9841 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9844 expect(';', end_error);
9851 * Parse a break statement.
9853 static statement_t *parse_break(void)
9855 if (current_switch == NULL && current_loop == NULL) {
9856 errorf(HERE, "break statement not within loop or switch");
9859 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9862 expect(';', end_error);
9869 * Parse a __leave statement.
9871 static statement_t *parse_leave_statement(void)
9873 if (current_try == NULL) {
9874 errorf(HERE, "__leave statement not within __try");
9877 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9880 expect(';', end_error);
9887 * Check if a given entity represents a local variable.
9889 static bool is_local_variable(const entity_t *entity)
9891 if (entity->kind != ENTITY_VARIABLE)
9894 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9895 case STORAGE_CLASS_AUTO:
9896 case STORAGE_CLASS_REGISTER: {
9897 const type_t *type = skip_typeref(entity->declaration.type);
9898 if (is_type_function(type)) {
9910 * Check if a given expression represents a local variable.
9912 static bool expression_is_local_variable(const expression_t *expression)
9914 if (expression->base.kind != EXPR_REFERENCE) {
9917 const entity_t *entity = expression->reference.entity;
9918 return is_local_variable(entity);
9922 * Check if a given expression represents a local variable and
9923 * return its declaration then, else return NULL.
9925 entity_t *expression_is_variable(const expression_t *expression)
9927 if (expression->base.kind != EXPR_REFERENCE) {
9930 entity_t *entity = expression->reference.entity;
9931 if (entity->kind != ENTITY_VARIABLE)
9938 * Parse a return statement.
9940 static statement_t *parse_return(void)
9944 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9946 expression_t *return_value = NULL;
9947 if (token.type != ';') {
9948 return_value = parse_expression();
9949 mark_vars_read(return_value, NULL);
9952 const type_t *const func_type = skip_typeref(current_function->base.type);
9953 assert(is_type_function(func_type));
9954 type_t *const return_type = skip_typeref(func_type->function.return_type);
9956 source_position_t const *const pos = &statement->base.source_position;
9957 if (return_value != NULL) {
9958 type_t *return_value_type = skip_typeref(return_value->base.type);
9960 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9961 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9962 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9963 /* Only warn in C mode, because GCC does the same */
9964 if (c_mode & _CXX || strict_mode) {
9966 "'return' with a value, in function returning 'void'");
9967 } else if (warning.other) {
9969 "'return' with a value, in function returning 'void'");
9971 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9972 /* Only warn in C mode, because GCC does the same */
9975 "'return' with expression in function returning 'void'");
9976 } else if (warning.other) {
9978 "'return' with expression in function returning 'void'");
9982 assign_error_t error = semantic_assign(return_type, return_value);
9983 report_assign_error(error, return_type, return_value, "'return'",
9986 return_value = create_implicit_cast(return_value, return_type);
9987 /* check for returning address of a local var */
9988 if (warning.other && return_value != NULL
9989 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9990 const expression_t *expression = return_value->unary.value;
9991 if (expression_is_local_variable(expression)) {
9992 warningf(pos, "function returns address of local variable");
9995 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9996 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9997 if (c_mode & _CXX || strict_mode) {
9999 "'return' without value, in function returning non-void");
10002 "'return' without value, in function returning non-void");
10005 statement->returns.value = return_value;
10007 expect(';', end_error);
10014 * Parse a declaration statement.
10016 static statement_t *parse_declaration_statement(void)
10018 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10020 entity_t *before = current_scope->last_entity;
10022 parse_external_declaration();
10024 parse_declaration(record_entity, DECL_FLAGS_NONE);
10027 declaration_statement_t *const decl = &statement->declaration;
10028 entity_t *const begin =
10029 before != NULL ? before->base.next : current_scope->entities;
10030 decl->declarations_begin = begin;
10031 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10037 * Parse an expression statement, ie. expr ';'.
10039 static statement_t *parse_expression_statement(void)
10041 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10043 expression_t *const expr = parse_expression();
10044 statement->expression.expression = expr;
10045 mark_vars_read(expr, ENT_ANY);
10047 expect(';', end_error);
10054 * Parse a microsoft __try { } __finally { } or
10055 * __try{ } __except() { }
10057 static statement_t *parse_ms_try_statment(void)
10059 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10062 PUSH_PARENT(statement);
10064 ms_try_statement_t *rem = current_try;
10065 current_try = &statement->ms_try;
10066 statement->ms_try.try_statement = parse_compound_statement(false);
10071 if (next_if(T___except)) {
10072 expect('(', end_error);
10073 add_anchor_token(')');
10074 expression_t *const expr = parse_expression();
10075 mark_vars_read(expr, NULL);
10076 type_t * type = skip_typeref(expr->base.type);
10077 if (is_type_integer(type)) {
10078 type = promote_integer(type);
10079 } else if (is_type_valid(type)) {
10080 errorf(&expr->base.source_position,
10081 "__expect expression is not an integer, but '%T'", type);
10082 type = type_error_type;
10084 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10085 rem_anchor_token(')');
10086 expect(')', end_error);
10087 statement->ms_try.final_statement = parse_compound_statement(false);
10088 } else if (next_if(T__finally)) {
10089 statement->ms_try.final_statement = parse_compound_statement(false);
10091 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10092 return create_invalid_statement();
10096 return create_invalid_statement();
10099 static statement_t *parse_empty_statement(void)
10101 if (warning.empty_statement) {
10102 warningf(HERE, "statement is empty");
10104 statement_t *const statement = create_empty_statement();
10109 static statement_t *parse_local_label_declaration(void)
10111 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10115 entity_t *begin = NULL;
10116 entity_t *end = NULL;
10117 entity_t **anchor = &begin;
10119 if (token.type != T_IDENTIFIER) {
10120 parse_error_expected("while parsing local label declaration",
10121 T_IDENTIFIER, NULL);
10124 symbol_t *symbol = token.symbol;
10125 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10126 if (entity != NULL && entity->base.parent_scope == current_scope) {
10127 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10128 symbol, &entity->base.source_position);
10130 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
10131 entity->base.parent_scope = current_scope;
10132 entity->base.source_position = token.source_position;
10135 anchor = &entity->base.next;
10138 environment_push(entity);
10141 } while (next_if(','));
10142 expect(';', end_error);
10144 statement->declaration.declarations_begin = begin;
10145 statement->declaration.declarations_end = end;
10149 static void parse_namespace_definition(void)
10153 entity_t *entity = NULL;
10154 symbol_t *symbol = NULL;
10156 if (token.type == T_IDENTIFIER) {
10157 symbol = token.symbol;
10160 entity = get_entity(symbol, NAMESPACE_NORMAL);
10162 && entity->kind != ENTITY_NAMESPACE
10163 && entity->base.parent_scope == current_scope) {
10164 if (is_entity_valid(entity)) {
10165 error_redefined_as_different_kind(&token.source_position,
10166 entity, ENTITY_NAMESPACE);
10172 if (entity == NULL) {
10173 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
10174 entity->base.source_position = token.source_position;
10175 entity->base.parent_scope = current_scope;
10178 if (token.type == '=') {
10179 /* TODO: parse namespace alias */
10180 panic("namespace alias definition not supported yet");
10183 environment_push(entity);
10184 append_entity(current_scope, entity);
10186 size_t const top = environment_top();
10187 scope_t *old_scope = scope_push(&entity->namespacee.members);
10189 entity_t *old_current_entity = current_entity;
10190 current_entity = entity;
10192 expect('{', end_error);
10194 expect('}', end_error);
10197 assert(current_scope == &entity->namespacee.members);
10198 assert(current_entity == entity);
10199 current_entity = old_current_entity;
10200 scope_pop(old_scope);
10201 environment_pop_to(top);
10205 * Parse a statement.
10206 * There's also parse_statement() which additionally checks for
10207 * "statement has no effect" warnings
10209 static statement_t *intern_parse_statement(void)
10211 statement_t *statement = NULL;
10213 /* declaration or statement */
10214 add_anchor_token(';');
10215 switch (token.type) {
10216 case T_IDENTIFIER: {
10217 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10218 if (la1_type == ':') {
10219 statement = parse_label_statement();
10220 } else if (is_typedef_symbol(token.symbol)) {
10221 statement = parse_declaration_statement();
10223 /* it's an identifier, the grammar says this must be an
10224 * expression statement. However it is common that users mistype
10225 * declaration types, so we guess a bit here to improve robustness
10226 * for incorrect programs */
10227 switch (la1_type) {
10230 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10232 statement = parse_expression_statement();
10236 statement = parse_declaration_statement();
10244 case T___extension__:
10245 /* This can be a prefix to a declaration or an expression statement.
10246 * We simply eat it now and parse the rest with tail recursion. */
10247 while (next_if(T___extension__)) {}
10248 bool old_gcc_extension = in_gcc_extension;
10249 in_gcc_extension = true;
10250 statement = intern_parse_statement();
10251 in_gcc_extension = old_gcc_extension;
10255 statement = parse_declaration_statement();
10259 statement = parse_local_label_declaration();
10262 case ';': statement = parse_empty_statement(); break;
10263 case '{': statement = parse_compound_statement(false); break;
10264 case T___leave: statement = parse_leave_statement(); break;
10265 case T___try: statement = parse_ms_try_statment(); break;
10266 case T_asm: statement = parse_asm_statement(); break;
10267 case T_break: statement = parse_break(); break;
10268 case T_case: statement = parse_case_statement(); break;
10269 case T_continue: statement = parse_continue(); break;
10270 case T_default: statement = parse_default_statement(); break;
10271 case T_do: statement = parse_do(); break;
10272 case T_for: statement = parse_for(); break;
10273 case T_goto: statement = parse_goto(); break;
10274 case T_if: statement = parse_if(); break;
10275 case T_return: statement = parse_return(); break;
10276 case T_switch: statement = parse_switch(); break;
10277 case T_while: statement = parse_while(); break;
10280 statement = parse_expression_statement();
10284 errorf(HERE, "unexpected token %K while parsing statement", &token);
10285 statement = create_invalid_statement();
10290 rem_anchor_token(';');
10292 assert(statement != NULL
10293 && statement->base.source_position.input_name != NULL);
10299 * parse a statement and emits "statement has no effect" warning if needed
10300 * (This is really a wrapper around intern_parse_statement with check for 1
10301 * single warning. It is needed, because for statement expressions we have
10302 * to avoid the warning on the last statement)
10304 static statement_t *parse_statement(void)
10306 statement_t *statement = intern_parse_statement();
10308 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10309 expression_t *expression = statement->expression.expression;
10310 if (!expression_has_effect(expression)) {
10311 warningf(&expression->base.source_position,
10312 "statement has no effect");
10320 * Parse a compound statement.
10322 static statement_t *parse_compound_statement(bool inside_expression_statement)
10324 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10326 PUSH_PARENT(statement);
10329 add_anchor_token('}');
10330 /* tokens, which can start a statement */
10331 /* TODO MS, __builtin_FOO */
10332 add_anchor_token('!');
10333 add_anchor_token('&');
10334 add_anchor_token('(');
10335 add_anchor_token('*');
10336 add_anchor_token('+');
10337 add_anchor_token('-');
10338 add_anchor_token('{');
10339 add_anchor_token('~');
10340 add_anchor_token(T_CHARACTER_CONSTANT);
10341 add_anchor_token(T_COLONCOLON);
10342 add_anchor_token(T_FLOATINGPOINT);
10343 add_anchor_token(T_IDENTIFIER);
10344 add_anchor_token(T_INTEGER);
10345 add_anchor_token(T_MINUSMINUS);
10346 add_anchor_token(T_PLUSPLUS);
10347 add_anchor_token(T_STRING_LITERAL);
10348 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10349 add_anchor_token(T_WIDE_STRING_LITERAL);
10350 add_anchor_token(T__Bool);
10351 add_anchor_token(T__Complex);
10352 add_anchor_token(T__Imaginary);
10353 add_anchor_token(T___FUNCTION__);
10354 add_anchor_token(T___PRETTY_FUNCTION__);
10355 add_anchor_token(T___alignof__);
10356 add_anchor_token(T___attribute__);
10357 add_anchor_token(T___builtin_va_start);
10358 add_anchor_token(T___extension__);
10359 add_anchor_token(T___func__);
10360 add_anchor_token(T___imag__);
10361 add_anchor_token(T___label__);
10362 add_anchor_token(T___real__);
10363 add_anchor_token(T___thread);
10364 add_anchor_token(T_asm);
10365 add_anchor_token(T_auto);
10366 add_anchor_token(T_bool);
10367 add_anchor_token(T_break);
10368 add_anchor_token(T_case);
10369 add_anchor_token(T_char);
10370 add_anchor_token(T_class);
10371 add_anchor_token(T_const);
10372 add_anchor_token(T_const_cast);
10373 add_anchor_token(T_continue);
10374 add_anchor_token(T_default);
10375 add_anchor_token(T_delete);
10376 add_anchor_token(T_double);
10377 add_anchor_token(T_do);
10378 add_anchor_token(T_dynamic_cast);
10379 add_anchor_token(T_enum);
10380 add_anchor_token(T_extern);
10381 add_anchor_token(T_false);
10382 add_anchor_token(T_float);
10383 add_anchor_token(T_for);
10384 add_anchor_token(T_goto);
10385 add_anchor_token(T_if);
10386 add_anchor_token(T_inline);
10387 add_anchor_token(T_int);
10388 add_anchor_token(T_long);
10389 add_anchor_token(T_new);
10390 add_anchor_token(T_operator);
10391 add_anchor_token(T_register);
10392 add_anchor_token(T_reinterpret_cast);
10393 add_anchor_token(T_restrict);
10394 add_anchor_token(T_return);
10395 add_anchor_token(T_short);
10396 add_anchor_token(T_signed);
10397 add_anchor_token(T_sizeof);
10398 add_anchor_token(T_static);
10399 add_anchor_token(T_static_cast);
10400 add_anchor_token(T_struct);
10401 add_anchor_token(T_switch);
10402 add_anchor_token(T_template);
10403 add_anchor_token(T_this);
10404 add_anchor_token(T_throw);
10405 add_anchor_token(T_true);
10406 add_anchor_token(T_try);
10407 add_anchor_token(T_typedef);
10408 add_anchor_token(T_typeid);
10409 add_anchor_token(T_typename);
10410 add_anchor_token(T_typeof);
10411 add_anchor_token(T_union);
10412 add_anchor_token(T_unsigned);
10413 add_anchor_token(T_using);
10414 add_anchor_token(T_void);
10415 add_anchor_token(T_volatile);
10416 add_anchor_token(T_wchar_t);
10417 add_anchor_token(T_while);
10419 size_t const top = environment_top();
10420 scope_t *old_scope = scope_push(&statement->compound.scope);
10422 statement_t **anchor = &statement->compound.statements;
10423 bool only_decls_so_far = true;
10424 while (token.type != '}') {
10425 if (token.type == T_EOF) {
10426 errorf(&statement->base.source_position,
10427 "EOF while parsing compound statement");
10430 statement_t *sub_statement = intern_parse_statement();
10431 if (is_invalid_statement(sub_statement)) {
10432 /* an error occurred. if we are at an anchor, return */
10438 if (warning.declaration_after_statement) {
10439 if (sub_statement->kind != STATEMENT_DECLARATION) {
10440 only_decls_so_far = false;
10441 } else if (!only_decls_so_far) {
10442 warningf(&sub_statement->base.source_position,
10443 "ISO C90 forbids mixed declarations and code");
10447 *anchor = sub_statement;
10449 while (sub_statement->base.next != NULL)
10450 sub_statement = sub_statement->base.next;
10452 anchor = &sub_statement->base.next;
10456 /* look over all statements again to produce no effect warnings */
10457 if (warning.unused_value) {
10458 statement_t *sub_statement = statement->compound.statements;
10459 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10460 if (sub_statement->kind != STATEMENT_EXPRESSION)
10462 /* don't emit a warning for the last expression in an expression
10463 * statement as it has always an effect */
10464 if (inside_expression_statement && sub_statement->base.next == NULL)
10467 expression_t *expression = sub_statement->expression.expression;
10468 if (!expression_has_effect(expression)) {
10469 warningf(&expression->base.source_position,
10470 "statement has no effect");
10476 rem_anchor_token(T_while);
10477 rem_anchor_token(T_wchar_t);
10478 rem_anchor_token(T_volatile);
10479 rem_anchor_token(T_void);
10480 rem_anchor_token(T_using);
10481 rem_anchor_token(T_unsigned);
10482 rem_anchor_token(T_union);
10483 rem_anchor_token(T_typeof);
10484 rem_anchor_token(T_typename);
10485 rem_anchor_token(T_typeid);
10486 rem_anchor_token(T_typedef);
10487 rem_anchor_token(T_try);
10488 rem_anchor_token(T_true);
10489 rem_anchor_token(T_throw);
10490 rem_anchor_token(T_this);
10491 rem_anchor_token(T_template);
10492 rem_anchor_token(T_switch);
10493 rem_anchor_token(T_struct);
10494 rem_anchor_token(T_static_cast);
10495 rem_anchor_token(T_static);
10496 rem_anchor_token(T_sizeof);
10497 rem_anchor_token(T_signed);
10498 rem_anchor_token(T_short);
10499 rem_anchor_token(T_return);
10500 rem_anchor_token(T_restrict);
10501 rem_anchor_token(T_reinterpret_cast);
10502 rem_anchor_token(T_register);
10503 rem_anchor_token(T_operator);
10504 rem_anchor_token(T_new);
10505 rem_anchor_token(T_long);
10506 rem_anchor_token(T_int);
10507 rem_anchor_token(T_inline);
10508 rem_anchor_token(T_if);
10509 rem_anchor_token(T_goto);
10510 rem_anchor_token(T_for);
10511 rem_anchor_token(T_float);
10512 rem_anchor_token(T_false);
10513 rem_anchor_token(T_extern);
10514 rem_anchor_token(T_enum);
10515 rem_anchor_token(T_dynamic_cast);
10516 rem_anchor_token(T_do);
10517 rem_anchor_token(T_double);
10518 rem_anchor_token(T_delete);
10519 rem_anchor_token(T_default);
10520 rem_anchor_token(T_continue);
10521 rem_anchor_token(T_const_cast);
10522 rem_anchor_token(T_const);
10523 rem_anchor_token(T_class);
10524 rem_anchor_token(T_char);
10525 rem_anchor_token(T_case);
10526 rem_anchor_token(T_break);
10527 rem_anchor_token(T_bool);
10528 rem_anchor_token(T_auto);
10529 rem_anchor_token(T_asm);
10530 rem_anchor_token(T___thread);
10531 rem_anchor_token(T___real__);
10532 rem_anchor_token(T___label__);
10533 rem_anchor_token(T___imag__);
10534 rem_anchor_token(T___func__);
10535 rem_anchor_token(T___extension__);
10536 rem_anchor_token(T___builtin_va_start);
10537 rem_anchor_token(T___attribute__);
10538 rem_anchor_token(T___alignof__);
10539 rem_anchor_token(T___PRETTY_FUNCTION__);
10540 rem_anchor_token(T___FUNCTION__);
10541 rem_anchor_token(T__Imaginary);
10542 rem_anchor_token(T__Complex);
10543 rem_anchor_token(T__Bool);
10544 rem_anchor_token(T_WIDE_STRING_LITERAL);
10545 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10546 rem_anchor_token(T_STRING_LITERAL);
10547 rem_anchor_token(T_PLUSPLUS);
10548 rem_anchor_token(T_MINUSMINUS);
10549 rem_anchor_token(T_INTEGER);
10550 rem_anchor_token(T_IDENTIFIER);
10551 rem_anchor_token(T_FLOATINGPOINT);
10552 rem_anchor_token(T_COLONCOLON);
10553 rem_anchor_token(T_CHARACTER_CONSTANT);
10554 rem_anchor_token('~');
10555 rem_anchor_token('{');
10556 rem_anchor_token('-');
10557 rem_anchor_token('+');
10558 rem_anchor_token('*');
10559 rem_anchor_token('(');
10560 rem_anchor_token('&');
10561 rem_anchor_token('!');
10562 rem_anchor_token('}');
10563 assert(current_scope == &statement->compound.scope);
10564 scope_pop(old_scope);
10565 environment_pop_to(top);
10572 * Check for unused global static functions and variables
10574 static void check_unused_globals(void)
10576 if (!warning.unused_function && !warning.unused_variable)
10579 for (const entity_t *entity = file_scope->entities; entity != NULL;
10580 entity = entity->base.next) {
10581 if (!is_declaration(entity))
10584 const declaration_t *declaration = &entity->declaration;
10585 if (declaration->used ||
10586 declaration->modifiers & DM_UNUSED ||
10587 declaration->modifiers & DM_USED ||
10588 declaration->storage_class != STORAGE_CLASS_STATIC)
10591 type_t *const type = declaration->type;
10593 if (entity->kind == ENTITY_FUNCTION) {
10594 /* inhibit warning for static inline functions */
10595 if (entity->function.is_inline)
10598 s = entity->function.statement != NULL ? "defined" : "declared";
10603 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10604 type, declaration->base.symbol, s);
10608 static void parse_global_asm(void)
10610 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10613 expect('(', end_error);
10615 statement->asms.asm_text = parse_string_literals();
10616 statement->base.next = unit->global_asm;
10617 unit->global_asm = statement;
10619 expect(')', end_error);
10620 expect(';', end_error);
10625 static void parse_linkage_specification(void)
10629 const char *linkage = parse_string_literals().begin;
10631 linkage_kind_t old_linkage = current_linkage;
10632 linkage_kind_t new_linkage;
10633 if (strcmp(linkage, "C") == 0) {
10634 new_linkage = LINKAGE_C;
10635 } else if (strcmp(linkage, "C++") == 0) {
10636 new_linkage = LINKAGE_CXX;
10638 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10639 new_linkage = LINKAGE_INVALID;
10641 current_linkage = new_linkage;
10643 if (next_if('{')) {
10645 expect('}', end_error);
10651 assert(current_linkage == new_linkage);
10652 current_linkage = old_linkage;
10655 static void parse_external(void)
10657 switch (token.type) {
10658 DECLARATION_START_NO_EXTERN
10660 case T___extension__:
10661 /* tokens below are for implicit int */
10662 case '&': /* & x; -> int& x; (and error later, because C++ has no
10664 case '*': /* * x; -> int* x; */
10665 case '(': /* (x); -> int (x); */
10666 parse_external_declaration();
10670 if (look_ahead(1)->type == T_STRING_LITERAL) {
10671 parse_linkage_specification();
10673 parse_external_declaration();
10678 parse_global_asm();
10682 parse_namespace_definition();
10686 if (!strict_mode) {
10688 warningf(HERE, "stray ';' outside of function");
10695 errorf(HERE, "stray %K outside of function", &token);
10696 if (token.type == '(' || token.type == '{' || token.type == '[')
10697 eat_until_matching_token(token.type);
10703 static void parse_externals(void)
10705 add_anchor_token('}');
10706 add_anchor_token(T_EOF);
10709 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10710 unsigned char token_anchor_copy[T_LAST_TOKEN];
10711 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10714 while (token.type != T_EOF && token.type != '}') {
10716 bool anchor_leak = false;
10717 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10718 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10720 /* the anchor set and its copy differs */
10721 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10722 anchor_leak = true;
10725 if (in_gcc_extension) {
10726 /* an gcc extension scope was not closed */
10727 internal_errorf(HERE, "Leaked __extension__");
10728 anchor_leak = true;
10738 rem_anchor_token(T_EOF);
10739 rem_anchor_token('}');
10743 * Parse a translation unit.
10745 static void parse_translation_unit(void)
10747 add_anchor_token(T_EOF);
10752 if (token.type == T_EOF)
10755 errorf(HERE, "stray %K outside of function", &token);
10756 if (token.type == '(' || token.type == '{' || token.type == '[')
10757 eat_until_matching_token(token.type);
10762 void set_default_visibility(elf_visibility_tag_t visibility)
10764 default_visibility = visibility;
10770 * @return the translation unit or NULL if errors occurred.
10772 void start_parsing(void)
10774 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10775 label_stack = NEW_ARR_F(stack_entry_t, 0);
10776 diagnostic_count = 0;
10780 print_to_file(stderr);
10782 assert(unit == NULL);
10783 unit = allocate_ast_zero(sizeof(unit[0]));
10785 assert(file_scope == NULL);
10786 file_scope = &unit->scope;
10788 assert(current_scope == NULL);
10789 scope_push(&unit->scope);
10791 create_gnu_builtins();
10793 create_microsoft_intrinsics();
10796 translation_unit_t *finish_parsing(void)
10798 assert(current_scope == &unit->scope);
10801 assert(file_scope == &unit->scope);
10802 check_unused_globals();
10805 DEL_ARR_F(environment_stack);
10806 DEL_ARR_F(label_stack);
10808 translation_unit_t *result = unit;
10813 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10814 * are given length one. */
10815 static void complete_incomplete_arrays(void)
10817 size_t n = ARR_LEN(incomplete_arrays);
10818 for (size_t i = 0; i != n; ++i) {
10819 declaration_t *const decl = incomplete_arrays[i];
10820 type_t *const orig_type = decl->type;
10821 type_t *const type = skip_typeref(orig_type);
10823 if (!is_type_incomplete(type))
10826 if (warning.other) {
10827 warningf(&decl->base.source_position,
10828 "array '%#T' assumed to have one element",
10829 orig_type, decl->base.symbol);
10832 type_t *const new_type = duplicate_type(type);
10833 new_type->array.size_constant = true;
10834 new_type->array.has_implicit_size = true;
10835 new_type->array.size = 1;
10837 type_t *const result = identify_new_type(new_type);
10839 decl->type = result;
10843 void prepare_main_collect2(entity_t *entity)
10845 // create call to __main
10846 symbol_t *symbol = symbol_table_insert("__main");
10847 entity_t *subsubmain_ent
10848 = create_implicit_function(symbol, &builtin_source_position);
10850 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10851 type_t *ftype = subsubmain_ent->declaration.type;
10852 ref->base.source_position = builtin_source_position;
10853 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10854 ref->reference.entity = subsubmain_ent;
10856 expression_t *call = allocate_expression_zero(EXPR_CALL);
10857 call->base.source_position = builtin_source_position;
10858 call->base.type = type_void;
10859 call->call.function = ref;
10861 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10862 expr_statement->base.source_position = builtin_source_position;
10863 expr_statement->expression.expression = call;
10865 statement_t *statement = entity->function.statement;
10866 assert(statement->kind == STATEMENT_COMPOUND);
10867 compound_statement_t *compounds = &statement->compound;
10869 expr_statement->base.next = compounds->statements;
10870 compounds->statements = expr_statement;
10875 lookahead_bufpos = 0;
10876 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10879 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10880 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10881 parse_translation_unit();
10882 complete_incomplete_arrays();
10883 DEL_ARR_F(incomplete_arrays);
10884 incomplete_arrays = NULL;
10888 * Initialize the parser.
10890 void init_parser(void)
10892 sym_anonymous = symbol_table_insert("<anonymous>");
10894 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10896 init_expression_parsers();
10897 obstack_init(&temp_obst);
10901 * Terminate the parser.
10903 void exit_parser(void)
10905 obstack_free(&temp_obst, NULL);