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;
113 #define PUSH_PARENT(stmt) \
114 statement_t *const prev_parent = current_parent; \
115 ((void)(current_parent = (stmt)))
116 #define POP_PARENT ((void)(current_parent = prev_parent))
118 /** special symbol used for anonymous entities. */
119 static symbol_t *sym_anonymous = NULL;
121 /** The token anchor set */
122 static unsigned char token_anchor_set[T_LAST_TOKEN];
124 /** The current source position. */
125 #define HERE (&token.source_position)
127 /** true if we are in GCC mode. */
128 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
130 static statement_t *parse_compound_statement(bool inside_expression_statement);
131 static statement_t *parse_statement(void);
133 static expression_t *parse_subexpression(precedence_t);
134 static expression_t *parse_expression(void);
135 static type_t *parse_typename(void);
136 static void parse_externals(void);
137 static void parse_external(void);
139 static void parse_compound_type_entries(compound_t *compound_declaration);
141 static void check_call_argument(type_t *expected_type,
142 call_argument_t *argument, unsigned pos);
144 typedef enum declarator_flags_t {
146 DECL_MAY_BE_ABSTRACT = 1U << 0,
147 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
148 DECL_IS_PARAMETER = 1U << 2
149 } declarator_flags_t;
151 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
152 declarator_flags_t flags);
154 static void semantic_comparison(binary_expression_t *expression);
156 #define STORAGE_CLASSES \
157 STORAGE_CLASSES_NO_EXTERN \
160 #define STORAGE_CLASSES_NO_EXTERN \
167 #define TYPE_QUALIFIERS \
172 case T__forceinline: \
173 case T___attribute__:
175 #define COMPLEX_SPECIFIERS \
177 #define IMAGINARY_SPECIFIERS \
180 #define TYPE_SPECIFIERS \
182 case T___builtin_va_list: \
207 #define DECLARATION_START \
212 #define DECLARATION_START_NO_EXTERN \
213 STORAGE_CLASSES_NO_EXTERN \
217 #define TYPENAME_START \
221 #define EXPRESSION_START \
230 case T_CHARACTER_CONSTANT: \
231 case T_FLOATINGPOINT: \
232 case T_FLOATINGPOINT_HEXADECIMAL: \
234 case T_INTEGER_HEXADECIMAL: \
235 case T_INTEGER_OCTAL: \
238 case T_STRING_LITERAL: \
239 case T_WIDE_CHARACTER_CONSTANT: \
240 case T_WIDE_STRING_LITERAL: \
241 case T___FUNCDNAME__: \
242 case T___FUNCSIG__: \
243 case T___FUNCTION__: \
244 case T___PRETTY_FUNCTION__: \
245 case T___alignof__: \
246 case T___builtin_classify_type: \
247 case T___builtin_constant_p: \
248 case T___builtin_isgreater: \
249 case T___builtin_isgreaterequal: \
250 case T___builtin_isless: \
251 case T___builtin_islessequal: \
252 case T___builtin_islessgreater: \
253 case T___builtin_isunordered: \
254 case T___builtin_offsetof: \
255 case T___builtin_va_arg: \
256 case T___builtin_va_copy: \
257 case T___builtin_va_start: \
268 * Returns the size of a statement node.
270 * @param kind the statement kind
272 static size_t get_statement_struct_size(statement_kind_t kind)
274 static const size_t sizes[] = {
275 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
276 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
277 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
278 [STATEMENT_RETURN] = sizeof(return_statement_t),
279 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
280 [STATEMENT_IF] = sizeof(if_statement_t),
281 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
282 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
283 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
284 [STATEMENT_BREAK] = sizeof(statement_base_t),
285 [STATEMENT_GOTO] = sizeof(goto_statement_t),
286 [STATEMENT_LABEL] = sizeof(label_statement_t),
287 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
288 [STATEMENT_WHILE] = sizeof(while_statement_t),
289 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
290 [STATEMENT_FOR] = sizeof(for_statement_t),
291 [STATEMENT_ASM] = sizeof(asm_statement_t),
292 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
293 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
295 assert(kind < lengthof(sizes));
296 assert(sizes[kind] != 0);
301 * Returns the size of an expression node.
303 * @param kind the expression kind
305 static size_t get_expression_struct_size(expression_kind_t kind)
307 static const size_t sizes[] = {
308 [EXPR_INVALID] = sizeof(expression_base_t),
309 [EXPR_REFERENCE] = sizeof(reference_expression_t),
310 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
311 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
312 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
313 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
314 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
315 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
316 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
317 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
318 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
319 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
320 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
321 [EXPR_CALL] = sizeof(call_expression_t),
322 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
323 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
324 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
325 [EXPR_SELECT] = sizeof(select_expression_t),
326 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
327 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
328 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
329 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
330 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
331 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
332 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
333 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
334 [EXPR_VA_START] = sizeof(va_start_expression_t),
335 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
336 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
337 [EXPR_STATEMENT] = sizeof(statement_expression_t),
338 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
340 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
341 return sizes[EXPR_UNARY_FIRST];
343 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
344 return sizes[EXPR_BINARY_FIRST];
346 assert(kind < lengthof(sizes));
347 assert(sizes[kind] != 0);
352 * Allocate a statement node of given kind and initialize all
353 * fields with zero. Sets its source position to the position
354 * of the current token.
356 static statement_t *allocate_statement_zero(statement_kind_t kind)
358 size_t size = get_statement_struct_size(kind);
359 statement_t *res = allocate_ast_zero(size);
361 res->base.kind = kind;
362 res->base.parent = current_parent;
363 res->base.source_position = token.source_position;
368 * Allocate an expression node of given kind and initialize all
371 * @param kind the kind of the expression to allocate
373 static expression_t *allocate_expression_zero(expression_kind_t kind)
375 size_t size = get_expression_struct_size(kind);
376 expression_t *res = allocate_ast_zero(size);
378 res->base.kind = kind;
379 res->base.type = type_error_type;
380 res->base.source_position = token.source_position;
385 * Creates a new invalid expression at the source position
386 * of the current token.
388 static expression_t *create_invalid_expression(void)
390 return allocate_expression_zero(EXPR_INVALID);
394 * Creates a new invalid statement.
396 static statement_t *create_invalid_statement(void)
398 return allocate_statement_zero(STATEMENT_INVALID);
402 * Allocate a new empty statement.
404 static statement_t *create_empty_statement(void)
406 return allocate_statement_zero(STATEMENT_EMPTY);
409 static function_parameter_t *allocate_parameter(type_t *const type)
411 function_parameter_t *const param
412 = obstack_alloc(type_obst, sizeof(*param));
413 memset(param, 0, sizeof(*param));
419 * Returns the size of an initializer node.
421 * @param kind the initializer kind
423 static size_t get_initializer_size(initializer_kind_t kind)
425 static const size_t sizes[] = {
426 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
427 [INITIALIZER_STRING] = sizeof(initializer_string_t),
428 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
429 [INITIALIZER_LIST] = sizeof(initializer_list_t),
430 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
432 assert(kind < lengthof(sizes));
433 assert(sizes[kind] != 0);
438 * Allocate an initializer node of given kind and initialize all
441 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
443 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
450 * Returns the index of the top element of the environment stack.
452 static size_t environment_top(void)
454 return ARR_LEN(environment_stack);
458 * Returns the index of the top element of the global label stack.
460 static size_t label_top(void)
462 return ARR_LEN(label_stack);
466 * Return the next token.
468 static inline void next_token(void)
470 token = lookahead_buffer[lookahead_bufpos];
471 lookahead_buffer[lookahead_bufpos] = lexer_token;
474 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
477 print_token(stderr, &token);
478 fprintf(stderr, "\n");
482 static inline bool next_if(int const type)
484 if (token.type == type) {
493 * Return the next token with a given lookahead.
495 static inline const token_t *look_ahead(size_t num)
497 assert(0 < num && num <= MAX_LOOKAHEAD);
498 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
499 return &lookahead_buffer[pos];
503 * Adds a token type to the token type anchor set (a multi-set).
505 static void add_anchor_token(int token_type)
507 assert(0 <= token_type && token_type < T_LAST_TOKEN);
508 ++token_anchor_set[token_type];
512 * Set the number of tokens types of the given type
513 * to zero and return the old count.
515 static int save_and_reset_anchor_state(int token_type)
517 assert(0 <= token_type && token_type < T_LAST_TOKEN);
518 int count = token_anchor_set[token_type];
519 token_anchor_set[token_type] = 0;
524 * Restore the number of token types to the given count.
526 static void restore_anchor_state(int token_type, int count)
528 assert(0 <= token_type && token_type < T_LAST_TOKEN);
529 token_anchor_set[token_type] = count;
533 * Remove a token type from the token type anchor set (a multi-set).
535 static void rem_anchor_token(int token_type)
537 assert(0 <= token_type && token_type < T_LAST_TOKEN);
538 assert(token_anchor_set[token_type] != 0);
539 --token_anchor_set[token_type];
543 * Return true if the token type of the current token is
546 static bool at_anchor(void)
550 return token_anchor_set[token.type];
554 * Eat tokens until a matching token type is found.
556 static void eat_until_matching_token(int type)
560 case '(': end_token = ')'; break;
561 case '{': end_token = '}'; break;
562 case '[': end_token = ']'; break;
563 default: end_token = type; break;
566 unsigned parenthesis_count = 0;
567 unsigned brace_count = 0;
568 unsigned bracket_count = 0;
569 while (token.type != end_token ||
570 parenthesis_count != 0 ||
572 bracket_count != 0) {
573 switch (token.type) {
575 case '(': ++parenthesis_count; break;
576 case '{': ++brace_count; break;
577 case '[': ++bracket_count; break;
580 if (parenthesis_count > 0)
590 if (bracket_count > 0)
593 if (token.type == end_token &&
594 parenthesis_count == 0 &&
608 * Eat input tokens until an anchor is found.
610 static void eat_until_anchor(void)
612 while (token_anchor_set[token.type] == 0) {
613 if (token.type == '(' || token.type == '{' || token.type == '[')
614 eat_until_matching_token(token.type);
620 * Eat a whole block from input tokens.
622 static void eat_block(void)
624 eat_until_matching_token('{');
628 #define eat(token_type) (assert(token.type == (token_type)), next_token())
631 * Report a parse error because an expected token was not found.
634 #if defined __GNUC__ && __GNUC__ >= 4
635 __attribute__((sentinel))
637 void parse_error_expected(const char *message, ...)
639 if (message != NULL) {
640 errorf(HERE, "%s", message);
643 va_start(ap, message);
644 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
649 * Report an incompatible type.
651 static void type_error_incompatible(const char *msg,
652 const source_position_t *source_position, type_t *type1, type_t *type2)
654 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
659 * Expect the current token is the expected token.
660 * If not, generate an error, eat the current statement,
661 * and goto the error_label label.
663 #define expect(expected, error_label) \
665 if (UNLIKELY(token.type != (expected))) { \
666 parse_error_expected(NULL, (expected), NULL); \
667 add_anchor_token(expected); \
668 eat_until_anchor(); \
669 next_if((expected)); \
670 rem_anchor_token(expected); \
677 * Push a given scope on the scope stack and make it the
680 static scope_t *scope_push(scope_t *new_scope)
682 if (current_scope != NULL) {
683 new_scope->depth = current_scope->depth + 1;
686 scope_t *old_scope = current_scope;
687 current_scope = new_scope;
692 * Pop the current scope from the scope stack.
694 static void scope_pop(scope_t *old_scope)
696 current_scope = old_scope;
700 * Search an entity by its symbol in a given namespace.
702 static entity_t *get_entity(const symbol_t *const symbol,
703 namespace_tag_t namespc)
705 assert(namespc != NAMESPACE_INVALID);
706 entity_t *entity = symbol->entity;
707 for (; entity != NULL; entity = entity->base.symbol_next) {
708 if (entity->base.namespc == namespc)
715 /* §6.2.3:1 24) There is only one name space for tags even though three are
717 static entity_t *get_tag(symbol_t const *const symbol,
718 entity_kind_tag_t const kind)
720 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
721 if (entity != NULL && entity->kind != kind) {
723 "'%Y' defined as wrong kind of tag (previous definition %P)",
724 symbol, &entity->base.source_position);
731 * pushs an entity on the environment stack and links the corresponding symbol
734 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
736 symbol_t *symbol = entity->base.symbol;
737 entity_namespace_t namespc = entity->base.namespc;
738 assert(namespc != NAMESPACE_INVALID);
740 /* replace/add entity into entity list of the symbol */
743 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
748 /* replace an entry? */
749 if (iter->base.namespc == namespc) {
750 entity->base.symbol_next = iter->base.symbol_next;
756 /* remember old declaration */
758 entry.symbol = symbol;
759 entry.old_entity = iter;
760 entry.namespc = namespc;
761 ARR_APP1(stack_entry_t, *stack_ptr, entry);
765 * Push an entity on the environment stack.
767 static void environment_push(entity_t *entity)
769 assert(entity->base.source_position.input_name != NULL);
770 assert(entity->base.parent_scope != NULL);
771 stack_push(&environment_stack, entity);
775 * Push a declaration on the global label stack.
777 * @param declaration the declaration
779 static void label_push(entity_t *label)
781 /* we abuse the parameters scope as parent for the labels */
782 label->base.parent_scope = ¤t_function->parameters;
783 stack_push(&label_stack, label);
787 * pops symbols from the environment stack until @p new_top is the top element
789 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
791 stack_entry_t *stack = *stack_ptr;
792 size_t top = ARR_LEN(stack);
795 assert(new_top <= top);
799 for (i = top; i > new_top; --i) {
800 stack_entry_t *entry = &stack[i - 1];
802 entity_t *old_entity = entry->old_entity;
803 symbol_t *symbol = entry->symbol;
804 entity_namespace_t namespc = entry->namespc;
806 /* replace with old_entity/remove */
809 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
811 assert(iter != NULL);
812 /* replace an entry? */
813 if (iter->base.namespc == namespc)
817 /* restore definition from outer scopes (if there was one) */
818 if (old_entity != NULL) {
819 old_entity->base.symbol_next = iter->base.symbol_next;
820 *anchor = old_entity;
822 /* remove entry from list */
823 *anchor = iter->base.symbol_next;
827 ARR_SHRINKLEN(*stack_ptr, new_top);
831 * Pop all entries from the environment stack until the new_top
834 * @param new_top the new stack top
836 static void environment_pop_to(size_t new_top)
838 stack_pop_to(&environment_stack, new_top);
842 * Pop all entries from the global label stack until the new_top
845 * @param new_top the new stack top
847 static void label_pop_to(size_t new_top)
849 stack_pop_to(&label_stack, new_top);
852 static int get_akind_rank(atomic_type_kind_t akind)
858 * Return the type rank for an atomic type.
860 static int get_rank(const type_t *type)
862 assert(!is_typeref(type));
863 if (type->kind == TYPE_ENUM)
864 return get_akind_rank(type->enumt.akind);
866 assert(type->kind == TYPE_ATOMIC);
867 return get_akind_rank(type->atomic.akind);
871 * §6.3.1.1:2 Do integer promotion for a given type.
873 * @param type the type to promote
874 * @return the promoted type
876 static type_t *promote_integer(type_t *type)
878 if (type->kind == TYPE_BITFIELD)
879 type = type->bitfield.base_type;
881 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
888 * Create a cast expression.
890 * @param expression the expression to cast
891 * @param dest_type the destination type
893 static expression_t *create_cast_expression(expression_t *expression,
896 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
898 cast->unary.value = expression;
899 cast->base.type = dest_type;
905 * Check if a given expression represents a null pointer constant.
907 * @param expression the expression to check
909 static bool is_null_pointer_constant(const expression_t *expression)
911 /* skip void* cast */
912 if (expression->kind == EXPR_UNARY_CAST ||
913 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
914 type_t *const type = skip_typeref(expression->base.type);
915 if (types_compatible(type, type_void_ptr))
916 expression = expression->unary.value;
919 type_t *const type = skip_typeref(expression->base.type);
920 if (!is_type_integer(type))
922 switch (is_constant_expression(expression)) {
923 case EXPR_CLASS_ERROR: return true;
924 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
925 default: return false;
930 * Create an implicit cast expression.
932 * @param expression the expression to cast
933 * @param dest_type the destination type
935 static expression_t *create_implicit_cast(expression_t *expression,
938 type_t *const source_type = expression->base.type;
940 if (source_type == dest_type)
943 return create_cast_expression(expression, dest_type);
946 typedef enum assign_error_t {
948 ASSIGN_ERROR_INCOMPATIBLE,
949 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
950 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
951 ASSIGN_WARNING_POINTER_FROM_INT,
952 ASSIGN_WARNING_INT_FROM_POINTER
955 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
956 const expression_t *const right,
958 const source_position_t *source_position)
960 type_t *const orig_type_right = right->base.type;
961 type_t *const type_left = skip_typeref(orig_type_left);
962 type_t *const type_right = skip_typeref(orig_type_right);
967 case ASSIGN_ERROR_INCOMPATIBLE:
968 errorf(source_position,
969 "destination type '%T' in %s is incompatible with type '%T'",
970 orig_type_left, context, orig_type_right);
973 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
975 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
976 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
978 /* the left type has all qualifiers from the right type */
979 unsigned missing_qualifiers
980 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
981 warningf(source_position,
982 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
983 orig_type_left, context, orig_type_right, missing_qualifiers);
988 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
990 warningf(source_position,
991 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
992 orig_type_left, context, right, orig_type_right);
996 case ASSIGN_WARNING_POINTER_FROM_INT:
998 warningf(source_position,
999 "%s makes pointer '%T' from integer '%T' without a cast",
1000 context, orig_type_left, orig_type_right);
1004 case ASSIGN_WARNING_INT_FROM_POINTER:
1005 if (warning.other) {
1006 warningf(source_position,
1007 "%s makes integer '%T' from pointer '%T' without a cast",
1008 context, orig_type_left, orig_type_right);
1013 panic("invalid error value");
1017 /** Implements the rules from §6.5.16.1 */
1018 static assign_error_t semantic_assign(type_t *orig_type_left,
1019 const expression_t *const right)
1021 type_t *const orig_type_right = right->base.type;
1022 type_t *const type_left = skip_typeref(orig_type_left);
1023 type_t *const type_right = skip_typeref(orig_type_right);
1025 if (is_type_pointer(type_left)) {
1026 if (is_null_pointer_constant(right)) {
1027 return ASSIGN_SUCCESS;
1028 } else if (is_type_pointer(type_right)) {
1029 type_t *points_to_left
1030 = skip_typeref(type_left->pointer.points_to);
1031 type_t *points_to_right
1032 = skip_typeref(type_right->pointer.points_to);
1033 assign_error_t res = ASSIGN_SUCCESS;
1035 /* the left type has all qualifiers from the right type */
1036 unsigned missing_qualifiers
1037 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1038 if (missing_qualifiers != 0) {
1039 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1042 points_to_left = get_unqualified_type(points_to_left);
1043 points_to_right = get_unqualified_type(points_to_right);
1045 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1048 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1049 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1050 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1053 if (!types_compatible(points_to_left, points_to_right)) {
1054 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1058 } else if (is_type_integer(type_right)) {
1059 return ASSIGN_WARNING_POINTER_FROM_INT;
1061 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1062 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1063 && is_type_pointer(type_right))) {
1064 return ASSIGN_SUCCESS;
1065 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1066 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1067 type_t *const unqual_type_left = get_unqualified_type(type_left);
1068 type_t *const unqual_type_right = get_unqualified_type(type_right);
1069 if (types_compatible(unqual_type_left, unqual_type_right)) {
1070 return ASSIGN_SUCCESS;
1072 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1073 return ASSIGN_WARNING_INT_FROM_POINTER;
1076 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1077 return ASSIGN_SUCCESS;
1079 return ASSIGN_ERROR_INCOMPATIBLE;
1082 static expression_t *parse_constant_expression(void)
1084 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1086 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1087 errorf(&result->base.source_position,
1088 "expression '%E' is not constant", result);
1094 static expression_t *parse_assignment_expression(void)
1096 return parse_subexpression(PREC_ASSIGNMENT);
1099 static void warn_string_concat(const source_position_t *pos)
1101 if (warning.traditional) {
1102 warningf(pos, "traditional C rejects string constant concatenation");
1106 static string_t parse_string_literals(void)
1108 assert(token.type == T_STRING_LITERAL);
1109 string_t result = token.literal;
1113 while (token.type == T_STRING_LITERAL) {
1114 warn_string_concat(&token.source_position);
1115 result = concat_strings(&result, &token.literal);
1123 * compare two string, ignoring double underscores on the second.
1125 static int strcmp_underscore(const char *s1, const char *s2)
1127 if (s2[0] == '_' && s2[1] == '_') {
1128 size_t len2 = strlen(s2);
1129 size_t len1 = strlen(s1);
1130 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1131 return strncmp(s1, s2+2, len2-4);
1135 return strcmp(s1, s2);
1138 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1140 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1141 attribute->kind = kind;
1146 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1149 * __attribute__ ( ( attribute-list ) )
1153 * attribute_list , attrib
1158 * any-word ( identifier )
1159 * any-word ( identifier , nonempty-expr-list )
1160 * any-word ( expr-list )
1162 * where the "identifier" must not be declared as a type, and
1163 * "any-word" may be any identifier (including one declared as a
1164 * type), a reserved word storage class specifier, type specifier or
1165 * type qualifier. ??? This still leaves out most reserved keywords
1166 * (following the old parser), shouldn't we include them, and why not
1167 * allow identifiers declared as types to start the arguments?
1169 * Matze: this all looks confusing and little systematic, so we're even less
1170 * strict and parse any list of things which are identifiers or
1171 * (assignment-)expressions.
1173 static attribute_argument_t *parse_attribute_arguments(void)
1175 attribute_argument_t *first = NULL;
1176 attribute_argument_t **anchor = &first;
1177 if (token.type != ')') do {
1178 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1180 /* is it an identifier */
1181 if (token.type == T_IDENTIFIER
1182 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1183 symbol_t *symbol = token.symbol;
1184 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1185 argument->v.symbol = symbol;
1188 /* must be an expression */
1189 expression_t *expression = parse_assignment_expression();
1191 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1192 argument->v.expression = expression;
1195 /* append argument */
1197 anchor = &argument->next;
1198 } while (next_if(','));
1199 expect(')', end_error);
1208 static attribute_t *parse_attribute_asm(void)
1212 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1214 expect('(', end_error);
1215 attribute->a.arguments = parse_attribute_arguments();
1222 static symbol_t *get_symbol_from_token(void)
1224 switch(token.type) {
1226 return token.symbol;
1255 /* maybe we need more tokens ... add them on demand */
1256 return get_token_symbol(&token);
1262 static attribute_t *parse_attribute_gnu_single(void)
1264 /* parse "any-word" */
1265 symbol_t *symbol = get_symbol_from_token();
1266 if (symbol == NULL) {
1267 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1271 const char *name = symbol->string;
1274 attribute_kind_t kind;
1275 for (kind = ATTRIBUTE_GNU_FIRST; kind <= ATTRIBUTE_GNU_LAST; ++kind) {
1276 const char *attribute_name = get_attribute_name(kind);
1277 if (attribute_name != NULL
1278 && strcmp_underscore(attribute_name, name) == 0)
1282 if (kind >= ATTRIBUTE_GNU_LAST) {
1283 if (warning.attribute) {
1284 warningf(HERE, "unknown attribute '%s' ignored", name);
1286 /* TODO: we should still save the attribute in the list... */
1287 kind = ATTRIBUTE_UNKNOWN;
1290 attribute_t *attribute = allocate_attribute_zero(kind);
1292 /* parse arguments */
1294 attribute->a.arguments = parse_attribute_arguments();
1299 static attribute_t *parse_attribute_gnu(void)
1301 attribute_t *first = NULL;
1302 attribute_t **anchor = &first;
1304 eat(T___attribute__);
1305 expect('(', end_error);
1306 expect('(', end_error);
1308 if (token.type != ')') do {
1309 attribute_t *attribute = parse_attribute_gnu_single();
1310 if (attribute == NULL)
1313 *anchor = attribute;
1314 anchor = &attribute->next;
1315 } while (next_if(','));
1316 expect(')', end_error);
1317 expect(')', end_error);
1323 /** Parse attributes. */
1324 static attribute_t *parse_attributes(attribute_t *first)
1326 attribute_t **anchor = &first;
1328 while (*anchor != NULL)
1329 anchor = &(*anchor)->next;
1331 attribute_t *attribute;
1332 switch (token.type) {
1333 case T___attribute__:
1334 attribute = parse_attribute_gnu();
1338 attribute = parse_attribute_asm();
1343 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1348 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1351 case T__forceinline:
1353 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1358 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1363 /* TODO record modifier */
1365 warningf(HERE, "Ignoring declaration modifier %K", &token);
1366 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1373 *anchor = attribute;
1374 anchor = &attribute->next;
1378 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1380 static entity_t *determine_lhs_ent(expression_t *const expr,
1383 switch (expr->kind) {
1384 case EXPR_REFERENCE: {
1385 entity_t *const entity = expr->reference.entity;
1386 /* we should only find variables as lvalues... */
1387 if (entity->base.kind != ENTITY_VARIABLE
1388 && entity->base.kind != ENTITY_PARAMETER)
1394 case EXPR_ARRAY_ACCESS: {
1395 expression_t *const ref = expr->array_access.array_ref;
1396 entity_t * ent = NULL;
1397 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1398 ent = determine_lhs_ent(ref, lhs_ent);
1401 mark_vars_read(expr->select.compound, lhs_ent);
1403 mark_vars_read(expr->array_access.index, lhs_ent);
1408 if (is_type_compound(skip_typeref(expr->base.type))) {
1409 return determine_lhs_ent(expr->select.compound, lhs_ent);
1411 mark_vars_read(expr->select.compound, lhs_ent);
1416 case EXPR_UNARY_DEREFERENCE: {
1417 expression_t *const val = expr->unary.value;
1418 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1420 return determine_lhs_ent(val->unary.value, lhs_ent);
1422 mark_vars_read(val, NULL);
1428 mark_vars_read(expr, NULL);
1433 #define ENT_ANY ((entity_t*)-1)
1436 * Mark declarations, which are read. This is used to detect variables, which
1440 * x is not marked as "read", because it is only read to calculate its own new
1444 * x and y are not detected as "not read", because multiple variables are
1447 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1449 switch (expr->kind) {
1450 case EXPR_REFERENCE: {
1451 entity_t *const entity = expr->reference.entity;
1452 if (entity->kind != ENTITY_VARIABLE
1453 && entity->kind != ENTITY_PARAMETER)
1456 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1457 if (entity->kind == ENTITY_VARIABLE) {
1458 entity->variable.read = true;
1460 entity->parameter.read = true;
1467 // TODO respect pure/const
1468 mark_vars_read(expr->call.function, NULL);
1469 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1470 mark_vars_read(arg->expression, NULL);
1474 case EXPR_CONDITIONAL:
1475 // TODO lhs_decl should depend on whether true/false have an effect
1476 mark_vars_read(expr->conditional.condition, NULL);
1477 if (expr->conditional.true_expression != NULL)
1478 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1479 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1483 if (lhs_ent == ENT_ANY
1484 && !is_type_compound(skip_typeref(expr->base.type)))
1486 mark_vars_read(expr->select.compound, lhs_ent);
1489 case EXPR_ARRAY_ACCESS: {
1490 expression_t *const ref = expr->array_access.array_ref;
1491 mark_vars_read(ref, lhs_ent);
1492 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1493 mark_vars_read(expr->array_access.index, lhs_ent);
1498 mark_vars_read(expr->va_arge.ap, lhs_ent);
1502 mark_vars_read(expr->va_copye.src, lhs_ent);
1505 case EXPR_UNARY_CAST:
1506 /* Special case: Use void cast to mark a variable as "read" */
1507 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1512 case EXPR_UNARY_THROW:
1513 if (expr->unary.value == NULL)
1516 case EXPR_UNARY_DEREFERENCE:
1517 case EXPR_UNARY_DELETE:
1518 case EXPR_UNARY_DELETE_ARRAY:
1519 if (lhs_ent == ENT_ANY)
1523 case EXPR_UNARY_NEGATE:
1524 case EXPR_UNARY_PLUS:
1525 case EXPR_UNARY_BITWISE_NEGATE:
1526 case EXPR_UNARY_NOT:
1527 case EXPR_UNARY_TAKE_ADDRESS:
1528 case EXPR_UNARY_POSTFIX_INCREMENT:
1529 case EXPR_UNARY_POSTFIX_DECREMENT:
1530 case EXPR_UNARY_PREFIX_INCREMENT:
1531 case EXPR_UNARY_PREFIX_DECREMENT:
1532 case EXPR_UNARY_CAST_IMPLICIT:
1533 case EXPR_UNARY_ASSUME:
1535 mark_vars_read(expr->unary.value, lhs_ent);
1538 case EXPR_BINARY_ADD:
1539 case EXPR_BINARY_SUB:
1540 case EXPR_BINARY_MUL:
1541 case EXPR_BINARY_DIV:
1542 case EXPR_BINARY_MOD:
1543 case EXPR_BINARY_EQUAL:
1544 case EXPR_BINARY_NOTEQUAL:
1545 case EXPR_BINARY_LESS:
1546 case EXPR_BINARY_LESSEQUAL:
1547 case EXPR_BINARY_GREATER:
1548 case EXPR_BINARY_GREATEREQUAL:
1549 case EXPR_BINARY_BITWISE_AND:
1550 case EXPR_BINARY_BITWISE_OR:
1551 case EXPR_BINARY_BITWISE_XOR:
1552 case EXPR_BINARY_LOGICAL_AND:
1553 case EXPR_BINARY_LOGICAL_OR:
1554 case EXPR_BINARY_SHIFTLEFT:
1555 case EXPR_BINARY_SHIFTRIGHT:
1556 case EXPR_BINARY_COMMA:
1557 case EXPR_BINARY_ISGREATER:
1558 case EXPR_BINARY_ISGREATEREQUAL:
1559 case EXPR_BINARY_ISLESS:
1560 case EXPR_BINARY_ISLESSEQUAL:
1561 case EXPR_BINARY_ISLESSGREATER:
1562 case EXPR_BINARY_ISUNORDERED:
1563 mark_vars_read(expr->binary.left, lhs_ent);
1564 mark_vars_read(expr->binary.right, lhs_ent);
1567 case EXPR_BINARY_ASSIGN:
1568 case EXPR_BINARY_MUL_ASSIGN:
1569 case EXPR_BINARY_DIV_ASSIGN:
1570 case EXPR_BINARY_MOD_ASSIGN:
1571 case EXPR_BINARY_ADD_ASSIGN:
1572 case EXPR_BINARY_SUB_ASSIGN:
1573 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1574 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1575 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1576 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1577 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1578 if (lhs_ent == ENT_ANY)
1580 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1581 mark_vars_read(expr->binary.right, lhs_ent);
1586 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1592 case EXPR_STRING_LITERAL:
1593 case EXPR_WIDE_STRING_LITERAL:
1594 case EXPR_COMPOUND_LITERAL: // TODO init?
1596 case EXPR_CLASSIFY_TYPE:
1599 case EXPR_BUILTIN_CONSTANT_P:
1600 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1602 case EXPR_STATEMENT: // TODO
1603 case EXPR_LABEL_ADDRESS:
1604 case EXPR_REFERENCE_ENUM_VALUE:
1608 panic("unhandled expression");
1611 static designator_t *parse_designation(void)
1613 designator_t *result = NULL;
1614 designator_t **anchor = &result;
1617 designator_t *designator;
1618 switch (token.type) {
1620 designator = allocate_ast_zero(sizeof(designator[0]));
1621 designator->source_position = token.source_position;
1623 add_anchor_token(']');
1624 designator->array_index = parse_constant_expression();
1625 rem_anchor_token(']');
1626 expect(']', end_error);
1629 designator = allocate_ast_zero(sizeof(designator[0]));
1630 designator->source_position = token.source_position;
1632 if (token.type != T_IDENTIFIER) {
1633 parse_error_expected("while parsing designator",
1634 T_IDENTIFIER, NULL);
1637 designator->symbol = token.symbol;
1641 expect('=', end_error);
1645 assert(designator != NULL);
1646 *anchor = designator;
1647 anchor = &designator->next;
1653 static initializer_t *initializer_from_string(array_type_t *const type,
1654 const string_t *const string)
1656 /* TODO: check len vs. size of array type */
1659 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1660 initializer->string.string = *string;
1665 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1666 const string_t *const string)
1668 /* TODO: check len vs. size of array type */
1671 initializer_t *const initializer =
1672 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1673 initializer->wide_string.string = *string;
1679 * Build an initializer from a given expression.
1681 static initializer_t *initializer_from_expression(type_t *orig_type,
1682 expression_t *expression)
1684 /* TODO check that expression is a constant expression */
1686 /* §6.7.8.14/15 char array may be initialized by string literals */
1687 type_t *type = skip_typeref(orig_type);
1688 type_t *expr_type_orig = expression->base.type;
1689 type_t *expr_type = skip_typeref(expr_type_orig);
1691 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1692 array_type_t *const array_type = &type->array;
1693 type_t *const element_type = skip_typeref(array_type->element_type);
1695 if (element_type->kind == TYPE_ATOMIC) {
1696 atomic_type_kind_t akind = element_type->atomic.akind;
1697 switch (expression->kind) {
1698 case EXPR_STRING_LITERAL:
1699 if (akind == ATOMIC_TYPE_CHAR
1700 || akind == ATOMIC_TYPE_SCHAR
1701 || akind == ATOMIC_TYPE_UCHAR) {
1702 return initializer_from_string(array_type,
1703 &expression->string_literal.value);
1707 case EXPR_WIDE_STRING_LITERAL: {
1708 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1709 if (get_unqualified_type(element_type) == bare_wchar_type) {
1710 return initializer_from_wide_string(array_type,
1711 &expression->string_literal.value);
1722 assign_error_t error = semantic_assign(type, expression);
1723 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1725 report_assign_error(error, type, expression, "initializer",
1726 &expression->base.source_position);
1728 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1729 result->value.value = create_implicit_cast(expression, type);
1735 * Checks if a given expression can be used as an constant initializer.
1737 static bool is_initializer_constant(const expression_t *expression)
1740 is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1741 is_address_constant(expression) != EXPR_CLASS_VARIABLE;
1745 * Parses an scalar initializer.
1747 * §6.7.8.11; eat {} without warning
1749 static initializer_t *parse_scalar_initializer(type_t *type,
1750 bool must_be_constant)
1752 /* there might be extra {} hierarchies */
1756 warningf(HERE, "extra curly braces around scalar initializer");
1759 } while (next_if('{'));
1762 expression_t *expression = parse_assignment_expression();
1763 mark_vars_read(expression, NULL);
1764 if (must_be_constant && !is_initializer_constant(expression)) {
1765 errorf(&expression->base.source_position,
1766 "initialisation expression '%E' is not constant",
1770 initializer_t *initializer = initializer_from_expression(type, expression);
1772 if (initializer == NULL) {
1773 errorf(&expression->base.source_position,
1774 "expression '%E' (type '%T') doesn't match expected type '%T'",
1775 expression, expression->base.type, type);
1780 bool additional_warning_displayed = false;
1781 while (braces > 0) {
1783 if (token.type != '}') {
1784 if (!additional_warning_displayed && warning.other) {
1785 warningf(HERE, "additional elements in scalar initializer");
1786 additional_warning_displayed = true;
1797 * An entry in the type path.
1799 typedef struct type_path_entry_t type_path_entry_t;
1800 struct type_path_entry_t {
1801 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1803 size_t index; /**< For array types: the current index. */
1804 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1809 * A type path expression a position inside compound or array types.
1811 typedef struct type_path_t type_path_t;
1812 struct type_path_t {
1813 type_path_entry_t *path; /**< An flexible array containing the current path. */
1814 type_t *top_type; /**< type of the element the path points */
1815 size_t max_index; /**< largest index in outermost array */
1819 * Prints a type path for debugging.
1821 static __attribute__((unused)) void debug_print_type_path(
1822 const type_path_t *path)
1824 size_t len = ARR_LEN(path->path);
1826 for (size_t i = 0; i < len; ++i) {
1827 const type_path_entry_t *entry = & path->path[i];
1829 type_t *type = skip_typeref(entry->type);
1830 if (is_type_compound(type)) {
1831 /* in gcc mode structs can have no members */
1832 if (entry->v.compound_entry == NULL) {
1836 fprintf(stderr, ".%s",
1837 entry->v.compound_entry->base.symbol->string);
1838 } else if (is_type_array(type)) {
1839 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1841 fprintf(stderr, "-INVALID-");
1844 if (path->top_type != NULL) {
1845 fprintf(stderr, " (");
1846 print_type(path->top_type);
1847 fprintf(stderr, ")");
1852 * Return the top type path entry, ie. in a path
1853 * (type).a.b returns the b.
1855 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1857 size_t len = ARR_LEN(path->path);
1859 return &path->path[len-1];
1863 * Enlarge the type path by an (empty) element.
1865 static type_path_entry_t *append_to_type_path(type_path_t *path)
1867 size_t len = ARR_LEN(path->path);
1868 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1870 type_path_entry_t *result = & path->path[len];
1871 memset(result, 0, sizeof(result[0]));
1876 * Descending into a sub-type. Enter the scope of the current top_type.
1878 static void descend_into_subtype(type_path_t *path)
1880 type_t *orig_top_type = path->top_type;
1881 type_t *top_type = skip_typeref(orig_top_type);
1883 type_path_entry_t *top = append_to_type_path(path);
1884 top->type = top_type;
1886 if (is_type_compound(top_type)) {
1887 compound_t *compound = top_type->compound.compound;
1888 entity_t *entry = compound->members.entities;
1890 if (entry != NULL) {
1891 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1892 top->v.compound_entry = &entry->declaration;
1893 path->top_type = entry->declaration.type;
1895 path->top_type = NULL;
1897 } else if (is_type_array(top_type)) {
1899 path->top_type = top_type->array.element_type;
1901 assert(!is_type_valid(top_type));
1906 * Pop an entry from the given type path, ie. returning from
1907 * (type).a.b to (type).a
1909 static void ascend_from_subtype(type_path_t *path)
1911 type_path_entry_t *top = get_type_path_top(path);
1913 path->top_type = top->type;
1915 size_t len = ARR_LEN(path->path);
1916 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1920 * Pop entries from the given type path until the given
1921 * path level is reached.
1923 static void ascend_to(type_path_t *path, size_t top_path_level)
1925 size_t len = ARR_LEN(path->path);
1927 while (len > top_path_level) {
1928 ascend_from_subtype(path);
1929 len = ARR_LEN(path->path);
1933 static bool walk_designator(type_path_t *path, const designator_t *designator,
1934 bool used_in_offsetof)
1936 for (; designator != NULL; designator = designator->next) {
1937 type_path_entry_t *top = get_type_path_top(path);
1938 type_t *orig_type = top->type;
1940 type_t *type = skip_typeref(orig_type);
1942 if (designator->symbol != NULL) {
1943 symbol_t *symbol = designator->symbol;
1944 if (!is_type_compound(type)) {
1945 if (is_type_valid(type)) {
1946 errorf(&designator->source_position,
1947 "'.%Y' designator used for non-compound type '%T'",
1951 top->type = type_error_type;
1952 top->v.compound_entry = NULL;
1953 orig_type = type_error_type;
1955 compound_t *compound = type->compound.compound;
1956 entity_t *iter = compound->members.entities;
1957 for (; iter != NULL; iter = iter->base.next) {
1958 if (iter->base.symbol == symbol) {
1963 errorf(&designator->source_position,
1964 "'%T' has no member named '%Y'", orig_type, symbol);
1967 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1968 if (used_in_offsetof) {
1969 type_t *real_type = skip_typeref(iter->declaration.type);
1970 if (real_type->kind == TYPE_BITFIELD) {
1971 errorf(&designator->source_position,
1972 "offsetof designator '%Y' must not specify bitfield",
1978 top->type = orig_type;
1979 top->v.compound_entry = &iter->declaration;
1980 orig_type = iter->declaration.type;
1983 expression_t *array_index = designator->array_index;
1984 assert(designator->array_index != NULL);
1986 if (!is_type_array(type)) {
1987 if (is_type_valid(type)) {
1988 errorf(&designator->source_position,
1989 "[%E] designator used for non-array type '%T'",
1990 array_index, orig_type);
1995 long index = fold_constant_to_int(array_index);
1996 if (!used_in_offsetof) {
1998 errorf(&designator->source_position,
1999 "array index [%E] must be positive", array_index);
2000 } else if (type->array.size_constant) {
2001 long array_size = type->array.size;
2002 if (index >= array_size) {
2003 errorf(&designator->source_position,
2004 "designator [%E] (%d) exceeds array size %d",
2005 array_index, index, array_size);
2010 top->type = orig_type;
2011 top->v.index = (size_t) index;
2012 orig_type = type->array.element_type;
2014 path->top_type = orig_type;
2016 if (designator->next != NULL) {
2017 descend_into_subtype(path);
2026 static void advance_current_object(type_path_t *path, size_t top_path_level)
2028 type_path_entry_t *top = get_type_path_top(path);
2030 type_t *type = skip_typeref(top->type);
2031 if (is_type_union(type)) {
2032 /* in unions only the first element is initialized */
2033 top->v.compound_entry = NULL;
2034 } else if (is_type_struct(type)) {
2035 declaration_t *entry = top->v.compound_entry;
2037 entity_t *next_entity = entry->base.next;
2038 if (next_entity != NULL) {
2039 assert(is_declaration(next_entity));
2040 entry = &next_entity->declaration;
2045 top->v.compound_entry = entry;
2046 if (entry != NULL) {
2047 path->top_type = entry->type;
2050 } else if (is_type_array(type)) {
2051 assert(is_type_array(type));
2055 if (!type->array.size_constant || top->v.index < type->array.size) {
2059 assert(!is_type_valid(type));
2063 /* we're past the last member of the current sub-aggregate, try if we
2064 * can ascend in the type hierarchy and continue with another subobject */
2065 size_t len = ARR_LEN(path->path);
2067 if (len > top_path_level) {
2068 ascend_from_subtype(path);
2069 advance_current_object(path, top_path_level);
2071 path->top_type = NULL;
2076 * skip any {...} blocks until a closing bracket is reached.
2078 static void skip_initializers(void)
2082 while (token.type != '}') {
2083 if (token.type == T_EOF)
2085 if (token.type == '{') {
2093 static initializer_t *create_empty_initializer(void)
2095 static initializer_t empty_initializer
2096 = { .list = { { INITIALIZER_LIST }, 0 } };
2097 return &empty_initializer;
2101 * Parse a part of an initialiser for a struct or union,
2103 static initializer_t *parse_sub_initializer(type_path_t *path,
2104 type_t *outer_type, size_t top_path_level,
2105 parse_initializer_env_t *env)
2107 if (token.type == '}') {
2108 /* empty initializer */
2109 return create_empty_initializer();
2112 type_t *orig_type = path->top_type;
2113 type_t *type = NULL;
2115 if (orig_type == NULL) {
2116 /* We are initializing an empty compound. */
2118 type = skip_typeref(orig_type);
2121 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2124 designator_t *designator = NULL;
2125 if (token.type == '.' || token.type == '[') {
2126 designator = parse_designation();
2127 goto finish_designator;
2128 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2129 /* GNU-style designator ("identifier: value") */
2130 designator = allocate_ast_zero(sizeof(designator[0]));
2131 designator->source_position = token.source_position;
2132 designator->symbol = token.symbol;
2137 /* reset path to toplevel, evaluate designator from there */
2138 ascend_to(path, top_path_level);
2139 if (!walk_designator(path, designator, false)) {
2140 /* can't continue after designation error */
2144 initializer_t *designator_initializer
2145 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2146 designator_initializer->designator.designator = designator;
2147 ARR_APP1(initializer_t*, initializers, designator_initializer);
2149 orig_type = path->top_type;
2150 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2155 if (token.type == '{') {
2156 if (type != NULL && is_type_scalar(type)) {
2157 sub = parse_scalar_initializer(type, env->must_be_constant);
2161 if (env->entity != NULL) {
2163 "extra brace group at end of initializer for '%Y'",
2164 env->entity->base.symbol);
2166 errorf(HERE, "extra brace group at end of initializer");
2169 descend_into_subtype(path);
2171 add_anchor_token('}');
2172 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2174 rem_anchor_token('}');
2177 ascend_from_subtype(path);
2178 expect('}', end_error);
2180 expect('}', end_error);
2181 goto error_parse_next;
2185 /* must be an expression */
2186 expression_t *expression = parse_assignment_expression();
2187 mark_vars_read(expression, NULL);
2189 if (env->must_be_constant && !is_initializer_constant(expression)) {
2190 errorf(&expression->base.source_position,
2191 "Initialisation expression '%E' is not constant",
2196 /* we are already outside, ... */
2197 if (outer_type == NULL)
2198 goto error_parse_next;
2199 type_t *const outer_type_skip = skip_typeref(outer_type);
2200 if (is_type_compound(outer_type_skip) &&
2201 !outer_type_skip->compound.compound->complete) {
2202 goto error_parse_next;
2207 /* handle { "string" } special case */
2208 if ((expression->kind == EXPR_STRING_LITERAL
2209 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2210 && outer_type != NULL) {
2211 sub = initializer_from_expression(outer_type, expression);
2214 if (token.type != '}' && warning.other) {
2215 warningf(HERE, "excessive elements in initializer for type '%T'",
2218 /* TODO: eat , ... */
2223 /* descend into subtypes until expression matches type */
2225 orig_type = path->top_type;
2226 type = skip_typeref(orig_type);
2228 sub = initializer_from_expression(orig_type, expression);
2232 if (!is_type_valid(type)) {
2235 if (is_type_scalar(type)) {
2236 errorf(&expression->base.source_position,
2237 "expression '%E' doesn't match expected type '%T'",
2238 expression, orig_type);
2242 descend_into_subtype(path);
2246 /* update largest index of top array */
2247 const type_path_entry_t *first = &path->path[0];
2248 type_t *first_type = first->type;
2249 first_type = skip_typeref(first_type);
2250 if (is_type_array(first_type)) {
2251 size_t index = first->v.index;
2252 if (index > path->max_index)
2253 path->max_index = index;
2257 /* append to initializers list */
2258 ARR_APP1(initializer_t*, initializers, sub);
2261 if (warning.other) {
2262 if (env->entity != NULL) {
2263 warningf(HERE, "excess elements in initializer for '%Y'",
2264 env->entity->base.symbol);
2266 warningf(HERE, "excess elements in initializer");
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);
2354 /* parse_scalar_initializer() also works in this case: we simply
2355 * have an expression without {} around it */
2356 result = parse_scalar_initializer(type, env->must_be_constant);
2359 /* §6.7.8:22 array initializers for arrays with unknown size determine
2360 * the array type size */
2361 if (is_type_array(type) && type->array.size_expression == NULL
2362 && result != NULL) {
2364 switch (result->kind) {
2365 case INITIALIZER_LIST:
2366 assert(max_index != 0xdeadbeaf);
2367 size = max_index + 1;
2370 case INITIALIZER_STRING:
2371 size = result->string.string.size;
2374 case INITIALIZER_WIDE_STRING:
2375 size = result->wide_string.string.size;
2378 case INITIALIZER_DESIGNATOR:
2379 case INITIALIZER_VALUE:
2380 /* can happen for parse errors */
2385 internal_errorf(HERE, "invalid initializer type");
2388 type_t *new_type = duplicate_type(type);
2390 new_type->array.size_expression = make_size_literal(size);
2391 new_type->array.size_constant = true;
2392 new_type->array.has_implicit_size = true;
2393 new_type->array.size = size;
2394 env->type = new_type;
2402 static void append_entity(scope_t *scope, entity_t *entity)
2404 if (scope->last_entity != NULL) {
2405 scope->last_entity->base.next = entity;
2407 scope->entities = entity;
2409 entity->base.parent_entity = current_entity;
2410 scope->last_entity = entity;
2414 static compound_t *parse_compound_type_specifier(bool is_struct)
2416 eat(is_struct ? T_struct : T_union);
2418 symbol_t *symbol = NULL;
2419 compound_t *compound = 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;
2432 entity_t *entity = get_tag(symbol, kind);
2433 if (entity != NULL) {
2434 compound = &entity->compound;
2435 if (compound->base.parent_scope != current_scope &&
2436 (token.type == '{' || token.type == ';')) {
2437 /* we're in an inner scope and have a definition. Shadow
2438 * existing definition in outer scope */
2440 } else if (compound->complete && token.type == '{') {
2441 assert(symbol != NULL);
2442 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2443 is_struct ? "struct" : "union", symbol,
2444 &compound->base.source_position);
2445 /* clear members in the hope to avoid further errors */
2446 compound->members.entities = NULL;
2449 } else if (token.type != '{') {
2451 parse_error_expected("while parsing struct type specifier",
2452 T_IDENTIFIER, '{', NULL);
2454 parse_error_expected("while parsing union type specifier",
2455 T_IDENTIFIER, '{', NULL);
2461 if (compound == NULL) {
2462 entity_t *entity = allocate_entity_zero(kind);
2463 compound = &entity->compound;
2465 compound->alignment = 1;
2466 compound->base.namespc = NAMESPACE_TAG;
2467 compound->base.source_position = token.source_position;
2468 compound->base.symbol = symbol;
2469 compound->base.parent_scope = current_scope;
2470 if (symbol != NULL) {
2471 environment_push(entity);
2473 append_entity(current_scope, entity);
2476 if (token.type == '{') {
2477 parse_compound_type_entries(compound);
2479 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2480 if (symbol == NULL) {
2481 assert(anonymous_entity == NULL);
2482 anonymous_entity = (entity_t*)compound;
2486 if (attributes != NULL) {
2487 handle_entity_attributes(attributes, (entity_t*) compound);
2493 static void parse_enum_entries(type_t *const enum_type)
2497 if (token.type == '}') {
2498 errorf(HERE, "empty enum not allowed");
2503 add_anchor_token('}');
2505 if (token.type != T_IDENTIFIER) {
2506 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2508 rem_anchor_token('}');
2512 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2513 entity->enum_value.enum_type = enum_type;
2514 entity->base.namespc = NAMESPACE_NORMAL;
2515 entity->base.symbol = token.symbol;
2516 entity->base.source_position = token.source_position;
2520 expression_t *value = parse_constant_expression();
2522 value = create_implicit_cast(value, enum_type);
2523 entity->enum_value.value = value;
2528 record_entity(entity, false);
2529 } while (next_if(',') && token.type != '}');
2530 rem_anchor_token('}');
2532 expect('}', end_error);
2538 static type_t *parse_enum_specifier(void)
2544 switch (token.type) {
2546 symbol = token.symbol;
2549 entity = get_tag(symbol, ENTITY_ENUM);
2550 if (entity != NULL) {
2551 if (entity->base.parent_scope != current_scope &&
2552 (token.type == '{' || token.type == ';')) {
2553 /* we're in an inner scope and have a definition. Shadow
2554 * existing definition in outer scope */
2556 } else if (entity->enume.complete && token.type == '{') {
2557 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
2558 symbol, &entity->base.source_position);
2569 parse_error_expected("while parsing enum type specifier",
2570 T_IDENTIFIER, '{', NULL);
2574 if (entity == NULL) {
2575 entity = allocate_entity_zero(ENTITY_ENUM);
2576 entity->base.namespc = NAMESPACE_TAG;
2577 entity->base.source_position = token.source_position;
2578 entity->base.symbol = symbol;
2579 entity->base.parent_scope = current_scope;
2582 type_t *const type = allocate_type_zero(TYPE_ENUM);
2583 type->enumt.enume = &entity->enume;
2584 type->enumt.akind = ATOMIC_TYPE_INT;
2586 if (token.type == '{') {
2587 if (symbol != NULL) {
2588 environment_push(entity);
2590 append_entity(current_scope, entity);
2591 entity->enume.complete = true;
2593 parse_enum_entries(type);
2594 parse_attributes(NULL);
2596 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2597 if (symbol == NULL) {
2598 assert(anonymous_entity == NULL);
2599 anonymous_entity = entity;
2601 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2602 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2610 * if a symbol is a typedef to another type, return true
2612 static bool is_typedef_symbol(symbol_t *symbol)
2614 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2615 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2618 static type_t *parse_typeof(void)
2624 expect('(', end_error);
2625 add_anchor_token(')');
2627 expression_t *expression = NULL;
2629 bool old_type_prop = in_type_prop;
2630 bool old_gcc_extension = in_gcc_extension;
2631 in_type_prop = true;
2633 while (next_if(T___extension__)) {
2634 /* This can be a prefix to a typename or an expression. */
2635 in_gcc_extension = true;
2637 switch (token.type) {
2639 if (is_typedef_symbol(token.symbol)) {
2641 type = parse_typename();
2644 expression = parse_expression();
2645 type = revert_automatic_type_conversion(expression);
2649 in_type_prop = old_type_prop;
2650 in_gcc_extension = old_gcc_extension;
2652 rem_anchor_token(')');
2653 expect(')', end_error);
2655 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2656 typeof_type->typeoft.expression = expression;
2657 typeof_type->typeoft.typeof_type = type;
2664 typedef enum specifiers_t {
2665 SPECIFIER_SIGNED = 1 << 0,
2666 SPECIFIER_UNSIGNED = 1 << 1,
2667 SPECIFIER_LONG = 1 << 2,
2668 SPECIFIER_INT = 1 << 3,
2669 SPECIFIER_DOUBLE = 1 << 4,
2670 SPECIFIER_CHAR = 1 << 5,
2671 SPECIFIER_WCHAR_T = 1 << 6,
2672 SPECIFIER_SHORT = 1 << 7,
2673 SPECIFIER_LONG_LONG = 1 << 8,
2674 SPECIFIER_FLOAT = 1 << 9,
2675 SPECIFIER_BOOL = 1 << 10,
2676 SPECIFIER_VOID = 1 << 11,
2677 SPECIFIER_INT8 = 1 << 12,
2678 SPECIFIER_INT16 = 1 << 13,
2679 SPECIFIER_INT32 = 1 << 14,
2680 SPECIFIER_INT64 = 1 << 15,
2681 SPECIFIER_INT128 = 1 << 16,
2682 SPECIFIER_COMPLEX = 1 << 17,
2683 SPECIFIER_IMAGINARY = 1 << 18,
2686 static type_t *create_builtin_type(symbol_t *const symbol,
2687 type_t *const real_type)
2689 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2690 type->builtin.symbol = symbol;
2691 type->builtin.real_type = real_type;
2692 return identify_new_type(type);
2695 static type_t *get_typedef_type(symbol_t *symbol)
2697 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2698 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2701 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2702 type->typedeft.typedefe = &entity->typedefe;
2707 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2709 expect('(', end_error);
2711 attribute_property_argument_t *property
2712 = allocate_ast_zero(sizeof(*property));
2715 if (token.type != T_IDENTIFIER) {
2716 parse_error_expected("while parsing property declspec",
2717 T_IDENTIFIER, NULL);
2722 symbol_t *symbol = token.symbol;
2724 if (strcmp(symbol->string, "put") == 0) {
2726 } else if (strcmp(symbol->string, "get") == 0) {
2729 errorf(HERE, "expected put or get in property declspec");
2732 expect('=', end_error);
2733 if (token.type != T_IDENTIFIER) {
2734 parse_error_expected("while parsing property declspec",
2735 T_IDENTIFIER, NULL);
2739 property->put_symbol = token.symbol;
2741 property->get_symbol = token.symbol;
2744 } while (next_if(','));
2746 attribute->a.property = property;
2748 expect(')', end_error);
2754 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2756 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2757 if (next_if(T_restrict)) {
2758 kind = ATTRIBUTE_MS_RESTRICT;
2759 } else if (token.type == T_IDENTIFIER) {
2760 const char *name = token.symbol->string;
2762 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2764 const char *attribute_name = get_attribute_name(k);
2765 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2771 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2772 warningf(HERE, "unknown __declspec '%s' ignored", name);
2775 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2779 attribute_t *attribute = allocate_attribute_zero(kind);
2781 if (kind == ATTRIBUTE_MS_PROPERTY) {
2782 return parse_attribute_ms_property(attribute);
2785 /* parse arguments */
2787 attribute->a.arguments = parse_attribute_arguments();
2792 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2796 expect('(', end_error);
2801 add_anchor_token(')');
2803 attribute_t **anchor = &first;
2805 while (*anchor != NULL)
2806 anchor = &(*anchor)->next;
2808 attribute_t *attribute
2809 = parse_microsoft_extended_decl_modifier_single();
2810 if (attribute == NULL)
2813 *anchor = attribute;
2814 anchor = &attribute->next;
2815 } while (next_if(','));
2817 rem_anchor_token(')');
2818 expect(')', end_error);
2822 rem_anchor_token(')');
2826 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2828 entity_t *entity = allocate_entity_zero(kind);
2829 entity->base.namespc = NAMESPACE_NORMAL;
2830 entity->base.source_position = *HERE;
2831 entity->base.symbol = symbol;
2832 if (is_declaration(entity)) {
2833 entity->declaration.type = type_error_type;
2834 entity->declaration.implicit = true;
2835 } else if (kind == ENTITY_TYPEDEF) {
2836 entity->typedefe.type = type_error_type;
2837 entity->typedefe.builtin = true;
2839 if (kind != ENTITY_COMPOUND_MEMBER)
2840 record_entity(entity, false);
2844 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2846 type_t *type = NULL;
2847 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2848 unsigned type_specifiers = 0;
2849 bool newtype = false;
2850 bool saw_error = false;
2851 bool old_gcc_extension = in_gcc_extension;
2853 specifiers->source_position = token.source_position;
2856 specifiers->attributes = parse_attributes(specifiers->attributes);
2858 switch (token.type) {
2860 #define MATCH_STORAGE_CLASS(token, class) \
2862 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2863 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2865 specifiers->storage_class = class; \
2866 if (specifiers->thread_local) \
2867 goto check_thread_storage_class; \
2871 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2872 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2873 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2874 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2875 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2878 specifiers->attributes
2879 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2883 if (specifiers->thread_local) {
2884 errorf(HERE, "duplicate '__thread'");
2886 specifiers->thread_local = true;
2887 check_thread_storage_class:
2888 switch (specifiers->storage_class) {
2889 case STORAGE_CLASS_EXTERN:
2890 case STORAGE_CLASS_NONE:
2891 case STORAGE_CLASS_STATIC:
2895 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2896 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2897 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2898 wrong_thread_storage_class:
2899 errorf(HERE, "'__thread' used with '%s'", wrong);
2906 /* type qualifiers */
2907 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2909 qualifiers |= qualifier; \
2913 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2914 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2915 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2916 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2917 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2918 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2919 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2920 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2922 case T___extension__:
2924 in_gcc_extension = true;
2927 /* type specifiers */
2928 #define MATCH_SPECIFIER(token, specifier, name) \
2930 if (type_specifiers & specifier) { \
2931 errorf(HERE, "multiple " name " type specifiers given"); \
2933 type_specifiers |= specifier; \
2938 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2939 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2940 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2941 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2942 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2943 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2944 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2945 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2946 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2947 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2948 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2949 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2950 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2951 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2952 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2953 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2954 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2955 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2959 specifiers->is_inline = true;
2963 case T__forceinline:
2965 specifiers->modifiers |= DM_FORCEINLINE;
2970 if (type_specifiers & SPECIFIER_LONG_LONG) {
2971 errorf(HERE, "multiple type specifiers given");
2972 } else if (type_specifiers & SPECIFIER_LONG) {
2973 type_specifiers |= SPECIFIER_LONG_LONG;
2975 type_specifiers |= SPECIFIER_LONG;
2980 #define CHECK_DOUBLE_TYPE() \
2981 if ( type != NULL) \
2982 errorf(HERE, "multiple data types in declaration specifiers");
2985 CHECK_DOUBLE_TYPE();
2986 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2988 type->compound.compound = parse_compound_type_specifier(true);
2991 CHECK_DOUBLE_TYPE();
2992 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2993 type->compound.compound = parse_compound_type_specifier(false);
2996 CHECK_DOUBLE_TYPE();
2997 type = parse_enum_specifier();
3000 CHECK_DOUBLE_TYPE();
3001 type = parse_typeof();
3003 case T___builtin_va_list:
3004 CHECK_DOUBLE_TYPE();
3005 type = duplicate_type(type_valist);
3009 case T_IDENTIFIER: {
3010 /* only parse identifier if we haven't found a type yet */
3011 if (type != NULL || type_specifiers != 0) {
3012 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3013 * declaration, so it doesn't generate errors about expecting '(' or
3015 switch (look_ahead(1)->type) {
3022 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3026 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3031 goto finish_specifiers;
3035 type_t *const typedef_type = get_typedef_type(token.symbol);
3036 if (typedef_type == NULL) {
3037 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3038 * declaration, so it doesn't generate 'implicit int' followed by more
3039 * errors later on. */
3040 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3046 errorf(HERE, "%K does not name a type", &token);
3049 create_error_entity(token.symbol, ENTITY_TYPEDEF);
3051 type = allocate_type_zero(TYPE_TYPEDEF);
3052 type->typedeft.typedefe = &entity->typedefe;
3056 if (la1_type == '&' || la1_type == '*')
3057 goto finish_specifiers;
3062 goto finish_specifiers;
3067 type = typedef_type;
3071 /* function specifier */
3073 goto finish_specifiers;
3078 specifiers->attributes = parse_attributes(specifiers->attributes);
3080 in_gcc_extension = old_gcc_extension;
3082 if (type == NULL || (saw_error && type_specifiers != 0)) {
3083 atomic_type_kind_t atomic_type;
3085 /* match valid basic types */
3086 switch (type_specifiers) {
3087 case SPECIFIER_VOID:
3088 atomic_type = ATOMIC_TYPE_VOID;
3090 case SPECIFIER_WCHAR_T:
3091 atomic_type = ATOMIC_TYPE_WCHAR_T;
3093 case SPECIFIER_CHAR:
3094 atomic_type = ATOMIC_TYPE_CHAR;
3096 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3097 atomic_type = ATOMIC_TYPE_SCHAR;
3099 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3100 atomic_type = ATOMIC_TYPE_UCHAR;
3102 case SPECIFIER_SHORT:
3103 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3104 case SPECIFIER_SHORT | SPECIFIER_INT:
3105 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3106 atomic_type = ATOMIC_TYPE_SHORT;
3108 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3109 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3110 atomic_type = ATOMIC_TYPE_USHORT;
3113 case SPECIFIER_SIGNED:
3114 case SPECIFIER_SIGNED | SPECIFIER_INT:
3115 atomic_type = ATOMIC_TYPE_INT;
3117 case SPECIFIER_UNSIGNED:
3118 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3119 atomic_type = ATOMIC_TYPE_UINT;
3121 case SPECIFIER_LONG:
3122 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3123 case SPECIFIER_LONG | SPECIFIER_INT:
3124 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3125 atomic_type = ATOMIC_TYPE_LONG;
3127 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3128 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3129 atomic_type = ATOMIC_TYPE_ULONG;
3132 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3133 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3134 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3135 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3137 atomic_type = ATOMIC_TYPE_LONGLONG;
3138 goto warn_about_long_long;
3140 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3141 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3143 atomic_type = ATOMIC_TYPE_ULONGLONG;
3144 warn_about_long_long:
3145 if (warning.long_long) {
3146 warningf(&specifiers->source_position,
3147 "ISO C90 does not support 'long long'");
3151 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3152 atomic_type = unsigned_int8_type_kind;
3155 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3156 atomic_type = unsigned_int16_type_kind;
3159 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3160 atomic_type = unsigned_int32_type_kind;
3163 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3164 atomic_type = unsigned_int64_type_kind;
3167 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3168 atomic_type = unsigned_int128_type_kind;
3171 case SPECIFIER_INT8:
3172 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3173 atomic_type = int8_type_kind;
3176 case SPECIFIER_INT16:
3177 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3178 atomic_type = int16_type_kind;
3181 case SPECIFIER_INT32:
3182 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3183 atomic_type = int32_type_kind;
3186 case SPECIFIER_INT64:
3187 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3188 atomic_type = int64_type_kind;
3191 case SPECIFIER_INT128:
3192 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3193 atomic_type = int128_type_kind;
3196 case SPECIFIER_FLOAT:
3197 atomic_type = ATOMIC_TYPE_FLOAT;
3199 case SPECIFIER_DOUBLE:
3200 atomic_type = ATOMIC_TYPE_DOUBLE;
3202 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3203 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3205 case SPECIFIER_BOOL:
3206 atomic_type = ATOMIC_TYPE_BOOL;
3208 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3209 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3210 atomic_type = ATOMIC_TYPE_FLOAT;
3212 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3213 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3214 atomic_type = ATOMIC_TYPE_DOUBLE;
3216 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3217 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3218 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3221 /* invalid specifier combination, give an error message */
3222 if (type_specifiers == 0) {
3226 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3227 if (!(c_mode & _CXX) && !strict_mode) {
3228 if (warning.implicit_int) {
3229 warningf(HERE, "no type specifiers in declaration, using 'int'");
3231 atomic_type = ATOMIC_TYPE_INT;
3234 errorf(HERE, "no type specifiers given in declaration");
3236 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3237 (type_specifiers & SPECIFIER_UNSIGNED)) {
3238 errorf(HERE, "signed and unsigned specifiers given");
3239 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3240 errorf(HERE, "only integer types can be signed or unsigned");
3242 errorf(HERE, "multiple datatypes in declaration");
3247 if (type_specifiers & SPECIFIER_COMPLEX) {
3248 type = allocate_type_zero(TYPE_COMPLEX);
3249 type->complex.akind = atomic_type;
3250 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3251 type = allocate_type_zero(TYPE_IMAGINARY);
3252 type->imaginary.akind = atomic_type;
3254 type = allocate_type_zero(TYPE_ATOMIC);
3255 type->atomic.akind = atomic_type;
3258 } else if (type_specifiers != 0) {
3259 errorf(HERE, "multiple datatypes in declaration");
3262 /* FIXME: check type qualifiers here */
3263 type->base.qualifiers = qualifiers;
3266 type = identify_new_type(type);
3268 type = typehash_insert(type);
3271 if (specifiers->attributes != NULL)
3272 type = handle_type_attributes(specifiers->attributes, type);
3273 specifiers->type = type;
3277 specifiers->type = type_error_type;
3280 static type_qualifiers_t parse_type_qualifiers(void)
3282 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3285 switch (token.type) {
3286 /* type qualifiers */
3287 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3288 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3289 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3290 /* microsoft extended type modifiers */
3291 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3292 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3293 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3294 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3295 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3304 * Parses an K&R identifier list
3306 static void parse_identifier_list(scope_t *scope)
3309 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3310 entity->base.source_position = token.source_position;
3311 entity->base.namespc = NAMESPACE_NORMAL;
3312 entity->base.symbol = token.symbol;
3313 /* a K&R parameter has no type, yet */
3317 append_entity(scope, entity);
3318 } while (next_if(',') && token.type == T_IDENTIFIER);
3321 static entity_t *parse_parameter(void)
3323 declaration_specifiers_t specifiers;
3324 memset(&specifiers, 0, sizeof(specifiers));
3326 parse_declaration_specifiers(&specifiers);
3328 entity_t *entity = parse_declarator(&specifiers,
3329 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3330 anonymous_entity = NULL;
3334 static void semantic_parameter_incomplete(const entity_t *entity)
3336 assert(entity->kind == ENTITY_PARAMETER);
3338 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3339 * list in a function declarator that is part of a
3340 * definition of that function shall not have
3341 * incomplete type. */
3342 type_t *type = skip_typeref(entity->declaration.type);
3343 if (is_type_incomplete(type)) {
3344 errorf(&entity->base.source_position,
3345 "parameter '%#T' has incomplete type",
3346 entity->declaration.type, entity->base.symbol);
3350 static bool has_parameters(void)
3352 /* func(void) is not a parameter */
3353 if (token.type == T_IDENTIFIER) {
3354 entity_t const *const entity = get_entity(token.symbol, NAMESPACE_NORMAL);
3357 if (entity->kind != ENTITY_TYPEDEF)
3359 if (skip_typeref(entity->typedefe.type) != type_void)
3361 } else if (token.type != T_void) {
3364 if (look_ahead(1)->type != ')')
3371 * Parses function type parameters (and optionally creates variable_t entities
3372 * for them in a scope)
3374 static void parse_parameters(function_type_t *type, scope_t *scope)
3377 add_anchor_token(')');
3378 int saved_comma_state = save_and_reset_anchor_state(',');
3380 if (token.type == T_IDENTIFIER &&
3381 !is_typedef_symbol(token.symbol)) {
3382 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3383 if (la1_type == ',' || la1_type == ')') {
3384 type->kr_style_parameters = true;
3385 parse_identifier_list(scope);
3386 goto parameters_finished;
3390 if (token.type == ')') {
3391 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3392 if (!(c_mode & _CXX))
3393 type->unspecified_parameters = true;
3394 goto parameters_finished;
3397 if (has_parameters()) {
3398 function_parameter_t **anchor = &type->parameters;
3400 switch (token.type) {
3403 type->variadic = true;
3404 goto parameters_finished;
3407 case T___extension__:
3410 entity_t *entity = parse_parameter();
3411 if (entity->kind == ENTITY_TYPEDEF) {
3412 errorf(&entity->base.source_position,
3413 "typedef not allowed as function parameter");
3416 assert(is_declaration(entity));
3418 semantic_parameter_incomplete(entity);
3420 function_parameter_t *const parameter =
3421 allocate_parameter(entity->declaration.type);
3423 if (scope != NULL) {
3424 append_entity(scope, entity);
3427 *anchor = parameter;
3428 anchor = ¶meter->next;
3433 goto parameters_finished;
3435 } while (next_if(','));
3439 parameters_finished:
3440 rem_anchor_token(')');
3441 expect(')', end_error);
3444 restore_anchor_state(',', saved_comma_state);
3447 typedef enum construct_type_kind_t {
3450 CONSTRUCT_REFERENCE,
3453 } construct_type_kind_t;
3455 typedef union construct_type_t construct_type_t;
3457 typedef struct construct_type_base_t {
3458 construct_type_kind_t kind;
3459 construct_type_t *next;
3460 } construct_type_base_t;
3462 typedef struct parsed_pointer_t {
3463 construct_type_base_t base;
3464 type_qualifiers_t type_qualifiers;
3465 variable_t *base_variable; /**< MS __based extension. */
3468 typedef struct parsed_reference_t {
3469 construct_type_base_t base;
3470 } parsed_reference_t;
3472 typedef struct construct_function_type_t {
3473 construct_type_base_t base;
3474 type_t *function_type;
3475 } construct_function_type_t;
3477 typedef struct parsed_array_t {
3478 construct_type_base_t base;
3479 type_qualifiers_t type_qualifiers;
3485 union construct_type_t {
3486 construct_type_kind_t kind;
3487 construct_type_base_t base;
3488 parsed_pointer_t pointer;
3489 parsed_reference_t reference;
3490 construct_function_type_t function;
3491 parsed_array_t array;
3494 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3496 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3497 memset(cons, 0, size);
3503 static construct_type_t *parse_pointer_declarator(void)
3507 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3508 cons->pointer.type_qualifiers = parse_type_qualifiers();
3509 //cons->pointer.base_variable = base_variable;
3514 /* ISO/IEC 14882:1998(E) §8.3.2 */
3515 static construct_type_t *parse_reference_declarator(void)
3519 if (!(c_mode & _CXX))
3520 errorf(HERE, "references are only available for C++");
3522 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3528 static construct_type_t *parse_array_declarator(void)
3531 add_anchor_token(']');
3533 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3534 parsed_array_t *const array = &cons->array;
3536 bool is_static = next_if(T_static);
3538 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3541 is_static = next_if(T_static);
3543 array->type_qualifiers = type_qualifiers;
3544 array->is_static = is_static;
3546 expression_t *size = NULL;
3547 if (token.type == '*' && look_ahead(1)->type == ']') {
3548 array->is_variable = true;
3550 } else if (token.type != ']') {
3551 size = parse_assignment_expression();
3553 /* §6.7.5.2:1 Array size must have integer type */
3554 type_t *const orig_type = size->base.type;
3555 type_t *const type = skip_typeref(orig_type);
3556 if (!is_type_integer(type) && is_type_valid(type)) {
3557 errorf(&size->base.source_position,
3558 "array size '%E' must have integer type but has type '%T'",
3563 mark_vars_read(size, NULL);
3566 if (is_static && size == NULL)
3567 errorf(HERE, "static array parameters require a size");
3569 rem_anchor_token(']');
3570 expect(']', end_error);
3577 static construct_type_t *parse_function_declarator(scope_t *scope)
3579 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3580 function_type_t *ftype = &type->function;
3582 ftype->linkage = current_linkage;
3583 ftype->calling_convention = CC_DEFAULT;
3585 parse_parameters(ftype, scope);
3587 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3588 cons->function.function_type = type;
3593 typedef struct parse_declarator_env_t {
3594 bool may_be_abstract : 1;
3595 bool must_be_abstract : 1;
3596 decl_modifiers_t modifiers;
3598 source_position_t source_position;
3600 attribute_t *attributes;
3601 } parse_declarator_env_t;
3604 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3606 /* construct a single linked list of construct_type_t's which describe
3607 * how to construct the final declarator type */
3608 construct_type_t *first = NULL;
3609 construct_type_t **anchor = &first;
3611 env->attributes = parse_attributes(env->attributes);
3614 construct_type_t *type;
3615 //variable_t *based = NULL; /* MS __based extension */
3616 switch (token.type) {
3618 type = parse_reference_declarator();
3622 panic("based not supported anymore");
3627 type = parse_pointer_declarator();
3631 goto ptr_operator_end;
3635 anchor = &type->base.next;
3637 /* TODO: find out if this is correct */
3638 env->attributes = parse_attributes(env->attributes);
3642 construct_type_t *inner_types = NULL;
3644 switch (token.type) {
3646 if (env->must_be_abstract) {
3647 errorf(HERE, "no identifier expected in typename");
3649 env->symbol = token.symbol;
3650 env->source_position = token.source_position;
3655 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3656 * interpreted as ``function with no parameter specification'', rather
3657 * than redundant parentheses around the omitted identifier. */
3658 if (look_ahead(1)->type != ')') {
3660 add_anchor_token(')');
3661 inner_types = parse_inner_declarator(env);
3662 if (inner_types != NULL) {
3663 /* All later declarators only modify the return type */
3664 env->must_be_abstract = true;
3666 rem_anchor_token(')');
3667 expect(')', end_error);
3668 } else if (!env->may_be_abstract) {
3669 errorf(HERE, "declarator must have a name");
3674 if (env->may_be_abstract)
3676 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3682 construct_type_t **const p = anchor;
3685 construct_type_t *type;
3686 switch (token.type) {
3688 scope_t *scope = NULL;
3689 if (!env->must_be_abstract) {
3690 scope = &env->parameters;
3693 type = parse_function_declarator(scope);
3697 type = parse_array_declarator();
3700 goto declarator_finished;
3703 /* insert in the middle of the list (at p) */
3704 type->base.next = *p;
3707 anchor = &type->base.next;
3710 declarator_finished:
3711 /* append inner_types at the end of the list, we don't to set anchor anymore
3712 * as it's not needed anymore */
3713 *anchor = inner_types;
3720 static type_t *construct_declarator_type(construct_type_t *construct_list,
3723 construct_type_t *iter = construct_list;
3724 for (; iter != NULL; iter = iter->base.next) {
3725 switch (iter->kind) {
3726 case CONSTRUCT_INVALID:
3728 case CONSTRUCT_FUNCTION: {
3729 construct_function_type_t *function = &iter->function;
3730 type_t *function_type = function->function_type;
3732 function_type->function.return_type = type;
3734 type_t *skipped_return_type = skip_typeref(type);
3736 if (is_type_function(skipped_return_type)) {
3737 errorf(HERE, "function returning function is not allowed");
3738 } else if (is_type_array(skipped_return_type)) {
3739 errorf(HERE, "function returning array is not allowed");
3741 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3743 "type qualifiers in return type of function type are meaningless");
3747 /* The function type was constructed earlier. Freeing it here will
3748 * destroy other types. */
3749 type = typehash_insert(function_type);
3753 case CONSTRUCT_POINTER: {
3754 if (is_type_reference(skip_typeref(type)))
3755 errorf(HERE, "cannot declare a pointer to reference");
3757 parsed_pointer_t *pointer = &iter->pointer;
3758 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3762 case CONSTRUCT_REFERENCE:
3763 if (is_type_reference(skip_typeref(type)))
3764 errorf(HERE, "cannot declare a reference to reference");
3766 type = make_reference_type(type);
3769 case CONSTRUCT_ARRAY: {
3770 if (is_type_reference(skip_typeref(type)))
3771 errorf(HERE, "cannot declare an array of references");
3773 parsed_array_t *array = &iter->array;
3774 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3776 expression_t *size_expression = array->size;
3777 if (size_expression != NULL) {
3779 = create_implicit_cast(size_expression, type_size_t);
3782 array_type->base.qualifiers = array->type_qualifiers;
3783 array_type->array.element_type = type;
3784 array_type->array.is_static = array->is_static;
3785 array_type->array.is_variable = array->is_variable;
3786 array_type->array.size_expression = size_expression;
3788 if (size_expression != NULL) {
3789 switch (is_constant_expression(size_expression)) {
3790 case EXPR_CLASS_CONSTANT: {
3791 long const size = fold_constant_to_int(size_expression);
3792 array_type->array.size = size;
3793 array_type->array.size_constant = true;
3794 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3795 * have a value greater than zero. */
3797 if (size < 0 || !GNU_MODE) {
3798 errorf(&size_expression->base.source_position,
3799 "size of array must be greater than zero");
3800 } else if (warning.other) {
3801 warningf(&size_expression->base.source_position,
3802 "zero length arrays are a GCC extension");
3808 case EXPR_CLASS_VARIABLE:
3809 array_type->array.is_vla = true;
3812 case EXPR_CLASS_ERROR:
3817 type_t *skipped_type = skip_typeref(type);
3819 if (is_type_incomplete(skipped_type)) {
3820 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
3821 } else if (is_type_function(skipped_type)) {
3822 errorf(HERE, "array of functions is not allowed");
3824 type = identify_new_type(array_type);
3828 internal_errorf(HERE, "invalid type construction found");
3834 static type_t *automatic_type_conversion(type_t *orig_type);
3836 static type_t *semantic_parameter(const source_position_t *pos,
3838 const declaration_specifiers_t *specifiers,
3841 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3842 * shall be adjusted to ``qualified pointer to type'',
3844 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3845 * type'' shall be adjusted to ``pointer to function
3846 * returning type'', as in 6.3.2.1. */
3847 type = automatic_type_conversion(type);
3849 if (specifiers->is_inline && is_type_valid(type)) {
3850 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
3853 /* §6.9.1:6 The declarations in the declaration list shall contain
3854 * no storage-class specifier other than register and no
3855 * initializations. */
3856 if (specifiers->thread_local || (
3857 specifiers->storage_class != STORAGE_CLASS_NONE &&
3858 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3860 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
3863 /* delay test for incomplete type, because we might have (void)
3864 * which is legal but incomplete... */
3869 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3870 declarator_flags_t flags)
3872 parse_declarator_env_t env;
3873 memset(&env, 0, sizeof(env));
3874 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3876 construct_type_t *construct_type = parse_inner_declarator(&env);
3878 construct_declarator_type(construct_type, specifiers->type);
3879 type_t *type = skip_typeref(orig_type);
3881 if (construct_type != NULL) {
3882 obstack_free(&temp_obst, construct_type);
3885 attribute_t *attributes = parse_attributes(env.attributes);
3886 /* append (shared) specifier attribute behind attributes of this
3888 attribute_t **anchor = &attributes;
3889 while (*anchor != NULL)
3890 anchor = &(*anchor)->next;
3891 *anchor = specifiers->attributes;
3894 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3895 entity = allocate_entity_zero(ENTITY_TYPEDEF);
3896 entity->base.namespc = NAMESPACE_NORMAL;
3897 entity->base.symbol = env.symbol;
3898 entity->base.source_position = env.source_position;
3899 entity->typedefe.type = orig_type;
3901 if (anonymous_entity != NULL) {
3902 if (is_type_compound(type)) {
3903 assert(anonymous_entity->compound.alias == NULL);
3904 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3905 anonymous_entity->kind == ENTITY_UNION);
3906 anonymous_entity->compound.alias = entity;
3907 anonymous_entity = NULL;
3908 } else if (is_type_enum(type)) {
3909 assert(anonymous_entity->enume.alias == NULL);
3910 assert(anonymous_entity->kind == ENTITY_ENUM);
3911 anonymous_entity->enume.alias = entity;
3912 anonymous_entity = NULL;
3916 /* create a declaration type entity */
3917 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3918 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
3920 if (env.symbol != NULL) {
3921 if (specifiers->is_inline && is_type_valid(type)) {
3922 errorf(&env.source_position,
3923 "compound member '%Y' declared 'inline'", env.symbol);
3926 if (specifiers->thread_local ||
3927 specifiers->storage_class != STORAGE_CLASS_NONE) {
3928 errorf(&env.source_position,
3929 "compound member '%Y' must have no storage class",
3933 } else if (flags & DECL_IS_PARAMETER) {
3934 orig_type = semantic_parameter(&env.source_position, orig_type,
3935 specifiers, env.symbol);
3937 entity = allocate_entity_zero(ENTITY_PARAMETER);
3938 } else if (is_type_function(type)) {
3939 entity = allocate_entity_zero(ENTITY_FUNCTION);
3941 entity->function.is_inline = specifiers->is_inline;
3942 entity->function.parameters = env.parameters;
3944 if (env.symbol != NULL) {
3945 /* this needs fixes for C++ */
3946 bool in_function_scope = current_function != NULL;
3948 if (specifiers->thread_local || (
3949 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3950 specifiers->storage_class != STORAGE_CLASS_NONE &&
3951 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3953 errorf(&env.source_position,
3954 "invalid storage class for function '%Y'", env.symbol);
3958 entity = allocate_entity_zero(ENTITY_VARIABLE);
3960 entity->variable.thread_local = specifiers->thread_local;
3962 if (env.symbol != NULL) {
3963 if (specifiers->is_inline && is_type_valid(type)) {
3964 errorf(&env.source_position,
3965 "variable '%Y' declared 'inline'", env.symbol);
3968 bool invalid_storage_class = false;
3969 if (current_scope == file_scope) {
3970 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3971 specifiers->storage_class != STORAGE_CLASS_NONE &&
3972 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3973 invalid_storage_class = true;
3976 if (specifiers->thread_local &&
3977 specifiers->storage_class == STORAGE_CLASS_NONE) {
3978 invalid_storage_class = true;
3981 if (invalid_storage_class) {
3982 errorf(&env.source_position,
3983 "invalid storage class for variable '%Y'", env.symbol);
3988 if (env.symbol != NULL) {
3989 entity->base.symbol = env.symbol;
3990 entity->base.source_position = env.source_position;
3992 entity->base.source_position = specifiers->source_position;
3994 entity->base.namespc = NAMESPACE_NORMAL;
3995 entity->declaration.type = orig_type;
3996 entity->declaration.alignment = get_type_alignment(orig_type);
3997 entity->declaration.modifiers = env.modifiers;
3998 entity->declaration.attributes = attributes;
4000 storage_class_t storage_class = specifiers->storage_class;
4001 entity->declaration.declared_storage_class = storage_class;
4003 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
4004 storage_class = STORAGE_CLASS_AUTO;
4005 entity->declaration.storage_class = storage_class;
4008 if (attributes != NULL) {
4009 handle_entity_attributes(attributes, entity);
4015 static type_t *parse_abstract_declarator(type_t *base_type)
4017 parse_declarator_env_t env;
4018 memset(&env, 0, sizeof(env));
4019 env.may_be_abstract = true;
4020 env.must_be_abstract = true;
4022 construct_type_t *construct_type = parse_inner_declarator(&env);
4024 type_t *result = construct_declarator_type(construct_type, base_type);
4025 if (construct_type != NULL) {
4026 obstack_free(&temp_obst, construct_type);
4028 result = handle_type_attributes(env.attributes, result);
4034 * Check if the declaration of main is suspicious. main should be a
4035 * function with external linkage, returning int, taking either zero
4036 * arguments, two, or three arguments of appropriate types, ie.
4038 * int main([ int argc, char **argv [, char **env ] ]).
4040 * @param decl the declaration to check
4041 * @param type the function type of the declaration
4043 static void check_main(const entity_t *entity)
4045 const source_position_t *pos = &entity->base.source_position;
4046 if (entity->kind != ENTITY_FUNCTION) {
4047 warningf(pos, "'main' is not a function");
4051 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4052 warningf(pos, "'main' is normally a non-static function");
4055 type_t *type = skip_typeref(entity->declaration.type);
4056 assert(is_type_function(type));
4058 function_type_t *func_type = &type->function;
4059 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4060 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4061 func_type->return_type);
4063 const function_parameter_t *parm = func_type->parameters;
4065 type_t *const first_type = parm->type;
4066 if (!types_compatible(skip_typeref(first_type), type_int)) {
4068 "first argument of 'main' should be 'int', but is '%T'",
4073 type_t *const second_type = parm->type;
4074 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4075 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4079 type_t *const third_type = parm->type;
4080 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4081 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4085 goto warn_arg_count;
4089 warningf(pos, "'main' takes only zero, two or three arguments");
4095 * Check if a symbol is the equal to "main".
4097 static bool is_sym_main(const symbol_t *const sym)
4099 return strcmp(sym->string, "main") == 0;
4102 static void error_redefined_as_different_kind(const source_position_t *pos,
4103 const entity_t *old, entity_kind_t new_kind)
4105 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4106 get_entity_kind_name(old->kind), old->base.symbol,
4107 get_entity_kind_name(new_kind), &old->base.source_position);
4110 static bool is_entity_valid(entity_t *const ent)
4112 if (is_declaration(ent)) {
4113 return is_type_valid(skip_typeref(ent->declaration.type));
4114 } else if (ent->kind == ENTITY_TYPEDEF) {
4115 return is_type_valid(skip_typeref(ent->typedefe.type));
4120 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4122 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4123 if (attributes_equal(tattr, attr))
4130 * test wether new_list contains any attributes not included in old_list
4132 static bool has_new_attributes(const attribute_t *old_list,
4133 const attribute_t *new_list)
4135 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4136 if (!contains_attribute(old_list, attr))
4143 * Merge in attributes from an attribute list (probably from a previous
4144 * declaration with the same name). Warning: destroys the old structure
4145 * of the attribute list - don't reuse attributes after this call.
4147 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4150 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4152 if (contains_attribute(decl->attributes, attr))
4155 /* move attribute to new declarations attributes list */
4156 attr->next = decl->attributes;
4157 decl->attributes = attr;
4162 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4163 * for various problems that occur for multiple definitions
4165 entity_t *record_entity(entity_t *entity, const bool is_definition)
4167 const symbol_t *const symbol = entity->base.symbol;
4168 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4169 const source_position_t *pos = &entity->base.source_position;
4171 /* can happen in error cases */
4175 entity_t *const previous_entity = get_entity(symbol, namespc);
4176 /* pushing the same entity twice will break the stack structure */
4177 assert(previous_entity != entity);
4179 if (entity->kind == ENTITY_FUNCTION) {
4180 type_t *const orig_type = entity->declaration.type;
4181 type_t *const type = skip_typeref(orig_type);
4183 assert(is_type_function(type));
4184 if (type->function.unspecified_parameters &&
4185 warning.strict_prototypes &&
4186 previous_entity == NULL) {
4187 warningf(pos, "function declaration '%#T' is not a prototype",
4191 if (warning.main && current_scope == file_scope
4192 && is_sym_main(symbol)) {
4197 if (is_declaration(entity) &&
4198 warning.nested_externs &&
4199 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4200 current_scope != file_scope) {
4201 warningf(pos, "nested extern declaration of '%#T'",
4202 entity->declaration.type, symbol);
4205 if (previous_entity != NULL) {
4206 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4207 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4208 assert(previous_entity->kind == ENTITY_PARAMETER);
4210 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4211 entity->declaration.type, symbol,
4212 previous_entity->declaration.type, symbol,
4213 &previous_entity->base.source_position);
4217 if (previous_entity->base.parent_scope == current_scope) {
4218 if (previous_entity->kind != entity->kind) {
4219 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4220 error_redefined_as_different_kind(pos, previous_entity,
4225 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4226 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4227 symbol, &previous_entity->base.source_position);
4230 if (previous_entity->kind == ENTITY_TYPEDEF) {
4231 /* TODO: C++ allows this for exactly the same type */
4232 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4233 symbol, &previous_entity->base.source_position);
4237 /* at this point we should have only VARIABLES or FUNCTIONS */
4238 assert(is_declaration(previous_entity) && is_declaration(entity));
4240 declaration_t *const prev_decl = &previous_entity->declaration;
4241 declaration_t *const decl = &entity->declaration;
4243 /* can happen for K&R style declarations */
4244 if (prev_decl->type == NULL &&
4245 previous_entity->kind == ENTITY_PARAMETER &&
4246 entity->kind == ENTITY_PARAMETER) {
4247 prev_decl->type = decl->type;
4248 prev_decl->storage_class = decl->storage_class;
4249 prev_decl->declared_storage_class = decl->declared_storage_class;
4250 prev_decl->modifiers = decl->modifiers;
4251 return previous_entity;
4254 type_t *const orig_type = decl->type;
4255 assert(orig_type != NULL);
4256 type_t *const type = skip_typeref(orig_type);
4257 type_t *const prev_type = skip_typeref(prev_decl->type);
4259 if (!types_compatible(type, prev_type)) {
4261 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4262 orig_type, symbol, prev_decl->type, symbol,
4263 &previous_entity->base.source_position);
4265 unsigned old_storage_class = prev_decl->storage_class;
4267 if (warning.redundant_decls &&
4270 !(prev_decl->modifiers & DM_USED) &&
4271 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4272 warningf(&previous_entity->base.source_position,
4273 "unnecessary static forward declaration for '%#T'",
4274 prev_decl->type, symbol);
4277 storage_class_t new_storage_class = decl->storage_class;
4279 /* pretend no storage class means extern for function
4280 * declarations (except if the previous declaration is neither
4281 * none nor extern) */
4282 if (entity->kind == ENTITY_FUNCTION) {
4283 /* the previous declaration could have unspecified parameters or
4284 * be a typedef, so use the new type */
4285 if (prev_type->function.unspecified_parameters || is_definition)
4286 prev_decl->type = type;
4288 switch (old_storage_class) {
4289 case STORAGE_CLASS_NONE:
4290 old_storage_class = STORAGE_CLASS_EXTERN;
4293 case STORAGE_CLASS_EXTERN:
4294 if (is_definition) {
4295 if (warning.missing_prototypes &&
4296 prev_type->function.unspecified_parameters &&
4297 !is_sym_main(symbol)) {
4298 warningf(pos, "no previous prototype for '%#T'",
4301 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4302 new_storage_class = STORAGE_CLASS_EXTERN;
4309 } else if (is_type_incomplete(prev_type)) {
4310 prev_decl->type = type;
4313 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4314 new_storage_class == STORAGE_CLASS_EXTERN) {
4316 warn_redundant_declaration: ;
4318 = has_new_attributes(prev_decl->attributes,
4320 if (has_new_attrs) {
4321 merge_in_attributes(decl, prev_decl->attributes);
4322 } else if (!is_definition &&
4323 warning.redundant_decls &&
4324 is_type_valid(prev_type) &&
4325 strcmp(previous_entity->base.source_position.input_name,
4326 "<builtin>") != 0) {
4328 "redundant declaration for '%Y' (declared %P)",
4329 symbol, &previous_entity->base.source_position);
4331 } else if (current_function == NULL) {
4332 if (old_storage_class != STORAGE_CLASS_STATIC &&
4333 new_storage_class == STORAGE_CLASS_STATIC) {
4335 "static declaration of '%Y' follows non-static declaration (declared %P)",
4336 symbol, &previous_entity->base.source_position);
4337 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4338 prev_decl->storage_class = STORAGE_CLASS_NONE;
4339 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4341 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4343 goto error_redeclaration;
4344 goto warn_redundant_declaration;
4346 } else if (is_type_valid(prev_type)) {
4347 if (old_storage_class == new_storage_class) {
4348 error_redeclaration:
4349 errorf(pos, "redeclaration of '%Y' (declared %P)",
4350 symbol, &previous_entity->base.source_position);
4353 "redeclaration of '%Y' with different linkage (declared %P)",
4354 symbol, &previous_entity->base.source_position);
4359 prev_decl->modifiers |= decl->modifiers;
4360 if (entity->kind == ENTITY_FUNCTION) {
4361 previous_entity->function.is_inline |= entity->function.is_inline;
4363 return previous_entity;
4366 if (warning.shadow) {
4367 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4368 get_entity_kind_name(entity->kind), symbol,
4369 get_entity_kind_name(previous_entity->kind),
4370 &previous_entity->base.source_position);
4374 if (entity->kind == ENTITY_FUNCTION) {
4375 if (is_definition &&
4376 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4377 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4378 warningf(pos, "no previous prototype for '%#T'",
4379 entity->declaration.type, symbol);
4380 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4381 warningf(pos, "no previous declaration for '%#T'",
4382 entity->declaration.type, symbol);
4385 } else if (warning.missing_declarations &&
4386 entity->kind == ENTITY_VARIABLE &&
4387 current_scope == file_scope) {
4388 declaration_t *declaration = &entity->declaration;
4389 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4390 warningf(pos, "no previous declaration for '%#T'",
4391 declaration->type, symbol);
4396 assert(entity->base.parent_scope == NULL);
4397 assert(current_scope != NULL);
4399 entity->base.parent_scope = current_scope;
4400 entity->base.namespc = NAMESPACE_NORMAL;
4401 environment_push(entity);
4402 append_entity(current_scope, entity);
4407 static void parser_error_multiple_definition(entity_t *entity,
4408 const source_position_t *source_position)
4410 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4411 entity->base.symbol, &entity->base.source_position);
4414 static bool is_declaration_specifier(const token_t *token,
4415 bool only_specifiers_qualifiers)
4417 switch (token->type) {
4422 return is_typedef_symbol(token->symbol);
4424 case T___extension__:
4426 return !only_specifiers_qualifiers;
4433 static void parse_init_declarator_rest(entity_t *entity)
4435 assert(is_declaration(entity));
4436 declaration_t *const declaration = &entity->declaration;
4440 type_t *orig_type = declaration->type;
4441 type_t *type = skip_typeref(orig_type);
4443 if (entity->kind == ENTITY_VARIABLE
4444 && entity->variable.initializer != NULL) {
4445 parser_error_multiple_definition(entity, HERE);
4448 bool must_be_constant = false;
4449 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4450 entity->base.parent_scope == file_scope) {
4451 must_be_constant = true;
4454 if (is_type_function(type)) {
4455 errorf(&entity->base.source_position,
4456 "function '%#T' is initialized like a variable",
4457 orig_type, entity->base.symbol);
4458 orig_type = type_error_type;
4461 parse_initializer_env_t env;
4462 env.type = orig_type;
4463 env.must_be_constant = must_be_constant;
4464 env.entity = entity;
4465 current_init_decl = entity;
4467 initializer_t *initializer = parse_initializer(&env);
4468 current_init_decl = NULL;
4470 if (entity->kind == ENTITY_VARIABLE) {
4471 /* §6.7.5:22 array initializers for arrays with unknown size
4472 * determine the array type size */
4473 declaration->type = env.type;
4474 entity->variable.initializer = initializer;
4478 /* parse rest of a declaration without any declarator */
4479 static void parse_anonymous_declaration_rest(
4480 const declaration_specifiers_t *specifiers)
4483 anonymous_entity = NULL;
4485 if (warning.other) {
4486 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4487 specifiers->thread_local) {
4488 warningf(&specifiers->source_position,
4489 "useless storage class in empty declaration");
4492 type_t *type = specifiers->type;
4493 switch (type->kind) {
4494 case TYPE_COMPOUND_STRUCT:
4495 case TYPE_COMPOUND_UNION: {
4496 if (type->compound.compound->base.symbol == NULL) {
4497 warningf(&specifiers->source_position,
4498 "unnamed struct/union that defines no instances");
4507 warningf(&specifiers->source_position, "empty declaration");
4513 static void check_variable_type_complete(entity_t *ent)
4515 if (ent->kind != ENTITY_VARIABLE)
4518 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4519 * type for the object shall be complete [...] */
4520 declaration_t *decl = &ent->declaration;
4521 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4522 decl->storage_class == STORAGE_CLASS_STATIC)
4525 type_t *const orig_type = decl->type;
4526 type_t *const type = skip_typeref(orig_type);
4527 if (!is_type_incomplete(type))
4530 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4531 * are given length one. */
4532 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4533 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4537 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4538 orig_type, ent->base.symbol);
4542 static void parse_declaration_rest(entity_t *ndeclaration,
4543 const declaration_specifiers_t *specifiers,
4544 parsed_declaration_func finished_declaration,
4545 declarator_flags_t flags)
4547 add_anchor_token(';');
4548 add_anchor_token(',');
4550 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4552 if (token.type == '=') {
4553 parse_init_declarator_rest(entity);
4554 } else if (entity->kind == ENTITY_VARIABLE) {
4555 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4556 * [...] where the extern specifier is explicitly used. */
4557 declaration_t *decl = &entity->declaration;
4558 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4559 type_t *type = decl->type;
4560 if (is_type_reference(skip_typeref(type))) {
4561 errorf(&entity->base.source_position,
4562 "reference '%#T' must be initialized",
4563 type, entity->base.symbol);
4568 check_variable_type_complete(entity);
4573 add_anchor_token('=');
4574 ndeclaration = parse_declarator(specifiers, flags);
4575 rem_anchor_token('=');
4577 expect(';', end_error);
4580 anonymous_entity = NULL;
4581 rem_anchor_token(';');
4582 rem_anchor_token(',');
4585 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4587 symbol_t *symbol = entity->base.symbol;
4588 if (symbol == NULL) {
4589 errorf(HERE, "anonymous declaration not valid as function parameter");
4593 assert(entity->base.namespc == NAMESPACE_NORMAL);
4594 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4595 if (previous_entity == NULL
4596 || previous_entity->base.parent_scope != current_scope) {
4597 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4602 if (is_definition) {
4603 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4606 return record_entity(entity, false);
4609 static void parse_declaration(parsed_declaration_func finished_declaration,
4610 declarator_flags_t flags)
4612 declaration_specifiers_t specifiers;
4613 memset(&specifiers, 0, sizeof(specifiers));
4615 add_anchor_token(';');
4616 parse_declaration_specifiers(&specifiers);
4617 rem_anchor_token(';');
4619 if (token.type == ';') {
4620 parse_anonymous_declaration_rest(&specifiers);
4622 entity_t *entity = parse_declarator(&specifiers, flags);
4623 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4628 static type_t *get_default_promoted_type(type_t *orig_type)
4630 type_t *result = orig_type;
4632 type_t *type = skip_typeref(orig_type);
4633 if (is_type_integer(type)) {
4634 result = promote_integer(type);
4635 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4636 result = type_double;
4642 static void parse_kr_declaration_list(entity_t *entity)
4644 if (entity->kind != ENTITY_FUNCTION)
4647 type_t *type = skip_typeref(entity->declaration.type);
4648 assert(is_type_function(type));
4649 if (!type->function.kr_style_parameters)
4652 add_anchor_token('{');
4654 /* push function parameters */
4655 size_t const top = environment_top();
4656 scope_t *old_scope = scope_push(&entity->function.parameters);
4658 entity_t *parameter = entity->function.parameters.entities;
4659 for ( ; parameter != NULL; parameter = parameter->base.next) {
4660 assert(parameter->base.parent_scope == NULL);
4661 parameter->base.parent_scope = current_scope;
4662 environment_push(parameter);
4665 /* parse declaration list */
4667 switch (token.type) {
4669 case T___extension__:
4670 /* This covers symbols, which are no type, too, and results in
4671 * better error messages. The typical cases are misspelled type
4672 * names and missing includes. */
4674 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4682 /* pop function parameters */
4683 assert(current_scope == &entity->function.parameters);
4684 scope_pop(old_scope);
4685 environment_pop_to(top);
4687 /* update function type */
4688 type_t *new_type = duplicate_type(type);
4690 function_parameter_t *parameters = NULL;
4691 function_parameter_t **anchor = ¶meters;
4693 /* did we have an earlier prototype? */
4694 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4695 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4698 function_parameter_t *proto_parameter = NULL;
4699 if (proto_type != NULL) {
4700 type_t *proto_type_type = proto_type->declaration.type;
4701 proto_parameter = proto_type_type->function.parameters;
4702 /* If a K&R function definition has a variadic prototype earlier, then
4703 * make the function definition variadic, too. This should conform to
4704 * §6.7.5.3:15 and §6.9.1:8. */
4705 new_type->function.variadic = proto_type_type->function.variadic;
4707 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4709 new_type->function.unspecified_parameters = true;
4712 bool need_incompatible_warning = false;
4713 parameter = entity->function.parameters.entities;
4714 for (; parameter != NULL; parameter = parameter->base.next,
4716 proto_parameter == NULL ? NULL : proto_parameter->next) {
4717 if (parameter->kind != ENTITY_PARAMETER)
4720 type_t *parameter_type = parameter->declaration.type;
4721 if (parameter_type == NULL) {
4723 errorf(HERE, "no type specified for function parameter '%Y'",
4724 parameter->base.symbol);
4725 parameter_type = type_error_type;
4727 if (warning.implicit_int) {
4728 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4729 parameter->base.symbol);
4731 parameter_type = type_int;
4733 parameter->declaration.type = parameter_type;
4736 semantic_parameter_incomplete(parameter);
4738 /* we need the default promoted types for the function type */
4739 type_t *not_promoted = parameter_type;
4740 parameter_type = get_default_promoted_type(parameter_type);
4742 /* gcc special: if the type of the prototype matches the unpromoted
4743 * type don't promote */
4744 if (!strict_mode && proto_parameter != NULL) {
4745 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4746 type_t *promo_skip = skip_typeref(parameter_type);
4747 type_t *param_skip = skip_typeref(not_promoted);
4748 if (!types_compatible(proto_p_type, promo_skip)
4749 && types_compatible(proto_p_type, param_skip)) {
4751 need_incompatible_warning = true;
4752 parameter_type = not_promoted;
4755 function_parameter_t *const parameter
4756 = allocate_parameter(parameter_type);
4758 *anchor = parameter;
4759 anchor = ¶meter->next;
4762 new_type->function.parameters = parameters;
4763 new_type = identify_new_type(new_type);
4765 if (warning.other && need_incompatible_warning) {
4766 type_t *proto_type_type = proto_type->declaration.type;
4768 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4769 proto_type_type, proto_type->base.symbol,
4770 new_type, entity->base.symbol,
4771 &proto_type->base.source_position);
4774 entity->declaration.type = new_type;
4776 rem_anchor_token('{');
4779 static bool first_err = true;
4782 * When called with first_err set, prints the name of the current function,
4785 static void print_in_function(void)
4789 diagnosticf("%s: In function '%Y':\n",
4790 current_function->base.base.source_position.input_name,
4791 current_function->base.base.symbol);
4796 * Check if all labels are defined in the current function.
4797 * Check if all labels are used in the current function.
4799 static void check_labels(void)
4801 for (const goto_statement_t *goto_statement = goto_first;
4802 goto_statement != NULL;
4803 goto_statement = goto_statement->next) {
4804 /* skip computed gotos */
4805 if (goto_statement->expression != NULL)
4808 label_t *label = goto_statement->label;
4811 if (label->base.source_position.input_name == NULL) {
4812 print_in_function();
4813 errorf(&goto_statement->base.source_position,
4814 "label '%Y' used but not defined", label->base.symbol);
4818 if (warning.unused_label) {
4819 for (const label_statement_t *label_statement = label_first;
4820 label_statement != NULL;
4821 label_statement = label_statement->next) {
4822 label_t *label = label_statement->label;
4824 if (! label->used) {
4825 print_in_function();
4826 warningf(&label_statement->base.source_position,
4827 "label '%Y' defined but not used", label->base.symbol);
4833 static void warn_unused_entity(entity_t *entity, entity_t *last)
4835 entity_t const *const end = last != NULL ? last->base.next : NULL;
4836 for (; entity != end; entity = entity->base.next) {
4837 if (!is_declaration(entity))
4840 declaration_t *declaration = &entity->declaration;
4841 if (declaration->implicit)
4844 if (!declaration->used) {
4845 print_in_function();
4846 const char *what = get_entity_kind_name(entity->kind);
4847 warningf(&entity->base.source_position, "%s '%Y' is unused",
4848 what, entity->base.symbol);
4849 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4850 print_in_function();
4851 const char *what = get_entity_kind_name(entity->kind);
4852 warningf(&entity->base.source_position, "%s '%Y' is never read",
4853 what, entity->base.symbol);
4858 static void check_unused_variables(statement_t *const stmt, void *const env)
4862 switch (stmt->kind) {
4863 case STATEMENT_DECLARATION: {
4864 declaration_statement_t const *const decls = &stmt->declaration;
4865 warn_unused_entity(decls->declarations_begin,
4866 decls->declarations_end);
4871 warn_unused_entity(stmt->fors.scope.entities, NULL);
4880 * Check declarations of current_function for unused entities.
4882 static void check_declarations(void)
4884 if (warning.unused_parameter) {
4885 const scope_t *scope = ¤t_function->parameters;
4887 /* do not issue unused warnings for main */
4888 if (!is_sym_main(current_function->base.base.symbol)) {
4889 warn_unused_entity(scope->entities, NULL);
4892 if (warning.unused_variable) {
4893 walk_statements(current_function->statement, check_unused_variables,
4898 static int determine_truth(expression_t const* const cond)
4901 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4902 fold_constant_to_bool(cond) ? 1 :
4906 static void check_reachable(statement_t *);
4907 static bool reaches_end;
4909 static bool expression_returns(expression_t const *const expr)
4911 switch (expr->kind) {
4913 expression_t const *const func = expr->call.function;
4914 if (func->kind == EXPR_REFERENCE) {
4915 entity_t *entity = func->reference.entity;
4916 if (entity->kind == ENTITY_FUNCTION
4917 && entity->declaration.modifiers & DM_NORETURN)
4921 if (!expression_returns(func))
4924 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4925 if (!expression_returns(arg->expression))
4932 case EXPR_REFERENCE:
4933 case EXPR_REFERENCE_ENUM_VALUE:
4935 case EXPR_STRING_LITERAL:
4936 case EXPR_WIDE_STRING_LITERAL:
4937 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4938 case EXPR_LABEL_ADDRESS:
4939 case EXPR_CLASSIFY_TYPE:
4940 case EXPR_SIZEOF: // TODO handle obscure VLA case
4943 case EXPR_BUILTIN_CONSTANT_P:
4944 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4949 case EXPR_STATEMENT: {
4950 bool old_reaches_end = reaches_end;
4951 reaches_end = false;
4952 check_reachable(expr->statement.statement);
4953 bool returns = reaches_end;
4954 reaches_end = old_reaches_end;
4958 case EXPR_CONDITIONAL:
4959 // TODO handle constant expression
4961 if (!expression_returns(expr->conditional.condition))
4964 if (expr->conditional.true_expression != NULL
4965 && expression_returns(expr->conditional.true_expression))
4968 return expression_returns(expr->conditional.false_expression);
4971 return expression_returns(expr->select.compound);
4973 case EXPR_ARRAY_ACCESS:
4975 expression_returns(expr->array_access.array_ref) &&
4976 expression_returns(expr->array_access.index);
4979 return expression_returns(expr->va_starte.ap);
4982 return expression_returns(expr->va_arge.ap);
4985 return expression_returns(expr->va_copye.src);
4987 EXPR_UNARY_CASES_MANDATORY
4988 return expression_returns(expr->unary.value);
4990 case EXPR_UNARY_THROW:
4994 // TODO handle constant lhs of && and ||
4996 expression_returns(expr->binary.left) &&
4997 expression_returns(expr->binary.right);
5003 panic("unhandled expression");
5006 static bool initializer_returns(initializer_t const *const init)
5008 switch (init->kind) {
5009 case INITIALIZER_VALUE:
5010 return expression_returns(init->value.value);
5012 case INITIALIZER_LIST: {
5013 initializer_t * const* i = init->list.initializers;
5014 initializer_t * const* const end = i + init->list.len;
5015 bool returns = true;
5016 for (; i != end; ++i) {
5017 if (!initializer_returns(*i))
5023 case INITIALIZER_STRING:
5024 case INITIALIZER_WIDE_STRING:
5025 case INITIALIZER_DESIGNATOR: // designators have no payload
5028 panic("unhandled initializer");
5031 static bool noreturn_candidate;
5033 static void check_reachable(statement_t *const stmt)
5035 if (stmt->base.reachable)
5037 if (stmt->kind != STATEMENT_DO_WHILE)
5038 stmt->base.reachable = true;
5040 statement_t *last = stmt;
5042 switch (stmt->kind) {
5043 case STATEMENT_INVALID:
5044 case STATEMENT_EMPTY:
5046 next = stmt->base.next;
5049 case STATEMENT_DECLARATION: {
5050 declaration_statement_t const *const decl = &stmt->declaration;
5051 entity_t const * ent = decl->declarations_begin;
5052 entity_t const *const last = decl->declarations_end;
5054 for (;; ent = ent->base.next) {
5055 if (ent->kind == ENTITY_VARIABLE &&
5056 ent->variable.initializer != NULL &&
5057 !initializer_returns(ent->variable.initializer)) {
5064 next = stmt->base.next;
5068 case STATEMENT_COMPOUND:
5069 next = stmt->compound.statements;
5071 next = stmt->base.next;
5074 case STATEMENT_RETURN: {
5075 expression_t const *const val = stmt->returns.value;
5076 if (val == NULL || expression_returns(val))
5077 noreturn_candidate = false;
5081 case STATEMENT_IF: {
5082 if_statement_t const *const ifs = &stmt->ifs;
5083 expression_t const *const cond = ifs->condition;
5085 if (!expression_returns(cond))
5088 int const val = determine_truth(cond);
5091 check_reachable(ifs->true_statement);
5096 if (ifs->false_statement != NULL) {
5097 check_reachable(ifs->false_statement);
5101 next = stmt->base.next;
5105 case STATEMENT_SWITCH: {
5106 switch_statement_t const *const switchs = &stmt->switchs;
5107 expression_t const *const expr = switchs->expression;
5109 if (!expression_returns(expr))
5112 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
5113 long const val = fold_constant_to_int(expr);
5114 case_label_statement_t * defaults = NULL;
5115 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5116 if (i->expression == NULL) {
5121 if (i->first_case <= val && val <= i->last_case) {
5122 check_reachable((statement_t*)i);
5127 if (defaults != NULL) {
5128 check_reachable((statement_t*)defaults);
5132 bool has_default = false;
5133 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5134 if (i->expression == NULL)
5137 check_reachable((statement_t*)i);
5144 next = stmt->base.next;
5148 case STATEMENT_EXPRESSION: {
5149 /* Check for noreturn function call */
5150 expression_t const *const expr = stmt->expression.expression;
5151 if (!expression_returns(expr))
5154 next = stmt->base.next;
5158 case STATEMENT_CONTINUE:
5159 for (statement_t *parent = stmt;;) {
5160 parent = parent->base.parent;
5161 if (parent == NULL) /* continue not within loop */
5165 switch (parent->kind) {
5166 case STATEMENT_WHILE: goto continue_while;
5167 case STATEMENT_DO_WHILE: goto continue_do_while;
5168 case STATEMENT_FOR: goto continue_for;
5174 case STATEMENT_BREAK:
5175 for (statement_t *parent = stmt;;) {
5176 parent = parent->base.parent;
5177 if (parent == NULL) /* break not within loop/switch */
5180 switch (parent->kind) {
5181 case STATEMENT_SWITCH:
5182 case STATEMENT_WHILE:
5183 case STATEMENT_DO_WHILE:
5186 next = parent->base.next;
5187 goto found_break_parent;
5195 case STATEMENT_GOTO:
5196 if (stmt->gotos.expression) {
5197 if (!expression_returns(stmt->gotos.expression))
5200 statement_t *parent = stmt->base.parent;
5201 if (parent == NULL) /* top level goto */
5205 next = stmt->gotos.label->statement;
5206 if (next == NULL) /* missing label */
5211 case STATEMENT_LABEL:
5212 next = stmt->label.statement;
5215 case STATEMENT_CASE_LABEL:
5216 next = stmt->case_label.statement;
5219 case STATEMENT_WHILE: {
5220 while_statement_t const *const whiles = &stmt->whiles;
5221 expression_t const *const cond = whiles->condition;
5223 if (!expression_returns(cond))
5226 int const val = determine_truth(cond);
5229 check_reachable(whiles->body);
5234 next = stmt->base.next;
5238 case STATEMENT_DO_WHILE:
5239 next = stmt->do_while.body;
5242 case STATEMENT_FOR: {
5243 for_statement_t *const fors = &stmt->fors;
5245 if (fors->condition_reachable)
5247 fors->condition_reachable = true;
5249 expression_t const *const cond = fors->condition;
5254 } else if (expression_returns(cond)) {
5255 val = determine_truth(cond);
5261 check_reachable(fors->body);
5266 next = stmt->base.next;
5270 case STATEMENT_MS_TRY: {
5271 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5272 check_reachable(ms_try->try_statement);
5273 next = ms_try->final_statement;
5277 case STATEMENT_LEAVE: {
5278 statement_t *parent = stmt;
5280 parent = parent->base.parent;
5281 if (parent == NULL) /* __leave not within __try */
5284 if (parent->kind == STATEMENT_MS_TRY) {
5286 next = parent->ms_try.final_statement;
5294 panic("invalid statement kind");
5297 while (next == NULL) {
5298 next = last->base.parent;
5300 noreturn_candidate = false;
5302 type_t *const type = skip_typeref(current_function->base.type);
5303 assert(is_type_function(type));
5304 type_t *const ret = skip_typeref(type->function.return_type);
5305 if (warning.return_type &&
5306 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5307 is_type_valid(ret) &&
5308 !is_sym_main(current_function->base.base.symbol)) {
5309 warningf(&stmt->base.source_position,
5310 "control reaches end of non-void function");
5315 switch (next->kind) {
5316 case STATEMENT_INVALID:
5317 case STATEMENT_EMPTY:
5318 case STATEMENT_DECLARATION:
5319 case STATEMENT_EXPRESSION:
5321 case STATEMENT_RETURN:
5322 case STATEMENT_CONTINUE:
5323 case STATEMENT_BREAK:
5324 case STATEMENT_GOTO:
5325 case STATEMENT_LEAVE:
5326 panic("invalid control flow in function");
5328 case STATEMENT_COMPOUND:
5329 if (next->compound.stmt_expr) {
5335 case STATEMENT_SWITCH:
5336 case STATEMENT_LABEL:
5337 case STATEMENT_CASE_LABEL:
5339 next = next->base.next;
5342 case STATEMENT_WHILE: {
5344 if (next->base.reachable)
5346 next->base.reachable = true;
5348 while_statement_t const *const whiles = &next->whiles;
5349 expression_t const *const cond = whiles->condition;
5351 if (!expression_returns(cond))
5354 int const val = determine_truth(cond);
5357 check_reachable(whiles->body);
5363 next = next->base.next;
5367 case STATEMENT_DO_WHILE: {
5369 if (next->base.reachable)
5371 next->base.reachable = true;
5373 do_while_statement_t const *const dw = &next->do_while;
5374 expression_t const *const cond = dw->condition;
5376 if (!expression_returns(cond))
5379 int const val = determine_truth(cond);
5382 check_reachable(dw->body);
5388 next = next->base.next;
5392 case STATEMENT_FOR: {
5394 for_statement_t *const fors = &next->fors;
5396 fors->step_reachable = true;
5398 if (fors->condition_reachable)
5400 fors->condition_reachable = true;
5402 expression_t const *const cond = fors->condition;
5407 } else if (expression_returns(cond)) {
5408 val = determine_truth(cond);
5414 check_reachable(fors->body);
5420 next = next->base.next;
5424 case STATEMENT_MS_TRY:
5426 next = next->ms_try.final_statement;
5431 check_reachable(next);
5434 static void check_unreachable(statement_t* const stmt, void *const env)
5438 switch (stmt->kind) {
5439 case STATEMENT_DO_WHILE:
5440 if (!stmt->base.reachable) {
5441 expression_t const *const cond = stmt->do_while.condition;
5442 if (determine_truth(cond) >= 0) {
5443 warningf(&cond->base.source_position,
5444 "condition of do-while-loop is unreachable");
5449 case STATEMENT_FOR: {
5450 for_statement_t const* const fors = &stmt->fors;
5452 // if init and step are unreachable, cond is unreachable, too
5453 if (!stmt->base.reachable && !fors->step_reachable) {
5454 warningf(&stmt->base.source_position, "statement is unreachable");
5456 if (!stmt->base.reachable && fors->initialisation != NULL) {
5457 warningf(&fors->initialisation->base.source_position,
5458 "initialisation of for-statement is unreachable");
5461 if (!fors->condition_reachable && fors->condition != NULL) {
5462 warningf(&fors->condition->base.source_position,
5463 "condition of for-statement is unreachable");
5466 if (!fors->step_reachable && fors->step != NULL) {
5467 warningf(&fors->step->base.source_position,
5468 "step of for-statement is unreachable");
5474 case STATEMENT_COMPOUND:
5475 if (stmt->compound.statements != NULL)
5477 goto warn_unreachable;
5479 case STATEMENT_DECLARATION: {
5480 /* Only warn if there is at least one declarator with an initializer.
5481 * This typically occurs in switch statements. */
5482 declaration_statement_t const *const decl = &stmt->declaration;
5483 entity_t const * ent = decl->declarations_begin;
5484 entity_t const *const last = decl->declarations_end;
5486 for (;; ent = ent->base.next) {
5487 if (ent->kind == ENTITY_VARIABLE &&
5488 ent->variable.initializer != NULL) {
5489 goto warn_unreachable;
5499 if (!stmt->base.reachable)
5500 warningf(&stmt->base.source_position, "statement is unreachable");
5505 static void parse_external_declaration(void)
5507 /* function-definitions and declarations both start with declaration
5509 declaration_specifiers_t specifiers;
5510 memset(&specifiers, 0, sizeof(specifiers));
5512 add_anchor_token(';');
5513 parse_declaration_specifiers(&specifiers);
5514 rem_anchor_token(';');
5516 /* must be a declaration */
5517 if (token.type == ';') {
5518 parse_anonymous_declaration_rest(&specifiers);
5522 add_anchor_token(',');
5523 add_anchor_token('=');
5524 add_anchor_token(';');
5525 add_anchor_token('{');
5527 /* declarator is common to both function-definitions and declarations */
5528 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5530 rem_anchor_token('{');
5531 rem_anchor_token(';');
5532 rem_anchor_token('=');
5533 rem_anchor_token(',');
5535 /* must be a declaration */
5536 switch (token.type) {
5540 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5545 /* must be a function definition */
5546 parse_kr_declaration_list(ndeclaration);
5548 if (token.type != '{') {
5549 parse_error_expected("while parsing function definition", '{', NULL);
5550 eat_until_matching_token(';');
5554 assert(is_declaration(ndeclaration));
5555 type_t *const orig_type = ndeclaration->declaration.type;
5556 type_t * type = skip_typeref(orig_type);
5558 if (!is_type_function(type)) {
5559 if (is_type_valid(type)) {
5560 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5561 type, ndeclaration->base.symbol);
5565 } else if (is_typeref(orig_type)) {
5567 errorf(&ndeclaration->base.source_position,
5568 "type of function definition '%#T' is a typedef",
5569 orig_type, ndeclaration->base.symbol);
5572 if (warning.aggregate_return &&
5573 is_type_compound(skip_typeref(type->function.return_type))) {
5574 warningf(HERE, "function '%Y' returns an aggregate",
5575 ndeclaration->base.symbol);
5577 if (warning.traditional && !type->function.unspecified_parameters) {
5578 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5579 ndeclaration->base.symbol);
5581 if (warning.old_style_definition && type->function.unspecified_parameters) {
5582 warningf(HERE, "old-style function definition '%Y'",
5583 ndeclaration->base.symbol);
5586 /* §6.7.5.3:14 a function definition with () means no
5587 * parameters (and not unspecified parameters) */
5588 if (type->function.unspecified_parameters &&
5589 type->function.parameters == NULL) {
5590 type_t *copy = duplicate_type(type);
5591 copy->function.unspecified_parameters = false;
5592 type = identify_new_type(copy);
5594 ndeclaration->declaration.type = type;
5597 entity_t *const entity = record_entity(ndeclaration, true);
5598 assert(entity->kind == ENTITY_FUNCTION);
5599 assert(ndeclaration->kind == ENTITY_FUNCTION);
5601 function_t *function = &entity->function;
5602 if (ndeclaration != entity) {
5603 function->parameters = ndeclaration->function.parameters;
5605 assert(is_declaration(entity));
5606 type = skip_typeref(entity->declaration.type);
5608 /* push function parameters and switch scope */
5609 size_t const top = environment_top();
5610 scope_t *old_scope = scope_push(&function->parameters);
5612 entity_t *parameter = function->parameters.entities;
5613 for (; parameter != NULL; parameter = parameter->base.next) {
5614 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5615 parameter->base.parent_scope = current_scope;
5617 assert(parameter->base.parent_scope == NULL
5618 || parameter->base.parent_scope == current_scope);
5619 parameter->base.parent_scope = current_scope;
5620 if (parameter->base.symbol == NULL) {
5621 errorf(¶meter->base.source_position, "parameter name omitted");
5624 environment_push(parameter);
5627 if (function->statement != NULL) {
5628 parser_error_multiple_definition(entity, HERE);
5631 /* parse function body */
5632 int label_stack_top = label_top();
5633 function_t *old_current_function = current_function;
5634 entity_t *old_current_entity = current_entity;
5635 current_function = function;
5636 current_entity = (entity_t*) function;
5637 current_parent = NULL;
5640 goto_anchor = &goto_first;
5642 label_anchor = &label_first;
5644 statement_t *const body = parse_compound_statement(false);
5645 function->statement = body;
5648 check_declarations();
5649 if (warning.return_type ||
5650 warning.unreachable_code ||
5651 (warning.missing_noreturn
5652 && !(function->base.modifiers & DM_NORETURN))) {
5653 noreturn_candidate = true;
5654 check_reachable(body);
5655 if (warning.unreachable_code)
5656 walk_statements(body, check_unreachable, NULL);
5657 if (warning.missing_noreturn &&
5658 noreturn_candidate &&
5659 !(function->base.modifiers & DM_NORETURN)) {
5660 warningf(&body->base.source_position,
5661 "function '%#T' is candidate for attribute 'noreturn'",
5662 type, entity->base.symbol);
5666 assert(current_parent == NULL);
5667 assert(current_function == function);
5668 assert(current_entity == (entity_t*) function);
5669 current_entity = old_current_entity;
5670 current_function = old_current_function;
5671 label_pop_to(label_stack_top);
5674 assert(current_scope == &function->parameters);
5675 scope_pop(old_scope);
5676 environment_pop_to(top);
5679 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5680 source_position_t *source_position,
5681 const symbol_t *symbol)
5683 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5685 type->bitfield.base_type = base_type;
5686 type->bitfield.size_expression = size;
5689 type_t *skipped_type = skip_typeref(base_type);
5690 if (!is_type_integer(skipped_type)) {
5691 errorf(HERE, "bitfield base type '%T' is not an integer type",
5695 bit_size = get_type_size(base_type) * 8;
5698 if (is_constant_expression(size) == EXPR_CLASS_CONSTANT) {
5699 long v = fold_constant_to_int(size);
5700 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5703 errorf(source_position, "negative width in bit-field '%Y'",
5705 } else if (v == 0 && symbol != NULL) {
5706 errorf(source_position, "zero width for bit-field '%Y'",
5708 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5709 errorf(source_position, "width of '%Y' exceeds its type",
5712 type->bitfield.bit_size = v;
5719 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5721 entity_t *iter = compound->members.entities;
5722 for (; iter != NULL; iter = iter->base.next) {
5723 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5726 if (iter->base.symbol == symbol) {
5728 } else if (iter->base.symbol == NULL) {
5729 /* search in anonymous structs and unions */
5730 type_t *type = skip_typeref(iter->declaration.type);
5731 if (is_type_compound(type)) {
5732 if (find_compound_entry(type->compound.compound, symbol)
5743 static void check_deprecated(const source_position_t *source_position,
5744 const entity_t *entity)
5746 if (!warning.deprecated_declarations)
5748 if (!is_declaration(entity))
5750 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5753 char const *const prefix = get_entity_kind_name(entity->kind);
5754 const char *deprecated_string
5755 = get_deprecated_string(entity->declaration.attributes);
5756 if (deprecated_string != NULL) {
5757 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5758 prefix, entity->base.symbol, &entity->base.source_position,
5761 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5762 entity->base.symbol, &entity->base.source_position);
5767 static expression_t *create_select(const source_position_t *pos,
5769 type_qualifiers_t qualifiers,
5772 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5774 check_deprecated(pos, entry);
5776 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5777 select->select.compound = addr;
5778 select->select.compound_entry = entry;
5780 type_t *entry_type = entry->declaration.type;
5781 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5783 /* we always do the auto-type conversions; the & and sizeof parser contains
5784 * code to revert this! */
5785 select->base.type = automatic_type_conversion(res_type);
5786 if (res_type->kind == TYPE_BITFIELD) {
5787 select->base.type = res_type->bitfield.base_type;
5794 * Find entry with symbol in compound. Search anonymous structs and unions and
5795 * creates implicit select expressions for them.
5796 * Returns the adress for the innermost compound.
5798 static expression_t *find_create_select(const source_position_t *pos,
5800 type_qualifiers_t qualifiers,
5801 compound_t *compound, symbol_t *symbol)
5803 entity_t *iter = compound->members.entities;
5804 for (; iter != NULL; iter = iter->base.next) {
5805 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5808 symbol_t *iter_symbol = iter->base.symbol;
5809 if (iter_symbol == NULL) {
5810 type_t *type = iter->declaration.type;
5811 if (type->kind != TYPE_COMPOUND_STRUCT
5812 && type->kind != TYPE_COMPOUND_UNION)
5815 compound_t *sub_compound = type->compound.compound;
5817 if (find_compound_entry(sub_compound, symbol) == NULL)
5820 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5821 sub_addr->base.source_position = *pos;
5822 sub_addr->select.implicit = true;
5823 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5827 if (iter_symbol == symbol) {
5828 return create_select(pos, addr, qualifiers, iter);
5835 static void parse_compound_declarators(compound_t *compound,
5836 const declaration_specifiers_t *specifiers)
5841 if (token.type == ':') {
5842 source_position_t source_position = *HERE;
5845 type_t *base_type = specifiers->type;
5846 expression_t *size = parse_constant_expression();
5848 type_t *type = make_bitfield_type(base_type, size,
5849 &source_position, NULL);
5851 attribute_t *attributes = parse_attributes(NULL);
5852 attribute_t **anchor = &attributes;
5853 while (*anchor != NULL)
5854 anchor = &(*anchor)->next;
5855 *anchor = specifiers->attributes;
5857 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5858 entity->base.namespc = NAMESPACE_NORMAL;
5859 entity->base.source_position = source_position;
5860 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5861 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5862 entity->declaration.type = type;
5863 entity->declaration.attributes = attributes;
5865 if (attributes != NULL) {
5866 handle_entity_attributes(attributes, entity);
5868 append_entity(&compound->members, entity);
5870 entity = parse_declarator(specifiers,
5871 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5872 if (entity->kind == ENTITY_TYPEDEF) {
5873 errorf(&entity->base.source_position,
5874 "typedef not allowed as compound member");
5876 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5878 /* make sure we don't define a symbol multiple times */
5879 symbol_t *symbol = entity->base.symbol;
5880 if (symbol != NULL) {
5881 entity_t *prev = find_compound_entry(compound, symbol);
5883 errorf(&entity->base.source_position,
5884 "multiple declarations of symbol '%Y' (declared %P)",
5885 symbol, &prev->base.source_position);
5889 if (token.type == ':') {
5890 source_position_t source_position = *HERE;
5892 expression_t *size = parse_constant_expression();
5894 type_t *type = entity->declaration.type;
5895 type_t *bitfield_type = make_bitfield_type(type, size,
5896 &source_position, entity->base.symbol);
5898 attribute_t *attributes = parse_attributes(NULL);
5899 entity->declaration.type = bitfield_type;
5900 handle_entity_attributes(attributes, entity);
5902 type_t *orig_type = entity->declaration.type;
5903 type_t *type = skip_typeref(orig_type);
5904 if (is_type_function(type)) {
5905 errorf(&entity->base.source_position,
5906 "compound member '%Y' must not have function type '%T'",
5907 entity->base.symbol, orig_type);
5908 } else if (is_type_incomplete(type)) {
5909 /* §6.7.2.1:16 flexible array member */
5910 if (!is_type_array(type) ||
5911 token.type != ';' ||
5912 look_ahead(1)->type != '}') {
5913 errorf(&entity->base.source_position,
5914 "compound member '%Y' has incomplete type '%T'",
5915 entity->base.symbol, orig_type);
5920 append_entity(&compound->members, entity);
5923 } while (next_if(','));
5924 expect(';', end_error);
5927 anonymous_entity = NULL;
5930 static void parse_compound_type_entries(compound_t *compound)
5933 add_anchor_token('}');
5935 while (token.type != '}') {
5936 if (token.type == T_EOF) {
5937 errorf(HERE, "EOF while parsing struct");
5940 declaration_specifiers_t specifiers;
5941 memset(&specifiers, 0, sizeof(specifiers));
5942 parse_declaration_specifiers(&specifiers);
5944 parse_compound_declarators(compound, &specifiers);
5946 rem_anchor_token('}');
5950 compound->complete = true;
5953 static type_t *parse_typename(void)
5955 declaration_specifiers_t specifiers;
5956 memset(&specifiers, 0, sizeof(specifiers));
5957 parse_declaration_specifiers(&specifiers);
5958 if (specifiers.storage_class != STORAGE_CLASS_NONE
5959 || specifiers.thread_local) {
5960 /* TODO: improve error message, user does probably not know what a
5961 * storage class is...
5963 errorf(HERE, "typename must not have a storage class");
5966 type_t *result = parse_abstract_declarator(specifiers.type);
5974 typedef expression_t* (*parse_expression_function)(void);
5975 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5977 typedef struct expression_parser_function_t expression_parser_function_t;
5978 struct expression_parser_function_t {
5979 parse_expression_function parser;
5980 precedence_t infix_precedence;
5981 parse_expression_infix_function infix_parser;
5984 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5987 * Prints an error message if an expression was expected but not read
5989 static expression_t *expected_expression_error(void)
5991 /* skip the error message if the error token was read */
5992 if (token.type != T_ERROR) {
5993 errorf(HERE, "expected expression, got token %K", &token);
5997 return create_invalid_expression();
6000 static type_t *get_string_type(void)
6002 return warning.write_strings ? type_const_char_ptr : type_char_ptr;
6005 static type_t *get_wide_string_type(void)
6007 return warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6011 * Parse a string constant.
6013 static expression_t *parse_string_literal(void)
6015 source_position_t begin = token.source_position;
6016 string_t res = token.literal;
6017 bool is_wide = (token.type == T_WIDE_STRING_LITERAL);
6020 while (token.type == T_STRING_LITERAL
6021 || token.type == T_WIDE_STRING_LITERAL) {
6022 warn_string_concat(&token.source_position);
6023 res = concat_strings(&res, &token.literal);
6025 is_wide |= token.type == T_WIDE_STRING_LITERAL;
6028 expression_t *literal;
6030 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6031 literal->base.type = get_wide_string_type();
6033 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
6034 literal->base.type = get_string_type();
6036 literal->base.source_position = begin;
6037 literal->literal.value = res;
6043 * Parse a boolean constant.
6045 static expression_t *parse_boolean_literal(bool value)
6047 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
6048 literal->base.source_position = token.source_position;
6049 literal->base.type = type_bool;
6050 literal->literal.value.begin = value ? "true" : "false";
6051 literal->literal.value.size = value ? 4 : 5;
6057 static void warn_traditional_suffix(void)
6059 if (!warning.traditional)
6061 warningf(&token.source_position, "traditional C rejects the '%Y' suffix",
6065 static void check_integer_suffix(void)
6067 symbol_t *suffix = token.symbol;
6071 bool not_traditional = false;
6072 const char *c = suffix->string;
6073 if (*c == 'l' || *c == 'L') {
6076 not_traditional = true;
6078 if (*c == 'u' || *c == 'U') {
6081 } else if (*c == 'u' || *c == 'U') {
6082 not_traditional = true;
6085 } else if (*c == 'u' || *c == 'U') {
6086 not_traditional = true;
6088 if (*c == 'l' || *c == 'L') {
6096 errorf(&token.source_position,
6097 "invalid suffix '%s' on integer constant", suffix->string);
6098 } else if (not_traditional) {
6099 warn_traditional_suffix();
6103 static type_t *check_floatingpoint_suffix(void)
6105 symbol_t *suffix = token.symbol;
6106 type_t *type = type_double;
6110 bool not_traditional = false;
6111 const char *c = suffix->string;
6112 if (*c == 'f' || *c == 'F') {
6115 } else if (*c == 'l' || *c == 'L') {
6117 type = type_long_double;
6120 errorf(&token.source_position,
6121 "invalid suffix '%s' on floatingpoint constant", suffix->string);
6122 } else if (not_traditional) {
6123 warn_traditional_suffix();
6130 * Parse an integer constant.
6132 static expression_t *parse_number_literal(void)
6134 expression_kind_t kind;
6137 switch (token.type) {
6139 kind = EXPR_LITERAL_INTEGER;
6140 check_integer_suffix();
6143 case T_INTEGER_OCTAL:
6144 kind = EXPR_LITERAL_INTEGER_OCTAL;
6145 check_integer_suffix();
6148 case T_INTEGER_HEXADECIMAL:
6149 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
6150 check_integer_suffix();
6153 case T_FLOATINGPOINT:
6154 kind = EXPR_LITERAL_FLOATINGPOINT;
6155 type = check_floatingpoint_suffix();
6157 case T_FLOATINGPOINT_HEXADECIMAL:
6158 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
6159 type = check_floatingpoint_suffix();
6162 panic("unexpected token type in parse_number_literal");
6165 expression_t *literal = allocate_expression_zero(kind);
6166 literal->base.source_position = token.source_position;
6167 literal->base.type = type;
6168 literal->literal.value = token.literal;
6169 literal->literal.suffix = token.symbol;
6172 /* integer type depends on the size of the number and the size
6173 * representable by the types. The backend/codegeneration has to determine
6176 determine_literal_type(&literal->literal);
6181 * Parse a character constant.
6183 static expression_t *parse_character_constant(void)
6185 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
6186 literal->base.source_position = token.source_position;
6187 literal->base.type = c_mode & _CXX ? type_char : type_int;
6188 literal->literal.value = token.literal;
6190 size_t len = literal->literal.value.size;
6192 if (!GNU_MODE && !(c_mode & _C99)) {
6193 errorf(HERE, "more than 1 character in character constant");
6194 } else if (warning.multichar) {
6195 literal->base.type = type_int;
6196 warningf(HERE, "multi-character character constant");
6205 * Parse a wide character constant.
6207 static expression_t *parse_wide_character_constant(void)
6209 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6210 literal->base.source_position = token.source_position;
6211 literal->base.type = type_int;
6212 literal->literal.value = token.literal;
6214 size_t len = wstrlen(&literal->literal.value);
6216 warningf(HERE, "multi-character character constant");
6223 static entity_t *create_implicit_function(symbol_t *symbol,
6224 const source_position_t *source_position)
6226 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6227 ntype->function.return_type = type_int;
6228 ntype->function.unspecified_parameters = true;
6229 ntype->function.linkage = LINKAGE_C;
6230 type_t *type = identify_new_type(ntype);
6232 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6233 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6234 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6235 entity->declaration.type = type;
6236 entity->declaration.implicit = true;
6237 entity->base.namespc = NAMESPACE_NORMAL;
6238 entity->base.symbol = symbol;
6239 entity->base.source_position = *source_position;
6241 if (current_scope != NULL) {
6242 bool strict_prototypes_old = warning.strict_prototypes;
6243 warning.strict_prototypes = false;
6244 record_entity(entity, false);
6245 warning.strict_prototypes = strict_prototypes_old;
6252 * Performs automatic type cast as described in §6.3.2.1.
6254 * @param orig_type the original type
6256 static type_t *automatic_type_conversion(type_t *orig_type)
6258 type_t *type = skip_typeref(orig_type);
6259 if (is_type_array(type)) {
6260 array_type_t *array_type = &type->array;
6261 type_t *element_type = array_type->element_type;
6262 unsigned qualifiers = array_type->base.qualifiers;
6264 return make_pointer_type(element_type, qualifiers);
6267 if (is_type_function(type)) {
6268 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6275 * reverts the automatic casts of array to pointer types and function
6276 * to function-pointer types as defined §6.3.2.1
6278 type_t *revert_automatic_type_conversion(const expression_t *expression)
6280 switch (expression->kind) {
6281 case EXPR_REFERENCE: {
6282 entity_t *entity = expression->reference.entity;
6283 if (is_declaration(entity)) {
6284 return entity->declaration.type;
6285 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6286 return entity->enum_value.enum_type;
6288 panic("no declaration or enum in reference");
6293 entity_t *entity = expression->select.compound_entry;
6294 assert(is_declaration(entity));
6295 type_t *type = entity->declaration.type;
6296 return get_qualified_type(type,
6297 expression->base.type->base.qualifiers);
6300 case EXPR_UNARY_DEREFERENCE: {
6301 const expression_t *const value = expression->unary.value;
6302 type_t *const type = skip_typeref(value->base.type);
6303 if (!is_type_pointer(type))
6304 return type_error_type;
6305 return type->pointer.points_to;
6308 case EXPR_ARRAY_ACCESS: {
6309 const expression_t *array_ref = expression->array_access.array_ref;
6310 type_t *type_left = skip_typeref(array_ref->base.type);
6311 if (!is_type_pointer(type_left))
6312 return type_error_type;
6313 return type_left->pointer.points_to;
6316 case EXPR_STRING_LITERAL: {
6317 size_t size = expression->string_literal.value.size;
6318 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6321 case EXPR_WIDE_STRING_LITERAL: {
6322 size_t size = wstrlen(&expression->string_literal.value);
6323 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6326 case EXPR_COMPOUND_LITERAL:
6327 return expression->compound_literal.type;
6332 return expression->base.type;
6336 * Find an entity matching a symbol in a scope.
6337 * Uses current scope if scope is NULL
6339 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6340 namespace_tag_t namespc)
6342 if (scope == NULL) {
6343 return get_entity(symbol, namespc);
6346 /* we should optimize here, if scope grows above a certain size we should
6347 construct a hashmap here... */
6348 entity_t *entity = scope->entities;
6349 for ( ; entity != NULL; entity = entity->base.next) {
6350 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6357 static entity_t *parse_qualified_identifier(void)
6359 /* namespace containing the symbol */
6361 source_position_t pos;
6362 const scope_t *lookup_scope = NULL;
6364 if (next_if(T_COLONCOLON))
6365 lookup_scope = &unit->scope;
6369 if (token.type != T_IDENTIFIER) {
6370 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6371 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6373 symbol = token.symbol;
6378 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6380 if (!next_if(T_COLONCOLON))
6383 switch (entity->kind) {
6384 case ENTITY_NAMESPACE:
6385 lookup_scope = &entity->namespacee.members;
6390 lookup_scope = &entity->compound.members;
6393 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6394 symbol, get_entity_kind_name(entity->kind));
6399 if (entity == NULL) {
6400 if (!strict_mode && token.type == '(') {
6401 /* an implicitly declared function */
6402 if (warning.error_implicit_function_declaration) {
6403 errorf(&pos, "implicit declaration of function '%Y'", symbol);
6404 } else if (warning.implicit_function_declaration) {
6405 warningf(&pos, "implicit declaration of function '%Y'", symbol);
6408 entity = create_implicit_function(symbol, &pos);
6410 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6411 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6418 /* skip further qualifications */
6419 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6421 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6424 static expression_t *parse_reference(void)
6426 entity_t *entity = parse_qualified_identifier();
6429 if (is_declaration(entity)) {
6430 orig_type = entity->declaration.type;
6431 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6432 orig_type = entity->enum_value.enum_type;
6434 panic("expected declaration or enum value in reference");
6437 /* we always do the auto-type conversions; the & and sizeof parser contains
6438 * code to revert this! */
6439 type_t *type = automatic_type_conversion(orig_type);
6441 expression_kind_t kind = EXPR_REFERENCE;
6442 if (entity->kind == ENTITY_ENUM_VALUE)
6443 kind = EXPR_REFERENCE_ENUM_VALUE;
6445 expression_t *expression = allocate_expression_zero(kind);
6446 expression->reference.entity = entity;
6447 expression->base.type = type;
6449 /* this declaration is used */
6450 if (is_declaration(entity)) {
6451 entity->declaration.used = true;
6454 if (entity->base.parent_scope != file_scope
6455 && (current_function != NULL
6456 && entity->base.parent_scope->depth < current_function->parameters.depth)
6457 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6458 if (entity->kind == ENTITY_VARIABLE) {
6459 /* access of a variable from an outer function */
6460 entity->variable.address_taken = true;
6461 } else if (entity->kind == ENTITY_PARAMETER) {
6462 entity->parameter.address_taken = true;
6464 current_function->need_closure = true;
6467 check_deprecated(HERE, entity);
6469 if (warning.init_self && entity == current_init_decl && !in_type_prop
6470 && entity->kind == ENTITY_VARIABLE) {
6471 current_init_decl = NULL;
6472 warningf(HERE, "variable '%#T' is initialized by itself",
6473 entity->declaration.type, entity->base.symbol);
6479 static bool semantic_cast(expression_t *cast)
6481 expression_t *expression = cast->unary.value;
6482 type_t *orig_dest_type = cast->base.type;
6483 type_t *orig_type_right = expression->base.type;
6484 type_t const *dst_type = skip_typeref(orig_dest_type);
6485 type_t const *src_type = skip_typeref(orig_type_right);
6486 source_position_t const *pos = &cast->base.source_position;
6488 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6489 if (dst_type == type_void)
6492 /* only integer and pointer can be casted to pointer */
6493 if (is_type_pointer(dst_type) &&
6494 !is_type_pointer(src_type) &&
6495 !is_type_integer(src_type) &&
6496 is_type_valid(src_type)) {
6497 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6501 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6502 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6506 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6507 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6511 if (warning.cast_qual &&
6512 is_type_pointer(src_type) &&
6513 is_type_pointer(dst_type)) {
6514 type_t *src = skip_typeref(src_type->pointer.points_to);
6515 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6516 unsigned missing_qualifiers =
6517 src->base.qualifiers & ~dst->base.qualifiers;
6518 if (missing_qualifiers != 0) {
6520 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6521 missing_qualifiers, orig_type_right);
6527 static expression_t *parse_compound_literal(type_t *type)
6529 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6531 parse_initializer_env_t env;
6534 env.must_be_constant = false;
6535 initializer_t *initializer = parse_initializer(&env);
6538 expression->compound_literal.initializer = initializer;
6539 expression->compound_literal.type = type;
6540 expression->base.type = automatic_type_conversion(type);
6546 * Parse a cast expression.
6548 static expression_t *parse_cast(void)
6550 add_anchor_token(')');
6552 source_position_t source_position = token.source_position;
6554 type_t *type = parse_typename();
6556 rem_anchor_token(')');
6557 expect(')', end_error);
6559 if (token.type == '{') {
6560 return parse_compound_literal(type);
6563 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6564 cast->base.source_position = source_position;
6566 expression_t *value = parse_subexpression(PREC_CAST);
6567 cast->base.type = type;
6568 cast->unary.value = value;
6570 if (! semantic_cast(cast)) {
6571 /* TODO: record the error in the AST. else it is impossible to detect it */
6576 return create_invalid_expression();
6580 * Parse a statement expression.
6582 static expression_t *parse_statement_expression(void)
6584 add_anchor_token(')');
6586 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6588 statement_t *statement = parse_compound_statement(true);
6589 statement->compound.stmt_expr = true;
6590 expression->statement.statement = statement;
6592 /* find last statement and use its type */
6593 type_t *type = type_void;
6594 const statement_t *stmt = statement->compound.statements;
6596 while (stmt->base.next != NULL)
6597 stmt = stmt->base.next;
6599 if (stmt->kind == STATEMENT_EXPRESSION) {
6600 type = stmt->expression.expression->base.type;
6602 } else if (warning.other) {
6603 warningf(&expression->base.source_position, "empty statement expression ({})");
6605 expression->base.type = type;
6607 rem_anchor_token(')');
6608 expect(')', end_error);
6615 * Parse a parenthesized expression.
6617 static expression_t *parse_parenthesized_expression(void)
6621 switch (token.type) {
6623 /* gcc extension: a statement expression */
6624 return parse_statement_expression();
6628 return parse_cast();
6630 if (is_typedef_symbol(token.symbol)) {
6631 return parse_cast();
6635 add_anchor_token(')');
6636 expression_t *result = parse_expression();
6637 result->base.parenthesized = true;
6638 rem_anchor_token(')');
6639 expect(')', end_error);
6645 static expression_t *parse_function_keyword(void)
6649 if (current_function == NULL) {
6650 errorf(HERE, "'__func__' used outside of a function");
6653 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6654 expression->base.type = type_char_ptr;
6655 expression->funcname.kind = FUNCNAME_FUNCTION;
6662 static expression_t *parse_pretty_function_keyword(void)
6664 if (current_function == NULL) {
6665 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6668 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6669 expression->base.type = type_char_ptr;
6670 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6672 eat(T___PRETTY_FUNCTION__);
6677 static expression_t *parse_funcsig_keyword(void)
6679 if (current_function == NULL) {
6680 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6683 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6684 expression->base.type = type_char_ptr;
6685 expression->funcname.kind = FUNCNAME_FUNCSIG;
6692 static expression_t *parse_funcdname_keyword(void)
6694 if (current_function == NULL) {
6695 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6698 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6699 expression->base.type = type_char_ptr;
6700 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6702 eat(T___FUNCDNAME__);
6707 static designator_t *parse_designator(void)
6709 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6710 result->source_position = *HERE;
6712 if (token.type != T_IDENTIFIER) {
6713 parse_error_expected("while parsing member designator",
6714 T_IDENTIFIER, NULL);
6717 result->symbol = token.symbol;
6720 designator_t *last_designator = result;
6723 if (token.type != T_IDENTIFIER) {
6724 parse_error_expected("while parsing member designator",
6725 T_IDENTIFIER, NULL);
6728 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6729 designator->source_position = *HERE;
6730 designator->symbol = token.symbol;
6733 last_designator->next = designator;
6734 last_designator = designator;
6738 add_anchor_token(']');
6739 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6740 designator->source_position = *HERE;
6741 designator->array_index = parse_expression();
6742 rem_anchor_token(']');
6743 expect(']', end_error);
6744 if (designator->array_index == NULL) {
6748 last_designator->next = designator;
6749 last_designator = designator;
6761 * Parse the __builtin_offsetof() expression.
6763 static expression_t *parse_offsetof(void)
6765 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6766 expression->base.type = type_size_t;
6768 eat(T___builtin_offsetof);
6770 expect('(', end_error);
6771 add_anchor_token(',');
6772 type_t *type = parse_typename();
6773 rem_anchor_token(',');
6774 expect(',', end_error);
6775 add_anchor_token(')');
6776 designator_t *designator = parse_designator();
6777 rem_anchor_token(')');
6778 expect(')', end_error);
6780 expression->offsetofe.type = type;
6781 expression->offsetofe.designator = designator;
6784 memset(&path, 0, sizeof(path));
6785 path.top_type = type;
6786 path.path = NEW_ARR_F(type_path_entry_t, 0);
6788 descend_into_subtype(&path);
6790 if (!walk_designator(&path, designator, true)) {
6791 return create_invalid_expression();
6794 DEL_ARR_F(path.path);
6798 return create_invalid_expression();
6802 * Parses a _builtin_va_start() expression.
6804 static expression_t *parse_va_start(void)
6806 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6808 eat(T___builtin_va_start);
6810 expect('(', end_error);
6811 add_anchor_token(',');
6812 expression->va_starte.ap = parse_assignment_expression();
6813 rem_anchor_token(',');
6814 expect(',', end_error);
6815 expression_t *const expr = parse_assignment_expression();
6816 if (expr->kind == EXPR_REFERENCE) {
6817 entity_t *const entity = expr->reference.entity;
6818 if (!current_function->base.type->function.variadic) {
6819 errorf(&expr->base.source_position,
6820 "'va_start' used in non-variadic function");
6821 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6822 entity->base.next != NULL ||
6823 entity->kind != ENTITY_PARAMETER) {
6824 errorf(&expr->base.source_position,
6825 "second argument of 'va_start' must be last parameter of the current function");
6827 expression->va_starte.parameter = &entity->variable;
6829 expect(')', end_error);
6832 expect(')', end_error);
6834 return create_invalid_expression();
6838 * Parses a __builtin_va_arg() expression.
6840 static expression_t *parse_va_arg(void)
6842 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6844 eat(T___builtin_va_arg);
6846 expect('(', end_error);
6848 ap.expression = parse_assignment_expression();
6849 expression->va_arge.ap = ap.expression;
6850 check_call_argument(type_valist, &ap, 1);
6852 expect(',', end_error);
6853 expression->base.type = parse_typename();
6854 expect(')', end_error);
6858 return create_invalid_expression();
6862 * Parses a __builtin_va_copy() expression.
6864 static expression_t *parse_va_copy(void)
6866 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6868 eat(T___builtin_va_copy);
6870 expect('(', end_error);
6871 expression_t *dst = parse_assignment_expression();
6872 assign_error_t error = semantic_assign(type_valist, dst);
6873 report_assign_error(error, type_valist, dst, "call argument 1",
6874 &dst->base.source_position);
6875 expression->va_copye.dst = dst;
6877 expect(',', end_error);
6879 call_argument_t src;
6880 src.expression = parse_assignment_expression();
6881 check_call_argument(type_valist, &src, 2);
6882 expression->va_copye.src = src.expression;
6883 expect(')', end_error);
6887 return create_invalid_expression();
6891 * Parses a __builtin_constant_p() expression.
6893 static expression_t *parse_builtin_constant(void)
6895 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6897 eat(T___builtin_constant_p);
6899 expect('(', end_error);
6900 add_anchor_token(')');
6901 expression->builtin_constant.value = parse_assignment_expression();
6902 rem_anchor_token(')');
6903 expect(')', end_error);
6904 expression->base.type = type_int;
6908 return create_invalid_expression();
6912 * Parses a __builtin_types_compatible_p() expression.
6914 static expression_t *parse_builtin_types_compatible(void)
6916 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6918 eat(T___builtin_types_compatible_p);
6920 expect('(', end_error);
6921 add_anchor_token(')');
6922 add_anchor_token(',');
6923 expression->builtin_types_compatible.left = parse_typename();
6924 rem_anchor_token(',');
6925 expect(',', end_error);
6926 expression->builtin_types_compatible.right = parse_typename();
6927 rem_anchor_token(')');
6928 expect(')', end_error);
6929 expression->base.type = type_int;
6933 return create_invalid_expression();
6937 * Parses a __builtin_is_*() compare expression.
6939 static expression_t *parse_compare_builtin(void)
6941 expression_t *expression;
6943 switch (token.type) {
6944 case T___builtin_isgreater:
6945 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6947 case T___builtin_isgreaterequal:
6948 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6950 case T___builtin_isless:
6951 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6953 case T___builtin_islessequal:
6954 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6956 case T___builtin_islessgreater:
6957 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6959 case T___builtin_isunordered:
6960 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6963 internal_errorf(HERE, "invalid compare builtin found");
6965 expression->base.source_position = *HERE;
6968 expect('(', end_error);
6969 expression->binary.left = parse_assignment_expression();
6970 expect(',', end_error);
6971 expression->binary.right = parse_assignment_expression();
6972 expect(')', end_error);
6974 type_t *const orig_type_left = expression->binary.left->base.type;
6975 type_t *const orig_type_right = expression->binary.right->base.type;
6977 type_t *const type_left = skip_typeref(orig_type_left);
6978 type_t *const type_right = skip_typeref(orig_type_right);
6979 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6980 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6981 type_error_incompatible("invalid operands in comparison",
6982 &expression->base.source_position, orig_type_left, orig_type_right);
6985 semantic_comparison(&expression->binary);
6990 return create_invalid_expression();
6994 * Parses a MS assume() expression.
6996 static expression_t *parse_assume(void)
6998 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7002 expect('(', end_error);
7003 add_anchor_token(')');
7004 expression->unary.value = parse_assignment_expression();
7005 rem_anchor_token(')');
7006 expect(')', end_error);
7008 expression->base.type = type_void;
7011 return create_invalid_expression();
7015 * Return the declaration for a given label symbol or create a new one.
7017 * @param symbol the symbol of the label
7019 static label_t *get_label(symbol_t *symbol)
7022 assert(current_function != NULL);
7024 label = get_entity(symbol, NAMESPACE_LABEL);
7025 /* if we found a local label, we already created the declaration */
7026 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7027 if (label->base.parent_scope != current_scope) {
7028 assert(label->base.parent_scope->depth < current_scope->depth);
7029 current_function->goto_to_outer = true;
7031 return &label->label;
7034 label = get_entity(symbol, NAMESPACE_LABEL);
7035 /* if we found a label in the same function, then we already created the
7038 && label->base.parent_scope == ¤t_function->parameters) {
7039 return &label->label;
7042 /* otherwise we need to create a new one */
7043 label = allocate_entity_zero(ENTITY_LABEL);
7044 label->base.namespc = NAMESPACE_LABEL;
7045 label->base.symbol = symbol;
7049 return &label->label;
7053 * Parses a GNU && label address expression.
7055 static expression_t *parse_label_address(void)
7057 source_position_t source_position = token.source_position;
7059 if (token.type != T_IDENTIFIER) {
7060 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7063 symbol_t *symbol = token.symbol;
7066 label_t *label = get_label(symbol);
7068 label->address_taken = true;
7070 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7071 expression->base.source_position = source_position;
7073 /* label address is threaten as a void pointer */
7074 expression->base.type = type_void_ptr;
7075 expression->label_address.label = label;
7078 return create_invalid_expression();
7082 * Parse a microsoft __noop expression.
7084 static expression_t *parse_noop_expression(void)
7086 /* the result is a (int)0 */
7087 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
7088 literal->base.type = type_int;
7089 literal->base.source_position = token.source_position;
7090 literal->literal.value.begin = "__noop";
7091 literal->literal.value.size = 6;
7095 if (token.type == '(') {
7096 /* parse arguments */
7098 add_anchor_token(')');
7099 add_anchor_token(',');
7101 if (token.type != ')') do {
7102 (void)parse_assignment_expression();
7103 } while (next_if(','));
7105 rem_anchor_token(',');
7106 rem_anchor_token(')');
7107 expect(')', end_error);
7114 * Parses a primary expression.
7116 static expression_t *parse_primary_expression(void)
7118 switch (token.type) {
7119 case T_false: return parse_boolean_literal(false);
7120 case T_true: return parse_boolean_literal(true);
7122 case T_INTEGER_OCTAL:
7123 case T_INTEGER_HEXADECIMAL:
7124 case T_FLOATINGPOINT:
7125 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
7126 case T_CHARACTER_CONSTANT: return parse_character_constant();
7127 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7128 case T_STRING_LITERAL:
7129 case T_WIDE_STRING_LITERAL: return parse_string_literal();
7130 case T___FUNCTION__:
7131 case T___func__: return parse_function_keyword();
7132 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7133 case T___FUNCSIG__: return parse_funcsig_keyword();
7134 case T___FUNCDNAME__: return parse_funcdname_keyword();
7135 case T___builtin_offsetof: return parse_offsetof();
7136 case T___builtin_va_start: return parse_va_start();
7137 case T___builtin_va_arg: return parse_va_arg();
7138 case T___builtin_va_copy: return parse_va_copy();
7139 case T___builtin_isgreater:
7140 case T___builtin_isgreaterequal:
7141 case T___builtin_isless:
7142 case T___builtin_islessequal:
7143 case T___builtin_islessgreater:
7144 case T___builtin_isunordered: return parse_compare_builtin();
7145 case T___builtin_constant_p: return parse_builtin_constant();
7146 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7147 case T__assume: return parse_assume();
7150 return parse_label_address();
7153 case '(': return parse_parenthesized_expression();
7154 case T___noop: return parse_noop_expression();
7156 /* Gracefully handle type names while parsing expressions. */
7158 return parse_reference();
7160 if (!is_typedef_symbol(token.symbol)) {
7161 return parse_reference();
7165 source_position_t const pos = *HERE;
7166 type_t const *const type = parse_typename();
7167 errorf(&pos, "encountered type '%T' while parsing expression", type);
7168 return create_invalid_expression();
7172 errorf(HERE, "unexpected token %K, expected an expression", &token);
7174 return create_invalid_expression();
7178 * Check if the expression has the character type and issue a warning then.
7180 static void check_for_char_index_type(const expression_t *expression)
7182 type_t *const type = expression->base.type;
7183 const type_t *const base_type = skip_typeref(type);
7185 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7186 warning.char_subscripts) {
7187 warningf(&expression->base.source_position,
7188 "array subscript has type '%T'", type);
7192 static expression_t *parse_array_expression(expression_t *left)
7194 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7197 add_anchor_token(']');
7199 expression_t *inside = parse_expression();
7201 type_t *const orig_type_left = left->base.type;
7202 type_t *const orig_type_inside = inside->base.type;
7204 type_t *const type_left = skip_typeref(orig_type_left);
7205 type_t *const type_inside = skip_typeref(orig_type_inside);
7207 type_t *return_type;
7208 array_access_expression_t *array_access = &expression->array_access;
7209 if (is_type_pointer(type_left)) {
7210 return_type = type_left->pointer.points_to;
7211 array_access->array_ref = left;
7212 array_access->index = inside;
7213 check_for_char_index_type(inside);
7214 } else if (is_type_pointer(type_inside)) {
7215 return_type = type_inside->pointer.points_to;
7216 array_access->array_ref = inside;
7217 array_access->index = left;
7218 array_access->flipped = true;
7219 check_for_char_index_type(left);
7221 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7223 "array access on object with non-pointer types '%T', '%T'",
7224 orig_type_left, orig_type_inside);
7226 return_type = type_error_type;
7227 array_access->array_ref = left;
7228 array_access->index = inside;
7231 expression->base.type = automatic_type_conversion(return_type);
7233 rem_anchor_token(']');
7234 expect(']', end_error);
7239 static expression_t *parse_typeprop(expression_kind_t const kind)
7241 expression_t *tp_expression = allocate_expression_zero(kind);
7242 tp_expression->base.type = type_size_t;
7244 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7246 /* we only refer to a type property, mark this case */
7247 bool old = in_type_prop;
7248 in_type_prop = true;
7251 expression_t *expression;
7252 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7254 add_anchor_token(')');
7255 orig_type = parse_typename();
7256 rem_anchor_token(')');
7257 expect(')', end_error);
7259 if (token.type == '{') {
7260 /* It was not sizeof(type) after all. It is sizeof of an expression
7261 * starting with a compound literal */
7262 expression = parse_compound_literal(orig_type);
7263 goto typeprop_expression;
7266 expression = parse_subexpression(PREC_UNARY);
7268 typeprop_expression:
7269 tp_expression->typeprop.tp_expression = expression;
7271 orig_type = revert_automatic_type_conversion(expression);
7272 expression->base.type = orig_type;
7275 tp_expression->typeprop.type = orig_type;
7276 type_t const* const type = skip_typeref(orig_type);
7277 char const* wrong_type = NULL;
7278 if (is_type_incomplete(type)) {
7279 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7280 wrong_type = "incomplete";
7281 } else if (type->kind == TYPE_FUNCTION) {
7283 /* function types are allowed (and return 1) */
7284 if (warning.other) {
7285 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7286 warningf(&tp_expression->base.source_position,
7287 "%s expression with function argument returns invalid result", what);
7290 wrong_type = "function";
7293 if (is_type_incomplete(type))
7294 wrong_type = "incomplete";
7296 if (type->kind == TYPE_BITFIELD)
7297 wrong_type = "bitfield";
7299 if (wrong_type != NULL) {
7300 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7301 errorf(&tp_expression->base.source_position,
7302 "operand of %s expression must not be of %s type '%T'",
7303 what, wrong_type, orig_type);
7308 return tp_expression;
7311 static expression_t *parse_sizeof(void)
7313 return parse_typeprop(EXPR_SIZEOF);
7316 static expression_t *parse_alignof(void)
7318 return parse_typeprop(EXPR_ALIGNOF);
7321 static expression_t *parse_select_expression(expression_t *addr)
7323 assert(token.type == '.' || token.type == T_MINUSGREATER);
7324 bool select_left_arrow = (token.type == T_MINUSGREATER);
7325 source_position_t const pos = *HERE;
7328 if (token.type != T_IDENTIFIER) {
7329 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7330 return create_invalid_expression();
7332 symbol_t *symbol = token.symbol;
7335 type_t *const orig_type = addr->base.type;
7336 type_t *const type = skip_typeref(orig_type);
7339 bool saw_error = false;
7340 if (is_type_pointer(type)) {
7341 if (!select_left_arrow) {
7343 "request for member '%Y' in something not a struct or union, but '%T'",
7347 type_left = skip_typeref(type->pointer.points_to);
7349 if (select_left_arrow && is_type_valid(type)) {
7350 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7356 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7357 type_left->kind != TYPE_COMPOUND_UNION) {
7359 if (is_type_valid(type_left) && !saw_error) {
7361 "request for member '%Y' in something not a struct or union, but '%T'",
7364 return create_invalid_expression();
7367 compound_t *compound = type_left->compound.compound;
7368 if (!compound->complete) {
7369 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7371 return create_invalid_expression();
7374 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7375 expression_t *result =
7376 find_create_select(&pos, addr, qualifiers, compound, symbol);
7378 if (result == NULL) {
7379 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7380 return create_invalid_expression();
7386 static void check_call_argument(type_t *expected_type,
7387 call_argument_t *argument, unsigned pos)
7389 type_t *expected_type_skip = skip_typeref(expected_type);
7390 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7391 expression_t *arg_expr = argument->expression;
7392 type_t *arg_type = skip_typeref(arg_expr->base.type);
7394 /* handle transparent union gnu extension */
7395 if (is_type_union(expected_type_skip)
7396 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7397 compound_t *union_decl = expected_type_skip->compound.compound;
7398 type_t *best_type = NULL;
7399 entity_t *entry = union_decl->members.entities;
7400 for ( ; entry != NULL; entry = entry->base.next) {
7401 assert(is_declaration(entry));
7402 type_t *decl_type = entry->declaration.type;
7403 error = semantic_assign(decl_type, arg_expr);
7404 if (error == ASSIGN_ERROR_INCOMPATIBLE
7405 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7408 if (error == ASSIGN_SUCCESS) {
7409 best_type = decl_type;
7410 } else if (best_type == NULL) {
7411 best_type = decl_type;
7415 if (best_type != NULL) {
7416 expected_type = best_type;
7420 error = semantic_assign(expected_type, arg_expr);
7421 argument->expression = create_implicit_cast(arg_expr, expected_type);
7423 if (error != ASSIGN_SUCCESS) {
7424 /* report exact scope in error messages (like "in argument 3") */
7426 snprintf(buf, sizeof(buf), "call argument %u", pos);
7427 report_assign_error(error, expected_type, arg_expr, buf,
7428 &arg_expr->base.source_position);
7429 } else if (warning.traditional || warning.conversion) {
7430 type_t *const promoted_type = get_default_promoted_type(arg_type);
7431 if (!types_compatible(expected_type_skip, promoted_type) &&
7432 !types_compatible(expected_type_skip, type_void_ptr) &&
7433 !types_compatible(type_void_ptr, promoted_type)) {
7434 /* Deliberately show the skipped types in this warning */
7435 warningf(&arg_expr->base.source_position,
7436 "passing call argument %u as '%T' rather than '%T' due to prototype",
7437 pos, expected_type_skip, promoted_type);
7443 * Handle the semantic restrictions of builtin calls
7445 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7446 switch (call->function->reference.entity->function.btk) {
7447 case bk_gnu_builtin_return_address:
7448 case bk_gnu_builtin_frame_address: {
7449 /* argument must be constant */
7450 call_argument_t *argument = call->arguments;
7452 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7453 errorf(&call->base.source_position,
7454 "argument of '%Y' must be a constant expression",
7455 call->function->reference.entity->base.symbol);
7459 case bk_gnu_builtin_object_size:
7460 if (call->arguments == NULL)
7463 call_argument_t *arg = call->arguments->next;
7464 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7465 errorf(&call->base.source_position,
7466 "second argument of '%Y' must be a constant expression",
7467 call->function->reference.entity->base.symbol);
7470 case bk_gnu_builtin_prefetch:
7471 /* second and third argument must be constant if existent */
7472 if (call->arguments == NULL)
7474 call_argument_t *rw = call->arguments->next;
7475 call_argument_t *locality = NULL;
7478 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7479 errorf(&call->base.source_position,
7480 "second argument of '%Y' must be a constant expression",
7481 call->function->reference.entity->base.symbol);
7483 locality = rw->next;
7485 if (locality != NULL) {
7486 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7487 errorf(&call->base.source_position,
7488 "third argument of '%Y' must be a constant expression",
7489 call->function->reference.entity->base.symbol);
7491 locality = rw->next;
7500 * Parse a call expression, ie. expression '( ... )'.
7502 * @param expression the function address
7504 static expression_t *parse_call_expression(expression_t *expression)
7506 expression_t *result = allocate_expression_zero(EXPR_CALL);
7507 call_expression_t *call = &result->call;
7508 call->function = expression;
7510 type_t *const orig_type = expression->base.type;
7511 type_t *const type = skip_typeref(orig_type);
7513 function_type_t *function_type = NULL;
7514 if (is_type_pointer(type)) {
7515 type_t *const to_type = skip_typeref(type->pointer.points_to);
7517 if (is_type_function(to_type)) {
7518 function_type = &to_type->function;
7519 call->base.type = function_type->return_type;
7523 if (function_type == NULL && is_type_valid(type)) {
7525 "called object '%E' (type '%T') is not a pointer to a function",
7526 expression, orig_type);
7529 /* parse arguments */
7531 add_anchor_token(')');
7532 add_anchor_token(',');
7534 if (token.type != ')') {
7535 call_argument_t **anchor = &call->arguments;
7537 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7538 argument->expression = parse_assignment_expression();
7541 anchor = &argument->next;
7542 } while (next_if(','));
7544 rem_anchor_token(',');
7545 rem_anchor_token(')');
7546 expect(')', end_error);
7548 if (function_type == NULL)
7551 /* check type and count of call arguments */
7552 function_parameter_t *parameter = function_type->parameters;
7553 call_argument_t *argument = call->arguments;
7554 if (!function_type->unspecified_parameters) {
7555 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7556 parameter = parameter->next, argument = argument->next) {
7557 check_call_argument(parameter->type, argument, ++pos);
7560 if (parameter != NULL) {
7561 errorf(HERE, "too few arguments to function '%E'", expression);
7562 } else if (argument != NULL && !function_type->variadic) {
7563 errorf(HERE, "too many arguments to function '%E'", expression);
7567 /* do default promotion for other arguments */
7568 for (; argument != NULL; argument = argument->next) {
7569 type_t *type = argument->expression->base.type;
7570 if (!is_type_object(skip_typeref(type))) {
7571 errorf(&argument->expression->base.source_position,
7572 "call argument '%E' must not be void", argument->expression);
7575 type = get_default_promoted_type(type);
7577 argument->expression
7578 = create_implicit_cast(argument->expression, type);
7581 check_format(&result->call);
7583 if (warning.aggregate_return &&
7584 is_type_compound(skip_typeref(function_type->return_type))) {
7585 warningf(&result->base.source_position,
7586 "function call has aggregate value");
7589 if (call->function->kind == EXPR_REFERENCE) {
7590 reference_expression_t *reference = &call->function->reference;
7591 if (reference->entity->kind == ENTITY_FUNCTION &&
7592 reference->entity->function.btk != bk_none)
7593 handle_builtin_argument_restrictions(call);
7600 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7602 static bool same_compound_type(const type_t *type1, const type_t *type2)
7605 is_type_compound(type1) &&
7606 type1->kind == type2->kind &&
7607 type1->compound.compound == type2->compound.compound;
7610 static expression_t const *get_reference_address(expression_t const *expr)
7612 bool regular_take_address = true;
7614 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7615 expr = expr->unary.value;
7617 regular_take_address = false;
7620 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7623 expr = expr->unary.value;
7626 if (expr->kind != EXPR_REFERENCE)
7629 /* special case for functions which are automatically converted to a
7630 * pointer to function without an extra TAKE_ADDRESS operation */
7631 if (!regular_take_address &&
7632 expr->reference.entity->kind != ENTITY_FUNCTION) {
7639 static void warn_reference_address_as_bool(expression_t const* expr)
7641 if (!warning.address)
7644 expr = get_reference_address(expr);
7646 warningf(&expr->base.source_position,
7647 "the address of '%Y' will always evaluate as 'true'",
7648 expr->reference.entity->base.symbol);
7652 static void warn_assignment_in_condition(const expression_t *const expr)
7654 if (!warning.parentheses)
7656 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7658 if (expr->base.parenthesized)
7660 warningf(&expr->base.source_position,
7661 "suggest parentheses around assignment used as truth value");
7664 static void semantic_condition(expression_t const *const expr,
7665 char const *const context)
7667 type_t *const type = skip_typeref(expr->base.type);
7668 if (is_type_scalar(type)) {
7669 warn_reference_address_as_bool(expr);
7670 warn_assignment_in_condition(expr);
7671 } else if (is_type_valid(type)) {
7672 errorf(&expr->base.source_position,
7673 "%s must have scalar type", context);
7678 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7680 * @param expression the conditional expression
7682 static expression_t *parse_conditional_expression(expression_t *expression)
7684 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7686 conditional_expression_t *conditional = &result->conditional;
7687 conditional->condition = expression;
7690 add_anchor_token(':');
7692 /* §6.5.15:2 The first operand shall have scalar type. */
7693 semantic_condition(expression, "condition of conditional operator");
7695 expression_t *true_expression = expression;
7696 bool gnu_cond = false;
7697 if (GNU_MODE && token.type == ':') {
7700 true_expression = parse_expression();
7702 rem_anchor_token(':');
7703 expect(':', end_error);
7705 expression_t *false_expression =
7706 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7708 type_t *const orig_true_type = true_expression->base.type;
7709 type_t *const orig_false_type = false_expression->base.type;
7710 type_t *const true_type = skip_typeref(orig_true_type);
7711 type_t *const false_type = skip_typeref(orig_false_type);
7714 type_t *result_type;
7715 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7716 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7717 /* ISO/IEC 14882:1998(E) §5.16:2 */
7718 if (true_expression->kind == EXPR_UNARY_THROW) {
7719 result_type = false_type;
7720 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7721 result_type = true_type;
7723 if (warning.other && (
7724 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7725 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7727 warningf(&conditional->base.source_position,
7728 "ISO C forbids conditional expression with only one void side");
7730 result_type = type_void;
7732 } else if (is_type_arithmetic(true_type)
7733 && is_type_arithmetic(false_type)) {
7734 result_type = semantic_arithmetic(true_type, false_type);
7735 } else if (same_compound_type(true_type, false_type)) {
7736 /* just take 1 of the 2 types */
7737 result_type = true_type;
7738 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7739 type_t *pointer_type;
7741 expression_t *other_expression;
7742 if (is_type_pointer(true_type) &&
7743 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7744 pointer_type = true_type;
7745 other_type = false_type;
7746 other_expression = false_expression;
7748 pointer_type = false_type;
7749 other_type = true_type;
7750 other_expression = true_expression;
7753 if (is_null_pointer_constant(other_expression)) {
7754 result_type = pointer_type;
7755 } else if (is_type_pointer(other_type)) {
7756 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7757 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7760 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7761 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7763 } else if (types_compatible(get_unqualified_type(to1),
7764 get_unqualified_type(to2))) {
7767 if (warning.other) {
7768 warningf(&conditional->base.source_position,
7769 "pointer types '%T' and '%T' in conditional expression are incompatible",
7770 true_type, false_type);
7775 type_t *const type =
7776 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7777 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7778 } else if (is_type_integer(other_type)) {
7779 if (warning.other) {
7780 warningf(&conditional->base.source_position,
7781 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7783 result_type = pointer_type;
7785 if (is_type_valid(other_type)) {
7786 type_error_incompatible("while parsing conditional",
7787 &expression->base.source_position, true_type, false_type);
7789 result_type = type_error_type;
7792 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7793 type_error_incompatible("while parsing conditional",
7794 &conditional->base.source_position, true_type,
7797 result_type = type_error_type;
7800 conditional->true_expression
7801 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7802 conditional->false_expression
7803 = create_implicit_cast(false_expression, result_type);
7804 conditional->base.type = result_type;
7809 * Parse an extension expression.
7811 static expression_t *parse_extension(void)
7813 eat(T___extension__);
7815 bool old_gcc_extension = in_gcc_extension;
7816 in_gcc_extension = true;
7817 expression_t *expression = parse_subexpression(PREC_UNARY);
7818 in_gcc_extension = old_gcc_extension;
7823 * Parse a __builtin_classify_type() expression.
7825 static expression_t *parse_builtin_classify_type(void)
7827 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7828 result->base.type = type_int;
7830 eat(T___builtin_classify_type);
7832 expect('(', end_error);
7833 add_anchor_token(')');
7834 expression_t *expression = parse_expression();
7835 rem_anchor_token(')');
7836 expect(')', end_error);
7837 result->classify_type.type_expression = expression;
7841 return create_invalid_expression();
7845 * Parse a delete expression
7846 * ISO/IEC 14882:1998(E) §5.3.5
7848 static expression_t *parse_delete(void)
7850 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7851 result->base.type = type_void;
7856 result->kind = EXPR_UNARY_DELETE_ARRAY;
7857 expect(']', end_error);
7861 expression_t *const value = parse_subexpression(PREC_CAST);
7862 result->unary.value = value;
7864 type_t *const type = skip_typeref(value->base.type);
7865 if (!is_type_pointer(type)) {
7866 if (is_type_valid(type)) {
7867 errorf(&value->base.source_position,
7868 "operand of delete must have pointer type");
7870 } else if (warning.other &&
7871 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7872 warningf(&value->base.source_position,
7873 "deleting 'void*' is undefined");
7880 * Parse a throw expression
7881 * ISO/IEC 14882:1998(E) §15:1
7883 static expression_t *parse_throw(void)
7885 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7886 result->base.type = type_void;
7890 expression_t *value = NULL;
7891 switch (token.type) {
7893 value = parse_assignment_expression();
7894 /* ISO/IEC 14882:1998(E) §15.1:3 */
7895 type_t *const orig_type = value->base.type;
7896 type_t *const type = skip_typeref(orig_type);
7897 if (is_type_incomplete(type)) {
7898 errorf(&value->base.source_position,
7899 "cannot throw object of incomplete type '%T'", orig_type);
7900 } else if (is_type_pointer(type)) {
7901 type_t *const points_to = skip_typeref(type->pointer.points_to);
7902 if (is_type_incomplete(points_to) &&
7903 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7904 errorf(&value->base.source_position,
7905 "cannot throw pointer to incomplete type '%T'", orig_type);
7913 result->unary.value = value;
7918 static bool check_pointer_arithmetic(const source_position_t *source_position,
7919 type_t *pointer_type,
7920 type_t *orig_pointer_type)
7922 type_t *points_to = pointer_type->pointer.points_to;
7923 points_to = skip_typeref(points_to);
7925 if (is_type_incomplete(points_to)) {
7926 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7927 errorf(source_position,
7928 "arithmetic with pointer to incomplete type '%T' not allowed",
7931 } else if (warning.pointer_arith) {
7932 warningf(source_position,
7933 "pointer of type '%T' used in arithmetic",
7936 } else if (is_type_function(points_to)) {
7938 errorf(source_position,
7939 "arithmetic with pointer to function type '%T' not allowed",
7942 } else if (warning.pointer_arith) {
7943 warningf(source_position,
7944 "pointer to a function '%T' used in arithmetic",
7951 static bool is_lvalue(const expression_t *expression)
7953 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7954 switch (expression->kind) {
7955 case EXPR_ARRAY_ACCESS:
7956 case EXPR_COMPOUND_LITERAL:
7957 case EXPR_REFERENCE:
7959 case EXPR_UNARY_DEREFERENCE:
7963 type_t *type = skip_typeref(expression->base.type);
7965 /* ISO/IEC 14882:1998(E) §3.10:3 */
7966 is_type_reference(type) ||
7967 /* Claim it is an lvalue, if the type is invalid. There was a parse
7968 * error before, which maybe prevented properly recognizing it as
7970 !is_type_valid(type);
7975 static void semantic_incdec(unary_expression_t *expression)
7977 type_t *const orig_type = expression->value->base.type;
7978 type_t *const type = skip_typeref(orig_type);
7979 if (is_type_pointer(type)) {
7980 if (!check_pointer_arithmetic(&expression->base.source_position,
7984 } else if (!is_type_real(type) && is_type_valid(type)) {
7985 /* TODO: improve error message */
7986 errorf(&expression->base.source_position,
7987 "operation needs an arithmetic or pointer type");
7990 if (!is_lvalue(expression->value)) {
7991 /* TODO: improve error message */
7992 errorf(&expression->base.source_position, "lvalue required as operand");
7994 expression->base.type = orig_type;
7997 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7999 type_t *const orig_type = expression->value->base.type;
8000 type_t *const type = skip_typeref(orig_type);
8001 if (!is_type_arithmetic(type)) {
8002 if (is_type_valid(type)) {
8003 /* TODO: improve error message */
8004 errorf(&expression->base.source_position,
8005 "operation needs an arithmetic type");
8010 expression->base.type = orig_type;
8013 static void semantic_unexpr_plus(unary_expression_t *expression)
8015 semantic_unexpr_arithmetic(expression);
8016 if (warning.traditional)
8017 warningf(&expression->base.source_position,
8018 "traditional C rejects the unary plus operator");
8021 static void semantic_not(unary_expression_t *expression)
8023 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8024 semantic_condition(expression->value, "operand of !");
8025 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8028 static void semantic_unexpr_integer(unary_expression_t *expression)
8030 type_t *const orig_type = expression->value->base.type;
8031 type_t *const type = skip_typeref(orig_type);
8032 if (!is_type_integer(type)) {
8033 if (is_type_valid(type)) {
8034 errorf(&expression->base.source_position,
8035 "operand of ~ must be of integer type");
8040 expression->base.type = orig_type;
8043 static void semantic_dereference(unary_expression_t *expression)
8045 type_t *const orig_type = expression->value->base.type;
8046 type_t *const type = skip_typeref(orig_type);
8047 if (!is_type_pointer(type)) {
8048 if (is_type_valid(type)) {
8049 errorf(&expression->base.source_position,
8050 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8055 type_t *result_type = type->pointer.points_to;
8056 result_type = automatic_type_conversion(result_type);
8057 expression->base.type = result_type;
8061 * Record that an address is taken (expression represents an lvalue).
8063 * @param expression the expression
8064 * @param may_be_register if true, the expression might be an register
8066 static void set_address_taken(expression_t *expression, bool may_be_register)
8068 if (expression->kind != EXPR_REFERENCE)
8071 entity_t *const entity = expression->reference.entity;
8073 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8076 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8077 && !may_be_register) {
8078 errorf(&expression->base.source_position,
8079 "address of register %s '%Y' requested",
8080 get_entity_kind_name(entity->kind), entity->base.symbol);
8083 if (entity->kind == ENTITY_VARIABLE) {
8084 entity->variable.address_taken = true;
8086 assert(entity->kind == ENTITY_PARAMETER);
8087 entity->parameter.address_taken = true;
8092 * Check the semantic of the address taken expression.
8094 static void semantic_take_addr(unary_expression_t *expression)
8096 expression_t *value = expression->value;
8097 value->base.type = revert_automatic_type_conversion(value);
8099 type_t *orig_type = value->base.type;
8100 type_t *type = skip_typeref(orig_type);
8101 if (!is_type_valid(type))
8105 if (!is_lvalue(value)) {
8106 errorf(&expression->base.source_position, "'&' requires an lvalue");
8108 if (type->kind == TYPE_BITFIELD) {
8109 errorf(&expression->base.source_position,
8110 "'&' not allowed on object with bitfield type '%T'",
8114 set_address_taken(value, false);
8116 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8119 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8120 static expression_t *parse_##unexpression_type(void) \
8122 expression_t *unary_expression \
8123 = allocate_expression_zero(unexpression_type); \
8125 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
8127 sfunc(&unary_expression->unary); \
8129 return unary_expression; \
8132 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8133 semantic_unexpr_arithmetic)
8134 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8135 semantic_unexpr_plus)
8136 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8138 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8139 semantic_dereference)
8140 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8142 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8143 semantic_unexpr_integer)
8144 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8146 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8149 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8151 static expression_t *parse_##unexpression_type(expression_t *left) \
8153 expression_t *unary_expression \
8154 = allocate_expression_zero(unexpression_type); \
8156 unary_expression->unary.value = left; \
8158 sfunc(&unary_expression->unary); \
8160 return unary_expression; \
8163 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8164 EXPR_UNARY_POSTFIX_INCREMENT,
8166 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8167 EXPR_UNARY_POSTFIX_DECREMENT,
8170 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8172 /* TODO: handle complex + imaginary types */
8174 type_left = get_unqualified_type(type_left);
8175 type_right = get_unqualified_type(type_right);
8177 /* §6.3.1.8 Usual arithmetic conversions */
8178 if (type_left == type_long_double || type_right == type_long_double) {
8179 return type_long_double;
8180 } else if (type_left == type_double || type_right == type_double) {
8182 } else if (type_left == type_float || type_right == type_float) {
8186 type_left = promote_integer(type_left);
8187 type_right = promote_integer(type_right);
8189 if (type_left == type_right)
8192 bool const signed_left = is_type_signed(type_left);
8193 bool const signed_right = is_type_signed(type_right);
8194 int const rank_left = get_rank(type_left);
8195 int const rank_right = get_rank(type_right);
8197 if (signed_left == signed_right)
8198 return rank_left >= rank_right ? type_left : type_right;
8207 u_rank = rank_right;
8208 u_type = type_right;
8210 s_rank = rank_right;
8211 s_type = type_right;
8216 if (u_rank >= s_rank)
8219 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8221 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8222 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8226 case ATOMIC_TYPE_INT: return type_unsigned_int;
8227 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8228 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8230 default: panic("invalid atomic type");
8235 * Check the semantic restrictions for a binary expression.
8237 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8239 expression_t *const left = expression->left;
8240 expression_t *const right = expression->right;
8241 type_t *const orig_type_left = left->base.type;
8242 type_t *const orig_type_right = right->base.type;
8243 type_t *const type_left = skip_typeref(orig_type_left);
8244 type_t *const type_right = skip_typeref(orig_type_right);
8246 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8247 /* TODO: improve error message */
8248 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8249 errorf(&expression->base.source_position,
8250 "operation needs arithmetic types");
8255 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8256 expression->left = create_implicit_cast(left, arithmetic_type);
8257 expression->right = create_implicit_cast(right, arithmetic_type);
8258 expression->base.type = arithmetic_type;
8261 static void warn_div_by_zero(binary_expression_t const *const expression)
8263 if (!warning.div_by_zero ||
8264 !is_type_integer(expression->base.type))
8267 expression_t const *const right = expression->right;
8268 /* The type of the right operand can be different for /= */
8269 if (is_type_integer(right->base.type) &&
8270 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8271 !fold_constant_to_bool(right)) {
8272 warningf(&expression->base.source_position, "division by zero");
8277 * Check the semantic restrictions for a div/mod expression.
8279 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8281 semantic_binexpr_arithmetic(expression);
8282 warn_div_by_zero(expression);
8285 static void warn_addsub_in_shift(const expression_t *const expr)
8287 if (expr->base.parenthesized)
8291 switch (expr->kind) {
8292 case EXPR_BINARY_ADD: op = '+'; break;
8293 case EXPR_BINARY_SUB: op = '-'; break;
8297 warningf(&expr->base.source_position,
8298 "suggest parentheses around '%c' inside shift", op);
8301 static bool semantic_shift(binary_expression_t *expression)
8303 expression_t *const left = expression->left;
8304 expression_t *const right = expression->right;
8305 type_t *const orig_type_left = left->base.type;
8306 type_t *const orig_type_right = right->base.type;
8307 type_t * type_left = skip_typeref(orig_type_left);
8308 type_t * type_right = skip_typeref(orig_type_right);
8310 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8311 /* TODO: improve error message */
8312 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8313 errorf(&expression->base.source_position,
8314 "operands of shift operation must have integer types");
8319 type_left = promote_integer(type_left);
8321 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8322 long count = fold_constant_to_int(right);
8324 warningf(&right->base.source_position,
8325 "shift count must be non-negative");
8326 } else if ((unsigned long)count >=
8327 get_atomic_type_size(type_left->atomic.akind) * 8) {
8328 warningf(&right->base.source_position,
8329 "shift count must be less than type width");
8333 type_right = promote_integer(type_right);
8334 expression->right = create_implicit_cast(right, type_right);
8339 static void semantic_shift_op(binary_expression_t *expression)
8341 expression_t *const left = expression->left;
8342 expression_t *const right = expression->right;
8344 if (!semantic_shift(expression))
8347 if (warning.parentheses) {
8348 warn_addsub_in_shift(left);
8349 warn_addsub_in_shift(right);
8352 type_t *const orig_type_left = left->base.type;
8353 type_t * type_left = skip_typeref(orig_type_left);
8355 type_left = promote_integer(type_left);
8356 expression->left = create_implicit_cast(left, type_left);
8357 expression->base.type = type_left;
8360 static void semantic_add(binary_expression_t *expression)
8362 expression_t *const left = expression->left;
8363 expression_t *const right = expression->right;
8364 type_t *const orig_type_left = left->base.type;
8365 type_t *const orig_type_right = right->base.type;
8366 type_t *const type_left = skip_typeref(orig_type_left);
8367 type_t *const type_right = skip_typeref(orig_type_right);
8370 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8371 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8372 expression->left = create_implicit_cast(left, arithmetic_type);
8373 expression->right = create_implicit_cast(right, arithmetic_type);
8374 expression->base.type = arithmetic_type;
8375 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8376 check_pointer_arithmetic(&expression->base.source_position,
8377 type_left, orig_type_left);
8378 expression->base.type = type_left;
8379 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8380 check_pointer_arithmetic(&expression->base.source_position,
8381 type_right, orig_type_right);
8382 expression->base.type = type_right;
8383 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8384 errorf(&expression->base.source_position,
8385 "invalid operands to binary + ('%T', '%T')",
8386 orig_type_left, orig_type_right);
8390 static void semantic_sub(binary_expression_t *expression)
8392 expression_t *const left = expression->left;
8393 expression_t *const right = expression->right;
8394 type_t *const orig_type_left = left->base.type;
8395 type_t *const orig_type_right = right->base.type;
8396 type_t *const type_left = skip_typeref(orig_type_left);
8397 type_t *const type_right = skip_typeref(orig_type_right);
8398 source_position_t const *const pos = &expression->base.source_position;
8401 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8402 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8403 expression->left = create_implicit_cast(left, arithmetic_type);
8404 expression->right = create_implicit_cast(right, arithmetic_type);
8405 expression->base.type = arithmetic_type;
8406 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8407 check_pointer_arithmetic(&expression->base.source_position,
8408 type_left, orig_type_left);
8409 expression->base.type = type_left;
8410 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8411 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8412 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8413 if (!types_compatible(unqual_left, unqual_right)) {
8415 "subtracting pointers to incompatible types '%T' and '%T'",
8416 orig_type_left, orig_type_right);
8417 } else if (!is_type_object(unqual_left)) {
8418 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8419 errorf(pos, "subtracting pointers to non-object types '%T'",
8421 } else if (warning.other) {
8422 warningf(pos, "subtracting pointers to void");
8425 expression->base.type = type_ptrdiff_t;
8426 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8427 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8428 orig_type_left, orig_type_right);
8432 static void warn_string_literal_address(expression_t const* expr)
8434 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8435 expr = expr->unary.value;
8436 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8438 expr = expr->unary.value;
8441 if (expr->kind == EXPR_STRING_LITERAL
8442 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8443 warningf(&expr->base.source_position,
8444 "comparison with string literal results in unspecified behaviour");
8448 static void warn_comparison_in_comparison(const expression_t *const expr)
8450 if (expr->base.parenthesized)
8452 switch (expr->base.kind) {
8453 case EXPR_BINARY_LESS:
8454 case EXPR_BINARY_GREATER:
8455 case EXPR_BINARY_LESSEQUAL:
8456 case EXPR_BINARY_GREATEREQUAL:
8457 case EXPR_BINARY_NOTEQUAL:
8458 case EXPR_BINARY_EQUAL:
8459 warningf(&expr->base.source_position,
8460 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8467 static bool maybe_negative(expression_t const *const expr)
8469 switch (is_constant_expression(expr)) {
8470 case EXPR_CLASS_ERROR: return false;
8471 case EXPR_CLASS_CONSTANT: return fold_constant_to_int(expr) < 0;
8472 default: return true;
8477 * Check the semantics of comparison expressions.
8479 * @param expression The expression to check.
8481 static void semantic_comparison(binary_expression_t *expression)
8483 expression_t *left = expression->left;
8484 expression_t *right = expression->right;
8486 if (warning.address) {
8487 warn_string_literal_address(left);
8488 warn_string_literal_address(right);
8490 expression_t const* const func_left = get_reference_address(left);
8491 if (func_left != NULL && is_null_pointer_constant(right)) {
8492 warningf(&expression->base.source_position,
8493 "the address of '%Y' will never be NULL",
8494 func_left->reference.entity->base.symbol);
8497 expression_t const* const func_right = get_reference_address(right);
8498 if (func_right != NULL && is_null_pointer_constant(right)) {
8499 warningf(&expression->base.source_position,
8500 "the address of '%Y' will never be NULL",
8501 func_right->reference.entity->base.symbol);
8505 if (warning.parentheses) {
8506 warn_comparison_in_comparison(left);
8507 warn_comparison_in_comparison(right);
8510 type_t *orig_type_left = left->base.type;
8511 type_t *orig_type_right = right->base.type;
8512 type_t *type_left = skip_typeref(orig_type_left);
8513 type_t *type_right = skip_typeref(orig_type_right);
8515 /* TODO non-arithmetic types */
8516 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8517 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8519 /* test for signed vs unsigned compares */
8520 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8521 bool const signed_left = is_type_signed(type_left);
8522 bool const signed_right = is_type_signed(type_right);
8523 if (signed_left != signed_right) {
8524 /* FIXME long long needs better const folding magic */
8525 /* TODO check whether constant value can be represented by other type */
8526 if ((signed_left && maybe_negative(left)) ||
8527 (signed_right && maybe_negative(right))) {
8528 warningf(&expression->base.source_position,
8529 "comparison between signed and unsigned");
8534 expression->left = create_implicit_cast(left, arithmetic_type);
8535 expression->right = create_implicit_cast(right, arithmetic_type);
8536 expression->base.type = arithmetic_type;
8537 if (warning.float_equal &&
8538 (expression->base.kind == EXPR_BINARY_EQUAL ||
8539 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8540 is_type_float(arithmetic_type)) {
8541 warningf(&expression->base.source_position,
8542 "comparing floating point with == or != is unsafe");
8544 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8545 /* TODO check compatibility */
8546 } else if (is_type_pointer(type_left)) {
8547 expression->right = create_implicit_cast(right, type_left);
8548 } else if (is_type_pointer(type_right)) {
8549 expression->left = create_implicit_cast(left, type_right);
8550 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8551 type_error_incompatible("invalid operands in comparison",
8552 &expression->base.source_position,
8553 type_left, type_right);
8555 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8559 * Checks if a compound type has constant fields.
8561 static bool has_const_fields(const compound_type_t *type)
8563 compound_t *compound = type->compound;
8564 entity_t *entry = compound->members.entities;
8566 for (; entry != NULL; entry = entry->base.next) {
8567 if (!is_declaration(entry))
8570 const type_t *decl_type = skip_typeref(entry->declaration.type);
8571 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8578 static bool is_valid_assignment_lhs(expression_t const* const left)
8580 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8581 type_t *const type_left = skip_typeref(orig_type_left);
8583 if (!is_lvalue(left)) {
8584 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8589 if (left->kind == EXPR_REFERENCE
8590 && left->reference.entity->kind == ENTITY_FUNCTION) {
8591 errorf(HERE, "cannot assign to function '%E'", left);
8595 if (is_type_array(type_left)) {
8596 errorf(HERE, "cannot assign to array '%E'", left);
8599 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8600 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8604 if (is_type_incomplete(type_left)) {
8605 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8606 left, orig_type_left);
8609 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8610 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8611 left, orig_type_left);
8618 static void semantic_arithmetic_assign(binary_expression_t *expression)
8620 expression_t *left = expression->left;
8621 expression_t *right = expression->right;
8622 type_t *orig_type_left = left->base.type;
8623 type_t *orig_type_right = right->base.type;
8625 if (!is_valid_assignment_lhs(left))
8628 type_t *type_left = skip_typeref(orig_type_left);
8629 type_t *type_right = skip_typeref(orig_type_right);
8631 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8632 /* TODO: improve error message */
8633 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8634 errorf(&expression->base.source_position,
8635 "operation needs arithmetic types");
8640 /* combined instructions are tricky. We can't create an implicit cast on
8641 * the left side, because we need the uncasted form for the store.
8642 * The ast2firm pass has to know that left_type must be right_type
8643 * for the arithmetic operation and create a cast by itself */
8644 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8645 expression->right = create_implicit_cast(right, arithmetic_type);
8646 expression->base.type = type_left;
8649 static void semantic_divmod_assign(binary_expression_t *expression)
8651 semantic_arithmetic_assign(expression);
8652 warn_div_by_zero(expression);
8655 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8657 expression_t *const left = expression->left;
8658 expression_t *const right = expression->right;
8659 type_t *const orig_type_left = left->base.type;
8660 type_t *const orig_type_right = right->base.type;
8661 type_t *const type_left = skip_typeref(orig_type_left);
8662 type_t *const type_right = skip_typeref(orig_type_right);
8664 if (!is_valid_assignment_lhs(left))
8667 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8668 /* combined instructions are tricky. We can't create an implicit cast on
8669 * the left side, because we need the uncasted form for the store.
8670 * The ast2firm pass has to know that left_type must be right_type
8671 * for the arithmetic operation and create a cast by itself */
8672 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8673 expression->right = create_implicit_cast(right, arithmetic_type);
8674 expression->base.type = type_left;
8675 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8676 check_pointer_arithmetic(&expression->base.source_position,
8677 type_left, orig_type_left);
8678 expression->base.type = type_left;
8679 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8680 errorf(&expression->base.source_position,
8681 "incompatible types '%T' and '%T' in assignment",
8682 orig_type_left, orig_type_right);
8686 static void semantic_integer_assign(binary_expression_t *expression)
8688 expression_t *left = expression->left;
8689 expression_t *right = expression->right;
8690 type_t *orig_type_left = left->base.type;
8691 type_t *orig_type_right = right->base.type;
8693 if (!is_valid_assignment_lhs(left))
8696 type_t *type_left = skip_typeref(orig_type_left);
8697 type_t *type_right = skip_typeref(orig_type_right);
8699 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8700 /* TODO: improve error message */
8701 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8702 errorf(&expression->base.source_position,
8703 "operation needs integer types");
8708 /* combined instructions are tricky. We can't create an implicit cast on
8709 * the left side, because we need the uncasted form for the store.
8710 * The ast2firm pass has to know that left_type must be right_type
8711 * for the arithmetic operation and create a cast by itself */
8712 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8713 expression->right = create_implicit_cast(right, arithmetic_type);
8714 expression->base.type = type_left;
8717 static void semantic_shift_assign(binary_expression_t *expression)
8719 expression_t *left = expression->left;
8721 if (!is_valid_assignment_lhs(left))
8724 if (!semantic_shift(expression))
8727 expression->base.type = skip_typeref(left->base.type);
8730 static void warn_logical_and_within_or(const expression_t *const expr)
8732 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8734 if (expr->base.parenthesized)
8736 warningf(&expr->base.source_position,
8737 "suggest parentheses around && within ||");
8741 * Check the semantic restrictions of a logical expression.
8743 static void semantic_logical_op(binary_expression_t *expression)
8745 /* §6.5.13:2 Each of the operands shall have scalar type.
8746 * §6.5.14:2 Each of the operands shall have scalar type. */
8747 semantic_condition(expression->left, "left operand of logical operator");
8748 semantic_condition(expression->right, "right operand of logical operator");
8749 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8750 warning.parentheses) {
8751 warn_logical_and_within_or(expression->left);
8752 warn_logical_and_within_or(expression->right);
8754 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8758 * Check the semantic restrictions of a binary assign expression.
8760 static void semantic_binexpr_assign(binary_expression_t *expression)
8762 expression_t *left = expression->left;
8763 type_t *orig_type_left = left->base.type;
8765 if (!is_valid_assignment_lhs(left))
8768 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8769 report_assign_error(error, orig_type_left, expression->right,
8770 "assignment", &left->base.source_position);
8771 expression->right = create_implicit_cast(expression->right, orig_type_left);
8772 expression->base.type = orig_type_left;
8776 * Determine if the outermost operation (or parts thereof) of the given
8777 * expression has no effect in order to generate a warning about this fact.
8778 * Therefore in some cases this only examines some of the operands of the
8779 * expression (see comments in the function and examples below).
8781 * f() + 23; // warning, because + has no effect
8782 * x || f(); // no warning, because x controls execution of f()
8783 * x ? y : f(); // warning, because y has no effect
8784 * (void)x; // no warning to be able to suppress the warning
8785 * This function can NOT be used for an "expression has definitely no effect"-
8787 static bool expression_has_effect(const expression_t *const expr)
8789 switch (expr->kind) {
8790 case EXPR_UNKNOWN: break;
8791 case EXPR_INVALID: return true; /* do NOT warn */
8792 case EXPR_REFERENCE: return false;
8793 case EXPR_REFERENCE_ENUM_VALUE: return false;
8794 case EXPR_LABEL_ADDRESS: return false;
8796 /* suppress the warning for microsoft __noop operations */
8797 case EXPR_LITERAL_MS_NOOP: return true;
8798 case EXPR_LITERAL_BOOLEAN:
8799 case EXPR_LITERAL_CHARACTER:
8800 case EXPR_LITERAL_WIDE_CHARACTER:
8801 case EXPR_LITERAL_INTEGER:
8802 case EXPR_LITERAL_INTEGER_OCTAL:
8803 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8804 case EXPR_LITERAL_FLOATINGPOINT:
8805 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8806 case EXPR_STRING_LITERAL: return false;
8807 case EXPR_WIDE_STRING_LITERAL: return false;
8810 const call_expression_t *const call = &expr->call;
8811 if (call->function->kind != EXPR_REFERENCE)
8814 switch (call->function->reference.entity->function.btk) {
8815 /* FIXME: which builtins have no effect? */
8816 default: return true;
8820 /* Generate the warning if either the left or right hand side of a
8821 * conditional expression has no effect */
8822 case EXPR_CONDITIONAL: {
8823 conditional_expression_t const *const cond = &expr->conditional;
8824 expression_t const *const t = cond->true_expression;
8826 (t == NULL || expression_has_effect(t)) &&
8827 expression_has_effect(cond->false_expression);
8830 case EXPR_SELECT: return false;
8831 case EXPR_ARRAY_ACCESS: return false;
8832 case EXPR_SIZEOF: return false;
8833 case EXPR_CLASSIFY_TYPE: return false;
8834 case EXPR_ALIGNOF: return false;
8836 case EXPR_FUNCNAME: return false;
8837 case EXPR_BUILTIN_CONSTANT_P: return false;
8838 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8839 case EXPR_OFFSETOF: return false;
8840 case EXPR_VA_START: return true;
8841 case EXPR_VA_ARG: return true;
8842 case EXPR_VA_COPY: return true;
8843 case EXPR_STATEMENT: return true; // TODO
8844 case EXPR_COMPOUND_LITERAL: return false;
8846 case EXPR_UNARY_NEGATE: return false;
8847 case EXPR_UNARY_PLUS: return false;
8848 case EXPR_UNARY_BITWISE_NEGATE: return false;
8849 case EXPR_UNARY_NOT: return false;
8850 case EXPR_UNARY_DEREFERENCE: return false;
8851 case EXPR_UNARY_TAKE_ADDRESS: return false;
8852 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8853 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8854 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8855 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8857 /* Treat void casts as if they have an effect in order to being able to
8858 * suppress the warning */
8859 case EXPR_UNARY_CAST: {
8860 type_t *const type = skip_typeref(expr->base.type);
8861 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8864 case EXPR_UNARY_CAST_IMPLICIT: return true;
8865 case EXPR_UNARY_ASSUME: return true;
8866 case EXPR_UNARY_DELETE: return true;
8867 case EXPR_UNARY_DELETE_ARRAY: return true;
8868 case EXPR_UNARY_THROW: return true;
8870 case EXPR_BINARY_ADD: return false;
8871 case EXPR_BINARY_SUB: return false;
8872 case EXPR_BINARY_MUL: return false;
8873 case EXPR_BINARY_DIV: return false;
8874 case EXPR_BINARY_MOD: return false;
8875 case EXPR_BINARY_EQUAL: return false;
8876 case EXPR_BINARY_NOTEQUAL: return false;
8877 case EXPR_BINARY_LESS: return false;
8878 case EXPR_BINARY_LESSEQUAL: return false;
8879 case EXPR_BINARY_GREATER: return false;
8880 case EXPR_BINARY_GREATEREQUAL: return false;
8881 case EXPR_BINARY_BITWISE_AND: return false;
8882 case EXPR_BINARY_BITWISE_OR: return false;
8883 case EXPR_BINARY_BITWISE_XOR: return false;
8884 case EXPR_BINARY_SHIFTLEFT: return false;
8885 case EXPR_BINARY_SHIFTRIGHT: return false;
8886 case EXPR_BINARY_ASSIGN: return true;
8887 case EXPR_BINARY_MUL_ASSIGN: return true;
8888 case EXPR_BINARY_DIV_ASSIGN: return true;
8889 case EXPR_BINARY_MOD_ASSIGN: return true;
8890 case EXPR_BINARY_ADD_ASSIGN: return true;
8891 case EXPR_BINARY_SUB_ASSIGN: return true;
8892 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8893 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8894 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8895 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8896 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8898 /* Only examine the right hand side of && and ||, because the left hand
8899 * side already has the effect of controlling the execution of the right
8901 case EXPR_BINARY_LOGICAL_AND:
8902 case EXPR_BINARY_LOGICAL_OR:
8903 /* Only examine the right hand side of a comma expression, because the left
8904 * hand side has a separate warning */
8905 case EXPR_BINARY_COMMA:
8906 return expression_has_effect(expr->binary.right);
8908 case EXPR_BINARY_ISGREATER: return false;
8909 case EXPR_BINARY_ISGREATEREQUAL: return false;
8910 case EXPR_BINARY_ISLESS: return false;
8911 case EXPR_BINARY_ISLESSEQUAL: return false;
8912 case EXPR_BINARY_ISLESSGREATER: return false;
8913 case EXPR_BINARY_ISUNORDERED: return false;
8916 internal_errorf(HERE, "unexpected expression");
8919 static void semantic_comma(binary_expression_t *expression)
8921 if (warning.unused_value) {
8922 const expression_t *const left = expression->left;
8923 if (!expression_has_effect(left)) {
8924 warningf(&left->base.source_position,
8925 "left-hand operand of comma expression has no effect");
8928 expression->base.type = expression->right->base.type;
8932 * @param prec_r precedence of the right operand
8934 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8935 static expression_t *parse_##binexpression_type(expression_t *left) \
8937 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8938 binexpr->binary.left = left; \
8941 expression_t *right = parse_subexpression(prec_r); \
8943 binexpr->binary.right = right; \
8944 sfunc(&binexpr->binary); \
8949 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8950 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8951 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8952 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8953 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8954 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8955 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8956 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8957 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8958 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8959 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8960 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8961 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8962 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8963 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8964 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8965 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8966 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8967 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8968 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8969 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8970 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8971 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8972 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8973 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8974 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8975 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8976 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8977 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8978 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8981 static expression_t *parse_subexpression(precedence_t precedence)
8983 if (token.type < 0) {
8984 return expected_expression_error();
8987 expression_parser_function_t *parser
8988 = &expression_parsers[token.type];
8989 source_position_t source_position = token.source_position;
8992 if (parser->parser != NULL) {
8993 left = parser->parser();
8995 left = parse_primary_expression();
8997 assert(left != NULL);
8998 left->base.source_position = source_position;
9001 if (token.type < 0) {
9002 return expected_expression_error();
9005 parser = &expression_parsers[token.type];
9006 if (parser->infix_parser == NULL)
9008 if (parser->infix_precedence < precedence)
9011 left = parser->infix_parser(left);
9013 assert(left != NULL);
9014 assert(left->kind != EXPR_UNKNOWN);
9015 left->base.source_position = source_position;
9022 * Parse an expression.
9024 static expression_t *parse_expression(void)
9026 return parse_subexpression(PREC_EXPRESSION);
9030 * Register a parser for a prefix-like operator.
9032 * @param parser the parser function
9033 * @param token_type the token type of the prefix token
9035 static void register_expression_parser(parse_expression_function parser,
9038 expression_parser_function_t *entry = &expression_parsers[token_type];
9040 if (entry->parser != NULL) {
9041 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9042 panic("trying to register multiple expression parsers for a token");
9044 entry->parser = parser;
9048 * Register a parser for an infix operator with given precedence.
9050 * @param parser the parser function
9051 * @param token_type the token type of the infix operator
9052 * @param precedence the precedence of the operator
9054 static void register_infix_parser(parse_expression_infix_function parser,
9055 int token_type, precedence_t precedence)
9057 expression_parser_function_t *entry = &expression_parsers[token_type];
9059 if (entry->infix_parser != NULL) {
9060 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9061 panic("trying to register multiple infix expression parsers for a "
9064 entry->infix_parser = parser;
9065 entry->infix_precedence = precedence;
9069 * Initialize the expression parsers.
9071 static void init_expression_parsers(void)
9073 memset(&expression_parsers, 0, sizeof(expression_parsers));
9075 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9076 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9077 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9078 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9079 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9080 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9081 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9082 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9083 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9084 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9085 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9086 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9087 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9088 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9089 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9090 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9091 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9092 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9093 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9094 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9095 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9096 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9097 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9098 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9099 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9100 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9101 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9102 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9103 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9104 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9105 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9106 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9107 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9108 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9109 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9110 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9111 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9113 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9114 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9115 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9116 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9117 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9118 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9119 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9120 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9121 register_expression_parser(parse_sizeof, T_sizeof);
9122 register_expression_parser(parse_alignof, T___alignof__);
9123 register_expression_parser(parse_extension, T___extension__);
9124 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9125 register_expression_parser(parse_delete, T_delete);
9126 register_expression_parser(parse_throw, T_throw);
9130 * Parse a asm statement arguments specification.
9132 static asm_argument_t *parse_asm_arguments(bool is_out)
9134 asm_argument_t *result = NULL;
9135 asm_argument_t **anchor = &result;
9137 while (token.type == T_STRING_LITERAL || token.type == '[') {
9138 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9139 memset(argument, 0, sizeof(argument[0]));
9142 if (token.type != T_IDENTIFIER) {
9143 parse_error_expected("while parsing asm argument",
9144 T_IDENTIFIER, NULL);
9147 argument->symbol = token.symbol;
9149 expect(']', end_error);
9152 argument->constraints = parse_string_literals();
9153 expect('(', end_error);
9154 add_anchor_token(')');
9155 expression_t *expression = parse_expression();
9156 rem_anchor_token(')');
9158 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9159 * change size or type representation (e.g. int -> long is ok, but
9160 * int -> float is not) */
9161 if (expression->kind == EXPR_UNARY_CAST) {
9162 type_t *const type = expression->base.type;
9163 type_kind_t const kind = type->kind;
9164 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9167 if (kind == TYPE_ATOMIC) {
9168 atomic_type_kind_t const akind = type->atomic.akind;
9169 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9170 size = get_atomic_type_size(akind);
9172 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9173 size = get_atomic_type_size(get_intptr_kind());
9177 expression_t *const value = expression->unary.value;
9178 type_t *const value_type = value->base.type;
9179 type_kind_t const value_kind = value_type->kind;
9181 unsigned value_flags;
9182 unsigned value_size;
9183 if (value_kind == TYPE_ATOMIC) {
9184 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9185 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9186 value_size = get_atomic_type_size(value_akind);
9187 } else if (value_kind == TYPE_POINTER) {
9188 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9189 value_size = get_atomic_type_size(get_intptr_kind());
9194 if (value_flags != flags || value_size != size)
9198 } while (expression->kind == EXPR_UNARY_CAST);
9202 if (!is_lvalue(expression)) {
9203 errorf(&expression->base.source_position,
9204 "asm output argument is not an lvalue");
9207 if (argument->constraints.begin[0] == '=')
9208 determine_lhs_ent(expression, NULL);
9210 mark_vars_read(expression, NULL);
9212 mark_vars_read(expression, NULL);
9214 argument->expression = expression;
9215 expect(')', end_error);
9217 set_address_taken(expression, true);
9220 anchor = &argument->next;
9232 * Parse a asm statement clobber specification.
9234 static asm_clobber_t *parse_asm_clobbers(void)
9236 asm_clobber_t *result = NULL;
9237 asm_clobber_t **anchor = &result;
9239 while (token.type == T_STRING_LITERAL) {
9240 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9241 clobber->clobber = parse_string_literals();
9244 anchor = &clobber->next;
9254 * Parse an asm statement.
9256 static statement_t *parse_asm_statement(void)
9258 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9259 asm_statement_t *asm_statement = &statement->asms;
9263 if (next_if(T_volatile))
9264 asm_statement->is_volatile = true;
9266 expect('(', end_error);
9267 add_anchor_token(')');
9268 if (token.type != T_STRING_LITERAL) {
9269 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9272 asm_statement->asm_text = parse_string_literals();
9274 add_anchor_token(':');
9275 if (!next_if(':')) {
9276 rem_anchor_token(':');
9280 asm_statement->outputs = parse_asm_arguments(true);
9281 if (!next_if(':')) {
9282 rem_anchor_token(':');
9286 asm_statement->inputs = parse_asm_arguments(false);
9287 if (!next_if(':')) {
9288 rem_anchor_token(':');
9291 rem_anchor_token(':');
9293 asm_statement->clobbers = parse_asm_clobbers();
9296 rem_anchor_token(')');
9297 expect(')', end_error);
9298 expect(';', end_error);
9300 if (asm_statement->outputs == NULL) {
9301 /* GCC: An 'asm' instruction without any output operands will be treated
9302 * identically to a volatile 'asm' instruction. */
9303 asm_statement->is_volatile = true;
9308 return create_invalid_statement();
9311 static statement_t *parse_label_inner_statement(char const *const label, bool const eat_empty_stmt)
9313 statement_t *inner_stmt;
9314 switch (token.type) {
9316 errorf(HERE, "%s at end of compound statement", label);
9317 inner_stmt = create_invalid_statement();
9321 if (eat_empty_stmt) {
9322 /* Eat an empty statement here, to avoid the warning about an empty
9323 * statement after a label. label:; is commonly used to have a label
9324 * before a closing brace. */
9325 inner_stmt = create_empty_statement();
9332 inner_stmt = parse_statement();
9333 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9334 errorf(&inner_stmt->base.source_position, "declaration after %s", label);
9342 * Parse a case statement.
9344 static statement_t *parse_case_statement(void)
9346 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9347 source_position_t *const pos = &statement->base.source_position;
9351 expression_t *const expression = parse_expression();
9352 statement->case_label.expression = expression;
9353 expression_classification_t const expr_class = is_constant_expression(expression);
9354 if (expr_class != EXPR_CLASS_CONSTANT) {
9355 if (expr_class != EXPR_CLASS_ERROR) {
9356 errorf(pos, "case label does not reduce to an integer constant");
9358 statement->case_label.is_bad = true;
9360 long const val = fold_constant_to_int(expression);
9361 statement->case_label.first_case = val;
9362 statement->case_label.last_case = val;
9366 if (next_if(T_DOTDOTDOT)) {
9367 expression_t *const end_range = parse_expression();
9368 statement->case_label.end_range = end_range;
9369 expression_classification_t const end_class = is_constant_expression(end_range);
9370 if (end_class != EXPR_CLASS_CONSTANT) {
9371 if (end_class != EXPR_CLASS_ERROR) {
9372 errorf(pos, "case range does not reduce to an integer constant");
9374 statement->case_label.is_bad = true;
9376 long const val = fold_constant_to_int(end_range);
9377 statement->case_label.last_case = val;
9379 if (warning.other && val < statement->case_label.first_case) {
9380 statement->case_label.is_empty_range = true;
9381 warningf(pos, "empty range specified");
9387 PUSH_PARENT(statement);
9389 expect(':', end_error);
9392 if (current_switch != NULL) {
9393 if (! statement->case_label.is_bad) {
9394 /* Check for duplicate case values */
9395 case_label_statement_t *c = &statement->case_label;
9396 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9397 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9400 if (c->last_case < l->first_case || c->first_case > l->last_case)
9403 errorf(pos, "duplicate case value (previously used %P)",
9404 &l->base.source_position);
9408 /* link all cases into the switch statement */
9409 if (current_switch->last_case == NULL) {
9410 current_switch->first_case = &statement->case_label;
9412 current_switch->last_case->next = &statement->case_label;
9414 current_switch->last_case = &statement->case_label;
9416 errorf(pos, "case label not within a switch statement");
9419 statement->case_label.statement = parse_label_inner_statement("case label", false);
9426 * Parse a default statement.
9428 static statement_t *parse_default_statement(void)
9430 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9434 PUSH_PARENT(statement);
9436 expect(':', end_error);
9439 if (current_switch != NULL) {
9440 const case_label_statement_t *def_label = current_switch->default_label;
9441 if (def_label != NULL) {
9442 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9443 &def_label->base.source_position);
9445 current_switch->default_label = &statement->case_label;
9447 /* link all cases into the switch statement */
9448 if (current_switch->last_case == NULL) {
9449 current_switch->first_case = &statement->case_label;
9451 current_switch->last_case->next = &statement->case_label;
9453 current_switch->last_case = &statement->case_label;
9456 errorf(&statement->base.source_position,
9457 "'default' label not within a switch statement");
9460 statement->case_label.statement = parse_label_inner_statement("default label", false);
9467 * Parse a label statement.
9469 static statement_t *parse_label_statement(void)
9471 assert(token.type == T_IDENTIFIER);
9472 symbol_t *symbol = token.symbol;
9473 label_t *label = get_label(symbol);
9475 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9476 statement->label.label = label;
9480 PUSH_PARENT(statement);
9482 /* if statement is already set then the label is defined twice,
9483 * otherwise it was just mentioned in a goto/local label declaration so far
9485 if (label->statement != NULL) {
9486 errorf(HERE, "duplicate label '%Y' (declared %P)",
9487 symbol, &label->base.source_position);
9489 label->base.source_position = token.source_position;
9490 label->statement = statement;
9495 statement->label.statement = parse_label_inner_statement("label", true);
9497 /* remember the labels in a list for later checking */
9498 *label_anchor = &statement->label;
9499 label_anchor = &statement->label.next;
9506 * Parse an if statement.
9508 static statement_t *parse_if(void)
9510 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9514 PUSH_PARENT(statement);
9516 add_anchor_token('{');
9518 expect('(', end_error);
9519 add_anchor_token(')');
9520 expression_t *const expr = parse_expression();
9521 statement->ifs.condition = expr;
9522 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9524 semantic_condition(expr, "condition of 'if'-statment");
9525 mark_vars_read(expr, NULL);
9526 rem_anchor_token(')');
9527 expect(')', end_error);
9530 rem_anchor_token('{');
9532 add_anchor_token(T_else);
9533 statement_t *const true_stmt = parse_statement();
9534 statement->ifs.true_statement = true_stmt;
9535 rem_anchor_token(T_else);
9537 if (next_if(T_else)) {
9538 statement->ifs.false_statement = parse_statement();
9539 } else if (warning.parentheses &&
9540 true_stmt->kind == STATEMENT_IF &&
9541 true_stmt->ifs.false_statement != NULL) {
9542 warningf(&true_stmt->base.source_position,
9543 "suggest explicit braces to avoid ambiguous 'else'");
9551 * Check that all enums are handled in a switch.
9553 * @param statement the switch statement to check
9555 static void check_enum_cases(const switch_statement_t *statement)
9557 const type_t *type = skip_typeref(statement->expression->base.type);
9558 if (! is_type_enum(type))
9560 const enum_type_t *enumt = &type->enumt;
9562 /* if we have a default, no warnings */
9563 if (statement->default_label != NULL)
9566 /* FIXME: calculation of value should be done while parsing */
9567 /* TODO: quadratic algorithm here. Change to an n log n one */
9568 long last_value = -1;
9569 const entity_t *entry = enumt->enume->base.next;
9570 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9571 entry = entry->base.next) {
9572 const expression_t *expression = entry->enum_value.value;
9573 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9575 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9576 if (l->expression == NULL)
9578 if (l->first_case <= value && value <= l->last_case) {
9584 warningf(&statement->base.source_position,
9585 "enumeration value '%Y' not handled in switch",
9586 entry->base.symbol);
9593 * Parse a switch statement.
9595 static statement_t *parse_switch(void)
9597 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9601 PUSH_PARENT(statement);
9603 expect('(', end_error);
9604 add_anchor_token(')');
9605 expression_t *const expr = parse_expression();
9606 mark_vars_read(expr, NULL);
9607 type_t * type = skip_typeref(expr->base.type);
9608 if (is_type_integer(type)) {
9609 type = promote_integer(type);
9610 if (warning.traditional) {
9611 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9612 warningf(&expr->base.source_position,
9613 "'%T' switch expression not converted to '%T' in ISO C",
9617 } else if (is_type_valid(type)) {
9618 errorf(&expr->base.source_position,
9619 "switch quantity is not an integer, but '%T'", type);
9620 type = type_error_type;
9622 statement->switchs.expression = create_implicit_cast(expr, type);
9623 expect(')', end_error);
9624 rem_anchor_token(')');
9626 switch_statement_t *rem = current_switch;
9627 current_switch = &statement->switchs;
9628 statement->switchs.body = parse_statement();
9629 current_switch = rem;
9631 if (warning.switch_default &&
9632 statement->switchs.default_label == NULL) {
9633 warningf(&statement->base.source_position, "switch has no default case");
9635 if (warning.switch_enum)
9636 check_enum_cases(&statement->switchs);
9642 return create_invalid_statement();
9645 static statement_t *parse_loop_body(statement_t *const loop)
9647 statement_t *const rem = current_loop;
9648 current_loop = loop;
9650 statement_t *const body = parse_statement();
9657 * Parse a while statement.
9659 static statement_t *parse_while(void)
9661 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9665 PUSH_PARENT(statement);
9667 expect('(', end_error);
9668 add_anchor_token(')');
9669 expression_t *const cond = parse_expression();
9670 statement->whiles.condition = cond;
9671 /* §6.8.5:2 The controlling expression of an iteration statement shall
9672 * have scalar type. */
9673 semantic_condition(cond, "condition of 'while'-statement");
9674 mark_vars_read(cond, NULL);
9675 rem_anchor_token(')');
9676 expect(')', end_error);
9678 statement->whiles.body = parse_loop_body(statement);
9684 return create_invalid_statement();
9688 * Parse a do statement.
9690 static statement_t *parse_do(void)
9692 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9696 PUSH_PARENT(statement);
9698 add_anchor_token(T_while);
9699 statement->do_while.body = parse_loop_body(statement);
9700 rem_anchor_token(T_while);
9702 expect(T_while, end_error);
9703 expect('(', end_error);
9704 add_anchor_token(')');
9705 expression_t *const cond = parse_expression();
9706 statement->do_while.condition = cond;
9707 /* §6.8.5:2 The controlling expression of an iteration statement shall
9708 * have scalar type. */
9709 semantic_condition(cond, "condition of 'do-while'-statement");
9710 mark_vars_read(cond, NULL);
9711 rem_anchor_token(')');
9712 expect(')', end_error);
9713 expect(';', end_error);
9719 return create_invalid_statement();
9723 * Parse a for statement.
9725 static statement_t *parse_for(void)
9727 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9731 expect('(', end_error1);
9732 add_anchor_token(')');
9734 PUSH_PARENT(statement);
9736 size_t const top = environment_top();
9737 scope_t *old_scope = scope_push(&statement->fors.scope);
9739 bool old_gcc_extension = in_gcc_extension;
9740 while (next_if(T___extension__)) {
9741 in_gcc_extension = true;
9745 } else if (is_declaration_specifier(&token, false)) {
9746 parse_declaration(record_entity, DECL_FLAGS_NONE);
9748 add_anchor_token(';');
9749 expression_t *const init = parse_expression();
9750 statement->fors.initialisation = init;
9751 mark_vars_read(init, ENT_ANY);
9752 if (warning.unused_value && !expression_has_effect(init)) {
9753 warningf(&init->base.source_position,
9754 "initialisation of 'for'-statement has no effect");
9756 rem_anchor_token(';');
9757 expect(';', end_error2);
9759 in_gcc_extension = old_gcc_extension;
9761 if (token.type != ';') {
9762 add_anchor_token(';');
9763 expression_t *const cond = parse_expression();
9764 statement->fors.condition = cond;
9765 /* §6.8.5:2 The controlling expression of an iteration statement
9766 * shall have scalar type. */
9767 semantic_condition(cond, "condition of 'for'-statement");
9768 mark_vars_read(cond, NULL);
9769 rem_anchor_token(';');
9771 expect(';', end_error2);
9772 if (token.type != ')') {
9773 expression_t *const step = parse_expression();
9774 statement->fors.step = step;
9775 mark_vars_read(step, ENT_ANY);
9776 if (warning.unused_value && !expression_has_effect(step)) {
9777 warningf(&step->base.source_position,
9778 "step of 'for'-statement has no effect");
9781 expect(')', end_error2);
9782 rem_anchor_token(')');
9783 statement->fors.body = parse_loop_body(statement);
9785 assert(current_scope == &statement->fors.scope);
9786 scope_pop(old_scope);
9787 environment_pop_to(top);
9794 rem_anchor_token(')');
9795 assert(current_scope == &statement->fors.scope);
9796 scope_pop(old_scope);
9797 environment_pop_to(top);
9801 return create_invalid_statement();
9805 * Parse a goto statement.
9807 static statement_t *parse_goto(void)
9809 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9812 if (GNU_MODE && next_if('*')) {
9813 expression_t *expression = parse_expression();
9814 mark_vars_read(expression, NULL);
9816 /* Argh: although documentation says the expression must be of type void*,
9817 * gcc accepts anything that can be casted into void* without error */
9818 type_t *type = expression->base.type;
9820 if (type != type_error_type) {
9821 if (!is_type_pointer(type) && !is_type_integer(type)) {
9822 errorf(&expression->base.source_position,
9823 "cannot convert to a pointer type");
9824 } else if (warning.other && type != type_void_ptr) {
9825 warningf(&expression->base.source_position,
9826 "type of computed goto expression should be 'void*' not '%T'", type);
9828 expression = create_implicit_cast(expression, type_void_ptr);
9831 statement->gotos.expression = expression;
9832 } else if (token.type == T_IDENTIFIER) {
9833 symbol_t *symbol = token.symbol;
9835 statement->gotos.label = get_label(symbol);
9838 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9840 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9842 return create_invalid_statement();
9845 /* remember the goto's in a list for later checking */
9846 *goto_anchor = &statement->gotos;
9847 goto_anchor = &statement->gotos.next;
9849 expect(';', end_error);
9856 * Parse a continue statement.
9858 static statement_t *parse_continue(void)
9860 if (current_loop == NULL) {
9861 errorf(HERE, "continue statement not within loop");
9864 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9867 expect(';', end_error);
9874 * Parse a break statement.
9876 static statement_t *parse_break(void)
9878 if (current_switch == NULL && current_loop == NULL) {
9879 errorf(HERE, "break statement not within loop or switch");
9882 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9885 expect(';', end_error);
9892 * Parse a __leave statement.
9894 static statement_t *parse_leave_statement(void)
9896 if (current_try == NULL) {
9897 errorf(HERE, "__leave statement not within __try");
9900 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9903 expect(';', end_error);
9910 * Check if a given entity represents a local variable.
9912 static bool is_local_variable(const entity_t *entity)
9914 if (entity->kind != ENTITY_VARIABLE)
9917 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9918 case STORAGE_CLASS_AUTO:
9919 case STORAGE_CLASS_REGISTER: {
9920 const type_t *type = skip_typeref(entity->declaration.type);
9921 if (is_type_function(type)) {
9933 * Check if a given expression represents a local variable.
9935 static bool expression_is_local_variable(const expression_t *expression)
9937 if (expression->base.kind != EXPR_REFERENCE) {
9940 const entity_t *entity = expression->reference.entity;
9941 return is_local_variable(entity);
9945 * Check if a given expression represents a local variable and
9946 * return its declaration then, else return NULL.
9948 entity_t *expression_is_variable(const expression_t *expression)
9950 if (expression->base.kind != EXPR_REFERENCE) {
9953 entity_t *entity = expression->reference.entity;
9954 if (entity->kind != ENTITY_VARIABLE)
9961 * Parse a return statement.
9963 static statement_t *parse_return(void)
9967 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9969 expression_t *return_value = NULL;
9970 if (token.type != ';') {
9971 return_value = parse_expression();
9972 mark_vars_read(return_value, NULL);
9975 const type_t *const func_type = skip_typeref(current_function->base.type);
9976 assert(is_type_function(func_type));
9977 type_t *const return_type = skip_typeref(func_type->function.return_type);
9979 source_position_t const *const pos = &statement->base.source_position;
9980 if (return_value != NULL) {
9981 type_t *return_value_type = skip_typeref(return_value->base.type);
9983 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9984 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9985 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9986 /* Only warn in C mode, because GCC does the same */
9987 if (c_mode & _CXX || strict_mode) {
9989 "'return' with a value, in function returning 'void'");
9990 } else if (warning.other) {
9992 "'return' with a value, in function returning 'void'");
9994 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9995 /* Only warn in C mode, because GCC does the same */
9998 "'return' with expression in function returning 'void'");
9999 } else if (warning.other) {
10001 "'return' with expression in function returning 'void'");
10005 assign_error_t error = semantic_assign(return_type, return_value);
10006 report_assign_error(error, return_type, return_value, "'return'",
10009 return_value = create_implicit_cast(return_value, return_type);
10010 /* check for returning address of a local var */
10011 if (warning.other && return_value != NULL
10012 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10013 const expression_t *expression = return_value->unary.value;
10014 if (expression_is_local_variable(expression)) {
10015 warningf(pos, "function returns address of local variable");
10018 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10019 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10020 if (c_mode & _CXX || strict_mode) {
10022 "'return' without value, in function returning non-void");
10025 "'return' without value, in function returning non-void");
10028 statement->returns.value = return_value;
10030 expect(';', end_error);
10037 * Parse a declaration statement.
10039 static statement_t *parse_declaration_statement(void)
10041 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10043 entity_t *before = current_scope->last_entity;
10045 parse_external_declaration();
10047 parse_declaration(record_entity, DECL_FLAGS_NONE);
10050 declaration_statement_t *const decl = &statement->declaration;
10051 entity_t *const begin =
10052 before != NULL ? before->base.next : current_scope->entities;
10053 decl->declarations_begin = begin;
10054 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10060 * Parse an expression statement, ie. expr ';'.
10062 static statement_t *parse_expression_statement(void)
10064 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10066 expression_t *const expr = parse_expression();
10067 statement->expression.expression = expr;
10068 mark_vars_read(expr, ENT_ANY);
10070 expect(';', end_error);
10077 * Parse a microsoft __try { } __finally { } or
10078 * __try{ } __except() { }
10080 static statement_t *parse_ms_try_statment(void)
10082 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10085 PUSH_PARENT(statement);
10087 ms_try_statement_t *rem = current_try;
10088 current_try = &statement->ms_try;
10089 statement->ms_try.try_statement = parse_compound_statement(false);
10094 if (next_if(T___except)) {
10095 expect('(', end_error);
10096 add_anchor_token(')');
10097 expression_t *const expr = parse_expression();
10098 mark_vars_read(expr, NULL);
10099 type_t * type = skip_typeref(expr->base.type);
10100 if (is_type_integer(type)) {
10101 type = promote_integer(type);
10102 } else if (is_type_valid(type)) {
10103 errorf(&expr->base.source_position,
10104 "__expect expression is not an integer, but '%T'", type);
10105 type = type_error_type;
10107 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10108 rem_anchor_token(')');
10109 expect(')', end_error);
10110 statement->ms_try.final_statement = parse_compound_statement(false);
10111 } else if (next_if(T__finally)) {
10112 statement->ms_try.final_statement = parse_compound_statement(false);
10114 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10115 return create_invalid_statement();
10119 return create_invalid_statement();
10122 static statement_t *parse_empty_statement(void)
10124 if (warning.empty_statement) {
10125 warningf(HERE, "statement is empty");
10127 statement_t *const statement = create_empty_statement();
10132 static statement_t *parse_local_label_declaration(void)
10134 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10138 entity_t *begin = NULL;
10139 entity_t *end = NULL;
10140 entity_t **anchor = &begin;
10142 if (token.type != T_IDENTIFIER) {
10143 parse_error_expected("while parsing local label declaration",
10144 T_IDENTIFIER, NULL);
10147 symbol_t *symbol = token.symbol;
10148 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10149 if (entity != NULL && entity->base.parent_scope == current_scope) {
10150 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10151 symbol, &entity->base.source_position);
10153 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10155 entity->base.parent_scope = current_scope;
10156 entity->base.namespc = NAMESPACE_LABEL;
10157 entity->base.source_position = token.source_position;
10158 entity->base.symbol = symbol;
10161 anchor = &entity->base.next;
10164 environment_push(entity);
10167 } while (next_if(','));
10168 expect(';', end_error);
10170 statement->declaration.declarations_begin = begin;
10171 statement->declaration.declarations_end = end;
10175 static void parse_namespace_definition(void)
10179 entity_t *entity = NULL;
10180 symbol_t *symbol = NULL;
10182 if (token.type == T_IDENTIFIER) {
10183 symbol = token.symbol;
10186 entity = get_entity(symbol, NAMESPACE_NORMAL);
10188 && entity->kind != ENTITY_NAMESPACE
10189 && entity->base.parent_scope == current_scope) {
10190 if (is_entity_valid(entity)) {
10191 error_redefined_as_different_kind(&token.source_position,
10192 entity, ENTITY_NAMESPACE);
10198 if (entity == NULL) {
10199 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10200 entity->base.symbol = symbol;
10201 entity->base.source_position = token.source_position;
10202 entity->base.namespc = NAMESPACE_NORMAL;
10203 entity->base.parent_scope = current_scope;
10206 if (token.type == '=') {
10207 /* TODO: parse namespace alias */
10208 panic("namespace alias definition not supported yet");
10211 environment_push(entity);
10212 append_entity(current_scope, entity);
10214 size_t const top = environment_top();
10215 scope_t *old_scope = scope_push(&entity->namespacee.members);
10217 entity_t *old_current_entity = current_entity;
10218 current_entity = entity;
10220 expect('{', end_error);
10222 expect('}', end_error);
10225 assert(current_scope == &entity->namespacee.members);
10226 assert(current_entity == entity);
10227 current_entity = old_current_entity;
10228 scope_pop(old_scope);
10229 environment_pop_to(top);
10233 * Parse a statement.
10234 * There's also parse_statement() which additionally checks for
10235 * "statement has no effect" warnings
10237 static statement_t *intern_parse_statement(void)
10239 statement_t *statement = NULL;
10241 /* declaration or statement */
10242 add_anchor_token(';');
10243 switch (token.type) {
10244 case T_IDENTIFIER: {
10245 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10246 if (la1_type == ':') {
10247 statement = parse_label_statement();
10248 } else if (is_typedef_symbol(token.symbol)) {
10249 statement = parse_declaration_statement();
10251 /* it's an identifier, the grammar says this must be an
10252 * expression statement. However it is common that users mistype
10253 * declaration types, so we guess a bit here to improve robustness
10254 * for incorrect programs */
10255 switch (la1_type) {
10258 if (get_entity(token.symbol, NAMESPACE_NORMAL) != NULL) {
10260 statement = parse_expression_statement();
10264 statement = parse_declaration_statement();
10272 case T___extension__:
10273 /* This can be a prefix to a declaration or an expression statement.
10274 * We simply eat it now and parse the rest with tail recursion. */
10275 while (next_if(T___extension__)) {}
10276 bool old_gcc_extension = in_gcc_extension;
10277 in_gcc_extension = true;
10278 statement = intern_parse_statement();
10279 in_gcc_extension = old_gcc_extension;
10283 statement = parse_declaration_statement();
10287 statement = parse_local_label_declaration();
10290 case ';': statement = parse_empty_statement(); break;
10291 case '{': statement = parse_compound_statement(false); break;
10292 case T___leave: statement = parse_leave_statement(); break;
10293 case T___try: statement = parse_ms_try_statment(); break;
10294 case T_asm: statement = parse_asm_statement(); break;
10295 case T_break: statement = parse_break(); break;
10296 case T_case: statement = parse_case_statement(); break;
10297 case T_continue: statement = parse_continue(); break;
10298 case T_default: statement = parse_default_statement(); break;
10299 case T_do: statement = parse_do(); break;
10300 case T_for: statement = parse_for(); break;
10301 case T_goto: statement = parse_goto(); break;
10302 case T_if: statement = parse_if(); break;
10303 case T_return: statement = parse_return(); break;
10304 case T_switch: statement = parse_switch(); break;
10305 case T_while: statement = parse_while(); break;
10308 statement = parse_expression_statement();
10312 errorf(HERE, "unexpected token %K while parsing statement", &token);
10313 statement = create_invalid_statement();
10318 rem_anchor_token(';');
10320 assert(statement != NULL
10321 && statement->base.source_position.input_name != NULL);
10327 * parse a statement and emits "statement has no effect" warning if needed
10328 * (This is really a wrapper around intern_parse_statement with check for 1
10329 * single warning. It is needed, because for statement expressions we have
10330 * to avoid the warning on the last statement)
10332 static statement_t *parse_statement(void)
10334 statement_t *statement = intern_parse_statement();
10336 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10337 expression_t *expression = statement->expression.expression;
10338 if (!expression_has_effect(expression)) {
10339 warningf(&expression->base.source_position,
10340 "statement has no effect");
10348 * Parse a compound statement.
10350 static statement_t *parse_compound_statement(bool inside_expression_statement)
10352 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10354 PUSH_PARENT(statement);
10357 add_anchor_token('}');
10358 /* tokens, which can start a statement */
10359 /* TODO MS, __builtin_FOO */
10360 add_anchor_token('!');
10361 add_anchor_token('&');
10362 add_anchor_token('(');
10363 add_anchor_token('*');
10364 add_anchor_token('+');
10365 add_anchor_token('-');
10366 add_anchor_token('{');
10367 add_anchor_token('~');
10368 add_anchor_token(T_CHARACTER_CONSTANT);
10369 add_anchor_token(T_COLONCOLON);
10370 add_anchor_token(T_FLOATINGPOINT);
10371 add_anchor_token(T_IDENTIFIER);
10372 add_anchor_token(T_INTEGER);
10373 add_anchor_token(T_MINUSMINUS);
10374 add_anchor_token(T_PLUSPLUS);
10375 add_anchor_token(T_STRING_LITERAL);
10376 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10377 add_anchor_token(T_WIDE_STRING_LITERAL);
10378 add_anchor_token(T__Bool);
10379 add_anchor_token(T__Complex);
10380 add_anchor_token(T__Imaginary);
10381 add_anchor_token(T___FUNCTION__);
10382 add_anchor_token(T___PRETTY_FUNCTION__);
10383 add_anchor_token(T___alignof__);
10384 add_anchor_token(T___attribute__);
10385 add_anchor_token(T___builtin_va_start);
10386 add_anchor_token(T___extension__);
10387 add_anchor_token(T___func__);
10388 add_anchor_token(T___imag__);
10389 add_anchor_token(T___label__);
10390 add_anchor_token(T___real__);
10391 add_anchor_token(T___thread);
10392 add_anchor_token(T_asm);
10393 add_anchor_token(T_auto);
10394 add_anchor_token(T_bool);
10395 add_anchor_token(T_break);
10396 add_anchor_token(T_case);
10397 add_anchor_token(T_char);
10398 add_anchor_token(T_class);
10399 add_anchor_token(T_const);
10400 add_anchor_token(T_const_cast);
10401 add_anchor_token(T_continue);
10402 add_anchor_token(T_default);
10403 add_anchor_token(T_delete);
10404 add_anchor_token(T_double);
10405 add_anchor_token(T_do);
10406 add_anchor_token(T_dynamic_cast);
10407 add_anchor_token(T_enum);
10408 add_anchor_token(T_extern);
10409 add_anchor_token(T_false);
10410 add_anchor_token(T_float);
10411 add_anchor_token(T_for);
10412 add_anchor_token(T_goto);
10413 add_anchor_token(T_if);
10414 add_anchor_token(T_inline);
10415 add_anchor_token(T_int);
10416 add_anchor_token(T_long);
10417 add_anchor_token(T_new);
10418 add_anchor_token(T_operator);
10419 add_anchor_token(T_register);
10420 add_anchor_token(T_reinterpret_cast);
10421 add_anchor_token(T_restrict);
10422 add_anchor_token(T_return);
10423 add_anchor_token(T_short);
10424 add_anchor_token(T_signed);
10425 add_anchor_token(T_sizeof);
10426 add_anchor_token(T_static);
10427 add_anchor_token(T_static_cast);
10428 add_anchor_token(T_struct);
10429 add_anchor_token(T_switch);
10430 add_anchor_token(T_template);
10431 add_anchor_token(T_this);
10432 add_anchor_token(T_throw);
10433 add_anchor_token(T_true);
10434 add_anchor_token(T_try);
10435 add_anchor_token(T_typedef);
10436 add_anchor_token(T_typeid);
10437 add_anchor_token(T_typename);
10438 add_anchor_token(T_typeof);
10439 add_anchor_token(T_union);
10440 add_anchor_token(T_unsigned);
10441 add_anchor_token(T_using);
10442 add_anchor_token(T_void);
10443 add_anchor_token(T_volatile);
10444 add_anchor_token(T_wchar_t);
10445 add_anchor_token(T_while);
10447 size_t const top = environment_top();
10448 scope_t *old_scope = scope_push(&statement->compound.scope);
10450 statement_t **anchor = &statement->compound.statements;
10451 bool only_decls_so_far = true;
10452 while (token.type != '}') {
10453 if (token.type == T_EOF) {
10454 errorf(&statement->base.source_position,
10455 "EOF while parsing compound statement");
10458 statement_t *sub_statement = intern_parse_statement();
10459 if (is_invalid_statement(sub_statement)) {
10460 /* an error occurred. if we are at an anchor, return */
10466 if (warning.declaration_after_statement) {
10467 if (sub_statement->kind != STATEMENT_DECLARATION) {
10468 only_decls_so_far = false;
10469 } else if (!only_decls_so_far) {
10470 warningf(&sub_statement->base.source_position,
10471 "ISO C90 forbids mixed declarations and code");
10475 *anchor = sub_statement;
10477 while (sub_statement->base.next != NULL)
10478 sub_statement = sub_statement->base.next;
10480 anchor = &sub_statement->base.next;
10484 /* look over all statements again to produce no effect warnings */
10485 if (warning.unused_value) {
10486 statement_t *sub_statement = statement->compound.statements;
10487 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10488 if (sub_statement->kind != STATEMENT_EXPRESSION)
10490 /* don't emit a warning for the last expression in an expression
10491 * statement as it has always an effect */
10492 if (inside_expression_statement && sub_statement->base.next == NULL)
10495 expression_t *expression = sub_statement->expression.expression;
10496 if (!expression_has_effect(expression)) {
10497 warningf(&expression->base.source_position,
10498 "statement has no effect");
10504 rem_anchor_token(T_while);
10505 rem_anchor_token(T_wchar_t);
10506 rem_anchor_token(T_volatile);
10507 rem_anchor_token(T_void);
10508 rem_anchor_token(T_using);
10509 rem_anchor_token(T_unsigned);
10510 rem_anchor_token(T_union);
10511 rem_anchor_token(T_typeof);
10512 rem_anchor_token(T_typename);
10513 rem_anchor_token(T_typeid);
10514 rem_anchor_token(T_typedef);
10515 rem_anchor_token(T_try);
10516 rem_anchor_token(T_true);
10517 rem_anchor_token(T_throw);
10518 rem_anchor_token(T_this);
10519 rem_anchor_token(T_template);
10520 rem_anchor_token(T_switch);
10521 rem_anchor_token(T_struct);
10522 rem_anchor_token(T_static_cast);
10523 rem_anchor_token(T_static);
10524 rem_anchor_token(T_sizeof);
10525 rem_anchor_token(T_signed);
10526 rem_anchor_token(T_short);
10527 rem_anchor_token(T_return);
10528 rem_anchor_token(T_restrict);
10529 rem_anchor_token(T_reinterpret_cast);
10530 rem_anchor_token(T_register);
10531 rem_anchor_token(T_operator);
10532 rem_anchor_token(T_new);
10533 rem_anchor_token(T_long);
10534 rem_anchor_token(T_int);
10535 rem_anchor_token(T_inline);
10536 rem_anchor_token(T_if);
10537 rem_anchor_token(T_goto);
10538 rem_anchor_token(T_for);
10539 rem_anchor_token(T_float);
10540 rem_anchor_token(T_false);
10541 rem_anchor_token(T_extern);
10542 rem_anchor_token(T_enum);
10543 rem_anchor_token(T_dynamic_cast);
10544 rem_anchor_token(T_do);
10545 rem_anchor_token(T_double);
10546 rem_anchor_token(T_delete);
10547 rem_anchor_token(T_default);
10548 rem_anchor_token(T_continue);
10549 rem_anchor_token(T_const_cast);
10550 rem_anchor_token(T_const);
10551 rem_anchor_token(T_class);
10552 rem_anchor_token(T_char);
10553 rem_anchor_token(T_case);
10554 rem_anchor_token(T_break);
10555 rem_anchor_token(T_bool);
10556 rem_anchor_token(T_auto);
10557 rem_anchor_token(T_asm);
10558 rem_anchor_token(T___thread);
10559 rem_anchor_token(T___real__);
10560 rem_anchor_token(T___label__);
10561 rem_anchor_token(T___imag__);
10562 rem_anchor_token(T___func__);
10563 rem_anchor_token(T___extension__);
10564 rem_anchor_token(T___builtin_va_start);
10565 rem_anchor_token(T___attribute__);
10566 rem_anchor_token(T___alignof__);
10567 rem_anchor_token(T___PRETTY_FUNCTION__);
10568 rem_anchor_token(T___FUNCTION__);
10569 rem_anchor_token(T__Imaginary);
10570 rem_anchor_token(T__Complex);
10571 rem_anchor_token(T__Bool);
10572 rem_anchor_token(T_WIDE_STRING_LITERAL);
10573 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10574 rem_anchor_token(T_STRING_LITERAL);
10575 rem_anchor_token(T_PLUSPLUS);
10576 rem_anchor_token(T_MINUSMINUS);
10577 rem_anchor_token(T_INTEGER);
10578 rem_anchor_token(T_IDENTIFIER);
10579 rem_anchor_token(T_FLOATINGPOINT);
10580 rem_anchor_token(T_COLONCOLON);
10581 rem_anchor_token(T_CHARACTER_CONSTANT);
10582 rem_anchor_token('~');
10583 rem_anchor_token('{');
10584 rem_anchor_token('-');
10585 rem_anchor_token('+');
10586 rem_anchor_token('*');
10587 rem_anchor_token('(');
10588 rem_anchor_token('&');
10589 rem_anchor_token('!');
10590 rem_anchor_token('}');
10591 assert(current_scope == &statement->compound.scope);
10592 scope_pop(old_scope);
10593 environment_pop_to(top);
10600 * Check for unused global static functions and variables
10602 static void check_unused_globals(void)
10604 if (!warning.unused_function && !warning.unused_variable)
10607 for (const entity_t *entity = file_scope->entities; entity != NULL;
10608 entity = entity->base.next) {
10609 if (!is_declaration(entity))
10612 const declaration_t *declaration = &entity->declaration;
10613 if (declaration->used ||
10614 declaration->modifiers & DM_UNUSED ||
10615 declaration->modifiers & DM_USED ||
10616 declaration->storage_class != STORAGE_CLASS_STATIC)
10619 type_t *const type = declaration->type;
10621 if (entity->kind == ENTITY_FUNCTION) {
10622 /* inhibit warning for static inline functions */
10623 if (entity->function.is_inline)
10626 s = entity->function.statement != NULL ? "defined" : "declared";
10631 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10632 type, declaration->base.symbol, s);
10636 static void parse_global_asm(void)
10638 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10641 expect('(', end_error);
10643 statement->asms.asm_text = parse_string_literals();
10644 statement->base.next = unit->global_asm;
10645 unit->global_asm = statement;
10647 expect(')', end_error);
10648 expect(';', end_error);
10653 static void parse_linkage_specification(void)
10656 assert(token.type == T_STRING_LITERAL);
10658 const char *linkage = parse_string_literals().begin;
10660 linkage_kind_t old_linkage = current_linkage;
10661 linkage_kind_t new_linkage;
10662 if (strcmp(linkage, "C") == 0) {
10663 new_linkage = LINKAGE_C;
10664 } else if (strcmp(linkage, "C++") == 0) {
10665 new_linkage = LINKAGE_CXX;
10667 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10668 new_linkage = LINKAGE_INVALID;
10670 current_linkage = new_linkage;
10672 if (next_if('{')) {
10674 expect('}', end_error);
10680 assert(current_linkage == new_linkage);
10681 current_linkage = old_linkage;
10684 static void parse_external(void)
10686 switch (token.type) {
10687 DECLARATION_START_NO_EXTERN
10689 case T___extension__:
10690 /* tokens below are for implicit int */
10691 case '&': /* & x; -> int& x; (and error later, because C++ has no
10693 case '*': /* * x; -> int* x; */
10694 case '(': /* (x); -> int (x); */
10695 parse_external_declaration();
10699 if (look_ahead(1)->type == T_STRING_LITERAL) {
10700 parse_linkage_specification();
10702 parse_external_declaration();
10707 parse_global_asm();
10711 parse_namespace_definition();
10715 if (!strict_mode) {
10717 warningf(HERE, "stray ';' outside of function");
10724 errorf(HERE, "stray %K outside of function", &token);
10725 if (token.type == '(' || token.type == '{' || token.type == '[')
10726 eat_until_matching_token(token.type);
10732 static void parse_externals(void)
10734 add_anchor_token('}');
10735 add_anchor_token(T_EOF);
10738 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10739 unsigned char token_anchor_copy[T_LAST_TOKEN];
10740 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10743 while (token.type != T_EOF && token.type != '}') {
10745 bool anchor_leak = false;
10746 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10747 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10749 /* the anchor set and its copy differs */
10750 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10751 anchor_leak = true;
10754 if (in_gcc_extension) {
10755 /* an gcc extension scope was not closed */
10756 errorf(HERE, "Leaked __extension__");
10757 anchor_leak = true;
10767 rem_anchor_token(T_EOF);
10768 rem_anchor_token('}');
10772 * Parse a translation unit.
10774 static void parse_translation_unit(void)
10776 add_anchor_token(T_EOF);
10781 if (token.type == T_EOF)
10784 errorf(HERE, "stray %K outside of function", &token);
10785 if (token.type == '(' || token.type == '{' || token.type == '[')
10786 eat_until_matching_token(token.type);
10794 * @return the translation unit or NULL if errors occurred.
10796 void start_parsing(void)
10798 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10799 label_stack = NEW_ARR_F(stack_entry_t, 0);
10800 diagnostic_count = 0;
10804 print_to_file(stderr);
10806 assert(unit == NULL);
10807 unit = allocate_ast_zero(sizeof(unit[0]));
10809 assert(file_scope == NULL);
10810 file_scope = &unit->scope;
10812 assert(current_scope == NULL);
10813 scope_push(&unit->scope);
10815 create_gnu_builtins();
10817 create_microsoft_intrinsics();
10820 translation_unit_t *finish_parsing(void)
10822 assert(current_scope == &unit->scope);
10825 assert(file_scope == &unit->scope);
10826 check_unused_globals();
10829 DEL_ARR_F(environment_stack);
10830 DEL_ARR_F(label_stack);
10832 translation_unit_t *result = unit;
10837 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10838 * are given length one. */
10839 static void complete_incomplete_arrays(void)
10841 size_t n = ARR_LEN(incomplete_arrays);
10842 for (size_t i = 0; i != n; ++i) {
10843 declaration_t *const decl = incomplete_arrays[i];
10844 type_t *const orig_type = decl->type;
10845 type_t *const type = skip_typeref(orig_type);
10847 if (!is_type_incomplete(type))
10850 if (warning.other) {
10851 warningf(&decl->base.source_position,
10852 "array '%#T' assumed to have one element",
10853 orig_type, decl->base.symbol);
10856 type_t *const new_type = duplicate_type(type);
10857 new_type->array.size_constant = true;
10858 new_type->array.has_implicit_size = true;
10859 new_type->array.size = 1;
10861 type_t *const result = identify_new_type(new_type);
10863 decl->type = result;
10867 void prepare_main_collect2(entity_t *entity)
10869 // create call to __main
10870 symbol_t *symbol = symbol_table_insert("__main");
10871 entity_t *subsubmain_ent
10872 = create_implicit_function(symbol, &builtin_source_position);
10874 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10875 type_t *ftype = subsubmain_ent->declaration.type;
10876 ref->base.source_position = builtin_source_position;
10877 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10878 ref->reference.entity = subsubmain_ent;
10880 expression_t *call = allocate_expression_zero(EXPR_CALL);
10881 call->base.source_position = builtin_source_position;
10882 call->base.type = type_void;
10883 call->call.function = ref;
10885 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10886 expr_statement->base.source_position = builtin_source_position;
10887 expr_statement->expression.expression = call;
10889 statement_t *statement = entity->function.statement;
10890 assert(statement->kind == STATEMENT_COMPOUND);
10891 compound_statement_t *compounds = &statement->compound;
10893 expr_statement->base.next = compounds->statements;
10894 compounds->statements = expr_statement;
10899 lookahead_bufpos = 0;
10900 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10903 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10904 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10905 parse_translation_unit();
10906 complete_incomplete_arrays();
10907 DEL_ARR_F(incomplete_arrays);
10908 incomplete_arrays = NULL;
10912 * Initialize the parser.
10914 void init_parser(void)
10916 sym_anonymous = symbol_table_insert("<anonymous>");
10918 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10920 init_expression_parsers();
10921 obstack_init(&temp_obst);
10923 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10924 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10928 * Terminate the parser.
10930 void exit_parser(void)
10932 obstack_free(&temp_obst, NULL);