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 switch_statement_t *current_switch = NULL;
93 static statement_t *current_loop = NULL;
94 static statement_t *current_parent = NULL;
95 static ms_try_statement_t *current_try = NULL;
96 static linkage_kind_t current_linkage = LINKAGE_INVALID;
97 static goto_statement_t *goto_first = NULL;
98 static goto_statement_t **goto_anchor = NULL;
99 static label_statement_t *label_first = NULL;
100 static label_statement_t **label_anchor = NULL;
101 /** current translation unit. */
102 static translation_unit_t *unit = NULL;
103 /** true if we are in an __extension__ context. */
104 static bool in_gcc_extension = false;
105 static struct obstack temp_obst;
106 static entity_t *anonymous_entity;
107 static declaration_t **incomplete_arrays;
108 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
111 #define PUSH_PARENT(stmt) \
112 statement_t *const new_parent = (stmt); \
113 statement_t *const old_parent = current_parent; \
114 ((void)(current_parent = new_parent))
115 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
117 #define PUSH_SCOPE(scope) \
118 size_t const top = environment_top(); \
119 scope_t *const new_scope = (scope); \
120 scope_t *const old_scope = scope_push(new_scope)
121 #define POP_SCOPE() (assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top))
123 #define PUSH_EXTENSION() \
125 bool const old_gcc_extension = in_gcc_extension; \
126 while (next_if(T___extension__)) { \
127 in_gcc_extension = true; \
130 #define POP_EXTENSION() \
131 ((void)(in_gcc_extension = old_gcc_extension))
133 /** special symbol used for anonymous entities. */
134 static symbol_t *sym_anonymous = NULL;
136 /** The token anchor set */
137 static unsigned short token_anchor_set[T_LAST_TOKEN];
139 /** The current source position. */
140 #define HERE (&token.base.source_position)
142 /** true if we are in GCC mode. */
143 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
145 static statement_t *parse_compound_statement(bool inside_expression_statement);
146 static statement_t *parse_statement(void);
148 static expression_t *parse_subexpression(precedence_t);
149 static expression_t *parse_expression(void);
150 static type_t *parse_typename(void);
151 static void parse_externals(void);
152 static void parse_external(void);
154 static void parse_compound_type_entries(compound_t *compound_declaration);
156 static void check_call_argument(type_t *expected_type,
157 call_argument_t *argument, unsigned pos);
159 typedef enum declarator_flags_t {
161 DECL_MAY_BE_ABSTRACT = 1U << 0,
162 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
163 DECL_IS_PARAMETER = 1U << 2
164 } declarator_flags_t;
166 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
167 declarator_flags_t flags);
169 static void semantic_comparison(binary_expression_t *expression);
171 #define STORAGE_CLASSES \
172 STORAGE_CLASSES_NO_EXTERN \
175 #define STORAGE_CLASSES_NO_EXTERN \
182 #define TYPE_QUALIFIERS \
187 case T__forceinline: \
188 case T___attribute__:
190 #define COMPLEX_SPECIFIERS \
192 #define IMAGINARY_SPECIFIERS \
195 #define TYPE_SPECIFIERS \
197 case T___builtin_va_list: \
222 #define DECLARATION_START \
227 #define DECLARATION_START_NO_EXTERN \
228 STORAGE_CLASSES_NO_EXTERN \
232 #define EXPRESSION_START \
241 case T_CHARACTER_CONSTANT: \
242 case T_FLOATINGPOINT: \
243 case T_FLOATINGPOINT_HEXADECIMAL: \
245 case T_INTEGER_HEXADECIMAL: \
246 case T_INTEGER_OCTAL: \
249 case T_STRING_LITERAL: \
250 case T_WIDE_CHARACTER_CONSTANT: \
251 case T_WIDE_STRING_LITERAL: \
252 case T___FUNCDNAME__: \
253 case T___FUNCSIG__: \
254 case T___FUNCTION__: \
255 case T___PRETTY_FUNCTION__: \
256 case T___alignof__: \
257 case T___builtin_classify_type: \
258 case T___builtin_constant_p: \
259 case T___builtin_isgreater: \
260 case T___builtin_isgreaterequal: \
261 case T___builtin_isless: \
262 case T___builtin_islessequal: \
263 case T___builtin_islessgreater: \
264 case T___builtin_isunordered: \
265 case T___builtin_offsetof: \
266 case T___builtin_va_arg: \
267 case T___builtin_va_copy: \
268 case T___builtin_va_start: \
279 * Returns the size of a statement node.
281 * @param kind the statement kind
283 static size_t get_statement_struct_size(statement_kind_t kind)
285 static const size_t sizes[] = {
286 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
287 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
288 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
289 [STATEMENT_RETURN] = sizeof(return_statement_t),
290 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
291 [STATEMENT_IF] = sizeof(if_statement_t),
292 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
293 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
294 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
295 [STATEMENT_BREAK] = sizeof(statement_base_t),
296 [STATEMENT_GOTO] = sizeof(goto_statement_t),
297 [STATEMENT_LABEL] = sizeof(label_statement_t),
298 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
299 [STATEMENT_WHILE] = sizeof(while_statement_t),
300 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
301 [STATEMENT_FOR] = sizeof(for_statement_t),
302 [STATEMENT_ASM] = sizeof(asm_statement_t),
303 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
304 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
306 assert((size_t)kind < lengthof(sizes));
307 assert(sizes[kind] != 0);
312 * Returns the size of an expression node.
314 * @param kind the expression kind
316 static size_t get_expression_struct_size(expression_kind_t kind)
318 static const size_t sizes[] = {
319 [EXPR_INVALID] = sizeof(expression_base_t),
320 [EXPR_REFERENCE] = sizeof(reference_expression_t),
321 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
322 [EXPR_LITERAL_BOOLEAN] = sizeof(literal_expression_t),
323 [EXPR_LITERAL_INTEGER] = sizeof(literal_expression_t),
324 [EXPR_LITERAL_INTEGER_OCTAL] = sizeof(literal_expression_t),
325 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
326 [EXPR_LITERAL_FLOATINGPOINT] = sizeof(literal_expression_t),
327 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
328 [EXPR_LITERAL_CHARACTER] = sizeof(literal_expression_t),
329 [EXPR_LITERAL_WIDE_CHARACTER] = sizeof(literal_expression_t),
330 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
331 [EXPR_WIDE_STRING_LITERAL] = sizeof(string_literal_expression_t),
332 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
333 [EXPR_CALL] = sizeof(call_expression_t),
334 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
335 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
336 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
337 [EXPR_SELECT] = sizeof(select_expression_t),
338 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
339 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
340 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
341 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
342 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
343 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
344 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
345 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
346 [EXPR_VA_START] = sizeof(va_start_expression_t),
347 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
348 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
349 [EXPR_STATEMENT] = sizeof(statement_expression_t),
350 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
352 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
353 return sizes[EXPR_UNARY_FIRST];
355 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
356 return sizes[EXPR_BINARY_FIRST];
358 assert((size_t)kind < lengthof(sizes));
359 assert(sizes[kind] != 0);
364 * Allocate a statement node of given kind and initialize all
365 * fields with zero. Sets its source position to the position
366 * of the current token.
368 static statement_t *allocate_statement_zero(statement_kind_t kind)
370 size_t size = get_statement_struct_size(kind);
371 statement_t *res = allocate_ast_zero(size);
373 res->base.kind = kind;
374 res->base.parent = current_parent;
375 res->base.source_position = token.base.source_position;
380 * Allocate an expression node of given kind and initialize all
383 * @param kind the kind of the expression to allocate
385 static expression_t *allocate_expression_zero(expression_kind_t kind)
387 size_t size = get_expression_struct_size(kind);
388 expression_t *res = allocate_ast_zero(size);
390 res->base.kind = kind;
391 res->base.type = type_error_type;
392 res->base.source_position = token.base.source_position;
397 * Creates a new invalid expression at the source position
398 * of the current token.
400 static expression_t *create_invalid_expression(void)
402 return allocate_expression_zero(EXPR_INVALID);
406 * Creates a new invalid statement.
408 static statement_t *create_invalid_statement(void)
410 return allocate_statement_zero(STATEMENT_INVALID);
414 * Allocate a new empty statement.
416 static statement_t *create_empty_statement(void)
418 return allocate_statement_zero(STATEMENT_EMPTY);
422 * Returns the size of an initializer node.
424 * @param kind the initializer kind
426 static size_t get_initializer_size(initializer_kind_t kind)
428 static const size_t sizes[] = {
429 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
430 [INITIALIZER_STRING] = sizeof(initializer_string_t),
431 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
432 [INITIALIZER_LIST] = sizeof(initializer_list_t),
433 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
435 assert((size_t)kind < lengthof(sizes));
436 assert(sizes[kind] != 0);
441 * Allocate an initializer node of given kind and initialize all
444 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
446 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
453 * Returns the index of the top element of the environment stack.
455 static size_t environment_top(void)
457 return ARR_LEN(environment_stack);
461 * Returns the index of the top element of the global label stack.
463 static size_t label_top(void)
465 return ARR_LEN(label_stack);
469 * Return the next token.
471 static inline void next_token(void)
473 token = lookahead_buffer[lookahead_bufpos];
474 lookahead_buffer[lookahead_bufpos] = lexer_token;
477 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
480 print_token(stderr, &token);
481 fprintf(stderr, "\n");
485 static inline bool next_if(int const type)
487 if (token.kind == type) {
496 * Return the next token with a given lookahead.
498 static inline const token_t *look_ahead(size_t num)
500 assert(0 < num && num <= MAX_LOOKAHEAD);
501 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
502 return &lookahead_buffer[pos];
506 * Adds a token type to the token type anchor set (a multi-set).
508 static void add_anchor_token(int token_kind)
510 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
511 ++token_anchor_set[token_kind];
515 * Set the number of tokens types of the given type
516 * to zero and return the old count.
518 static int save_and_reset_anchor_state(int token_kind)
520 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
521 int count = token_anchor_set[token_kind];
522 token_anchor_set[token_kind] = 0;
527 * Restore the number of token types to the given count.
529 static void restore_anchor_state(int token_kind, int count)
531 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
532 token_anchor_set[token_kind] = count;
536 * Remove a token type from the token type anchor set (a multi-set).
538 static void rem_anchor_token(int token_kind)
540 assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
541 assert(token_anchor_set[token_kind] != 0);
542 --token_anchor_set[token_kind];
546 * Return true if the token type of the current token is
549 static bool at_anchor(void)
553 return token_anchor_set[token.kind];
557 * Eat tokens until a matching token type is found.
559 static void eat_until_matching_token(int type)
563 case '(': end_token = ')'; break;
564 case '{': end_token = '}'; break;
565 case '[': end_token = ']'; break;
566 default: end_token = type; break;
569 unsigned parenthesis_count = 0;
570 unsigned brace_count = 0;
571 unsigned bracket_count = 0;
572 while (token.kind != end_token ||
573 parenthesis_count != 0 ||
575 bracket_count != 0) {
576 switch (token.kind) {
578 case '(': ++parenthesis_count; break;
579 case '{': ++brace_count; break;
580 case '[': ++bracket_count; break;
583 if (parenthesis_count > 0)
593 if (bracket_count > 0)
596 if (token.kind == end_token &&
597 parenthesis_count == 0 &&
611 * Eat input tokens until an anchor is found.
613 static void eat_until_anchor(void)
615 while (token_anchor_set[token.kind] == 0) {
616 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
617 eat_until_matching_token(token.kind);
623 * Eat a whole block from input tokens.
625 static void eat_block(void)
627 eat_until_matching_token('{');
631 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
634 * Report a parse error because an expected token was not found.
637 #if defined __GNUC__ && __GNUC__ >= 4
638 __attribute__((sentinel))
640 void parse_error_expected(const char *message, ...)
642 if (message != NULL) {
643 errorf(HERE, "%s", message);
646 va_start(ap, message);
647 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
652 * Report an incompatible type.
654 static void type_error_incompatible(const char *msg,
655 const source_position_t *source_position, type_t *type1, type_t *type2)
657 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
662 * Expect the current token is the expected token.
663 * If not, generate an error, eat the current statement,
664 * and goto the error_label label.
666 #define expect(expected, error_label) \
668 if (UNLIKELY(token.kind != (expected))) { \
669 parse_error_expected(NULL, (expected), NULL); \
670 add_anchor_token(expected); \
671 eat_until_anchor(); \
672 rem_anchor_token(expected); \
673 if (token.kind != (expected)) \
680 * Push a given scope on the scope stack and make it the
683 static scope_t *scope_push(scope_t *new_scope)
685 if (current_scope != NULL) {
686 new_scope->depth = current_scope->depth + 1;
689 scope_t *old_scope = current_scope;
690 current_scope = new_scope;
695 * Pop the current scope from the scope stack.
697 static void scope_pop(scope_t *old_scope)
699 current_scope = old_scope;
703 * Search an entity by its symbol in a given namespace.
705 static entity_t *get_entity(const symbol_t *const symbol,
706 namespace_tag_t namespc)
708 assert(namespc != NAMESPACE_INVALID);
709 entity_t *entity = symbol->entity;
710 for (; entity != NULL; entity = entity->base.symbol_next) {
711 if ((namespace_tag_t)entity->base.namespc == namespc)
718 /* §6.2.3:1 24) There is only one name space for tags even though three are
720 static entity_t *get_tag(symbol_t const *const symbol,
721 entity_kind_tag_t const kind)
723 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
724 if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
726 "'%Y' defined as wrong kind of tag (previous definition %P)",
727 symbol, &entity->base.source_position);
734 * pushs an entity on the environment stack and links the corresponding symbol
737 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
739 symbol_t *symbol = entity->base.symbol;
740 entity_namespace_t namespc = entity->base.namespc;
741 assert(namespc != NAMESPACE_INVALID);
743 /* replace/add entity into entity list of the symbol */
746 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
751 /* replace an entry? */
752 if (iter->base.namespc == namespc) {
753 entity->base.symbol_next = iter->base.symbol_next;
759 /* remember old declaration */
761 entry.symbol = symbol;
762 entry.old_entity = iter;
763 entry.namespc = namespc;
764 ARR_APP1(stack_entry_t, *stack_ptr, entry);
768 * Push an entity on the environment stack.
770 static void environment_push(entity_t *entity)
772 assert(entity->base.source_position.input_name != NULL);
773 assert(entity->base.parent_scope != NULL);
774 stack_push(&environment_stack, entity);
778 * Push a declaration on the global label stack.
780 * @param declaration the declaration
782 static void label_push(entity_t *label)
784 /* we abuse the parameters scope as parent for the labels */
785 label->base.parent_scope = ¤t_function->parameters;
786 stack_push(&label_stack, label);
790 * pops symbols from the environment stack until @p new_top is the top element
792 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
794 stack_entry_t *stack = *stack_ptr;
795 size_t top = ARR_LEN(stack);
798 assert(new_top <= top);
802 for (i = top; i > new_top; --i) {
803 stack_entry_t *entry = &stack[i - 1];
805 entity_t *old_entity = entry->old_entity;
806 symbol_t *symbol = entry->symbol;
807 entity_namespace_t namespc = entry->namespc;
809 /* replace with old_entity/remove */
812 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
814 assert(iter != NULL);
815 /* replace an entry? */
816 if (iter->base.namespc == namespc)
820 /* restore definition from outer scopes (if there was one) */
821 if (old_entity != NULL) {
822 old_entity->base.symbol_next = iter->base.symbol_next;
823 *anchor = old_entity;
825 /* remove entry from list */
826 *anchor = iter->base.symbol_next;
830 ARR_SHRINKLEN(*stack_ptr, new_top);
834 * Pop all entries from the environment stack until the new_top
837 * @param new_top the new stack top
839 static void environment_pop_to(size_t new_top)
841 stack_pop_to(&environment_stack, new_top);
845 * Pop all entries from the global label stack until the new_top
848 * @param new_top the new stack top
850 static void label_pop_to(size_t new_top)
852 stack_pop_to(&label_stack, new_top);
855 static int get_akind_rank(atomic_type_kind_t akind)
861 * Return the type rank for an atomic type.
863 static int get_rank(const type_t *type)
865 assert(!is_typeref(type));
866 if (type->kind == TYPE_ENUM)
867 return get_akind_rank(type->enumt.akind);
869 assert(type->kind == TYPE_ATOMIC);
870 return get_akind_rank(type->atomic.akind);
874 * §6.3.1.1:2 Do integer promotion for a given type.
876 * @param type the type to promote
877 * @return the promoted type
879 static type_t *promote_integer(type_t *type)
881 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
888 * Check if a given expression represents a null pointer constant.
890 * @param expression the expression to check
892 static bool is_null_pointer_constant(const expression_t *expression)
894 /* skip void* cast */
895 if (expression->kind == EXPR_UNARY_CAST) {
896 type_t *const type = skip_typeref(expression->base.type);
897 if (types_compatible(type, type_void_ptr))
898 expression = expression->unary.value;
901 type_t *const type = skip_typeref(expression->base.type);
902 if (!is_type_integer(type))
904 switch (is_constant_expression(expression)) {
905 case EXPR_CLASS_ERROR: return true;
906 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
907 default: return false;
912 * Create an implicit cast expression.
914 * @param expression the expression to cast
915 * @param dest_type the destination type
917 static expression_t *create_implicit_cast(expression_t *expression,
920 type_t *const source_type = expression->base.type;
922 if (source_type == dest_type)
925 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
926 cast->unary.value = expression;
927 cast->base.type = dest_type;
928 cast->base.implicit = true;
933 typedef enum assign_error_t {
935 ASSIGN_ERROR_INCOMPATIBLE,
936 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
937 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
938 ASSIGN_WARNING_POINTER_FROM_INT,
939 ASSIGN_WARNING_INT_FROM_POINTER
942 static void report_assign_error(assign_error_t error, type_t *orig_type_left, expression_t const *const right, char const *const context, source_position_t const *const pos)
944 type_t *const orig_type_right = right->base.type;
945 type_t *const type_left = skip_typeref(orig_type_left);
946 type_t *const type_right = skip_typeref(orig_type_right);
951 case ASSIGN_ERROR_INCOMPATIBLE:
952 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
955 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
956 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
957 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
959 /* the left type has all qualifiers from the right type */
960 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
961 warningf(WARN_OTHER, pos, "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type", orig_type_left, context, orig_type_right, missing_qualifiers);
965 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
966 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
969 case ASSIGN_WARNING_POINTER_FROM_INT:
970 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
973 case ASSIGN_WARNING_INT_FROM_POINTER:
974 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
978 panic("invalid error value");
982 /** Implements the rules from §6.5.16.1 */
983 static assign_error_t semantic_assign(type_t *orig_type_left,
984 const expression_t *const right)
986 type_t *const orig_type_right = right->base.type;
987 type_t *const type_left = skip_typeref(orig_type_left);
988 type_t *const type_right = skip_typeref(orig_type_right);
990 if (is_type_pointer(type_left)) {
991 if (is_null_pointer_constant(right)) {
992 return ASSIGN_SUCCESS;
993 } else if (is_type_pointer(type_right)) {
994 type_t *points_to_left
995 = skip_typeref(type_left->pointer.points_to);
996 type_t *points_to_right
997 = skip_typeref(type_right->pointer.points_to);
998 assign_error_t res = ASSIGN_SUCCESS;
1000 /* the left type has all qualifiers from the right type */
1001 unsigned missing_qualifiers
1002 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1003 if (missing_qualifiers != 0) {
1004 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1007 points_to_left = get_unqualified_type(points_to_left);
1008 points_to_right = get_unqualified_type(points_to_right);
1010 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1013 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1014 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1015 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1018 if (!types_compatible(points_to_left, points_to_right)) {
1019 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1023 } else if (is_type_integer(type_right)) {
1024 return ASSIGN_WARNING_POINTER_FROM_INT;
1026 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1027 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1028 && is_type_pointer(type_right))) {
1029 return ASSIGN_SUCCESS;
1030 } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1031 type_t *const unqual_type_left = get_unqualified_type(type_left);
1032 type_t *const unqual_type_right = get_unqualified_type(type_right);
1033 if (types_compatible(unqual_type_left, unqual_type_right)) {
1034 return ASSIGN_SUCCESS;
1036 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1037 return ASSIGN_WARNING_INT_FROM_POINTER;
1040 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1041 return ASSIGN_SUCCESS;
1043 return ASSIGN_ERROR_INCOMPATIBLE;
1046 static expression_t *parse_constant_expression(void)
1048 expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1050 if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1051 errorf(&result->base.source_position,
1052 "expression '%E' is not constant", result);
1058 static expression_t *parse_assignment_expression(void)
1060 return parse_subexpression(PREC_ASSIGNMENT);
1063 static void warn_string_concat(const source_position_t *pos)
1065 warningf(WARN_TRADITIONAL, pos, "traditional C rejects string constant concatenation");
1068 static string_t parse_string_literals(void)
1070 assert(token.kind == T_STRING_LITERAL);
1071 string_t result = token.string.string;
1075 while (token.kind == T_STRING_LITERAL) {
1076 warn_string_concat(&token.base.source_position);
1077 result = concat_strings(&result, &token.string.string);
1085 * compare two string, ignoring double underscores on the second.
1087 static int strcmp_underscore(const char *s1, const char *s2)
1089 if (s2[0] == '_' && s2[1] == '_') {
1090 size_t len2 = strlen(s2);
1091 size_t len1 = strlen(s1);
1092 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1093 return strncmp(s1, s2+2, len2-4);
1097 return strcmp(s1, s2);
1100 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1102 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1103 attribute->kind = kind;
1104 attribute->source_position = *HERE;
1109 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1112 * __attribute__ ( ( attribute-list ) )
1116 * attribute_list , attrib
1121 * any-word ( identifier )
1122 * any-word ( identifier , nonempty-expr-list )
1123 * any-word ( expr-list )
1125 * where the "identifier" must not be declared as a type, and
1126 * "any-word" may be any identifier (including one declared as a
1127 * type), a reserved word storage class specifier, type specifier or
1128 * type qualifier. ??? This still leaves out most reserved keywords
1129 * (following the old parser), shouldn't we include them, and why not
1130 * allow identifiers declared as types to start the arguments?
1132 * Matze: this all looks confusing and little systematic, so we're even less
1133 * strict and parse any list of things which are identifiers or
1134 * (assignment-)expressions.
1136 static attribute_argument_t *parse_attribute_arguments(void)
1138 attribute_argument_t *first = NULL;
1139 attribute_argument_t **anchor = &first;
1140 if (token.kind != ')') do {
1141 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1143 /* is it an identifier */
1144 if (token.kind == T_IDENTIFIER
1145 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1146 symbol_t *symbol = token.identifier.symbol;
1147 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1148 argument->v.symbol = symbol;
1151 /* must be an expression */
1152 expression_t *expression = parse_assignment_expression();
1154 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1155 argument->v.expression = expression;
1158 /* append argument */
1160 anchor = &argument->next;
1161 } while (next_if(','));
1162 expect(')', end_error);
1171 static attribute_t *parse_attribute_asm(void)
1173 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1176 expect('(', end_error);
1177 attribute->a.arguments = parse_attribute_arguments();
1184 static symbol_t *get_symbol_from_token(void)
1186 switch(token.kind) {
1188 return token.identifier.symbol;
1217 /* maybe we need more tokens ... add them on demand */
1218 return get_token_kind_symbol(token.kind);
1224 static attribute_t *parse_attribute_gnu_single(void)
1226 /* parse "any-word" */
1227 symbol_t *symbol = get_symbol_from_token();
1228 if (symbol == NULL) {
1229 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1233 attribute_kind_t kind;
1234 char const *const name = symbol->string;
1235 for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1236 if (kind > ATTRIBUTE_GNU_LAST) {
1237 warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1238 /* TODO: we should still save the attribute in the list... */
1239 kind = ATTRIBUTE_UNKNOWN;
1243 const char *attribute_name = get_attribute_name(kind);
1244 if (attribute_name != NULL
1245 && strcmp_underscore(attribute_name, name) == 0)
1249 attribute_t *attribute = allocate_attribute_zero(kind);
1252 /* parse arguments */
1254 attribute->a.arguments = parse_attribute_arguments();
1259 static attribute_t *parse_attribute_gnu(void)
1261 attribute_t *first = NULL;
1262 attribute_t **anchor = &first;
1264 eat(T___attribute__);
1265 expect('(', end_error);
1266 expect('(', end_error);
1268 if (token.kind != ')') do {
1269 attribute_t *attribute = parse_attribute_gnu_single();
1270 if (attribute == NULL)
1273 *anchor = attribute;
1274 anchor = &attribute->next;
1275 } while (next_if(','));
1276 expect(')', end_error);
1277 expect(')', end_error);
1283 /** Parse attributes. */
1284 static attribute_t *parse_attributes(attribute_t *first)
1286 attribute_t **anchor = &first;
1288 while (*anchor != NULL)
1289 anchor = &(*anchor)->next;
1291 attribute_t *attribute;
1292 switch (token.kind) {
1293 case T___attribute__:
1294 attribute = parse_attribute_gnu();
1295 if (attribute == NULL)
1300 attribute = parse_attribute_asm();
1304 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1309 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1313 case T__forceinline:
1314 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1315 eat(T__forceinline);
1319 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1324 /* TODO record modifier */
1325 warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1326 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1334 *anchor = attribute;
1335 anchor = &attribute->next;
1339 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1341 static entity_t *determine_lhs_ent(expression_t *const expr,
1344 switch (expr->kind) {
1345 case EXPR_REFERENCE: {
1346 entity_t *const entity = expr->reference.entity;
1347 /* we should only find variables as lvalues... */
1348 if (entity->base.kind != ENTITY_VARIABLE
1349 && entity->base.kind != ENTITY_PARAMETER)
1355 case EXPR_ARRAY_ACCESS: {
1356 expression_t *const ref = expr->array_access.array_ref;
1357 entity_t * ent = NULL;
1358 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1359 ent = determine_lhs_ent(ref, lhs_ent);
1362 mark_vars_read(expr->select.compound, lhs_ent);
1364 mark_vars_read(expr->array_access.index, lhs_ent);
1369 if (is_type_compound(skip_typeref(expr->base.type))) {
1370 return determine_lhs_ent(expr->select.compound, lhs_ent);
1372 mark_vars_read(expr->select.compound, lhs_ent);
1377 case EXPR_UNARY_DEREFERENCE: {
1378 expression_t *const val = expr->unary.value;
1379 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1381 return determine_lhs_ent(val->unary.value, lhs_ent);
1383 mark_vars_read(val, NULL);
1389 mark_vars_read(expr, NULL);
1394 #define ENT_ANY ((entity_t*)-1)
1397 * Mark declarations, which are read. This is used to detect variables, which
1401 * x is not marked as "read", because it is only read to calculate its own new
1405 * x and y are not detected as "not read", because multiple variables are
1408 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1410 switch (expr->kind) {
1411 case EXPR_REFERENCE: {
1412 entity_t *const entity = expr->reference.entity;
1413 if (entity->kind != ENTITY_VARIABLE
1414 && entity->kind != ENTITY_PARAMETER)
1417 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1418 if (entity->kind == ENTITY_VARIABLE) {
1419 entity->variable.read = true;
1421 entity->parameter.read = true;
1428 // TODO respect pure/const
1429 mark_vars_read(expr->call.function, NULL);
1430 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1431 mark_vars_read(arg->expression, NULL);
1435 case EXPR_CONDITIONAL:
1436 // TODO lhs_decl should depend on whether true/false have an effect
1437 mark_vars_read(expr->conditional.condition, NULL);
1438 if (expr->conditional.true_expression != NULL)
1439 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1440 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1444 if (lhs_ent == ENT_ANY
1445 && !is_type_compound(skip_typeref(expr->base.type)))
1447 mark_vars_read(expr->select.compound, lhs_ent);
1450 case EXPR_ARRAY_ACCESS: {
1451 expression_t *const ref = expr->array_access.array_ref;
1452 mark_vars_read(ref, lhs_ent);
1453 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1454 mark_vars_read(expr->array_access.index, lhs_ent);
1459 mark_vars_read(expr->va_arge.ap, lhs_ent);
1463 mark_vars_read(expr->va_copye.src, lhs_ent);
1466 case EXPR_UNARY_CAST:
1467 /* Special case: Use void cast to mark a variable as "read" */
1468 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1473 case EXPR_UNARY_THROW:
1474 if (expr->unary.value == NULL)
1477 case EXPR_UNARY_DEREFERENCE:
1478 case EXPR_UNARY_DELETE:
1479 case EXPR_UNARY_DELETE_ARRAY:
1480 if (lhs_ent == ENT_ANY)
1484 case EXPR_UNARY_NEGATE:
1485 case EXPR_UNARY_PLUS:
1486 case EXPR_UNARY_BITWISE_NEGATE:
1487 case EXPR_UNARY_NOT:
1488 case EXPR_UNARY_TAKE_ADDRESS:
1489 case EXPR_UNARY_POSTFIX_INCREMENT:
1490 case EXPR_UNARY_POSTFIX_DECREMENT:
1491 case EXPR_UNARY_PREFIX_INCREMENT:
1492 case EXPR_UNARY_PREFIX_DECREMENT:
1493 case EXPR_UNARY_ASSUME:
1495 mark_vars_read(expr->unary.value, lhs_ent);
1498 case EXPR_BINARY_ADD:
1499 case EXPR_BINARY_SUB:
1500 case EXPR_BINARY_MUL:
1501 case EXPR_BINARY_DIV:
1502 case EXPR_BINARY_MOD:
1503 case EXPR_BINARY_EQUAL:
1504 case EXPR_BINARY_NOTEQUAL:
1505 case EXPR_BINARY_LESS:
1506 case EXPR_BINARY_LESSEQUAL:
1507 case EXPR_BINARY_GREATER:
1508 case EXPR_BINARY_GREATEREQUAL:
1509 case EXPR_BINARY_BITWISE_AND:
1510 case EXPR_BINARY_BITWISE_OR:
1511 case EXPR_BINARY_BITWISE_XOR:
1512 case EXPR_BINARY_LOGICAL_AND:
1513 case EXPR_BINARY_LOGICAL_OR:
1514 case EXPR_BINARY_SHIFTLEFT:
1515 case EXPR_BINARY_SHIFTRIGHT:
1516 case EXPR_BINARY_COMMA:
1517 case EXPR_BINARY_ISGREATER:
1518 case EXPR_BINARY_ISGREATEREQUAL:
1519 case EXPR_BINARY_ISLESS:
1520 case EXPR_BINARY_ISLESSEQUAL:
1521 case EXPR_BINARY_ISLESSGREATER:
1522 case EXPR_BINARY_ISUNORDERED:
1523 mark_vars_read(expr->binary.left, lhs_ent);
1524 mark_vars_read(expr->binary.right, lhs_ent);
1527 case EXPR_BINARY_ASSIGN:
1528 case EXPR_BINARY_MUL_ASSIGN:
1529 case EXPR_BINARY_DIV_ASSIGN:
1530 case EXPR_BINARY_MOD_ASSIGN:
1531 case EXPR_BINARY_ADD_ASSIGN:
1532 case EXPR_BINARY_SUB_ASSIGN:
1533 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1534 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1535 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1536 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1537 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1538 if (lhs_ent == ENT_ANY)
1540 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1541 mark_vars_read(expr->binary.right, lhs_ent);
1546 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1551 case EXPR_STRING_LITERAL:
1552 case EXPR_WIDE_STRING_LITERAL:
1553 case EXPR_COMPOUND_LITERAL: // TODO init?
1555 case EXPR_CLASSIFY_TYPE:
1558 case EXPR_BUILTIN_CONSTANT_P:
1559 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1561 case EXPR_STATEMENT: // TODO
1562 case EXPR_LABEL_ADDRESS:
1563 case EXPR_REFERENCE_ENUM_VALUE:
1567 panic("unhandled expression");
1570 static designator_t *parse_designation(void)
1572 designator_t *result = NULL;
1573 designator_t **anchor = &result;
1576 designator_t *designator;
1577 switch (token.kind) {
1579 designator = allocate_ast_zero(sizeof(designator[0]));
1580 designator->source_position = token.base.source_position;
1582 add_anchor_token(']');
1583 designator->array_index = parse_constant_expression();
1584 rem_anchor_token(']');
1585 expect(']', end_error);
1588 designator = allocate_ast_zero(sizeof(designator[0]));
1589 designator->source_position = token.base.source_position;
1591 if (token.kind != T_IDENTIFIER) {
1592 parse_error_expected("while parsing designator",
1593 T_IDENTIFIER, NULL);
1596 designator->symbol = token.identifier.symbol;
1600 expect('=', end_error);
1604 assert(designator != NULL);
1605 *anchor = designator;
1606 anchor = &designator->next;
1612 static initializer_t *initializer_from_string(array_type_t *const type,
1613 const string_t *const string)
1615 /* TODO: check len vs. size of array type */
1618 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1619 initializer->string.string = *string;
1624 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1625 const string_t *const string)
1627 /* TODO: check len vs. size of array type */
1630 initializer_t *const initializer =
1631 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1632 initializer->wide_string.string = *string;
1638 * Build an initializer from a given expression.
1640 static initializer_t *initializer_from_expression(type_t *orig_type,
1641 expression_t *expression)
1643 /* TODO check that expression is a constant expression */
1645 /* §6.7.8.14/15 char array may be initialized by string literals */
1646 type_t *type = skip_typeref(orig_type);
1647 type_t *expr_type_orig = expression->base.type;
1648 type_t *expr_type = skip_typeref(expr_type_orig);
1650 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1651 array_type_t *const array_type = &type->array;
1652 type_t *const element_type = skip_typeref(array_type->element_type);
1654 if (element_type->kind == TYPE_ATOMIC) {
1655 atomic_type_kind_t akind = element_type->atomic.akind;
1656 switch (expression->kind) {
1657 case EXPR_STRING_LITERAL:
1658 if (akind == ATOMIC_TYPE_CHAR
1659 || akind == ATOMIC_TYPE_SCHAR
1660 || akind == ATOMIC_TYPE_UCHAR) {
1661 return initializer_from_string(array_type,
1662 &expression->string_literal.value);
1666 case EXPR_WIDE_STRING_LITERAL: {
1667 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1668 if (get_unqualified_type(element_type) == bare_wchar_type) {
1669 return initializer_from_wide_string(array_type,
1670 &expression->string_literal.value);
1681 assign_error_t error = semantic_assign(type, expression);
1682 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1684 report_assign_error(error, type, expression, "initializer",
1685 &expression->base.source_position);
1687 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1688 result->value.value = create_implicit_cast(expression, type);
1694 * Checks if a given expression can be used as a constant initializer.
1696 static bool is_initializer_constant(const expression_t *expression)
1698 return is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1699 is_linker_constant(expression) != EXPR_CLASS_VARIABLE;
1703 * Parses an scalar initializer.
1705 * §6.7.8.11; eat {} without warning
1707 static initializer_t *parse_scalar_initializer(type_t *type,
1708 bool must_be_constant)
1710 /* there might be extra {} hierarchies */
1712 if (token.kind == '{') {
1713 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1717 } while (token.kind == '{');
1720 expression_t *expression = parse_assignment_expression();
1721 mark_vars_read(expression, NULL);
1722 if (must_be_constant && !is_initializer_constant(expression)) {
1723 errorf(&expression->base.source_position,
1724 "initialisation expression '%E' is not constant",
1728 initializer_t *initializer = initializer_from_expression(type, expression);
1730 if (initializer == NULL) {
1731 errorf(&expression->base.source_position,
1732 "expression '%E' (type '%T') doesn't match expected type '%T'",
1733 expression, expression->base.type, type);
1738 bool additional_warning_displayed = false;
1739 while (braces > 0) {
1741 if (token.kind != '}') {
1742 if (!additional_warning_displayed) {
1743 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1744 additional_warning_displayed = true;
1755 * An entry in the type path.
1757 typedef struct type_path_entry_t type_path_entry_t;
1758 struct type_path_entry_t {
1759 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1761 size_t index; /**< For array types: the current index. */
1762 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1767 * A type path expression a position inside compound or array types.
1769 typedef struct type_path_t type_path_t;
1770 struct type_path_t {
1771 type_path_entry_t *path; /**< An flexible array containing the current path. */
1772 type_t *top_type; /**< type of the element the path points */
1773 size_t max_index; /**< largest index in outermost array */
1777 * Prints a type path for debugging.
1779 static __attribute__((unused)) void debug_print_type_path(
1780 const type_path_t *path)
1782 size_t len = ARR_LEN(path->path);
1784 for (size_t i = 0; i < len; ++i) {
1785 const type_path_entry_t *entry = & path->path[i];
1787 type_t *type = skip_typeref(entry->type);
1788 if (is_type_compound(type)) {
1789 /* in gcc mode structs can have no members */
1790 if (entry->v.compound_entry == NULL) {
1794 fprintf(stderr, ".%s",
1795 entry->v.compound_entry->base.symbol->string);
1796 } else if (is_type_array(type)) {
1797 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1799 fprintf(stderr, "-INVALID-");
1802 if (path->top_type != NULL) {
1803 fprintf(stderr, " (");
1804 print_type(path->top_type);
1805 fprintf(stderr, ")");
1810 * Return the top type path entry, ie. in a path
1811 * (type).a.b returns the b.
1813 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1815 size_t len = ARR_LEN(path->path);
1817 return &path->path[len-1];
1821 * Enlarge the type path by an (empty) element.
1823 static type_path_entry_t *append_to_type_path(type_path_t *path)
1825 size_t len = ARR_LEN(path->path);
1826 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1828 type_path_entry_t *result = & path->path[len];
1829 memset(result, 0, sizeof(result[0]));
1834 * Descending into a sub-type. Enter the scope of the current top_type.
1836 static void descend_into_subtype(type_path_t *path)
1838 type_t *orig_top_type = path->top_type;
1839 type_t *top_type = skip_typeref(orig_top_type);
1841 type_path_entry_t *top = append_to_type_path(path);
1842 top->type = top_type;
1844 if (is_type_compound(top_type)) {
1845 compound_t *compound = top_type->compound.compound;
1846 entity_t *entry = compound->members.entities;
1848 if (entry != NULL) {
1849 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
1850 top->v.compound_entry = &entry->declaration;
1851 path->top_type = entry->declaration.type;
1853 path->top_type = NULL;
1855 } else if (is_type_array(top_type)) {
1857 path->top_type = top_type->array.element_type;
1859 assert(!is_type_valid(top_type));
1864 * Pop an entry from the given type path, ie. returning from
1865 * (type).a.b to (type).a
1867 static void ascend_from_subtype(type_path_t *path)
1869 type_path_entry_t *top = get_type_path_top(path);
1871 path->top_type = top->type;
1873 size_t len = ARR_LEN(path->path);
1874 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1878 * Pop entries from the given type path until the given
1879 * path level is reached.
1881 static void ascend_to(type_path_t *path, size_t top_path_level)
1883 size_t len = ARR_LEN(path->path);
1885 while (len > top_path_level) {
1886 ascend_from_subtype(path);
1887 len = ARR_LEN(path->path);
1891 static bool walk_designator(type_path_t *path, const designator_t *designator,
1892 bool used_in_offsetof)
1894 for (; designator != NULL; designator = designator->next) {
1895 type_path_entry_t *top = get_type_path_top(path);
1896 type_t *orig_type = top->type;
1898 type_t *type = skip_typeref(orig_type);
1900 if (designator->symbol != NULL) {
1901 symbol_t *symbol = designator->symbol;
1902 if (!is_type_compound(type)) {
1903 if (is_type_valid(type)) {
1904 errorf(&designator->source_position,
1905 "'.%Y' designator used for non-compound type '%T'",
1909 top->type = type_error_type;
1910 top->v.compound_entry = NULL;
1911 orig_type = type_error_type;
1913 compound_t *compound = type->compound.compound;
1914 entity_t *iter = compound->members.entities;
1915 for (; iter != NULL; iter = iter->base.next) {
1916 if (iter->base.symbol == symbol) {
1921 errorf(&designator->source_position,
1922 "'%T' has no member named '%Y'", orig_type, symbol);
1925 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1926 if (used_in_offsetof && iter->compound_member.bitfield) {
1927 errorf(&designator->source_position,
1928 "offsetof designator '%Y' must not specify bitfield",
1933 top->type = orig_type;
1934 top->v.compound_entry = &iter->declaration;
1935 orig_type = iter->declaration.type;
1938 expression_t *array_index = designator->array_index;
1939 assert(designator->array_index != NULL);
1941 if (!is_type_array(type)) {
1942 if (is_type_valid(type)) {
1943 errorf(&designator->source_position,
1944 "[%E] designator used for non-array type '%T'",
1945 array_index, orig_type);
1950 long index = fold_constant_to_int(array_index);
1951 if (!used_in_offsetof) {
1953 errorf(&designator->source_position,
1954 "array index [%E] must be positive", array_index);
1955 } else if (type->array.size_constant) {
1956 long array_size = type->array.size;
1957 if (index >= array_size) {
1958 errorf(&designator->source_position,
1959 "designator [%E] (%d) exceeds array size %d",
1960 array_index, index, array_size);
1965 top->type = orig_type;
1966 top->v.index = (size_t) index;
1967 orig_type = type->array.element_type;
1969 path->top_type = orig_type;
1971 if (designator->next != NULL) {
1972 descend_into_subtype(path);
1978 static void advance_current_object(type_path_t *path, size_t top_path_level)
1980 type_path_entry_t *top = get_type_path_top(path);
1982 type_t *type = skip_typeref(top->type);
1983 if (is_type_union(type)) {
1984 /* in unions only the first element is initialized */
1985 top->v.compound_entry = NULL;
1986 } else if (is_type_struct(type)) {
1987 declaration_t *entry = top->v.compound_entry;
1989 entity_t *next_entity = entry->base.next;
1990 if (next_entity != NULL) {
1991 assert(is_declaration(next_entity));
1992 entry = &next_entity->declaration;
1997 top->v.compound_entry = entry;
1998 if (entry != NULL) {
1999 path->top_type = entry->type;
2002 } else if (is_type_array(type)) {
2003 assert(is_type_array(type));
2007 if (!type->array.size_constant || top->v.index < type->array.size) {
2011 assert(!is_type_valid(type));
2015 /* we're past the last member of the current sub-aggregate, try if we
2016 * can ascend in the type hierarchy and continue with another subobject */
2017 size_t len = ARR_LEN(path->path);
2019 if (len > top_path_level) {
2020 ascend_from_subtype(path);
2021 advance_current_object(path, top_path_level);
2023 path->top_type = NULL;
2028 * skip any {...} blocks until a closing bracket is reached.
2030 static void skip_initializers(void)
2034 while (token.kind != '}') {
2035 if (token.kind == T_EOF)
2037 if (token.kind == '{') {
2045 static initializer_t *create_empty_initializer(void)
2047 static initializer_t empty_initializer
2048 = { .list = { { INITIALIZER_LIST }, 0 } };
2049 return &empty_initializer;
2053 * Parse a part of an initialiser for a struct or union,
2055 static initializer_t *parse_sub_initializer(type_path_t *path,
2056 type_t *outer_type, size_t top_path_level,
2057 parse_initializer_env_t *env)
2059 if (token.kind == '}') {
2060 /* empty initializer */
2061 return create_empty_initializer();
2064 type_t *orig_type = path->top_type;
2065 type_t *type = NULL;
2067 if (orig_type == NULL) {
2068 /* We are initializing an empty compound. */
2070 type = skip_typeref(orig_type);
2073 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2076 designator_t *designator = NULL;
2077 if (token.kind == '.' || token.kind == '[') {
2078 designator = parse_designation();
2079 goto finish_designator;
2080 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2081 /* GNU-style designator ("identifier: value") */
2082 designator = allocate_ast_zero(sizeof(designator[0]));
2083 designator->source_position = token.base.source_position;
2084 designator->symbol = token.identifier.symbol;
2089 /* reset path to toplevel, evaluate designator from there */
2090 ascend_to(path, top_path_level);
2091 if (!walk_designator(path, designator, false)) {
2092 /* can't continue after designation error */
2096 initializer_t *designator_initializer
2097 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2098 designator_initializer->designator.designator = designator;
2099 ARR_APP1(initializer_t*, initializers, designator_initializer);
2101 orig_type = path->top_type;
2102 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2107 if (token.kind == '{') {
2108 if (type != NULL && is_type_scalar(type)) {
2109 sub = parse_scalar_initializer(type, env->must_be_constant);
2112 if (env->entity != NULL) {
2114 "extra brace group at end of initializer for '%Y'",
2115 env->entity->base.symbol);
2117 errorf(HERE, "extra brace group at end of initializer");
2122 descend_into_subtype(path);
2125 add_anchor_token('}');
2126 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2128 rem_anchor_token('}');
2131 ascend_from_subtype(path);
2132 expect('}', end_error);
2134 expect('}', end_error);
2135 goto error_parse_next;
2139 /* must be an expression */
2140 expression_t *expression = parse_assignment_expression();
2141 mark_vars_read(expression, NULL);
2143 if (env->must_be_constant && !is_initializer_constant(expression)) {
2144 errorf(&expression->base.source_position,
2145 "Initialisation expression '%E' is not constant",
2150 /* we are already outside, ... */
2151 if (outer_type == NULL)
2152 goto error_parse_next;
2153 type_t *const outer_type_skip = skip_typeref(outer_type);
2154 if (is_type_compound(outer_type_skip) &&
2155 !outer_type_skip->compound.compound->complete) {
2156 goto error_parse_next;
2159 source_position_t const* const pos = &expression->base.source_position;
2160 if (env->entity != NULL) {
2161 warningf(WARN_OTHER, pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2163 warningf(WARN_OTHER, pos, "excess elements in initializer");
2165 goto error_parse_next;
2168 /* handle { "string" } special case */
2169 if ((expression->kind == EXPR_STRING_LITERAL
2170 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2171 && outer_type != NULL) {
2172 sub = initializer_from_expression(outer_type, expression);
2175 if (token.kind != '}') {
2176 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2178 /* TODO: eat , ... */
2183 /* descend into subtypes until expression matches type */
2185 orig_type = path->top_type;
2186 type = skip_typeref(orig_type);
2188 sub = initializer_from_expression(orig_type, expression);
2192 if (!is_type_valid(type)) {
2195 if (is_type_scalar(type)) {
2196 errorf(&expression->base.source_position,
2197 "expression '%E' doesn't match expected type '%T'",
2198 expression, orig_type);
2202 descend_into_subtype(path);
2206 /* update largest index of top array */
2207 const type_path_entry_t *first = &path->path[0];
2208 type_t *first_type = first->type;
2209 first_type = skip_typeref(first_type);
2210 if (is_type_array(first_type)) {
2211 size_t index = first->v.index;
2212 if (index > path->max_index)
2213 path->max_index = index;
2216 /* append to initializers list */
2217 ARR_APP1(initializer_t*, initializers, sub);
2220 if (token.kind == '}') {
2223 expect(',', end_error);
2224 if (token.kind == '}') {
2229 /* advance to the next declaration if we are not at the end */
2230 advance_current_object(path, top_path_level);
2231 orig_type = path->top_type;
2232 if (orig_type != NULL)
2233 type = skip_typeref(orig_type);
2239 size_t len = ARR_LEN(initializers);
2240 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2241 initializer_t *result = allocate_ast_zero(size);
2242 result->kind = INITIALIZER_LIST;
2243 result->list.len = len;
2244 memcpy(&result->list.initializers, initializers,
2245 len * sizeof(initializers[0]));
2247 DEL_ARR_F(initializers);
2248 ascend_to(path, top_path_level+1);
2253 skip_initializers();
2254 DEL_ARR_F(initializers);
2255 ascend_to(path, top_path_level+1);
2259 static expression_t *make_size_literal(size_t value)
2261 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2262 literal->base.type = type_size_t;
2265 snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2266 literal->literal.value = make_string(buf);
2272 * Parses an initializer. Parsers either a compound literal
2273 * (env->declaration == NULL) or an initializer of a declaration.
2275 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2277 type_t *type = skip_typeref(env->type);
2278 size_t max_index = 0;
2279 initializer_t *result;
2281 if (is_type_scalar(type)) {
2282 result = parse_scalar_initializer(type, env->must_be_constant);
2283 } else if (token.kind == '{') {
2287 memset(&path, 0, sizeof(path));
2288 path.top_type = env->type;
2289 path.path = NEW_ARR_F(type_path_entry_t, 0);
2291 descend_into_subtype(&path);
2293 add_anchor_token('}');
2294 result = parse_sub_initializer(&path, env->type, 1, env);
2295 rem_anchor_token('}');
2297 max_index = path.max_index;
2298 DEL_ARR_F(path.path);
2300 expect('}', end_error);
2303 /* parse_scalar_initializer() also works in this case: we simply
2304 * have an expression without {} around it */
2305 result = parse_scalar_initializer(type, env->must_be_constant);
2308 /* §6.7.8:22 array initializers for arrays with unknown size determine
2309 * the array type size */
2310 if (is_type_array(type) && type->array.size_expression == NULL
2311 && result != NULL) {
2313 switch (result->kind) {
2314 case INITIALIZER_LIST:
2315 assert(max_index != 0xdeadbeaf);
2316 size = max_index + 1;
2319 case INITIALIZER_STRING:
2320 size = result->string.string.size;
2323 case INITIALIZER_WIDE_STRING:
2324 size = result->wide_string.string.size;
2327 case INITIALIZER_DESIGNATOR:
2328 case INITIALIZER_VALUE:
2329 /* can happen for parse errors */
2334 internal_errorf(HERE, "invalid initializer type");
2337 type_t *new_type = duplicate_type(type);
2339 new_type->array.size_expression = make_size_literal(size);
2340 new_type->array.size_constant = true;
2341 new_type->array.has_implicit_size = true;
2342 new_type->array.size = size;
2343 env->type = new_type;
2349 static void append_entity(scope_t *scope, entity_t *entity)
2351 if (scope->last_entity != NULL) {
2352 scope->last_entity->base.next = entity;
2354 scope->entities = entity;
2356 entity->base.parent_entity = current_entity;
2357 scope->last_entity = entity;
2361 static compound_t *parse_compound_type_specifier(bool is_struct)
2363 source_position_t const pos = *HERE;
2364 eat(is_struct ? T_struct : T_union);
2366 symbol_t *symbol = NULL;
2367 entity_t *entity = NULL;
2368 attribute_t *attributes = NULL;
2370 if (token.kind == T___attribute__) {
2371 attributes = parse_attributes(NULL);
2374 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2375 if (token.kind == T_IDENTIFIER) {
2376 /* the compound has a name, check if we have seen it already */
2377 symbol = token.identifier.symbol;
2378 entity = get_tag(symbol, kind);
2381 if (entity != NULL) {
2382 if (entity->base.parent_scope != current_scope &&
2383 (token.kind == '{' || token.kind == ';')) {
2384 /* we're in an inner scope and have a definition. Shadow
2385 * existing definition in outer scope */
2387 } else if (entity->compound.complete && token.kind == '{') {
2388 source_position_t const *const ppos = &entity->base.source_position;
2389 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2390 /* clear members in the hope to avoid further errors */
2391 entity->compound.members.entities = NULL;
2394 } else if (token.kind != '{') {
2395 char const *const msg =
2396 is_struct ? "while parsing struct type specifier" :
2397 "while parsing union type specifier";
2398 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2403 if (entity == NULL) {
2404 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2405 entity->compound.alignment = 1;
2406 entity->base.source_position = pos;
2407 entity->base.parent_scope = current_scope;
2408 if (symbol != NULL) {
2409 environment_push(entity);
2411 append_entity(current_scope, entity);
2414 if (token.kind == '{') {
2415 parse_compound_type_entries(&entity->compound);
2417 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2418 if (symbol == NULL) {
2419 assert(anonymous_entity == NULL);
2420 anonymous_entity = entity;
2424 if (attributes != NULL) {
2425 handle_entity_attributes(attributes, entity);
2428 return &entity->compound;
2431 static void parse_enum_entries(type_t *const enum_type)
2435 if (token.kind == '}') {
2436 errorf(HERE, "empty enum not allowed");
2441 add_anchor_token('}');
2443 if (token.kind != T_IDENTIFIER) {
2444 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2446 rem_anchor_token('}');
2450 symbol_t *symbol = token.identifier.symbol;
2451 entity_t *const entity
2452 = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol);
2453 entity->enum_value.enum_type = enum_type;
2454 entity->base.source_position = token.base.source_position;
2458 expression_t *value = parse_constant_expression();
2460 value = create_implicit_cast(value, enum_type);
2461 entity->enum_value.value = value;
2466 record_entity(entity, false);
2467 } while (next_if(',') && token.kind != '}');
2468 rem_anchor_token('}');
2470 expect('}', end_error);
2476 static type_t *parse_enum_specifier(void)
2478 source_position_t const pos = *HERE;
2483 switch (token.kind) {
2485 symbol = token.identifier.symbol;
2486 entity = get_tag(symbol, ENTITY_ENUM);
2489 if (entity != NULL) {
2490 if (entity->base.parent_scope != current_scope &&
2491 (token.kind == '{' || token.kind == ';')) {
2492 /* we're in an inner scope and have a definition. Shadow
2493 * existing definition in outer scope */
2495 } else if (entity->enume.complete && token.kind == '{') {
2496 source_position_t const *const ppos = &entity->base.source_position;
2497 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2508 parse_error_expected("while parsing enum type specifier",
2509 T_IDENTIFIER, '{', NULL);
2513 if (entity == NULL) {
2514 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2515 entity->base.source_position = pos;
2516 entity->base.parent_scope = current_scope;
2519 type_t *const type = allocate_type_zero(TYPE_ENUM);
2520 type->enumt.enume = &entity->enume;
2521 type->enumt.akind = ATOMIC_TYPE_INT;
2523 if (token.kind == '{') {
2524 if (symbol != NULL) {
2525 environment_push(entity);
2527 append_entity(current_scope, entity);
2528 entity->enume.complete = true;
2530 parse_enum_entries(type);
2531 parse_attributes(NULL);
2533 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2534 if (symbol == NULL) {
2535 assert(anonymous_entity == NULL);
2536 anonymous_entity = entity;
2538 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2539 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2546 * if a symbol is a typedef to another type, return true
2548 static bool is_typedef_symbol(symbol_t *symbol)
2550 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2551 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2554 static type_t *parse_typeof(void)
2560 expect('(', end_error);
2561 add_anchor_token(')');
2563 expression_t *expression = NULL;
2565 switch (token.kind) {
2567 if (is_typedef_symbol(token.identifier.symbol)) {
2569 type = parse_typename();
2572 expression = parse_expression();
2573 type = revert_automatic_type_conversion(expression);
2578 rem_anchor_token(')');
2579 expect(')', end_error);
2581 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2582 typeof_type->typeoft.expression = expression;
2583 typeof_type->typeoft.typeof_type = type;
2590 typedef enum specifiers_t {
2591 SPECIFIER_SIGNED = 1 << 0,
2592 SPECIFIER_UNSIGNED = 1 << 1,
2593 SPECIFIER_LONG = 1 << 2,
2594 SPECIFIER_INT = 1 << 3,
2595 SPECIFIER_DOUBLE = 1 << 4,
2596 SPECIFIER_CHAR = 1 << 5,
2597 SPECIFIER_WCHAR_T = 1 << 6,
2598 SPECIFIER_SHORT = 1 << 7,
2599 SPECIFIER_LONG_LONG = 1 << 8,
2600 SPECIFIER_FLOAT = 1 << 9,
2601 SPECIFIER_BOOL = 1 << 10,
2602 SPECIFIER_VOID = 1 << 11,
2603 SPECIFIER_INT8 = 1 << 12,
2604 SPECIFIER_INT16 = 1 << 13,
2605 SPECIFIER_INT32 = 1 << 14,
2606 SPECIFIER_INT64 = 1 << 15,
2607 SPECIFIER_INT128 = 1 << 16,
2608 SPECIFIER_COMPLEX = 1 << 17,
2609 SPECIFIER_IMAGINARY = 1 << 18,
2612 static type_t *get_typedef_type(symbol_t *symbol)
2614 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2615 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2618 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2619 type->typedeft.typedefe = &entity->typedefe;
2624 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2626 expect('(', end_error);
2628 attribute_property_argument_t *property
2629 = allocate_ast_zero(sizeof(*property));
2632 if (token.kind != T_IDENTIFIER) {
2633 parse_error_expected("while parsing property declspec",
2634 T_IDENTIFIER, NULL);
2639 symbol_t *symbol = token.identifier.symbol;
2640 if (strcmp(symbol->string, "put") == 0) {
2641 prop = &property->put_symbol;
2642 } else if (strcmp(symbol->string, "get") == 0) {
2643 prop = &property->get_symbol;
2645 errorf(HERE, "expected put or get in property declspec");
2649 expect('=', end_error);
2650 if (token.kind != T_IDENTIFIER) {
2651 parse_error_expected("while parsing property declspec",
2652 T_IDENTIFIER, NULL);
2656 *prop = token.identifier.symbol;
2658 } while (next_if(','));
2660 attribute->a.property = property;
2662 expect(')', end_error);
2668 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2670 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2671 if (next_if(T_restrict)) {
2672 kind = ATTRIBUTE_MS_RESTRICT;
2673 } else if (token.kind == T_IDENTIFIER) {
2674 const char *name = token.identifier.symbol->string;
2675 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2677 const char *attribute_name = get_attribute_name(k);
2678 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2684 if (kind == ATTRIBUTE_UNKNOWN) {
2685 warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2688 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2692 attribute_t *attribute = allocate_attribute_zero(kind);
2695 if (kind == ATTRIBUTE_MS_PROPERTY) {
2696 return parse_attribute_ms_property(attribute);
2699 /* parse arguments */
2701 attribute->a.arguments = parse_attribute_arguments();
2706 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2710 expect('(', end_error);
2715 add_anchor_token(')');
2717 attribute_t **anchor = &first;
2719 while (*anchor != NULL)
2720 anchor = &(*anchor)->next;
2722 attribute_t *attribute
2723 = parse_microsoft_extended_decl_modifier_single();
2724 if (attribute == NULL)
2727 *anchor = attribute;
2728 anchor = &attribute->next;
2729 } while (next_if(','));
2731 rem_anchor_token(')');
2732 expect(')', end_error);
2736 rem_anchor_token(')');
2740 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2742 entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2743 entity->base.source_position = *HERE;
2744 if (is_declaration(entity)) {
2745 entity->declaration.type = type_error_type;
2746 entity->declaration.implicit = true;
2747 } else if (kind == ENTITY_TYPEDEF) {
2748 entity->typedefe.type = type_error_type;
2749 entity->typedefe.builtin = true;
2751 if (kind != ENTITY_COMPOUND_MEMBER)
2752 record_entity(entity, false);
2756 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2758 type_t *type = NULL;
2759 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2760 unsigned type_specifiers = 0;
2761 bool newtype = false;
2762 bool saw_error = false;
2764 memset(specifiers, 0, sizeof(*specifiers));
2765 specifiers->source_position = token.base.source_position;
2768 specifiers->attributes = parse_attributes(specifiers->attributes);
2770 switch (token.kind) {
2772 #define MATCH_STORAGE_CLASS(token, class) \
2774 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2775 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2777 specifiers->storage_class = class; \
2778 if (specifiers->thread_local) \
2779 goto check_thread_storage_class; \
2783 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2784 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2785 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2786 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2787 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2790 specifiers->attributes
2791 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2795 if (specifiers->thread_local) {
2796 errorf(HERE, "duplicate '__thread'");
2798 specifiers->thread_local = true;
2799 check_thread_storage_class:
2800 switch (specifiers->storage_class) {
2801 case STORAGE_CLASS_EXTERN:
2802 case STORAGE_CLASS_NONE:
2803 case STORAGE_CLASS_STATIC:
2807 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_storage_class;
2808 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2809 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_storage_class;
2810 wrong_thread_storage_class:
2811 errorf(HERE, "'__thread' used with '%s'", wrong);
2818 /* type qualifiers */
2819 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2821 qualifiers |= qualifier; \
2825 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2826 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2827 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2828 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2829 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2830 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2831 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2832 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2834 /* type specifiers */
2835 #define MATCH_SPECIFIER(token, specifier, name) \
2837 if (type_specifiers & specifier) { \
2838 errorf(HERE, "multiple " name " type specifiers given"); \
2840 type_specifiers |= specifier; \
2845 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
2846 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
2847 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2848 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
2849 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
2850 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
2851 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
2852 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
2853 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
2854 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
2855 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
2856 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
2857 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
2858 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
2859 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
2860 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
2861 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
2862 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
2866 specifiers->is_inline = true;
2870 case T__forceinline:
2872 specifiers->modifiers |= DM_FORCEINLINE;
2877 if (type_specifiers & SPECIFIER_LONG_LONG) {
2878 errorf(HERE, "too many long type specifiers given");
2879 } else if (type_specifiers & SPECIFIER_LONG) {
2880 type_specifiers |= SPECIFIER_LONG_LONG;
2882 type_specifiers |= SPECIFIER_LONG;
2887 #define CHECK_DOUBLE_TYPE() \
2888 (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2891 CHECK_DOUBLE_TYPE();
2892 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2894 type->compound.compound = parse_compound_type_specifier(true);
2897 CHECK_DOUBLE_TYPE();
2898 type = allocate_type_zero(TYPE_COMPOUND_UNION);
2899 type->compound.compound = parse_compound_type_specifier(false);
2902 CHECK_DOUBLE_TYPE();
2903 type = parse_enum_specifier();
2906 CHECK_DOUBLE_TYPE();
2907 type = parse_typeof();
2909 case T___builtin_va_list:
2910 CHECK_DOUBLE_TYPE();
2911 type = duplicate_type(type_valist);
2915 case T_IDENTIFIER: {
2916 /* only parse identifier if we haven't found a type yet */
2917 if (type != NULL || type_specifiers != 0) {
2918 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2919 * declaration, so it doesn't generate errors about expecting '(' or
2921 switch (look_ahead(1)->kind) {
2928 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2932 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2937 goto finish_specifiers;
2941 type_t *const typedef_type = get_typedef_type(token.identifier.symbol);
2942 if (typedef_type == NULL) {
2943 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2944 * declaration, so it doesn't generate 'implicit int' followed by more
2945 * errors later on. */
2946 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2952 errorf(HERE, "%K does not name a type", &token);
2954 symbol_t *symbol = token.identifier.symbol;
2956 = create_error_entity(symbol, ENTITY_TYPEDEF);
2958 type = allocate_type_zero(TYPE_TYPEDEF);
2959 type->typedeft.typedefe = &entity->typedefe;
2967 goto finish_specifiers;
2972 type = typedef_type;
2976 /* function specifier */
2978 goto finish_specifiers;
2983 specifiers->attributes = parse_attributes(specifiers->attributes);
2985 if (type == NULL || (saw_error && type_specifiers != 0)) {
2986 atomic_type_kind_t atomic_type;
2988 /* match valid basic types */
2989 switch (type_specifiers) {
2990 case SPECIFIER_VOID:
2991 atomic_type = ATOMIC_TYPE_VOID;
2993 case SPECIFIER_WCHAR_T:
2994 atomic_type = ATOMIC_TYPE_WCHAR_T;
2996 case SPECIFIER_CHAR:
2997 atomic_type = ATOMIC_TYPE_CHAR;
2999 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3000 atomic_type = ATOMIC_TYPE_SCHAR;
3002 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3003 atomic_type = ATOMIC_TYPE_UCHAR;
3005 case SPECIFIER_SHORT:
3006 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3007 case SPECIFIER_SHORT | SPECIFIER_INT:
3008 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3009 atomic_type = ATOMIC_TYPE_SHORT;
3011 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3012 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3013 atomic_type = ATOMIC_TYPE_USHORT;
3016 case SPECIFIER_SIGNED:
3017 case SPECIFIER_SIGNED | SPECIFIER_INT:
3018 atomic_type = ATOMIC_TYPE_INT;
3020 case SPECIFIER_UNSIGNED:
3021 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3022 atomic_type = ATOMIC_TYPE_UINT;
3024 case SPECIFIER_LONG:
3025 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3026 case SPECIFIER_LONG | SPECIFIER_INT:
3027 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3028 atomic_type = ATOMIC_TYPE_LONG;
3030 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3031 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3032 atomic_type = ATOMIC_TYPE_ULONG;
3035 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3036 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3037 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3038 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3040 atomic_type = ATOMIC_TYPE_LONGLONG;
3041 goto warn_about_long_long;
3043 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3044 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3046 atomic_type = ATOMIC_TYPE_ULONGLONG;
3047 warn_about_long_long:
3048 warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
3051 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3052 atomic_type = unsigned_int8_type_kind;
3055 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3056 atomic_type = unsigned_int16_type_kind;
3059 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3060 atomic_type = unsigned_int32_type_kind;
3063 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3064 atomic_type = unsigned_int64_type_kind;
3067 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3068 atomic_type = unsigned_int128_type_kind;
3071 case SPECIFIER_INT8:
3072 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3073 atomic_type = int8_type_kind;
3076 case SPECIFIER_INT16:
3077 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3078 atomic_type = int16_type_kind;
3081 case SPECIFIER_INT32:
3082 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3083 atomic_type = int32_type_kind;
3086 case SPECIFIER_INT64:
3087 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3088 atomic_type = int64_type_kind;
3091 case SPECIFIER_INT128:
3092 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3093 atomic_type = int128_type_kind;
3096 case SPECIFIER_FLOAT:
3097 atomic_type = ATOMIC_TYPE_FLOAT;
3099 case SPECIFIER_DOUBLE:
3100 atomic_type = ATOMIC_TYPE_DOUBLE;
3102 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3103 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3105 case SPECIFIER_BOOL:
3106 atomic_type = ATOMIC_TYPE_BOOL;
3108 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3109 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3110 atomic_type = ATOMIC_TYPE_FLOAT;
3112 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3113 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3114 atomic_type = ATOMIC_TYPE_DOUBLE;
3116 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3117 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3118 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3121 /* invalid specifier combination, give an error message */
3122 source_position_t const* const pos = &specifiers->source_position;
3123 if (type_specifiers == 0) {
3125 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3126 if (!(c_mode & _CXX) && !strict_mode) {
3127 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3128 atomic_type = ATOMIC_TYPE_INT;
3131 errorf(pos, "no type specifiers given in declaration");
3134 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3135 (type_specifiers & SPECIFIER_UNSIGNED)) {
3136 errorf(pos, "signed and unsigned specifiers given");
3137 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3138 errorf(pos, "only integer types can be signed or unsigned");
3140 errorf(pos, "multiple datatypes in declaration");
3146 if (type_specifiers & SPECIFIER_COMPLEX) {
3147 type = allocate_type_zero(TYPE_COMPLEX);
3148 type->complex.akind = atomic_type;
3149 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3150 type = allocate_type_zero(TYPE_IMAGINARY);
3151 type->imaginary.akind = atomic_type;
3153 type = allocate_type_zero(TYPE_ATOMIC);
3154 type->atomic.akind = atomic_type;
3157 } else if (type_specifiers != 0) {
3158 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3161 /* FIXME: check type qualifiers here */
3162 type->base.qualifiers = qualifiers;
3165 type = identify_new_type(type);
3167 type = typehash_insert(type);
3170 if (specifiers->attributes != NULL)
3171 type = handle_type_attributes(specifiers->attributes, type);
3172 specifiers->type = type;
3176 specifiers->type = type_error_type;
3179 static type_qualifiers_t parse_type_qualifiers(void)
3181 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3184 switch (token.kind) {
3185 /* type qualifiers */
3186 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3187 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3188 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3189 /* microsoft extended type modifiers */
3190 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3191 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3192 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3193 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3194 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3203 * Parses an K&R identifier list
3205 static void parse_identifier_list(scope_t *scope)
3207 assert(token.kind == T_IDENTIFIER);
3209 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.identifier.symbol);
3210 entity->base.source_position = token.base.source_position;
3211 /* a K&R parameter has no type, yet */
3215 append_entity(scope, entity);
3216 } while (next_if(',') && token.kind == T_IDENTIFIER);
3219 static entity_t *parse_parameter(void)
3221 declaration_specifiers_t specifiers;
3222 parse_declaration_specifiers(&specifiers);
3224 entity_t *entity = parse_declarator(&specifiers,
3225 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3226 anonymous_entity = NULL;
3230 static void semantic_parameter_incomplete(const entity_t *entity)
3232 assert(entity->kind == ENTITY_PARAMETER);
3234 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3235 * list in a function declarator that is part of a
3236 * definition of that function shall not have
3237 * incomplete type. */
3238 type_t *type = skip_typeref(entity->declaration.type);
3239 if (is_type_incomplete(type)) {
3240 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3244 static bool has_parameters(void)
3246 /* func(void) is not a parameter */
3247 if (token.kind == T_IDENTIFIER) {
3248 entity_t const *const entity
3249 = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3252 if (entity->kind != ENTITY_TYPEDEF)
3254 if (skip_typeref(entity->typedefe.type) != type_void)
3256 } else if (token.kind != T_void) {
3259 if (look_ahead(1)->kind != ')')
3266 * Parses function type parameters (and optionally creates variable_t entities
3267 * for them in a scope)
3269 static void parse_parameters(function_type_t *type, scope_t *scope)
3272 add_anchor_token(')');
3273 int saved_comma_state = save_and_reset_anchor_state(',');
3275 if (token.kind == T_IDENTIFIER
3276 && !is_typedef_symbol(token.identifier.symbol)) {
3277 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3278 if (la1_type == ',' || la1_type == ')') {
3279 type->kr_style_parameters = true;
3280 parse_identifier_list(scope);
3281 goto parameters_finished;
3285 if (token.kind == ')') {
3286 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3287 if (!(c_mode & _CXX))
3288 type->unspecified_parameters = true;
3289 } else if (has_parameters()) {
3290 function_parameter_t **anchor = &type->parameters;
3292 switch (token.kind) {
3295 type->variadic = true;
3296 goto parameters_finished;
3301 entity_t *entity = parse_parameter();
3302 if (entity->kind == ENTITY_TYPEDEF) {
3303 errorf(&entity->base.source_position,
3304 "typedef not allowed as function parameter");
3307 assert(is_declaration(entity));
3309 semantic_parameter_incomplete(entity);
3311 function_parameter_t *const parameter =
3312 allocate_parameter(entity->declaration.type);
3314 if (scope != NULL) {
3315 append_entity(scope, entity);
3318 *anchor = parameter;
3319 anchor = ¶meter->next;
3324 goto parameters_finished;
3326 } while (next_if(','));
3329 parameters_finished:
3330 rem_anchor_token(')');
3331 expect(')', end_error);
3334 restore_anchor_state(',', saved_comma_state);
3337 typedef enum construct_type_kind_t {
3340 CONSTRUCT_REFERENCE,
3343 } construct_type_kind_t;
3345 typedef union construct_type_t construct_type_t;
3347 typedef struct construct_type_base_t {
3348 construct_type_kind_t kind;
3349 source_position_t pos;
3350 construct_type_t *next;
3351 } construct_type_base_t;
3353 typedef struct parsed_pointer_t {
3354 construct_type_base_t base;
3355 type_qualifiers_t type_qualifiers;
3356 variable_t *base_variable; /**< MS __based extension. */
3359 typedef struct parsed_reference_t {
3360 construct_type_base_t base;
3361 } parsed_reference_t;
3363 typedef struct construct_function_type_t {
3364 construct_type_base_t base;
3365 type_t *function_type;
3366 } construct_function_type_t;
3368 typedef struct parsed_array_t {
3369 construct_type_base_t base;
3370 type_qualifiers_t type_qualifiers;
3376 union construct_type_t {
3377 construct_type_kind_t kind;
3378 construct_type_base_t base;
3379 parsed_pointer_t pointer;
3380 parsed_reference_t reference;
3381 construct_function_type_t function;
3382 parsed_array_t array;
3385 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3387 construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3388 memset(cons, 0, size);
3390 cons->base.pos = *HERE;
3395 static construct_type_t *parse_pointer_declarator(void)
3397 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3399 cons->pointer.type_qualifiers = parse_type_qualifiers();
3400 //cons->pointer.base_variable = base_variable;
3405 /* ISO/IEC 14882:1998(E) §8.3.2 */
3406 static construct_type_t *parse_reference_declarator(void)
3408 if (!(c_mode & _CXX))
3409 errorf(HERE, "references are only available for C++");
3411 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3418 static construct_type_t *parse_array_declarator(void)
3420 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3421 parsed_array_t *const array = &cons->array;
3424 add_anchor_token(']');
3426 bool is_static = next_if(T_static);
3428 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3431 is_static = next_if(T_static);
3433 array->type_qualifiers = type_qualifiers;
3434 array->is_static = is_static;
3436 expression_t *size = NULL;
3437 if (token.kind == '*' && look_ahead(1)->kind == ']') {
3438 array->is_variable = true;
3440 } else if (token.kind != ']') {
3441 size = parse_assignment_expression();
3443 /* §6.7.5.2:1 Array size must have integer type */
3444 type_t *const orig_type = size->base.type;
3445 type_t *const type = skip_typeref(orig_type);
3446 if (!is_type_integer(type) && is_type_valid(type)) {
3447 errorf(&size->base.source_position,
3448 "array size '%E' must have integer type but has type '%T'",
3453 mark_vars_read(size, NULL);
3456 if (is_static && size == NULL)
3457 errorf(&array->base.pos, "static array parameters require a size");
3459 rem_anchor_token(']');
3460 expect(']', end_error);
3467 static construct_type_t *parse_function_declarator(scope_t *scope)
3469 construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3471 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3472 function_type_t *ftype = &type->function;
3474 ftype->linkage = current_linkage;
3475 ftype->calling_convention = CC_DEFAULT;
3477 parse_parameters(ftype, scope);
3479 cons->function.function_type = type;
3484 typedef struct parse_declarator_env_t {
3485 bool may_be_abstract : 1;
3486 bool must_be_abstract : 1;
3487 decl_modifiers_t modifiers;
3489 source_position_t source_position;
3491 attribute_t *attributes;
3492 } parse_declarator_env_t;
3495 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3497 /* construct a single linked list of construct_type_t's which describe
3498 * how to construct the final declarator type */
3499 construct_type_t *first = NULL;
3500 construct_type_t **anchor = &first;
3502 env->attributes = parse_attributes(env->attributes);
3505 construct_type_t *type;
3506 //variable_t *based = NULL; /* MS __based extension */
3507 switch (token.kind) {
3509 type = parse_reference_declarator();
3513 panic("based not supported anymore");
3518 type = parse_pointer_declarator();
3522 goto ptr_operator_end;
3526 anchor = &type->base.next;
3528 /* TODO: find out if this is correct */
3529 env->attributes = parse_attributes(env->attributes);
3533 construct_type_t *inner_types = NULL;
3535 switch (token.kind) {
3537 if (env->must_be_abstract) {
3538 errorf(HERE, "no identifier expected in typename");
3540 env->symbol = token.identifier.symbol;
3541 env->source_position = token.base.source_position;
3547 /* Parenthesized declarator or function declarator? */
3548 token_t const *const la1 = look_ahead(1);
3549 switch (la1->kind) {
3551 if (is_typedef_symbol(la1->identifier.symbol)) {
3553 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3554 * interpreted as ``function with no parameter specification'', rather
3555 * than redundant parentheses around the omitted identifier. */
3557 /* Function declarator. */
3558 if (!env->may_be_abstract) {
3559 errorf(HERE, "function declarator must have a name");
3566 case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3567 /* Paranthesized declarator. */
3569 add_anchor_token(')');
3570 inner_types = parse_inner_declarator(env);
3571 if (inner_types != NULL) {
3572 /* All later declarators only modify the return type */
3573 env->must_be_abstract = true;
3575 rem_anchor_token(')');
3576 expect(')', end_error);
3584 if (env->may_be_abstract)
3586 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3591 construct_type_t **const p = anchor;
3594 construct_type_t *type;
3595 switch (token.kind) {
3597 scope_t *scope = NULL;
3598 if (!env->must_be_abstract) {
3599 scope = &env->parameters;
3602 type = parse_function_declarator(scope);
3606 type = parse_array_declarator();
3609 goto declarator_finished;
3612 /* insert in the middle of the list (at p) */
3613 type->base.next = *p;
3616 anchor = &type->base.next;
3619 declarator_finished:
3620 /* append inner_types at the end of the list, we don't to set anchor anymore
3621 * as it's not needed anymore */
3622 *anchor = inner_types;
3629 static type_t *construct_declarator_type(construct_type_t *construct_list,
3632 construct_type_t *iter = construct_list;
3633 for (; iter != NULL; iter = iter->base.next) {
3634 source_position_t const* const pos = &iter->base.pos;
3635 switch (iter->kind) {
3636 case CONSTRUCT_INVALID:
3638 case CONSTRUCT_FUNCTION: {
3639 construct_function_type_t *function = &iter->function;
3640 type_t *function_type = function->function_type;
3642 function_type->function.return_type = type;
3644 type_t *skipped_return_type = skip_typeref(type);
3646 if (is_type_function(skipped_return_type)) {
3647 errorf(pos, "function returning function is not allowed");
3648 } else if (is_type_array(skipped_return_type)) {
3649 errorf(pos, "function returning array is not allowed");
3651 if (skipped_return_type->base.qualifiers != 0) {
3652 warningf(WARN_OTHER, pos, "type qualifiers in return type of function type are meaningless");
3656 /* The function type was constructed earlier. Freeing it here will
3657 * destroy other types. */
3658 type = typehash_insert(function_type);
3662 case CONSTRUCT_POINTER: {
3663 if (is_type_reference(skip_typeref(type)))
3664 errorf(pos, "cannot declare a pointer to reference");
3666 parsed_pointer_t *pointer = &iter->pointer;
3667 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3671 case CONSTRUCT_REFERENCE:
3672 if (is_type_reference(skip_typeref(type)))
3673 errorf(pos, "cannot declare a reference to reference");
3675 type = make_reference_type(type);
3678 case CONSTRUCT_ARRAY: {
3679 if (is_type_reference(skip_typeref(type)))
3680 errorf(pos, "cannot declare an array of references");
3682 parsed_array_t *array = &iter->array;
3683 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3685 expression_t *size_expression = array->size;
3686 if (size_expression != NULL) {
3688 = create_implicit_cast(size_expression, type_size_t);
3691 array_type->base.qualifiers = array->type_qualifiers;
3692 array_type->array.element_type = type;
3693 array_type->array.is_static = array->is_static;
3694 array_type->array.is_variable = array->is_variable;
3695 array_type->array.size_expression = size_expression;
3697 if (size_expression != NULL) {
3698 switch (is_constant_expression(size_expression)) {
3699 case EXPR_CLASS_CONSTANT: {
3700 long const size = fold_constant_to_int(size_expression);
3701 array_type->array.size = size;
3702 array_type->array.size_constant = true;
3703 /* §6.7.5.2:1 If the expression is a constant expression,
3704 * it shall have a value greater than zero. */
3706 errorf(&size_expression->base.source_position,
3707 "size of array must be greater than zero");
3708 } else if (size == 0 && !GNU_MODE) {
3709 errorf(&size_expression->base.source_position,
3710 "size of array must be greater than zero (zero length arrays are a GCC extension)");
3715 case EXPR_CLASS_VARIABLE:
3716 array_type->array.is_vla = true;
3719 case EXPR_CLASS_ERROR:
3724 type_t *skipped_type = skip_typeref(type);
3726 if (is_type_incomplete(skipped_type)) {
3727 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3728 } else if (is_type_function(skipped_type)) {
3729 errorf(pos, "array of functions is not allowed");
3731 type = identify_new_type(array_type);
3735 internal_errorf(pos, "invalid type construction found");
3741 static type_t *automatic_type_conversion(type_t *orig_type);
3743 static type_t *semantic_parameter(const source_position_t *pos,
3745 const declaration_specifiers_t *specifiers,
3746 entity_t const *const param)
3748 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3749 * shall be adjusted to ``qualified pointer to type'',
3751 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3752 * type'' shall be adjusted to ``pointer to function
3753 * returning type'', as in 6.3.2.1. */
3754 type = automatic_type_conversion(type);
3756 if (specifiers->is_inline && is_type_valid(type)) {
3757 errorf(pos, "'%N' declared 'inline'", param);
3760 /* §6.9.1:6 The declarations in the declaration list shall contain
3761 * no storage-class specifier other than register and no
3762 * initializations. */
3763 if (specifiers->thread_local || (
3764 specifiers->storage_class != STORAGE_CLASS_NONE &&
3765 specifiers->storage_class != STORAGE_CLASS_REGISTER)
3767 errorf(pos, "invalid storage class for '%N'", param);
3770 /* delay test for incomplete type, because we might have (void)
3771 * which is legal but incomplete... */
3776 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3777 declarator_flags_t flags)
3779 parse_declarator_env_t env;
3780 memset(&env, 0, sizeof(env));
3781 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3783 construct_type_t *construct_type = parse_inner_declarator(&env);
3785 construct_declarator_type(construct_type, specifiers->type);
3786 type_t *type = skip_typeref(orig_type);
3788 if (construct_type != NULL) {
3789 obstack_free(&temp_obst, construct_type);
3792 attribute_t *attributes = parse_attributes(env.attributes);
3793 /* append (shared) specifier attribute behind attributes of this
3795 attribute_t **anchor = &attributes;
3796 while (*anchor != NULL)
3797 anchor = &(*anchor)->next;
3798 *anchor = specifiers->attributes;
3801 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3802 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3803 entity->base.source_position = env.source_position;
3804 entity->typedefe.type = orig_type;
3806 if (anonymous_entity != NULL) {
3807 if (is_type_compound(type)) {
3808 assert(anonymous_entity->compound.alias == NULL);
3809 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3810 anonymous_entity->kind == ENTITY_UNION);
3811 anonymous_entity->compound.alias = entity;
3812 anonymous_entity = NULL;
3813 } else if (is_type_enum(type)) {
3814 assert(anonymous_entity->enume.alias == NULL);
3815 assert(anonymous_entity->kind == ENTITY_ENUM);
3816 anonymous_entity->enume.alias = entity;
3817 anonymous_entity = NULL;
3821 /* create a declaration type entity */
3822 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3823 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3825 if (env.symbol != NULL) {
3826 if (specifiers->is_inline && is_type_valid(type)) {
3827 errorf(&env.source_position,
3828 "compound member '%Y' declared 'inline'", env.symbol);
3831 if (specifiers->thread_local ||
3832 specifiers->storage_class != STORAGE_CLASS_NONE) {
3833 errorf(&env.source_position,
3834 "compound member '%Y' must have no storage class",
3838 } else if (flags & DECL_IS_PARAMETER) {
3839 entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3840 orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3841 } else if (is_type_function(type)) {
3842 entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3843 entity->function.is_inline = specifiers->is_inline;
3844 entity->function.elf_visibility = default_visibility;
3845 entity->function.parameters = env.parameters;
3847 if (env.symbol != NULL) {
3848 /* this needs fixes for C++ */
3849 bool in_function_scope = current_function != NULL;
3851 if (specifiers->thread_local || (
3852 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3853 specifiers->storage_class != STORAGE_CLASS_NONE &&
3854 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3856 errorf(&env.source_position, "invalid storage class for '%N'", entity);
3860 entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3861 entity->variable.elf_visibility = default_visibility;
3862 entity->variable.thread_local = specifiers->thread_local;
3864 if (env.symbol != NULL) {
3865 if (specifiers->is_inline && is_type_valid(type)) {
3866 errorf(&env.source_position, "'%N' declared 'inline'", entity);
3869 bool invalid_storage_class = false;
3870 if (current_scope == file_scope) {
3871 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3872 specifiers->storage_class != STORAGE_CLASS_NONE &&
3873 specifiers->storage_class != STORAGE_CLASS_STATIC) {
3874 invalid_storage_class = true;
3877 if (specifiers->thread_local &&
3878 specifiers->storage_class == STORAGE_CLASS_NONE) {
3879 invalid_storage_class = true;
3882 if (invalid_storage_class) {
3883 errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3888 entity->base.source_position = env.symbol != NULL ? env.source_position : specifiers->source_position;
3889 entity->declaration.type = orig_type;
3890 entity->declaration.alignment = get_type_alignment(orig_type);
3891 entity->declaration.modifiers = env.modifiers;
3892 entity->declaration.attributes = attributes;
3894 storage_class_t storage_class = specifiers->storage_class;
3895 entity->declaration.declared_storage_class = storage_class;
3897 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3898 storage_class = STORAGE_CLASS_AUTO;
3899 entity->declaration.storage_class = storage_class;
3902 if (attributes != NULL) {
3903 handle_entity_attributes(attributes, entity);
3909 static type_t *parse_abstract_declarator(type_t *base_type)
3911 parse_declarator_env_t env;
3912 memset(&env, 0, sizeof(env));
3913 env.may_be_abstract = true;
3914 env.must_be_abstract = true;
3916 construct_type_t *construct_type = parse_inner_declarator(&env);
3918 type_t *result = construct_declarator_type(construct_type, base_type);
3919 if (construct_type != NULL) {
3920 obstack_free(&temp_obst, construct_type);
3922 result = handle_type_attributes(env.attributes, result);
3928 * Check if the declaration of main is suspicious. main should be a
3929 * function with external linkage, returning int, taking either zero
3930 * arguments, two, or three arguments of appropriate types, ie.
3932 * int main([ int argc, char **argv [, char **env ] ]).
3934 * @param decl the declaration to check
3935 * @param type the function type of the declaration
3937 static void check_main(const entity_t *entity)
3939 const source_position_t *pos = &entity->base.source_position;
3940 if (entity->kind != ENTITY_FUNCTION) {
3941 warningf(WARN_MAIN, pos, "'main' is not a function");
3945 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3946 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3949 type_t *type = skip_typeref(entity->declaration.type);
3950 assert(is_type_function(type));
3952 function_type_t const *const func_type = &type->function;
3953 type_t *const ret_type = func_type->return_type;
3954 if (!types_compatible(skip_typeref(ret_type), type_int)) {
3955 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3957 const function_parameter_t *parm = func_type->parameters;
3959 type_t *const first_type = skip_typeref(parm->type);
3960 type_t *const first_type_unqual = get_unqualified_type(first_type);
3961 if (!types_compatible(first_type_unqual, type_int)) {
3962 warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3966 type_t *const second_type = skip_typeref(parm->type);
3967 type_t *const second_type_unqual
3968 = get_unqualified_type(second_type);
3969 if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3970 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3974 type_t *const third_type = skip_typeref(parm->type);
3975 type_t *const third_type_unqual
3976 = get_unqualified_type(third_type);
3977 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3978 warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3982 goto warn_arg_count;
3986 warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3992 * Check if a symbol is the equal to "main".
3994 static bool is_sym_main(const symbol_t *const sym)
3996 return strcmp(sym->string, "main") == 0;
3999 static void error_redefined_as_different_kind(const source_position_t *pos,
4000 const entity_t *old, entity_kind_t new_kind)
4002 char const *const what = get_entity_kind_name(new_kind);
4003 source_position_t const *const ppos = &old->base.source_position;
4004 errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
4007 static bool is_entity_valid(entity_t *const ent)
4009 if (is_declaration(ent)) {
4010 return is_type_valid(skip_typeref(ent->declaration.type));
4011 } else if (ent->kind == ENTITY_TYPEDEF) {
4012 return is_type_valid(skip_typeref(ent->typedefe.type));
4017 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4019 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4020 if (attributes_equal(tattr, attr))
4027 * test wether new_list contains any attributes not included in old_list
4029 static bool has_new_attributes(const attribute_t *old_list,
4030 const attribute_t *new_list)
4032 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4033 if (!contains_attribute(old_list, attr))
4040 * Merge in attributes from an attribute list (probably from a previous
4041 * declaration with the same name). Warning: destroys the old structure
4042 * of the attribute list - don't reuse attributes after this call.
4044 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4047 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4049 if (contains_attribute(decl->attributes, attr))
4052 /* move attribute to new declarations attributes list */
4053 attr->next = decl->attributes;
4054 decl->attributes = attr;
4059 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4060 * for various problems that occur for multiple definitions
4062 entity_t *record_entity(entity_t *entity, const bool is_definition)
4064 const symbol_t *const symbol = entity->base.symbol;
4065 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4066 const source_position_t *pos = &entity->base.source_position;
4068 /* can happen in error cases */
4072 entity_t *const previous_entity = get_entity(symbol, namespc);
4073 /* pushing the same entity twice will break the stack structure */
4074 assert(previous_entity != entity);
4076 if (entity->kind == ENTITY_FUNCTION) {
4077 type_t *const orig_type = entity->declaration.type;
4078 type_t *const type = skip_typeref(orig_type);
4080 assert(is_type_function(type));
4081 if (type->function.unspecified_parameters &&
4082 previous_entity == NULL &&
4083 !entity->declaration.implicit) {
4084 warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4087 if (current_scope == file_scope && is_sym_main(symbol)) {
4092 if (is_declaration(entity) &&
4093 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4094 current_scope != file_scope &&
4095 !entity->declaration.implicit) {
4096 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4099 if (previous_entity != NULL) {
4100 source_position_t const *const ppos = &previous_entity->base.source_position;
4102 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4103 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4104 assert(previous_entity->kind == ENTITY_PARAMETER);
4105 errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4109 if (previous_entity->base.parent_scope == current_scope) {
4110 if (previous_entity->kind != entity->kind) {
4111 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4112 error_redefined_as_different_kind(pos, previous_entity,
4117 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4118 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4121 if (previous_entity->kind == ENTITY_TYPEDEF) {
4122 /* TODO: C++ allows this for exactly the same type */
4123 errorf(pos, "redefinition of '%N' (declared %P)", entity, ppos);
4127 /* at this point we should have only VARIABLES or FUNCTIONS */
4128 assert(is_declaration(previous_entity) && is_declaration(entity));
4130 declaration_t *const prev_decl = &previous_entity->declaration;
4131 declaration_t *const decl = &entity->declaration;
4133 /* can happen for K&R style declarations */
4134 if (prev_decl->type == NULL &&
4135 previous_entity->kind == ENTITY_PARAMETER &&
4136 entity->kind == ENTITY_PARAMETER) {
4137 prev_decl->type = decl->type;
4138 prev_decl->storage_class = decl->storage_class;
4139 prev_decl->declared_storage_class = decl->declared_storage_class;
4140 prev_decl->modifiers = decl->modifiers;
4141 return previous_entity;
4144 type_t *const type = skip_typeref(decl->type);
4145 type_t *const prev_type = skip_typeref(prev_decl->type);
4147 if (!types_compatible(type, prev_type)) {
4148 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4150 unsigned old_storage_class = prev_decl->storage_class;
4152 if (is_definition &&
4154 !(prev_decl->modifiers & DM_USED) &&
4155 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4156 warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4159 storage_class_t new_storage_class = decl->storage_class;
4161 /* pretend no storage class means extern for function
4162 * declarations (except if the previous declaration is neither
4163 * none nor extern) */
4164 if (entity->kind == ENTITY_FUNCTION) {
4165 /* the previous declaration could have unspecified parameters or
4166 * be a typedef, so use the new type */
4167 if (prev_type->function.unspecified_parameters || is_definition)
4168 prev_decl->type = type;
4170 switch (old_storage_class) {
4171 case STORAGE_CLASS_NONE:
4172 old_storage_class = STORAGE_CLASS_EXTERN;
4175 case STORAGE_CLASS_EXTERN:
4176 if (is_definition) {
4177 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4178 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4180 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4181 new_storage_class = STORAGE_CLASS_EXTERN;
4188 } else if (is_type_incomplete(prev_type)) {
4189 prev_decl->type = type;
4192 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4193 new_storage_class == STORAGE_CLASS_EXTERN) {
4195 warn_redundant_declaration: ;
4197 = has_new_attributes(prev_decl->attributes,
4199 if (has_new_attrs) {
4200 merge_in_attributes(decl, prev_decl->attributes);
4201 } else if (!is_definition &&
4202 is_type_valid(prev_type) &&
4203 strcmp(ppos->input_name, "<builtin>") != 0) {
4204 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4206 } else if (current_function == NULL) {
4207 if (old_storage_class != STORAGE_CLASS_STATIC &&
4208 new_storage_class == STORAGE_CLASS_STATIC) {
4209 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4210 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4211 prev_decl->storage_class = STORAGE_CLASS_NONE;
4212 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4214 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4216 goto error_redeclaration;
4217 goto warn_redundant_declaration;
4219 } else if (is_type_valid(prev_type)) {
4220 if (old_storage_class == new_storage_class) {
4221 error_redeclaration:
4222 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4224 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4229 prev_decl->modifiers |= decl->modifiers;
4230 if (entity->kind == ENTITY_FUNCTION) {
4231 previous_entity->function.is_inline |= entity->function.is_inline;
4233 return previous_entity;
4237 if (is_warn_on(why = WARN_SHADOW) ||
4238 (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4239 char const *const what = get_entity_kind_name(previous_entity->kind);
4240 warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4244 if (entity->kind == ENTITY_FUNCTION) {
4245 if (is_definition &&
4246 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4247 !is_sym_main(symbol)) {
4248 if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4249 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4251 goto warn_missing_declaration;
4254 } else if (entity->kind == ENTITY_VARIABLE) {
4255 if (current_scope == file_scope &&
4256 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4257 !entity->declaration.implicit) {
4258 warn_missing_declaration:
4259 warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4264 assert(entity->base.parent_scope == NULL);
4265 assert(current_scope != NULL);
4267 entity->base.parent_scope = current_scope;
4268 environment_push(entity);
4269 append_entity(current_scope, entity);
4274 static void parser_error_multiple_definition(entity_t *entity,
4275 const source_position_t *source_position)
4277 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4278 entity->base.symbol, &entity->base.source_position);
4281 static bool is_declaration_specifier(const token_t *token)
4283 switch (token->kind) {
4287 return is_typedef_symbol(token->identifier.symbol);
4294 static void parse_init_declarator_rest(entity_t *entity)
4296 type_t *orig_type = type_error_type;
4298 if (entity->base.kind == ENTITY_TYPEDEF) {
4299 source_position_t const *const pos = &entity->base.source_position;
4300 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4302 assert(is_declaration(entity));
4303 orig_type = entity->declaration.type;
4306 type_t *type = skip_typeref(orig_type);
4308 if (entity->kind == ENTITY_VARIABLE
4309 && entity->variable.initializer != NULL) {
4310 parser_error_multiple_definition(entity, HERE);
4314 declaration_t *const declaration = &entity->declaration;
4315 bool must_be_constant = false;
4316 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4317 entity->base.parent_scope == file_scope) {
4318 must_be_constant = true;
4321 if (is_type_function(type)) {
4322 source_position_t const *const pos = &entity->base.source_position;
4323 errorf(pos, "'%N' is initialized like a variable", entity);
4324 orig_type = type_error_type;
4327 parse_initializer_env_t env;
4328 env.type = orig_type;
4329 env.must_be_constant = must_be_constant;
4330 env.entity = entity;
4332 initializer_t *initializer = parse_initializer(&env);
4334 if (entity->kind == ENTITY_VARIABLE) {
4335 /* §6.7.5:22 array initializers for arrays with unknown size
4336 * determine the array type size */
4337 declaration->type = env.type;
4338 entity->variable.initializer = initializer;
4342 /* parse rest of a declaration without any declarator */
4343 static void parse_anonymous_declaration_rest(
4344 const declaration_specifiers_t *specifiers)
4347 anonymous_entity = NULL;
4349 source_position_t const *const pos = &specifiers->source_position;
4350 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4351 specifiers->thread_local) {
4352 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4355 type_t *type = specifiers->type;
4356 switch (type->kind) {
4357 case TYPE_COMPOUND_STRUCT:
4358 case TYPE_COMPOUND_UNION: {
4359 if (type->compound.compound->base.symbol == NULL) {
4360 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4369 warningf(WARN_OTHER, pos, "empty declaration");
4374 static void check_variable_type_complete(entity_t *ent)
4376 if (ent->kind != ENTITY_VARIABLE)
4379 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4380 * type for the object shall be complete [...] */
4381 declaration_t *decl = &ent->declaration;
4382 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4383 decl->storage_class == STORAGE_CLASS_STATIC)
4386 type_t *const type = skip_typeref(decl->type);
4387 if (!is_type_incomplete(type))
4390 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4391 * are given length one. */
4392 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4393 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4397 errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4401 static void parse_declaration_rest(entity_t *ndeclaration,
4402 const declaration_specifiers_t *specifiers,
4403 parsed_declaration_func finished_declaration,
4404 declarator_flags_t flags)
4406 add_anchor_token(';');
4407 add_anchor_token(',');
4409 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4411 if (token.kind == '=') {
4412 parse_init_declarator_rest(entity);
4413 } else if (entity->kind == ENTITY_VARIABLE) {
4414 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4415 * [...] where the extern specifier is explicitly used. */
4416 declaration_t *decl = &entity->declaration;
4417 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4418 type_t *type = decl->type;
4419 if (is_type_reference(skip_typeref(type))) {
4420 source_position_t const *const pos = &entity->base.source_position;
4421 errorf(pos, "reference '%#N' must be initialized", entity);
4426 check_variable_type_complete(entity);
4431 add_anchor_token('=');
4432 ndeclaration = parse_declarator(specifiers, flags);
4433 rem_anchor_token('=');
4435 expect(';', end_error);
4438 anonymous_entity = NULL;
4439 rem_anchor_token(';');
4440 rem_anchor_token(',');
4443 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4445 symbol_t *symbol = entity->base.symbol;
4449 assert(entity->base.namespc == NAMESPACE_NORMAL);
4450 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4451 if (previous_entity == NULL
4452 || previous_entity->base.parent_scope != current_scope) {
4453 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4458 if (is_definition) {
4459 errorf(HERE, "'%N' is initialised", entity);
4462 return record_entity(entity, false);
4465 static void parse_declaration(parsed_declaration_func finished_declaration,
4466 declarator_flags_t flags)
4468 add_anchor_token(';');
4469 declaration_specifiers_t specifiers;
4470 parse_declaration_specifiers(&specifiers);
4471 rem_anchor_token(';');
4473 if (token.kind == ';') {
4474 parse_anonymous_declaration_rest(&specifiers);
4476 entity_t *entity = parse_declarator(&specifiers, flags);
4477 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4482 static type_t *get_default_promoted_type(type_t *orig_type)
4484 type_t *result = orig_type;
4486 type_t *type = skip_typeref(orig_type);
4487 if (is_type_integer(type)) {
4488 result = promote_integer(type);
4489 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4490 result = type_double;
4496 static void parse_kr_declaration_list(entity_t *entity)
4498 if (entity->kind != ENTITY_FUNCTION)
4501 type_t *type = skip_typeref(entity->declaration.type);
4502 assert(is_type_function(type));
4503 if (!type->function.kr_style_parameters)
4506 add_anchor_token('{');
4508 PUSH_SCOPE(&entity->function.parameters);
4510 entity_t *parameter = entity->function.parameters.entities;
4511 for ( ; parameter != NULL; parameter = parameter->base.next) {
4512 assert(parameter->base.parent_scope == NULL);
4513 parameter->base.parent_scope = current_scope;
4514 environment_push(parameter);
4517 /* parse declaration list */
4519 switch (token.kind) {
4521 /* This covers symbols, which are no type, too, and results in
4522 * better error messages. The typical cases are misspelled type
4523 * names and missing includes. */
4525 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4535 /* update function type */
4536 type_t *new_type = duplicate_type(type);
4538 function_parameter_t *parameters = NULL;
4539 function_parameter_t **anchor = ¶meters;
4541 /* did we have an earlier prototype? */
4542 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4543 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4546 function_parameter_t *proto_parameter = NULL;
4547 if (proto_type != NULL) {
4548 type_t *proto_type_type = proto_type->declaration.type;
4549 proto_parameter = proto_type_type->function.parameters;
4550 /* If a K&R function definition has a variadic prototype earlier, then
4551 * make the function definition variadic, too. This should conform to
4552 * §6.7.5.3:15 and §6.9.1:8. */
4553 new_type->function.variadic = proto_type_type->function.variadic;
4555 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4557 new_type->function.unspecified_parameters = true;
4560 bool need_incompatible_warning = false;
4561 parameter = entity->function.parameters.entities;
4562 for (; parameter != NULL; parameter = parameter->base.next,
4564 proto_parameter == NULL ? NULL : proto_parameter->next) {
4565 if (parameter->kind != ENTITY_PARAMETER)
4568 type_t *parameter_type = parameter->declaration.type;
4569 if (parameter_type == NULL) {
4570 source_position_t const* const pos = ¶meter->base.source_position;
4572 errorf(pos, "no type specified for function '%N'", parameter);
4573 parameter_type = type_error_type;
4575 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4576 parameter_type = type_int;
4578 parameter->declaration.type = parameter_type;
4581 semantic_parameter_incomplete(parameter);
4583 /* we need the default promoted types for the function type */
4584 type_t *not_promoted = parameter_type;
4585 parameter_type = get_default_promoted_type(parameter_type);
4587 /* gcc special: if the type of the prototype matches the unpromoted
4588 * type don't promote */
4589 if (!strict_mode && proto_parameter != NULL) {
4590 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4591 type_t *promo_skip = skip_typeref(parameter_type);
4592 type_t *param_skip = skip_typeref(not_promoted);
4593 if (!types_compatible(proto_p_type, promo_skip)
4594 && types_compatible(proto_p_type, param_skip)) {
4596 need_incompatible_warning = true;
4597 parameter_type = not_promoted;
4600 function_parameter_t *const function_parameter
4601 = allocate_parameter(parameter_type);
4603 *anchor = function_parameter;
4604 anchor = &function_parameter->next;
4607 new_type->function.parameters = parameters;
4608 new_type = identify_new_type(new_type);
4610 if (need_incompatible_warning) {
4611 symbol_t const *const sym = entity->base.symbol;
4612 source_position_t const *const pos = &entity->base.source_position;
4613 source_position_t const *const ppos = &proto_type->base.source_position;
4614 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4616 entity->declaration.type = new_type;
4618 rem_anchor_token('{');
4621 static bool first_err = true;
4624 * When called with first_err set, prints the name of the current function,
4627 static void print_in_function(void)
4631 char const *const file = current_function->base.base.source_position.input_name;
4632 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4637 * Check if all labels are defined in the current function.
4638 * Check if all labels are used in the current function.
4640 static void check_labels(void)
4642 for (const goto_statement_t *goto_statement = goto_first;
4643 goto_statement != NULL;
4644 goto_statement = goto_statement->next) {
4645 /* skip computed gotos */
4646 if (goto_statement->expression != NULL)
4649 label_t *label = goto_statement->label;
4650 if (label->base.source_position.input_name == NULL) {
4651 print_in_function();
4652 source_position_t const *const pos = &goto_statement->base.source_position;
4653 errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4657 if (is_warn_on(WARN_UNUSED_LABEL)) {
4658 for (const label_statement_t *label_statement = label_first;
4659 label_statement != NULL;
4660 label_statement = label_statement->next) {
4661 label_t *label = label_statement->label;
4663 if (! label->used) {
4664 print_in_function();
4665 source_position_t const *const pos = &label_statement->base.source_position;
4666 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4672 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4674 entity_t const *const end = last != NULL ? last->base.next : NULL;
4675 for (; entity != end; entity = entity->base.next) {
4676 if (!is_declaration(entity))
4679 declaration_t *declaration = &entity->declaration;
4680 if (declaration->implicit)
4683 if (!declaration->used) {
4684 print_in_function();
4685 warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4686 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4687 print_in_function();
4688 warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4693 static void check_unused_variables(statement_t *const stmt, void *const env)
4697 switch (stmt->kind) {
4698 case STATEMENT_DECLARATION: {
4699 declaration_statement_t const *const decls = &stmt->declaration;
4700 warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4705 warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4714 * Check declarations of current_function for unused entities.
4716 static void check_declarations(void)
4718 if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4719 const scope_t *scope = ¤t_function->parameters;
4721 /* do not issue unused warnings for main */
4722 if (!is_sym_main(current_function->base.base.symbol)) {
4723 warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4726 if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4727 walk_statements(current_function->statement, check_unused_variables,
4732 static int determine_truth(expression_t const* const cond)
4735 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4736 fold_constant_to_bool(cond) ? 1 :
4740 static void check_reachable(statement_t *);
4741 static bool reaches_end;
4743 static bool expression_returns(expression_t const *const expr)
4745 switch (expr->kind) {
4747 expression_t const *const func = expr->call.function;
4748 if (func->kind == EXPR_REFERENCE) {
4749 entity_t *entity = func->reference.entity;
4750 if (entity->kind == ENTITY_FUNCTION
4751 && entity->declaration.modifiers & DM_NORETURN)
4755 if (!expression_returns(func))
4758 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4759 if (!expression_returns(arg->expression))
4766 case EXPR_REFERENCE:
4767 case EXPR_REFERENCE_ENUM_VALUE:
4769 case EXPR_STRING_LITERAL:
4770 case EXPR_WIDE_STRING_LITERAL:
4771 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4772 case EXPR_LABEL_ADDRESS:
4773 case EXPR_CLASSIFY_TYPE:
4774 case EXPR_SIZEOF: // TODO handle obscure VLA case
4777 case EXPR_BUILTIN_CONSTANT_P:
4778 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4783 case EXPR_STATEMENT: {
4784 bool old_reaches_end = reaches_end;
4785 reaches_end = false;
4786 check_reachable(expr->statement.statement);
4787 bool returns = reaches_end;
4788 reaches_end = old_reaches_end;
4792 case EXPR_CONDITIONAL:
4793 // TODO handle constant expression
4795 if (!expression_returns(expr->conditional.condition))
4798 if (expr->conditional.true_expression != NULL
4799 && expression_returns(expr->conditional.true_expression))
4802 return expression_returns(expr->conditional.false_expression);
4805 return expression_returns(expr->select.compound);
4807 case EXPR_ARRAY_ACCESS:
4809 expression_returns(expr->array_access.array_ref) &&
4810 expression_returns(expr->array_access.index);
4813 return expression_returns(expr->va_starte.ap);
4816 return expression_returns(expr->va_arge.ap);
4819 return expression_returns(expr->va_copye.src);
4821 EXPR_UNARY_CASES_MANDATORY
4822 return expression_returns(expr->unary.value);
4824 case EXPR_UNARY_THROW:
4828 // TODO handle constant lhs of && and ||
4830 expression_returns(expr->binary.left) &&
4831 expression_returns(expr->binary.right);
4834 panic("unhandled expression");
4837 static bool initializer_returns(initializer_t const *const init)
4839 switch (init->kind) {
4840 case INITIALIZER_VALUE:
4841 return expression_returns(init->value.value);
4843 case INITIALIZER_LIST: {
4844 initializer_t * const* i = init->list.initializers;
4845 initializer_t * const* const end = i + init->list.len;
4846 bool returns = true;
4847 for (; i != end; ++i) {
4848 if (!initializer_returns(*i))
4854 case INITIALIZER_STRING:
4855 case INITIALIZER_WIDE_STRING:
4856 case INITIALIZER_DESIGNATOR: // designators have no payload
4859 panic("unhandled initializer");
4862 static bool noreturn_candidate;
4864 static void check_reachable(statement_t *const stmt)
4866 if (stmt->base.reachable)
4868 if (stmt->kind != STATEMENT_DO_WHILE)
4869 stmt->base.reachable = true;
4871 statement_t *last = stmt;
4873 switch (stmt->kind) {
4874 case STATEMENT_INVALID:
4875 case STATEMENT_EMPTY:
4877 next = stmt->base.next;
4880 case STATEMENT_DECLARATION: {
4881 declaration_statement_t const *const decl = &stmt->declaration;
4882 entity_t const * ent = decl->declarations_begin;
4883 entity_t const *const last_decl = decl->declarations_end;
4885 for (;; ent = ent->base.next) {
4886 if (ent->kind == ENTITY_VARIABLE &&
4887 ent->variable.initializer != NULL &&
4888 !initializer_returns(ent->variable.initializer)) {
4891 if (ent == last_decl)
4895 next = stmt->base.next;
4899 case STATEMENT_COMPOUND:
4900 next = stmt->compound.statements;
4902 next = stmt->base.next;
4905 case STATEMENT_RETURN: {
4906 expression_t const *const val = stmt->returns.value;
4907 if (val == NULL || expression_returns(val))
4908 noreturn_candidate = false;
4912 case STATEMENT_IF: {
4913 if_statement_t const *const ifs = &stmt->ifs;
4914 expression_t const *const cond = ifs->condition;
4916 if (!expression_returns(cond))
4919 int const val = determine_truth(cond);
4922 check_reachable(ifs->true_statement);
4927 if (ifs->false_statement != NULL) {
4928 check_reachable(ifs->false_statement);
4932 next = stmt->base.next;
4936 case STATEMENT_SWITCH: {
4937 switch_statement_t const *const switchs = &stmt->switchs;
4938 expression_t const *const expr = switchs->expression;
4940 if (!expression_returns(expr))
4943 if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4944 long const val = fold_constant_to_int(expr);
4945 case_label_statement_t * defaults = NULL;
4946 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4947 if (i->expression == NULL) {
4952 if (i->first_case <= val && val <= i->last_case) {
4953 check_reachable((statement_t*)i);
4958 if (defaults != NULL) {
4959 check_reachable((statement_t*)defaults);
4963 bool has_default = false;
4964 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4965 if (i->expression == NULL)
4968 check_reachable((statement_t*)i);
4975 next = stmt->base.next;
4979 case STATEMENT_EXPRESSION: {
4980 /* Check for noreturn function call */
4981 expression_t const *const expr = stmt->expression.expression;
4982 if (!expression_returns(expr))
4985 next = stmt->base.next;
4989 case STATEMENT_CONTINUE:
4990 for (statement_t *parent = stmt;;) {
4991 parent = parent->base.parent;
4992 if (parent == NULL) /* continue not within loop */
4996 switch (parent->kind) {
4997 case STATEMENT_WHILE: goto continue_while;
4998 case STATEMENT_DO_WHILE: goto continue_do_while;
4999 case STATEMENT_FOR: goto continue_for;
5005 case STATEMENT_BREAK:
5006 for (statement_t *parent = stmt;;) {
5007 parent = parent->base.parent;
5008 if (parent == NULL) /* break not within loop/switch */
5011 switch (parent->kind) {
5012 case STATEMENT_SWITCH:
5013 case STATEMENT_WHILE:
5014 case STATEMENT_DO_WHILE:
5017 next = parent->base.next;
5018 goto found_break_parent;
5026 case STATEMENT_GOTO:
5027 if (stmt->gotos.expression) {
5028 if (!expression_returns(stmt->gotos.expression))
5031 statement_t *parent = stmt->base.parent;
5032 if (parent == NULL) /* top level goto */
5036 next = stmt->gotos.label->statement;
5037 if (next == NULL) /* missing label */
5042 case STATEMENT_LABEL:
5043 next = stmt->label.statement;
5046 case STATEMENT_CASE_LABEL:
5047 next = stmt->case_label.statement;
5050 case STATEMENT_WHILE: {
5051 while_statement_t const *const whiles = &stmt->whiles;
5052 expression_t const *const cond = whiles->condition;
5054 if (!expression_returns(cond))
5057 int const val = determine_truth(cond);
5060 check_reachable(whiles->body);
5065 next = stmt->base.next;
5069 case STATEMENT_DO_WHILE:
5070 next = stmt->do_while.body;
5073 case STATEMENT_FOR: {
5074 for_statement_t *const fors = &stmt->fors;
5076 if (fors->condition_reachable)
5078 fors->condition_reachable = true;
5080 expression_t const *const cond = fors->condition;
5085 } else if (expression_returns(cond)) {
5086 val = determine_truth(cond);
5092 check_reachable(fors->body);
5097 next = stmt->base.next;
5101 case STATEMENT_MS_TRY: {
5102 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5103 check_reachable(ms_try->try_statement);
5104 next = ms_try->final_statement;
5108 case STATEMENT_LEAVE: {
5109 statement_t *parent = stmt;
5111 parent = parent->base.parent;
5112 if (parent == NULL) /* __leave not within __try */
5115 if (parent->kind == STATEMENT_MS_TRY) {
5117 next = parent->ms_try.final_statement;
5125 panic("invalid statement kind");
5128 while (next == NULL) {
5129 next = last->base.parent;
5131 noreturn_candidate = false;
5133 type_t *const type = skip_typeref(current_function->base.type);
5134 assert(is_type_function(type));
5135 type_t *const ret = skip_typeref(type->function.return_type);
5136 if (!is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5137 is_type_valid(ret) &&
5138 !is_sym_main(current_function->base.base.symbol)) {
5139 source_position_t const *const pos = &stmt->base.source_position;
5140 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5145 switch (next->kind) {
5146 case STATEMENT_INVALID:
5147 case STATEMENT_EMPTY:
5148 case STATEMENT_DECLARATION:
5149 case STATEMENT_EXPRESSION:
5151 case STATEMENT_RETURN:
5152 case STATEMENT_CONTINUE:
5153 case STATEMENT_BREAK:
5154 case STATEMENT_GOTO:
5155 case STATEMENT_LEAVE:
5156 panic("invalid control flow in function");
5158 case STATEMENT_COMPOUND:
5159 if (next->compound.stmt_expr) {
5165 case STATEMENT_SWITCH:
5166 case STATEMENT_LABEL:
5167 case STATEMENT_CASE_LABEL:
5169 next = next->base.next;
5172 case STATEMENT_WHILE: {
5174 if (next->base.reachable)
5176 next->base.reachable = true;
5178 while_statement_t const *const whiles = &next->whiles;
5179 expression_t const *const cond = whiles->condition;
5181 if (!expression_returns(cond))
5184 int const val = determine_truth(cond);
5187 check_reachable(whiles->body);
5193 next = next->base.next;
5197 case STATEMENT_DO_WHILE: {
5199 if (next->base.reachable)
5201 next->base.reachable = true;
5203 do_while_statement_t const *const dw = &next->do_while;
5204 expression_t const *const cond = dw->condition;
5206 if (!expression_returns(cond))
5209 int const val = determine_truth(cond);
5212 check_reachable(dw->body);
5218 next = next->base.next;
5222 case STATEMENT_FOR: {
5224 for_statement_t *const fors = &next->fors;
5226 fors->step_reachable = true;
5228 if (fors->condition_reachable)
5230 fors->condition_reachable = true;
5232 expression_t const *const cond = fors->condition;
5237 } else if (expression_returns(cond)) {
5238 val = determine_truth(cond);
5244 check_reachable(fors->body);
5250 next = next->base.next;
5254 case STATEMENT_MS_TRY:
5256 next = next->ms_try.final_statement;
5261 check_reachable(next);
5264 static void check_unreachable(statement_t* const stmt, void *const env)
5268 switch (stmt->kind) {
5269 case STATEMENT_DO_WHILE:
5270 if (!stmt->base.reachable) {
5271 expression_t const *const cond = stmt->do_while.condition;
5272 if (determine_truth(cond) >= 0) {
5273 source_position_t const *const pos = &cond->base.source_position;
5274 warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5279 case STATEMENT_FOR: {
5280 for_statement_t const* const fors = &stmt->fors;
5282 // if init and step are unreachable, cond is unreachable, too
5283 if (!stmt->base.reachable && !fors->step_reachable) {
5284 goto warn_unreachable;
5286 if (!stmt->base.reachable && fors->initialisation != NULL) {
5287 source_position_t const *const pos = &fors->initialisation->base.source_position;
5288 warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5291 if (!fors->condition_reachable && fors->condition != NULL) {
5292 source_position_t const *const pos = &fors->condition->base.source_position;
5293 warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5296 if (!fors->step_reachable && fors->step != NULL) {
5297 source_position_t const *const pos = &fors->step->base.source_position;
5298 warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5304 case STATEMENT_COMPOUND:
5305 if (stmt->compound.statements != NULL)
5307 goto warn_unreachable;
5309 case STATEMENT_DECLARATION: {
5310 /* Only warn if there is at least one declarator with an initializer.
5311 * This typically occurs in switch statements. */
5312 declaration_statement_t const *const decl = &stmt->declaration;
5313 entity_t const * ent = decl->declarations_begin;
5314 entity_t const *const last = decl->declarations_end;
5316 for (;; ent = ent->base.next) {
5317 if (ent->kind == ENTITY_VARIABLE &&
5318 ent->variable.initializer != NULL) {
5319 goto warn_unreachable;
5329 if (!stmt->base.reachable) {
5330 source_position_t const *const pos = &stmt->base.source_position;
5331 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5337 static void parse_external_declaration(void)
5339 /* function-definitions and declarations both start with declaration
5341 add_anchor_token(';');
5342 declaration_specifiers_t specifiers;
5343 parse_declaration_specifiers(&specifiers);
5344 rem_anchor_token(';');
5346 /* must be a declaration */
5347 if (token.kind == ';') {
5348 parse_anonymous_declaration_rest(&specifiers);
5352 add_anchor_token(',');
5353 add_anchor_token('=');
5354 add_anchor_token(';');
5355 add_anchor_token('{');
5357 /* declarator is common to both function-definitions and declarations */
5358 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5360 rem_anchor_token('{');
5361 rem_anchor_token(';');
5362 rem_anchor_token('=');
5363 rem_anchor_token(',');
5365 /* must be a declaration */
5366 switch (token.kind) {
5370 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5375 /* must be a function definition */
5376 parse_kr_declaration_list(ndeclaration);
5378 if (token.kind != '{') {
5379 parse_error_expected("while parsing function definition", '{', NULL);
5380 eat_until_matching_token(';');
5384 assert(is_declaration(ndeclaration));
5385 type_t *const orig_type = ndeclaration->declaration.type;
5386 type_t * type = skip_typeref(orig_type);
5388 if (!is_type_function(type)) {
5389 if (is_type_valid(type)) {
5390 errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5396 source_position_t const *const pos = &ndeclaration->base.source_position;
5397 if (is_typeref(orig_type)) {
5399 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5402 if (is_type_compound(skip_typeref(type->function.return_type))) {
5403 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5405 if (type->function.unspecified_parameters) {
5406 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5408 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5411 /* §6.7.5.3:14 a function definition with () means no
5412 * parameters (and not unspecified parameters) */
5413 if (type->function.unspecified_parameters &&
5414 type->function.parameters == NULL) {
5415 type_t *copy = duplicate_type(type);
5416 copy->function.unspecified_parameters = false;
5417 type = identify_new_type(copy);
5419 ndeclaration->declaration.type = type;
5422 entity_t *const entity = record_entity(ndeclaration, true);
5423 assert(entity->kind == ENTITY_FUNCTION);
5424 assert(ndeclaration->kind == ENTITY_FUNCTION);
5426 function_t *const function = &entity->function;
5427 if (ndeclaration != entity) {
5428 function->parameters = ndeclaration->function.parameters;
5430 assert(is_declaration(entity));
5431 type = skip_typeref(entity->declaration.type);
5433 PUSH_SCOPE(&function->parameters);
5435 entity_t *parameter = function->parameters.entities;
5436 for (; parameter != NULL; parameter = parameter->base.next) {
5437 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5438 parameter->base.parent_scope = current_scope;
5440 assert(parameter->base.parent_scope == NULL
5441 || parameter->base.parent_scope == current_scope);
5442 parameter->base.parent_scope = current_scope;
5443 if (parameter->base.symbol == NULL) {
5444 errorf(¶meter->base.source_position, "parameter name omitted");
5447 environment_push(parameter);
5450 if (function->statement != NULL) {
5451 parser_error_multiple_definition(entity, HERE);
5454 /* parse function body */
5455 int label_stack_top = label_top();
5456 function_t *old_current_function = current_function;
5457 entity_t *old_current_entity = current_entity;
5458 current_function = function;
5459 current_entity = entity;
5463 goto_anchor = &goto_first;
5465 label_anchor = &label_first;
5467 statement_t *const body = parse_compound_statement(false);
5468 function->statement = body;
5471 check_declarations();
5472 if (is_warn_on(WARN_RETURN_TYPE) ||
5473 is_warn_on(WARN_UNREACHABLE_CODE) ||
5474 (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5475 noreturn_candidate = true;
5476 check_reachable(body);
5477 if (is_warn_on(WARN_UNREACHABLE_CODE))
5478 walk_statements(body, check_unreachable, NULL);
5479 if (noreturn_candidate &&
5480 !(function->base.modifiers & DM_NORETURN)) {
5481 source_position_t const *const pos = &body->base.source_position;
5482 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5487 assert(current_function == function);
5488 assert(current_entity == entity);
5489 current_entity = old_current_entity;
5490 current_function = old_current_function;
5491 label_pop_to(label_stack_top);
5497 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5499 entity_t *iter = compound->members.entities;
5500 for (; iter != NULL; iter = iter->base.next) {
5501 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5504 if (iter->base.symbol == symbol) {
5506 } else if (iter->base.symbol == NULL) {
5507 /* search in anonymous structs and unions */
5508 type_t *type = skip_typeref(iter->declaration.type);
5509 if (is_type_compound(type)) {
5510 if (find_compound_entry(type->compound.compound, symbol)
5521 static void check_deprecated(const source_position_t *source_position,
5522 const entity_t *entity)
5524 if (!is_declaration(entity))
5526 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5529 source_position_t const *const epos = &entity->base.source_position;
5530 char const *const msg = get_deprecated_string(entity->declaration.attributes);
5532 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5534 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5539 static expression_t *create_select(const source_position_t *pos,
5541 type_qualifiers_t qualifiers,
5544 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5546 check_deprecated(pos, entry);
5548 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5549 select->select.compound = addr;
5550 select->select.compound_entry = entry;
5552 type_t *entry_type = entry->declaration.type;
5553 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5555 /* bitfields need special treatment */
5556 if (entry->compound_member.bitfield) {
5557 unsigned bit_size = entry->compound_member.bit_size;
5558 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5559 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5560 res_type = type_int;
5564 /* we always do the auto-type conversions; the & and sizeof parser contains
5565 * code to revert this! */
5566 select->base.type = automatic_type_conversion(res_type);
5573 * Find entry with symbol in compound. Search anonymous structs and unions and
5574 * creates implicit select expressions for them.
5575 * Returns the adress for the innermost compound.
5577 static expression_t *find_create_select(const source_position_t *pos,
5579 type_qualifiers_t qualifiers,
5580 compound_t *compound, symbol_t *symbol)
5582 entity_t *iter = compound->members.entities;
5583 for (; iter != NULL; iter = iter->base.next) {
5584 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5587 symbol_t *iter_symbol = iter->base.symbol;
5588 if (iter_symbol == NULL) {
5589 type_t *type = iter->declaration.type;
5590 if (type->kind != TYPE_COMPOUND_STRUCT
5591 && type->kind != TYPE_COMPOUND_UNION)
5594 compound_t *sub_compound = type->compound.compound;
5596 if (find_compound_entry(sub_compound, symbol) == NULL)
5599 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5600 sub_addr->base.source_position = *pos;
5601 sub_addr->base.implicit = true;
5602 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5606 if (iter_symbol == symbol) {
5607 return create_select(pos, addr, qualifiers, iter);
5614 static void parse_bitfield_member(entity_t *entity)
5618 expression_t *size = parse_constant_expression();
5621 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5622 type_t *type = entity->declaration.type;
5623 if (!is_type_integer(skip_typeref(type))) {
5624 errorf(HERE, "bitfield base type '%T' is not an integer type",
5628 if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5629 /* error already reported by parse_constant_expression */
5630 size_long = get_type_size(type) * 8;
5632 size_long = fold_constant_to_int(size);
5634 const symbol_t *symbol = entity->base.symbol;
5635 const symbol_t *user_symbol
5636 = symbol == NULL ? sym_anonymous : symbol;
5637 unsigned bit_size = get_type_size(type) * 8;
5638 if (size_long < 0) {
5639 errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5640 } else if (size_long == 0 && symbol != NULL) {
5641 errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5642 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5643 errorf(HERE, "width of bitfield '%Y' exceeds its type",
5646 /* hope that people don't invent crazy types with more bits
5647 * than our struct can hold */
5649 (1 << sizeof(entity->compound_member.bit_size)*8));
5653 entity->compound_member.bitfield = true;
5654 entity->compound_member.bit_size = (unsigned char)size_long;
5657 static void parse_compound_declarators(compound_t *compound,
5658 const declaration_specifiers_t *specifiers)
5663 if (token.kind == ':') {
5664 /* anonymous bitfield */
5665 type_t *type = specifiers->type;
5666 entity_t *entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER,
5667 NAMESPACE_NORMAL, NULL);
5668 entity->base.source_position = *HERE;
5669 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5670 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5671 entity->declaration.type = type;
5673 parse_bitfield_member(entity);
5675 attribute_t *attributes = parse_attributes(NULL);
5676 attribute_t **anchor = &attributes;
5677 while (*anchor != NULL)
5678 anchor = &(*anchor)->next;
5679 *anchor = specifiers->attributes;
5680 if (attributes != NULL) {
5681 handle_entity_attributes(attributes, entity);
5683 entity->declaration.attributes = attributes;
5685 append_entity(&compound->members, entity);
5687 entity = parse_declarator(specifiers,
5688 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5689 source_position_t const *const pos = &entity->base.source_position;
5690 if (entity->kind == ENTITY_TYPEDEF) {
5691 errorf(pos, "typedef not allowed as compound member");
5693 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5695 /* make sure we don't define a symbol multiple times */
5696 symbol_t *symbol = entity->base.symbol;
5697 if (symbol != NULL) {
5698 entity_t *prev = find_compound_entry(compound, symbol);
5700 source_position_t const *const ppos = &prev->base.source_position;
5701 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5705 if (token.kind == ':') {
5706 parse_bitfield_member(entity);
5708 attribute_t *attributes = parse_attributes(NULL);
5709 handle_entity_attributes(attributes, entity);
5711 type_t *orig_type = entity->declaration.type;
5712 type_t *type = skip_typeref(orig_type);
5713 if (is_type_function(type)) {
5714 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5715 } else if (is_type_incomplete(type)) {
5716 /* §6.7.2.1:16 flexible array member */
5717 if (!is_type_array(type) ||
5718 token.kind != ';' ||
5719 look_ahead(1)->kind != '}') {
5720 errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5725 append_entity(&compound->members, entity);
5728 } while (next_if(','));
5729 expect(';', end_error);
5732 anonymous_entity = NULL;
5735 static void parse_compound_type_entries(compound_t *compound)
5738 add_anchor_token('}');
5741 switch (token.kind) {
5743 case T___extension__:
5744 case T_IDENTIFIER: {
5746 declaration_specifiers_t specifiers;
5747 parse_declaration_specifiers(&specifiers);
5748 parse_compound_declarators(compound, &specifiers);
5754 rem_anchor_token('}');
5755 expect('}', end_error);
5758 compound->complete = true;
5764 static type_t *parse_typename(void)
5766 declaration_specifiers_t specifiers;
5767 parse_declaration_specifiers(&specifiers);
5768 if (specifiers.storage_class != STORAGE_CLASS_NONE
5769 || specifiers.thread_local) {
5770 /* TODO: improve error message, user does probably not know what a
5771 * storage class is...
5773 errorf(&specifiers.source_position, "typename must not have a storage class");
5776 type_t *result = parse_abstract_declarator(specifiers.type);
5784 typedef expression_t* (*parse_expression_function)(void);
5785 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5787 typedef struct expression_parser_function_t expression_parser_function_t;
5788 struct expression_parser_function_t {
5789 parse_expression_function parser;
5790 precedence_t infix_precedence;
5791 parse_expression_infix_function infix_parser;
5794 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5797 * Prints an error message if an expression was expected but not read
5799 static expression_t *expected_expression_error(void)
5801 /* skip the error message if the error token was read */
5802 if (token.kind != T_ERROR) {
5803 errorf(HERE, "expected expression, got token %K", &token);
5807 return create_invalid_expression();
5810 static type_t *get_string_type(void)
5812 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5815 static type_t *get_wide_string_type(void)
5817 return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5821 * Parse a string constant.
5823 static expression_t *parse_string_literal(void)
5825 source_position_t begin = token.base.source_position;
5826 string_t res = token.string.string;
5827 bool is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5830 while (token.kind == T_STRING_LITERAL
5831 || token.kind == T_WIDE_STRING_LITERAL) {
5832 warn_string_concat(&token.base.source_position);
5833 res = concat_strings(&res, &token.string.string);
5835 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5838 expression_t *literal;
5840 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5841 literal->base.type = get_wide_string_type();
5843 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5844 literal->base.type = get_string_type();
5846 literal->base.source_position = begin;
5847 literal->literal.value = res;
5853 * Parse a boolean constant.
5855 static expression_t *parse_boolean_literal(bool value)
5857 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5858 literal->base.type = type_bool;
5859 literal->literal.value.begin = value ? "true" : "false";
5860 literal->literal.value.size = value ? 4 : 5;
5866 static void warn_traditional_suffix(void)
5868 warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5869 &token.number.suffix);
5872 static void check_integer_suffix(void)
5874 const string_t *suffix = &token.number.suffix;
5875 if (suffix->size == 0)
5878 bool not_traditional = false;
5879 const char *c = suffix->begin;
5880 if (*c == 'l' || *c == 'L') {
5883 not_traditional = true;
5885 if (*c == 'u' || *c == 'U') {
5888 } else if (*c == 'u' || *c == 'U') {
5889 not_traditional = true;
5892 } else if (*c == 'u' || *c == 'U') {
5893 not_traditional = true;
5895 if (*c == 'l' || *c == 'L') {
5903 errorf(&token.base.source_position,
5904 "invalid suffix '%S' on integer constant", suffix);
5905 } else if (not_traditional) {
5906 warn_traditional_suffix();
5910 static type_t *check_floatingpoint_suffix(void)
5912 const string_t *suffix = &token.number.suffix;
5913 type_t *type = type_double;
5914 if (suffix->size == 0)
5917 bool not_traditional = false;
5918 const char *c = suffix->begin;
5919 if (*c == 'f' || *c == 'F') {
5922 } else if (*c == 'l' || *c == 'L') {
5924 type = type_long_double;
5927 errorf(&token.base.source_position,
5928 "invalid suffix '%S' on floatingpoint constant", suffix);
5929 } else if (not_traditional) {
5930 warn_traditional_suffix();
5937 * Parse an integer constant.
5939 static expression_t *parse_number_literal(void)
5941 expression_kind_t kind;
5944 switch (token.kind) {
5946 kind = EXPR_LITERAL_INTEGER;
5947 check_integer_suffix();
5950 case T_INTEGER_OCTAL:
5951 kind = EXPR_LITERAL_INTEGER_OCTAL;
5952 check_integer_suffix();
5955 case T_INTEGER_HEXADECIMAL:
5956 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5957 check_integer_suffix();
5960 case T_FLOATINGPOINT:
5961 kind = EXPR_LITERAL_FLOATINGPOINT;
5962 type = check_floatingpoint_suffix();
5964 case T_FLOATINGPOINT_HEXADECIMAL:
5965 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5966 type = check_floatingpoint_suffix();
5969 panic("unexpected token type in parse_number_literal");
5972 expression_t *literal = allocate_expression_zero(kind);
5973 literal->base.type = type;
5974 literal->literal.value = token.number.number;
5975 literal->literal.suffix = token.number.suffix;
5978 /* integer type depends on the size of the number and the size
5979 * representable by the types. The backend/codegeneration has to determine
5982 determine_literal_type(&literal->literal);
5987 * Parse a character constant.
5989 static expression_t *parse_character_constant(void)
5991 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5992 literal->base.type = c_mode & _CXX ? type_char : type_int;
5993 literal->literal.value = token.string.string;
5995 size_t len = literal->literal.value.size;
5997 if (!GNU_MODE && !(c_mode & _C99)) {
5998 errorf(HERE, "more than 1 character in character constant");
6000 literal->base.type = type_int;
6001 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6010 * Parse a wide character constant.
6012 static expression_t *parse_wide_character_constant(void)
6014 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6015 literal->base.type = type_int;
6016 literal->literal.value = token.string.string;
6018 size_t len = wstrlen(&literal->literal.value);
6020 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6027 static entity_t *create_implicit_function(symbol_t *symbol,
6028 const source_position_t *source_position)
6030 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6031 ntype->function.return_type = type_int;
6032 ntype->function.unspecified_parameters = true;
6033 ntype->function.linkage = LINKAGE_C;
6034 type_t *type = identify_new_type(ntype);
6036 entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6037 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6038 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6039 entity->declaration.type = type;
6040 entity->declaration.implicit = true;
6041 entity->base.source_position = *source_position;
6043 if (current_scope != NULL)
6044 record_entity(entity, false);
6050 * Performs automatic type cast as described in §6.3.2.1.
6052 * @param orig_type the original type
6054 static type_t *automatic_type_conversion(type_t *orig_type)
6056 type_t *type = skip_typeref(orig_type);
6057 if (is_type_array(type)) {
6058 array_type_t *array_type = &type->array;
6059 type_t *element_type = array_type->element_type;
6060 unsigned qualifiers = array_type->base.qualifiers;
6062 return make_pointer_type(element_type, qualifiers);
6065 if (is_type_function(type)) {
6066 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6073 * reverts the automatic casts of array to pointer types and function
6074 * to function-pointer types as defined §6.3.2.1
6076 type_t *revert_automatic_type_conversion(const expression_t *expression)
6078 switch (expression->kind) {
6079 case EXPR_REFERENCE: {
6080 entity_t *entity = expression->reference.entity;
6081 if (is_declaration(entity)) {
6082 return entity->declaration.type;
6083 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6084 return entity->enum_value.enum_type;
6086 panic("no declaration or enum in reference");
6091 entity_t *entity = expression->select.compound_entry;
6092 assert(is_declaration(entity));
6093 type_t *type = entity->declaration.type;
6094 return get_qualified_type(type, expression->base.type->base.qualifiers);
6097 case EXPR_UNARY_DEREFERENCE: {
6098 const expression_t *const value = expression->unary.value;
6099 type_t *const type = skip_typeref(value->base.type);
6100 if (!is_type_pointer(type))
6101 return type_error_type;
6102 return type->pointer.points_to;
6105 case EXPR_ARRAY_ACCESS: {
6106 const expression_t *array_ref = expression->array_access.array_ref;
6107 type_t *type_left = skip_typeref(array_ref->base.type);
6108 if (!is_type_pointer(type_left))
6109 return type_error_type;
6110 return type_left->pointer.points_to;
6113 case EXPR_STRING_LITERAL: {
6114 size_t size = expression->string_literal.value.size;
6115 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6118 case EXPR_WIDE_STRING_LITERAL: {
6119 size_t size = wstrlen(&expression->string_literal.value);
6120 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6123 case EXPR_COMPOUND_LITERAL:
6124 return expression->compound_literal.type;
6129 return expression->base.type;
6133 * Find an entity matching a symbol in a scope.
6134 * Uses current scope if scope is NULL
6136 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6137 namespace_tag_t namespc)
6139 if (scope == NULL) {
6140 return get_entity(symbol, namespc);
6143 /* we should optimize here, if scope grows above a certain size we should
6144 construct a hashmap here... */
6145 entity_t *entity = scope->entities;
6146 for ( ; entity != NULL; entity = entity->base.next) {
6147 if (entity->base.symbol == symbol
6148 && (namespace_tag_t)entity->base.namespc == namespc)
6155 static entity_t *parse_qualified_identifier(void)
6157 /* namespace containing the symbol */
6159 source_position_t pos;
6160 const scope_t *lookup_scope = NULL;
6162 if (next_if(T_COLONCOLON))
6163 lookup_scope = &unit->scope;
6167 if (token.kind != T_IDENTIFIER) {
6168 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6169 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6171 symbol = token.identifier.symbol;
6176 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6178 if (!next_if(T_COLONCOLON))
6181 switch (entity->kind) {
6182 case ENTITY_NAMESPACE:
6183 lookup_scope = &entity->namespacee.members;
6188 lookup_scope = &entity->compound.members;
6191 errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6192 symbol, get_entity_kind_name(entity->kind));
6194 /* skip further qualifications */
6195 while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6197 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6201 if (entity == NULL) {
6202 if (!strict_mode && token.kind == '(') {
6203 /* an implicitly declared function */
6204 warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos, "implicit declaration of function '%Y'", symbol);
6205 entity = create_implicit_function(symbol, &pos);
6207 errorf(&pos, "unknown identifier '%Y' found.", symbol);
6208 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6215 static expression_t *parse_reference(void)
6217 source_position_t const pos = token.base.source_position;
6218 entity_t *const entity = parse_qualified_identifier();
6221 if (is_declaration(entity)) {
6222 orig_type = entity->declaration.type;
6223 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6224 orig_type = entity->enum_value.enum_type;
6226 panic("expected declaration or enum value in reference");
6229 /* we always do the auto-type conversions; the & and sizeof parser contains
6230 * code to revert this! */
6231 type_t *type = automatic_type_conversion(orig_type);
6233 expression_kind_t kind = EXPR_REFERENCE;
6234 if (entity->kind == ENTITY_ENUM_VALUE)
6235 kind = EXPR_REFERENCE_ENUM_VALUE;
6237 expression_t *expression = allocate_expression_zero(kind);
6238 expression->base.source_position = pos;
6239 expression->base.type = type;
6240 expression->reference.entity = entity;
6242 /* this declaration is used */
6243 if (is_declaration(entity)) {
6244 entity->declaration.used = true;
6247 if (entity->base.parent_scope != file_scope
6248 && (current_function != NULL
6249 && entity->base.parent_scope->depth < current_function->parameters.depth)
6250 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6251 if (entity->kind == ENTITY_VARIABLE) {
6252 /* access of a variable from an outer function */
6253 entity->variable.address_taken = true;
6254 } else if (entity->kind == ENTITY_PARAMETER) {
6255 entity->parameter.address_taken = true;
6257 current_function->need_closure = true;
6260 check_deprecated(&pos, entity);
6265 static bool semantic_cast(expression_t *cast)
6267 expression_t *expression = cast->unary.value;
6268 type_t *orig_dest_type = cast->base.type;
6269 type_t *orig_type_right = expression->base.type;
6270 type_t const *dst_type = skip_typeref(orig_dest_type);
6271 type_t const *src_type = skip_typeref(orig_type_right);
6272 source_position_t const *pos = &cast->base.source_position;
6274 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6275 if (dst_type == type_void)
6278 /* only integer and pointer can be casted to pointer */
6279 if (is_type_pointer(dst_type) &&
6280 !is_type_pointer(src_type) &&
6281 !is_type_integer(src_type) &&
6282 is_type_valid(src_type)) {
6283 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6287 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6288 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6292 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6293 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6297 if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6298 type_t *src = skip_typeref(src_type->pointer.points_to);
6299 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6300 unsigned missing_qualifiers =
6301 src->base.qualifiers & ~dst->base.qualifiers;
6302 if (missing_qualifiers != 0) {
6303 warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6309 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6311 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6312 expression->base.source_position = *pos;
6314 parse_initializer_env_t env;
6317 env.must_be_constant = false;
6318 initializer_t *initializer = parse_initializer(&env);
6321 expression->compound_literal.initializer = initializer;
6322 expression->compound_literal.type = type;
6323 expression->base.type = automatic_type_conversion(type);
6329 * Parse a cast expression.
6331 static expression_t *parse_cast(void)
6333 source_position_t const pos = *HERE;
6336 add_anchor_token(')');
6338 type_t *type = parse_typename();
6340 rem_anchor_token(')');
6341 expect(')', end_error);
6343 if (token.kind == '{') {
6344 return parse_compound_literal(&pos, type);
6347 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6348 cast->base.source_position = pos;
6350 expression_t *value = parse_subexpression(PREC_CAST);
6351 cast->base.type = type;
6352 cast->unary.value = value;
6354 if (! semantic_cast(cast)) {
6355 /* TODO: record the error in the AST. else it is impossible to detect it */
6360 return create_invalid_expression();
6364 * Parse a statement expression.
6366 static expression_t *parse_statement_expression(void)
6368 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6371 add_anchor_token(')');
6373 statement_t *statement = parse_compound_statement(true);
6374 statement->compound.stmt_expr = true;
6375 expression->statement.statement = statement;
6377 /* find last statement and use its type */
6378 type_t *type = type_void;
6379 const statement_t *stmt = statement->compound.statements;
6381 while (stmt->base.next != NULL)
6382 stmt = stmt->base.next;
6384 if (stmt->kind == STATEMENT_EXPRESSION) {
6385 type = stmt->expression.expression->base.type;
6388 source_position_t const *const pos = &expression->base.source_position;
6389 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6391 expression->base.type = type;
6393 rem_anchor_token(')');
6394 expect(')', end_error);
6401 * Parse a parenthesized expression.
6403 static expression_t *parse_parenthesized_expression(void)
6405 token_t const* const la1 = look_ahead(1);
6406 switch (la1->kind) {
6408 /* gcc extension: a statement expression */
6409 return parse_statement_expression();
6412 if (is_typedef_symbol(la1->identifier.symbol)) {
6414 return parse_cast();
6419 add_anchor_token(')');
6420 expression_t *result = parse_expression();
6421 result->base.parenthesized = true;
6422 rem_anchor_token(')');
6423 expect(')', end_error);
6429 static expression_t *parse_function_keyword(void)
6433 if (current_function == NULL) {
6434 errorf(HERE, "'__func__' used outside of a function");
6437 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6438 expression->base.type = type_char_ptr;
6439 expression->funcname.kind = FUNCNAME_FUNCTION;
6446 static expression_t *parse_pretty_function_keyword(void)
6448 if (current_function == NULL) {
6449 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6452 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6453 expression->base.type = type_char_ptr;
6454 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6456 eat(T___PRETTY_FUNCTION__);
6461 static expression_t *parse_funcsig_keyword(void)
6463 if (current_function == NULL) {
6464 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6467 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6468 expression->base.type = type_char_ptr;
6469 expression->funcname.kind = FUNCNAME_FUNCSIG;
6476 static expression_t *parse_funcdname_keyword(void)
6478 if (current_function == NULL) {
6479 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6482 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6483 expression->base.type = type_char_ptr;
6484 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6486 eat(T___FUNCDNAME__);
6491 static designator_t *parse_designator(void)
6493 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6494 result->source_position = *HERE;
6496 if (token.kind != T_IDENTIFIER) {
6497 parse_error_expected("while parsing member designator",
6498 T_IDENTIFIER, NULL);
6501 result->symbol = token.identifier.symbol;
6504 designator_t *last_designator = result;
6507 if (token.kind != T_IDENTIFIER) {
6508 parse_error_expected("while parsing member designator",
6509 T_IDENTIFIER, NULL);
6512 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6513 designator->source_position = *HERE;
6514 designator->symbol = token.identifier.symbol;
6517 last_designator->next = designator;
6518 last_designator = designator;
6522 add_anchor_token(']');
6523 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6524 designator->source_position = *HERE;
6525 designator->array_index = parse_expression();
6526 rem_anchor_token(']');
6527 expect(']', end_error);
6528 if (designator->array_index == NULL) {
6532 last_designator->next = designator;
6533 last_designator = designator;
6545 * Parse the __builtin_offsetof() expression.
6547 static expression_t *parse_offsetof(void)
6549 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6550 expression->base.type = type_size_t;
6552 eat(T___builtin_offsetof);
6554 expect('(', end_error);
6555 add_anchor_token(',');
6556 type_t *type = parse_typename();
6557 rem_anchor_token(',');
6558 expect(',', end_error);
6559 add_anchor_token(')');
6560 designator_t *designator = parse_designator();
6561 rem_anchor_token(')');
6562 expect(')', end_error);
6564 expression->offsetofe.type = type;
6565 expression->offsetofe.designator = designator;
6568 memset(&path, 0, sizeof(path));
6569 path.top_type = type;
6570 path.path = NEW_ARR_F(type_path_entry_t, 0);
6572 descend_into_subtype(&path);
6574 if (!walk_designator(&path, designator, true)) {
6575 return create_invalid_expression();
6578 DEL_ARR_F(path.path);
6582 return create_invalid_expression();
6586 * Parses a _builtin_va_start() expression.
6588 static expression_t *parse_va_start(void)
6590 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6592 eat(T___builtin_va_start);
6594 expect('(', end_error);
6595 add_anchor_token(',');
6596 expression->va_starte.ap = parse_assignment_expression();
6597 rem_anchor_token(',');
6598 expect(',', end_error);
6599 expression_t *const expr = parse_assignment_expression();
6600 if (expr->kind == EXPR_REFERENCE) {
6601 entity_t *const entity = expr->reference.entity;
6602 if (!current_function->base.type->function.variadic) {
6603 errorf(&expr->base.source_position,
6604 "'va_start' used in non-variadic function");
6605 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6606 entity->base.next != NULL ||
6607 entity->kind != ENTITY_PARAMETER) {
6608 errorf(&expr->base.source_position,
6609 "second argument of 'va_start' must be last parameter of the current function");
6611 expression->va_starte.parameter = &entity->variable;
6613 expect(')', end_error);
6616 expect(')', end_error);
6618 return create_invalid_expression();
6622 * Parses a __builtin_va_arg() expression.
6624 static expression_t *parse_va_arg(void)
6626 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6628 eat(T___builtin_va_arg);
6630 expect('(', end_error);
6632 ap.expression = parse_assignment_expression();
6633 expression->va_arge.ap = ap.expression;
6634 check_call_argument(type_valist, &ap, 1);
6636 expect(',', end_error);
6637 expression->base.type = parse_typename();
6638 expect(')', end_error);
6642 return create_invalid_expression();
6646 * Parses a __builtin_va_copy() expression.
6648 static expression_t *parse_va_copy(void)
6650 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6652 eat(T___builtin_va_copy);
6654 expect('(', end_error);
6655 expression_t *dst = parse_assignment_expression();
6656 assign_error_t error = semantic_assign(type_valist, dst);
6657 report_assign_error(error, type_valist, dst, "call argument 1",
6658 &dst->base.source_position);
6659 expression->va_copye.dst = dst;
6661 expect(',', end_error);
6663 call_argument_t src;
6664 src.expression = parse_assignment_expression();
6665 check_call_argument(type_valist, &src, 2);
6666 expression->va_copye.src = src.expression;
6667 expect(')', end_error);
6671 return create_invalid_expression();
6675 * Parses a __builtin_constant_p() expression.
6677 static expression_t *parse_builtin_constant(void)
6679 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6681 eat(T___builtin_constant_p);
6683 expect('(', end_error);
6684 add_anchor_token(')');
6685 expression->builtin_constant.value = parse_assignment_expression();
6686 rem_anchor_token(')');
6687 expect(')', end_error);
6688 expression->base.type = type_int;
6692 return create_invalid_expression();
6696 * Parses a __builtin_types_compatible_p() expression.
6698 static expression_t *parse_builtin_types_compatible(void)
6700 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6702 eat(T___builtin_types_compatible_p);
6704 expect('(', end_error);
6705 add_anchor_token(')');
6706 add_anchor_token(',');
6707 expression->builtin_types_compatible.left = parse_typename();
6708 rem_anchor_token(',');
6709 expect(',', end_error);
6710 expression->builtin_types_compatible.right = parse_typename();
6711 rem_anchor_token(')');
6712 expect(')', end_error);
6713 expression->base.type = type_int;
6717 return create_invalid_expression();
6721 * Parses a __builtin_is_*() compare expression.
6723 static expression_t *parse_compare_builtin(void)
6725 expression_t *expression;
6727 switch (token.kind) {
6728 case T___builtin_isgreater:
6729 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6731 case T___builtin_isgreaterequal:
6732 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6734 case T___builtin_isless:
6735 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6737 case T___builtin_islessequal:
6738 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6740 case T___builtin_islessgreater:
6741 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6743 case T___builtin_isunordered:
6744 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6747 internal_errorf(HERE, "invalid compare builtin found");
6749 expression->base.source_position = *HERE;
6752 expect('(', end_error);
6753 expression->binary.left = parse_assignment_expression();
6754 expect(',', end_error);
6755 expression->binary.right = parse_assignment_expression();
6756 expect(')', end_error);
6758 type_t *const orig_type_left = expression->binary.left->base.type;
6759 type_t *const orig_type_right = expression->binary.right->base.type;
6761 type_t *const type_left = skip_typeref(orig_type_left);
6762 type_t *const type_right = skip_typeref(orig_type_right);
6763 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6764 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6765 type_error_incompatible("invalid operands in comparison",
6766 &expression->base.source_position, orig_type_left, orig_type_right);
6769 semantic_comparison(&expression->binary);
6774 return create_invalid_expression();
6778 * Parses a MS assume() expression.
6780 static expression_t *parse_assume(void)
6782 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6786 expect('(', end_error);
6787 add_anchor_token(')');
6788 expression->unary.value = parse_assignment_expression();
6789 rem_anchor_token(')');
6790 expect(')', end_error);
6792 expression->base.type = type_void;
6795 return create_invalid_expression();
6799 * Return the label for the current symbol or create a new one.
6801 static label_t *get_label(void)
6803 assert(token.kind == T_IDENTIFIER);
6804 assert(current_function != NULL);
6806 entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6807 /* If we find a local label, we already created the declaration. */
6808 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6809 if (label->base.parent_scope != current_scope) {
6810 assert(label->base.parent_scope->depth < current_scope->depth);
6811 current_function->goto_to_outer = true;
6813 } else if (label == NULL || label->base.parent_scope != ¤t_function->parameters) {
6814 /* There is no matching label in the same function, so create a new one. */
6815 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol);
6820 return &label->label;
6824 * Parses a GNU && label address expression.
6826 static expression_t *parse_label_address(void)
6828 source_position_t source_position = token.base.source_position;
6830 if (token.kind != T_IDENTIFIER) {
6831 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6832 return create_invalid_expression();
6835 label_t *const label = get_label();
6837 label->address_taken = true;
6839 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6840 expression->base.source_position = source_position;
6842 /* label address is treated as a void pointer */
6843 expression->base.type = type_void_ptr;
6844 expression->label_address.label = label;
6849 * Parse a microsoft __noop expression.
6851 static expression_t *parse_noop_expression(void)
6853 /* the result is a (int)0 */
6854 expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6855 literal->base.type = type_int;
6856 literal->literal.value.begin = "__noop";
6857 literal->literal.value.size = 6;
6861 if (token.kind == '(') {
6862 /* parse arguments */
6864 add_anchor_token(')');
6865 add_anchor_token(',');
6867 if (token.kind != ')') do {
6868 (void)parse_assignment_expression();
6869 } while (next_if(','));
6871 rem_anchor_token(',');
6872 rem_anchor_token(')');
6873 expect(')', end_error);
6880 * Parses a primary expression.
6882 static expression_t *parse_primary_expression(void)
6884 switch (token.kind) {
6885 case T_false: return parse_boolean_literal(false);
6886 case T_true: return parse_boolean_literal(true);
6888 case T_INTEGER_OCTAL:
6889 case T_INTEGER_HEXADECIMAL:
6890 case T_FLOATINGPOINT:
6891 case T_FLOATINGPOINT_HEXADECIMAL: return parse_number_literal();
6892 case T_CHARACTER_CONSTANT: return parse_character_constant();
6893 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6894 case T_STRING_LITERAL:
6895 case T_WIDE_STRING_LITERAL: return parse_string_literal();
6896 case T___FUNCTION__:
6897 case T___func__: return parse_function_keyword();
6898 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6899 case T___FUNCSIG__: return parse_funcsig_keyword();
6900 case T___FUNCDNAME__: return parse_funcdname_keyword();
6901 case T___builtin_offsetof: return parse_offsetof();
6902 case T___builtin_va_start: return parse_va_start();
6903 case T___builtin_va_arg: return parse_va_arg();
6904 case T___builtin_va_copy: return parse_va_copy();
6905 case T___builtin_isgreater:
6906 case T___builtin_isgreaterequal:
6907 case T___builtin_isless:
6908 case T___builtin_islessequal:
6909 case T___builtin_islessgreater:
6910 case T___builtin_isunordered: return parse_compare_builtin();
6911 case T___builtin_constant_p: return parse_builtin_constant();
6912 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6913 case T__assume: return parse_assume();
6916 return parse_label_address();
6919 case '(': return parse_parenthesized_expression();
6920 case T___noop: return parse_noop_expression();
6922 /* Gracefully handle type names while parsing expressions. */
6924 return parse_reference();
6926 if (!is_typedef_symbol(token.identifier.symbol)) {
6927 return parse_reference();
6931 source_position_t const pos = *HERE;
6932 declaration_specifiers_t specifiers;
6933 parse_declaration_specifiers(&specifiers);
6934 type_t const *const type = parse_abstract_declarator(specifiers.type);
6935 errorf(&pos, "encountered type '%T' while parsing expression", type);
6936 return create_invalid_expression();
6940 errorf(HERE, "unexpected token %K, expected an expression", &token);
6942 return create_invalid_expression();
6945 static expression_t *parse_array_expression(expression_t *left)
6947 expression_t *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6948 array_access_expression_t *const arr = &expr->array_access;
6951 add_anchor_token(']');
6953 expression_t *const inside = parse_expression();
6955 type_t *const orig_type_left = left->base.type;
6956 type_t *const orig_type_inside = inside->base.type;
6958 type_t *const type_left = skip_typeref(orig_type_left);
6959 type_t *const type_inside = skip_typeref(orig_type_inside);
6965 if (is_type_pointer(type_left)) {
6968 idx_type = type_inside;
6969 res_type = type_left->pointer.points_to;
6971 } else if (is_type_pointer(type_inside)) {
6972 arr->flipped = true;
6975 idx_type = type_left;
6976 res_type = type_inside->pointer.points_to;
6978 res_type = automatic_type_conversion(res_type);
6979 if (!is_type_integer(idx_type)) {
6980 errorf(&idx->base.source_position, "array subscript must have integer type");
6981 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6982 source_position_t const *const pos = &idx->base.source_position;
6983 warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6986 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6987 errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6989 res_type = type_error_type;
6994 arr->array_ref = ref;
6996 arr->base.type = res_type;
6998 rem_anchor_token(']');
6999 expect(']', end_error);
7004 static bool is_bitfield(const expression_t *expression)
7006 return expression->kind == EXPR_SELECT
7007 && expression->select.compound_entry->compound_member.bitfield;
7010 static expression_t *parse_typeprop(expression_kind_t const kind)
7012 expression_t *tp_expression = allocate_expression_zero(kind);
7013 tp_expression->base.type = type_size_t;
7015 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7018 expression_t *expression;
7019 if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
7020 source_position_t const pos = *HERE;
7022 add_anchor_token(')');
7023 orig_type = parse_typename();
7024 rem_anchor_token(')');
7025 expect(')', end_error);
7027 if (token.kind == '{') {
7028 /* It was not sizeof(type) after all. It is sizeof of an expression
7029 * starting with a compound literal */
7030 expression = parse_compound_literal(&pos, orig_type);
7031 goto typeprop_expression;
7034 expression = parse_subexpression(PREC_UNARY);
7036 typeprop_expression:
7037 if (is_bitfield(expression)) {
7038 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7039 errorf(&tp_expression->base.source_position,
7040 "operand of %s expression must not be a bitfield", what);
7043 tp_expression->typeprop.tp_expression = expression;
7045 orig_type = revert_automatic_type_conversion(expression);
7046 expression->base.type = orig_type;
7049 tp_expression->typeprop.type = orig_type;
7050 type_t const* const type = skip_typeref(orig_type);
7051 char const* wrong_type = NULL;
7052 if (is_type_incomplete(type)) {
7053 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7054 wrong_type = "incomplete";
7055 } else if (type->kind == TYPE_FUNCTION) {
7057 /* function types are allowed (and return 1) */
7058 source_position_t const *const pos = &tp_expression->base.source_position;
7059 char const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7060 warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
7062 wrong_type = "function";
7066 if (wrong_type != NULL) {
7067 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7068 errorf(&tp_expression->base.source_position,
7069 "operand of %s expression must not be of %s type '%T'",
7070 what, wrong_type, orig_type);
7074 return tp_expression;
7077 static expression_t *parse_sizeof(void)
7079 return parse_typeprop(EXPR_SIZEOF);
7082 static expression_t *parse_alignof(void)
7084 return parse_typeprop(EXPR_ALIGNOF);
7087 static expression_t *parse_select_expression(expression_t *addr)
7089 assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7090 bool select_left_arrow = (token.kind == T_MINUSGREATER);
7091 source_position_t const pos = *HERE;
7094 if (token.kind != T_IDENTIFIER) {
7095 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7096 return create_invalid_expression();
7098 symbol_t *symbol = token.identifier.symbol;
7101 type_t *const orig_type = addr->base.type;
7102 type_t *const type = skip_typeref(orig_type);
7105 bool saw_error = false;
7106 if (is_type_pointer(type)) {
7107 if (!select_left_arrow) {
7109 "request for member '%Y' in something not a struct or union, but '%T'",
7113 type_left = skip_typeref(type->pointer.points_to);
7115 if (select_left_arrow && is_type_valid(type)) {
7116 errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7122 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7123 type_left->kind != TYPE_COMPOUND_UNION) {
7125 if (is_type_valid(type_left) && !saw_error) {
7127 "request for member '%Y' in something not a struct or union, but '%T'",
7130 return create_invalid_expression();
7133 compound_t *compound = type_left->compound.compound;
7134 if (!compound->complete) {
7135 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7137 return create_invalid_expression();
7140 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7141 expression_t *result =
7142 find_create_select(&pos, addr, qualifiers, compound, symbol);
7144 if (result == NULL) {
7145 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7146 return create_invalid_expression();
7152 static void check_call_argument(type_t *expected_type,
7153 call_argument_t *argument, unsigned pos)
7155 type_t *expected_type_skip = skip_typeref(expected_type);
7156 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7157 expression_t *arg_expr = argument->expression;
7158 type_t *arg_type = skip_typeref(arg_expr->base.type);
7160 /* handle transparent union gnu extension */
7161 if (is_type_union(expected_type_skip)
7162 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7163 compound_t *union_decl = expected_type_skip->compound.compound;
7164 type_t *best_type = NULL;
7165 entity_t *entry = union_decl->members.entities;
7166 for ( ; entry != NULL; entry = entry->base.next) {
7167 assert(is_declaration(entry));
7168 type_t *decl_type = entry->declaration.type;
7169 error = semantic_assign(decl_type, arg_expr);
7170 if (error == ASSIGN_ERROR_INCOMPATIBLE
7171 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7174 if (error == ASSIGN_SUCCESS) {
7175 best_type = decl_type;
7176 } else if (best_type == NULL) {
7177 best_type = decl_type;
7181 if (best_type != NULL) {
7182 expected_type = best_type;
7186 error = semantic_assign(expected_type, arg_expr);
7187 argument->expression = create_implicit_cast(arg_expr, expected_type);
7189 if (error != ASSIGN_SUCCESS) {
7190 /* report exact scope in error messages (like "in argument 3") */
7192 snprintf(buf, sizeof(buf), "call argument %u", pos);
7193 report_assign_error(error, expected_type, arg_expr, buf,
7194 &arg_expr->base.source_position);
7196 type_t *const promoted_type = get_default_promoted_type(arg_type);
7197 if (!types_compatible(expected_type_skip, promoted_type) &&
7198 !types_compatible(expected_type_skip, type_void_ptr) &&
7199 !types_compatible(type_void_ptr, promoted_type)) {
7200 /* Deliberately show the skipped types in this warning */
7201 source_position_t const *const apos = &arg_expr->base.source_position;
7202 warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7208 * Handle the semantic restrictions of builtin calls
7210 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7211 switch (call->function->reference.entity->function.btk) {
7212 case bk_gnu_builtin_return_address:
7213 case bk_gnu_builtin_frame_address: {
7214 /* argument must be constant */
7215 call_argument_t *argument = call->arguments;
7217 if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7218 errorf(&call->base.source_position,
7219 "argument of '%Y' must be a constant expression",
7220 call->function->reference.entity->base.symbol);
7224 case bk_gnu_builtin_object_size:
7225 if (call->arguments == NULL)
7228 call_argument_t *arg = call->arguments->next;
7229 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7230 errorf(&call->base.source_position,
7231 "second argument of '%Y' must be a constant expression",
7232 call->function->reference.entity->base.symbol);
7235 case bk_gnu_builtin_prefetch:
7236 /* second and third argument must be constant if existent */
7237 if (call->arguments == NULL)
7239 call_argument_t *rw = call->arguments->next;
7240 call_argument_t *locality = NULL;
7243 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7244 errorf(&call->base.source_position,
7245 "second argument of '%Y' must be a constant expression",
7246 call->function->reference.entity->base.symbol);
7248 locality = rw->next;
7250 if (locality != NULL) {
7251 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7252 errorf(&call->base.source_position,
7253 "third argument of '%Y' must be a constant expression",
7254 call->function->reference.entity->base.symbol);
7256 locality = rw->next;
7265 * Parse a call expression, ie. expression '( ... )'.
7267 * @param expression the function address
7269 static expression_t *parse_call_expression(expression_t *expression)
7271 expression_t *result = allocate_expression_zero(EXPR_CALL);
7272 call_expression_t *call = &result->call;
7273 call->function = expression;
7275 type_t *const orig_type = expression->base.type;
7276 type_t *const type = skip_typeref(orig_type);
7278 function_type_t *function_type = NULL;
7279 if (is_type_pointer(type)) {
7280 type_t *const to_type = skip_typeref(type->pointer.points_to);
7282 if (is_type_function(to_type)) {
7283 function_type = &to_type->function;
7284 call->base.type = function_type->return_type;
7288 if (function_type == NULL && is_type_valid(type)) {
7290 "called object '%E' (type '%T') is not a pointer to a function",
7291 expression, orig_type);
7294 /* parse arguments */
7296 add_anchor_token(')');
7297 add_anchor_token(',');
7299 if (token.kind != ')') {
7300 call_argument_t **anchor = &call->arguments;
7302 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7303 argument->expression = parse_assignment_expression();
7306 anchor = &argument->next;
7307 } while (next_if(','));
7309 rem_anchor_token(',');
7310 rem_anchor_token(')');
7311 expect(')', end_error);
7313 if (function_type == NULL)
7316 /* check type and count of call arguments */
7317 function_parameter_t *parameter = function_type->parameters;
7318 call_argument_t *argument = call->arguments;
7319 if (!function_type->unspecified_parameters) {
7320 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7321 parameter = parameter->next, argument = argument->next) {
7322 check_call_argument(parameter->type, argument, ++pos);
7325 if (parameter != NULL) {
7326 errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7327 } else if (argument != NULL && !function_type->variadic) {
7328 errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7332 /* do default promotion for other arguments */
7333 for (; argument != NULL; argument = argument->next) {
7334 type_t *argument_type = argument->expression->base.type;
7335 if (!is_type_object(skip_typeref(argument_type))) {
7336 errorf(&argument->expression->base.source_position,
7337 "call argument '%E' must not be void", argument->expression);
7340 argument_type = get_default_promoted_type(argument_type);
7342 argument->expression
7343 = create_implicit_cast(argument->expression, argument_type);
7348 if (is_type_compound(skip_typeref(function_type->return_type))) {
7349 source_position_t const *const pos = &expression->base.source_position;
7350 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7353 if (expression->kind == EXPR_REFERENCE) {
7354 reference_expression_t *reference = &expression->reference;
7355 if (reference->entity->kind == ENTITY_FUNCTION &&
7356 reference->entity->function.btk != bk_none)
7357 handle_builtin_argument_restrictions(call);
7364 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7366 static bool same_compound_type(const type_t *type1, const type_t *type2)
7369 is_type_compound(type1) &&
7370 type1->kind == type2->kind &&
7371 type1->compound.compound == type2->compound.compound;
7374 static expression_t const *get_reference_address(expression_t const *expr)
7376 bool regular_take_address = true;
7378 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7379 expr = expr->unary.value;
7381 regular_take_address = false;
7384 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7387 expr = expr->unary.value;
7390 if (expr->kind != EXPR_REFERENCE)
7393 /* special case for functions which are automatically converted to a
7394 * pointer to function without an extra TAKE_ADDRESS operation */
7395 if (!regular_take_address &&
7396 expr->reference.entity->kind != ENTITY_FUNCTION) {
7403 static void warn_reference_address_as_bool(expression_t const* expr)
7405 expr = get_reference_address(expr);
7407 source_position_t const *const pos = &expr->base.source_position;
7408 entity_t const *const ent = expr->reference.entity;
7409 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7413 static void warn_assignment_in_condition(const expression_t *const expr)
7415 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7417 if (expr->base.parenthesized)
7419 source_position_t const *const pos = &expr->base.source_position;
7420 warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7423 static void semantic_condition(expression_t const *const expr,
7424 char const *const context)
7426 type_t *const type = skip_typeref(expr->base.type);
7427 if (is_type_scalar(type)) {
7428 warn_reference_address_as_bool(expr);
7429 warn_assignment_in_condition(expr);
7430 } else if (is_type_valid(type)) {
7431 errorf(&expr->base.source_position,
7432 "%s must have scalar type", context);
7437 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7439 * @param expression the conditional expression
7441 static expression_t *parse_conditional_expression(expression_t *expression)
7443 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7445 conditional_expression_t *conditional = &result->conditional;
7446 conditional->condition = expression;
7449 add_anchor_token(':');
7451 /* §6.5.15:2 The first operand shall have scalar type. */
7452 semantic_condition(expression, "condition of conditional operator");
7454 expression_t *true_expression = expression;
7455 bool gnu_cond = false;
7456 if (GNU_MODE && token.kind == ':') {
7459 true_expression = parse_expression();
7461 rem_anchor_token(':');
7462 expect(':', end_error);
7464 expression_t *false_expression =
7465 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7467 type_t *const orig_true_type = true_expression->base.type;
7468 type_t *const orig_false_type = false_expression->base.type;
7469 type_t *const true_type = skip_typeref(orig_true_type);
7470 type_t *const false_type = skip_typeref(orig_false_type);
7473 source_position_t const *const pos = &conditional->base.source_position;
7474 type_t *result_type;
7475 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7476 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7477 /* ISO/IEC 14882:1998(E) §5.16:2 */
7478 if (true_expression->kind == EXPR_UNARY_THROW) {
7479 result_type = false_type;
7480 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7481 result_type = true_type;
7483 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7484 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7485 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7487 result_type = type_void;
7489 } else if (is_type_arithmetic(true_type)
7490 && is_type_arithmetic(false_type)) {
7491 result_type = semantic_arithmetic(true_type, false_type);
7492 } else if (same_compound_type(true_type, false_type)) {
7493 /* just take 1 of the 2 types */
7494 result_type = true_type;
7495 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7496 type_t *pointer_type;
7498 expression_t *other_expression;
7499 if (is_type_pointer(true_type) &&
7500 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7501 pointer_type = true_type;
7502 other_type = false_type;
7503 other_expression = false_expression;
7505 pointer_type = false_type;
7506 other_type = true_type;
7507 other_expression = true_expression;
7510 if (is_null_pointer_constant(other_expression)) {
7511 result_type = pointer_type;
7512 } else if (is_type_pointer(other_type)) {
7513 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7514 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7517 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7518 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7520 } else if (types_compatible(get_unqualified_type(to1),
7521 get_unqualified_type(to2))) {
7524 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7528 type_t *const type =
7529 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7530 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7531 } else if (is_type_integer(other_type)) {
7532 warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7533 result_type = pointer_type;
7535 goto types_incompatible;
7539 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7540 type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7542 result_type = type_error_type;
7545 conditional->true_expression
7546 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7547 conditional->false_expression
7548 = create_implicit_cast(false_expression, result_type);
7549 conditional->base.type = result_type;
7554 * Parse an extension expression.
7556 static expression_t *parse_extension(void)
7559 expression_t *expression = parse_subexpression(PREC_UNARY);
7565 * Parse a __builtin_classify_type() expression.
7567 static expression_t *parse_builtin_classify_type(void)
7569 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7570 result->base.type = type_int;
7572 eat(T___builtin_classify_type);
7574 expect('(', end_error);
7575 add_anchor_token(')');
7576 expression_t *expression = parse_expression();
7577 rem_anchor_token(')');
7578 expect(')', end_error);
7579 result->classify_type.type_expression = expression;
7583 return create_invalid_expression();
7587 * Parse a delete expression
7588 * ISO/IEC 14882:1998(E) §5.3.5
7590 static expression_t *parse_delete(void)
7592 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7593 result->base.type = type_void;
7598 result->kind = EXPR_UNARY_DELETE_ARRAY;
7599 expect(']', end_error);
7603 expression_t *const value = parse_subexpression(PREC_CAST);
7604 result->unary.value = value;
7606 type_t *const type = skip_typeref(value->base.type);
7607 if (!is_type_pointer(type)) {
7608 if (is_type_valid(type)) {
7609 errorf(&value->base.source_position,
7610 "operand of delete must have pointer type");
7612 } else if (is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7613 source_position_t const *const pos = &value->base.source_position;
7614 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7621 * Parse a throw expression
7622 * ISO/IEC 14882:1998(E) §15:1
7624 static expression_t *parse_throw(void)
7626 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7627 result->base.type = type_void;
7631 expression_t *value = NULL;
7632 switch (token.kind) {
7634 value = parse_assignment_expression();
7635 /* ISO/IEC 14882:1998(E) §15.1:3 */
7636 type_t *const orig_type = value->base.type;
7637 type_t *const type = skip_typeref(orig_type);
7638 if (is_type_incomplete(type)) {
7639 errorf(&value->base.source_position,
7640 "cannot throw object of incomplete type '%T'", orig_type);
7641 } else if (is_type_pointer(type)) {
7642 type_t *const points_to = skip_typeref(type->pointer.points_to);
7643 if (is_type_incomplete(points_to) &&
7644 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7645 errorf(&value->base.source_position,
7646 "cannot throw pointer to incomplete type '%T'", orig_type);
7654 result->unary.value = value;
7659 static bool check_pointer_arithmetic(const source_position_t *source_position,
7660 type_t *pointer_type,
7661 type_t *orig_pointer_type)
7663 type_t *points_to = pointer_type->pointer.points_to;
7664 points_to = skip_typeref(points_to);
7666 if (is_type_incomplete(points_to)) {
7667 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7668 errorf(source_position,
7669 "arithmetic with pointer to incomplete type '%T' not allowed",
7673 warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7675 } else if (is_type_function(points_to)) {
7677 errorf(source_position,
7678 "arithmetic with pointer to function type '%T' not allowed",
7682 warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7688 static bool is_lvalue(const expression_t *expression)
7690 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7691 switch (expression->kind) {
7692 case EXPR_ARRAY_ACCESS:
7693 case EXPR_COMPOUND_LITERAL:
7694 case EXPR_REFERENCE:
7696 case EXPR_UNARY_DEREFERENCE:
7700 type_t *type = skip_typeref(expression->base.type);
7702 /* ISO/IEC 14882:1998(E) §3.10:3 */
7703 is_type_reference(type) ||
7704 /* Claim it is an lvalue, if the type is invalid. There was a parse
7705 * error before, which maybe prevented properly recognizing it as
7707 !is_type_valid(type);
7712 static void semantic_incdec(unary_expression_t *expression)
7714 type_t *const orig_type = expression->value->base.type;
7715 type_t *const type = skip_typeref(orig_type);
7716 if (is_type_pointer(type)) {
7717 if (!check_pointer_arithmetic(&expression->base.source_position,
7721 } else if (!is_type_real(type) && is_type_valid(type)) {
7722 /* TODO: improve error message */
7723 errorf(&expression->base.source_position,
7724 "operation needs an arithmetic or pointer type");
7727 if (!is_lvalue(expression->value)) {
7728 /* TODO: improve error message */
7729 errorf(&expression->base.source_position, "lvalue required as operand");
7731 expression->base.type = orig_type;
7734 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7736 type_t *const orig_type = expression->value->base.type;
7737 type_t *const type = skip_typeref(orig_type);
7738 if (!is_type_arithmetic(type)) {
7739 if (is_type_valid(type)) {
7740 /* TODO: improve error message */
7741 errorf(&expression->base.source_position,
7742 "operation needs an arithmetic type");
7747 expression->base.type = orig_type;
7750 static void semantic_unexpr_plus(unary_expression_t *expression)
7752 semantic_unexpr_arithmetic(expression);
7753 source_position_t const *const pos = &expression->base.source_position;
7754 warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7757 static void semantic_not(unary_expression_t *expression)
7759 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
7760 semantic_condition(expression->value, "operand of !");
7761 expression->base.type = c_mode & _CXX ? type_bool : type_int;
7764 static void semantic_unexpr_integer(unary_expression_t *expression)
7766 type_t *const orig_type = expression->value->base.type;
7767 type_t *const type = skip_typeref(orig_type);
7768 if (!is_type_integer(type)) {
7769 if (is_type_valid(type)) {
7770 errorf(&expression->base.source_position,
7771 "operand of ~ must be of integer type");
7776 expression->base.type = orig_type;
7779 static void semantic_dereference(unary_expression_t *expression)
7781 type_t *const orig_type = expression->value->base.type;
7782 type_t *const type = skip_typeref(orig_type);
7783 if (!is_type_pointer(type)) {
7784 if (is_type_valid(type)) {
7785 errorf(&expression->base.source_position,
7786 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7791 type_t *result_type = type->pointer.points_to;
7792 result_type = automatic_type_conversion(result_type);
7793 expression->base.type = result_type;
7797 * Record that an address is taken (expression represents an lvalue).
7799 * @param expression the expression
7800 * @param may_be_register if true, the expression might be an register
7802 static void set_address_taken(expression_t *expression, bool may_be_register)
7804 if (expression->kind != EXPR_REFERENCE)
7807 entity_t *const entity = expression->reference.entity;
7809 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7812 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7813 && !may_be_register) {
7814 source_position_t const *const pos = &expression->base.source_position;
7815 errorf(pos, "address of register '%N' requested", entity);
7818 if (entity->kind == ENTITY_VARIABLE) {
7819 entity->variable.address_taken = true;
7821 assert(entity->kind == ENTITY_PARAMETER);
7822 entity->parameter.address_taken = true;
7827 * Check the semantic of the address taken expression.
7829 static void semantic_take_addr(unary_expression_t *expression)
7831 expression_t *value = expression->value;
7832 value->base.type = revert_automatic_type_conversion(value);
7834 type_t *orig_type = value->base.type;
7835 type_t *type = skip_typeref(orig_type);
7836 if (!is_type_valid(type))
7840 if (!is_lvalue(value)) {
7841 errorf(&expression->base.source_position, "'&' requires an lvalue");
7843 if (is_bitfield(value)) {
7844 errorf(&expression->base.source_position,
7845 "'&' not allowed on bitfield");
7848 set_address_taken(value, false);
7850 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7853 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7854 static expression_t *parse_##unexpression_type(void) \
7856 expression_t *unary_expression \
7857 = allocate_expression_zero(unexpression_type); \
7859 unary_expression->unary.value = parse_subexpression(PREC_UNARY); \
7861 sfunc(&unary_expression->unary); \
7863 return unary_expression; \
7866 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7867 semantic_unexpr_arithmetic)
7868 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7869 semantic_unexpr_plus)
7870 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7872 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7873 semantic_dereference)
7874 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7876 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7877 semantic_unexpr_integer)
7878 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7880 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7883 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7885 static expression_t *parse_##unexpression_type(expression_t *left) \
7887 expression_t *unary_expression \
7888 = allocate_expression_zero(unexpression_type); \
7890 unary_expression->unary.value = left; \
7892 sfunc(&unary_expression->unary); \
7894 return unary_expression; \
7897 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7898 EXPR_UNARY_POSTFIX_INCREMENT,
7900 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7901 EXPR_UNARY_POSTFIX_DECREMENT,
7904 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7906 /* TODO: handle complex + imaginary types */
7908 type_left = get_unqualified_type(type_left);
7909 type_right = get_unqualified_type(type_right);
7911 /* §6.3.1.8 Usual arithmetic conversions */
7912 if (type_left == type_long_double || type_right == type_long_double) {
7913 return type_long_double;
7914 } else if (type_left == type_double || type_right == type_double) {
7916 } else if (type_left == type_float || type_right == type_float) {
7920 type_left = promote_integer(type_left);
7921 type_right = promote_integer(type_right);
7923 if (type_left == type_right)
7926 bool const signed_left = is_type_signed(type_left);
7927 bool const signed_right = is_type_signed(type_right);
7928 int const rank_left = get_rank(type_left);
7929 int const rank_right = get_rank(type_right);
7931 if (signed_left == signed_right)
7932 return rank_left >= rank_right ? type_left : type_right;
7941 u_rank = rank_right;
7942 u_type = type_right;
7944 s_rank = rank_right;
7945 s_type = type_right;
7950 if (u_rank >= s_rank)
7953 /* casting rank to atomic_type_kind is a bit hacky, but makes things
7955 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
7956 > get_atomic_type_size((atomic_type_kind_t) u_rank))
7960 case ATOMIC_TYPE_INT: return type_unsigned_int;
7961 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7962 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7964 default: panic("invalid atomic type");
7969 * Check the semantic restrictions for a binary expression.
7971 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7973 expression_t *const left = expression->left;
7974 expression_t *const right = expression->right;
7975 type_t *const orig_type_left = left->base.type;
7976 type_t *const orig_type_right = right->base.type;
7977 type_t *const type_left = skip_typeref(orig_type_left);
7978 type_t *const type_right = skip_typeref(orig_type_right);
7980 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7981 /* TODO: improve error message */
7982 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7983 errorf(&expression->base.source_position,
7984 "operation needs arithmetic types");
7989 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7990 expression->left = create_implicit_cast(left, arithmetic_type);
7991 expression->right = create_implicit_cast(right, arithmetic_type);
7992 expression->base.type = arithmetic_type;
7995 static void semantic_binexpr_integer(binary_expression_t *const expression)
7997 expression_t *const left = expression->left;
7998 expression_t *const right = expression->right;
7999 type_t *const orig_type_left = left->base.type;
8000 type_t *const orig_type_right = right->base.type;
8001 type_t *const type_left = skip_typeref(orig_type_left);
8002 type_t *const type_right = skip_typeref(orig_type_right);
8004 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8005 /* TODO: improve error message */
8006 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8007 errorf(&expression->base.source_position,
8008 "operation needs integer types");
8013 type_t *const result_type = semantic_arithmetic(type_left, type_right);
8014 expression->left = create_implicit_cast(left, result_type);
8015 expression->right = create_implicit_cast(right, result_type);
8016 expression->base.type = result_type;
8019 static void warn_div_by_zero(binary_expression_t const *const expression)
8021 if (!is_type_integer(expression->base.type))
8024 expression_t const *const right = expression->right;
8025 /* The type of the right operand can be different for /= */
8026 if (is_type_integer(right->base.type) &&
8027 is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8028 !fold_constant_to_bool(right)) {
8029 source_position_t const *const pos = &expression->base.source_position;
8030 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
8035 * Check the semantic restrictions for a div/mod expression.
8037 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8039 semantic_binexpr_arithmetic(expression);
8040 warn_div_by_zero(expression);
8043 static void warn_addsub_in_shift(const expression_t *const expr)
8045 if (expr->base.parenthesized)
8049 switch (expr->kind) {
8050 case EXPR_BINARY_ADD: op = '+'; break;
8051 case EXPR_BINARY_SUB: op = '-'; break;
8055 source_position_t const *const pos = &expr->base.source_position;
8056 warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
8059 static bool semantic_shift(binary_expression_t *expression)
8061 expression_t *const left = expression->left;
8062 expression_t *const right = expression->right;
8063 type_t *const orig_type_left = left->base.type;
8064 type_t *const orig_type_right = right->base.type;
8065 type_t * type_left = skip_typeref(orig_type_left);
8066 type_t * type_right = skip_typeref(orig_type_right);
8068 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8069 /* TODO: improve error message */
8070 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8071 errorf(&expression->base.source_position,
8072 "operands of shift operation must have integer types");
8077 type_left = promote_integer(type_left);
8079 if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8080 source_position_t const *const pos = &right->base.source_position;
8081 long const count = fold_constant_to_int(right);
8083 warningf(WARN_OTHER, pos, "shift count must be non-negative");
8084 } else if ((unsigned long)count >=
8085 get_atomic_type_size(type_left->atomic.akind) * 8) {
8086 warningf(WARN_OTHER, pos, "shift count must be less than type width");
8090 type_right = promote_integer(type_right);
8091 expression->right = create_implicit_cast(right, type_right);
8096 static void semantic_shift_op(binary_expression_t *expression)
8098 expression_t *const left = expression->left;
8099 expression_t *const right = expression->right;
8101 if (!semantic_shift(expression))
8104 warn_addsub_in_shift(left);
8105 warn_addsub_in_shift(right);
8107 type_t *const orig_type_left = left->base.type;
8108 type_t * type_left = skip_typeref(orig_type_left);
8110 type_left = promote_integer(type_left);
8111 expression->left = create_implicit_cast(left, type_left);
8112 expression->base.type = type_left;
8115 static void semantic_add(binary_expression_t *expression)
8117 expression_t *const left = expression->left;
8118 expression_t *const right = expression->right;
8119 type_t *const orig_type_left = left->base.type;
8120 type_t *const orig_type_right = right->base.type;
8121 type_t *const type_left = skip_typeref(orig_type_left);
8122 type_t *const type_right = skip_typeref(orig_type_right);
8125 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8126 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8127 expression->left = create_implicit_cast(left, arithmetic_type);
8128 expression->right = create_implicit_cast(right, arithmetic_type);
8129 expression->base.type = arithmetic_type;
8130 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8131 check_pointer_arithmetic(&expression->base.source_position,
8132 type_left, orig_type_left);
8133 expression->base.type = type_left;
8134 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8135 check_pointer_arithmetic(&expression->base.source_position,
8136 type_right, orig_type_right);
8137 expression->base.type = type_right;
8138 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8139 errorf(&expression->base.source_position,
8140 "invalid operands to binary + ('%T', '%T')",
8141 orig_type_left, orig_type_right);
8145 static void semantic_sub(binary_expression_t *expression)
8147 expression_t *const left = expression->left;
8148 expression_t *const right = expression->right;
8149 type_t *const orig_type_left = left->base.type;
8150 type_t *const orig_type_right = right->base.type;
8151 type_t *const type_left = skip_typeref(orig_type_left);
8152 type_t *const type_right = skip_typeref(orig_type_right);
8153 source_position_t const *const pos = &expression->base.source_position;
8156 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8157 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8158 expression->left = create_implicit_cast(left, arithmetic_type);
8159 expression->right = create_implicit_cast(right, arithmetic_type);
8160 expression->base.type = arithmetic_type;
8161 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8162 check_pointer_arithmetic(&expression->base.source_position,
8163 type_left, orig_type_left);
8164 expression->base.type = type_left;
8165 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8166 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8167 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8168 if (!types_compatible(unqual_left, unqual_right)) {
8170 "subtracting pointers to incompatible types '%T' and '%T'",
8171 orig_type_left, orig_type_right);
8172 } else if (!is_type_object(unqual_left)) {
8173 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8174 errorf(pos, "subtracting pointers to non-object types '%T'",
8177 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8180 expression->base.type = type_ptrdiff_t;
8181 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8182 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8183 orig_type_left, orig_type_right);
8187 static void warn_string_literal_address(expression_t const* expr)
8189 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8190 expr = expr->unary.value;
8191 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8193 expr = expr->unary.value;
8196 if (expr->kind == EXPR_STRING_LITERAL
8197 || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8198 source_position_t const *const pos = &expr->base.source_position;
8199 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8203 static bool maybe_negative(expression_t const *const expr)
8205 switch (is_constant_expression(expr)) {
8206 case EXPR_CLASS_ERROR: return false;
8207 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8208 default: return true;
8212 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8214 warn_string_literal_address(expr);
8216 expression_t const* const ref = get_reference_address(expr);
8217 if (ref != NULL && is_null_pointer_constant(other)) {
8218 entity_t const *const ent = ref->reference.entity;
8219 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8222 if (!expr->base.parenthesized) {
8223 switch (expr->base.kind) {
8224 case EXPR_BINARY_LESS:
8225 case EXPR_BINARY_GREATER:
8226 case EXPR_BINARY_LESSEQUAL:
8227 case EXPR_BINARY_GREATEREQUAL:
8228 case EXPR_BINARY_NOTEQUAL:
8229 case EXPR_BINARY_EQUAL:
8230 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8239 * Check the semantics of comparison expressions.
8241 * @param expression The expression to check.
8243 static void semantic_comparison(binary_expression_t *expression)
8245 source_position_t const *const pos = &expression->base.source_position;
8246 expression_t *const left = expression->left;
8247 expression_t *const right = expression->right;
8249 warn_comparison(pos, left, right);
8250 warn_comparison(pos, right, left);
8252 type_t *orig_type_left = left->base.type;
8253 type_t *orig_type_right = right->base.type;
8254 type_t *type_left = skip_typeref(orig_type_left);
8255 type_t *type_right = skip_typeref(orig_type_right);
8257 /* TODO non-arithmetic types */
8258 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8259 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8261 /* test for signed vs unsigned compares */
8262 if (is_type_integer(arithmetic_type)) {
8263 bool const signed_left = is_type_signed(type_left);
8264 bool const signed_right = is_type_signed(type_right);
8265 if (signed_left != signed_right) {
8266 /* FIXME long long needs better const folding magic */
8267 /* TODO check whether constant value can be represented by other type */
8268 if ((signed_left && maybe_negative(left)) ||
8269 (signed_right && maybe_negative(right))) {
8270 warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8275 expression->left = create_implicit_cast(left, arithmetic_type);
8276 expression->right = create_implicit_cast(right, arithmetic_type);
8277 expression->base.type = arithmetic_type;
8278 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8279 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8280 is_type_float(arithmetic_type)) {
8281 warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8283 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8284 /* TODO check compatibility */
8285 } else if (is_type_pointer(type_left)) {
8286 expression->right = create_implicit_cast(right, type_left);
8287 } else if (is_type_pointer(type_right)) {
8288 expression->left = create_implicit_cast(left, type_right);
8289 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8290 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8292 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8296 * Checks if a compound type has constant fields.
8298 static bool has_const_fields(const compound_type_t *type)
8300 compound_t *compound = type->compound;
8301 entity_t *entry = compound->members.entities;
8303 for (; entry != NULL; entry = entry->base.next) {
8304 if (!is_declaration(entry))
8307 const type_t *decl_type = skip_typeref(entry->declaration.type);
8308 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8315 static bool is_valid_assignment_lhs(expression_t const* const left)
8317 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8318 type_t *const type_left = skip_typeref(orig_type_left);
8320 if (!is_lvalue(left)) {
8321 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8326 if (left->kind == EXPR_REFERENCE
8327 && left->reference.entity->kind == ENTITY_FUNCTION) {
8328 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8332 if (is_type_array(type_left)) {
8333 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8336 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8337 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8341 if (is_type_incomplete(type_left)) {
8342 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8343 left, orig_type_left);
8346 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8347 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8348 left, orig_type_left);
8355 static void semantic_arithmetic_assign(binary_expression_t *expression)
8357 expression_t *left = expression->left;
8358 expression_t *right = expression->right;
8359 type_t *orig_type_left = left->base.type;
8360 type_t *orig_type_right = right->base.type;
8362 if (!is_valid_assignment_lhs(left))
8365 type_t *type_left = skip_typeref(orig_type_left);
8366 type_t *type_right = skip_typeref(orig_type_right);
8368 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8369 /* TODO: improve error message */
8370 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8371 errorf(&expression->base.source_position,
8372 "operation needs arithmetic types");
8377 /* combined instructions are tricky. We can't create an implicit cast on
8378 * the left side, because we need the uncasted form for the store.
8379 * The ast2firm pass has to know that left_type must be right_type
8380 * for the arithmetic operation and create a cast by itself */
8381 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8382 expression->right = create_implicit_cast(right, arithmetic_type);
8383 expression->base.type = type_left;
8386 static void semantic_divmod_assign(binary_expression_t *expression)
8388 semantic_arithmetic_assign(expression);
8389 warn_div_by_zero(expression);
8392 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8394 expression_t *const left = expression->left;
8395 expression_t *const right = expression->right;
8396 type_t *const orig_type_left = left->base.type;
8397 type_t *const orig_type_right = right->base.type;
8398 type_t *const type_left = skip_typeref(orig_type_left);
8399 type_t *const type_right = skip_typeref(orig_type_right);
8401 if (!is_valid_assignment_lhs(left))
8404 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8405 /* combined instructions are tricky. We can't create an implicit cast on
8406 * the left side, because we need the uncasted form for the store.
8407 * The ast2firm pass has to know that left_type must be right_type
8408 * for the arithmetic operation and create a cast by itself */
8409 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8410 expression->right = create_implicit_cast(right, arithmetic_type);
8411 expression->base.type = type_left;
8412 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8413 check_pointer_arithmetic(&expression->base.source_position,
8414 type_left, orig_type_left);
8415 expression->base.type = type_left;
8416 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8417 errorf(&expression->base.source_position,
8418 "incompatible types '%T' and '%T' in assignment",
8419 orig_type_left, orig_type_right);
8423 static void semantic_integer_assign(binary_expression_t *expression)
8425 expression_t *left = expression->left;
8426 expression_t *right = expression->right;
8427 type_t *orig_type_left = left->base.type;
8428 type_t *orig_type_right = right->base.type;
8430 if (!is_valid_assignment_lhs(left))
8433 type_t *type_left = skip_typeref(orig_type_left);
8434 type_t *type_right = skip_typeref(orig_type_right);
8436 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8437 /* TODO: improve error message */
8438 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8439 errorf(&expression->base.source_position,
8440 "operation needs integer types");
8445 /* combined instructions are tricky. We can't create an implicit cast on
8446 * the left side, because we need the uncasted form for the store.
8447 * The ast2firm pass has to know that left_type must be right_type
8448 * for the arithmetic operation and create a cast by itself */
8449 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8450 expression->right = create_implicit_cast(right, arithmetic_type);
8451 expression->base.type = type_left;
8454 static void semantic_shift_assign(binary_expression_t *expression)
8456 expression_t *left = expression->left;
8458 if (!is_valid_assignment_lhs(left))
8461 if (!semantic_shift(expression))
8464 expression->base.type = skip_typeref(left->base.type);
8467 static void warn_logical_and_within_or(const expression_t *const expr)
8469 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8471 if (expr->base.parenthesized)
8473 source_position_t const *const pos = &expr->base.source_position;
8474 warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8478 * Check the semantic restrictions of a logical expression.
8480 static void semantic_logical_op(binary_expression_t *expression)
8482 /* §6.5.13:2 Each of the operands shall have scalar type.
8483 * §6.5.14:2 Each of the operands shall have scalar type. */
8484 semantic_condition(expression->left, "left operand of logical operator");
8485 semantic_condition(expression->right, "right operand of logical operator");
8486 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8487 warn_logical_and_within_or(expression->left);
8488 warn_logical_and_within_or(expression->right);
8490 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8494 * Check the semantic restrictions of a binary assign expression.
8496 static void semantic_binexpr_assign(binary_expression_t *expression)
8498 expression_t *left = expression->left;
8499 type_t *orig_type_left = left->base.type;
8501 if (!is_valid_assignment_lhs(left))
8504 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8505 report_assign_error(error, orig_type_left, expression->right,
8506 "assignment", &left->base.source_position);
8507 expression->right = create_implicit_cast(expression->right, orig_type_left);
8508 expression->base.type = orig_type_left;
8512 * Determine if the outermost operation (or parts thereof) of the given
8513 * expression has no effect in order to generate a warning about this fact.
8514 * Therefore in some cases this only examines some of the operands of the
8515 * expression (see comments in the function and examples below).
8517 * f() + 23; // warning, because + has no effect
8518 * x || f(); // no warning, because x controls execution of f()
8519 * x ? y : f(); // warning, because y has no effect
8520 * (void)x; // no warning to be able to suppress the warning
8521 * This function can NOT be used for an "expression has definitely no effect"-
8523 static bool expression_has_effect(const expression_t *const expr)
8525 switch (expr->kind) {
8526 case EXPR_INVALID: return true; /* do NOT warn */
8527 case EXPR_REFERENCE: return false;
8528 case EXPR_REFERENCE_ENUM_VALUE: return false;
8529 case EXPR_LABEL_ADDRESS: return false;
8531 /* suppress the warning for microsoft __noop operations */
8532 case EXPR_LITERAL_MS_NOOP: return true;
8533 case EXPR_LITERAL_BOOLEAN:
8534 case EXPR_LITERAL_CHARACTER:
8535 case EXPR_LITERAL_WIDE_CHARACTER:
8536 case EXPR_LITERAL_INTEGER:
8537 case EXPR_LITERAL_INTEGER_OCTAL:
8538 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8539 case EXPR_LITERAL_FLOATINGPOINT:
8540 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8541 case EXPR_STRING_LITERAL: return false;
8542 case EXPR_WIDE_STRING_LITERAL: return false;
8545 const call_expression_t *const call = &expr->call;
8546 if (call->function->kind != EXPR_REFERENCE)
8549 switch (call->function->reference.entity->function.btk) {
8550 /* FIXME: which builtins have no effect? */
8551 default: return true;
8555 /* Generate the warning if either the left or right hand side of a
8556 * conditional expression has no effect */
8557 case EXPR_CONDITIONAL: {
8558 conditional_expression_t const *const cond = &expr->conditional;
8559 expression_t const *const t = cond->true_expression;
8561 (t == NULL || expression_has_effect(t)) &&
8562 expression_has_effect(cond->false_expression);
8565 case EXPR_SELECT: return false;
8566 case EXPR_ARRAY_ACCESS: return false;
8567 case EXPR_SIZEOF: return false;
8568 case EXPR_CLASSIFY_TYPE: return false;
8569 case EXPR_ALIGNOF: return false;
8571 case EXPR_FUNCNAME: return false;
8572 case EXPR_BUILTIN_CONSTANT_P: return false;
8573 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8574 case EXPR_OFFSETOF: return false;
8575 case EXPR_VA_START: return true;
8576 case EXPR_VA_ARG: return true;
8577 case EXPR_VA_COPY: return true;
8578 case EXPR_STATEMENT: return true; // TODO
8579 case EXPR_COMPOUND_LITERAL: return false;
8581 case EXPR_UNARY_NEGATE: return false;
8582 case EXPR_UNARY_PLUS: return false;
8583 case EXPR_UNARY_BITWISE_NEGATE: return false;
8584 case EXPR_UNARY_NOT: return false;
8585 case EXPR_UNARY_DEREFERENCE: return false;
8586 case EXPR_UNARY_TAKE_ADDRESS: return false;
8587 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8588 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8589 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8590 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8592 /* Treat void casts as if they have an effect in order to being able to
8593 * suppress the warning */
8594 case EXPR_UNARY_CAST: {
8595 type_t *const type = skip_typeref(expr->base.type);
8596 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8599 case EXPR_UNARY_ASSUME: return true;
8600 case EXPR_UNARY_DELETE: return true;
8601 case EXPR_UNARY_DELETE_ARRAY: return true;
8602 case EXPR_UNARY_THROW: return true;
8604 case EXPR_BINARY_ADD: return false;
8605 case EXPR_BINARY_SUB: return false;
8606 case EXPR_BINARY_MUL: return false;
8607 case EXPR_BINARY_DIV: return false;
8608 case EXPR_BINARY_MOD: return false;
8609 case EXPR_BINARY_EQUAL: return false;
8610 case EXPR_BINARY_NOTEQUAL: return false;
8611 case EXPR_BINARY_LESS: return false;
8612 case EXPR_BINARY_LESSEQUAL: return false;
8613 case EXPR_BINARY_GREATER: return false;
8614 case EXPR_BINARY_GREATEREQUAL: return false;
8615 case EXPR_BINARY_BITWISE_AND: return false;
8616 case EXPR_BINARY_BITWISE_OR: return false;
8617 case EXPR_BINARY_BITWISE_XOR: return false;
8618 case EXPR_BINARY_SHIFTLEFT: return false;
8619 case EXPR_BINARY_SHIFTRIGHT: return false;
8620 case EXPR_BINARY_ASSIGN: return true;
8621 case EXPR_BINARY_MUL_ASSIGN: return true;
8622 case EXPR_BINARY_DIV_ASSIGN: return true;
8623 case EXPR_BINARY_MOD_ASSIGN: return true;
8624 case EXPR_BINARY_ADD_ASSIGN: return true;
8625 case EXPR_BINARY_SUB_ASSIGN: return true;
8626 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8627 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8628 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8629 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8630 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8632 /* Only examine the right hand side of && and ||, because the left hand
8633 * side already has the effect of controlling the execution of the right
8635 case EXPR_BINARY_LOGICAL_AND:
8636 case EXPR_BINARY_LOGICAL_OR:
8637 /* Only examine the right hand side of a comma expression, because the left
8638 * hand side has a separate warning */
8639 case EXPR_BINARY_COMMA:
8640 return expression_has_effect(expr->binary.right);
8642 case EXPR_BINARY_ISGREATER: return false;
8643 case EXPR_BINARY_ISGREATEREQUAL: return false;
8644 case EXPR_BINARY_ISLESS: return false;
8645 case EXPR_BINARY_ISLESSEQUAL: return false;
8646 case EXPR_BINARY_ISLESSGREATER: return false;
8647 case EXPR_BINARY_ISUNORDERED: return false;
8650 internal_errorf(HERE, "unexpected expression");
8653 static void semantic_comma(binary_expression_t *expression)
8655 const expression_t *const left = expression->left;
8656 if (!expression_has_effect(left)) {
8657 source_position_t const *const pos = &left->base.source_position;
8658 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8660 expression->base.type = expression->right->base.type;
8664 * @param prec_r precedence of the right operand
8666 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8667 static expression_t *parse_##binexpression_type(expression_t *left) \
8669 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8670 binexpr->binary.left = left; \
8673 expression_t *right = parse_subexpression(prec_r); \
8675 binexpr->binary.right = right; \
8676 sfunc(&binexpr->binary); \
8681 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8682 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8683 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8684 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8685 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8686 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8687 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8688 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8689 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8690 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8691 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8692 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8693 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8694 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_integer)
8695 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_integer)
8696 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_integer)
8697 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8698 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8699 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8700 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8701 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8702 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8703 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8704 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8705 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8706 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8707 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8708 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8709 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8710 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8713 static expression_t *parse_subexpression(precedence_t precedence)
8715 if (token.kind < 0) {
8716 return expected_expression_error();
8719 expression_parser_function_t *parser
8720 = &expression_parsers[token.kind];
8723 if (parser->parser != NULL) {
8724 left = parser->parser();
8726 left = parse_primary_expression();
8728 assert(left != NULL);
8731 if (token.kind < 0) {
8732 return expected_expression_error();
8735 parser = &expression_parsers[token.kind];
8736 if (parser->infix_parser == NULL)
8738 if (parser->infix_precedence < precedence)
8741 left = parser->infix_parser(left);
8743 assert(left != NULL);
8750 * Parse an expression.
8752 static expression_t *parse_expression(void)
8754 return parse_subexpression(PREC_EXPRESSION);
8758 * Register a parser for a prefix-like operator.
8760 * @param parser the parser function
8761 * @param token_kind the token type of the prefix token
8763 static void register_expression_parser(parse_expression_function parser,
8766 expression_parser_function_t *entry = &expression_parsers[token_kind];
8768 if (entry->parser != NULL) {
8769 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8770 panic("trying to register multiple expression parsers for a token");
8772 entry->parser = parser;
8776 * Register a parser for an infix operator with given precedence.
8778 * @param parser the parser function
8779 * @param token_kind the token type of the infix operator
8780 * @param precedence the precedence of the operator
8782 static void register_infix_parser(parse_expression_infix_function parser,
8783 int token_kind, precedence_t precedence)
8785 expression_parser_function_t *entry = &expression_parsers[token_kind];
8787 if (entry->infix_parser != NULL) {
8788 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8789 panic("trying to register multiple infix expression parsers for a "
8792 entry->infix_parser = parser;
8793 entry->infix_precedence = precedence;
8797 * Initialize the expression parsers.
8799 static void init_expression_parsers(void)
8801 memset(&expression_parsers, 0, sizeof(expression_parsers));
8803 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8804 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8805 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8806 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8807 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8808 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8809 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8810 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8811 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8812 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8813 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8814 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8815 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8816 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8817 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8818 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8819 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8820 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8821 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8822 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8823 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8824 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8825 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8826 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8827 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8828 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8829 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8830 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8831 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8832 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8833 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8834 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8835 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8836 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8837 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8838 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8839 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8841 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8842 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8843 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8844 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8845 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8846 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8847 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8848 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8849 register_expression_parser(parse_sizeof, T_sizeof);
8850 register_expression_parser(parse_alignof, T___alignof__);
8851 register_expression_parser(parse_extension, T___extension__);
8852 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8853 register_expression_parser(parse_delete, T_delete);
8854 register_expression_parser(parse_throw, T_throw);
8858 * Parse a asm statement arguments specification.
8860 static asm_argument_t *parse_asm_arguments(bool is_out)
8862 asm_argument_t *result = NULL;
8863 asm_argument_t **anchor = &result;
8865 while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8866 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8867 memset(argument, 0, sizeof(argument[0]));
8870 if (token.kind != T_IDENTIFIER) {
8871 parse_error_expected("while parsing asm argument",
8872 T_IDENTIFIER, NULL);
8875 argument->symbol = token.identifier.symbol;
8877 expect(']', end_error);
8880 argument->constraints = parse_string_literals();
8881 expect('(', end_error);
8882 add_anchor_token(')');
8883 expression_t *expression = parse_expression();
8884 rem_anchor_token(')');
8886 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8887 * change size or type representation (e.g. int -> long is ok, but
8888 * int -> float is not) */
8889 if (expression->kind == EXPR_UNARY_CAST) {
8890 type_t *const type = expression->base.type;
8891 type_kind_t const kind = type->kind;
8892 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8895 if (kind == TYPE_ATOMIC) {
8896 atomic_type_kind_t const akind = type->atomic.akind;
8897 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8898 size = get_atomic_type_size(akind);
8900 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8901 size = get_type_size(type_void_ptr);
8905 expression_t *const value = expression->unary.value;
8906 type_t *const value_type = value->base.type;
8907 type_kind_t const value_kind = value_type->kind;
8909 unsigned value_flags;
8910 unsigned value_size;
8911 if (value_kind == TYPE_ATOMIC) {
8912 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8913 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8914 value_size = get_atomic_type_size(value_akind);
8915 } else if (value_kind == TYPE_POINTER) {
8916 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8917 value_size = get_type_size(type_void_ptr);
8922 if (value_flags != flags || value_size != size)
8926 } while (expression->kind == EXPR_UNARY_CAST);
8930 if (!is_lvalue(expression)) {
8931 errorf(&expression->base.source_position,
8932 "asm output argument is not an lvalue");
8935 if (argument->constraints.begin[0] == '=')
8936 determine_lhs_ent(expression, NULL);
8938 mark_vars_read(expression, NULL);
8940 mark_vars_read(expression, NULL);
8942 argument->expression = expression;
8943 expect(')', end_error);
8945 set_address_taken(expression, true);
8948 anchor = &argument->next;
8960 * Parse a asm statement clobber specification.
8962 static asm_clobber_t *parse_asm_clobbers(void)
8964 asm_clobber_t *result = NULL;
8965 asm_clobber_t **anchor = &result;
8967 while (token.kind == T_STRING_LITERAL) {
8968 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8969 clobber->clobber = parse_string_literals();
8972 anchor = &clobber->next;
8982 * Parse an asm statement.
8984 static statement_t *parse_asm_statement(void)
8986 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8987 asm_statement_t *asm_statement = &statement->asms;
8991 if (next_if(T_volatile))
8992 asm_statement->is_volatile = true;
8994 expect('(', end_error);
8995 add_anchor_token(')');
8996 if (token.kind != T_STRING_LITERAL) {
8997 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9000 asm_statement->asm_text = parse_string_literals();
9002 add_anchor_token(':');
9003 if (!next_if(':')) {
9004 rem_anchor_token(':');
9008 asm_statement->outputs = parse_asm_arguments(true);
9009 if (!next_if(':')) {
9010 rem_anchor_token(':');
9014 asm_statement->inputs = parse_asm_arguments(false);
9015 if (!next_if(':')) {
9016 rem_anchor_token(':');
9019 rem_anchor_token(':');
9021 asm_statement->clobbers = parse_asm_clobbers();
9024 rem_anchor_token(')');
9025 expect(')', end_error);
9026 expect(';', end_error);
9028 if (asm_statement->outputs == NULL) {
9029 /* GCC: An 'asm' instruction without any output operands will be treated
9030 * identically to a volatile 'asm' instruction. */
9031 asm_statement->is_volatile = true;
9036 return create_invalid_statement();
9039 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9041 statement_t *inner_stmt;
9042 switch (token.kind) {
9044 errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9045 inner_stmt = create_invalid_statement();
9049 if (label->kind == STATEMENT_LABEL) {
9050 /* Eat an empty statement here, to avoid the warning about an empty
9051 * statement after a label. label:; is commonly used to have a label
9052 * before a closing brace. */
9053 inner_stmt = create_empty_statement();
9060 inner_stmt = parse_statement();
9061 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9062 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9063 if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9064 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9072 * Parse a case statement.
9074 static statement_t *parse_case_statement(void)
9076 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9077 source_position_t *const pos = &statement->base.source_position;
9081 expression_t *const expression = parse_expression();
9082 statement->case_label.expression = expression;
9083 expression_classification_t const expr_class = is_constant_expression(expression);
9084 if (expr_class != EXPR_CLASS_CONSTANT) {
9085 if (expr_class != EXPR_CLASS_ERROR) {
9086 errorf(pos, "case label does not reduce to an integer constant");
9088 statement->case_label.is_bad = true;
9090 long const val = fold_constant_to_int(expression);
9091 statement->case_label.first_case = val;
9092 statement->case_label.last_case = val;
9096 if (next_if(T_DOTDOTDOT)) {
9097 expression_t *const end_range = parse_expression();
9098 statement->case_label.end_range = end_range;
9099 expression_classification_t const end_class = is_constant_expression(end_range);
9100 if (end_class != EXPR_CLASS_CONSTANT) {
9101 if (end_class != EXPR_CLASS_ERROR) {
9102 errorf(pos, "case range does not reduce to an integer constant");
9104 statement->case_label.is_bad = true;
9106 long const val = fold_constant_to_int(end_range);
9107 statement->case_label.last_case = val;
9109 if (val < statement->case_label.first_case) {
9110 statement->case_label.is_empty_range = true;
9111 warningf(WARN_OTHER, pos, "empty range specified");
9117 PUSH_PARENT(statement);
9119 expect(':', end_error);
9122 if (current_switch != NULL) {
9123 if (! statement->case_label.is_bad) {
9124 /* Check for duplicate case values */
9125 case_label_statement_t *c = &statement->case_label;
9126 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9127 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9130 if (c->last_case < l->first_case || c->first_case > l->last_case)
9133 errorf(pos, "duplicate case value (previously used %P)",
9134 &l->base.source_position);
9138 /* link all cases into the switch statement */
9139 if (current_switch->last_case == NULL) {
9140 current_switch->first_case = &statement->case_label;
9142 current_switch->last_case->next = &statement->case_label;
9144 current_switch->last_case = &statement->case_label;
9146 errorf(pos, "case label not within a switch statement");
9149 statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9156 * Parse a default statement.
9158 static statement_t *parse_default_statement(void)
9160 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9164 PUSH_PARENT(statement);
9166 expect(':', end_error);
9169 if (current_switch != NULL) {
9170 const case_label_statement_t *def_label = current_switch->default_label;
9171 if (def_label != NULL) {
9172 errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9174 current_switch->default_label = &statement->case_label;
9176 /* link all cases into the switch statement */
9177 if (current_switch->last_case == NULL) {
9178 current_switch->first_case = &statement->case_label;
9180 current_switch->last_case->next = &statement->case_label;
9182 current_switch->last_case = &statement->case_label;
9185 errorf(&statement->base.source_position,
9186 "'default' label not within a switch statement");
9189 statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9196 * Parse a label statement.
9198 static statement_t *parse_label_statement(void)
9200 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9201 label_t *const label = get_label();
9202 statement->label.label = label;
9204 PUSH_PARENT(statement);
9206 /* if statement is already set then the label is defined twice,
9207 * otherwise it was just mentioned in a goto/local label declaration so far
9209 source_position_t const* const pos = &statement->base.source_position;
9210 if (label->statement != NULL) {
9211 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9213 label->base.source_position = *pos;
9214 label->statement = statement;
9219 if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9220 parse_attributes(NULL); // TODO process attributes
9223 statement->label.statement = parse_label_inner_statement(statement, "label");
9225 /* remember the labels in a list for later checking */
9226 *label_anchor = &statement->label;
9227 label_anchor = &statement->label.next;
9233 static statement_t *parse_inner_statement(void)
9235 statement_t *const stmt = parse_statement();
9236 /* ISO/IEC 9899:1999(E) §6.8:1/6.8.2:1 Declarations are no statements */
9237 /* ISO/IEC 14882:1998(E) §6:1/§6.7 Declarations are statements */
9238 if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9239 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9245 * Parse an if statement.
9247 static statement_t *parse_if(void)
9249 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9253 PUSH_PARENT(statement);
9255 add_anchor_token('{');
9257 expect('(', end_error);
9258 add_anchor_token(')');
9259 expression_t *const expr = parse_expression();
9260 statement->ifs.condition = expr;
9261 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9263 semantic_condition(expr, "condition of 'if'-statment");
9264 mark_vars_read(expr, NULL);
9265 rem_anchor_token(')');
9266 expect(')', end_error);
9269 rem_anchor_token('{');
9271 add_anchor_token(T_else);
9272 statement_t *const true_stmt = parse_inner_statement();
9273 statement->ifs.true_statement = true_stmt;
9274 rem_anchor_token(T_else);
9276 if (next_if(T_else)) {
9277 statement->ifs.false_statement = parse_inner_statement();
9278 } else if (true_stmt->kind == STATEMENT_IF &&
9279 true_stmt->ifs.false_statement != NULL) {
9280 source_position_t const *const pos = &true_stmt->base.source_position;
9281 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9289 * Check that all enums are handled in a switch.
9291 * @param statement the switch statement to check
9293 static void check_enum_cases(const switch_statement_t *statement)
9295 if (!is_warn_on(WARN_SWITCH_ENUM))
9297 const type_t *type = skip_typeref(statement->expression->base.type);
9298 if (! is_type_enum(type))
9300 const enum_type_t *enumt = &type->enumt;
9302 /* if we have a default, no warnings */
9303 if (statement->default_label != NULL)
9306 /* FIXME: calculation of value should be done while parsing */
9307 /* TODO: quadratic algorithm here. Change to an n log n one */
9308 long last_value = -1;
9309 const entity_t *entry = enumt->enume->base.next;
9310 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9311 entry = entry->base.next) {
9312 const expression_t *expression = entry->enum_value.value;
9313 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9315 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9316 if (l->expression == NULL)
9318 if (l->first_case <= value && value <= l->last_case) {
9324 source_position_t const *const pos = &statement->base.source_position;
9325 warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9332 * Parse a switch statement.
9334 static statement_t *parse_switch(void)
9336 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9340 PUSH_PARENT(statement);
9342 expect('(', end_error);
9343 add_anchor_token(')');
9344 expression_t *const expr = parse_expression();
9345 mark_vars_read(expr, NULL);
9346 type_t * type = skip_typeref(expr->base.type);
9347 if (is_type_integer(type)) {
9348 type = promote_integer(type);
9349 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9350 warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9352 } else if (is_type_valid(type)) {
9353 errorf(&expr->base.source_position,
9354 "switch quantity is not an integer, but '%T'", type);
9355 type = type_error_type;
9357 statement->switchs.expression = create_implicit_cast(expr, type);
9358 expect(')', end_error);
9359 rem_anchor_token(')');
9361 switch_statement_t *rem = current_switch;
9362 current_switch = &statement->switchs;
9363 statement->switchs.body = parse_inner_statement();
9364 current_switch = rem;
9366 if (statement->switchs.default_label == NULL) {
9367 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9369 check_enum_cases(&statement->switchs);
9375 return create_invalid_statement();
9378 static statement_t *parse_loop_body(statement_t *const loop)
9380 statement_t *const rem = current_loop;
9381 current_loop = loop;
9383 statement_t *const body = parse_inner_statement();
9390 * Parse a while statement.
9392 static statement_t *parse_while(void)
9394 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9398 PUSH_PARENT(statement);
9400 expect('(', end_error);
9401 add_anchor_token(')');
9402 expression_t *const cond = parse_expression();
9403 statement->whiles.condition = cond;
9404 /* §6.8.5:2 The controlling expression of an iteration statement shall
9405 * have scalar type. */
9406 semantic_condition(cond, "condition of 'while'-statement");
9407 mark_vars_read(cond, NULL);
9408 rem_anchor_token(')');
9409 expect(')', end_error);
9411 statement->whiles.body = parse_loop_body(statement);
9417 return create_invalid_statement();
9421 * Parse a do statement.
9423 static statement_t *parse_do(void)
9425 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9429 PUSH_PARENT(statement);
9431 add_anchor_token(T_while);
9432 statement->do_while.body = parse_loop_body(statement);
9433 rem_anchor_token(T_while);
9435 expect(T_while, end_error);
9436 expect('(', end_error);
9437 add_anchor_token(')');
9438 expression_t *const cond = parse_expression();
9439 statement->do_while.condition = cond;
9440 /* §6.8.5:2 The controlling expression of an iteration statement shall
9441 * have scalar type. */
9442 semantic_condition(cond, "condition of 'do-while'-statement");
9443 mark_vars_read(cond, NULL);
9444 rem_anchor_token(')');
9445 expect(')', end_error);
9446 expect(';', end_error);
9452 return create_invalid_statement();
9456 * Parse a for statement.
9458 static statement_t *parse_for(void)
9460 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9464 expect('(', end_error1);
9465 add_anchor_token(')');
9467 PUSH_PARENT(statement);
9468 PUSH_SCOPE(&statement->fors.scope);
9473 } else if (is_declaration_specifier(&token)) {
9474 parse_declaration(record_entity, DECL_FLAGS_NONE);
9476 add_anchor_token(';');
9477 expression_t *const init = parse_expression();
9478 statement->fors.initialisation = init;
9479 mark_vars_read(init, ENT_ANY);
9480 if (!expression_has_effect(init)) {
9481 warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9483 rem_anchor_token(';');
9484 expect(';', end_error2);
9489 if (token.kind != ';') {
9490 add_anchor_token(';');
9491 expression_t *const cond = parse_expression();
9492 statement->fors.condition = cond;
9493 /* §6.8.5:2 The controlling expression of an iteration statement
9494 * shall have scalar type. */
9495 semantic_condition(cond, "condition of 'for'-statement");
9496 mark_vars_read(cond, NULL);
9497 rem_anchor_token(';');
9499 expect(';', end_error2);
9500 if (token.kind != ')') {
9501 expression_t *const step = parse_expression();
9502 statement->fors.step = step;
9503 mark_vars_read(step, ENT_ANY);
9504 if (!expression_has_effect(step)) {
9505 warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9508 expect(')', end_error2);
9509 rem_anchor_token(')');
9510 statement->fors.body = parse_loop_body(statement);
9518 rem_anchor_token(')');
9523 return create_invalid_statement();
9527 * Parse a goto statement.
9529 static statement_t *parse_goto(void)
9531 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9534 if (GNU_MODE && next_if('*')) {
9535 expression_t *expression = parse_expression();
9536 mark_vars_read(expression, NULL);
9538 /* Argh: although documentation says the expression must be of type void*,
9539 * gcc accepts anything that can be casted into void* without error */
9540 type_t *type = expression->base.type;
9542 if (type != type_error_type) {
9543 if (!is_type_pointer(type) && !is_type_integer(type)) {
9544 errorf(&expression->base.source_position,
9545 "cannot convert to a pointer type");
9546 } else if (type != type_void_ptr) {
9547 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9549 expression = create_implicit_cast(expression, type_void_ptr);
9552 statement->gotos.expression = expression;
9553 } else if (token.kind == T_IDENTIFIER) {
9554 label_t *const label = get_label();
9556 statement->gotos.label = label;
9559 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9561 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9563 return create_invalid_statement();
9566 /* remember the goto's in a list for later checking */
9567 *goto_anchor = &statement->gotos;
9568 goto_anchor = &statement->gotos.next;
9570 expect(';', end_error);
9577 * Parse a continue statement.
9579 static statement_t *parse_continue(void)
9581 if (current_loop == NULL) {
9582 errorf(HERE, "continue statement not within loop");
9585 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9588 expect(';', end_error);
9595 * Parse a break statement.
9597 static statement_t *parse_break(void)
9599 if (current_switch == NULL && current_loop == NULL) {
9600 errorf(HERE, "break statement not within loop or switch");
9603 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9606 expect(';', end_error);
9613 * Parse a __leave statement.
9615 static statement_t *parse_leave_statement(void)
9617 if (current_try == NULL) {
9618 errorf(HERE, "__leave statement not within __try");
9621 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9624 expect(';', end_error);
9631 * Check if a given entity represents a local variable.
9633 static bool is_local_variable(const entity_t *entity)
9635 if (entity->kind != ENTITY_VARIABLE)
9638 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9639 case STORAGE_CLASS_AUTO:
9640 case STORAGE_CLASS_REGISTER: {
9641 const type_t *type = skip_typeref(entity->declaration.type);
9642 if (is_type_function(type)) {
9654 * Check if a given expression represents a local variable.
9656 static bool expression_is_local_variable(const expression_t *expression)
9658 if (expression->base.kind != EXPR_REFERENCE) {
9661 const entity_t *entity = expression->reference.entity;
9662 return is_local_variable(entity);
9666 * Check if a given expression represents a local variable and
9667 * return its declaration then, else return NULL.
9669 entity_t *expression_is_variable(const expression_t *expression)
9671 if (expression->base.kind != EXPR_REFERENCE) {
9674 entity_t *entity = expression->reference.entity;
9675 if (entity->kind != ENTITY_VARIABLE)
9682 * Parse a return statement.
9684 static statement_t *parse_return(void)
9686 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9689 expression_t *return_value = NULL;
9690 if (token.kind != ';') {
9691 return_value = parse_expression();
9692 mark_vars_read(return_value, NULL);
9695 const type_t *const func_type = skip_typeref(current_function->base.type);
9696 assert(is_type_function(func_type));
9697 type_t *const return_type = skip_typeref(func_type->function.return_type);
9699 source_position_t const *const pos = &statement->base.source_position;
9700 if (return_value != NULL) {
9701 type_t *return_value_type = skip_typeref(return_value->base.type);
9703 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9704 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9705 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9706 /* Only warn in C mode, because GCC does the same */
9707 if (c_mode & _CXX || strict_mode) {
9709 "'return' with a value, in function returning 'void'");
9711 warningf(WARN_OTHER, pos, "'return' with a value, in function returning 'void'");
9713 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9714 /* Only warn in C mode, because GCC does the same */
9717 "'return' with expression in function returning 'void'");
9719 warningf(WARN_OTHER, pos, "'return' with expression in function returning 'void'");
9723 assign_error_t error = semantic_assign(return_type, return_value);
9724 report_assign_error(error, return_type, return_value, "'return'",
9727 return_value = create_implicit_cast(return_value, return_type);
9728 /* check for returning address of a local var */
9729 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9730 const expression_t *expression = return_value->unary.value;
9731 if (expression_is_local_variable(expression)) {
9732 warningf(WARN_OTHER, pos, "function returns address of local variable");
9735 } else if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9736 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9737 if (c_mode & _CXX || strict_mode) {
9739 "'return' without value, in function returning non-void");
9741 warningf(WARN_OTHER, pos, "'return' without value, in function returning non-void");
9744 statement->returns.value = return_value;
9746 expect(';', end_error);
9753 * Parse a declaration statement.
9755 static statement_t *parse_declaration_statement(void)
9757 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9759 entity_t *before = current_scope->last_entity;
9761 parse_external_declaration();
9763 parse_declaration(record_entity, DECL_FLAGS_NONE);
9766 declaration_statement_t *const decl = &statement->declaration;
9767 entity_t *const begin =
9768 before != NULL ? before->base.next : current_scope->entities;
9769 decl->declarations_begin = begin;
9770 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
9776 * Parse an expression statement, ie. expr ';'.
9778 static statement_t *parse_expression_statement(void)
9780 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9782 expression_t *const expr = parse_expression();
9783 statement->expression.expression = expr;
9784 mark_vars_read(expr, ENT_ANY);
9786 expect(';', end_error);
9793 * Parse a microsoft __try { } __finally { } or
9794 * __try{ } __except() { }
9796 static statement_t *parse_ms_try_statment(void)
9798 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9801 PUSH_PARENT(statement);
9803 ms_try_statement_t *rem = current_try;
9804 current_try = &statement->ms_try;
9805 statement->ms_try.try_statement = parse_compound_statement(false);
9810 if (next_if(T___except)) {
9811 expect('(', end_error);
9812 add_anchor_token(')');
9813 expression_t *const expr = parse_expression();
9814 mark_vars_read(expr, NULL);
9815 type_t * type = skip_typeref(expr->base.type);
9816 if (is_type_integer(type)) {
9817 type = promote_integer(type);
9818 } else if (is_type_valid(type)) {
9819 errorf(&expr->base.source_position,
9820 "__expect expression is not an integer, but '%T'", type);
9821 type = type_error_type;
9823 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9824 rem_anchor_token(')');
9825 expect(')', end_error);
9826 statement->ms_try.final_statement = parse_compound_statement(false);
9827 } else if (next_if(T__finally)) {
9828 statement->ms_try.final_statement = parse_compound_statement(false);
9830 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9831 return create_invalid_statement();
9835 return create_invalid_statement();
9838 static statement_t *parse_empty_statement(void)
9840 warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9841 statement_t *const statement = create_empty_statement();
9846 static statement_t *parse_local_label_declaration(void)
9848 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9852 entity_t *begin = NULL;
9853 entity_t *end = NULL;
9854 entity_t **anchor = &begin;
9856 if (token.kind != T_IDENTIFIER) {
9857 parse_error_expected("while parsing local label declaration",
9858 T_IDENTIFIER, NULL);
9861 symbol_t *symbol = token.identifier.symbol;
9862 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9863 if (entity != NULL && entity->base.parent_scope == current_scope) {
9864 source_position_t const *const ppos = &entity->base.source_position;
9865 errorf(HERE, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9867 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
9868 entity->base.parent_scope = current_scope;
9869 entity->base.source_position = token.base.source_position;
9872 anchor = &entity->base.next;
9875 environment_push(entity);
9878 } while (next_if(','));
9879 expect(';', end_error);
9881 statement->declaration.declarations_begin = begin;
9882 statement->declaration.declarations_end = end;
9886 static void parse_namespace_definition(void)
9890 entity_t *entity = NULL;
9891 symbol_t *symbol = NULL;
9893 if (token.kind == T_IDENTIFIER) {
9894 symbol = token.identifier.symbol;
9897 entity = get_entity(symbol, NAMESPACE_NORMAL);
9899 && entity->kind != ENTITY_NAMESPACE
9900 && entity->base.parent_scope == current_scope) {
9901 if (is_entity_valid(entity)) {
9902 error_redefined_as_different_kind(&token.base.source_position,
9903 entity, ENTITY_NAMESPACE);
9909 if (entity == NULL) {
9910 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
9911 entity->base.source_position = token.base.source_position;
9912 entity->base.parent_scope = current_scope;
9915 if (token.kind == '=') {
9916 /* TODO: parse namespace alias */
9917 panic("namespace alias definition not supported yet");
9920 environment_push(entity);
9921 append_entity(current_scope, entity);
9923 PUSH_SCOPE(&entity->namespacee.members);
9925 entity_t *old_current_entity = current_entity;
9926 current_entity = entity;
9928 expect('{', end_error);
9930 expect('}', end_error);
9933 assert(current_entity == entity);
9934 current_entity = old_current_entity;
9939 * Parse a statement.
9940 * There's also parse_statement() which additionally checks for
9941 * "statement has no effect" warnings
9943 static statement_t *intern_parse_statement(void)
9945 statement_t *statement = NULL;
9947 /* declaration or statement */
9948 add_anchor_token(';');
9949 switch (token.kind) {
9950 case T_IDENTIFIER: {
9951 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9952 if (la1_type == ':') {
9953 statement = parse_label_statement();
9954 } else if (is_typedef_symbol(token.identifier.symbol)) {
9955 statement = parse_declaration_statement();
9957 /* it's an identifier, the grammar says this must be an
9958 * expression statement. However it is common that users mistype
9959 * declaration types, so we guess a bit here to improve robustness
9960 * for incorrect programs */
9964 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
9966 statement = parse_expression_statement();
9970 statement = parse_declaration_statement();
9978 case T___extension__: {
9979 /* This can be a prefix to a declaration or an expression statement.
9980 * We simply eat it now and parse the rest with tail recursion. */
9982 statement = intern_parse_statement();
9988 statement = parse_declaration_statement();
9992 statement = parse_local_label_declaration();
9995 case ';': statement = parse_empty_statement(); break;
9996 case '{': statement = parse_compound_statement(false); break;
9997 case T___leave: statement = parse_leave_statement(); break;
9998 case T___try: statement = parse_ms_try_statment(); break;
9999 case T_asm: statement = parse_asm_statement(); break;
10000 case T_break: statement = parse_break(); break;
10001 case T_case: statement = parse_case_statement(); break;
10002 case T_continue: statement = parse_continue(); break;
10003 case T_default: statement = parse_default_statement(); break;
10004 case T_do: statement = parse_do(); break;
10005 case T_for: statement = parse_for(); break;
10006 case T_goto: statement = parse_goto(); break;
10007 case T_if: statement = parse_if(); break;
10008 case T_return: statement = parse_return(); break;
10009 case T_switch: statement = parse_switch(); break;
10010 case T_while: statement = parse_while(); break;
10013 statement = parse_expression_statement();
10017 errorf(HERE, "unexpected token %K while parsing statement", &token);
10018 statement = create_invalid_statement();
10023 rem_anchor_token(';');
10025 assert(statement != NULL
10026 && statement->base.source_position.input_name != NULL);
10032 * parse a statement and emits "statement has no effect" warning if needed
10033 * (This is really a wrapper around intern_parse_statement with check for 1
10034 * single warning. It is needed, because for statement expressions we have
10035 * to avoid the warning on the last statement)
10037 static statement_t *parse_statement(void)
10039 statement_t *statement = intern_parse_statement();
10041 if (statement->kind == STATEMENT_EXPRESSION) {
10042 expression_t *expression = statement->expression.expression;
10043 if (!expression_has_effect(expression)) {
10044 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10052 * Parse a compound statement.
10054 static statement_t *parse_compound_statement(bool inside_expression_statement)
10056 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10058 PUSH_PARENT(statement);
10059 PUSH_SCOPE(&statement->compound.scope);
10062 add_anchor_token('}');
10063 /* tokens, which can start a statement */
10064 /* TODO MS, __builtin_FOO */
10065 add_anchor_token('!');
10066 add_anchor_token('&');
10067 add_anchor_token('(');
10068 add_anchor_token('*');
10069 add_anchor_token('+');
10070 add_anchor_token('-');
10071 add_anchor_token('{');
10072 add_anchor_token('~');
10073 add_anchor_token(T_CHARACTER_CONSTANT);
10074 add_anchor_token(T_COLONCOLON);
10075 add_anchor_token(T_FLOATINGPOINT);
10076 add_anchor_token(T_IDENTIFIER);
10077 add_anchor_token(T_INTEGER);
10078 add_anchor_token(T_MINUSMINUS);
10079 add_anchor_token(T_PLUSPLUS);
10080 add_anchor_token(T_STRING_LITERAL);
10081 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10082 add_anchor_token(T_WIDE_STRING_LITERAL);
10083 add_anchor_token(T__Bool);
10084 add_anchor_token(T__Complex);
10085 add_anchor_token(T__Imaginary);
10086 add_anchor_token(T___FUNCTION__);
10087 add_anchor_token(T___PRETTY_FUNCTION__);
10088 add_anchor_token(T___alignof__);
10089 add_anchor_token(T___attribute__);
10090 add_anchor_token(T___builtin_va_start);
10091 add_anchor_token(T___extension__);
10092 add_anchor_token(T___func__);
10093 add_anchor_token(T___imag__);
10094 add_anchor_token(T___label__);
10095 add_anchor_token(T___real__);
10096 add_anchor_token(T___thread);
10097 add_anchor_token(T_asm);
10098 add_anchor_token(T_auto);
10099 add_anchor_token(T_bool);
10100 add_anchor_token(T_break);
10101 add_anchor_token(T_case);
10102 add_anchor_token(T_char);
10103 add_anchor_token(T_class);
10104 add_anchor_token(T_const);
10105 add_anchor_token(T_const_cast);
10106 add_anchor_token(T_continue);
10107 add_anchor_token(T_default);
10108 add_anchor_token(T_delete);
10109 add_anchor_token(T_double);
10110 add_anchor_token(T_do);
10111 add_anchor_token(T_dynamic_cast);
10112 add_anchor_token(T_enum);
10113 add_anchor_token(T_extern);
10114 add_anchor_token(T_false);
10115 add_anchor_token(T_float);
10116 add_anchor_token(T_for);
10117 add_anchor_token(T_goto);
10118 add_anchor_token(T_if);
10119 add_anchor_token(T_inline);
10120 add_anchor_token(T_int);
10121 add_anchor_token(T_long);
10122 add_anchor_token(T_new);
10123 add_anchor_token(T_operator);
10124 add_anchor_token(T_register);
10125 add_anchor_token(T_reinterpret_cast);
10126 add_anchor_token(T_restrict);
10127 add_anchor_token(T_return);
10128 add_anchor_token(T_short);
10129 add_anchor_token(T_signed);
10130 add_anchor_token(T_sizeof);
10131 add_anchor_token(T_static);
10132 add_anchor_token(T_static_cast);
10133 add_anchor_token(T_struct);
10134 add_anchor_token(T_switch);
10135 add_anchor_token(T_template);
10136 add_anchor_token(T_this);
10137 add_anchor_token(T_throw);
10138 add_anchor_token(T_true);
10139 add_anchor_token(T_try);
10140 add_anchor_token(T_typedef);
10141 add_anchor_token(T_typeid);
10142 add_anchor_token(T_typename);
10143 add_anchor_token(T_typeof);
10144 add_anchor_token(T_union);
10145 add_anchor_token(T_unsigned);
10146 add_anchor_token(T_using);
10147 add_anchor_token(T_void);
10148 add_anchor_token(T_volatile);
10149 add_anchor_token(T_wchar_t);
10150 add_anchor_token(T_while);
10152 statement_t **anchor = &statement->compound.statements;
10153 bool only_decls_so_far = true;
10154 while (token.kind != '}') {
10155 if (token.kind == T_EOF) {
10156 errorf(&statement->base.source_position,
10157 "EOF while parsing compound statement");
10160 statement_t *sub_statement = intern_parse_statement();
10161 if (is_invalid_statement(sub_statement)) {
10162 /* an error occurred. if we are at an anchor, return */
10168 if (sub_statement->kind != STATEMENT_DECLARATION) {
10169 only_decls_so_far = false;
10170 } else if (!only_decls_so_far) {
10171 source_position_t const *const pos = &sub_statement->base.source_position;
10172 warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10175 *anchor = sub_statement;
10177 while (sub_statement->base.next != NULL)
10178 sub_statement = sub_statement->base.next;
10180 anchor = &sub_statement->base.next;
10184 /* look over all statements again to produce no effect warnings */
10185 if (is_warn_on(WARN_UNUSED_VALUE)) {
10186 statement_t *sub_statement = statement->compound.statements;
10187 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10188 if (sub_statement->kind != STATEMENT_EXPRESSION)
10190 /* don't emit a warning for the last expression in an expression
10191 * statement as it has always an effect */
10192 if (inside_expression_statement && sub_statement->base.next == NULL)
10195 expression_t *expression = sub_statement->expression.expression;
10196 if (!expression_has_effect(expression)) {
10197 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10203 rem_anchor_token(T_while);
10204 rem_anchor_token(T_wchar_t);
10205 rem_anchor_token(T_volatile);
10206 rem_anchor_token(T_void);
10207 rem_anchor_token(T_using);
10208 rem_anchor_token(T_unsigned);
10209 rem_anchor_token(T_union);
10210 rem_anchor_token(T_typeof);
10211 rem_anchor_token(T_typename);
10212 rem_anchor_token(T_typeid);
10213 rem_anchor_token(T_typedef);
10214 rem_anchor_token(T_try);
10215 rem_anchor_token(T_true);
10216 rem_anchor_token(T_throw);
10217 rem_anchor_token(T_this);
10218 rem_anchor_token(T_template);
10219 rem_anchor_token(T_switch);
10220 rem_anchor_token(T_struct);
10221 rem_anchor_token(T_static_cast);
10222 rem_anchor_token(T_static);
10223 rem_anchor_token(T_sizeof);
10224 rem_anchor_token(T_signed);
10225 rem_anchor_token(T_short);
10226 rem_anchor_token(T_return);
10227 rem_anchor_token(T_restrict);
10228 rem_anchor_token(T_reinterpret_cast);
10229 rem_anchor_token(T_register);
10230 rem_anchor_token(T_operator);
10231 rem_anchor_token(T_new);
10232 rem_anchor_token(T_long);
10233 rem_anchor_token(T_int);
10234 rem_anchor_token(T_inline);
10235 rem_anchor_token(T_if);
10236 rem_anchor_token(T_goto);
10237 rem_anchor_token(T_for);
10238 rem_anchor_token(T_float);
10239 rem_anchor_token(T_false);
10240 rem_anchor_token(T_extern);
10241 rem_anchor_token(T_enum);
10242 rem_anchor_token(T_dynamic_cast);
10243 rem_anchor_token(T_do);
10244 rem_anchor_token(T_double);
10245 rem_anchor_token(T_delete);
10246 rem_anchor_token(T_default);
10247 rem_anchor_token(T_continue);
10248 rem_anchor_token(T_const_cast);
10249 rem_anchor_token(T_const);
10250 rem_anchor_token(T_class);
10251 rem_anchor_token(T_char);
10252 rem_anchor_token(T_case);
10253 rem_anchor_token(T_break);
10254 rem_anchor_token(T_bool);
10255 rem_anchor_token(T_auto);
10256 rem_anchor_token(T_asm);
10257 rem_anchor_token(T___thread);
10258 rem_anchor_token(T___real__);
10259 rem_anchor_token(T___label__);
10260 rem_anchor_token(T___imag__);
10261 rem_anchor_token(T___func__);
10262 rem_anchor_token(T___extension__);
10263 rem_anchor_token(T___builtin_va_start);
10264 rem_anchor_token(T___attribute__);
10265 rem_anchor_token(T___alignof__);
10266 rem_anchor_token(T___PRETTY_FUNCTION__);
10267 rem_anchor_token(T___FUNCTION__);
10268 rem_anchor_token(T__Imaginary);
10269 rem_anchor_token(T__Complex);
10270 rem_anchor_token(T__Bool);
10271 rem_anchor_token(T_WIDE_STRING_LITERAL);
10272 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10273 rem_anchor_token(T_STRING_LITERAL);
10274 rem_anchor_token(T_PLUSPLUS);
10275 rem_anchor_token(T_MINUSMINUS);
10276 rem_anchor_token(T_INTEGER);
10277 rem_anchor_token(T_IDENTIFIER);
10278 rem_anchor_token(T_FLOATINGPOINT);
10279 rem_anchor_token(T_COLONCOLON);
10280 rem_anchor_token(T_CHARACTER_CONSTANT);
10281 rem_anchor_token('~');
10282 rem_anchor_token('{');
10283 rem_anchor_token('-');
10284 rem_anchor_token('+');
10285 rem_anchor_token('*');
10286 rem_anchor_token('(');
10287 rem_anchor_token('&');
10288 rem_anchor_token('!');
10289 rem_anchor_token('}');
10297 * Check for unused global static functions and variables
10299 static void check_unused_globals(void)
10301 if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10304 for (const entity_t *entity = file_scope->entities; entity != NULL;
10305 entity = entity->base.next) {
10306 if (!is_declaration(entity))
10309 const declaration_t *declaration = &entity->declaration;
10310 if (declaration->used ||
10311 declaration->modifiers & DM_UNUSED ||
10312 declaration->modifiers & DM_USED ||
10313 declaration->storage_class != STORAGE_CLASS_STATIC)
10318 if (entity->kind == ENTITY_FUNCTION) {
10319 /* inhibit warning for static inline functions */
10320 if (entity->function.is_inline)
10323 why = WARN_UNUSED_FUNCTION;
10324 s = entity->function.statement != NULL ? "defined" : "declared";
10326 why = WARN_UNUSED_VARIABLE;
10330 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10334 static void parse_global_asm(void)
10336 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10339 expect('(', end_error);
10341 statement->asms.asm_text = parse_string_literals();
10342 statement->base.next = unit->global_asm;
10343 unit->global_asm = statement;
10345 expect(')', end_error);
10346 expect(';', end_error);
10351 static void parse_linkage_specification(void)
10355 source_position_t const pos = *HERE;
10356 char const *const linkage = parse_string_literals().begin;
10358 linkage_kind_t old_linkage = current_linkage;
10359 linkage_kind_t new_linkage;
10360 if (strcmp(linkage, "C") == 0) {
10361 new_linkage = LINKAGE_C;
10362 } else if (strcmp(linkage, "C++") == 0) {
10363 new_linkage = LINKAGE_CXX;
10365 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10366 new_linkage = LINKAGE_INVALID;
10368 current_linkage = new_linkage;
10370 if (next_if('{')) {
10372 expect('}', end_error);
10378 assert(current_linkage == new_linkage);
10379 current_linkage = old_linkage;
10382 static void parse_external(void)
10384 switch (token.kind) {
10386 if (look_ahead(1)->kind == T_STRING_LITERAL) {
10387 parse_linkage_specification();
10389 DECLARATION_START_NO_EXTERN
10391 case T___extension__:
10392 /* tokens below are for implicit int */
10393 case '&': /* & x; -> int& x; (and error later, because C++ has no
10395 case '*': /* * x; -> int* x; */
10396 case '(': /* (x); -> int (x); */
10398 parse_external_declaration();
10404 parse_global_asm();
10408 parse_namespace_definition();
10412 if (!strict_mode) {
10413 warningf(WARN_OTHER, HERE, "stray ';' outside of function");
10420 errorf(HERE, "stray %K outside of function", &token);
10421 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10422 eat_until_matching_token(token.kind);
10428 static void parse_externals(void)
10430 add_anchor_token('}');
10431 add_anchor_token(T_EOF);
10434 /* make a copy of the anchor set, so we can check if it is restored after parsing */
10435 unsigned short token_anchor_copy[T_LAST_TOKEN];
10436 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10439 while (token.kind != T_EOF && token.kind != '}') {
10441 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10442 unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10444 /* the anchor set and its copy differs */
10445 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10448 if (in_gcc_extension) {
10449 /* an gcc extension scope was not closed */
10450 internal_errorf(HERE, "Leaked __extension__");
10457 rem_anchor_token(T_EOF);
10458 rem_anchor_token('}');
10462 * Parse a translation unit.
10464 static void parse_translation_unit(void)
10466 add_anchor_token(T_EOF);
10471 if (token.kind == T_EOF)
10474 errorf(HERE, "stray %K outside of function", &token);
10475 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10476 eat_until_matching_token(token.kind);
10481 void set_default_visibility(elf_visibility_tag_t visibility)
10483 default_visibility = visibility;
10489 * @return the translation unit or NULL if errors occurred.
10491 void start_parsing(void)
10493 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10494 label_stack = NEW_ARR_F(stack_entry_t, 0);
10495 diagnostic_count = 0;
10499 print_to_file(stderr);
10501 assert(unit == NULL);
10502 unit = allocate_ast_zero(sizeof(unit[0]));
10504 assert(file_scope == NULL);
10505 file_scope = &unit->scope;
10507 assert(current_scope == NULL);
10508 scope_push(&unit->scope);
10510 create_gnu_builtins();
10512 create_microsoft_intrinsics();
10515 translation_unit_t *finish_parsing(void)
10517 assert(current_scope == &unit->scope);
10520 assert(file_scope == &unit->scope);
10521 check_unused_globals();
10524 DEL_ARR_F(environment_stack);
10525 DEL_ARR_F(label_stack);
10527 translation_unit_t *result = unit;
10532 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10533 * are given length one. */
10534 static void complete_incomplete_arrays(void)
10536 size_t n = ARR_LEN(incomplete_arrays);
10537 for (size_t i = 0; i != n; ++i) {
10538 declaration_t *const decl = incomplete_arrays[i];
10539 type_t *const type = skip_typeref(decl->type);
10541 if (!is_type_incomplete(type))
10544 source_position_t const *const pos = &decl->base.source_position;
10545 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10547 type_t *const new_type = duplicate_type(type);
10548 new_type->array.size_constant = true;
10549 new_type->array.has_implicit_size = true;
10550 new_type->array.size = 1;
10552 type_t *const result = identify_new_type(new_type);
10554 decl->type = result;
10558 void prepare_main_collect2(entity_t *entity)
10560 // create call to __main
10561 symbol_t *symbol = symbol_table_insert("__main");
10562 entity_t *subsubmain_ent
10563 = create_implicit_function(symbol, &builtin_source_position);
10565 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10566 type_t *ftype = subsubmain_ent->declaration.type;
10567 ref->base.source_position = builtin_source_position;
10568 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10569 ref->reference.entity = subsubmain_ent;
10571 expression_t *call = allocate_expression_zero(EXPR_CALL);
10572 call->base.source_position = builtin_source_position;
10573 call->base.type = type_void;
10574 call->call.function = ref;
10576 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10577 expr_statement->base.source_position = builtin_source_position;
10578 expr_statement->expression.expression = call;
10580 statement_t *statement = entity->function.statement;
10581 assert(statement->kind == STATEMENT_COMPOUND);
10582 compound_statement_t *compounds = &statement->compound;
10584 expr_statement->base.next = compounds->statements;
10585 compounds->statements = expr_statement;
10590 lookahead_bufpos = 0;
10591 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10594 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10595 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10596 parse_translation_unit();
10597 complete_incomplete_arrays();
10598 DEL_ARR_F(incomplete_arrays);
10599 incomplete_arrays = NULL;
10603 * Initialize the parser.
10605 void init_parser(void)
10607 sym_anonymous = symbol_table_insert("<anonymous>");
10609 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10611 init_expression_parsers();
10612 obstack_init(&temp_obst);
10616 * Terminate the parser.
10618 void exit_parser(void)
10620 obstack_free(&temp_obst, NULL);