2 * This file is part of cparser.
3 * Copyright (C) 2007-2008 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 "lang_features.h"
38 #include "walk_statements.h"
40 #include "adt/bitfiddle.h"
41 #include "adt/error.h"
42 #include "adt/array.h"
44 //#define PRINT_TOKENS
45 #define MAX_LOOKAHEAD 1
50 entity_namespace_t namespc;
53 typedef struct argument_list_t argument_list_t;
54 struct argument_list_t {
56 argument_list_t *next;
59 typedef struct gnu_attribute_t gnu_attribute_t;
60 struct gnu_attribute_t {
61 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
62 gnu_attribute_t *next;
63 bool invalid; /**< Set if this attribute had argument errors, */
64 bool has_arguments; /**< True, if this attribute has arguments. */
69 long argument; /**< Single argument. */
70 argument_list_t *arguments; /**< List of argument expressions. */
74 typedef struct declaration_specifiers_t declaration_specifiers_t;
75 struct declaration_specifiers_t {
76 source_position_t source_position;
77 storage_class_t storage_class;
78 unsigned char alignment; /**< Alignment, 0 if not set. */
80 bool thread_local : 1; /**< GCC __thread */
82 decl_modifiers_t modifiers; /**< declaration modifiers */
83 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
84 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
85 symbol_t *get_property_sym; /**< the name of the get property if set. */
86 symbol_t *put_property_sym; /**< the name of the put property if set. */
91 * An environment for parsing initializers (and compound literals).
93 typedef struct parse_initializer_env_t {
94 type_t *type; /**< the type of the initializer. In case of an
95 array type with unspecified size this gets
96 adjusted to the actual size. */
97 entity_t *entity; /**< the variable that is initialized if any */
98 bool must_be_constant;
99 } parse_initializer_env_t;
101 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
103 /** The current token. */
104 static token_t token;
105 /** The lookahead ring-buffer. */
106 static token_t lookahead_buffer[MAX_LOOKAHEAD];
107 /** Position of the next token in the lookahead buffer. */
108 static size_t lookahead_bufpos;
109 static stack_entry_t *environment_stack = NULL;
110 static stack_entry_t *label_stack = NULL;
111 static scope_t *file_scope = NULL;
112 static scope_t *current_scope = NULL;
113 /** Point to the current function declaration if inside a function. */
114 static function_t *current_function = NULL;
115 static entity_t *current_init_decl = NULL;
116 static switch_statement_t *current_switch = NULL;
117 static statement_t *current_loop = NULL;
118 static statement_t *current_parent = NULL;
119 static ms_try_statement_t *current_try = NULL;
120 static linkage_kind_t current_linkage = LINKAGE_INVALID;
121 static goto_statement_t *goto_first = NULL;
122 static goto_statement_t **goto_anchor = NULL;
123 static label_statement_t *label_first = NULL;
124 static label_statement_t **label_anchor = NULL;
125 /** current translation unit. */
126 static translation_unit_t *unit = NULL;
127 /** true if we are in a type property context (evaluation only for type. */
128 static bool in_type_prop = false;
129 /** true in we are in a __extension__ context. */
130 static bool in_gcc_extension = false;
131 static struct obstack temp_obst;
132 static entity_t *anonymous_entity;
133 static declaration_t **incomplete_arrays;
136 #define PUSH_PARENT(stmt) \
137 statement_t *const prev_parent = current_parent; \
138 ((void)(current_parent = (stmt)))
139 #define POP_PARENT ((void)(current_parent = prev_parent))
141 /** special symbol used for anonymous entities. */
142 static const symbol_t *sym_anonymous = NULL;
144 /* symbols for Microsoft extended-decl-modifier */
145 static const symbol_t *sym_align = NULL;
146 static const symbol_t *sym_allocate = NULL;
147 static const symbol_t *sym_dllimport = NULL;
148 static const symbol_t *sym_dllexport = NULL;
149 static const symbol_t *sym_naked = NULL;
150 static const symbol_t *sym_noinline = NULL;
151 static const symbol_t *sym_returns_twice = NULL;
152 static const symbol_t *sym_noreturn = NULL;
153 static const symbol_t *sym_nothrow = NULL;
154 static const symbol_t *sym_novtable = NULL;
155 static const symbol_t *sym_property = NULL;
156 static const symbol_t *sym_get = NULL;
157 static const symbol_t *sym_put = NULL;
158 static const symbol_t *sym_selectany = NULL;
159 static const symbol_t *sym_thread = NULL;
160 static const symbol_t *sym_uuid = NULL;
161 static const symbol_t *sym_deprecated = NULL;
162 static const symbol_t *sym_restrict = NULL;
163 static const symbol_t *sym_noalias = NULL;
165 /** The token anchor set */
166 static unsigned char token_anchor_set[T_LAST_TOKEN];
168 /** The current source position. */
169 #define HERE (&token.source_position)
171 /** true if we are in GCC mode. */
172 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
174 static type_t *type_valist;
176 static statement_t *parse_compound_statement(bool inside_expression_statement);
177 static statement_t *parse_statement(void);
179 static expression_t *parse_sub_expression(precedence_t);
180 static expression_t *parse_expression(void);
181 static type_t *parse_typename(void);
182 static void parse_externals(void);
183 static void parse_external(void);
185 static void parse_compound_type_entries(compound_t *compound_declaration);
187 typedef enum declarator_flags_t {
189 DECL_MAY_BE_ABSTRACT = 1U << 0,
190 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
191 DECL_IS_PARAMETER = 1U << 2
192 } declarator_flags_t;
194 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
195 declarator_flags_t flags);
197 static entity_t *record_entity(entity_t *entity, bool is_definition);
199 static void semantic_comparison(binary_expression_t *expression);
201 static void create_gnu_builtins(void);
202 static void create_microsoft_intrinsics(void);
204 #define STORAGE_CLASSES \
205 STORAGE_CLASSES_NO_EXTERN \
208 #define STORAGE_CLASSES_NO_EXTERN \
215 #define TYPE_QUALIFIERS \
220 case T__forceinline: \
221 case T___attribute__:
223 #define COMPLEX_SPECIFIERS \
225 #define IMAGINARY_SPECIFIERS \
228 #define TYPE_SPECIFIERS \
230 case T___builtin_va_list: \
250 #define DECLARATION_START \
255 #define DECLARATION_START_NO_EXTERN \
256 STORAGE_CLASSES_NO_EXTERN \
260 #define TYPENAME_START \
264 #define EXPRESSION_START \
273 case T_CHARACTER_CONSTANT: \
274 case T_FLOATINGPOINT: \
278 case T_STRING_LITERAL: \
279 case T_WIDE_CHARACTER_CONSTANT: \
280 case T_WIDE_STRING_LITERAL: \
281 case T___FUNCDNAME__: \
282 case T___FUNCSIG__: \
283 case T___FUNCTION__: \
284 case T___PRETTY_FUNCTION__: \
285 case T___alignof__: \
286 case T___builtin_classify_type: \
287 case T___builtin_constant_p: \
288 case T___builtin_isgreater: \
289 case T___builtin_isgreaterequal: \
290 case T___builtin_isless: \
291 case T___builtin_islessequal: \
292 case T___builtin_islessgreater: \
293 case T___builtin_isunordered: \
294 case T___builtin_offsetof: \
295 case T___builtin_va_arg: \
296 case T___builtin_va_start: \
307 * Allocate an AST node with given size and
308 * initialize all fields with zero.
310 static void *allocate_ast_zero(size_t size)
312 void *res = allocate_ast(size);
313 memset(res, 0, size);
318 * Returns the size of an entity node.
320 * @param kind the entity kind
322 static size_t get_entity_struct_size(entity_kind_t kind)
324 static const size_t sizes[] = {
325 [ENTITY_VARIABLE] = sizeof(variable_t),
326 [ENTITY_PARAMETER] = sizeof(parameter_t),
327 [ENTITY_COMPOUND_MEMBER] = sizeof(compound_member_t),
328 [ENTITY_FUNCTION] = sizeof(function_t),
329 [ENTITY_TYPEDEF] = sizeof(typedef_t),
330 [ENTITY_STRUCT] = sizeof(compound_t),
331 [ENTITY_UNION] = sizeof(compound_t),
332 [ENTITY_ENUM] = sizeof(enum_t),
333 [ENTITY_ENUM_VALUE] = sizeof(enum_value_t),
334 [ENTITY_LABEL] = sizeof(label_t),
335 [ENTITY_LOCAL_LABEL] = sizeof(label_t),
336 [ENTITY_NAMESPACE] = sizeof(namespace_t)
338 assert(kind < lengthof(sizes));
339 assert(sizes[kind] != 0);
344 * Allocate an entity of given kind and initialize all
347 static entity_t *allocate_entity_zero(entity_kind_t kind)
349 size_t size = get_entity_struct_size(kind);
350 entity_t *entity = allocate_ast_zero(size);
356 * Returns the size of a statement node.
358 * @param kind the statement kind
360 static size_t get_statement_struct_size(statement_kind_t kind)
362 static const size_t sizes[] = {
363 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
364 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
365 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
366 [STATEMENT_RETURN] = sizeof(return_statement_t),
367 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
368 [STATEMENT_IF] = sizeof(if_statement_t),
369 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
370 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
371 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
372 [STATEMENT_BREAK] = sizeof(statement_base_t),
373 [STATEMENT_GOTO] = sizeof(goto_statement_t),
374 [STATEMENT_LABEL] = sizeof(label_statement_t),
375 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
376 [STATEMENT_WHILE] = sizeof(while_statement_t),
377 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
378 [STATEMENT_FOR] = sizeof(for_statement_t),
379 [STATEMENT_ASM] = sizeof(asm_statement_t),
380 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
381 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
383 assert(kind < lengthof(sizes));
384 assert(sizes[kind] != 0);
389 * Returns the size of an expression node.
391 * @param kind the expression kind
393 static size_t get_expression_struct_size(expression_kind_t kind)
395 static const size_t sizes[] = {
396 [EXPR_INVALID] = sizeof(expression_base_t),
397 [EXPR_REFERENCE] = sizeof(reference_expression_t),
398 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
399 [EXPR_CONST] = sizeof(const_expression_t),
400 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
401 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
402 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
403 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
404 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
405 [EXPR_CALL] = sizeof(call_expression_t),
406 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
407 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
408 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
409 [EXPR_SELECT] = sizeof(select_expression_t),
410 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
411 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
412 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
413 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
414 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
415 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
416 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
417 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
418 [EXPR_VA_START] = sizeof(va_start_expression_t),
419 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
420 [EXPR_STATEMENT] = sizeof(statement_expression_t),
421 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
423 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
424 return sizes[EXPR_UNARY_FIRST];
426 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
427 return sizes[EXPR_BINARY_FIRST];
429 assert(kind < lengthof(sizes));
430 assert(sizes[kind] != 0);
435 * Allocate a statement node of given kind and initialize all
436 * fields with zero. Sets its source position to the position
437 * of the current token.
439 static statement_t *allocate_statement_zero(statement_kind_t kind)
441 size_t size = get_statement_struct_size(kind);
442 statement_t *res = allocate_ast_zero(size);
444 res->base.kind = kind;
445 res->base.parent = current_parent;
446 res->base.source_position = token.source_position;
451 * Allocate an expression node of given kind and initialize all
454 static expression_t *allocate_expression_zero(expression_kind_t kind)
456 size_t size = get_expression_struct_size(kind);
457 expression_t *res = allocate_ast_zero(size);
459 res->base.kind = kind;
460 res->base.type = type_error_type;
461 res->base.source_position = token.source_position;
466 * Creates a new invalid expression at the source position
467 * of the current token.
469 static expression_t *create_invalid_expression(void)
471 return allocate_expression_zero(EXPR_INVALID);
475 * Creates a new invalid statement.
477 static statement_t *create_invalid_statement(void)
479 return allocate_statement_zero(STATEMENT_INVALID);
483 * Allocate a new empty statement.
485 static statement_t *create_empty_statement(void)
487 return allocate_statement_zero(STATEMENT_EMPTY);
491 * Returns the size of a type node.
493 * @param kind the type kind
495 static size_t get_type_struct_size(type_kind_t kind)
497 static const size_t sizes[] = {
498 [TYPE_ATOMIC] = sizeof(atomic_type_t),
499 [TYPE_COMPLEX] = sizeof(complex_type_t),
500 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
501 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
502 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
503 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
504 [TYPE_ENUM] = sizeof(enum_type_t),
505 [TYPE_FUNCTION] = sizeof(function_type_t),
506 [TYPE_POINTER] = sizeof(pointer_type_t),
507 [TYPE_ARRAY] = sizeof(array_type_t),
508 [TYPE_BUILTIN] = sizeof(builtin_type_t),
509 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
510 [TYPE_TYPEOF] = sizeof(typeof_type_t),
512 assert(lengthof(sizes) == (int)TYPE_TYPEOF + 1);
513 assert(kind <= TYPE_TYPEOF);
514 assert(sizes[kind] != 0);
519 * Allocate a type node of given kind and initialize all
522 * @param kind type kind to allocate
524 static type_t *allocate_type_zero(type_kind_t kind)
526 size_t size = get_type_struct_size(kind);
527 type_t *res = obstack_alloc(type_obst, size);
528 memset(res, 0, size);
529 res->base.kind = kind;
534 static function_parameter_t *allocate_parameter(type_t *const type)
536 function_parameter_t *const param = obstack_alloc(type_obst, sizeof(*param));
537 memset(param, 0, sizeof(*param));
543 * Returns the size of an initializer node.
545 * @param kind the initializer kind
547 static size_t get_initializer_size(initializer_kind_t kind)
549 static const size_t sizes[] = {
550 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
551 [INITIALIZER_STRING] = sizeof(initializer_string_t),
552 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
553 [INITIALIZER_LIST] = sizeof(initializer_list_t),
554 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
556 assert(kind < lengthof(sizes));
557 assert(sizes[kind] != 0);
562 * Allocate an initializer node of given kind and initialize all
565 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
567 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
574 * Returns the index of the top element of the environment stack.
576 static size_t environment_top(void)
578 return ARR_LEN(environment_stack);
582 * Returns the index of the top element of the global label stack.
584 static size_t label_top(void)
586 return ARR_LEN(label_stack);
590 * Return the next token.
592 static inline void next_token(void)
594 token = lookahead_buffer[lookahead_bufpos];
595 lookahead_buffer[lookahead_bufpos] = lexer_token;
598 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
601 print_token(stderr, &token);
602 fprintf(stderr, "\n");
607 * Return the next token with a given lookahead.
609 static inline const token_t *look_ahead(size_t num)
611 assert(0 < num && num <= MAX_LOOKAHEAD);
612 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
613 return &lookahead_buffer[pos];
617 * Adds a token type to the token type anchor set (a multi-set).
619 static void add_anchor_token(int token_type)
621 assert(0 <= token_type && token_type < T_LAST_TOKEN);
622 ++token_anchor_set[token_type];
626 * Set the number of tokens types of the given type
627 * to zero and return the old count.
629 static int save_and_reset_anchor_state(int token_type)
631 assert(0 <= token_type && token_type < T_LAST_TOKEN);
632 int count = token_anchor_set[token_type];
633 token_anchor_set[token_type] = 0;
638 * Restore the number of token types to the given count.
640 static void restore_anchor_state(int token_type, int count)
642 assert(0 <= token_type && token_type < T_LAST_TOKEN);
643 token_anchor_set[token_type] = count;
647 * Remove a token type from the token type anchor set (a multi-set).
649 static void rem_anchor_token(int token_type)
651 assert(0 <= token_type && token_type < T_LAST_TOKEN);
652 assert(token_anchor_set[token_type] != 0);
653 --token_anchor_set[token_type];
657 * Return true if the token type of the current token is
660 static bool at_anchor(void)
664 return token_anchor_set[token.type];
668 * Eat tokens until a matching token type is found.
670 static void eat_until_matching_token(int type)
674 case '(': end_token = ')'; break;
675 case '{': end_token = '}'; break;
676 case '[': end_token = ']'; break;
677 default: end_token = type; break;
680 unsigned parenthesis_count = 0;
681 unsigned brace_count = 0;
682 unsigned bracket_count = 0;
683 while (token.type != end_token ||
684 parenthesis_count != 0 ||
686 bracket_count != 0) {
687 switch (token.type) {
689 case '(': ++parenthesis_count; break;
690 case '{': ++brace_count; break;
691 case '[': ++bracket_count; break;
694 if (parenthesis_count > 0)
704 if (bracket_count > 0)
707 if (token.type == end_token &&
708 parenthesis_count == 0 &&
722 * Eat input tokens until an anchor is found.
724 static void eat_until_anchor(void)
726 while (token_anchor_set[token.type] == 0) {
727 if (token.type == '(' || token.type == '{' || token.type == '[')
728 eat_until_matching_token(token.type);
734 * Eat a whole block from input tokens.
736 static void eat_block(void)
738 eat_until_matching_token('{');
739 if (token.type == '}')
743 #define eat(token_type) (assert(token.type == (token_type)), next_token())
746 * Report a parse error because an expected token was not found.
749 #if defined __GNUC__ && __GNUC__ >= 4
750 __attribute__((sentinel))
752 void parse_error_expected(const char *message, ...)
754 if (message != NULL) {
755 errorf(HERE, "%s", message);
758 va_start(ap, message);
759 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
764 * Report an incompatible type.
766 static void type_error_incompatible(const char *msg,
767 const source_position_t *source_position, type_t *type1, type_t *type2)
769 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
774 * Expect the current token is the expected token.
775 * If not, generate an error, eat the current statement,
776 * and goto the end_error label.
778 #define expect(expected, error_label) \
780 if (UNLIKELY(token.type != (expected))) { \
781 parse_error_expected(NULL, (expected), NULL); \
782 add_anchor_token(expected); \
783 eat_until_anchor(); \
784 if (token.type == expected) \
786 rem_anchor_token(expected); \
793 * Push a given scope on the scope stack and make it the
796 static scope_t *scope_push(scope_t *new_scope)
798 if (current_scope != NULL) {
799 new_scope->depth = current_scope->depth + 1;
802 scope_t *old_scope = current_scope;
803 current_scope = new_scope;
808 * Pop the current scope from the scope stack.
810 static void scope_pop(scope_t *old_scope)
812 current_scope = old_scope;
816 * Search an entity by its symbol in a given namespace.
818 static entity_t *get_entity(const symbol_t *const symbol,
819 namespace_tag_t namespc)
821 entity_t *entity = symbol->entity;
822 for (; entity != NULL; entity = entity->base.symbol_next) {
823 if (entity->base.namespc == namespc)
831 * pushs an entity on the environment stack and links the corresponding symbol
834 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
836 symbol_t *symbol = entity->base.symbol;
837 entity_namespace_t namespc = entity->base.namespc;
838 assert(namespc != NAMESPACE_INVALID);
840 /* replace/add entity into entity list of the symbol */
843 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
848 /* replace an entry? */
849 if (iter->base.namespc == namespc) {
850 entity->base.symbol_next = iter->base.symbol_next;
856 /* remember old declaration */
858 entry.symbol = symbol;
859 entry.old_entity = iter;
860 entry.namespc = namespc;
861 ARR_APP1(stack_entry_t, *stack_ptr, entry);
865 * Push an entity on the environment stack.
867 static void environment_push(entity_t *entity)
869 assert(entity->base.source_position.input_name != NULL);
870 assert(entity->base.parent_scope != NULL);
871 stack_push(&environment_stack, entity);
875 * Push a declaration on the global label stack.
877 * @param declaration the declaration
879 static void label_push(entity_t *label)
881 /* we abuse the parameters scope as parent for the labels */
882 label->base.parent_scope = ¤t_function->parameters;
883 stack_push(&label_stack, label);
887 * pops symbols from the environment stack until @p new_top is the top element
889 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
891 stack_entry_t *stack = *stack_ptr;
892 size_t top = ARR_LEN(stack);
895 assert(new_top <= top);
899 for (i = top; i > new_top; --i) {
900 stack_entry_t *entry = &stack[i - 1];
902 entity_t *old_entity = entry->old_entity;
903 symbol_t *symbol = entry->symbol;
904 entity_namespace_t namespc = entry->namespc;
906 /* replace with old_entity/remove */
909 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
911 assert(iter != NULL);
912 /* replace an entry? */
913 if (iter->base.namespc == namespc)
917 /* restore definition from outer scopes (if there was one) */
918 if (old_entity != NULL) {
919 old_entity->base.symbol_next = iter->base.symbol_next;
920 *anchor = old_entity;
922 /* remove entry from list */
923 *anchor = iter->base.symbol_next;
927 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
931 * Pop all entries from the environment stack until the new_top
934 * @param new_top the new stack top
936 static void environment_pop_to(size_t new_top)
938 stack_pop_to(&environment_stack, new_top);
942 * Pop all entries from the global label stack until the new_top
945 * @param new_top the new stack top
947 static void label_pop_to(size_t new_top)
949 stack_pop_to(&label_stack, new_top);
952 static int get_akind_rank(atomic_type_kind_t akind)
958 * Return the type rank for an atomic type.
960 static int get_rank(const type_t *type)
962 assert(!is_typeref(type));
963 if (type->kind == TYPE_ENUM)
964 return get_akind_rank(type->enumt.akind);
966 assert(type->kind == TYPE_ATOMIC);
967 return get_akind_rank(type->atomic.akind);
971 * Do integer promotion for a given type.
973 * @param type the type to promote
974 * @return the promoted type
976 static type_t *promote_integer(type_t *type)
978 if (type->kind == TYPE_BITFIELD)
979 type = type->bitfield.base_type;
981 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
988 * Create a cast expression.
990 * @param expression the expression to cast
991 * @param dest_type the destination type
993 static expression_t *create_cast_expression(expression_t *expression,
996 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
998 cast->unary.value = expression;
999 cast->base.type = dest_type;
1005 * Check if a given expression represents a null pointer constant.
1007 * @param expression the expression to check
1009 static bool is_null_pointer_constant(const expression_t *expression)
1011 /* skip void* cast */
1012 if (expression->kind == EXPR_UNARY_CAST ||
1013 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
1014 type_t *const type = skip_typeref(expression->base.type);
1015 if (types_compatible(type, type_void_ptr))
1016 expression = expression->unary.value;
1019 type_t *const type = skip_typeref(expression->base.type);
1021 is_type_integer(type) &&
1022 is_constant_expression(expression) &&
1023 fold_constant(expression) == 0;
1027 * Create an implicit cast expression.
1029 * @param expression the expression to cast
1030 * @param dest_type the destination type
1032 static expression_t *create_implicit_cast(expression_t *expression,
1035 type_t *const source_type = expression->base.type;
1037 if (source_type == dest_type)
1040 return create_cast_expression(expression, dest_type);
1043 typedef enum assign_error_t {
1045 ASSIGN_ERROR_INCOMPATIBLE,
1046 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
1047 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
1048 ASSIGN_WARNING_POINTER_FROM_INT,
1049 ASSIGN_WARNING_INT_FROM_POINTER
1052 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
1053 const expression_t *const right,
1054 const char *context,
1055 const source_position_t *source_position)
1057 type_t *const orig_type_right = right->base.type;
1058 type_t *const type_left = skip_typeref(orig_type_left);
1059 type_t *const type_right = skip_typeref(orig_type_right);
1062 case ASSIGN_SUCCESS:
1064 case ASSIGN_ERROR_INCOMPATIBLE:
1065 errorf(source_position,
1066 "destination type '%T' in %s is incompatible with type '%T'",
1067 orig_type_left, context, orig_type_right);
1070 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1071 if (warning.other) {
1072 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
1073 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
1075 /* the left type has all qualifiers from the right type */
1076 unsigned missing_qualifiers
1077 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1078 warningf(source_position,
1079 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1080 orig_type_left, context, orig_type_right, missing_qualifiers);
1085 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1086 if (warning.other) {
1087 warningf(source_position,
1088 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1089 orig_type_left, context, right, orig_type_right);
1093 case ASSIGN_WARNING_POINTER_FROM_INT:
1094 if (warning.other) {
1095 warningf(source_position,
1096 "%s makes pointer '%T' from integer '%T' without a cast",
1097 context, orig_type_left, orig_type_right);
1101 case ASSIGN_WARNING_INT_FROM_POINTER:
1102 if (warning.other) {
1103 warningf(source_position,
1104 "%s makes integer '%T' from pointer '%T' without a cast",
1105 context, orig_type_left, orig_type_right);
1110 panic("invalid error value");
1114 /** Implements the rules from §6.5.16.1 */
1115 static assign_error_t semantic_assign(type_t *orig_type_left,
1116 const expression_t *const right)
1118 type_t *const orig_type_right = right->base.type;
1119 type_t *const type_left = skip_typeref(orig_type_left);
1120 type_t *const type_right = skip_typeref(orig_type_right);
1122 if (is_type_pointer(type_left)) {
1123 if (is_null_pointer_constant(right)) {
1124 return ASSIGN_SUCCESS;
1125 } else if (is_type_pointer(type_right)) {
1126 type_t *points_to_left
1127 = skip_typeref(type_left->pointer.points_to);
1128 type_t *points_to_right
1129 = skip_typeref(type_right->pointer.points_to);
1130 assign_error_t res = ASSIGN_SUCCESS;
1132 /* the left type has all qualifiers from the right type */
1133 unsigned missing_qualifiers
1134 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1135 if (missing_qualifiers != 0) {
1136 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1139 points_to_left = get_unqualified_type(points_to_left);
1140 points_to_right = get_unqualified_type(points_to_right);
1142 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1145 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1146 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1147 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1150 if (!types_compatible(points_to_left, points_to_right)) {
1151 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1155 } else if (is_type_integer(type_right)) {
1156 return ASSIGN_WARNING_POINTER_FROM_INT;
1158 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1159 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1160 && is_type_pointer(type_right))) {
1161 return ASSIGN_SUCCESS;
1162 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1163 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1164 type_t *const unqual_type_left = get_unqualified_type(type_left);
1165 type_t *const unqual_type_right = get_unqualified_type(type_right);
1166 if (types_compatible(unqual_type_left, unqual_type_right)) {
1167 return ASSIGN_SUCCESS;
1169 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1170 return ASSIGN_WARNING_INT_FROM_POINTER;
1173 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1174 return ASSIGN_SUCCESS;
1176 return ASSIGN_ERROR_INCOMPATIBLE;
1179 static expression_t *parse_constant_expression(void)
1181 expression_t *result = parse_sub_expression(PREC_CONDITIONAL);
1183 if (!is_constant_expression(result)) {
1184 errorf(&result->base.source_position,
1185 "expression '%E' is not constant", result);
1191 static expression_t *parse_assignment_expression(void)
1193 return parse_sub_expression(PREC_ASSIGNMENT);
1196 static string_t parse_string_literals(void)
1198 assert(token.type == T_STRING_LITERAL);
1199 string_t result = token.v.string;
1203 while (token.type == T_STRING_LITERAL) {
1204 result = concat_strings(&result, &token.v.string);
1211 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1212 [GNU_AK_CONST] = "const",
1213 [GNU_AK_VOLATILE] = "volatile",
1214 [GNU_AK_CDECL] = "cdecl",
1215 [GNU_AK_STDCALL] = "stdcall",
1216 [GNU_AK_FASTCALL] = "fastcall",
1217 [GNU_AK_DEPRECATED] = "deprecated",
1218 [GNU_AK_NOINLINE] = "noinline",
1219 [GNU_AK_RETURNS_TWICE] = "returns_twice",
1220 [GNU_AK_NORETURN] = "noreturn",
1221 [GNU_AK_NAKED] = "naked",
1222 [GNU_AK_PURE] = "pure",
1223 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1224 [GNU_AK_MALLOC] = "malloc",
1225 [GNU_AK_WEAK] = "weak",
1226 [GNU_AK_CONSTRUCTOR] = "constructor",
1227 [GNU_AK_DESTRUCTOR] = "destructor",
1228 [GNU_AK_NOTHROW] = "nothrow",
1229 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1230 [GNU_AK_COMMON] = "common",
1231 [GNU_AK_NOCOMMON] = "nocommon",
1232 [GNU_AK_PACKED] = "packed",
1233 [GNU_AK_SHARED] = "shared",
1234 [GNU_AK_NOTSHARED] = "notshared",
1235 [GNU_AK_USED] = "used",
1236 [GNU_AK_UNUSED] = "unused",
1237 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1238 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1239 [GNU_AK_LONGCALL] = "longcall",
1240 [GNU_AK_SHORTCALL] = "shortcall",
1241 [GNU_AK_LONG_CALL] = "long_call",
1242 [GNU_AK_SHORT_CALL] = "short_call",
1243 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1244 [GNU_AK_INTERRUPT] = "interrupt",
1245 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1246 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1247 [GNU_AK_NESTING] = "nesting",
1248 [GNU_AK_NEAR] = "near",
1249 [GNU_AK_FAR] = "far",
1250 [GNU_AK_SIGNAL] = "signal",
1251 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1252 [GNU_AK_TINY_DATA] = "tiny_data",
1253 [GNU_AK_SAVEALL] = "saveall",
1254 [GNU_AK_FLATTEN] = "flatten",
1255 [GNU_AK_SSEREGPARM] = "sseregparm",
1256 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1257 [GNU_AK_RETURN_TWICE] = "return_twice",
1258 [GNU_AK_MAY_ALIAS] = "may_alias",
1259 [GNU_AK_MS_STRUCT] = "ms_struct",
1260 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1261 [GNU_AK_DLLIMPORT] = "dllimport",
1262 [GNU_AK_DLLEXPORT] = "dllexport",
1263 [GNU_AK_ALIGNED] = "aligned",
1264 [GNU_AK_ALIAS] = "alias",
1265 [GNU_AK_SECTION] = "section",
1266 [GNU_AK_FORMAT] = "format",
1267 [GNU_AK_FORMAT_ARG] = "format_arg",
1268 [GNU_AK_WEAKREF] = "weakref",
1269 [GNU_AK_NONNULL] = "nonnull",
1270 [GNU_AK_TLS_MODEL] = "tls_model",
1271 [GNU_AK_VISIBILITY] = "visibility",
1272 [GNU_AK_REGPARM] = "regparm",
1273 [GNU_AK_MODE] = "mode",
1274 [GNU_AK_MODEL] = "model",
1275 [GNU_AK_TRAP_EXIT] = "trap_exit",
1276 [GNU_AK_SP_SWITCH] = "sp_switch",
1277 [GNU_AK_SENTINEL] = "sentinel"
1281 * compare two string, ignoring double underscores on the second.
1283 static int strcmp_underscore(const char *s1, const char *s2)
1285 if (s2[0] == '_' && s2[1] == '_') {
1286 size_t len2 = strlen(s2);
1287 size_t len1 = strlen(s1);
1288 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1289 return strncmp(s1, s2+2, len2-4);
1293 return strcmp(s1, s2);
1297 * Allocate a new gnu temporal attribute of given kind.
1299 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1301 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1302 attribute->kind = kind;
1303 attribute->next = NULL;
1304 attribute->invalid = false;
1305 attribute->has_arguments = false;
1311 * Parse one constant expression argument of the given attribute.
1313 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1315 expression_t *expression;
1316 add_anchor_token(')');
1317 expression = parse_constant_expression();
1318 rem_anchor_token(')');
1319 expect(')', end_error);
1320 attribute->u.argument = fold_constant(expression);
1323 attribute->invalid = true;
1327 * Parse a list of constant expressions arguments of the given attribute.
1329 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1331 argument_list_t **list = &attribute->u.arguments;
1332 argument_list_t *entry;
1333 expression_t *expression;
1334 add_anchor_token(')');
1335 add_anchor_token(',');
1337 expression = parse_constant_expression();
1338 entry = obstack_alloc(&temp_obst, sizeof(entry));
1339 entry->argument = fold_constant(expression);
1342 list = &entry->next;
1343 if (token.type != ',')
1347 rem_anchor_token(',');
1348 rem_anchor_token(')');
1349 expect(')', end_error);
1352 attribute->invalid = true;
1356 * Parse one string literal argument of the given attribute.
1358 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1361 add_anchor_token('(');
1362 if (token.type != T_STRING_LITERAL) {
1363 parse_error_expected("while parsing attribute directive",
1364 T_STRING_LITERAL, NULL);
1367 *string = parse_string_literals();
1368 rem_anchor_token('(');
1369 expect(')', end_error);
1372 attribute->invalid = true;
1376 * Parse one tls model of the given attribute.
1378 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1380 static const char *const tls_models[] = {
1386 string_t string = { NULL, 0 };
1387 parse_gnu_attribute_string_arg(attribute, &string);
1388 if (string.begin != NULL) {
1389 for (size_t i = 0; i < 4; ++i) {
1390 if (strcmp(tls_models[i], string.begin) == 0) {
1391 attribute->u.value = i;
1395 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1397 attribute->invalid = true;
1401 * Parse one tls model of the given attribute.
1403 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1405 static const char *const visibilities[] = {
1411 string_t string = { NULL, 0 };
1412 parse_gnu_attribute_string_arg(attribute, &string);
1413 if (string.begin != NULL) {
1414 for (size_t i = 0; i < 4; ++i) {
1415 if (strcmp(visibilities[i], string.begin) == 0) {
1416 attribute->u.value = i;
1420 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1422 attribute->invalid = true;
1426 * Parse one (code) model of the given attribute.
1428 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1430 static const char *const visibilities[] = {
1435 string_t string = { NULL, 0 };
1436 parse_gnu_attribute_string_arg(attribute, &string);
1437 if (string.begin != NULL) {
1438 for (int i = 0; i < 3; ++i) {
1439 if (strcmp(visibilities[i], string.begin) == 0) {
1440 attribute->u.value = i;
1444 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1446 attribute->invalid = true;
1450 * Parse one mode of the given attribute.
1452 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1454 add_anchor_token(')');
1456 if (token.type != T_IDENTIFIER) {
1457 expect(T_IDENTIFIER, end_error);
1460 attribute->u.symbol = token.v.symbol;
1463 rem_anchor_token(')');
1464 expect(')', end_error);
1467 attribute->invalid = true;
1471 * Parse one interrupt argument of the given attribute.
1473 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1475 static const char *const interrupts[] = {
1482 string_t string = { NULL, 0 };
1483 parse_gnu_attribute_string_arg(attribute, &string);
1484 if (string.begin != NULL) {
1485 for (size_t i = 0; i < 5; ++i) {
1486 if (strcmp(interrupts[i], string.begin) == 0) {
1487 attribute->u.value = i;
1491 errorf(HERE, "'%s' is not an interrupt", string.begin);
1493 attribute->invalid = true;
1497 * Parse ( identifier, const expression, const expression )
1499 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1501 static const char *const format_names[] = {
1509 if (token.type != T_IDENTIFIER) {
1510 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1513 const char *name = token.v.symbol->string;
1514 for (i = 0; i < 4; ++i) {
1515 if (strcmp_underscore(format_names[i], name) == 0)
1519 if (warning.attribute)
1520 warningf(HERE, "'%s' is an unrecognized format function type", name);
1524 expect(',', end_error);
1525 add_anchor_token(')');
1526 add_anchor_token(',');
1527 parse_constant_expression();
1528 rem_anchor_token(',');
1529 rem_anchor_token(')');
1531 expect(',', end_error);
1532 add_anchor_token(')');
1533 parse_constant_expression();
1534 rem_anchor_token(')');
1535 expect(')', end_error);
1538 attribute->u.value = true;
1542 * Check that a given GNU attribute has no arguments.
1544 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1546 if (!attribute->has_arguments)
1549 /* should have no arguments */
1550 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1551 eat_until_matching_token('(');
1552 /* we have already consumed '(', so we stop before ')', eat it */
1554 attribute->invalid = true;
1558 * Parse one GNU attribute.
1560 * Note that attribute names can be specified WITH or WITHOUT
1561 * double underscores, ie const or __const__.
1563 * The following attributes are parsed without arguments
1588 * no_instrument_function
1589 * warn_unused_result
1606 * externally_visible
1614 * The following attributes are parsed with arguments
1615 * aligned( const expression )
1616 * alias( string literal )
1617 * section( string literal )
1618 * format( identifier, const expression, const expression )
1619 * format_arg( const expression )
1620 * tls_model( string literal )
1621 * visibility( string literal )
1622 * regparm( const expression )
1623 * model( string leteral )
1624 * trap_exit( const expression )
1625 * sp_switch( string literal )
1627 * The following attributes might have arguments
1628 * weak_ref( string literal )
1629 * non_null( const expression // ',' )
1630 * interrupt( string literal )
1631 * sentinel( constant expression )
1633 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1635 gnu_attribute_t *head = *attributes;
1636 gnu_attribute_t *last = *attributes;
1637 decl_modifiers_t modifiers = 0;
1638 gnu_attribute_t *attribute;
1640 eat(T___attribute__);
1641 expect('(', end_error);
1642 expect('(', end_error);
1644 if (token.type != ')') {
1645 /* find the end of the list */
1647 while (last->next != NULL)
1651 /* non-empty attribute list */
1654 if (token.type == T_const) {
1656 } else if (token.type == T_volatile) {
1658 } else if (token.type == T_cdecl) {
1659 /* __attribute__((cdecl)), WITH ms mode */
1661 } else if (token.type == T_IDENTIFIER) {
1662 const symbol_t *sym = token.v.symbol;
1665 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1672 for (i = 0; i < GNU_AK_LAST; ++i) {
1673 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1676 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1679 if (kind == GNU_AK_LAST) {
1680 if (warning.attribute)
1681 warningf(HERE, "'%s' attribute directive ignored", name);
1683 /* skip possible arguments */
1684 if (token.type == '(') {
1685 eat_until_matching_token(')');
1686 next_token(); /* skip the ')' */
1689 /* check for arguments */
1690 attribute = allocate_gnu_attribute(kind);
1691 if (token.type == '(') {
1693 if (token.type == ')') {
1694 /* empty args are allowed */
1697 attribute->has_arguments = true;
1701 case GNU_AK_VOLATILE:
1706 case GNU_AK_NOCOMMON:
1708 case GNU_AK_NOTSHARED:
1709 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1710 case GNU_AK_WARN_UNUSED_RESULT:
1711 case GNU_AK_LONGCALL:
1712 case GNU_AK_SHORTCALL:
1713 case GNU_AK_LONG_CALL:
1714 case GNU_AK_SHORT_CALL:
1715 case GNU_AK_FUNCTION_VECTOR:
1716 case GNU_AK_INTERRUPT_HANDLER:
1717 case GNU_AK_NMI_HANDLER:
1718 case GNU_AK_NESTING:
1722 case GNU_AK_EIGTHBIT_DATA:
1723 case GNU_AK_TINY_DATA:
1724 case GNU_AK_SAVEALL:
1725 case GNU_AK_FLATTEN:
1726 case GNU_AK_SSEREGPARM:
1727 case GNU_AK_EXTERNALLY_VISIBLE:
1728 case GNU_AK_RETURN_TWICE:
1729 case GNU_AK_MAY_ALIAS:
1730 case GNU_AK_MS_STRUCT:
1731 case GNU_AK_GCC_STRUCT:
1734 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1735 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1736 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1737 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1738 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1739 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1740 case GNU_AK_CONST: modifiers |= DM_CONST; goto no_arg;
1741 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1742 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1743 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1744 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1745 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1746 case GNU_AK_RETURNS_TWICE: modifiers |= DM_RETURNS_TWICE; goto no_arg;
1747 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1748 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1749 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1750 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1751 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1752 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1754 case GNU_AK_ALIGNED:
1755 /* __align__ may be used without an argument */
1756 if (attribute->has_arguments) {
1757 parse_gnu_attribute_const_arg(attribute);
1761 case GNU_AK_FORMAT_ARG:
1762 case GNU_AK_REGPARM:
1763 case GNU_AK_TRAP_EXIT:
1764 if (!attribute->has_arguments) {
1765 /* should have arguments */
1766 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1767 attribute->invalid = true;
1769 parse_gnu_attribute_const_arg(attribute);
1772 case GNU_AK_SECTION:
1773 case GNU_AK_SP_SWITCH:
1774 if (!attribute->has_arguments) {
1775 /* should have arguments */
1776 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1777 attribute->invalid = true;
1779 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1782 if (!attribute->has_arguments) {
1783 /* should have arguments */
1784 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1785 attribute->invalid = true;
1787 parse_gnu_attribute_format_args(attribute);
1789 case GNU_AK_WEAKREF:
1790 /* may have one string argument */
1791 if (attribute->has_arguments)
1792 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1794 case GNU_AK_NONNULL:
1795 if (attribute->has_arguments)
1796 parse_gnu_attribute_const_arg_list(attribute);
1798 case GNU_AK_TLS_MODEL:
1799 if (!attribute->has_arguments) {
1800 /* should have arguments */
1801 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1803 parse_gnu_attribute_tls_model_arg(attribute);
1805 case GNU_AK_VISIBILITY:
1806 if (!attribute->has_arguments) {
1807 /* should have arguments */
1808 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1810 parse_gnu_attribute_visibility_arg(attribute);
1813 if (!attribute->has_arguments) {
1814 /* should have arguments */
1815 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1817 parse_gnu_attribute_model_arg(attribute);
1821 if (!attribute->has_arguments) {
1822 /* should have arguments */
1823 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1825 parse_gnu_attribute_mode_arg(attribute);
1828 case GNU_AK_INTERRUPT:
1829 /* may have one string argument */
1830 if (attribute->has_arguments)
1831 parse_gnu_attribute_interrupt_arg(attribute);
1833 case GNU_AK_SENTINEL:
1834 /* may have one string argument */
1835 if (attribute->has_arguments)
1836 parse_gnu_attribute_const_arg(attribute);
1839 /* already handled */
1843 check_no_argument(attribute, name);
1846 if (attribute != NULL) {
1848 last->next = attribute;
1851 head = last = attribute;
1855 if (token.type != ',')
1860 expect(')', end_error);
1861 expect(')', end_error);
1869 * Parse GNU attributes.
1871 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1873 decl_modifiers_t modifiers = 0;
1876 switch (token.type) {
1877 case T___attribute__:
1878 modifiers |= parse_gnu_attribute(attributes);
1883 expect('(', end_error);
1884 if (token.type != T_STRING_LITERAL) {
1885 parse_error_expected("while parsing assembler attribute",
1886 T_STRING_LITERAL, NULL);
1887 eat_until_matching_token('(');
1890 parse_string_literals();
1892 expect(')', end_error);
1895 case T_cdecl: modifiers |= DM_CDECL; break;
1896 case T__fastcall: modifiers |= DM_FASTCALL; break;
1897 case T__stdcall: modifiers |= DM_STDCALL; break;
1900 /* TODO record modifier */
1902 warningf(HERE, "Ignoring declaration modifier %K", &token);
1906 default: return modifiers;
1913 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1915 static entity_t *determine_lhs_ent(expression_t *const expr,
1918 switch (expr->kind) {
1919 case EXPR_REFERENCE: {
1920 entity_t *const entity = expr->reference.entity;
1921 /* we should only find variables as lvalues... */
1922 if (entity->base.kind != ENTITY_VARIABLE
1923 && entity->base.kind != ENTITY_PARAMETER)
1929 case EXPR_ARRAY_ACCESS: {
1930 expression_t *const ref = expr->array_access.array_ref;
1931 entity_t * ent = NULL;
1932 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1933 ent = determine_lhs_ent(ref, lhs_ent);
1936 mark_vars_read(expr->select.compound, lhs_ent);
1938 mark_vars_read(expr->array_access.index, lhs_ent);
1943 if (is_type_compound(skip_typeref(expr->base.type))) {
1944 return determine_lhs_ent(expr->select.compound, lhs_ent);
1946 mark_vars_read(expr->select.compound, lhs_ent);
1951 case EXPR_UNARY_DEREFERENCE: {
1952 expression_t *const val = expr->unary.value;
1953 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1955 return determine_lhs_ent(val->unary.value, lhs_ent);
1957 mark_vars_read(val, NULL);
1963 mark_vars_read(expr, NULL);
1968 #define ENT_ANY ((entity_t*)-1)
1971 * Mark declarations, which are read. This is used to detect variables, which
1975 * x is not marked as "read", because it is only read to calculate its own new
1979 * x and y are not detected as "not read", because multiple variables are
1982 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1984 switch (expr->kind) {
1985 case EXPR_REFERENCE: {
1986 entity_t *const entity = expr->reference.entity;
1987 if (entity->kind != ENTITY_VARIABLE
1988 && entity->kind != ENTITY_PARAMETER)
1991 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1992 if (entity->kind == ENTITY_VARIABLE) {
1993 entity->variable.read = true;
1995 entity->parameter.read = true;
2002 // TODO respect pure/const
2003 mark_vars_read(expr->call.function, NULL);
2004 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
2005 mark_vars_read(arg->expression, NULL);
2009 case EXPR_CONDITIONAL:
2010 // TODO lhs_decl should depend on whether true/false have an effect
2011 mark_vars_read(expr->conditional.condition, NULL);
2012 if (expr->conditional.true_expression != NULL)
2013 mark_vars_read(expr->conditional.true_expression, lhs_ent);
2014 mark_vars_read(expr->conditional.false_expression, lhs_ent);
2018 if (lhs_ent == ENT_ANY
2019 && !is_type_compound(skip_typeref(expr->base.type)))
2021 mark_vars_read(expr->select.compound, lhs_ent);
2024 case EXPR_ARRAY_ACCESS: {
2025 expression_t *const ref = expr->array_access.array_ref;
2026 mark_vars_read(ref, lhs_ent);
2027 lhs_ent = determine_lhs_ent(ref, lhs_ent);
2028 mark_vars_read(expr->array_access.index, lhs_ent);
2033 mark_vars_read(expr->va_arge.ap, lhs_ent);
2036 case EXPR_UNARY_CAST:
2037 /* Special case: Use void cast to mark a variable as "read" */
2038 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
2043 case EXPR_UNARY_THROW:
2044 if (expr->unary.value == NULL)
2047 case EXPR_UNARY_DEREFERENCE:
2048 case EXPR_UNARY_DELETE:
2049 case EXPR_UNARY_DELETE_ARRAY:
2050 if (lhs_ent == ENT_ANY)
2054 case EXPR_UNARY_NEGATE:
2055 case EXPR_UNARY_PLUS:
2056 case EXPR_UNARY_BITWISE_NEGATE:
2057 case EXPR_UNARY_NOT:
2058 case EXPR_UNARY_TAKE_ADDRESS:
2059 case EXPR_UNARY_POSTFIX_INCREMENT:
2060 case EXPR_UNARY_POSTFIX_DECREMENT:
2061 case EXPR_UNARY_PREFIX_INCREMENT:
2062 case EXPR_UNARY_PREFIX_DECREMENT:
2063 case EXPR_UNARY_CAST_IMPLICIT:
2064 case EXPR_UNARY_ASSUME:
2066 mark_vars_read(expr->unary.value, lhs_ent);
2069 case EXPR_BINARY_ADD:
2070 case EXPR_BINARY_SUB:
2071 case EXPR_BINARY_MUL:
2072 case EXPR_BINARY_DIV:
2073 case EXPR_BINARY_MOD:
2074 case EXPR_BINARY_EQUAL:
2075 case EXPR_BINARY_NOTEQUAL:
2076 case EXPR_BINARY_LESS:
2077 case EXPR_BINARY_LESSEQUAL:
2078 case EXPR_BINARY_GREATER:
2079 case EXPR_BINARY_GREATEREQUAL:
2080 case EXPR_BINARY_BITWISE_AND:
2081 case EXPR_BINARY_BITWISE_OR:
2082 case EXPR_BINARY_BITWISE_XOR:
2083 case EXPR_BINARY_LOGICAL_AND:
2084 case EXPR_BINARY_LOGICAL_OR:
2085 case EXPR_BINARY_SHIFTLEFT:
2086 case EXPR_BINARY_SHIFTRIGHT:
2087 case EXPR_BINARY_COMMA:
2088 case EXPR_BINARY_ISGREATER:
2089 case EXPR_BINARY_ISGREATEREQUAL:
2090 case EXPR_BINARY_ISLESS:
2091 case EXPR_BINARY_ISLESSEQUAL:
2092 case EXPR_BINARY_ISLESSGREATER:
2093 case EXPR_BINARY_ISUNORDERED:
2094 mark_vars_read(expr->binary.left, lhs_ent);
2095 mark_vars_read(expr->binary.right, lhs_ent);
2098 case EXPR_BINARY_ASSIGN:
2099 case EXPR_BINARY_MUL_ASSIGN:
2100 case EXPR_BINARY_DIV_ASSIGN:
2101 case EXPR_BINARY_MOD_ASSIGN:
2102 case EXPR_BINARY_ADD_ASSIGN:
2103 case EXPR_BINARY_SUB_ASSIGN:
2104 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2105 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2106 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2107 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2108 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
2109 if (lhs_ent == ENT_ANY)
2111 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
2112 mark_vars_read(expr->binary.right, lhs_ent);
2117 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
2123 case EXPR_CHARACTER_CONSTANT:
2124 case EXPR_WIDE_CHARACTER_CONSTANT:
2125 case EXPR_STRING_LITERAL:
2126 case EXPR_WIDE_STRING_LITERAL:
2127 case EXPR_COMPOUND_LITERAL: // TODO init?
2129 case EXPR_CLASSIFY_TYPE:
2132 case EXPR_BUILTIN_CONSTANT_P:
2133 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
2135 case EXPR_STATEMENT: // TODO
2136 case EXPR_LABEL_ADDRESS:
2137 case EXPR_REFERENCE_ENUM_VALUE:
2141 panic("unhandled expression");
2144 static designator_t *parse_designation(void)
2146 designator_t *result = NULL;
2147 designator_t *last = NULL;
2150 designator_t *designator;
2151 switch (token.type) {
2153 designator = allocate_ast_zero(sizeof(designator[0]));
2154 designator->source_position = token.source_position;
2156 add_anchor_token(']');
2157 designator->array_index = parse_constant_expression();
2158 rem_anchor_token(']');
2159 expect(']', end_error);
2162 designator = allocate_ast_zero(sizeof(designator[0]));
2163 designator->source_position = token.source_position;
2165 if (token.type != T_IDENTIFIER) {
2166 parse_error_expected("while parsing designator",
2167 T_IDENTIFIER, NULL);
2170 designator->symbol = token.v.symbol;
2174 expect('=', end_error);
2178 assert(designator != NULL);
2180 last->next = designator;
2182 result = designator;
2190 static initializer_t *initializer_from_string(array_type_t *type,
2191 const string_t *const string)
2193 /* TODO: check len vs. size of array type */
2196 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
2197 initializer->string.string = *string;
2202 static initializer_t *initializer_from_wide_string(array_type_t *const type,
2203 wide_string_t *const string)
2205 /* TODO: check len vs. size of array type */
2208 initializer_t *const initializer =
2209 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
2210 initializer->wide_string.string = *string;
2216 * Build an initializer from a given expression.
2218 static initializer_t *initializer_from_expression(type_t *orig_type,
2219 expression_t *expression)
2221 /* TODO check that expression is a constant expression */
2223 /* §6.7.8.14/15 char array may be initialized by string literals */
2224 type_t *type = skip_typeref(orig_type);
2225 type_t *expr_type_orig = expression->base.type;
2226 type_t *expr_type = skip_typeref(expr_type_orig);
2227 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
2228 array_type_t *const array_type = &type->array;
2229 type_t *const element_type = skip_typeref(array_type->element_type);
2231 if (element_type->kind == TYPE_ATOMIC) {
2232 atomic_type_kind_t akind = element_type->atomic.akind;
2233 switch (expression->kind) {
2234 case EXPR_STRING_LITERAL:
2235 if (akind == ATOMIC_TYPE_CHAR
2236 || akind == ATOMIC_TYPE_SCHAR
2237 || akind == ATOMIC_TYPE_UCHAR) {
2238 return initializer_from_string(array_type,
2239 &expression->string.value);
2243 case EXPR_WIDE_STRING_LITERAL: {
2244 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
2245 if (get_unqualified_type(element_type) == bare_wchar_type) {
2246 return initializer_from_wide_string(array_type,
2247 &expression->wide_string.value);
2258 assign_error_t error = semantic_assign(type, expression);
2259 if (error == ASSIGN_ERROR_INCOMPATIBLE)
2261 report_assign_error(error, type, expression, "initializer",
2262 &expression->base.source_position);
2264 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
2266 if (type->kind == TYPE_BITFIELD) {
2267 type = type->bitfield.base_type;
2270 result->value.value = create_implicit_cast(expression, type);
2276 * Checks if a given expression can be used as an constant initializer.
2278 static bool is_initializer_constant(const expression_t *expression)
2280 return is_constant_expression(expression)
2281 || is_address_constant(expression);
2285 * Parses an scalar initializer.
2287 * §6.7.8.11; eat {} without warning
2289 static initializer_t *parse_scalar_initializer(type_t *type,
2290 bool must_be_constant)
2292 /* there might be extra {} hierarchies */
2294 if (token.type == '{') {
2296 warningf(HERE, "extra curly braces around scalar initializer");
2300 } while (token.type == '{');
2303 expression_t *expression = parse_assignment_expression();
2304 mark_vars_read(expression, NULL);
2305 if (must_be_constant && !is_initializer_constant(expression)) {
2306 errorf(&expression->base.source_position,
2307 "Initialisation expression '%E' is not constant",
2311 initializer_t *initializer = initializer_from_expression(type, expression);
2313 if (initializer == NULL) {
2314 errorf(&expression->base.source_position,
2315 "expression '%E' (type '%T') doesn't match expected type '%T'",
2316 expression, expression->base.type, type);
2321 bool additional_warning_displayed = false;
2322 while (braces > 0) {
2323 if (token.type == ',') {
2326 if (token.type != '}') {
2327 if (!additional_warning_displayed && warning.other) {
2328 warningf(HERE, "additional elements in scalar initializer");
2329 additional_warning_displayed = true;
2340 * An entry in the type path.
2342 typedef struct type_path_entry_t type_path_entry_t;
2343 struct type_path_entry_t {
2344 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2346 size_t index; /**< For array types: the current index. */
2347 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2352 * A type path expression a position inside compound or array types.
2354 typedef struct type_path_t type_path_t;
2355 struct type_path_t {
2356 type_path_entry_t *path; /**< An flexible array containing the current path. */
2357 type_t *top_type; /**< type of the element the path points */
2358 size_t max_index; /**< largest index in outermost array */
2362 * Prints a type path for debugging.
2364 static __attribute__((unused)) void debug_print_type_path(
2365 const type_path_t *path)
2367 size_t len = ARR_LEN(path->path);
2369 for (size_t i = 0; i < len; ++i) {
2370 const type_path_entry_t *entry = & path->path[i];
2372 type_t *type = skip_typeref(entry->type);
2373 if (is_type_compound(type)) {
2374 /* in gcc mode structs can have no members */
2375 if (entry->v.compound_entry == NULL) {
2379 fprintf(stderr, ".%s",
2380 entry->v.compound_entry->base.symbol->string);
2381 } else if (is_type_array(type)) {
2382 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
2384 fprintf(stderr, "-INVALID-");
2387 if (path->top_type != NULL) {
2388 fprintf(stderr, " (");
2389 print_type(path->top_type);
2390 fprintf(stderr, ")");
2395 * Return the top type path entry, ie. in a path
2396 * (type).a.b returns the b.
2398 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2400 size_t len = ARR_LEN(path->path);
2402 return &path->path[len-1];
2406 * Enlarge the type path by an (empty) element.
2408 static type_path_entry_t *append_to_type_path(type_path_t *path)
2410 size_t len = ARR_LEN(path->path);
2411 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2413 type_path_entry_t *result = & path->path[len];
2414 memset(result, 0, sizeof(result[0]));
2419 * Descending into a sub-type. Enter the scope of the current top_type.
2421 static void descend_into_subtype(type_path_t *path)
2423 type_t *orig_top_type = path->top_type;
2424 type_t *top_type = skip_typeref(orig_top_type);
2426 type_path_entry_t *top = append_to_type_path(path);
2427 top->type = top_type;
2429 if (is_type_compound(top_type)) {
2430 compound_t *compound = top_type->compound.compound;
2431 entity_t *entry = compound->members.entities;
2433 if (entry != NULL) {
2434 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2435 top->v.compound_entry = &entry->declaration;
2436 path->top_type = entry->declaration.type;
2438 path->top_type = NULL;
2440 } else if (is_type_array(top_type)) {
2442 path->top_type = top_type->array.element_type;
2444 assert(!is_type_valid(top_type));
2449 * Pop an entry from the given type path, ie. returning from
2450 * (type).a.b to (type).a
2452 static void ascend_from_subtype(type_path_t *path)
2454 type_path_entry_t *top = get_type_path_top(path);
2456 path->top_type = top->type;
2458 size_t len = ARR_LEN(path->path);
2459 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2463 * Pop entries from the given type path until the given
2464 * path level is reached.
2466 static void ascend_to(type_path_t *path, size_t top_path_level)
2468 size_t len = ARR_LEN(path->path);
2470 while (len > top_path_level) {
2471 ascend_from_subtype(path);
2472 len = ARR_LEN(path->path);
2476 static bool walk_designator(type_path_t *path, const designator_t *designator,
2477 bool used_in_offsetof)
2479 for (; designator != NULL; designator = designator->next) {
2480 type_path_entry_t *top = get_type_path_top(path);
2481 type_t *orig_type = top->type;
2483 type_t *type = skip_typeref(orig_type);
2485 if (designator->symbol != NULL) {
2486 symbol_t *symbol = designator->symbol;
2487 if (!is_type_compound(type)) {
2488 if (is_type_valid(type)) {
2489 errorf(&designator->source_position,
2490 "'.%Y' designator used for non-compound type '%T'",
2494 top->type = type_error_type;
2495 top->v.compound_entry = NULL;
2496 orig_type = type_error_type;
2498 compound_t *compound = type->compound.compound;
2499 entity_t *iter = compound->members.entities;
2500 for (; iter != NULL; iter = iter->base.next) {
2501 if (iter->base.symbol == symbol) {
2506 errorf(&designator->source_position,
2507 "'%T' has no member named '%Y'", orig_type, symbol);
2510 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2511 if (used_in_offsetof) {
2512 type_t *real_type = skip_typeref(iter->declaration.type);
2513 if (real_type->kind == TYPE_BITFIELD) {
2514 errorf(&designator->source_position,
2515 "offsetof designator '%Y' may not specify bitfield",
2521 top->type = orig_type;
2522 top->v.compound_entry = &iter->declaration;
2523 orig_type = iter->declaration.type;
2526 expression_t *array_index = designator->array_index;
2527 assert(designator->array_index != NULL);
2529 if (!is_type_array(type)) {
2530 if (is_type_valid(type)) {
2531 errorf(&designator->source_position,
2532 "[%E] designator used for non-array type '%T'",
2533 array_index, orig_type);
2538 long index = fold_constant(array_index);
2539 if (!used_in_offsetof) {
2541 errorf(&designator->source_position,
2542 "array index [%E] must be positive", array_index);
2543 } else if (type->array.size_constant) {
2544 long array_size = type->array.size;
2545 if (index >= array_size) {
2546 errorf(&designator->source_position,
2547 "designator [%E] (%d) exceeds array size %d",
2548 array_index, index, array_size);
2553 top->type = orig_type;
2554 top->v.index = (size_t) index;
2555 orig_type = type->array.element_type;
2557 path->top_type = orig_type;
2559 if (designator->next != NULL) {
2560 descend_into_subtype(path);
2569 static void advance_current_object(type_path_t *path, size_t top_path_level)
2571 type_path_entry_t *top = get_type_path_top(path);
2573 type_t *type = skip_typeref(top->type);
2574 if (is_type_union(type)) {
2575 /* in unions only the first element is initialized */
2576 top->v.compound_entry = NULL;
2577 } else if (is_type_struct(type)) {
2578 declaration_t *entry = top->v.compound_entry;
2580 entity_t *next_entity = entry->base.next;
2581 if (next_entity != NULL) {
2582 assert(is_declaration(next_entity));
2583 entry = &next_entity->declaration;
2588 top->v.compound_entry = entry;
2589 if (entry != NULL) {
2590 path->top_type = entry->type;
2593 } else if (is_type_array(type)) {
2594 assert(is_type_array(type));
2598 if (!type->array.size_constant || top->v.index < type->array.size) {
2602 assert(!is_type_valid(type));
2606 /* we're past the last member of the current sub-aggregate, try if we
2607 * can ascend in the type hierarchy and continue with another subobject */
2608 size_t len = ARR_LEN(path->path);
2610 if (len > top_path_level) {
2611 ascend_from_subtype(path);
2612 advance_current_object(path, top_path_level);
2614 path->top_type = NULL;
2619 * skip until token is found.
2621 static void skip_until(int type)
2623 while (token.type != type) {
2624 if (token.type == T_EOF)
2631 * skip any {...} blocks until a closing bracket is reached.
2633 static void skip_initializers(void)
2635 if (token.type == '{')
2638 while (token.type != '}') {
2639 if (token.type == T_EOF)
2641 if (token.type == '{') {
2649 static initializer_t *create_empty_initializer(void)
2651 static initializer_t empty_initializer
2652 = { .list = { { INITIALIZER_LIST }, 0 } };
2653 return &empty_initializer;
2657 * Parse a part of an initialiser for a struct or union,
2659 static initializer_t *parse_sub_initializer(type_path_t *path,
2660 type_t *outer_type, size_t top_path_level,
2661 parse_initializer_env_t *env)
2663 if (token.type == '}') {
2664 /* empty initializer */
2665 return create_empty_initializer();
2668 type_t *orig_type = path->top_type;
2669 type_t *type = NULL;
2671 if (orig_type == NULL) {
2672 /* We are initializing an empty compound. */
2674 type = skip_typeref(orig_type);
2677 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2680 designator_t *designator = NULL;
2681 if (token.type == '.' || token.type == '[') {
2682 designator = parse_designation();
2683 goto finish_designator;
2684 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2685 /* GNU-style designator ("identifier: value") */
2686 designator = allocate_ast_zero(sizeof(designator[0]));
2687 designator->source_position = token.source_position;
2688 designator->symbol = token.v.symbol;
2693 /* reset path to toplevel, evaluate designator from there */
2694 ascend_to(path, top_path_level);
2695 if (!walk_designator(path, designator, false)) {
2696 /* can't continue after designation error */
2700 initializer_t *designator_initializer
2701 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2702 designator_initializer->designator.designator = designator;
2703 ARR_APP1(initializer_t*, initializers, designator_initializer);
2705 orig_type = path->top_type;
2706 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2711 if (token.type == '{') {
2712 if (type != NULL && is_type_scalar(type)) {
2713 sub = parse_scalar_initializer(type, env->must_be_constant);
2717 if (env->entity != NULL) {
2719 "extra brace group at end of initializer for '%Y'",
2720 env->entity->base.symbol);
2722 errorf(HERE, "extra brace group at end of initializer");
2725 descend_into_subtype(path);
2727 add_anchor_token('}');
2728 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2730 rem_anchor_token('}');
2733 ascend_from_subtype(path);
2734 expect('}', end_error);
2736 expect('}', end_error);
2737 goto error_parse_next;
2741 /* must be an expression */
2742 expression_t *expression = parse_assignment_expression();
2743 mark_vars_read(expression, NULL);
2745 if (env->must_be_constant && !is_initializer_constant(expression)) {
2746 errorf(&expression->base.source_position,
2747 "Initialisation expression '%E' is not constant",
2752 /* we are already outside, ... */
2753 type_t *const outer_type_skip = skip_typeref(outer_type);
2754 if (is_type_compound(outer_type_skip) &&
2755 !outer_type_skip->compound.compound->complete) {
2756 goto error_parse_next;
2761 /* handle { "string" } special case */
2762 if ((expression->kind == EXPR_STRING_LITERAL
2763 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2764 && outer_type != NULL) {
2765 sub = initializer_from_expression(outer_type, expression);
2767 if (token.type == ',') {
2770 if (token.type != '}' && warning.other) {
2771 warningf(HERE, "excessive elements in initializer for type '%T'",
2774 /* TODO: eat , ... */
2779 /* descend into subtypes until expression matches type */
2781 orig_type = path->top_type;
2782 type = skip_typeref(orig_type);
2784 sub = initializer_from_expression(orig_type, expression);
2788 if (!is_type_valid(type)) {
2791 if (is_type_scalar(type)) {
2792 errorf(&expression->base.source_position,
2793 "expression '%E' doesn't match expected type '%T'",
2794 expression, orig_type);
2798 descend_into_subtype(path);
2802 /* update largest index of top array */
2803 const type_path_entry_t *first = &path->path[0];
2804 type_t *first_type = first->type;
2805 first_type = skip_typeref(first_type);
2806 if (is_type_array(first_type)) {
2807 size_t index = first->v.index;
2808 if (index > path->max_index)
2809 path->max_index = index;
2813 /* append to initializers list */
2814 ARR_APP1(initializer_t*, initializers, sub);
2817 if (warning.other) {
2818 if (env->entity != NULL) {
2819 warningf(HERE, "excess elements in struct initializer for '%Y'",
2820 env->entity->base.symbol);
2822 warningf(HERE, "excess elements in struct initializer");
2828 if (token.type == '}') {
2831 expect(',', end_error);
2832 if (token.type == '}') {
2837 /* advance to the next declaration if we are not at the end */
2838 advance_current_object(path, top_path_level);
2839 orig_type = path->top_type;
2840 if (orig_type != NULL)
2841 type = skip_typeref(orig_type);
2847 size_t len = ARR_LEN(initializers);
2848 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2849 initializer_t *result = allocate_ast_zero(size);
2850 result->kind = INITIALIZER_LIST;
2851 result->list.len = len;
2852 memcpy(&result->list.initializers, initializers,
2853 len * sizeof(initializers[0]));
2855 DEL_ARR_F(initializers);
2856 ascend_to(path, top_path_level+1);
2861 skip_initializers();
2862 DEL_ARR_F(initializers);
2863 ascend_to(path, top_path_level+1);
2868 * Parses an initializer. Parsers either a compound literal
2869 * (env->declaration == NULL) or an initializer of a declaration.
2871 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2873 type_t *type = skip_typeref(env->type);
2874 size_t max_index = 0xdeadbeaf; // TODO: Resolve this uninitialized variable problem
2875 initializer_t *result;
2877 if (is_type_scalar(type)) {
2878 result = parse_scalar_initializer(type, env->must_be_constant);
2879 } else if (token.type == '{') {
2883 memset(&path, 0, sizeof(path));
2884 path.top_type = env->type;
2885 path.path = NEW_ARR_F(type_path_entry_t, 0);
2887 descend_into_subtype(&path);
2889 add_anchor_token('}');
2890 result = parse_sub_initializer(&path, env->type, 1, env);
2891 rem_anchor_token('}');
2893 max_index = path.max_index;
2894 DEL_ARR_F(path.path);
2896 expect('}', end_error);
2898 /* parse_scalar_initializer() also works in this case: we simply
2899 * have an expression without {} around it */
2900 result = parse_scalar_initializer(type, env->must_be_constant);
2903 /* §6.7.8:22 array initializers for arrays with unknown size determine
2904 * the array type size */
2905 if (is_type_array(type) && type->array.size_expression == NULL
2906 && result != NULL) {
2908 switch (result->kind) {
2909 case INITIALIZER_LIST:
2910 assert(max_index != 0xdeadbeaf);
2911 size = max_index + 1;
2914 case INITIALIZER_STRING:
2915 size = result->string.string.size;
2918 case INITIALIZER_WIDE_STRING:
2919 size = result->wide_string.string.size;
2922 case INITIALIZER_DESIGNATOR:
2923 case INITIALIZER_VALUE:
2924 /* can happen for parse errors */
2929 internal_errorf(HERE, "invalid initializer type");
2932 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2933 cnst->base.type = type_size_t;
2934 cnst->conste.v.int_value = size;
2936 type_t *new_type = duplicate_type(type);
2938 new_type->array.size_expression = cnst;
2939 new_type->array.size_constant = true;
2940 new_type->array.has_implicit_size = true;
2941 new_type->array.size = size;
2942 env->type = new_type;
2950 static void append_entity(scope_t *scope, entity_t *entity)
2952 if (scope->last_entity != NULL) {
2953 scope->last_entity->base.next = entity;
2955 scope->entities = entity;
2957 scope->last_entity = entity;
2961 static compound_t *parse_compound_type_specifier(bool is_struct)
2963 gnu_attribute_t *attributes = NULL;
2964 decl_modifiers_t modifiers = 0;
2971 symbol_t *symbol = NULL;
2972 compound_t *compound = NULL;
2974 if (token.type == T___attribute__) {
2975 modifiers |= parse_attributes(&attributes);
2978 if (token.type == T_IDENTIFIER) {
2979 symbol = token.v.symbol;
2982 namespace_tag_t const namespc =
2983 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2984 entity_t *entity = get_entity(symbol, namespc);
2985 if (entity != NULL) {
2986 assert(entity->kind == (is_struct ? ENTITY_STRUCT : ENTITY_UNION));
2987 compound = &entity->compound;
2988 if (compound->base.parent_scope != current_scope &&
2989 (token.type == '{' || token.type == ';')) {
2990 /* we're in an inner scope and have a definition. Shadow
2991 * existing definition in outer scope */
2993 } else if (compound->complete && token.type == '{') {
2994 assert(symbol != NULL);
2995 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2996 is_struct ? "struct" : "union", symbol,
2997 &compound->base.source_position);
2998 /* clear members in the hope to avoid further errors */
2999 compound->members.entities = NULL;
3002 } else if (token.type != '{') {
3004 parse_error_expected("while parsing struct type specifier",
3005 T_IDENTIFIER, '{', NULL);
3007 parse_error_expected("while parsing union type specifier",
3008 T_IDENTIFIER, '{', NULL);
3014 if (compound == NULL) {
3015 entity_kind_t kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
3016 entity_t *entity = allocate_entity_zero(kind);
3017 compound = &entity->compound;
3019 compound->base.namespc =
3020 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
3021 compound->base.source_position = token.source_position;
3022 compound->base.symbol = symbol;
3023 compound->base.parent_scope = current_scope;
3024 if (symbol != NULL) {
3025 environment_push(entity);
3027 append_entity(current_scope, entity);
3030 if (token.type == '{') {
3031 parse_compound_type_entries(compound);
3032 modifiers |= parse_attributes(&attributes);
3034 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
3035 if (symbol == NULL) {
3036 assert(anonymous_entity == NULL);
3037 anonymous_entity = (entity_t*)compound;
3041 compound->modifiers |= modifiers;
3045 static void parse_enum_entries(type_t *const enum_type)
3049 if (token.type == '}') {
3050 errorf(HERE, "empty enum not allowed");
3055 add_anchor_token('}');
3057 if (token.type != T_IDENTIFIER) {
3058 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
3060 rem_anchor_token('}');
3064 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
3065 entity->enum_value.enum_type = enum_type;
3066 entity->base.symbol = token.v.symbol;
3067 entity->base.source_position = token.source_position;
3070 if (token.type == '=') {
3072 expression_t *value = parse_constant_expression();
3074 value = create_implicit_cast(value, enum_type);
3075 entity->enum_value.value = value;
3080 record_entity(entity, false);
3082 if (token.type != ',')
3085 } while (token.type != '}');
3086 rem_anchor_token('}');
3088 expect('}', end_error);
3094 static type_t *parse_enum_specifier(void)
3096 gnu_attribute_t *attributes = NULL;
3101 if (token.type == T_IDENTIFIER) {
3102 symbol = token.v.symbol;
3105 entity = get_entity(symbol, NAMESPACE_ENUM);
3106 if (entity != NULL) {
3107 assert(entity->kind == ENTITY_ENUM);
3108 if (entity->base.parent_scope != current_scope &&
3109 (token.type == '{' || token.type == ';')) {
3110 /* we're in an inner scope and have a definition. Shadow
3111 * existing definition in outer scope */
3113 } else if (entity->enume.complete && token.type == '{') {
3114 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
3115 symbol, &entity->base.source_position);
3118 } else if (token.type != '{') {
3119 parse_error_expected("while parsing enum type specifier",
3120 T_IDENTIFIER, '{', NULL);
3127 if (entity == NULL) {
3128 entity = allocate_entity_zero(ENTITY_ENUM);
3129 entity->base.namespc = NAMESPACE_ENUM;
3130 entity->base.source_position = token.source_position;
3131 entity->base.symbol = symbol;
3132 entity->base.parent_scope = current_scope;
3135 type_t *const type = allocate_type_zero(TYPE_ENUM);
3136 type->enumt.enume = &entity->enume;
3137 type->enumt.akind = ATOMIC_TYPE_INT;
3139 if (token.type == '{') {
3140 if (symbol != NULL) {
3141 environment_push(entity);
3143 append_entity(current_scope, entity);
3144 entity->enume.complete = true;
3146 parse_enum_entries(type);
3147 parse_attributes(&attributes);
3149 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
3150 if (symbol == NULL) {
3151 assert(anonymous_entity == NULL);
3152 anonymous_entity = entity;
3154 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
3155 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
3163 * if a symbol is a typedef to another type, return true
3165 static bool is_typedef_symbol(symbol_t *symbol)
3167 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
3168 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
3171 static type_t *parse_typeof(void)
3177 expect('(', end_error);
3178 add_anchor_token(')');
3180 expression_t *expression = NULL;
3182 bool old_type_prop = in_type_prop;
3183 bool old_gcc_extension = in_gcc_extension;
3184 in_type_prop = true;
3186 while (token.type == T___extension__) {
3187 /* This can be a prefix to a typename or an expression. */
3189 in_gcc_extension = true;
3191 switch (token.type) {
3193 if (is_typedef_symbol(token.v.symbol)) {
3194 type = parse_typename();
3196 expression = parse_expression();
3197 type = revert_automatic_type_conversion(expression);
3202 type = parse_typename();
3206 expression = parse_expression();
3207 type = expression->base.type;
3210 in_type_prop = old_type_prop;
3211 in_gcc_extension = old_gcc_extension;
3213 rem_anchor_token(')');
3214 expect(')', end_error);
3216 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
3217 typeof_type->typeoft.expression = expression;
3218 typeof_type->typeoft.typeof_type = type;
3225 typedef enum specifiers_t {
3226 SPECIFIER_SIGNED = 1 << 0,
3227 SPECIFIER_UNSIGNED = 1 << 1,
3228 SPECIFIER_LONG = 1 << 2,
3229 SPECIFIER_INT = 1 << 3,
3230 SPECIFIER_DOUBLE = 1 << 4,
3231 SPECIFIER_CHAR = 1 << 5,
3232 SPECIFIER_WCHAR_T = 1 << 6,
3233 SPECIFIER_SHORT = 1 << 7,
3234 SPECIFIER_LONG_LONG = 1 << 8,
3235 SPECIFIER_FLOAT = 1 << 9,
3236 SPECIFIER_BOOL = 1 << 10,
3237 SPECIFIER_VOID = 1 << 11,
3238 SPECIFIER_INT8 = 1 << 12,
3239 SPECIFIER_INT16 = 1 << 13,
3240 SPECIFIER_INT32 = 1 << 14,
3241 SPECIFIER_INT64 = 1 << 15,
3242 SPECIFIER_INT128 = 1 << 16,
3243 SPECIFIER_COMPLEX = 1 << 17,
3244 SPECIFIER_IMAGINARY = 1 << 18,
3247 static type_t *create_builtin_type(symbol_t *const symbol,
3248 type_t *const real_type)
3250 type_t *type = allocate_type_zero(TYPE_BUILTIN);
3251 type->builtin.symbol = symbol;
3252 type->builtin.real_type = real_type;
3253 return identify_new_type(type);
3256 static type_t *get_typedef_type(symbol_t *symbol)
3258 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3259 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
3262 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
3263 type->typedeft.typedefe = &entity->typedefe;
3269 * check for the allowed MS alignment values.
3271 static bool check_alignment_value(long long intvalue)
3273 if (intvalue < 1 || intvalue > 8192) {
3274 errorf(HERE, "illegal alignment value");
3277 unsigned v = (unsigned)intvalue;
3278 for (unsigned i = 1; i <= 8192; i += i) {
3282 errorf(HERE, "alignment must be power of two");
3286 #define DET_MOD(name, tag) do { \
3287 if (*modifiers & tag && warning.other) warningf(HERE, #name " used more than once"); \
3288 *modifiers |= tag; \
3291 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
3293 decl_modifiers_t *modifiers = &specifiers->modifiers;
3296 if (token.type == T_restrict) {
3298 DET_MOD(restrict, DM_RESTRICT);
3300 } else if (token.type != T_IDENTIFIER)
3302 symbol_t *symbol = token.v.symbol;
3303 if (symbol == sym_align) {
3305 expect('(', end_error);
3306 if (token.type != T_INTEGER)
3308 if (check_alignment_value(token.v.intvalue)) {
3309 if (specifiers->alignment != 0 && warning.other)
3310 warningf(HERE, "align used more than once");
3311 specifiers->alignment = (unsigned char)token.v.intvalue;
3314 expect(')', end_error);
3315 } else if (symbol == sym_allocate) {
3317 expect('(', end_error);
3318 if (token.type != T_IDENTIFIER)
3320 (void)token.v.symbol;
3321 expect(')', end_error);
3322 } else if (symbol == sym_dllimport) {
3324 DET_MOD(dllimport, DM_DLLIMPORT);
3325 } else if (symbol == sym_dllexport) {
3327 DET_MOD(dllexport, DM_DLLEXPORT);
3328 } else if (symbol == sym_thread) {
3330 DET_MOD(thread, DM_THREAD);
3331 } else if (symbol == sym_naked) {
3333 DET_MOD(naked, DM_NAKED);
3334 } else if (symbol == sym_noinline) {
3336 DET_MOD(noinline, DM_NOINLINE);
3337 } else if (symbol == sym_returns_twice) {
3339 DET_MOD(returns_twice, DM_RETURNS_TWICE);
3340 } else if (symbol == sym_noreturn) {
3342 DET_MOD(noreturn, DM_NORETURN);
3343 } else if (symbol == sym_nothrow) {
3345 DET_MOD(nothrow, DM_NOTHROW);
3346 } else if (symbol == sym_novtable) {
3348 DET_MOD(novtable, DM_NOVTABLE);
3349 } else if (symbol == sym_property) {
3351 expect('(', end_error);
3353 bool is_get = false;
3354 if (token.type != T_IDENTIFIER)
3356 if (token.v.symbol == sym_get) {
3358 } else if (token.v.symbol == sym_put) {
3360 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3364 expect('=', end_error);
3365 if (token.type != T_IDENTIFIER)
3368 if (specifiers->get_property_sym != NULL) {
3369 errorf(HERE, "get property name already specified");
3371 specifiers->get_property_sym = token.v.symbol;
3374 if (specifiers->put_property_sym != NULL) {
3375 errorf(HERE, "put property name already specified");
3377 specifiers->put_property_sym = token.v.symbol;
3381 if (token.type == ',') {
3387 expect(')', end_error);
3388 } else if (symbol == sym_selectany) {
3390 DET_MOD(selectany, DM_SELECTANY);
3391 } else if (symbol == sym_uuid) {
3393 expect('(', end_error);
3394 if (token.type != T_STRING_LITERAL)
3397 expect(')', end_error);
3398 } else if (symbol == sym_deprecated) {
3400 if (specifiers->deprecated != 0 && warning.other)
3401 warningf(HERE, "deprecated used more than once");
3402 specifiers->deprecated = true;
3403 if (token.type == '(') {
3405 if (token.type == T_STRING_LITERAL) {
3406 specifiers->deprecated_string = token.v.string.begin;
3409 errorf(HERE, "string literal expected");
3411 expect(')', end_error);
3413 } else if (symbol == sym_noalias) {
3415 DET_MOD(noalias, DM_NOALIAS);
3418 warningf(HERE, "Unknown modifier '%Y' ignored", token.v.symbol);
3420 if (token.type == '(')
3424 if (token.type == ',')
3431 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
3433 entity_t *entity = allocate_entity_zero(kind);
3434 entity->base.source_position = *HERE;
3435 entity->base.symbol = symbol;
3436 if (is_declaration(entity)) {
3437 entity->declaration.type = type_error_type;
3438 entity->declaration.implicit = true;
3439 } else if (kind == ENTITY_TYPEDEF) {
3440 entity->typedefe.type = type_error_type;
3441 entity->typedefe.builtin = true;
3443 if (kind != ENTITY_COMPOUND_MEMBER)
3444 record_entity(entity, false);
3448 static variable_t *parse_microsoft_based(void)
3450 if (token.type != T_IDENTIFIER) {
3451 parse_error_expected("while parsing __based", T_IDENTIFIER, NULL);
3454 symbol_t *symbol = token.v.symbol;
3455 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3457 variable_t *variable;
3458 if (entity == NULL || entity->base.kind != ENTITY_VARIABLE) {
3459 errorf(HERE, "'%Y' is not a variable name.", symbol);
3460 variable = &create_error_entity(symbol, ENTITY_VARIABLE)->variable;
3462 variable = &entity->variable;
3464 type_t *const type = variable->base.type;
3465 if (is_type_valid(type)) {
3466 if (! is_type_pointer(skip_typeref(type))) {
3467 errorf(HERE, "variable in __based modifier must have pointer type instead of '%T'", type);
3469 if (variable->base.base.parent_scope != file_scope) {
3470 errorf(HERE, "a nonstatic local variable may not be used in a __based specification");
3479 * Finish the construction of a struct type by calculating
3480 * its size, offsets, alignment.
3482 static void finish_struct_type(compound_type_t *type)
3484 assert(type->compound != NULL);
3486 compound_t *compound = type->compound;
3487 if (!compound->complete)
3492 il_alignment_t alignment = 1;
3493 bool need_pad = false;
3495 entity_t *entry = compound->members.entities;
3496 for (; entry != NULL; entry = entry->base.next) {
3497 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3500 type_t *m_type = skip_typeref(entry->declaration.type);
3501 if (! is_type_valid(m_type)) {
3502 /* simply ignore errors here */
3505 il_alignment_t m_alignment = m_type->base.alignment;
3506 if (m_alignment > alignment)
3507 alignment = m_alignment;
3509 offset = (size + m_alignment - 1) & -m_alignment;
3513 entry->compound_member.offset = offset;
3514 size = offset + m_type->base.size;
3516 if (type->base.alignment != 0) {
3517 alignment = type->base.alignment;
3520 offset = (size + alignment - 1) & -alignment;
3525 if (warning.padded) {
3526 warningf(&compound->base.source_position, "'%T' needs padding", type);
3529 if (compound->modifiers & DM_PACKED && warning.packed) {
3530 warningf(&compound->base.source_position,
3531 "superfluous packed attribute on '%T'", type);
3535 type->base.size = offset;
3536 type->base.alignment = alignment;
3540 * Finish the construction of an union type by calculating
3541 * its size and alignment.
3543 static void finish_union_type(compound_type_t *type)
3545 assert(type->compound != NULL);
3547 compound_t *compound = type->compound;
3548 if (! compound->complete)
3552 il_alignment_t alignment = 1;
3554 entity_t *entry = compound->members.entities;
3555 for (; entry != NULL; entry = entry->base.next) {
3556 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3559 type_t *m_type = skip_typeref(entry->declaration.type);
3560 if (! is_type_valid(m_type))
3563 entry->compound_member.offset = 0;
3564 if (m_type->base.size > size)
3565 size = m_type->base.size;
3566 if (m_type->base.alignment > alignment)
3567 alignment = m_type->base.alignment;
3569 if (type->base.alignment != 0) {
3570 alignment = type->base.alignment;
3572 size = (size + alignment - 1) & -alignment;
3573 type->base.size = size;
3574 type->base.alignment = alignment;
3577 static type_t *handle_attribute_mode(const gnu_attribute_t *attribute,
3580 type_t *type = skip_typeref(orig_type);
3582 /* at least: byte, word, pointer, list of machine modes
3583 * __XXX___ is interpreted as XXX */
3585 /* This isn't really correct, the backend should provide a list of machine
3586 * specific modes (according to gcc philosophy that is...) */
3587 const char *symbol_str = attribute->u.symbol->string;
3588 bool sign = is_type_signed(type);
3589 atomic_type_kind_t akind;
3590 if (strcmp_underscore("QI", symbol_str) == 0 ||
3591 strcmp_underscore("byte", symbol_str) == 0) {
3592 akind = sign ? ATOMIC_TYPE_CHAR : ATOMIC_TYPE_UCHAR;
3593 } else if (strcmp_underscore("HI", symbol_str) == 0) {
3594 akind = sign ? ATOMIC_TYPE_SHORT : ATOMIC_TYPE_USHORT;
3595 } else if (strcmp_underscore("SI", symbol_str) == 0
3596 || strcmp_underscore("word", symbol_str) == 0
3597 || strcmp_underscore("pointer", symbol_str) == 0) {
3598 akind = sign ? ATOMIC_TYPE_INT : ATOMIC_TYPE_UINT;
3599 } else if (strcmp_underscore("DI", symbol_str) == 0) {
3600 akind = sign ? ATOMIC_TYPE_LONGLONG : ATOMIC_TYPE_ULONGLONG;
3603 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
3607 if (type->kind == TYPE_ATOMIC) {
3608 type_t *copy = duplicate_type(type);
3609 copy->atomic.akind = akind;
3610 return identify_new_type(copy);
3611 } else if (type->kind == TYPE_ENUM) {
3612 type_t *copy = duplicate_type(type);
3613 copy->enumt.akind = akind;
3614 return identify_new_type(copy);
3615 } else if (is_type_pointer(type)) {
3616 warningf(HERE, "__attribute__((mode)) on pointers not implemented yet (ignored)");
3620 errorf(HERE, "__attribute__((mode)) only allowed on integer, enum or pointer type");
3624 static type_t *handle_type_attributes(const gnu_attribute_t *attributes,
3627 const gnu_attribute_t *attribute = attributes;
3628 for ( ; attribute != NULL; attribute = attribute->next) {
3629 if (attribute->invalid)
3632 if (attribute->kind == GNU_AK_MODE) {
3633 type = handle_attribute_mode(attribute, type);
3634 } else if (attribute->kind == GNU_AK_ALIGNED) {
3635 int alignment = 32; /* TODO: fill in maximum useful alignment for
3637 if (attribute->has_arguments)
3638 alignment = attribute->u.argument;
3640 type_t *copy = duplicate_type(type);
3641 copy->base.alignment = attribute->u.argument;
3642 type = identify_new_type(copy);
3649 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3651 type_t *type = NULL;
3652 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3653 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3654 unsigned type_specifiers = 0;
3655 bool newtype = false;
3656 bool saw_error = false;
3657 bool old_gcc_extension = in_gcc_extension;
3659 specifiers->source_position = token.source_position;
3662 specifiers->modifiers
3663 |= parse_attributes(&specifiers->gnu_attributes);
3665 switch (token.type) {
3667 #define MATCH_STORAGE_CLASS(token, class) \
3669 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3670 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3672 specifiers->storage_class = class; \
3673 if (specifiers->thread_local) \
3674 goto check_thread_storage_class; \
3678 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3679 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3680 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3681 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3682 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3686 expect('(', end_error);
3687 add_anchor_token(')');
3688 parse_microsoft_extended_decl_modifier(specifiers);
3689 rem_anchor_token(')');
3690 expect(')', end_error);
3694 if (specifiers->thread_local) {
3695 errorf(HERE, "duplicate '__thread'");
3697 specifiers->thread_local = true;
3698 check_thread_storage_class:
3699 switch (specifiers->storage_class) {
3700 case STORAGE_CLASS_EXTERN:
3701 case STORAGE_CLASS_NONE:
3702 case STORAGE_CLASS_STATIC:
3706 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
3707 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
3708 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
3709 wrong_thread_stoarge_class:
3710 errorf(HERE, "'__thread' used with '%s'", wrong);
3717 /* type qualifiers */
3718 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3720 qualifiers |= qualifier; \
3724 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3725 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3726 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3727 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3728 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3729 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3730 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3731 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3733 case T___extension__:
3735 in_gcc_extension = true;
3738 /* type specifiers */
3739 #define MATCH_SPECIFIER(token, specifier, name) \
3741 if (type_specifiers & specifier) { \
3742 errorf(HERE, "multiple " name " type specifiers given"); \
3744 type_specifiers |= specifier; \
3749 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3750 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3751 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3752 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3753 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3754 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3755 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3756 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3757 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
3758 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3759 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3760 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3761 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3762 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3763 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3764 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3765 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3766 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
3768 case T__forceinline:
3769 /* only in microsoft mode */
3770 specifiers->modifiers |= DM_FORCEINLINE;
3775 specifiers->is_inline = true;
3779 if (type_specifiers & SPECIFIER_LONG_LONG) {
3780 errorf(HERE, "multiple type specifiers given");
3781 } else if (type_specifiers & SPECIFIER_LONG) {
3782 type_specifiers |= SPECIFIER_LONG_LONG;
3784 type_specifiers |= SPECIFIER_LONG;
3790 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3792 type->compound.compound = parse_compound_type_specifier(true);
3793 finish_struct_type(&type->compound);
3797 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3798 type->compound.compound = parse_compound_type_specifier(false);
3799 if (type->compound.compound->modifiers & DM_TRANSPARENT_UNION)
3800 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3801 finish_union_type(&type->compound);
3805 type = parse_enum_specifier();
3808 type = parse_typeof();
3810 case T___builtin_va_list:
3811 type = duplicate_type(type_valist);
3815 case T_IDENTIFIER: {
3816 /* only parse identifier if we haven't found a type yet */
3817 if (type != NULL || type_specifiers != 0) {
3818 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3819 * declaration, so it doesn't generate errors about expecting '(' or
3821 switch (look_ahead(1)->type) {
3828 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3832 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3837 goto finish_specifiers;
3841 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3842 if (typedef_type == NULL) {
3843 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3844 * declaration, so it doesn't generate 'implicit int' followed by more
3845 * errors later on. */
3846 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3852 errorf(HERE, "%K does not name a type", &token);
3855 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3857 type = allocate_type_zero(TYPE_TYPEDEF);
3858 type->typedeft.typedefe = &entity->typedefe;
3862 if (la1_type == '&' || la1_type == '*')
3863 goto finish_specifiers;
3868 goto finish_specifiers;
3873 type = typedef_type;
3877 /* function specifier */
3879 goto finish_specifiers;
3884 specifiers->modifiers
3885 |= parse_attributes(&specifiers->gnu_attributes);
3887 in_gcc_extension = old_gcc_extension;
3889 if (type == NULL || (saw_error && type_specifiers != 0)) {
3890 atomic_type_kind_t atomic_type;
3892 /* match valid basic types */
3893 switch (type_specifiers) {
3894 case SPECIFIER_VOID:
3895 atomic_type = ATOMIC_TYPE_VOID;
3897 case SPECIFIER_WCHAR_T:
3898 atomic_type = ATOMIC_TYPE_WCHAR_T;
3900 case SPECIFIER_CHAR:
3901 atomic_type = ATOMIC_TYPE_CHAR;
3903 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3904 atomic_type = ATOMIC_TYPE_SCHAR;
3906 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3907 atomic_type = ATOMIC_TYPE_UCHAR;
3909 case SPECIFIER_SHORT:
3910 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3911 case SPECIFIER_SHORT | SPECIFIER_INT:
3912 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3913 atomic_type = ATOMIC_TYPE_SHORT;
3915 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3916 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3917 atomic_type = ATOMIC_TYPE_USHORT;
3920 case SPECIFIER_SIGNED:
3921 case SPECIFIER_SIGNED | SPECIFIER_INT:
3922 atomic_type = ATOMIC_TYPE_INT;
3924 case SPECIFIER_UNSIGNED:
3925 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3926 atomic_type = ATOMIC_TYPE_UINT;
3928 case SPECIFIER_LONG:
3929 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3930 case SPECIFIER_LONG | SPECIFIER_INT:
3931 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3932 atomic_type = ATOMIC_TYPE_LONG;
3934 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3935 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3936 atomic_type = ATOMIC_TYPE_ULONG;
3939 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3940 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3941 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3942 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3944 atomic_type = ATOMIC_TYPE_LONGLONG;
3945 goto warn_about_long_long;
3947 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3948 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3950 atomic_type = ATOMIC_TYPE_ULONGLONG;
3951 warn_about_long_long:
3952 if (warning.long_long) {
3953 warningf(&specifiers->source_position,
3954 "ISO C90 does not support 'long long'");
3958 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3959 atomic_type = unsigned_int8_type_kind;
3962 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3963 atomic_type = unsigned_int16_type_kind;
3966 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3967 atomic_type = unsigned_int32_type_kind;
3970 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3971 atomic_type = unsigned_int64_type_kind;
3974 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3975 atomic_type = unsigned_int128_type_kind;
3978 case SPECIFIER_INT8:
3979 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3980 atomic_type = int8_type_kind;
3983 case SPECIFIER_INT16:
3984 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3985 atomic_type = int16_type_kind;
3988 case SPECIFIER_INT32:
3989 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3990 atomic_type = int32_type_kind;
3993 case SPECIFIER_INT64:
3994 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3995 atomic_type = int64_type_kind;
3998 case SPECIFIER_INT128:
3999 case SPECIFIER_SIGNED | SPECIFIER_INT128:
4000 atomic_type = int128_type_kind;
4003 case SPECIFIER_FLOAT:
4004 atomic_type = ATOMIC_TYPE_FLOAT;
4006 case SPECIFIER_DOUBLE:
4007 atomic_type = ATOMIC_TYPE_DOUBLE;
4009 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
4010 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
4012 case SPECIFIER_BOOL:
4013 atomic_type = ATOMIC_TYPE_BOOL;
4015 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
4016 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
4017 atomic_type = ATOMIC_TYPE_FLOAT;
4019 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
4020 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
4021 atomic_type = ATOMIC_TYPE_DOUBLE;
4023 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
4024 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
4025 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
4028 /* invalid specifier combination, give an error message */
4029 if (type_specifiers == 0) {
4033 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
4034 if (!(c_mode & _CXX) && !strict_mode) {
4035 if (warning.implicit_int) {
4036 warningf(HERE, "no type specifiers in declaration, using 'int'");
4038 atomic_type = ATOMIC_TYPE_INT;
4041 errorf(HERE, "no type specifiers given in declaration");
4043 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
4044 (type_specifiers & SPECIFIER_UNSIGNED)) {
4045 errorf(HERE, "signed and unsigned specifiers given");
4046 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
4047 errorf(HERE, "only integer types can be signed or unsigned");
4049 errorf(HERE, "multiple datatypes in declaration");
4054 if (type_specifiers & SPECIFIER_COMPLEX) {
4055 type = allocate_type_zero(TYPE_COMPLEX);
4056 type->complex.akind = atomic_type;
4057 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
4058 type = allocate_type_zero(TYPE_IMAGINARY);
4059 type->imaginary.akind = atomic_type;
4061 type = allocate_type_zero(TYPE_ATOMIC);
4062 type->atomic.akind = atomic_type;
4064 type->base.alignment = get_atomic_type_alignment(atomic_type);
4065 unsigned const size = get_atomic_type_size(atomic_type);
4067 type_specifiers & SPECIFIER_COMPLEX ? size * 2 : size;
4069 } else if (type_specifiers != 0) {
4070 errorf(HERE, "multiple datatypes in declaration");
4073 /* FIXME: check type qualifiers here */
4075 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
4076 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4077 type->base.qualifiers = qualifiers;
4078 type->base.modifiers = modifiers;
4081 type = identify_new_type(type);
4083 type = typehash_insert(type);
4086 type = handle_type_attributes(specifiers->gnu_attributes, type);
4087 specifiers->type = type;
4091 specifiers->type = type_error_type;
4095 static type_qualifiers_t parse_type_qualifiers(void)
4097 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
4100 switch (token.type) {
4101 /* type qualifiers */
4102 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
4103 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
4104 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
4105 /* microsoft extended type modifiers */
4106 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
4107 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
4108 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
4109 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
4110 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
4119 * Parses an K&R identifier list
4121 static void parse_identifier_list(scope_t *scope)
4124 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
4125 entity->base.source_position = token.source_position;
4126 entity->base.namespc = NAMESPACE_NORMAL;
4127 entity->base.symbol = token.v.symbol;
4128 /* a K&R parameter has no type, yet */
4132 append_entity(scope, entity);
4134 if (token.type != ',') {
4138 } while (token.type == T_IDENTIFIER);
4141 static entity_t *parse_parameter(void)
4143 declaration_specifiers_t specifiers;
4144 memset(&specifiers, 0, sizeof(specifiers));
4146 parse_declaration_specifiers(&specifiers);
4148 entity_t *entity = parse_declarator(&specifiers,
4149 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
4150 anonymous_entity = NULL;
4154 static void semantic_parameter_incomplete(const entity_t *entity)
4156 assert(entity->kind == ENTITY_PARAMETER);
4158 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
4159 * list in a function declarator that is part of a
4160 * definition of that function shall not have
4161 * incomplete type. */
4162 type_t *type = skip_typeref(entity->declaration.type);
4163 if (is_type_incomplete(type)) {
4164 errorf(&entity->base.source_position,
4165 "parameter '%#T' has incomplete type",
4166 entity->declaration.type, entity->base.symbol);
4170 static bool has_parameters(void)
4172 /* func(void) is not a parameter */
4173 if (token.type == T_IDENTIFIER) {
4174 entity_t const *const entity = get_entity(token.v.symbol, NAMESPACE_NORMAL);
4175 if (entity->kind != ENTITY_TYPEDEF)
4177 if (skip_typeref(entity->typedefe.type) != type_void)
4179 } else if (token.type != T_void) {
4182 if (look_ahead(1)->type != ')')
4189 * Parses function type parameters (and optionally creates variable_t entities
4190 * for them in a scope)
4192 static void parse_parameters(function_type_t *type, scope_t *scope)
4195 add_anchor_token(')');
4196 int saved_comma_state = save_and_reset_anchor_state(',');
4198 if (token.type == T_IDENTIFIER &&
4199 !is_typedef_symbol(token.v.symbol)) {
4200 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
4201 if (la1_type == ',' || la1_type == ')') {
4202 type->kr_style_parameters = true;
4203 type->unspecified_parameters = true;
4204 parse_identifier_list(scope);
4205 goto parameters_finished;
4209 if (token.type == ')') {
4210 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
4211 if (!(c_mode & _CXX))
4212 type->unspecified_parameters = true;
4213 goto parameters_finished;
4216 if (has_parameters()) {
4217 function_parameter_t **anchor = &type->parameters;
4219 switch (token.type) {
4222 type->variadic = true;
4223 goto parameters_finished;
4226 case T___extension__:
4229 entity_t *entity = parse_parameter();
4230 if (entity->kind == ENTITY_TYPEDEF) {
4231 errorf(&entity->base.source_position,
4232 "typedef not allowed as function parameter");
4235 assert(is_declaration(entity));
4237 semantic_parameter_incomplete(entity);
4239 function_parameter_t *const parameter =
4240 allocate_parameter(entity->declaration.type);
4242 if (scope != NULL) {
4243 append_entity(scope, entity);
4246 *anchor = parameter;
4247 anchor = ¶meter->next;
4252 goto parameters_finished;
4254 if (token.type != ',') {
4255 goto parameters_finished;
4262 parameters_finished:
4263 rem_anchor_token(')');
4264 expect(')', end_error);
4267 restore_anchor_state(',', saved_comma_state);
4270 typedef enum construct_type_kind_t {
4273 CONSTRUCT_REFERENCE,
4276 } construct_type_kind_t;
4278 typedef union construct_type_t construct_type_t;
4280 typedef struct construct_type_base_t {
4281 construct_type_kind_t kind;
4282 construct_type_t *next;
4283 } construct_type_base_t;
4285 typedef struct parsed_pointer_t {
4286 construct_type_base_t base;
4287 type_qualifiers_t type_qualifiers;
4288 variable_t *base_variable; /**< MS __based extension. */
4291 typedef struct parsed_reference_t {
4292 construct_type_base_t base;
4293 } parsed_reference_t;
4295 typedef struct construct_function_type_t {
4296 construct_type_base_t base;
4297 type_t *function_type;
4298 } construct_function_type_t;
4300 typedef struct parsed_array_t {
4301 construct_type_base_t base;
4302 type_qualifiers_t type_qualifiers;
4308 union construct_type_t {
4309 construct_type_kind_t kind;
4310 construct_type_base_t base;
4311 parsed_pointer_t pointer;
4312 parsed_reference_t reference;
4313 construct_function_type_t function;
4314 parsed_array_t array;
4317 static construct_type_t *parse_pointer_declarator(variable_t *base_variable)
4321 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->pointer));
4322 parsed_pointer_t *pointer = &cons->pointer;
4323 memset(pointer, 0, sizeof(*pointer));
4324 cons->kind = CONSTRUCT_POINTER;
4325 pointer->type_qualifiers = parse_type_qualifiers();
4326 pointer->base_variable = base_variable;
4331 static construct_type_t *parse_reference_declarator(void)
4335 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->reference));
4336 parsed_reference_t *reference = &cons->reference;
4337 memset(reference, 0, sizeof(*reference));
4338 cons->kind = CONSTRUCT_REFERENCE;
4343 static construct_type_t *parse_array_declarator(void)
4346 add_anchor_token(']');
4348 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->array));
4349 parsed_array_t *array = &cons->array;
4350 memset(array, 0, sizeof(*array));
4351 cons->kind = CONSTRUCT_ARRAY;
4353 if (token.type == T_static) {
4354 array->is_static = true;
4358 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4359 if (type_qualifiers != 0) {
4360 if (token.type == T_static) {
4361 array->is_static = true;
4365 array->type_qualifiers = type_qualifiers;
4367 if (token.type == '*' && look_ahead(1)->type == ']') {
4368 array->is_variable = true;
4370 } else if (token.type != ']') {
4371 expression_t *const size = parse_assignment_expression();
4373 mark_vars_read(size, NULL);
4376 rem_anchor_token(']');
4377 expect(']', end_error);
4383 static construct_type_t *parse_function_declarator(scope_t *scope,
4384 decl_modifiers_t modifiers)
4386 type_t *type = allocate_type_zero(TYPE_FUNCTION);
4387 function_type_t *ftype = &type->function;
4389 ftype->linkage = current_linkage;
4391 switch (modifiers & (DM_CDECL | DM_STDCALL | DM_FASTCALL | DM_THISCALL)) {
4392 case DM_NONE: break;
4393 case DM_CDECL: ftype->calling_convention = CC_CDECL; break;
4394 case DM_STDCALL: ftype->calling_convention = CC_STDCALL; break;
4395 case DM_FASTCALL: ftype->calling_convention = CC_FASTCALL; break;
4396 case DM_THISCALL: ftype->calling_convention = CC_THISCALL; break;
4399 errorf(HERE, "multiple calling conventions in declaration");
4403 parse_parameters(ftype, scope);
4405 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->function));
4406 construct_function_type_t *function = &cons->function;
4407 memset(function, 0, sizeof(*function));
4408 cons->kind = CONSTRUCT_FUNCTION;
4409 function->function_type = type;
4414 typedef struct parse_declarator_env_t {
4415 decl_modifiers_t modifiers;
4417 source_position_t source_position;
4419 } parse_declarator_env_t;
4421 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env,
4422 bool may_be_abstract)
4424 /* construct a single linked list of construct_type_t's which describe
4425 * how to construct the final declarator type */
4426 construct_type_t *first = NULL;
4427 construct_type_t **anchor = &first;
4428 gnu_attribute_t *attributes = NULL;
4430 decl_modifiers_t modifiers = parse_attributes(&attributes);
4433 construct_type_t *type;
4434 variable_t *based = NULL; /* MS __based extension */
4435 switch (token.type) {
4437 if (!(c_mode & _CXX))
4438 errorf(HERE, "references are only available for C++");
4439 type = parse_reference_declarator();
4443 source_position_t const pos = *HERE;
4445 expect('(', end_error);
4446 add_anchor_token(')');
4447 based = parse_microsoft_based();
4448 rem_anchor_token(')');
4449 expect(')', end_error);
4450 if (token.type != '*') {
4451 if (token.type == T__based) {
4452 errorf(&pos, "__based type modifier specified more than once");
4453 } else if (warning.other) {
4455 "__based does not precede a pointer declarator, ignored");
4463 type = parse_pointer_declarator(based);
4467 goto ptr_operator_end;
4471 anchor = &type->base.next;
4473 /* TODO: find out if this is correct */
4474 modifiers |= parse_attributes(&attributes);
4479 modifiers |= env->modifiers;
4480 env->modifiers = modifiers;
4483 construct_type_t *inner_types = NULL;
4485 switch (token.type) {
4488 errorf(HERE, "no identifier expected in typename");
4490 env->symbol = token.v.symbol;
4491 env->source_position = token.source_position;
4496 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
4497 * interpreted as ``function with no parameter specification'', rather
4498 * than redundant parentheses around the omitted identifier. */
4499 if (look_ahead(1)->type != ')') {
4501 add_anchor_token(')');
4502 inner_types = parse_inner_declarator(env, may_be_abstract);
4503 if (inner_types != NULL) {
4504 /* All later declarators only modify the return type */
4507 rem_anchor_token(')');
4508 expect(')', end_error);
4512 if (may_be_abstract)
4514 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4519 construct_type_t **const p = anchor;
4522 construct_type_t *type;
4523 switch (token.type) {
4525 scope_t *scope = NULL;
4527 scope = &env->parameters;
4529 type = parse_function_declarator(scope, modifiers);
4533 type = parse_array_declarator();
4536 goto declarator_finished;
4539 /* insert in the middle of the list (at p) */
4540 type->base.next = *p;
4543 anchor = &type->base.next;
4546 declarator_finished:
4547 /* append inner_types at the end of the list, we don't to set anchor anymore
4548 * as it's not needed anymore */
4549 *anchor = inner_types;
4556 static void parse_declaration_attributes(entity_t *entity)
4558 gnu_attribute_t *attributes = NULL;
4559 decl_modifiers_t modifiers = parse_attributes(&attributes);
4565 if (entity->kind == ENTITY_TYPEDEF) {
4566 modifiers |= entity->typedefe.modifiers;
4567 type = entity->typedefe.type;
4569 assert(is_declaration(entity));
4570 modifiers |= entity->declaration.modifiers;
4571 type = entity->declaration.type;
4576 gnu_attribute_t *attribute = attributes;
4577 for ( ; attribute != NULL; attribute = attribute->next) {
4578 if (attribute->invalid)
4581 if (attribute->kind == GNU_AK_MODE) {
4582 type = handle_attribute_mode(attribute, type);
4583 } else if (attribute->kind == GNU_AK_ALIGNED) {
4584 int alignment = 32; /* TODO: fill in maximum usefull alignment for target machine */
4585 if (attribute->has_arguments)
4586 alignment = attribute->u.argument;
4588 if (entity->kind == ENTITY_TYPEDEF) {
4589 type_t *copy = duplicate_type(type);
4590 copy->base.alignment = attribute->u.argument;
4591 type = identify_new_type(copy);
4592 } else if(entity->kind == ENTITY_VARIABLE) {
4593 entity->variable.alignment = alignment;
4594 } else if(entity->kind == ENTITY_COMPOUND_MEMBER) {
4595 entity->compound_member.alignment = alignment;
4600 type_modifiers_t type_modifiers = type->base.modifiers;
4601 if (modifiers & DM_TRANSPARENT_UNION)
4602 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4604 if (type->base.modifiers != type_modifiers) {
4605 type_t *copy = duplicate_type(type);
4606 copy->base.modifiers = type_modifiers;
4607 type = identify_new_type(copy);
4610 if (entity->kind == ENTITY_TYPEDEF) {
4611 entity->typedefe.type = type;
4612 entity->typedefe.modifiers = modifiers;
4614 entity->declaration.type = type;
4615 entity->declaration.modifiers = modifiers;
4619 static type_t *construct_declarator_type(construct_type_t *construct_list, type_t *type)
4621 construct_type_t *iter = construct_list;
4622 for (; iter != NULL; iter = iter->base.next) {
4623 switch (iter->kind) {
4624 case CONSTRUCT_INVALID:
4626 case CONSTRUCT_FUNCTION: {
4627 construct_function_type_t *function = &iter->function;
4628 type_t *function_type = function->function_type;
4630 function_type->function.return_type = type;
4632 type_t *skipped_return_type = skip_typeref(type);
4634 if (is_type_function(skipped_return_type)) {
4635 errorf(HERE, "function returning function is not allowed");
4636 } else if (is_type_array(skipped_return_type)) {
4637 errorf(HERE, "function returning array is not allowed");
4639 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4641 "type qualifiers in return type of function type are meaningless");
4645 /* The function type was constructed earlier. Freeing it here will
4646 * destroy other types. */
4647 type = typehash_insert(function_type);
4651 case CONSTRUCT_POINTER: {
4652 if (is_type_reference(skip_typeref(type)))
4653 errorf(HERE, "cannot declare a pointer to reference");
4655 parsed_pointer_t *pointer = &iter->pointer;
4656 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
4660 case CONSTRUCT_REFERENCE:
4661 if (is_type_reference(skip_typeref(type)))
4662 errorf(HERE, "cannot declare a reference to reference");
4664 type = make_reference_type(type);
4667 case CONSTRUCT_ARRAY: {
4668 if (is_type_reference(skip_typeref(type)))
4669 errorf(HERE, "cannot declare an array of references");
4671 parsed_array_t *array = &iter->array;
4672 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4674 expression_t *size_expression = array->size;
4675 if (size_expression != NULL) {
4677 = create_implicit_cast(size_expression, type_size_t);
4680 array_type->base.qualifiers = array->type_qualifiers;
4681 array_type->array.element_type = type;
4682 array_type->array.is_static = array->is_static;
4683 array_type->array.is_variable = array->is_variable;
4684 array_type->array.size_expression = size_expression;
4686 if (size_expression != NULL) {
4687 if (is_constant_expression(size_expression)) {
4688 long const size = fold_constant(size_expression);
4689 array_type->array.size = size;
4690 array_type->array.size_constant = true;
4691 /* §6.7.5.2:1 If the expression is a constant expression, it shall
4692 * have a value greater than zero. */
4694 if (size < 0 || !GNU_MODE) {
4695 errorf(&size_expression->base.source_position,
4696 "size of array must be greater than zero");
4697 } else if (warning.other) {
4698 warningf(&size_expression->base.source_position,
4699 "zero length arrays are a GCC extension");
4703 array_type->array.is_vla = true;
4707 type_t *skipped_type = skip_typeref(type);
4709 if (is_type_incomplete(skipped_type)) {
4710 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4711 } else if (is_type_function(skipped_type)) {
4712 errorf(HERE, "array of functions is not allowed");
4714 type = identify_new_type(array_type);
4718 internal_errorf(HERE, "invalid type construction found");
4724 static type_t *automatic_type_conversion(type_t *orig_type);
4726 static type_t *semantic_parameter(const source_position_t *pos,
4728 const declaration_specifiers_t *specifiers,
4731 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
4732 * shall be adjusted to ``qualified pointer to type'',
4734 * §6.7.5.3:8 A declaration of a parameter as ``function returning
4735 * type'' shall be adjusted to ``pointer to function
4736 * returning type'', as in 6.3.2.1. */
4737 type = automatic_type_conversion(type);
4739 if (specifiers->is_inline && is_type_valid(type)) {
4740 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
4743 /* §6.9.1:6 The declarations in the declaration list shall contain
4744 * no storage-class specifier other than register and no
4745 * initializations. */
4746 if (specifiers->thread_local || (
4747 specifiers->storage_class != STORAGE_CLASS_NONE &&
4748 specifiers->storage_class != STORAGE_CLASS_REGISTER)
4750 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
4753 /* delay test for incomplete type, because we might have (void)
4754 * which is legal but incomplete... */
4759 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4760 declarator_flags_t flags)
4762 parse_declarator_env_t env;
4763 memset(&env, 0, sizeof(env));
4764 env.modifiers = specifiers->modifiers;
4766 construct_type_t *construct_type =
4767 parse_inner_declarator(&env, (flags & DECL_MAY_BE_ABSTRACT) != 0);
4769 construct_declarator_type(construct_type, specifiers->type);
4770 type_t *type = skip_typeref(orig_type);
4772 if (construct_type != NULL) {
4773 obstack_free(&temp_obst, construct_type);
4777 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4778 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4779 entity->base.symbol = env.symbol;
4780 entity->base.source_position = env.source_position;
4781 entity->typedefe.type = orig_type;
4783 if (anonymous_entity != NULL) {
4784 if (is_type_compound(type)) {
4785 assert(anonymous_entity->compound.alias == NULL);
4786 assert(anonymous_entity->kind == ENTITY_STRUCT ||
4787 anonymous_entity->kind == ENTITY_UNION);
4788 anonymous_entity->compound.alias = entity;
4789 anonymous_entity = NULL;
4790 } else if (is_type_enum(type)) {
4791 assert(anonymous_entity->enume.alias == NULL);
4792 assert(anonymous_entity->kind == ENTITY_ENUM);
4793 anonymous_entity->enume.alias = entity;
4794 anonymous_entity = NULL;
4798 /* create a declaration type entity */
4799 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
4800 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4802 if (env.symbol != NULL) {
4803 if (specifiers->is_inline && is_type_valid(type)) {
4804 errorf(&env.source_position,
4805 "compound member '%Y' declared 'inline'", env.symbol);
4808 if (specifiers->thread_local ||
4809 specifiers->storage_class != STORAGE_CLASS_NONE) {
4810 errorf(&env.source_position,
4811 "compound member '%Y' must have no storage class",
4815 } else if (flags & DECL_IS_PARAMETER) {
4816 orig_type = semantic_parameter(&env.source_position, orig_type,
4817 specifiers, env.symbol);
4819 entity = allocate_entity_zero(ENTITY_PARAMETER);
4820 } else if (is_type_function(type)) {
4821 entity = allocate_entity_zero(ENTITY_FUNCTION);
4823 entity->function.is_inline = specifiers->is_inline;
4824 entity->function.parameters = env.parameters;
4826 if (env.symbol != NULL) {
4827 if (specifiers->thread_local || (
4828 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4829 specifiers->storage_class != STORAGE_CLASS_NONE &&
4830 specifiers->storage_class != STORAGE_CLASS_STATIC
4832 errorf(&env.source_position,
4833 "invalid storage class for function '%Y'", env.symbol);
4837 entity = allocate_entity_zero(ENTITY_VARIABLE);
4839 entity->variable.get_property_sym = specifiers->get_property_sym;
4840 entity->variable.put_property_sym = specifiers->put_property_sym;
4842 entity->variable.thread_local = specifiers->thread_local;
4844 if (env.symbol != NULL) {
4845 if (specifiers->is_inline && is_type_valid(type)) {
4846 errorf(&env.source_position,
4847 "variable '%Y' declared 'inline'", env.symbol);
4850 bool invalid_storage_class = false;
4851 if (current_scope == file_scope) {
4852 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4853 specifiers->storage_class != STORAGE_CLASS_NONE &&
4854 specifiers->storage_class != STORAGE_CLASS_STATIC) {
4855 invalid_storage_class = true;
4858 if (specifiers->thread_local &&
4859 specifiers->storage_class == STORAGE_CLASS_NONE) {
4860 invalid_storage_class = true;
4863 if (invalid_storage_class) {
4864 errorf(&env.source_position,
4865 "invalid storage class for variable '%Y'", env.symbol);
4870 if (env.symbol != NULL) {
4871 entity->base.symbol = env.symbol;
4872 entity->base.source_position = env.source_position;
4874 entity->base.source_position = specifiers->source_position;
4876 entity->base.namespc = NAMESPACE_NORMAL;
4877 entity->declaration.type = orig_type;
4878 entity->declaration.modifiers = env.modifiers;
4879 entity->declaration.deprecated_string = specifiers->deprecated_string;
4881 storage_class_t storage_class = specifiers->storage_class;
4882 entity->declaration.declared_storage_class = storage_class;
4884 if (storage_class == STORAGE_CLASS_NONE && current_scope != file_scope)
4885 storage_class = STORAGE_CLASS_AUTO;
4886 entity->declaration.storage_class = storage_class;
4889 parse_declaration_attributes(entity);
4894 static type_t *parse_abstract_declarator(type_t *base_type)
4896 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4898 type_t *result = construct_declarator_type(construct_type, base_type);
4899 if (construct_type != NULL) {
4900 obstack_free(&temp_obst, construct_type);
4907 * Check if the declaration of main is suspicious. main should be a
4908 * function with external linkage, returning int, taking either zero
4909 * arguments, two, or three arguments of appropriate types, ie.
4911 * int main([ int argc, char **argv [, char **env ] ]).
4913 * @param decl the declaration to check
4914 * @param type the function type of the declaration
4916 static void check_type_of_main(const entity_t *entity)
4918 const source_position_t *pos = &entity->base.source_position;
4919 if (entity->kind != ENTITY_FUNCTION) {
4920 warningf(pos, "'main' is not a function");
4924 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4925 warningf(pos, "'main' is normally a non-static function");
4928 type_t *type = skip_typeref(entity->declaration.type);
4929 assert(is_type_function(type));
4931 function_type_t *func_type = &type->function;
4932 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4933 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4934 func_type->return_type);
4936 const function_parameter_t *parm = func_type->parameters;
4938 type_t *const first_type = parm->type;
4939 if (!types_compatible(skip_typeref(first_type), type_int)) {
4941 "first argument of 'main' should be 'int', but is '%T'",
4946 type_t *const second_type = parm->type;
4947 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4948 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4952 type_t *const third_type = parm->type;
4953 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4954 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4958 goto warn_arg_count;
4962 warningf(pos, "'main' takes only zero, two or three arguments");
4968 * Check if a symbol is the equal to "main".
4970 static bool is_sym_main(const symbol_t *const sym)
4972 return strcmp(sym->string, "main") == 0;
4975 static void error_redefined_as_different_kind(const source_position_t *pos,
4976 const entity_t *old, entity_kind_t new_kind)
4978 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4979 get_entity_kind_name(old->kind), old->base.symbol,
4980 get_entity_kind_name(new_kind), &old->base.source_position);
4983 static bool is_error_entity(entity_t *const ent)
4985 if (is_declaration(ent)) {
4986 return is_type_valid(skip_typeref(ent->declaration.type));
4987 } else if (ent->kind == ENTITY_TYPEDEF) {
4988 return is_type_valid(skip_typeref(ent->typedefe.type));
4994 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4995 * for various problems that occur for multiple definitions
4997 static entity_t *record_entity(entity_t *entity, const bool is_definition)
4999 const symbol_t *const symbol = entity->base.symbol;
5000 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
5001 const source_position_t *pos = &entity->base.source_position;
5003 /* can happen in error cases */
5007 entity_t *const previous_entity = get_entity(symbol, namespc);
5008 /* pushing the same entity twice will break the stack structure */
5009 assert(previous_entity != entity);
5011 if (entity->kind == ENTITY_FUNCTION) {
5012 type_t *const orig_type = entity->declaration.type;
5013 type_t *const type = skip_typeref(orig_type);
5015 assert(is_type_function(type));
5016 if (type->function.unspecified_parameters &&
5017 warning.strict_prototypes &&
5018 previous_entity == NULL) {
5019 warningf(pos, "function declaration '%#T' is not a prototype",
5023 if (warning.main && current_scope == file_scope
5024 && is_sym_main(symbol)) {
5025 check_type_of_main(entity);
5029 if (is_declaration(entity) &&
5030 warning.nested_externs &&
5031 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
5032 current_scope != file_scope) {
5033 warningf(pos, "nested extern declaration of '%#T'",
5034 entity->declaration.type, symbol);
5037 if (previous_entity != NULL) {
5038 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
5039 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
5040 assert(previous_entity->kind == ENTITY_PARAMETER);
5042 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
5043 entity->declaration.type, symbol,
5044 previous_entity->declaration.type, symbol,
5045 &previous_entity->base.source_position);
5049 if (previous_entity->base.parent_scope == current_scope) {
5050 if (previous_entity->kind != entity->kind) {
5051 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
5052 error_redefined_as_different_kind(pos, previous_entity,
5057 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
5058 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
5059 symbol, &previous_entity->base.source_position);
5062 if (previous_entity->kind == ENTITY_TYPEDEF) {
5063 /* TODO: C++ allows this for exactly the same type */
5064 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
5065 symbol, &previous_entity->base.source_position);
5069 /* at this point we should have only VARIABLES or FUNCTIONS */
5070 assert(is_declaration(previous_entity) && is_declaration(entity));
5072 declaration_t *const prev_decl = &previous_entity->declaration;
5073 declaration_t *const decl = &entity->declaration;
5075 /* can happen for K&R style declarations */
5076 if (prev_decl->type == NULL &&
5077 previous_entity->kind == ENTITY_PARAMETER &&
5078 entity->kind == ENTITY_PARAMETER) {
5079 prev_decl->type = decl->type;
5080 prev_decl->storage_class = decl->storage_class;
5081 prev_decl->declared_storage_class = decl->declared_storage_class;
5082 prev_decl->modifiers = decl->modifiers;
5083 prev_decl->deprecated_string = decl->deprecated_string;
5084 return previous_entity;
5087 type_t *const orig_type = decl->type;
5088 assert(orig_type != NULL);
5089 type_t *const type = skip_typeref(orig_type);
5090 type_t *const prev_type = skip_typeref(prev_decl->type);
5092 if (!types_compatible(type, prev_type)) {
5094 "declaration '%#T' is incompatible with '%#T' (declared %P)",
5095 orig_type, symbol, prev_decl->type, symbol,
5096 &previous_entity->base.source_position);
5098 unsigned old_storage_class = prev_decl->storage_class;
5099 if (warning.redundant_decls &&
5102 !(prev_decl->modifiers & DM_USED) &&
5103 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
5104 warningf(&previous_entity->base.source_position,
5105 "unnecessary static forward declaration for '%#T'",
5106 prev_decl->type, symbol);
5109 storage_class_t new_storage_class = decl->storage_class;
5111 /* pretend no storage class means extern for function
5112 * declarations (except if the previous declaration is neither
5113 * none nor extern) */
5114 if (entity->kind == ENTITY_FUNCTION) {
5115 /* the previous declaration could have unspecified parameters or
5116 * be a typedef, so use the new type */
5117 if (prev_type->function.unspecified_parameters || is_definition)
5118 prev_decl->type = type;
5120 switch (old_storage_class) {
5121 case STORAGE_CLASS_NONE:
5122 old_storage_class = STORAGE_CLASS_EXTERN;
5125 case STORAGE_CLASS_EXTERN:
5126 if (is_definition) {
5127 if (warning.missing_prototypes &&
5128 prev_type->function.unspecified_parameters &&
5129 !is_sym_main(symbol)) {
5130 warningf(pos, "no previous prototype for '%#T'",
5133 } else if (new_storage_class == STORAGE_CLASS_NONE) {
5134 new_storage_class = STORAGE_CLASS_EXTERN;
5141 } else if (is_type_incomplete(prev_type)) {
5142 prev_decl->type = type;
5145 if (old_storage_class == STORAGE_CLASS_EXTERN &&
5146 new_storage_class == STORAGE_CLASS_EXTERN) {
5147 warn_redundant_declaration:
5148 if (!is_definition &&
5149 warning.redundant_decls &&
5150 is_type_valid(prev_type) &&
5151 strcmp(previous_entity->base.source_position.input_name,
5152 "<builtin>") != 0) {
5154 "redundant declaration for '%Y' (declared %P)",
5155 symbol, &previous_entity->base.source_position);
5157 } else if (current_function == NULL) {
5158 if (old_storage_class != STORAGE_CLASS_STATIC &&
5159 new_storage_class == STORAGE_CLASS_STATIC) {
5161 "static declaration of '%Y' follows non-static declaration (declared %P)",
5162 symbol, &previous_entity->base.source_position);
5163 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
5164 prev_decl->storage_class = STORAGE_CLASS_NONE;
5165 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
5167 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
5169 goto error_redeclaration;
5170 goto warn_redundant_declaration;
5172 } else if (is_type_valid(prev_type)) {
5173 if (old_storage_class == new_storage_class) {
5174 error_redeclaration:
5175 errorf(pos, "redeclaration of '%Y' (declared %P)",
5176 symbol, &previous_entity->base.source_position);
5179 "redeclaration of '%Y' with different linkage (declared %P)",
5180 symbol, &previous_entity->base.source_position);
5185 prev_decl->modifiers |= decl->modifiers;
5186 if (entity->kind == ENTITY_FUNCTION) {
5187 previous_entity->function.is_inline |= entity->function.is_inline;
5189 return previous_entity;
5192 if (warning.shadow) {
5193 warningf(pos, "%s '%Y' shadows %s (declared %P)",
5194 get_entity_kind_name(entity->kind), symbol,
5195 get_entity_kind_name(previous_entity->kind),
5196 &previous_entity->base.source_position);
5200 if (entity->kind == ENTITY_FUNCTION) {
5201 if (is_definition &&
5202 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
5203 if (warning.missing_prototypes && !is_sym_main(symbol)) {
5204 warningf(pos, "no previous prototype for '%#T'",
5205 entity->declaration.type, symbol);
5206 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
5207 warningf(pos, "no previous declaration for '%#T'",
5208 entity->declaration.type, symbol);
5211 } else if (warning.missing_declarations &&
5212 entity->kind == ENTITY_VARIABLE &&
5213 current_scope == file_scope) {
5214 declaration_t *declaration = &entity->declaration;
5215 if (declaration->storage_class == STORAGE_CLASS_NONE) {
5216 warningf(pos, "no previous declaration for '%#T'",
5217 declaration->type, symbol);
5222 assert(entity->base.parent_scope == NULL);
5223 assert(current_scope != NULL);
5225 entity->base.parent_scope = current_scope;
5226 entity->base.namespc = NAMESPACE_NORMAL;
5227 environment_push(entity);
5228 append_entity(current_scope, entity);
5233 static void parser_error_multiple_definition(entity_t *entity,
5234 const source_position_t *source_position)
5236 errorf(source_position, "multiple definition of '%Y' (declared %P)",
5237 entity->base.symbol, &entity->base.source_position);
5240 static bool is_declaration_specifier(const token_t *token,
5241 bool only_specifiers_qualifiers)
5243 switch (token->type) {
5248 return is_typedef_symbol(token->v.symbol);
5250 case T___extension__:
5252 return !only_specifiers_qualifiers;
5259 static void parse_init_declarator_rest(entity_t *entity)
5261 assert(is_declaration(entity));
5262 declaration_t *const declaration = &entity->declaration;
5266 type_t *orig_type = declaration->type;
5267 type_t *type = skip_typeref(orig_type);
5269 if (entity->kind == ENTITY_VARIABLE
5270 && entity->variable.initializer != NULL) {
5271 parser_error_multiple_definition(entity, HERE);
5274 bool must_be_constant = false;
5275 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
5276 entity->base.parent_scope == file_scope) {
5277 must_be_constant = true;
5280 if (is_type_function(type)) {
5281 errorf(&entity->base.source_position,
5282 "function '%#T' is initialized like a variable",
5283 orig_type, entity->base.symbol);
5284 orig_type = type_error_type;
5287 parse_initializer_env_t env;
5288 env.type = orig_type;
5289 env.must_be_constant = must_be_constant;
5290 env.entity = entity;
5291 current_init_decl = entity;
5293 initializer_t *initializer = parse_initializer(&env);
5294 current_init_decl = NULL;
5296 if (entity->kind == ENTITY_VARIABLE) {
5297 /* §6.7.5:22 array initializers for arrays with unknown size
5298 * determine the array type size */
5299 declaration->type = env.type;
5300 entity->variable.initializer = initializer;
5304 /* parse rest of a declaration without any declarator */
5305 static void parse_anonymous_declaration_rest(
5306 const declaration_specifiers_t *specifiers)
5309 anonymous_entity = NULL;
5311 if (warning.other) {
5312 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
5313 specifiers->thread_local) {
5314 warningf(&specifiers->source_position,
5315 "useless storage class in empty declaration");
5318 type_t *type = specifiers->type;
5319 switch (type->kind) {
5320 case TYPE_COMPOUND_STRUCT:
5321 case TYPE_COMPOUND_UNION: {
5322 if (type->compound.compound->base.symbol == NULL) {
5323 warningf(&specifiers->source_position,
5324 "unnamed struct/union that defines no instances");
5333 warningf(&specifiers->source_position, "empty declaration");
5339 static void check_variable_type_complete(entity_t *ent)
5341 if (ent->kind != ENTITY_VARIABLE)
5344 /* §6.7:7 If an identifier for an object is declared with no linkage, the
5345 * type for the object shall be complete [...] */
5346 declaration_t *decl = &ent->declaration;
5347 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
5348 decl->storage_class == STORAGE_CLASS_STATIC)
5351 type_t *const orig_type = decl->type;
5352 type_t *const type = skip_typeref(orig_type);
5353 if (!is_type_incomplete(type))
5356 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
5357 * are given length one. */
5358 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
5359 ARR_APP1(declaration_t*, incomplete_arrays, decl);
5363 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
5364 orig_type, ent->base.symbol);
5368 static void parse_declaration_rest(entity_t *ndeclaration,
5369 const declaration_specifiers_t *specifiers,
5370 parsed_declaration_func finished_declaration,
5371 declarator_flags_t flags)
5373 add_anchor_token(';');
5374 add_anchor_token(',');
5376 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
5378 if (token.type == '=') {
5379 parse_init_declarator_rest(entity);
5380 } else if (entity->kind == ENTITY_VARIABLE) {
5381 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
5382 * [...] where the extern specifier is explicitly used. */
5383 declaration_t *decl = &entity->declaration;
5384 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
5385 type_t *type = decl->type;
5386 if (is_type_reference(skip_typeref(type))) {
5387 errorf(&entity->base.source_position,
5388 "reference '%#T' must be initialized",
5389 type, entity->base.symbol);
5394 check_variable_type_complete(entity);
5396 if (token.type != ',')
5400 add_anchor_token('=');
5401 ndeclaration = parse_declarator(specifiers, flags);
5402 rem_anchor_token('=');
5404 expect(';', end_error);
5407 anonymous_entity = NULL;
5408 rem_anchor_token(';');
5409 rem_anchor_token(',');
5412 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
5414 symbol_t *symbol = entity->base.symbol;
5415 if (symbol == NULL) {
5416 errorf(HERE, "anonymous declaration not valid as function parameter");
5420 assert(entity->base.namespc == NAMESPACE_NORMAL);
5421 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
5422 if (previous_entity == NULL
5423 || previous_entity->base.parent_scope != current_scope) {
5424 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
5429 if (is_definition) {
5430 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
5433 return record_entity(entity, false);
5436 static void parse_declaration(parsed_declaration_func finished_declaration,
5437 declarator_flags_t flags)
5439 declaration_specifiers_t specifiers;
5440 memset(&specifiers, 0, sizeof(specifiers));
5442 add_anchor_token(';');
5443 parse_declaration_specifiers(&specifiers);
5444 rem_anchor_token(';');
5446 if (token.type == ';') {
5447 parse_anonymous_declaration_rest(&specifiers);
5449 entity_t *entity = parse_declarator(&specifiers, flags);
5450 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
5454 static type_t *get_default_promoted_type(type_t *orig_type)
5456 type_t *result = orig_type;
5458 type_t *type = skip_typeref(orig_type);
5459 if (is_type_integer(type)) {
5460 result = promote_integer(type);
5461 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
5462 result = type_double;
5468 static void parse_kr_declaration_list(entity_t *entity)
5470 if (entity->kind != ENTITY_FUNCTION)
5473 type_t *type = skip_typeref(entity->declaration.type);
5474 assert(is_type_function(type));
5475 if (!type->function.kr_style_parameters)
5479 add_anchor_token('{');
5481 /* push function parameters */
5482 size_t const top = environment_top();
5483 scope_t *old_scope = scope_push(&entity->function.parameters);
5485 entity_t *parameter = entity->function.parameters.entities;
5486 for ( ; parameter != NULL; parameter = parameter->base.next) {
5487 assert(parameter->base.parent_scope == NULL);
5488 parameter->base.parent_scope = current_scope;
5489 environment_push(parameter);
5492 /* parse declaration list */
5494 switch (token.type) {
5496 case T___extension__:
5497 /* This covers symbols, which are no type, too, and results in
5498 * better error messages. The typical cases are misspelled type
5499 * names and missing includes. */
5501 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
5509 /* pop function parameters */
5510 assert(current_scope == &entity->function.parameters);
5511 scope_pop(old_scope);
5512 environment_pop_to(top);
5514 /* update function type */
5515 type_t *new_type = duplicate_type(type);
5517 function_parameter_t *parameters = NULL;
5518 function_parameter_t **anchor = ¶meters;
5520 parameter = entity->function.parameters.entities;
5521 for (; parameter != NULL; parameter = parameter->base.next) {
5522 if (parameter->kind != ENTITY_PARAMETER)
5525 type_t *parameter_type = parameter->declaration.type;
5526 if (parameter_type == NULL) {
5528 errorf(HERE, "no type specified for function parameter '%Y'",
5529 parameter->base.symbol);
5531 if (warning.implicit_int) {
5532 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5533 parameter->base.symbol);
5535 parameter_type = type_int;
5536 parameter->declaration.type = parameter_type;
5540 semantic_parameter_incomplete(parameter);
5541 parameter_type = parameter->declaration.type;
5544 * we need the default promoted types for the function type
5546 parameter_type = get_default_promoted_type(parameter_type);
5548 function_parameter_t *const parameter =
5549 allocate_parameter(parameter_type);
5551 *anchor = parameter;
5552 anchor = ¶meter->next;
5555 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
5557 new_type->function.parameters = parameters;
5558 new_type->function.unspecified_parameters = true;
5560 new_type = identify_new_type(new_type);
5562 entity->declaration.type = new_type;
5564 rem_anchor_token('{');
5567 static bool first_err = true;
5570 * When called with first_err set, prints the name of the current function,
5573 static void print_in_function(void)
5577 diagnosticf("%s: In function '%Y':\n",
5578 current_function->base.base.source_position.input_name,
5579 current_function->base.base.symbol);
5584 * Check if all labels are defined in the current function.
5585 * Check if all labels are used in the current function.
5587 static void check_labels(void)
5589 for (const goto_statement_t *goto_statement = goto_first;
5590 goto_statement != NULL;
5591 goto_statement = goto_statement->next) {
5592 /* skip computed gotos */
5593 if (goto_statement->expression != NULL)
5596 label_t *label = goto_statement->label;
5599 if (label->base.source_position.input_name == NULL) {
5600 print_in_function();
5601 errorf(&goto_statement->base.source_position,
5602 "label '%Y' used but not defined", label->base.symbol);
5606 if (warning.unused_label) {
5607 for (const label_statement_t *label_statement = label_first;
5608 label_statement != NULL;
5609 label_statement = label_statement->next) {
5610 label_t *label = label_statement->label;
5612 if (! label->used) {
5613 print_in_function();
5614 warningf(&label_statement->base.source_position,
5615 "label '%Y' defined but not used", label->base.symbol);
5621 static void warn_unused_entity(entity_t *entity, entity_t *last)
5623 entity_t const *const end = last != NULL ? last->base.next : NULL;
5624 for (; entity != end; entity = entity->base.next) {
5625 if (!is_declaration(entity))
5628 declaration_t *declaration = &entity->declaration;
5629 if (declaration->implicit)
5632 if (!declaration->used) {
5633 print_in_function();
5634 const char *what = get_entity_kind_name(entity->kind);
5635 warningf(&entity->base.source_position, "%s '%Y' is unused",
5636 what, entity->base.symbol);
5637 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
5638 print_in_function();
5639 const char *what = get_entity_kind_name(entity->kind);
5640 warningf(&entity->base.source_position, "%s '%Y' is never read",
5641 what, entity->base.symbol);
5646 static void check_unused_variables(statement_t *const stmt, void *const env)
5650 switch (stmt->kind) {
5651 case STATEMENT_DECLARATION: {
5652 declaration_statement_t const *const decls = &stmt->declaration;
5653 warn_unused_entity(decls->declarations_begin,
5654 decls->declarations_end);
5659 warn_unused_entity(stmt->fors.scope.entities, NULL);
5668 * Check declarations of current_function for unused entities.
5670 static void check_declarations(void)
5672 if (warning.unused_parameter) {
5673 const scope_t *scope = ¤t_function->parameters;
5675 /* do not issue unused warnings for main */
5676 if (!is_sym_main(current_function->base.base.symbol)) {
5677 warn_unused_entity(scope->entities, NULL);
5680 if (warning.unused_variable) {
5681 walk_statements(current_function->statement, check_unused_variables,
5686 static int determine_truth(expression_t const* const cond)
5689 !is_constant_expression(cond) ? 0 :
5690 fold_constant(cond) != 0 ? 1 :
5694 static void check_reachable(statement_t *);
5695 static bool reaches_end;
5697 static bool expression_returns(expression_t const *const expr)
5699 switch (expr->kind) {
5701 expression_t const *const func = expr->call.function;
5702 if (func->kind == EXPR_REFERENCE) {
5703 entity_t *entity = func->reference.entity;
5704 if (entity->kind == ENTITY_FUNCTION
5705 && entity->declaration.modifiers & DM_NORETURN)
5709 if (!expression_returns(func))
5712 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5713 if (!expression_returns(arg->expression))
5720 case EXPR_REFERENCE:
5721 case EXPR_REFERENCE_ENUM_VALUE:
5723 case EXPR_CHARACTER_CONSTANT:
5724 case EXPR_WIDE_CHARACTER_CONSTANT:
5725 case EXPR_STRING_LITERAL:
5726 case EXPR_WIDE_STRING_LITERAL:
5727 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5728 case EXPR_LABEL_ADDRESS:
5729 case EXPR_CLASSIFY_TYPE:
5730 case EXPR_SIZEOF: // TODO handle obscure VLA case
5733 case EXPR_BUILTIN_CONSTANT_P:
5734 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
5739 case EXPR_STATEMENT: {
5740 bool old_reaches_end = reaches_end;
5741 reaches_end = false;
5742 check_reachable(expr->statement.statement);
5743 bool returns = reaches_end;
5744 reaches_end = old_reaches_end;
5748 case EXPR_CONDITIONAL:
5749 // TODO handle constant expression
5751 if (!expression_returns(expr->conditional.condition))
5754 if (expr->conditional.true_expression != NULL
5755 && expression_returns(expr->conditional.true_expression))
5758 return expression_returns(expr->conditional.false_expression);
5761 return expression_returns(expr->select.compound);
5763 case EXPR_ARRAY_ACCESS:
5765 expression_returns(expr->array_access.array_ref) &&
5766 expression_returns(expr->array_access.index);
5769 return expression_returns(expr->va_starte.ap);
5772 return expression_returns(expr->va_arge.ap);
5774 EXPR_UNARY_CASES_MANDATORY
5775 return expression_returns(expr->unary.value);
5777 case EXPR_UNARY_THROW:
5781 // TODO handle constant lhs of && and ||
5783 expression_returns(expr->binary.left) &&
5784 expression_returns(expr->binary.right);
5790 panic("unhandled expression");
5793 static bool initializer_returns(initializer_t const *const init)
5795 switch (init->kind) {
5796 case INITIALIZER_VALUE:
5797 return expression_returns(init->value.value);
5799 case INITIALIZER_LIST: {
5800 initializer_t * const* i = init->list.initializers;
5801 initializer_t * const* const end = i + init->list.len;
5802 bool returns = true;
5803 for (; i != end; ++i) {
5804 if (!initializer_returns(*i))
5810 case INITIALIZER_STRING:
5811 case INITIALIZER_WIDE_STRING:
5812 case INITIALIZER_DESIGNATOR: // designators have no payload
5815 panic("unhandled initializer");
5818 static bool noreturn_candidate;
5820 static void check_reachable(statement_t *const stmt)
5822 if (stmt->base.reachable)
5824 if (stmt->kind != STATEMENT_DO_WHILE)
5825 stmt->base.reachable = true;
5827 statement_t *last = stmt;
5829 switch (stmt->kind) {
5830 case STATEMENT_INVALID:
5831 case STATEMENT_EMPTY:
5833 next = stmt->base.next;
5836 case STATEMENT_DECLARATION: {
5837 declaration_statement_t const *const decl = &stmt->declaration;
5838 entity_t const * ent = decl->declarations_begin;
5839 entity_t const *const last = decl->declarations_end;
5841 for (;; ent = ent->base.next) {
5842 if (ent->kind == ENTITY_VARIABLE &&
5843 ent->variable.initializer != NULL &&
5844 !initializer_returns(ent->variable.initializer)) {
5851 next = stmt->base.next;
5855 case STATEMENT_COMPOUND:
5856 next = stmt->compound.statements;
5858 next = stmt->base.next;
5861 case STATEMENT_RETURN: {
5862 expression_t const *const val = stmt->returns.value;
5863 if (val == NULL || expression_returns(val))
5864 noreturn_candidate = false;
5868 case STATEMENT_IF: {
5869 if_statement_t const *const ifs = &stmt->ifs;
5870 expression_t const *const cond = ifs->condition;
5872 if (!expression_returns(cond))
5875 int const val = determine_truth(cond);
5878 check_reachable(ifs->true_statement);
5883 if (ifs->false_statement != NULL) {
5884 check_reachable(ifs->false_statement);
5888 next = stmt->base.next;
5892 case STATEMENT_SWITCH: {
5893 switch_statement_t const *const switchs = &stmt->switchs;
5894 expression_t const *const expr = switchs->expression;
5896 if (!expression_returns(expr))
5899 if (is_constant_expression(expr)) {
5900 long const val = fold_constant(expr);
5901 case_label_statement_t * defaults = NULL;
5902 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5903 if (i->expression == NULL) {
5908 if (i->first_case <= val && val <= i->last_case) {
5909 check_reachable((statement_t*)i);
5914 if (defaults != NULL) {
5915 check_reachable((statement_t*)defaults);
5919 bool has_default = false;
5920 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5921 if (i->expression == NULL)
5924 check_reachable((statement_t*)i);
5931 next = stmt->base.next;
5935 case STATEMENT_EXPRESSION: {
5936 /* Check for noreturn function call */
5937 expression_t const *const expr = stmt->expression.expression;
5938 if (!expression_returns(expr))
5941 next = stmt->base.next;
5945 case STATEMENT_CONTINUE: {
5946 statement_t *parent = stmt;
5948 parent = parent->base.parent;
5949 if (parent == NULL) /* continue not within loop */
5953 switch (parent->kind) {
5954 case STATEMENT_WHILE: goto continue_while;
5955 case STATEMENT_DO_WHILE: goto continue_do_while;
5956 case STATEMENT_FOR: goto continue_for;
5963 case STATEMENT_BREAK: {
5964 statement_t *parent = stmt;
5966 parent = parent->base.parent;
5967 if (parent == NULL) /* break not within loop/switch */
5970 switch (parent->kind) {
5971 case STATEMENT_SWITCH:
5972 case STATEMENT_WHILE:
5973 case STATEMENT_DO_WHILE:
5976 next = parent->base.next;
5977 goto found_break_parent;
5986 case STATEMENT_GOTO:
5987 if (stmt->gotos.expression) {
5988 if (!expression_returns(stmt->gotos.expression))
5991 statement_t *parent = stmt->base.parent;
5992 if (parent == NULL) /* top level goto */
5996 next = stmt->gotos.label->statement;
5997 if (next == NULL) /* missing label */
6002 case STATEMENT_LABEL:
6003 next = stmt->label.statement;
6006 case STATEMENT_CASE_LABEL:
6007 next = stmt->case_label.statement;
6010 case STATEMENT_WHILE: {
6011 while_statement_t const *const whiles = &stmt->whiles;
6012 expression_t const *const cond = whiles->condition;
6014 if (!expression_returns(cond))
6017 int const val = determine_truth(cond);
6020 check_reachable(whiles->body);
6025 next = stmt->base.next;
6029 case STATEMENT_DO_WHILE:
6030 next = stmt->do_while.body;
6033 case STATEMENT_FOR: {
6034 for_statement_t *const fors = &stmt->fors;
6036 if (fors->condition_reachable)
6038 fors->condition_reachable = true;
6040 expression_t const *const cond = fors->condition;
6045 } else if (expression_returns(cond)) {
6046 val = determine_truth(cond);
6052 check_reachable(fors->body);
6057 next = stmt->base.next;
6061 case STATEMENT_MS_TRY: {
6062 ms_try_statement_t const *const ms_try = &stmt->ms_try;
6063 check_reachable(ms_try->try_statement);
6064 next = ms_try->final_statement;
6068 case STATEMENT_LEAVE: {
6069 statement_t *parent = stmt;
6071 parent = parent->base.parent;
6072 if (parent == NULL) /* __leave not within __try */
6075 if (parent->kind == STATEMENT_MS_TRY) {
6077 next = parent->ms_try.final_statement;
6085 panic("invalid statement kind");
6088 while (next == NULL) {
6089 next = last->base.parent;
6091 noreturn_candidate = false;
6093 type_t *const type = skip_typeref(current_function->base.type);
6094 assert(is_type_function(type));
6095 type_t *const ret = skip_typeref(type->function.return_type);
6096 if (warning.return_type &&
6097 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
6098 is_type_valid(ret) &&
6099 !is_sym_main(current_function->base.base.symbol)) {
6100 warningf(&stmt->base.source_position,
6101 "control reaches end of non-void function");
6106 switch (next->kind) {
6107 case STATEMENT_INVALID:
6108 case STATEMENT_EMPTY:
6109 case STATEMENT_DECLARATION:
6110 case STATEMENT_EXPRESSION:
6112 case STATEMENT_RETURN:
6113 case STATEMENT_CONTINUE:
6114 case STATEMENT_BREAK:
6115 case STATEMENT_GOTO:
6116 case STATEMENT_LEAVE:
6117 panic("invalid control flow in function");
6119 case STATEMENT_COMPOUND:
6120 if (next->compound.stmt_expr) {
6126 case STATEMENT_SWITCH:
6127 case STATEMENT_LABEL:
6128 case STATEMENT_CASE_LABEL:
6130 next = next->base.next;
6133 case STATEMENT_WHILE: {
6135 if (next->base.reachable)
6137 next->base.reachable = true;
6139 while_statement_t const *const whiles = &next->whiles;
6140 expression_t const *const cond = whiles->condition;
6142 if (!expression_returns(cond))
6145 int const val = determine_truth(cond);
6148 check_reachable(whiles->body);
6154 next = next->base.next;
6158 case STATEMENT_DO_WHILE: {
6160 if (next->base.reachable)
6162 next->base.reachable = true;
6164 do_while_statement_t const *const dw = &next->do_while;
6165 expression_t const *const cond = dw->condition;
6167 if (!expression_returns(cond))
6170 int const val = determine_truth(cond);
6173 check_reachable(dw->body);
6179 next = next->base.next;
6183 case STATEMENT_FOR: {
6185 for_statement_t *const fors = &next->fors;
6187 fors->step_reachable = true;
6189 if (fors->condition_reachable)
6191 fors->condition_reachable = true;
6193 expression_t const *const cond = fors->condition;
6198 } else if (expression_returns(cond)) {
6199 val = determine_truth(cond);
6205 check_reachable(fors->body);
6211 next = next->base.next;
6215 case STATEMENT_MS_TRY:
6217 next = next->ms_try.final_statement;
6222 check_reachable(next);
6225 static void check_unreachable(statement_t* const stmt, void *const env)
6229 switch (stmt->kind) {
6230 case STATEMENT_DO_WHILE:
6231 if (!stmt->base.reachable) {
6232 expression_t const *const cond = stmt->do_while.condition;
6233 if (determine_truth(cond) >= 0) {
6234 warningf(&cond->base.source_position,
6235 "condition of do-while-loop is unreachable");
6240 case STATEMENT_FOR: {
6241 for_statement_t const* const fors = &stmt->fors;
6243 // if init and step are unreachable, cond is unreachable, too
6244 if (!stmt->base.reachable && !fors->step_reachable) {
6245 warningf(&stmt->base.source_position, "statement is unreachable");
6247 if (!stmt->base.reachable && fors->initialisation != NULL) {
6248 warningf(&fors->initialisation->base.source_position,
6249 "initialisation of for-statement is unreachable");
6252 if (!fors->condition_reachable && fors->condition != NULL) {
6253 warningf(&fors->condition->base.source_position,
6254 "condition of for-statement is unreachable");
6257 if (!fors->step_reachable && fors->step != NULL) {
6258 warningf(&fors->step->base.source_position,
6259 "step of for-statement is unreachable");
6265 case STATEMENT_COMPOUND:
6266 if (stmt->compound.statements != NULL)
6268 goto warn_unreachable;
6270 case STATEMENT_DECLARATION: {
6271 /* Only warn if there is at least one declarator with an initializer.
6272 * This typically occurs in switch statements. */
6273 declaration_statement_t const *const decl = &stmt->declaration;
6274 entity_t const * ent = decl->declarations_begin;
6275 entity_t const *const last = decl->declarations_end;
6277 for (;; ent = ent->base.next) {
6278 if (ent->kind == ENTITY_VARIABLE &&
6279 ent->variable.initializer != NULL) {
6280 goto warn_unreachable;
6290 if (!stmt->base.reachable)
6291 warningf(&stmt->base.source_position, "statement is unreachable");
6296 static void parse_external_declaration(void)
6298 /* function-definitions and declarations both start with declaration
6300 declaration_specifiers_t specifiers;
6301 memset(&specifiers, 0, sizeof(specifiers));
6303 add_anchor_token(';');
6304 parse_declaration_specifiers(&specifiers);
6305 rem_anchor_token(';');
6307 /* must be a declaration */
6308 if (token.type == ';') {
6309 parse_anonymous_declaration_rest(&specifiers);
6313 add_anchor_token(',');
6314 add_anchor_token('=');
6315 add_anchor_token(';');
6316 add_anchor_token('{');
6318 /* declarator is common to both function-definitions and declarations */
6319 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
6321 rem_anchor_token('{');
6322 rem_anchor_token(';');
6323 rem_anchor_token('=');
6324 rem_anchor_token(',');
6326 /* must be a declaration */
6327 switch (token.type) {
6331 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
6336 /* must be a function definition */
6337 parse_kr_declaration_list(ndeclaration);
6339 if (token.type != '{') {
6340 parse_error_expected("while parsing function definition", '{', NULL);
6341 eat_until_matching_token(';');
6345 assert(is_declaration(ndeclaration));
6346 type_t *const orig_type = ndeclaration->declaration.type;
6347 type_t * type = skip_typeref(orig_type);
6349 if (!is_type_function(type)) {
6350 if (is_type_valid(type)) {
6351 errorf(HERE, "declarator '%#T' has a body but is not a function type",
6352 type, ndeclaration->base.symbol);
6356 } else if (is_typeref(orig_type)) {
6358 errorf(&ndeclaration->base.source_position,
6359 "type of function definition '%#T' is a typedef",
6360 orig_type, ndeclaration->base.symbol);
6363 if (warning.aggregate_return &&
6364 is_type_compound(skip_typeref(type->function.return_type))) {
6365 warningf(HERE, "function '%Y' returns an aggregate",
6366 ndeclaration->base.symbol);
6368 if (warning.traditional && !type->function.unspecified_parameters) {
6369 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
6370 ndeclaration->base.symbol);
6372 if (warning.old_style_definition && type->function.unspecified_parameters) {
6373 warningf(HERE, "old-style function definition '%Y'",
6374 ndeclaration->base.symbol);
6377 /* §6.7.5.3:14 a function definition with () means no
6378 * parameters (and not unspecified parameters) */
6379 if (type->function.unspecified_parameters &&
6380 type->function.parameters == NULL &&
6381 !type->function.kr_style_parameters) {
6382 type_t *copy = duplicate_type(type);
6383 copy->function.unspecified_parameters = false;
6384 type = identify_new_type(copy);
6386 ndeclaration->declaration.type = type;
6389 entity_t *const entity = record_entity(ndeclaration, true);
6390 assert(entity->kind == ENTITY_FUNCTION);
6391 assert(ndeclaration->kind == ENTITY_FUNCTION);
6393 function_t *function = &entity->function;
6394 if (ndeclaration != entity) {
6395 function->parameters = ndeclaration->function.parameters;
6397 assert(is_declaration(entity));
6398 type = skip_typeref(entity->declaration.type);
6400 /* push function parameters and switch scope */
6401 size_t const top = environment_top();
6402 scope_t *old_scope = scope_push(&function->parameters);
6404 entity_t *parameter = function->parameters.entities;
6405 for (; parameter != NULL; parameter = parameter->base.next) {
6406 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
6407 parameter->base.parent_scope = current_scope;
6409 assert(parameter->base.parent_scope == NULL
6410 || parameter->base.parent_scope == current_scope);
6411 parameter->base.parent_scope = current_scope;
6412 if (parameter->base.symbol == NULL) {
6413 errorf(¶meter->base.source_position, "parameter name omitted");
6416 environment_push(parameter);
6419 if (function->statement != NULL) {
6420 parser_error_multiple_definition(entity, HERE);
6423 /* parse function body */
6424 int label_stack_top = label_top();
6425 function_t *old_current_function = current_function;
6426 current_function = function;
6427 current_parent = NULL;
6430 goto_anchor = &goto_first;
6432 label_anchor = &label_first;
6434 statement_t *const body = parse_compound_statement(false);
6435 function->statement = body;
6438 check_declarations();
6439 if (warning.return_type ||
6440 warning.unreachable_code ||
6441 (warning.missing_noreturn
6442 && !(function->base.modifiers & DM_NORETURN))) {
6443 noreturn_candidate = true;
6444 check_reachable(body);
6445 if (warning.unreachable_code)
6446 walk_statements(body, check_unreachable, NULL);
6447 if (warning.missing_noreturn &&
6448 noreturn_candidate &&
6449 !(function->base.modifiers & DM_NORETURN)) {
6450 warningf(&body->base.source_position,
6451 "function '%#T' is candidate for attribute 'noreturn'",
6452 type, entity->base.symbol);
6456 assert(current_parent == NULL);
6457 assert(current_function == function);
6458 current_function = old_current_function;
6459 label_pop_to(label_stack_top);
6462 assert(current_scope == &function->parameters);
6463 scope_pop(old_scope);
6464 environment_pop_to(top);
6467 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
6468 source_position_t *source_position,
6469 const symbol_t *symbol)
6471 type_t *type = allocate_type_zero(TYPE_BITFIELD);
6473 type->bitfield.base_type = base_type;
6474 type->bitfield.size_expression = size;
6477 type_t *skipped_type = skip_typeref(base_type);
6478 if (!is_type_integer(skipped_type)) {
6479 errorf(HERE, "bitfield base type '%T' is not an integer type",
6483 bit_size = skipped_type->base.size * 8;
6486 if (is_constant_expression(size)) {
6487 long v = fold_constant(size);
6490 errorf(source_position, "negative width in bit-field '%Y'", symbol);
6491 } else if (v == 0) {
6492 errorf(source_position, "zero width for bit-field '%Y'", symbol);
6493 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
6494 errorf(source_position, "width of '%Y' exceeds its type", symbol);
6496 type->bitfield.bit_size = v;
6503 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
6505 entity_t *iter = compound->members.entities;
6506 for (; iter != NULL; iter = iter->base.next) {
6507 if (iter->kind != ENTITY_COMPOUND_MEMBER)
6510 if (iter->base.symbol == symbol) {
6512 } else if (iter->base.symbol == NULL) {
6513 type_t *type = skip_typeref(iter->declaration.type);
6514 if (is_type_compound(type)) {
6516 = find_compound_entry(type->compound.compound, symbol);
6527 static void parse_compound_declarators(compound_t *compound,
6528 const declaration_specifiers_t *specifiers)
6533 if (token.type == ':') {
6534 source_position_t source_position = *HERE;
6537 type_t *base_type = specifiers->type;
6538 expression_t *size = parse_constant_expression();
6540 type_t *type = make_bitfield_type(base_type, size,
6541 &source_position, sym_anonymous);
6543 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
6544 entity->base.namespc = NAMESPACE_NORMAL;
6545 entity->base.source_position = source_position;
6546 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
6547 entity->declaration.storage_class = STORAGE_CLASS_NONE;
6548 entity->declaration.modifiers = specifiers->modifiers;
6549 entity->declaration.type = type;
6550 append_entity(&compound->members, entity);
6552 entity = parse_declarator(specifiers,
6553 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
6554 if (entity->kind == ENTITY_TYPEDEF) {
6555 errorf(&entity->base.source_position,
6556 "typedef not allowed as compound member");
6558 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6560 /* make sure we don't define a symbol multiple times */
6561 symbol_t *symbol = entity->base.symbol;
6562 if (symbol != NULL) {
6563 entity_t *prev = find_compound_entry(compound, symbol);
6565 errorf(&entity->base.source_position,
6566 "multiple declarations of symbol '%Y' (declared %P)",
6567 symbol, &prev->base.source_position);
6571 if (token.type == ':') {
6572 source_position_t source_position = *HERE;
6574 expression_t *size = parse_constant_expression();
6576 type_t *type = entity->declaration.type;
6577 type_t *bitfield_type = make_bitfield_type(type, size,
6578 &source_position, entity->base.symbol);
6579 entity->declaration.type = bitfield_type;
6581 type_t *orig_type = entity->declaration.type;
6582 type_t *type = skip_typeref(orig_type);
6583 if (is_type_function(type)) {
6584 errorf(&entity->base.source_position,
6585 "compound member '%Y' must not have function type '%T'",
6586 entity->base.symbol, orig_type);
6587 } else if (is_type_incomplete(type)) {
6588 /* §6.7.2.1:16 flexible array member */
6589 if (!is_type_array(type) ||
6590 token.type != ';' ||
6591 look_ahead(1)->type != '}') {
6592 errorf(&entity->base.source_position,
6593 "compound member '%Y' has incomplete type '%T'",
6594 entity->base.symbol, orig_type);
6599 append_entity(&compound->members, entity);
6603 if (token.type != ',')
6607 expect(';', end_error);
6610 anonymous_entity = NULL;
6613 static void parse_compound_type_entries(compound_t *compound)
6616 add_anchor_token('}');
6618 while (token.type != '}') {
6619 if (token.type == T_EOF) {
6620 errorf(HERE, "EOF while parsing struct");
6623 declaration_specifiers_t specifiers;
6624 memset(&specifiers, 0, sizeof(specifiers));
6625 parse_declaration_specifiers(&specifiers);
6627 parse_compound_declarators(compound, &specifiers);
6629 rem_anchor_token('}');
6633 compound->complete = true;
6636 static type_t *parse_typename(void)
6638 declaration_specifiers_t specifiers;
6639 memset(&specifiers, 0, sizeof(specifiers));
6640 parse_declaration_specifiers(&specifiers);
6641 if (specifiers.storage_class != STORAGE_CLASS_NONE ||
6642 specifiers.thread_local) {
6643 /* TODO: improve error message, user does probably not know what a
6644 * storage class is...
6646 errorf(HERE, "typename may not have a storage class");
6649 type_t *result = parse_abstract_declarator(specifiers.type);
6657 typedef expression_t* (*parse_expression_function)(void);
6658 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6660 typedef struct expression_parser_function_t expression_parser_function_t;
6661 struct expression_parser_function_t {
6662 parse_expression_function parser;
6663 precedence_t infix_precedence;
6664 parse_expression_infix_function infix_parser;
6667 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6670 * Prints an error message if an expression was expected but not read
6672 static expression_t *expected_expression_error(void)
6674 /* skip the error message if the error token was read */
6675 if (token.type != T_ERROR) {
6676 errorf(HERE, "expected expression, got token %K", &token);
6680 return create_invalid_expression();
6684 * Parse a string constant.
6686 static expression_t *parse_string_const(void)
6689 if (token.type == T_STRING_LITERAL) {
6690 string_t res = token.v.string;
6692 while (token.type == T_STRING_LITERAL) {
6693 res = concat_strings(&res, &token.v.string);
6696 if (token.type != T_WIDE_STRING_LITERAL) {
6697 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6698 /* note: that we use type_char_ptr here, which is already the
6699 * automatic converted type. revert_automatic_type_conversion
6700 * will construct the array type */
6701 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6702 cnst->string.value = res;
6706 wres = concat_string_wide_string(&res, &token.v.wide_string);
6708 wres = token.v.wide_string;
6713 switch (token.type) {
6714 case T_WIDE_STRING_LITERAL:
6715 wres = concat_wide_strings(&wres, &token.v.wide_string);
6718 case T_STRING_LITERAL:
6719 wres = concat_wide_string_string(&wres, &token.v.string);
6723 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6724 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6725 cnst->wide_string.value = wres;
6734 * Parse a boolean constant.
6736 static expression_t *parse_bool_const(bool value)
6738 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6739 cnst->base.type = type_bool;
6740 cnst->conste.v.int_value = value;
6748 * Parse an integer constant.
6750 static expression_t *parse_int_const(void)
6752 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6753 cnst->base.type = token.datatype;
6754 cnst->conste.v.int_value = token.v.intvalue;
6762 * Parse a character constant.
6764 static expression_t *parse_character_constant(void)
6766 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6767 cnst->base.type = token.datatype;
6768 cnst->conste.v.character = token.v.string;
6770 if (cnst->conste.v.character.size != 1) {
6772 errorf(HERE, "more than 1 character in character constant");
6773 } else if (warning.multichar) {
6774 warningf(HERE, "multi-character character constant");
6783 * Parse a wide character constant.
6785 static expression_t *parse_wide_character_constant(void)
6787 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6788 cnst->base.type = token.datatype;
6789 cnst->conste.v.wide_character = token.v.wide_string;
6791 if (cnst->conste.v.wide_character.size != 1) {
6793 errorf(HERE, "more than 1 character in character constant");
6794 } else if (warning.multichar) {
6795 warningf(HERE, "multi-character character constant");
6804 * Parse a float constant.
6806 static expression_t *parse_float_const(void)
6808 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6809 cnst->base.type = token.datatype;
6810 cnst->conste.v.float_value = token.v.floatvalue;
6817 static entity_t *create_implicit_function(symbol_t *symbol,
6818 const source_position_t *source_position)
6820 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6821 ntype->function.return_type = type_int;
6822 ntype->function.unspecified_parameters = true;
6823 ntype->function.linkage = LINKAGE_C;
6824 type_t *type = identify_new_type(ntype);
6826 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6827 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6828 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6829 entity->declaration.type = type;
6830 entity->declaration.implicit = true;
6831 entity->base.symbol = symbol;
6832 entity->base.source_position = *source_position;
6834 bool strict_prototypes_old = warning.strict_prototypes;
6835 warning.strict_prototypes = false;
6836 record_entity(entity, false);
6837 warning.strict_prototypes = strict_prototypes_old;
6843 * Creates a return_type (func)(argument_type) function type if not
6846 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6847 type_t *argument_type2)
6849 function_parameter_t *const parameter2 = allocate_parameter(argument_type2);
6850 function_parameter_t *const parameter1 = allocate_parameter(argument_type1);
6851 parameter1->next = parameter2;
6853 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6854 type->function.return_type = return_type;
6855 type->function.parameters = parameter1;
6857 return identify_new_type(type);
6861 * Creates a return_type (func)(argument_type) function type if not
6864 * @param return_type the return type
6865 * @param argument_type the argument type
6867 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6869 function_parameter_t *const parameter = allocate_parameter(argument_type);
6871 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6872 type->function.return_type = return_type;
6873 type->function.parameters = parameter;
6875 return identify_new_type(type);
6878 static type_t *make_function_1_type_variadic(type_t *return_type, type_t *argument_type)
6880 type_t *res = make_function_1_type(return_type, argument_type);
6881 res->function.variadic = 1;
6886 * Creates a return_type (func)(void) function type if not
6889 * @param return_type the return type
6891 static type_t *make_function_0_type(type_t *return_type)
6893 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6894 type->function.return_type = return_type;
6895 type->function.parameters = NULL;
6897 return identify_new_type(type);
6901 * Creates a NO_RETURN return_type (func)(void) function type if not
6904 * @param return_type the return type
6906 static type_t *make_function_0_type_noreturn(type_t *return_type)
6908 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6909 type->function.return_type = return_type;
6910 type->function.parameters = NULL;
6911 type->function.base.modifiers |= DM_NORETURN;
6914 return identify_new_type(type);
6918 * Performs automatic type cast as described in §6.3.2.1.
6920 * @param orig_type the original type
6922 static type_t *automatic_type_conversion(type_t *orig_type)
6924 type_t *type = skip_typeref(orig_type);
6925 if (is_type_array(type)) {
6926 array_type_t *array_type = &type->array;
6927 type_t *element_type = array_type->element_type;
6928 unsigned qualifiers = array_type->base.qualifiers;
6930 return make_pointer_type(element_type, qualifiers);
6933 if (is_type_function(type)) {
6934 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6941 * reverts the automatic casts of array to pointer types and function
6942 * to function-pointer types as defined §6.3.2.1
6944 type_t *revert_automatic_type_conversion(const expression_t *expression)
6946 switch (expression->kind) {
6947 case EXPR_REFERENCE: {
6948 entity_t *entity = expression->reference.entity;
6949 if (is_declaration(entity)) {
6950 return entity->declaration.type;
6951 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6952 return entity->enum_value.enum_type;
6954 panic("no declaration or enum in reference");
6959 entity_t *entity = expression->select.compound_entry;
6960 assert(is_declaration(entity));
6961 type_t *type = entity->declaration.type;
6962 return get_qualified_type(type,
6963 expression->base.type->base.qualifiers);
6966 case EXPR_UNARY_DEREFERENCE: {
6967 const expression_t *const value = expression->unary.value;
6968 type_t *const type = skip_typeref(value->base.type);
6969 if (!is_type_pointer(type))
6970 return type_error_type;
6971 return type->pointer.points_to;
6974 case EXPR_ARRAY_ACCESS: {
6975 const expression_t *array_ref = expression->array_access.array_ref;
6976 type_t *type_left = skip_typeref(array_ref->base.type);
6977 if (!is_type_pointer(type_left))
6978 return type_error_type;
6979 return type_left->pointer.points_to;
6982 case EXPR_STRING_LITERAL: {
6983 size_t size = expression->string.value.size;
6984 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6987 case EXPR_WIDE_STRING_LITERAL: {
6988 size_t size = expression->wide_string.value.size;
6989 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6992 case EXPR_COMPOUND_LITERAL:
6993 return expression->compound_literal.type;
6996 return expression->base.type;
7000 static expression_t *parse_reference(void)
7002 symbol_t *const symbol = token.v.symbol;
7004 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
7006 if (entity == NULL) {
7007 if (!strict_mode && look_ahead(1)->type == '(') {
7008 /* an implicitly declared function */
7009 if (warning.error_implicit_function_declaration) {
7010 errorf(HERE, "implicit declaration of function '%Y'", symbol);
7011 } else if (warning.implicit_function_declaration) {
7012 warningf(HERE, "implicit declaration of function '%Y'", symbol);
7015 entity = create_implicit_function(symbol, HERE);
7017 errorf(HERE, "unknown identifier '%Y' found.", symbol);
7018 entity = create_error_entity(symbol, ENTITY_VARIABLE);
7024 if (is_declaration(entity)) {
7025 orig_type = entity->declaration.type;
7026 } else if (entity->kind == ENTITY_ENUM_VALUE) {
7027 orig_type = entity->enum_value.enum_type;
7028 } else if (entity->kind == ENTITY_TYPEDEF) {
7029 errorf(HERE, "encountered typedef name '%Y' while parsing expression",
7032 return create_invalid_expression();
7034 panic("expected declaration or enum value in reference");
7037 /* we always do the auto-type conversions; the & and sizeof parser contains
7038 * code to revert this! */
7039 type_t *type = automatic_type_conversion(orig_type);
7041 expression_kind_t kind = EXPR_REFERENCE;
7042 if (entity->kind == ENTITY_ENUM_VALUE)
7043 kind = EXPR_REFERENCE_ENUM_VALUE;
7045 expression_t *expression = allocate_expression_zero(kind);
7046 expression->reference.entity = entity;
7047 expression->base.type = type;
7049 /* this declaration is used */
7050 if (is_declaration(entity)) {
7051 entity->declaration.used = true;
7054 if (entity->base.parent_scope != file_scope
7055 && entity->base.parent_scope->depth < current_function->parameters.depth
7056 && is_type_valid(orig_type) && !is_type_function(orig_type)) {
7057 if (entity->kind == ENTITY_VARIABLE) {
7058 /* access of a variable from an outer function */
7059 entity->variable.address_taken = true;
7060 } else if (entity->kind == ENTITY_PARAMETER) {
7061 entity->parameter.address_taken = true;
7063 current_function->need_closure = true;
7066 /* check for deprecated functions */
7067 if (warning.deprecated_declarations
7068 && is_declaration(entity)
7069 && entity->declaration.modifiers & DM_DEPRECATED) {
7070 declaration_t *declaration = &entity->declaration;
7072 char const *const prefix = entity->kind == ENTITY_FUNCTION ?
7073 "function" : "variable";
7075 if (declaration->deprecated_string != NULL) {
7076 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
7077 prefix, entity->base.symbol, &entity->base.source_position,
7078 declaration->deprecated_string);
7080 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
7081 entity->base.symbol, &entity->base.source_position);
7085 if (warning.init_self && entity == current_init_decl && !in_type_prop
7086 && entity->kind == ENTITY_VARIABLE) {
7087 current_init_decl = NULL;
7088 warningf(HERE, "variable '%#T' is initialized by itself",
7089 entity->declaration.type, entity->base.symbol);
7096 static bool semantic_cast(expression_t *cast)
7098 expression_t *expression = cast->unary.value;
7099 type_t *orig_dest_type = cast->base.type;
7100 type_t *orig_type_right = expression->base.type;
7101 type_t const *dst_type = skip_typeref(orig_dest_type);
7102 type_t const *src_type = skip_typeref(orig_type_right);
7103 source_position_t const *pos = &cast->base.source_position;
7105 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
7106 if (dst_type == type_void)
7109 /* only integer and pointer can be casted to pointer */
7110 if (is_type_pointer(dst_type) &&
7111 !is_type_pointer(src_type) &&
7112 !is_type_integer(src_type) &&
7113 is_type_valid(src_type)) {
7114 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
7118 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
7119 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
7123 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
7124 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
7128 if (warning.cast_qual &&
7129 is_type_pointer(src_type) &&
7130 is_type_pointer(dst_type)) {
7131 type_t *src = skip_typeref(src_type->pointer.points_to);
7132 type_t *dst = skip_typeref(dst_type->pointer.points_to);
7133 unsigned missing_qualifiers =
7134 src->base.qualifiers & ~dst->base.qualifiers;
7135 if (missing_qualifiers != 0) {
7137 "cast discards qualifiers '%Q' in pointer target type of '%T'",
7138 missing_qualifiers, orig_type_right);
7144 static expression_t *parse_compound_literal(type_t *type)
7146 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
7148 parse_initializer_env_t env;
7151 env.must_be_constant = false;
7152 initializer_t *initializer = parse_initializer(&env);
7155 expression->compound_literal.initializer = initializer;
7156 expression->compound_literal.type = type;
7157 expression->base.type = automatic_type_conversion(type);
7163 * Parse a cast expression.
7165 static expression_t *parse_cast(void)
7167 add_anchor_token(')');
7169 source_position_t source_position = token.source_position;
7171 type_t *type = parse_typename();
7173 rem_anchor_token(')');
7174 expect(')', end_error);
7176 if (token.type == '{') {
7177 return parse_compound_literal(type);
7180 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
7181 cast->base.source_position = source_position;
7183 expression_t *value = parse_sub_expression(PREC_CAST);
7184 cast->base.type = type;
7185 cast->unary.value = value;
7187 if (! semantic_cast(cast)) {
7188 /* TODO: record the error in the AST. else it is impossible to detect it */
7193 return create_invalid_expression();
7197 * Parse a statement expression.
7199 static expression_t *parse_statement_expression(void)
7201 add_anchor_token(')');
7203 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
7205 statement_t *statement = parse_compound_statement(true);
7206 statement->compound.stmt_expr = true;
7207 expression->statement.statement = statement;
7209 /* find last statement and use its type */
7210 type_t *type = type_void;
7211 const statement_t *stmt = statement->compound.statements;
7213 while (stmt->base.next != NULL)
7214 stmt = stmt->base.next;
7216 if (stmt->kind == STATEMENT_EXPRESSION) {
7217 type = stmt->expression.expression->base.type;
7219 } else if (warning.other) {
7220 warningf(&expression->base.source_position, "empty statement expression ({})");
7222 expression->base.type = type;
7224 rem_anchor_token(')');
7225 expect(')', end_error);
7232 * Parse a parenthesized expression.
7234 static expression_t *parse_parenthesized_expression(void)
7238 switch (token.type) {
7240 /* gcc extension: a statement expression */
7241 return parse_statement_expression();
7245 return parse_cast();
7247 if (is_typedef_symbol(token.v.symbol)) {
7248 return parse_cast();
7252 add_anchor_token(')');
7253 expression_t *result = parse_expression();
7254 result->base.parenthesized = true;
7255 rem_anchor_token(')');
7256 expect(')', end_error);
7262 static expression_t *parse_function_keyword(void)
7266 if (current_function == NULL) {
7267 errorf(HERE, "'__func__' used outside of a function");
7270 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7271 expression->base.type = type_char_ptr;
7272 expression->funcname.kind = FUNCNAME_FUNCTION;
7279 static expression_t *parse_pretty_function_keyword(void)
7281 if (current_function == NULL) {
7282 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
7285 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7286 expression->base.type = type_char_ptr;
7287 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
7289 eat(T___PRETTY_FUNCTION__);
7294 static expression_t *parse_funcsig_keyword(void)
7296 if (current_function == NULL) {
7297 errorf(HERE, "'__FUNCSIG__' used outside of a function");
7300 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7301 expression->base.type = type_char_ptr;
7302 expression->funcname.kind = FUNCNAME_FUNCSIG;
7309 static expression_t *parse_funcdname_keyword(void)
7311 if (current_function == NULL) {
7312 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
7315 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7316 expression->base.type = type_char_ptr;
7317 expression->funcname.kind = FUNCNAME_FUNCDNAME;
7319 eat(T___FUNCDNAME__);
7324 static designator_t *parse_designator(void)
7326 designator_t *result = allocate_ast_zero(sizeof(result[0]));
7327 result->source_position = *HERE;
7329 if (token.type != T_IDENTIFIER) {
7330 parse_error_expected("while parsing member designator",
7331 T_IDENTIFIER, NULL);
7334 result->symbol = token.v.symbol;
7337 designator_t *last_designator = result;
7339 if (token.type == '.') {
7341 if (token.type != T_IDENTIFIER) {
7342 parse_error_expected("while parsing member designator",
7343 T_IDENTIFIER, NULL);
7346 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
7347 designator->source_position = *HERE;
7348 designator->symbol = token.v.symbol;
7351 last_designator->next = designator;
7352 last_designator = designator;
7355 if (token.type == '[') {
7357 add_anchor_token(']');
7358 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
7359 designator->source_position = *HERE;
7360 designator->array_index = parse_expression();
7361 rem_anchor_token(']');
7362 expect(']', end_error);
7363 if (designator->array_index == NULL) {
7367 last_designator->next = designator;
7368 last_designator = designator;
7380 * Parse the __builtin_offsetof() expression.
7382 static expression_t *parse_offsetof(void)
7384 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
7385 expression->base.type = type_size_t;
7387 eat(T___builtin_offsetof);
7389 expect('(', end_error);
7390 add_anchor_token(',');
7391 type_t *type = parse_typename();
7392 rem_anchor_token(',');
7393 expect(',', end_error);
7394 add_anchor_token(')');
7395 designator_t *designator = parse_designator();
7396 rem_anchor_token(')');
7397 expect(')', end_error);
7399 expression->offsetofe.type = type;
7400 expression->offsetofe.designator = designator;
7403 memset(&path, 0, sizeof(path));
7404 path.top_type = type;
7405 path.path = NEW_ARR_F(type_path_entry_t, 0);
7407 descend_into_subtype(&path);
7409 if (!walk_designator(&path, designator, true)) {
7410 return create_invalid_expression();
7413 DEL_ARR_F(path.path);
7417 return create_invalid_expression();
7421 * Parses a _builtin_va_start() expression.
7423 static expression_t *parse_va_start(void)
7425 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
7427 eat(T___builtin_va_start);
7429 expect('(', end_error);
7430 add_anchor_token(',');
7431 expression->va_starte.ap = parse_assignment_expression();
7432 rem_anchor_token(',');
7433 expect(',', end_error);
7434 expression_t *const expr = parse_assignment_expression();
7435 if (expr->kind == EXPR_REFERENCE) {
7436 entity_t *const entity = expr->reference.entity;
7437 if (entity->base.parent_scope != ¤t_function->parameters
7438 || entity->base.next != NULL
7439 || entity->kind != ENTITY_PARAMETER) {
7440 errorf(&expr->base.source_position,
7441 "second argument of 'va_start' must be last parameter of the current function");
7443 expression->va_starte.parameter = &entity->variable;
7445 expect(')', end_error);
7448 expect(')', end_error);
7450 return create_invalid_expression();
7454 * Parses a _builtin_va_arg() expression.
7456 static expression_t *parse_va_arg(void)
7458 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
7460 eat(T___builtin_va_arg);
7462 expect('(', end_error);
7463 expression->va_arge.ap = parse_assignment_expression();
7464 expect(',', end_error);
7465 expression->base.type = parse_typename();
7466 expect(')', end_error);
7470 return create_invalid_expression();
7474 * Parses a __builtin_constant_p() expression.
7476 static expression_t *parse_builtin_constant(void)
7478 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
7480 eat(T___builtin_constant_p);
7482 expect('(', end_error);
7483 add_anchor_token(')');
7484 expression->builtin_constant.value = parse_assignment_expression();
7485 rem_anchor_token(')');
7486 expect(')', end_error);
7487 expression->base.type = type_int;
7491 return create_invalid_expression();
7495 * Parses a __builtin_types_compatible_p() expression.
7497 static expression_t *parse_builtin_types_compatible(void)
7499 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
7501 eat(T___builtin_types_compatible_p);
7503 expect('(', end_error);
7504 add_anchor_token(')');
7505 add_anchor_token(',');
7506 expression->builtin_types_compatible.left = parse_typename();
7507 rem_anchor_token(',');
7508 expect(',', end_error);
7509 expression->builtin_types_compatible.right = parse_typename();
7510 rem_anchor_token(')');
7511 expect(')', end_error);
7512 expression->base.type = type_int;
7516 return create_invalid_expression();
7520 * Parses a __builtin_is_*() compare expression.
7522 static expression_t *parse_compare_builtin(void)
7524 expression_t *expression;
7526 switch (token.type) {
7527 case T___builtin_isgreater:
7528 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
7530 case T___builtin_isgreaterequal:
7531 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
7533 case T___builtin_isless:
7534 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
7536 case T___builtin_islessequal:
7537 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
7539 case T___builtin_islessgreater:
7540 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
7542 case T___builtin_isunordered:
7543 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
7546 internal_errorf(HERE, "invalid compare builtin found");
7548 expression->base.source_position = *HERE;
7551 expect('(', end_error);
7552 expression->binary.left = parse_assignment_expression();
7553 expect(',', end_error);
7554 expression->binary.right = parse_assignment_expression();
7555 expect(')', end_error);
7557 type_t *const orig_type_left = expression->binary.left->base.type;
7558 type_t *const orig_type_right = expression->binary.right->base.type;
7560 type_t *const type_left = skip_typeref(orig_type_left);
7561 type_t *const type_right = skip_typeref(orig_type_right);
7562 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7563 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7564 type_error_incompatible("invalid operands in comparison",
7565 &expression->base.source_position, orig_type_left, orig_type_right);
7568 semantic_comparison(&expression->binary);
7573 return create_invalid_expression();
7578 * Parses a __builtin_expect(, end_error) expression.
7580 static expression_t *parse_builtin_expect(void, end_error)
7582 expression_t *expression
7583 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7585 eat(T___builtin_expect);
7587 expect('(', end_error);
7588 expression->binary.left = parse_assignment_expression();
7589 expect(',', end_error);
7590 expression->binary.right = parse_constant_expression();
7591 expect(')', end_error);
7593 expression->base.type = expression->binary.left->base.type;
7597 return create_invalid_expression();
7602 * Parses a MS assume() expression.
7604 static expression_t *parse_assume(void)
7606 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7610 expect('(', end_error);
7611 add_anchor_token(')');
7612 expression->unary.value = parse_assignment_expression();
7613 rem_anchor_token(')');
7614 expect(')', end_error);
7616 expression->base.type = type_void;
7619 return create_invalid_expression();
7623 * Return the declaration for a given label symbol or create a new one.
7625 * @param symbol the symbol of the label
7627 static label_t *get_label(symbol_t *symbol)
7630 assert(current_function != NULL);
7632 label = get_entity(symbol, NAMESPACE_LABEL);
7633 /* if we found a local label, we already created the declaration */
7634 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7635 if (label->base.parent_scope != current_scope) {
7636 assert(label->base.parent_scope->depth < current_scope->depth);
7637 current_function->goto_to_outer = true;
7639 return &label->label;
7642 label = get_entity(symbol, NAMESPACE_LABEL);
7643 /* if we found a label in the same function, then we already created the
7646 && label->base.parent_scope == ¤t_function->parameters) {
7647 return &label->label;
7650 /* otherwise we need to create a new one */
7651 label = allocate_entity_zero(ENTITY_LABEL);
7652 label->base.namespc = NAMESPACE_LABEL;
7653 label->base.symbol = symbol;
7657 return &label->label;
7661 * Parses a GNU && label address expression.
7663 static expression_t *parse_label_address(void)
7665 source_position_t source_position = token.source_position;
7667 if (token.type != T_IDENTIFIER) {
7668 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7671 symbol_t *symbol = token.v.symbol;
7674 label_t *label = get_label(symbol);
7676 label->address_taken = true;
7678 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7679 expression->base.source_position = source_position;
7681 /* label address is threaten as a void pointer */
7682 expression->base.type = type_void_ptr;
7683 expression->label_address.label = label;
7686 return create_invalid_expression();
7690 * Parse a microsoft __noop expression.
7692 static expression_t *parse_noop_expression(void)
7694 /* the result is a (int)0 */
7695 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7696 cnst->base.type = type_int;
7697 cnst->conste.v.int_value = 0;
7698 cnst->conste.is_ms_noop = true;
7702 if (token.type == '(') {
7703 /* parse arguments */
7705 add_anchor_token(')');
7706 add_anchor_token(',');
7708 if (token.type != ')') {
7710 (void)parse_assignment_expression();
7711 if (token.type != ',')
7717 rem_anchor_token(',');
7718 rem_anchor_token(')');
7719 expect(')', end_error);
7726 * Parses a primary expression.
7728 static expression_t *parse_primary_expression(void)
7730 switch (token.type) {
7731 case T_false: return parse_bool_const(false);
7732 case T_true: return parse_bool_const(true);
7733 case T_INTEGER: return parse_int_const();
7734 case T_CHARACTER_CONSTANT: return parse_character_constant();
7735 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7736 case T_FLOATINGPOINT: return parse_float_const();
7737 case T_STRING_LITERAL:
7738 case T_WIDE_STRING_LITERAL: return parse_string_const();
7739 case T_IDENTIFIER: return parse_reference();
7740 case T___FUNCTION__:
7741 case T___func__: return parse_function_keyword();
7742 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7743 case T___FUNCSIG__: return parse_funcsig_keyword();
7744 case T___FUNCDNAME__: return parse_funcdname_keyword();
7745 case T___builtin_offsetof: return parse_offsetof();
7746 case T___builtin_va_start: return parse_va_start();
7747 case T___builtin_va_arg: return parse_va_arg();
7748 case T___builtin_isgreater:
7749 case T___builtin_isgreaterequal:
7750 case T___builtin_isless:
7751 case T___builtin_islessequal:
7752 case T___builtin_islessgreater:
7753 case T___builtin_isunordered: return parse_compare_builtin();
7754 case T___builtin_constant_p: return parse_builtin_constant();
7755 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7756 case T__assume: return parse_assume();
7759 return parse_label_address();
7762 case '(': return parse_parenthesized_expression();
7763 case T___noop: return parse_noop_expression();
7766 errorf(HERE, "unexpected token %K, expected an expression", &token);
7767 return create_invalid_expression();
7771 * Check if the expression has the character type and issue a warning then.
7773 static void check_for_char_index_type(const expression_t *expression)
7775 type_t *const type = expression->base.type;
7776 const type_t *const base_type = skip_typeref(type);
7778 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7779 warning.char_subscripts) {
7780 warningf(&expression->base.source_position,
7781 "array subscript has type '%T'", type);
7785 static expression_t *parse_array_expression(expression_t *left)
7787 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7790 add_anchor_token(']');
7792 expression_t *inside = parse_expression();
7794 type_t *const orig_type_left = left->base.type;
7795 type_t *const orig_type_inside = inside->base.type;
7797 type_t *const type_left = skip_typeref(orig_type_left);
7798 type_t *const type_inside = skip_typeref(orig_type_inside);
7800 type_t *return_type;
7801 array_access_expression_t *array_access = &expression->array_access;
7802 if (is_type_pointer(type_left)) {
7803 return_type = type_left->pointer.points_to;
7804 array_access->array_ref = left;
7805 array_access->index = inside;
7806 check_for_char_index_type(inside);
7807 } else if (is_type_pointer(type_inside)) {
7808 return_type = type_inside->pointer.points_to;
7809 array_access->array_ref = inside;
7810 array_access->index = left;
7811 array_access->flipped = true;
7812 check_for_char_index_type(left);
7814 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7816 "array access on object with non-pointer types '%T', '%T'",
7817 orig_type_left, orig_type_inside);
7819 return_type = type_error_type;
7820 array_access->array_ref = left;
7821 array_access->index = inside;
7824 expression->base.type = automatic_type_conversion(return_type);
7826 rem_anchor_token(']');
7827 expect(']', end_error);
7832 static expression_t *parse_typeprop(expression_kind_t const kind)
7834 expression_t *tp_expression = allocate_expression_zero(kind);
7835 tp_expression->base.type = type_size_t;
7837 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7839 /* we only refer to a type property, mark this case */
7840 bool old = in_type_prop;
7841 in_type_prop = true;
7844 expression_t *expression;
7845 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7847 add_anchor_token(')');
7848 orig_type = parse_typename();
7849 rem_anchor_token(')');
7850 expect(')', end_error);
7852 if (token.type == '{') {
7853 /* It was not sizeof(type) after all. It is sizeof of an expression
7854 * starting with a compound literal */
7855 expression = parse_compound_literal(orig_type);
7856 goto typeprop_expression;
7859 expression = parse_sub_expression(PREC_UNARY);
7861 typeprop_expression:
7862 tp_expression->typeprop.tp_expression = expression;
7864 orig_type = revert_automatic_type_conversion(expression);
7865 expression->base.type = orig_type;
7868 tp_expression->typeprop.type = orig_type;
7869 type_t const* const type = skip_typeref(orig_type);
7870 char const* const wrong_type =
7871 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7872 is_type_incomplete(type) ? "incomplete" :
7873 type->kind == TYPE_FUNCTION ? "function designator" :
7874 type->kind == TYPE_BITFIELD ? "bitfield" :
7876 if (wrong_type != NULL) {
7877 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7878 errorf(&tp_expression->base.source_position,
7879 "operand of %s expression must not be of %s type '%T'",
7880 what, wrong_type, orig_type);
7885 return tp_expression;
7888 static expression_t *parse_sizeof(void)
7890 return parse_typeprop(EXPR_SIZEOF);
7893 static expression_t *parse_alignof(void)
7895 return parse_typeprop(EXPR_ALIGNOF);
7898 static expression_t *parse_select_expression(expression_t *compound)
7900 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7901 select->select.compound = compound;
7903 assert(token.type == '.' || token.type == T_MINUSGREATER);
7904 bool is_pointer = (token.type == T_MINUSGREATER);
7907 if (token.type != T_IDENTIFIER) {
7908 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7911 symbol_t *symbol = token.v.symbol;
7914 type_t *const orig_type = compound->base.type;
7915 type_t *const type = skip_typeref(orig_type);
7918 bool saw_error = false;
7919 if (is_type_pointer(type)) {
7922 "request for member '%Y' in something not a struct or union, but '%T'",
7926 type_left = skip_typeref(type->pointer.points_to);
7928 if (is_pointer && is_type_valid(type)) {
7929 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7936 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7937 type_left->kind == TYPE_COMPOUND_UNION) {
7938 compound_t *compound = type_left->compound.compound;
7940 if (!compound->complete) {
7941 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7943 goto create_error_entry;
7946 entry = find_compound_entry(compound, symbol);
7947 if (entry == NULL) {
7948 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7949 goto create_error_entry;
7952 if (is_type_valid(type_left) && !saw_error) {
7954 "request for member '%Y' in something not a struct or union, but '%T'",
7958 entry = create_error_entity(symbol, ENTITY_COMPOUND_MEMBER);
7961 assert(is_declaration(entry));
7962 select->select.compound_entry = entry;
7964 type_t *entry_type = entry->declaration.type;
7966 = get_qualified_type(entry_type, type_left->base.qualifiers);
7968 /* we always do the auto-type conversions; the & and sizeof parser contains
7969 * code to revert this! */
7970 select->base.type = automatic_type_conversion(res_type);
7972 type_t *skipped = skip_typeref(res_type);
7973 if (skipped->kind == TYPE_BITFIELD) {
7974 select->base.type = skipped->bitfield.base_type;
7980 static void check_call_argument(const function_parameter_t *parameter,
7981 call_argument_t *argument, unsigned pos)
7983 type_t *expected_type = parameter->type;
7984 type_t *expected_type_skip = skip_typeref(expected_type);
7985 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7986 expression_t *arg_expr = argument->expression;
7987 type_t *arg_type = skip_typeref(arg_expr->base.type);
7989 /* handle transparent union gnu extension */
7990 if (is_type_union(expected_type_skip)
7991 && (expected_type_skip->base.modifiers
7992 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
7993 compound_t *union_decl = expected_type_skip->compound.compound;
7994 type_t *best_type = NULL;
7995 entity_t *entry = union_decl->members.entities;
7996 for ( ; entry != NULL; entry = entry->base.next) {
7997 assert(is_declaration(entry));
7998 type_t *decl_type = entry->declaration.type;
7999 error = semantic_assign(decl_type, arg_expr);
8000 if (error == ASSIGN_ERROR_INCOMPATIBLE
8001 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
8004 if (error == ASSIGN_SUCCESS) {
8005 best_type = decl_type;
8006 } else if (best_type == NULL) {
8007 best_type = decl_type;
8011 if (best_type != NULL) {
8012 expected_type = best_type;
8016 error = semantic_assign(expected_type, arg_expr);
8017 argument->expression = create_implicit_cast(argument->expression,
8020 if (error != ASSIGN_SUCCESS) {
8021 /* report exact scope in error messages (like "in argument 3") */
8023 snprintf(buf, sizeof(buf), "call argument %u", pos);
8024 report_assign_error(error, expected_type, arg_expr, buf,
8025 &arg_expr->base.source_position);
8026 } else if (warning.traditional || warning.conversion) {
8027 type_t *const promoted_type = get_default_promoted_type(arg_type);
8028 if (!types_compatible(expected_type_skip, promoted_type) &&
8029 !types_compatible(expected_type_skip, type_void_ptr) &&
8030 !types_compatible(type_void_ptr, promoted_type)) {
8031 /* Deliberately show the skipped types in this warning */
8032 warningf(&arg_expr->base.source_position,
8033 "passing call argument %u as '%T' rather than '%T' due to prototype",
8034 pos, expected_type_skip, promoted_type);
8040 * Handle the semantic restrictions of builtin calls
8042 static void handle_builtin_argument_restrictions(call_expression_t *call) {
8043 switch (call->function->reference.entity->function.btk) {
8044 case bk_gnu_builtin_return_address:
8045 case bk_gnu_builtin_frame_address: {
8046 /* argument must be constant */
8047 call_argument_t *argument = call->arguments;
8049 if (! is_constant_expression(argument->expression)) {
8050 errorf(&call->base.source_position,
8051 "argument of '%Y' must be a constant expression",
8052 call->function->reference.entity->base.symbol);
8056 case bk_gnu_builtin_prefetch: {
8057 /* second and third argument must be constant if existent */
8058 call_argument_t *rw = call->arguments->next;
8059 call_argument_t *locality = NULL;
8062 if (! is_constant_expression(rw->expression)) {
8063 errorf(&call->base.source_position,
8064 "second argument of '%Y' must be a constant expression",
8065 call->function->reference.entity->base.symbol);
8067 locality = rw->next;
8069 if (locality != NULL) {
8070 if (! is_constant_expression(locality->expression)) {
8071 errorf(&call->base.source_position,
8072 "third argument of '%Y' must be a constant expression",
8073 call->function->reference.entity->base.symbol);
8075 locality = rw->next;
8085 * Parse a call expression, ie. expression '( ... )'.
8087 * @param expression the function address
8089 static expression_t *parse_call_expression(expression_t *expression)
8091 expression_t *result = allocate_expression_zero(EXPR_CALL);
8092 call_expression_t *call = &result->call;
8093 call->function = expression;
8095 type_t *const orig_type = expression->base.type;
8096 type_t *const type = skip_typeref(orig_type);
8098 function_type_t *function_type = NULL;
8099 if (is_type_pointer(type)) {
8100 type_t *const to_type = skip_typeref(type->pointer.points_to);
8102 if (is_type_function(to_type)) {
8103 function_type = &to_type->function;
8104 call->base.type = function_type->return_type;
8108 if (function_type == NULL && is_type_valid(type)) {
8109 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
8112 /* parse arguments */
8114 add_anchor_token(')');
8115 add_anchor_token(',');
8117 if (token.type != ')') {
8118 call_argument_t **anchor = &call->arguments;
8120 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
8121 argument->expression = parse_assignment_expression();
8124 anchor = &argument->next;
8126 if (token.type != ',')
8131 rem_anchor_token(',');
8132 rem_anchor_token(')');
8133 expect(')', end_error);
8135 if (function_type == NULL)
8138 function_parameter_t *parameter = function_type->parameters;
8139 call_argument_t *argument = call->arguments;
8140 if (!function_type->unspecified_parameters) {
8141 for (unsigned pos = 0; parameter != NULL && argument != NULL;
8142 parameter = parameter->next, argument = argument->next) {
8143 check_call_argument(parameter, argument, ++pos);
8146 if (parameter != NULL) {
8147 errorf(HERE, "too few arguments to function '%E'", expression);
8148 } else if (argument != NULL && !function_type->variadic) {
8149 errorf(HERE, "too many arguments to function '%E'", expression);
8153 /* do default promotion */
8154 for (; argument != NULL; argument = argument->next) {
8155 type_t *type = argument->expression->base.type;
8157 type = get_default_promoted_type(type);
8159 argument->expression
8160 = create_implicit_cast(argument->expression, type);
8163 check_format(&result->call);
8165 if (warning.aggregate_return &&
8166 is_type_compound(skip_typeref(function_type->return_type))) {
8167 warningf(&result->base.source_position,
8168 "function call has aggregate value");
8171 if (call->function->kind == EXPR_REFERENCE) {
8172 reference_expression_t *reference = &call->function->reference;
8173 if (reference->entity->kind == ENTITY_FUNCTION &&
8174 reference->entity->function.btk != bk_none)
8175 handle_builtin_argument_restrictions(call);
8182 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
8184 static bool same_compound_type(const type_t *type1, const type_t *type2)
8187 is_type_compound(type1) &&
8188 type1->kind == type2->kind &&
8189 type1->compound.compound == type2->compound.compound;
8192 static expression_t const *get_reference_address(expression_t const *expr)
8194 bool regular_take_address = true;
8196 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8197 expr = expr->unary.value;
8199 regular_take_address = false;
8202 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8205 expr = expr->unary.value;
8208 if (expr->kind != EXPR_REFERENCE)
8211 /* special case for functions which are automatically converted to a
8212 * pointer to function without an extra TAKE_ADDRESS operation */
8213 if (!regular_take_address &&
8214 expr->reference.entity->kind != ENTITY_FUNCTION) {
8221 static void warn_reference_address_as_bool(expression_t const* expr)
8223 if (!warning.address)
8226 expr = get_reference_address(expr);
8228 warningf(&expr->base.source_position,
8229 "the address of '%Y' will always evaluate as 'true'",
8230 expr->reference.entity->base.symbol);
8234 static void warn_assignment_in_condition(const expression_t *const expr)
8236 if (!warning.parentheses)
8238 if (expr->base.kind != EXPR_BINARY_ASSIGN)
8240 if (expr->base.parenthesized)
8242 warningf(&expr->base.source_position,
8243 "suggest parentheses around assignment used as truth value");
8246 static void semantic_condition(expression_t const *const expr,
8247 char const *const context)
8249 type_t *const type = skip_typeref(expr->base.type);
8250 if (is_type_scalar(type)) {
8251 warn_reference_address_as_bool(expr);
8252 warn_assignment_in_condition(expr);
8253 } else if (is_type_valid(type)) {
8254 errorf(&expr->base.source_position,
8255 "%s must have scalar type", context);
8260 * Parse a conditional expression, ie. 'expression ? ... : ...'.
8262 * @param expression the conditional expression
8264 static expression_t *parse_conditional_expression(expression_t *expression)
8266 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
8268 conditional_expression_t *conditional = &result->conditional;
8269 conditional->condition = expression;
8272 add_anchor_token(':');
8274 /* §6.5.15:2 The first operand shall have scalar type. */
8275 semantic_condition(expression, "condition of conditional operator");
8277 expression_t *true_expression = expression;
8278 bool gnu_cond = false;
8279 if (GNU_MODE && token.type == ':') {
8282 true_expression = parse_expression();
8284 rem_anchor_token(':');
8285 expect(':', end_error);
8287 expression_t *false_expression =
8288 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
8290 type_t *const orig_true_type = true_expression->base.type;
8291 type_t *const orig_false_type = false_expression->base.type;
8292 type_t *const true_type = skip_typeref(orig_true_type);
8293 type_t *const false_type = skip_typeref(orig_false_type);
8296 type_t *result_type;
8297 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
8298 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
8299 /* ISO/IEC 14882:1998(E) §5.16:2 */
8300 if (true_expression->kind == EXPR_UNARY_THROW) {
8301 result_type = false_type;
8302 } else if (false_expression->kind == EXPR_UNARY_THROW) {
8303 result_type = true_type;
8305 if (warning.other && (
8306 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
8307 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
8309 warningf(&conditional->base.source_position,
8310 "ISO C forbids conditional expression with only one void side");
8312 result_type = type_void;
8314 } else if (is_type_arithmetic(true_type)
8315 && is_type_arithmetic(false_type)) {
8316 result_type = semantic_arithmetic(true_type, false_type);
8318 true_expression = create_implicit_cast(true_expression, result_type);
8319 false_expression = create_implicit_cast(false_expression, result_type);
8321 conditional->true_expression = true_expression;
8322 conditional->false_expression = false_expression;
8323 conditional->base.type = result_type;
8324 } else if (same_compound_type(true_type, false_type)) {
8325 /* just take 1 of the 2 types */
8326 result_type = true_type;
8327 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
8328 type_t *pointer_type;
8330 expression_t *other_expression;
8331 if (is_type_pointer(true_type) &&
8332 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
8333 pointer_type = true_type;
8334 other_type = false_type;
8335 other_expression = false_expression;
8337 pointer_type = false_type;
8338 other_type = true_type;
8339 other_expression = true_expression;
8342 if (is_null_pointer_constant(other_expression)) {
8343 result_type = pointer_type;
8344 } else if (is_type_pointer(other_type)) {
8345 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
8346 type_t *to2 = skip_typeref(other_type->pointer.points_to);
8349 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
8350 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
8352 } else if (types_compatible(get_unqualified_type(to1),
8353 get_unqualified_type(to2))) {
8356 if (warning.other) {
8357 warningf(&conditional->base.source_position,
8358 "pointer types '%T' and '%T' in conditional expression are incompatible",
8359 true_type, false_type);
8364 type_t *const type =
8365 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
8366 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
8367 } else if (is_type_integer(other_type)) {
8368 if (warning.other) {
8369 warningf(&conditional->base.source_position,
8370 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
8372 result_type = pointer_type;
8374 if (is_type_valid(other_type)) {
8375 type_error_incompatible("while parsing conditional",
8376 &expression->base.source_position, true_type, false_type);
8378 result_type = type_error_type;
8381 if (is_type_valid(true_type) && is_type_valid(false_type)) {
8382 type_error_incompatible("while parsing conditional",
8383 &conditional->base.source_position, true_type,
8386 result_type = type_error_type;
8389 conditional->true_expression
8390 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
8391 conditional->false_expression
8392 = create_implicit_cast(false_expression, result_type);
8393 conditional->base.type = result_type;
8398 * Parse an extension expression.
8400 static expression_t *parse_extension(void)
8402 eat(T___extension__);
8404 bool old_gcc_extension = in_gcc_extension;
8405 in_gcc_extension = true;
8406 expression_t *expression = parse_sub_expression(PREC_UNARY);
8407 in_gcc_extension = old_gcc_extension;
8412 * Parse a __builtin_classify_type() expression.
8414 static expression_t *parse_builtin_classify_type(void)
8416 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
8417 result->base.type = type_int;
8419 eat(T___builtin_classify_type);
8421 expect('(', end_error);
8422 add_anchor_token(')');
8423 expression_t *expression = parse_expression();
8424 rem_anchor_token(')');
8425 expect(')', end_error);
8426 result->classify_type.type_expression = expression;
8430 return create_invalid_expression();
8434 * Parse a delete expression
8435 * ISO/IEC 14882:1998(E) §5.3.5
8437 static expression_t *parse_delete(void)
8439 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
8440 result->base.type = type_void;
8444 if (token.type == '[') {
8446 result->kind = EXPR_UNARY_DELETE_ARRAY;
8447 expect(']', end_error);
8451 expression_t *const value = parse_sub_expression(PREC_CAST);
8452 result->unary.value = value;
8454 type_t *const type = skip_typeref(value->base.type);
8455 if (!is_type_pointer(type)) {
8456 if (is_type_valid(type)) {
8457 errorf(&value->base.source_position,
8458 "operand of delete must have pointer type");
8460 } else if (warning.other &&
8461 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
8462 warningf(&value->base.source_position,
8463 "deleting 'void*' is undefined");
8470 * Parse a throw expression
8471 * ISO/IEC 14882:1998(E) §15:1
8473 static expression_t *parse_throw(void)
8475 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
8476 result->base.type = type_void;
8480 expression_t *value = NULL;
8481 switch (token.type) {
8483 value = parse_assignment_expression();
8484 /* ISO/IEC 14882:1998(E) §15.1:3 */
8485 type_t *const orig_type = value->base.type;
8486 type_t *const type = skip_typeref(orig_type);
8487 if (is_type_incomplete(type)) {
8488 errorf(&value->base.source_position,
8489 "cannot throw object of incomplete type '%T'", orig_type);
8490 } else if (is_type_pointer(type)) {
8491 type_t *const points_to = skip_typeref(type->pointer.points_to);
8492 if (is_type_incomplete(points_to) &&
8493 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8494 errorf(&value->base.source_position,
8495 "cannot throw pointer to incomplete type '%T'", orig_type);
8503 result->unary.value = value;
8508 static bool check_pointer_arithmetic(const source_position_t *source_position,
8509 type_t *pointer_type,
8510 type_t *orig_pointer_type)
8512 type_t *points_to = pointer_type->pointer.points_to;
8513 points_to = skip_typeref(points_to);
8515 if (is_type_incomplete(points_to)) {
8516 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8517 errorf(source_position,
8518 "arithmetic with pointer to incomplete type '%T' not allowed",
8521 } else if (warning.pointer_arith) {
8522 warningf(source_position,
8523 "pointer of type '%T' used in arithmetic",
8526 } else if (is_type_function(points_to)) {
8528 errorf(source_position,
8529 "arithmetic with pointer to function type '%T' not allowed",
8532 } else if (warning.pointer_arith) {
8533 warningf(source_position,
8534 "pointer to a function '%T' used in arithmetic",
8541 static bool is_lvalue(const expression_t *expression)
8543 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
8544 switch (expression->kind) {
8545 case EXPR_ARRAY_ACCESS:
8546 case EXPR_COMPOUND_LITERAL:
8547 case EXPR_REFERENCE:
8549 case EXPR_UNARY_DEREFERENCE:
8553 type_t *type = skip_typeref(expression->base.type);
8555 /* ISO/IEC 14882:1998(E) §3.10:3 */
8556 is_type_reference(type) ||
8557 /* Claim it is an lvalue, if the type is invalid. There was a parse
8558 * error before, which maybe prevented properly recognizing it as
8560 !is_type_valid(type);
8565 static void semantic_incdec(unary_expression_t *expression)
8567 type_t *const orig_type = expression->value->base.type;
8568 type_t *const type = skip_typeref(orig_type);
8569 if (is_type_pointer(type)) {
8570 if (!check_pointer_arithmetic(&expression->base.source_position,
8574 } else if (!is_type_real(type) && is_type_valid(type)) {
8575 /* TODO: improve error message */
8576 errorf(&expression->base.source_position,
8577 "operation needs an arithmetic or pointer type");
8580 if (!is_lvalue(expression->value)) {
8581 /* TODO: improve error message */
8582 errorf(&expression->base.source_position, "lvalue required as operand");
8584 expression->base.type = orig_type;
8587 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8589 type_t *const orig_type = expression->value->base.type;
8590 type_t *const type = skip_typeref(orig_type);
8591 if (!is_type_arithmetic(type)) {
8592 if (is_type_valid(type)) {
8593 /* TODO: improve error message */
8594 errorf(&expression->base.source_position,
8595 "operation needs an arithmetic type");
8600 expression->base.type = orig_type;
8603 static void semantic_unexpr_plus(unary_expression_t *expression)
8605 semantic_unexpr_arithmetic(expression);
8606 if (warning.traditional)
8607 warningf(&expression->base.source_position,
8608 "traditional C rejects the unary plus operator");
8611 static void semantic_not(unary_expression_t *expression)
8613 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8614 semantic_condition(expression->value, "operand of !");
8615 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8618 static void semantic_unexpr_integer(unary_expression_t *expression)
8620 type_t *const orig_type = expression->value->base.type;
8621 type_t *const type = skip_typeref(orig_type);
8622 if (!is_type_integer(type)) {
8623 if (is_type_valid(type)) {
8624 errorf(&expression->base.source_position,
8625 "operand of ~ must be of integer type");
8630 expression->base.type = orig_type;
8633 static void semantic_dereference(unary_expression_t *expression)
8635 type_t *const orig_type = expression->value->base.type;
8636 type_t *const type = skip_typeref(orig_type);
8637 if (!is_type_pointer(type)) {
8638 if (is_type_valid(type)) {
8639 errorf(&expression->base.source_position,
8640 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8645 type_t *result_type = type->pointer.points_to;
8646 result_type = automatic_type_conversion(result_type);
8647 expression->base.type = result_type;
8651 * Record that an address is taken (expression represents an lvalue).
8653 * @param expression the expression
8654 * @param may_be_register if true, the expression might be an register
8656 static void set_address_taken(expression_t *expression, bool may_be_register)
8658 if (expression->kind != EXPR_REFERENCE)
8661 entity_t *const entity = expression->reference.entity;
8663 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8666 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8667 && !may_be_register) {
8668 errorf(&expression->base.source_position,
8669 "address of register %s '%Y' requested",
8670 get_entity_kind_name(entity->kind), entity->base.symbol);
8673 if (entity->kind == ENTITY_VARIABLE) {
8674 entity->variable.address_taken = true;
8676 assert(entity->kind == ENTITY_PARAMETER);
8677 entity->parameter.address_taken = true;
8682 * Check the semantic of the address taken expression.
8684 static void semantic_take_addr(unary_expression_t *expression)
8686 expression_t *value = expression->value;
8687 value->base.type = revert_automatic_type_conversion(value);
8689 type_t *orig_type = value->base.type;
8690 type_t *type = skip_typeref(orig_type);
8691 if (!is_type_valid(type))
8695 if (!is_lvalue(value)) {
8696 errorf(&expression->base.source_position, "'&' requires an lvalue");
8698 if (type->kind == TYPE_BITFIELD) {
8699 errorf(&expression->base.source_position,
8700 "'&' not allowed on object with bitfield type '%T'",
8704 set_address_taken(value, false);
8706 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8709 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8710 static expression_t *parse_##unexpression_type(void) \
8712 expression_t *unary_expression \
8713 = allocate_expression_zero(unexpression_type); \
8715 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8717 sfunc(&unary_expression->unary); \
8719 return unary_expression; \
8722 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8723 semantic_unexpr_arithmetic)
8724 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8725 semantic_unexpr_plus)
8726 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8728 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8729 semantic_dereference)
8730 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8732 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8733 semantic_unexpr_integer)
8734 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8736 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8739 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8741 static expression_t *parse_##unexpression_type(expression_t *left) \
8743 expression_t *unary_expression \
8744 = allocate_expression_zero(unexpression_type); \
8746 unary_expression->unary.value = left; \
8748 sfunc(&unary_expression->unary); \
8750 return unary_expression; \
8753 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8754 EXPR_UNARY_POSTFIX_INCREMENT,
8756 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8757 EXPR_UNARY_POSTFIX_DECREMENT,
8760 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8762 /* TODO: handle complex + imaginary types */
8764 type_left = get_unqualified_type(type_left);
8765 type_right = get_unqualified_type(type_right);
8767 /* §6.3.1.8 Usual arithmetic conversions */
8768 if (type_left == type_long_double || type_right == type_long_double) {
8769 return type_long_double;
8770 } else if (type_left == type_double || type_right == type_double) {
8772 } else if (type_left == type_float || type_right == type_float) {
8776 type_left = promote_integer(type_left);
8777 type_right = promote_integer(type_right);
8779 if (type_left == type_right)
8782 bool const signed_left = is_type_signed(type_left);
8783 bool const signed_right = is_type_signed(type_right);
8784 int const rank_left = get_rank(type_left);
8785 int const rank_right = get_rank(type_right);
8787 if (signed_left == signed_right)
8788 return rank_left >= rank_right ? type_left : type_right;
8797 u_rank = rank_right;
8798 u_type = type_right;
8800 s_rank = rank_right;
8801 s_type = type_right;
8806 if (u_rank >= s_rank)
8809 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8811 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8812 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8816 case ATOMIC_TYPE_INT: return type_unsigned_int;
8817 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8818 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8820 default: panic("invalid atomic type");
8825 * Check the semantic restrictions for a binary expression.
8827 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8829 expression_t *const left = expression->left;
8830 expression_t *const right = expression->right;
8831 type_t *const orig_type_left = left->base.type;
8832 type_t *const orig_type_right = right->base.type;
8833 type_t *const type_left = skip_typeref(orig_type_left);
8834 type_t *const type_right = skip_typeref(orig_type_right);
8836 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8837 /* TODO: improve error message */
8838 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8839 errorf(&expression->base.source_position,
8840 "operation needs arithmetic types");
8845 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8846 expression->left = create_implicit_cast(left, arithmetic_type);
8847 expression->right = create_implicit_cast(right, arithmetic_type);
8848 expression->base.type = arithmetic_type;
8851 static void warn_div_by_zero(binary_expression_t const *const expression)
8853 if (!warning.div_by_zero ||
8854 !is_type_integer(expression->base.type))
8857 expression_t const *const right = expression->right;
8858 /* The type of the right operand can be different for /= */
8859 if (is_type_integer(right->base.type) &&
8860 is_constant_expression(right) &&
8861 fold_constant(right) == 0) {
8862 warningf(&expression->base.source_position, "division by zero");
8867 * Check the semantic restrictions for a div/mod expression.
8869 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8871 semantic_binexpr_arithmetic(expression);
8872 warn_div_by_zero(expression);
8875 static void warn_addsub_in_shift(const expression_t *const expr)
8877 if (expr->base.parenthesized)
8881 switch (expr->kind) {
8882 case EXPR_BINARY_ADD: op = '+'; break;
8883 case EXPR_BINARY_SUB: op = '-'; break;
8887 warningf(&expr->base.source_position,
8888 "suggest parentheses around '%c' inside shift", op);
8891 static void semantic_shift_op(binary_expression_t *expression)
8893 expression_t *const left = expression->left;
8894 expression_t *const right = expression->right;
8895 type_t *const orig_type_left = left->base.type;
8896 type_t *const orig_type_right = right->base.type;
8897 type_t * type_left = skip_typeref(orig_type_left);
8898 type_t * type_right = skip_typeref(orig_type_right);
8900 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8901 /* TODO: improve error message */
8902 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8903 errorf(&expression->base.source_position,
8904 "operands of shift operation must have integer types");
8909 if (warning.parentheses) {
8910 warn_addsub_in_shift(left);
8911 warn_addsub_in_shift(right);
8914 type_left = promote_integer(type_left);
8915 type_right = promote_integer(type_right);
8917 expression->left = create_implicit_cast(left, type_left);
8918 expression->right = create_implicit_cast(right, type_right);
8919 expression->base.type = type_left;
8922 static void semantic_add(binary_expression_t *expression)
8924 expression_t *const left = expression->left;
8925 expression_t *const right = expression->right;
8926 type_t *const orig_type_left = left->base.type;
8927 type_t *const orig_type_right = right->base.type;
8928 type_t *const type_left = skip_typeref(orig_type_left);
8929 type_t *const type_right = skip_typeref(orig_type_right);
8932 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8933 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8934 expression->left = create_implicit_cast(left, arithmetic_type);
8935 expression->right = create_implicit_cast(right, arithmetic_type);
8936 expression->base.type = arithmetic_type;
8937 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8938 check_pointer_arithmetic(&expression->base.source_position,
8939 type_left, orig_type_left);
8940 expression->base.type = type_left;
8941 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8942 check_pointer_arithmetic(&expression->base.source_position,
8943 type_right, orig_type_right);
8944 expression->base.type = type_right;
8945 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8946 errorf(&expression->base.source_position,
8947 "invalid operands to binary + ('%T', '%T')",
8948 orig_type_left, orig_type_right);
8952 static void semantic_sub(binary_expression_t *expression)
8954 expression_t *const left = expression->left;
8955 expression_t *const right = expression->right;
8956 type_t *const orig_type_left = left->base.type;
8957 type_t *const orig_type_right = right->base.type;
8958 type_t *const type_left = skip_typeref(orig_type_left);
8959 type_t *const type_right = skip_typeref(orig_type_right);
8960 source_position_t const *const pos = &expression->base.source_position;
8963 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8964 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8965 expression->left = create_implicit_cast(left, arithmetic_type);
8966 expression->right = create_implicit_cast(right, arithmetic_type);
8967 expression->base.type = arithmetic_type;
8968 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8969 check_pointer_arithmetic(&expression->base.source_position,
8970 type_left, orig_type_left);
8971 expression->base.type = type_left;
8972 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8973 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8974 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8975 if (!types_compatible(unqual_left, unqual_right)) {
8977 "subtracting pointers to incompatible types '%T' and '%T'",
8978 orig_type_left, orig_type_right);
8979 } else if (!is_type_object(unqual_left)) {
8980 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8981 errorf(pos, "subtracting pointers to non-object types '%T'",
8983 } else if (warning.other) {
8984 warningf(pos, "subtracting pointers to void");
8987 expression->base.type = type_ptrdiff_t;
8988 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8989 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8990 orig_type_left, orig_type_right);
8994 static void warn_string_literal_address(expression_t const* expr)
8996 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8997 expr = expr->unary.value;
8998 if (expr->kind != EXPR_UNARY_DEREFERENCE)
9000 expr = expr->unary.value;
9003 if (expr->kind == EXPR_STRING_LITERAL ||
9004 expr->kind == EXPR_WIDE_STRING_LITERAL) {
9005 warningf(&expr->base.source_position,
9006 "comparison with string literal results in unspecified behaviour");
9010 static void warn_comparison_in_comparison(const expression_t *const expr)
9012 if (expr->base.parenthesized)
9014 switch (expr->base.kind) {
9015 case EXPR_BINARY_LESS:
9016 case EXPR_BINARY_GREATER:
9017 case EXPR_BINARY_LESSEQUAL:
9018 case EXPR_BINARY_GREATEREQUAL:
9019 case EXPR_BINARY_NOTEQUAL:
9020 case EXPR_BINARY_EQUAL:
9021 warningf(&expr->base.source_position,
9022 "comparisons like 'x <= y < z' do not have their mathematical meaning");
9029 static bool maybe_negative(expression_t const *const expr)
9032 !is_constant_expression(expr) ||
9033 fold_constant(expr) < 0;
9037 * Check the semantics of comparison expressions.
9039 * @param expression The expression to check.
9041 static void semantic_comparison(binary_expression_t *expression)
9043 expression_t *left = expression->left;
9044 expression_t *right = expression->right;
9046 if (warning.address) {
9047 warn_string_literal_address(left);
9048 warn_string_literal_address(right);
9050 expression_t const* const func_left = get_reference_address(left);
9051 if (func_left != NULL && is_null_pointer_constant(right)) {
9052 warningf(&expression->base.source_position,
9053 "the address of '%Y' will never be NULL",
9054 func_left->reference.entity->base.symbol);
9057 expression_t const* const func_right = get_reference_address(right);
9058 if (func_right != NULL && is_null_pointer_constant(right)) {
9059 warningf(&expression->base.source_position,
9060 "the address of '%Y' will never be NULL",
9061 func_right->reference.entity->base.symbol);
9065 if (warning.parentheses) {
9066 warn_comparison_in_comparison(left);
9067 warn_comparison_in_comparison(right);
9070 type_t *orig_type_left = left->base.type;
9071 type_t *orig_type_right = right->base.type;
9072 type_t *type_left = skip_typeref(orig_type_left);
9073 type_t *type_right = skip_typeref(orig_type_right);
9075 /* TODO non-arithmetic types */
9076 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9077 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9079 /* test for signed vs unsigned compares */
9080 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
9081 bool const signed_left = is_type_signed(type_left);
9082 bool const signed_right = is_type_signed(type_right);
9083 if (signed_left != signed_right) {
9084 /* FIXME long long needs better const folding magic */
9085 /* TODO check whether constant value can be represented by other type */
9086 if ((signed_left && maybe_negative(left)) ||
9087 (signed_right && maybe_negative(right))) {
9088 warningf(&expression->base.source_position,
9089 "comparison between signed and unsigned");
9094 expression->left = create_implicit_cast(left, arithmetic_type);
9095 expression->right = create_implicit_cast(right, arithmetic_type);
9096 expression->base.type = arithmetic_type;
9097 if (warning.float_equal &&
9098 (expression->base.kind == EXPR_BINARY_EQUAL ||
9099 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
9100 is_type_float(arithmetic_type)) {
9101 warningf(&expression->base.source_position,
9102 "comparing floating point with == or != is unsafe");
9104 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
9105 /* TODO check compatibility */
9106 } else if (is_type_pointer(type_left)) {
9107 expression->right = create_implicit_cast(right, type_left);
9108 } else if (is_type_pointer(type_right)) {
9109 expression->left = create_implicit_cast(left, type_right);
9110 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9111 type_error_incompatible("invalid operands in comparison",
9112 &expression->base.source_position,
9113 type_left, type_right);
9115 expression->base.type = c_mode & _CXX ? type_bool : type_int;
9119 * Checks if a compound type has constant fields.
9121 static bool has_const_fields(const compound_type_t *type)
9123 compound_t *compound = type->compound;
9124 entity_t *entry = compound->members.entities;
9126 for (; entry != NULL; entry = entry->base.next) {
9127 if (!is_declaration(entry))
9130 const type_t *decl_type = skip_typeref(entry->declaration.type);
9131 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
9138 static bool is_valid_assignment_lhs(expression_t const* const left)
9140 type_t *const orig_type_left = revert_automatic_type_conversion(left);
9141 type_t *const type_left = skip_typeref(orig_type_left);
9143 if (!is_lvalue(left)) {
9144 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
9149 if (left->kind == EXPR_REFERENCE
9150 && left->reference.entity->kind == ENTITY_FUNCTION) {
9151 errorf(HERE, "cannot assign to function '%E'", left);
9155 if (is_type_array(type_left)) {
9156 errorf(HERE, "cannot assign to array '%E'", left);
9159 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
9160 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
9164 if (is_type_incomplete(type_left)) {
9165 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
9166 left, orig_type_left);
9169 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
9170 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
9171 left, orig_type_left);
9178 static void semantic_arithmetic_assign(binary_expression_t *expression)
9180 expression_t *left = expression->left;
9181 expression_t *right = expression->right;
9182 type_t *orig_type_left = left->base.type;
9183 type_t *orig_type_right = right->base.type;
9185 if (!is_valid_assignment_lhs(left))
9188 type_t *type_left = skip_typeref(orig_type_left);
9189 type_t *type_right = skip_typeref(orig_type_right);
9191 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
9192 /* TODO: improve error message */
9193 if (is_type_valid(type_left) && is_type_valid(type_right)) {
9194 errorf(&expression->base.source_position,
9195 "operation needs arithmetic types");
9200 /* combined instructions are tricky. We can't create an implicit cast on
9201 * the left side, because we need the uncasted form for the store.
9202 * The ast2firm pass has to know that left_type must be right_type
9203 * for the arithmetic operation and create a cast by itself */
9204 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9205 expression->right = create_implicit_cast(right, arithmetic_type);
9206 expression->base.type = type_left;
9209 static void semantic_divmod_assign(binary_expression_t *expression)
9211 semantic_arithmetic_assign(expression);
9212 warn_div_by_zero(expression);
9215 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
9217 expression_t *const left = expression->left;
9218 expression_t *const right = expression->right;
9219 type_t *const orig_type_left = left->base.type;
9220 type_t *const orig_type_right = right->base.type;
9221 type_t *const type_left = skip_typeref(orig_type_left);
9222 type_t *const type_right = skip_typeref(orig_type_right);
9224 if (!is_valid_assignment_lhs(left))
9227 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9228 /* combined instructions are tricky. We can't create an implicit cast on
9229 * the left side, because we need the uncasted form for the store.
9230 * The ast2firm pass has to know that left_type must be right_type
9231 * for the arithmetic operation and create a cast by itself */
9232 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
9233 expression->right = create_implicit_cast(right, arithmetic_type);
9234 expression->base.type = type_left;
9235 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
9236 check_pointer_arithmetic(&expression->base.source_position,
9237 type_left, orig_type_left);
9238 expression->base.type = type_left;
9239 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9240 errorf(&expression->base.source_position,
9241 "incompatible types '%T' and '%T' in assignment",
9242 orig_type_left, orig_type_right);
9246 static void warn_logical_and_within_or(const expression_t *const expr)
9248 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
9250 if (expr->base.parenthesized)
9252 warningf(&expr->base.source_position,
9253 "suggest parentheses around && within ||");
9257 * Check the semantic restrictions of a logical expression.
9259 static void semantic_logical_op(binary_expression_t *expression)
9261 /* §6.5.13:2 Each of the operands shall have scalar type.
9262 * §6.5.14:2 Each of the operands shall have scalar type. */
9263 semantic_condition(expression->left, "left operand of logical operator");
9264 semantic_condition(expression->right, "right operand of logical operator");
9265 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
9266 warning.parentheses) {
9267 warn_logical_and_within_or(expression->left);
9268 warn_logical_and_within_or(expression->right);
9270 expression->base.type = c_mode & _CXX ? type_bool : type_int;
9274 * Check the semantic restrictions of a binary assign expression.
9276 static void semantic_binexpr_assign(binary_expression_t *expression)
9278 expression_t *left = expression->left;
9279 type_t *orig_type_left = left->base.type;
9281 if (!is_valid_assignment_lhs(left))
9284 assign_error_t error = semantic_assign(orig_type_left, expression->right);
9285 report_assign_error(error, orig_type_left, expression->right,
9286 "assignment", &left->base.source_position);
9287 expression->right = create_implicit_cast(expression->right, orig_type_left);
9288 expression->base.type = orig_type_left;
9292 * Determine if the outermost operation (or parts thereof) of the given
9293 * expression has no effect in order to generate a warning about this fact.
9294 * Therefore in some cases this only examines some of the operands of the
9295 * expression (see comments in the function and examples below).
9297 * f() + 23; // warning, because + has no effect
9298 * x || f(); // no warning, because x controls execution of f()
9299 * x ? y : f(); // warning, because y has no effect
9300 * (void)x; // no warning to be able to suppress the warning
9301 * This function can NOT be used for an "expression has definitely no effect"-
9303 static bool expression_has_effect(const expression_t *const expr)
9305 switch (expr->kind) {
9306 case EXPR_UNKNOWN: break;
9307 case EXPR_INVALID: return true; /* do NOT warn */
9308 case EXPR_REFERENCE: return false;
9309 case EXPR_REFERENCE_ENUM_VALUE: return false;
9310 /* suppress the warning for microsoft __noop operations */
9311 case EXPR_CONST: return expr->conste.is_ms_noop;
9312 case EXPR_CHARACTER_CONSTANT: return false;
9313 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
9314 case EXPR_STRING_LITERAL: return false;
9315 case EXPR_WIDE_STRING_LITERAL: return false;
9316 case EXPR_LABEL_ADDRESS: return false;
9319 const call_expression_t *const call = &expr->call;
9320 if (call->function->kind != EXPR_REFERENCE)
9323 switch (call->function->reference.entity->function.btk) {
9324 /* FIXME: which builtins have no effect? */
9325 default: return true;
9329 /* Generate the warning if either the left or right hand side of a
9330 * conditional expression has no effect */
9331 case EXPR_CONDITIONAL: {
9332 conditional_expression_t const *const cond = &expr->conditional;
9333 expression_t const *const t = cond->true_expression;
9335 (t == NULL || expression_has_effect(t)) &&
9336 expression_has_effect(cond->false_expression);
9339 case EXPR_SELECT: return false;
9340 case EXPR_ARRAY_ACCESS: return false;
9341 case EXPR_SIZEOF: return false;
9342 case EXPR_CLASSIFY_TYPE: return false;
9343 case EXPR_ALIGNOF: return false;
9345 case EXPR_FUNCNAME: return false;
9346 case EXPR_BUILTIN_CONSTANT_P: return false;
9347 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
9348 case EXPR_OFFSETOF: return false;
9349 case EXPR_VA_START: return true;
9350 case EXPR_VA_ARG: return true;
9351 case EXPR_STATEMENT: return true; // TODO
9352 case EXPR_COMPOUND_LITERAL: return false;
9354 case EXPR_UNARY_NEGATE: return false;
9355 case EXPR_UNARY_PLUS: return false;
9356 case EXPR_UNARY_BITWISE_NEGATE: return false;
9357 case EXPR_UNARY_NOT: return false;
9358 case EXPR_UNARY_DEREFERENCE: return false;
9359 case EXPR_UNARY_TAKE_ADDRESS: return false;
9360 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
9361 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
9362 case EXPR_UNARY_PREFIX_INCREMENT: return true;
9363 case EXPR_UNARY_PREFIX_DECREMENT: return true;
9365 /* Treat void casts as if they have an effect in order to being able to
9366 * suppress the warning */
9367 case EXPR_UNARY_CAST: {
9368 type_t *const type = skip_typeref(expr->base.type);
9369 return is_type_atomic(type, ATOMIC_TYPE_VOID);
9372 case EXPR_UNARY_CAST_IMPLICIT: return true;
9373 case EXPR_UNARY_ASSUME: return true;
9374 case EXPR_UNARY_DELETE: return true;
9375 case EXPR_UNARY_DELETE_ARRAY: return true;
9376 case EXPR_UNARY_THROW: return true;
9378 case EXPR_BINARY_ADD: return false;
9379 case EXPR_BINARY_SUB: return false;
9380 case EXPR_BINARY_MUL: return false;
9381 case EXPR_BINARY_DIV: return false;
9382 case EXPR_BINARY_MOD: return false;
9383 case EXPR_BINARY_EQUAL: return false;
9384 case EXPR_BINARY_NOTEQUAL: return false;
9385 case EXPR_BINARY_LESS: return false;
9386 case EXPR_BINARY_LESSEQUAL: return false;
9387 case EXPR_BINARY_GREATER: return false;
9388 case EXPR_BINARY_GREATEREQUAL: return false;
9389 case EXPR_BINARY_BITWISE_AND: return false;
9390 case EXPR_BINARY_BITWISE_OR: return false;
9391 case EXPR_BINARY_BITWISE_XOR: return false;
9392 case EXPR_BINARY_SHIFTLEFT: return false;
9393 case EXPR_BINARY_SHIFTRIGHT: return false;
9394 case EXPR_BINARY_ASSIGN: return true;
9395 case EXPR_BINARY_MUL_ASSIGN: return true;
9396 case EXPR_BINARY_DIV_ASSIGN: return true;
9397 case EXPR_BINARY_MOD_ASSIGN: return true;
9398 case EXPR_BINARY_ADD_ASSIGN: return true;
9399 case EXPR_BINARY_SUB_ASSIGN: return true;
9400 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
9401 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
9402 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
9403 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
9404 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
9406 /* Only examine the right hand side of && and ||, because the left hand
9407 * side already has the effect of controlling the execution of the right
9409 case EXPR_BINARY_LOGICAL_AND:
9410 case EXPR_BINARY_LOGICAL_OR:
9411 /* Only examine the right hand side of a comma expression, because the left
9412 * hand side has a separate warning */
9413 case EXPR_BINARY_COMMA:
9414 return expression_has_effect(expr->binary.right);
9416 case EXPR_BINARY_ISGREATER: return false;
9417 case EXPR_BINARY_ISGREATEREQUAL: return false;
9418 case EXPR_BINARY_ISLESS: return false;
9419 case EXPR_BINARY_ISLESSEQUAL: return false;
9420 case EXPR_BINARY_ISLESSGREATER: return false;
9421 case EXPR_BINARY_ISUNORDERED: return false;
9424 internal_errorf(HERE, "unexpected expression");
9427 static void semantic_comma(binary_expression_t *expression)
9429 if (warning.unused_value) {
9430 const expression_t *const left = expression->left;
9431 if (!expression_has_effect(left)) {
9432 warningf(&left->base.source_position,
9433 "left-hand operand of comma expression has no effect");
9436 expression->base.type = expression->right->base.type;
9440 * @param prec_r precedence of the right operand
9442 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
9443 static expression_t *parse_##binexpression_type(expression_t *left) \
9445 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
9446 binexpr->binary.left = left; \
9449 expression_t *right = parse_sub_expression(prec_r); \
9451 binexpr->binary.right = right; \
9452 sfunc(&binexpr->binary); \
9457 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
9458 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
9459 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
9460 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
9461 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
9462 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
9463 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
9464 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
9465 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
9466 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
9467 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
9468 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
9469 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
9470 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
9471 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
9472 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
9473 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
9474 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
9475 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
9476 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9477 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9478 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9479 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9480 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9481 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9482 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9483 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9484 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9485 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9486 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9489 static expression_t *parse_sub_expression(precedence_t precedence)
9491 if (token.type < 0) {
9492 return expected_expression_error();
9495 expression_parser_function_t *parser
9496 = &expression_parsers[token.type];
9497 source_position_t source_position = token.source_position;
9500 if (parser->parser != NULL) {
9501 left = parser->parser();
9503 left = parse_primary_expression();
9505 assert(left != NULL);
9506 left->base.source_position = source_position;
9509 if (token.type < 0) {
9510 return expected_expression_error();
9513 parser = &expression_parsers[token.type];
9514 if (parser->infix_parser == NULL)
9516 if (parser->infix_precedence < precedence)
9519 left = parser->infix_parser(left);
9521 assert(left != NULL);
9522 assert(left->kind != EXPR_UNKNOWN);
9523 left->base.source_position = source_position;
9530 * Parse an expression.
9532 static expression_t *parse_expression(void)
9534 return parse_sub_expression(PREC_EXPRESSION);
9538 * Register a parser for a prefix-like operator.
9540 * @param parser the parser function
9541 * @param token_type the token type of the prefix token
9543 static void register_expression_parser(parse_expression_function parser,
9546 expression_parser_function_t *entry = &expression_parsers[token_type];
9548 if (entry->parser != NULL) {
9549 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9550 panic("trying to register multiple expression parsers for a token");
9552 entry->parser = parser;
9556 * Register a parser for an infix operator with given precedence.
9558 * @param parser the parser function
9559 * @param token_type the token type of the infix operator
9560 * @param precedence the precedence of the operator
9562 static void register_infix_parser(parse_expression_infix_function parser,
9563 int token_type, precedence_t precedence)
9565 expression_parser_function_t *entry = &expression_parsers[token_type];
9567 if (entry->infix_parser != NULL) {
9568 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9569 panic("trying to register multiple infix expression parsers for a "
9572 entry->infix_parser = parser;
9573 entry->infix_precedence = precedence;
9577 * Initialize the expression parsers.
9579 static void init_expression_parsers(void)
9581 memset(&expression_parsers, 0, sizeof(expression_parsers));
9583 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9584 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9585 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9586 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9587 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9588 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9589 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9590 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9591 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9592 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9593 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9594 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9595 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9596 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9597 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9598 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9599 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9600 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9601 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9602 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9603 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9604 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9605 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9606 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9607 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9608 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9609 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9610 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9611 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9612 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9613 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9614 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9615 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9616 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9617 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9618 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9619 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9621 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9622 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9623 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9624 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9625 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9626 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9627 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9628 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9629 register_expression_parser(parse_sizeof, T_sizeof);
9630 register_expression_parser(parse_alignof, T___alignof__);
9631 register_expression_parser(parse_extension, T___extension__);
9632 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9633 register_expression_parser(parse_delete, T_delete);
9634 register_expression_parser(parse_throw, T_throw);
9638 * Parse a asm statement arguments specification.
9640 static asm_argument_t *parse_asm_arguments(bool is_out)
9642 asm_argument_t *result = NULL;
9643 asm_argument_t **anchor = &result;
9645 while (token.type == T_STRING_LITERAL || token.type == '[') {
9646 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9647 memset(argument, 0, sizeof(argument[0]));
9649 if (token.type == '[') {
9651 if (token.type != T_IDENTIFIER) {
9652 parse_error_expected("while parsing asm argument",
9653 T_IDENTIFIER, NULL);
9656 argument->symbol = token.v.symbol;
9658 expect(']', end_error);
9661 argument->constraints = parse_string_literals();
9662 expect('(', end_error);
9663 add_anchor_token(')');
9664 expression_t *expression = parse_expression();
9665 rem_anchor_token(')');
9667 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9668 * change size or type representation (e.g. int -> long is ok, but
9669 * int -> float is not) */
9670 if (expression->kind == EXPR_UNARY_CAST) {
9671 type_t *const type = expression->base.type;
9672 type_kind_t const kind = type->kind;
9673 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9676 if (kind == TYPE_ATOMIC) {
9677 atomic_type_kind_t const akind = type->atomic.akind;
9678 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9679 size = get_atomic_type_size(akind);
9681 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9682 size = get_atomic_type_size(get_intptr_kind());
9686 expression_t *const value = expression->unary.value;
9687 type_t *const value_type = value->base.type;
9688 type_kind_t const value_kind = value_type->kind;
9690 unsigned value_flags;
9691 unsigned value_size;
9692 if (value_kind == TYPE_ATOMIC) {
9693 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9694 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9695 value_size = get_atomic_type_size(value_akind);
9696 } else if (value_kind == TYPE_POINTER) {
9697 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9698 value_size = get_atomic_type_size(get_intptr_kind());
9703 if (value_flags != flags || value_size != size)
9707 } while (expression->kind == EXPR_UNARY_CAST);
9711 if (!is_lvalue(expression)) {
9712 errorf(&expression->base.source_position,
9713 "asm output argument is not an lvalue");
9716 if (argument->constraints.begin[0] == '+')
9717 mark_vars_read(expression, NULL);
9719 mark_vars_read(expression, NULL);
9721 argument->expression = expression;
9722 expect(')', end_error);
9724 set_address_taken(expression, true);
9727 anchor = &argument->next;
9729 if (token.type != ',')
9740 * Parse a asm statement clobber specification.
9742 static asm_clobber_t *parse_asm_clobbers(void)
9744 asm_clobber_t *result = NULL;
9745 asm_clobber_t *last = NULL;
9747 while (token.type == T_STRING_LITERAL) {
9748 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9749 clobber->clobber = parse_string_literals();
9752 last->next = clobber;
9758 if (token.type != ',')
9767 * Parse an asm statement.
9769 static statement_t *parse_asm_statement(void)
9771 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9772 asm_statement_t *asm_statement = &statement->asms;
9776 if (token.type == T_volatile) {
9778 asm_statement->is_volatile = true;
9781 expect('(', end_error);
9782 add_anchor_token(')');
9783 add_anchor_token(':');
9784 asm_statement->asm_text = parse_string_literals();
9786 if (token.type != ':') {
9787 rem_anchor_token(':');
9792 asm_statement->outputs = parse_asm_arguments(true);
9793 if (token.type != ':') {
9794 rem_anchor_token(':');
9799 asm_statement->inputs = parse_asm_arguments(false);
9800 if (token.type != ':') {
9801 rem_anchor_token(':');
9804 rem_anchor_token(':');
9807 asm_statement->clobbers = parse_asm_clobbers();
9810 rem_anchor_token(')');
9811 expect(')', end_error);
9812 expect(';', end_error);
9814 if (asm_statement->outputs == NULL) {
9815 /* GCC: An 'asm' instruction without any output operands will be treated
9816 * identically to a volatile 'asm' instruction. */
9817 asm_statement->is_volatile = true;
9822 return create_invalid_statement();
9826 * Parse a case statement.
9828 static statement_t *parse_case_statement(void)
9830 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9831 source_position_t *const pos = &statement->base.source_position;
9835 expression_t *const expression = parse_expression();
9836 statement->case_label.expression = expression;
9837 if (!is_constant_expression(expression)) {
9838 /* This check does not prevent the error message in all cases of an
9839 * prior error while parsing the expression. At least it catches the
9840 * common case of a mistyped enum entry. */
9841 if (is_type_valid(skip_typeref(expression->base.type))) {
9842 errorf(pos, "case label does not reduce to an integer constant");
9844 statement->case_label.is_bad = true;
9846 long const val = fold_constant(expression);
9847 statement->case_label.first_case = val;
9848 statement->case_label.last_case = val;
9852 if (token.type == T_DOTDOTDOT) {
9854 expression_t *const end_range = parse_expression();
9855 statement->case_label.end_range = end_range;
9856 if (!is_constant_expression(end_range)) {
9857 /* This check does not prevent the error message in all cases of an
9858 * prior error while parsing the expression. At least it catches the
9859 * common case of a mistyped enum entry. */
9860 if (is_type_valid(skip_typeref(end_range->base.type))) {
9861 errorf(pos, "case range does not reduce to an integer constant");
9863 statement->case_label.is_bad = true;
9865 long const val = fold_constant(end_range);
9866 statement->case_label.last_case = val;
9868 if (warning.other && val < statement->case_label.first_case) {
9869 statement->case_label.is_empty_range = true;
9870 warningf(pos, "empty range specified");
9876 PUSH_PARENT(statement);
9878 expect(':', end_error);
9881 if (current_switch != NULL) {
9882 if (! statement->case_label.is_bad) {
9883 /* Check for duplicate case values */
9884 case_label_statement_t *c = &statement->case_label;
9885 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9886 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9889 if (c->last_case < l->first_case || c->first_case > l->last_case)
9892 errorf(pos, "duplicate case value (previously used %P)",
9893 &l->base.source_position);
9897 /* link all cases into the switch statement */
9898 if (current_switch->last_case == NULL) {
9899 current_switch->first_case = &statement->case_label;
9901 current_switch->last_case->next = &statement->case_label;
9903 current_switch->last_case = &statement->case_label;
9905 errorf(pos, "case label not within a switch statement");
9908 statement_t *const inner_stmt = parse_statement();
9909 statement->case_label.statement = inner_stmt;
9910 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9911 errorf(&inner_stmt->base.source_position, "declaration after case label");
9919 * Parse a default statement.
9921 static statement_t *parse_default_statement(void)
9923 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9927 PUSH_PARENT(statement);
9929 expect(':', end_error);
9930 if (current_switch != NULL) {
9931 const case_label_statement_t *def_label = current_switch->default_label;
9932 if (def_label != NULL) {
9933 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9934 &def_label->base.source_position);
9936 current_switch->default_label = &statement->case_label;
9938 /* link all cases into the switch statement */
9939 if (current_switch->last_case == NULL) {
9940 current_switch->first_case = &statement->case_label;
9942 current_switch->last_case->next = &statement->case_label;
9944 current_switch->last_case = &statement->case_label;
9947 errorf(&statement->base.source_position,
9948 "'default' label not within a switch statement");
9951 statement_t *const inner_stmt = parse_statement();
9952 statement->case_label.statement = inner_stmt;
9953 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9954 errorf(&inner_stmt->base.source_position, "declaration after default label");
9961 return create_invalid_statement();
9965 * Parse a label statement.
9967 static statement_t *parse_label_statement(void)
9969 assert(token.type == T_IDENTIFIER);
9970 symbol_t *symbol = token.v.symbol;
9971 label_t *label = get_label(symbol);
9973 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9974 statement->label.label = label;
9978 PUSH_PARENT(statement);
9980 /* if statement is already set then the label is defined twice,
9981 * otherwise it was just mentioned in a goto/local label declaration so far
9983 if (label->statement != NULL) {
9984 errorf(HERE, "duplicate label '%Y' (declared %P)",
9985 symbol, &label->base.source_position);
9987 label->base.source_position = token.source_position;
9988 label->statement = statement;
9993 if (token.type == '}') {
9994 /* TODO only warn? */
9995 if (warning.other && false) {
9996 warningf(HERE, "label at end of compound statement");
9997 statement->label.statement = create_empty_statement();
9999 errorf(HERE, "label at end of compound statement");
10000 statement->label.statement = create_invalid_statement();
10002 } else if (token.type == ';') {
10003 /* Eat an empty statement here, to avoid the warning about an empty
10004 * statement after a label. label:; is commonly used to have a label
10005 * before a closing brace. */
10006 statement->label.statement = create_empty_statement();
10009 statement_t *const inner_stmt = parse_statement();
10010 statement->label.statement = inner_stmt;
10011 if (inner_stmt->kind == STATEMENT_DECLARATION) {
10012 errorf(&inner_stmt->base.source_position, "declaration after label");
10016 /* remember the labels in a list for later checking */
10017 *label_anchor = &statement->label;
10018 label_anchor = &statement->label.next;
10025 * Parse an if statement.
10027 static statement_t *parse_if(void)
10029 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
10033 PUSH_PARENT(statement);
10035 add_anchor_token('{');
10037 expect('(', end_error);
10038 add_anchor_token(')');
10039 expression_t *const expr = parse_expression();
10040 statement->ifs.condition = expr;
10041 /* §6.8.4.1:1 The controlling expression of an if statement shall have
10043 semantic_condition(expr, "condition of 'if'-statment");
10044 mark_vars_read(expr, NULL);
10045 rem_anchor_token(')');
10046 expect(')', end_error);
10049 rem_anchor_token('{');
10051 add_anchor_token(T_else);
10052 statement_t *const true_stmt = parse_statement();
10053 statement->ifs.true_statement = true_stmt;
10054 rem_anchor_token(T_else);
10056 if (token.type == T_else) {
10058 statement->ifs.false_statement = parse_statement();
10059 } else if (warning.parentheses &&
10060 true_stmt->kind == STATEMENT_IF &&
10061 true_stmt->ifs.false_statement != NULL) {
10062 warningf(&true_stmt->base.source_position,
10063 "suggest explicit braces to avoid ambiguous 'else'");
10071 * Check that all enums are handled in a switch.
10073 * @param statement the switch statement to check
10075 static void check_enum_cases(const switch_statement_t *statement)
10077 const type_t *type = skip_typeref(statement->expression->base.type);
10078 if (! is_type_enum(type))
10080 const enum_type_t *enumt = &type->enumt;
10082 /* if we have a default, no warnings */
10083 if (statement->default_label != NULL)
10086 /* FIXME: calculation of value should be done while parsing */
10087 /* TODO: quadratic algorithm here. Change to an n log n one */
10088 long last_value = -1;
10089 const entity_t *entry = enumt->enume->base.next;
10090 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
10091 entry = entry->base.next) {
10092 const expression_t *expression = entry->enum_value.value;
10093 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
10094 bool found = false;
10095 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
10096 if (l->expression == NULL)
10098 if (l->first_case <= value && value <= l->last_case) {
10104 warningf(&statement->base.source_position,
10105 "enumeration value '%Y' not handled in switch",
10106 entry->base.symbol);
10108 last_value = value;
10113 * Parse a switch statement.
10115 static statement_t *parse_switch(void)
10117 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
10121 PUSH_PARENT(statement);
10123 expect('(', end_error);
10124 add_anchor_token(')');
10125 expression_t *const expr = parse_expression();
10126 mark_vars_read(expr, NULL);
10127 type_t * type = skip_typeref(expr->base.type);
10128 if (is_type_integer(type)) {
10129 type = promote_integer(type);
10130 if (warning.traditional) {
10131 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
10132 warningf(&expr->base.source_position,
10133 "'%T' switch expression not converted to '%T' in ISO C",
10137 } else if (is_type_valid(type)) {
10138 errorf(&expr->base.source_position,
10139 "switch quantity is not an integer, but '%T'", type);
10140 type = type_error_type;
10142 statement->switchs.expression = create_implicit_cast(expr, type);
10143 expect(')', end_error);
10144 rem_anchor_token(')');
10146 switch_statement_t *rem = current_switch;
10147 current_switch = &statement->switchs;
10148 statement->switchs.body = parse_statement();
10149 current_switch = rem;
10151 if (warning.switch_default &&
10152 statement->switchs.default_label == NULL) {
10153 warningf(&statement->base.source_position, "switch has no default case");
10155 if (warning.switch_enum)
10156 check_enum_cases(&statement->switchs);
10162 return create_invalid_statement();
10165 static statement_t *parse_loop_body(statement_t *const loop)
10167 statement_t *const rem = current_loop;
10168 current_loop = loop;
10170 statement_t *const body = parse_statement();
10172 current_loop = rem;
10177 * Parse a while statement.
10179 static statement_t *parse_while(void)
10181 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
10185 PUSH_PARENT(statement);
10187 expect('(', end_error);
10188 add_anchor_token(')');
10189 expression_t *const cond = parse_expression();
10190 statement->whiles.condition = cond;
10191 /* §6.8.5:2 The controlling expression of an iteration statement shall
10192 * have scalar type. */
10193 semantic_condition(cond, "condition of 'while'-statement");
10194 mark_vars_read(cond, NULL);
10195 rem_anchor_token(')');
10196 expect(')', end_error);
10198 statement->whiles.body = parse_loop_body(statement);
10204 return create_invalid_statement();
10208 * Parse a do statement.
10210 static statement_t *parse_do(void)
10212 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
10216 PUSH_PARENT(statement);
10218 add_anchor_token(T_while);
10219 statement->do_while.body = parse_loop_body(statement);
10220 rem_anchor_token(T_while);
10222 expect(T_while, end_error);
10223 expect('(', end_error);
10224 add_anchor_token(')');
10225 expression_t *const cond = parse_expression();
10226 statement->do_while.condition = cond;
10227 /* §6.8.5:2 The controlling expression of an iteration statement shall
10228 * have scalar type. */
10229 semantic_condition(cond, "condition of 'do-while'-statement");
10230 mark_vars_read(cond, NULL);
10231 rem_anchor_token(')');
10232 expect(')', end_error);
10233 expect(';', end_error);
10239 return create_invalid_statement();
10243 * Parse a for statement.
10245 static statement_t *parse_for(void)
10247 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
10251 expect('(', end_error1);
10252 add_anchor_token(')');
10254 PUSH_PARENT(statement);
10256 size_t const top = environment_top();
10257 scope_t *old_scope = scope_push(&statement->fors.scope);
10259 if (token.type == ';') {
10261 } else if (is_declaration_specifier(&token, false)) {
10262 parse_declaration(record_entity, DECL_FLAGS_NONE);
10264 add_anchor_token(';');
10265 expression_t *const init = parse_expression();
10266 statement->fors.initialisation = init;
10267 mark_vars_read(init, ENT_ANY);
10268 if (warning.unused_value && !expression_has_effect(init)) {
10269 warningf(&init->base.source_position,
10270 "initialisation of 'for'-statement has no effect");
10272 rem_anchor_token(';');
10273 expect(';', end_error2);
10276 if (token.type != ';') {
10277 add_anchor_token(';');
10278 expression_t *const cond = parse_expression();
10279 statement->fors.condition = cond;
10280 /* §6.8.5:2 The controlling expression of an iteration statement
10281 * shall have scalar type. */
10282 semantic_condition(cond, "condition of 'for'-statement");
10283 mark_vars_read(cond, NULL);
10284 rem_anchor_token(';');
10286 expect(';', end_error2);
10287 if (token.type != ')') {
10288 expression_t *const step = parse_expression();
10289 statement->fors.step = step;
10290 mark_vars_read(step, ENT_ANY);
10291 if (warning.unused_value && !expression_has_effect(step)) {
10292 warningf(&step->base.source_position,
10293 "step of 'for'-statement has no effect");
10296 expect(')', end_error2);
10297 rem_anchor_token(')');
10298 statement->fors.body = parse_loop_body(statement);
10300 assert(current_scope == &statement->fors.scope);
10301 scope_pop(old_scope);
10302 environment_pop_to(top);
10309 rem_anchor_token(')');
10310 assert(current_scope == &statement->fors.scope);
10311 scope_pop(old_scope);
10312 environment_pop_to(top);
10316 return create_invalid_statement();
10320 * Parse a goto statement.
10322 static statement_t *parse_goto(void)
10324 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
10327 if (GNU_MODE && token.type == '*') {
10329 expression_t *expression = parse_expression();
10330 mark_vars_read(expression, NULL);
10332 /* Argh: although documentation says the expression must be of type void*,
10333 * gcc accepts anything that can be casted into void* without error */
10334 type_t *type = expression->base.type;
10336 if (type != type_error_type) {
10337 if (!is_type_pointer(type) && !is_type_integer(type)) {
10338 errorf(&expression->base.source_position,
10339 "cannot convert to a pointer type");
10340 } else if (warning.other && type != type_void_ptr) {
10341 warningf(&expression->base.source_position,
10342 "type of computed goto expression should be 'void*' not '%T'", type);
10344 expression = create_implicit_cast(expression, type_void_ptr);
10347 statement->gotos.expression = expression;
10349 if (token.type != T_IDENTIFIER) {
10351 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
10353 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
10354 eat_until_anchor();
10357 symbol_t *symbol = token.v.symbol;
10360 statement->gotos.label = get_label(symbol);
10363 /* remember the goto's in a list for later checking */
10364 *goto_anchor = &statement->gotos;
10365 goto_anchor = &statement->gotos.next;
10367 expect(';', end_error);
10371 return create_invalid_statement();
10375 * Parse a continue statement.
10377 static statement_t *parse_continue(void)
10379 if (current_loop == NULL) {
10380 errorf(HERE, "continue statement not within loop");
10383 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
10386 expect(';', end_error);
10393 * Parse a break statement.
10395 static statement_t *parse_break(void)
10397 if (current_switch == NULL && current_loop == NULL) {
10398 errorf(HERE, "break statement not within loop or switch");
10401 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
10404 expect(';', end_error);
10411 * Parse a __leave statement.
10413 static statement_t *parse_leave_statement(void)
10415 if (current_try == NULL) {
10416 errorf(HERE, "__leave statement not within __try");
10419 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
10422 expect(';', end_error);
10429 * Check if a given entity represents a local variable.
10431 static bool is_local_variable(const entity_t *entity)
10433 if (entity->kind != ENTITY_VARIABLE)
10436 switch ((storage_class_tag_t) entity->declaration.storage_class) {
10437 case STORAGE_CLASS_AUTO:
10438 case STORAGE_CLASS_REGISTER: {
10439 const type_t *type = skip_typeref(entity->declaration.type);
10440 if (is_type_function(type)) {
10452 * Check if a given expression represents a local variable.
10454 static bool expression_is_local_variable(const expression_t *expression)
10456 if (expression->base.kind != EXPR_REFERENCE) {
10459 const entity_t *entity = expression->reference.entity;
10460 return is_local_variable(entity);
10464 * Check if a given expression represents a local variable and
10465 * return its declaration then, else return NULL.
10467 entity_t *expression_is_variable(const expression_t *expression)
10469 if (expression->base.kind != EXPR_REFERENCE) {
10472 entity_t *entity = expression->reference.entity;
10473 if (entity->kind != ENTITY_VARIABLE)
10480 * Parse a return statement.
10482 static statement_t *parse_return(void)
10486 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10488 expression_t *return_value = NULL;
10489 if (token.type != ';') {
10490 return_value = parse_expression();
10491 mark_vars_read(return_value, NULL);
10494 const type_t *const func_type = skip_typeref(current_function->base.type);
10495 assert(is_type_function(func_type));
10496 type_t *const return_type = skip_typeref(func_type->function.return_type);
10498 source_position_t const *const pos = &statement->base.source_position;
10499 if (return_value != NULL) {
10500 type_t *return_value_type = skip_typeref(return_value->base.type);
10502 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10503 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10504 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10505 /* Only warn in C mode, because GCC does the same */
10506 if (c_mode & _CXX || strict_mode) {
10508 "'return' with a value, in function returning 'void'");
10509 } else if (warning.other) {
10511 "'return' with a value, in function returning 'void'");
10513 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10514 /* Only warn in C mode, because GCC does the same */
10517 "'return' with expression in function return 'void'");
10518 } else if (warning.other) {
10520 "'return' with expression in function return 'void'");
10524 assign_error_t error = semantic_assign(return_type, return_value);
10525 report_assign_error(error, return_type, return_value, "'return'",
10528 return_value = create_implicit_cast(return_value, return_type);
10529 /* check for returning address of a local var */
10530 if (warning.other && return_value != NULL
10531 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10532 const expression_t *expression = return_value->unary.value;
10533 if (expression_is_local_variable(expression)) {
10534 warningf(pos, "function returns address of local variable");
10537 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10538 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10539 if (c_mode & _CXX || strict_mode) {
10541 "'return' without value, in function returning non-void");
10544 "'return' without value, in function returning non-void");
10547 statement->returns.value = return_value;
10549 expect(';', end_error);
10556 * Parse a declaration statement.
10558 static statement_t *parse_declaration_statement(void)
10560 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10562 entity_t *before = current_scope->last_entity;
10564 parse_external_declaration();
10566 parse_declaration(record_entity, DECL_FLAGS_NONE);
10569 declaration_statement_t *const decl = &statement->declaration;
10570 entity_t *const begin =
10571 before != NULL ? before->base.next : current_scope->entities;
10572 decl->declarations_begin = begin;
10573 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10579 * Parse an expression statement, ie. expr ';'.
10581 static statement_t *parse_expression_statement(void)
10583 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10585 expression_t *const expr = parse_expression();
10586 statement->expression.expression = expr;
10587 mark_vars_read(expr, ENT_ANY);
10589 expect(';', end_error);
10596 * Parse a microsoft __try { } __finally { } or
10597 * __try{ } __except() { }
10599 static statement_t *parse_ms_try_statment(void)
10601 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10604 PUSH_PARENT(statement);
10606 ms_try_statement_t *rem = current_try;
10607 current_try = &statement->ms_try;
10608 statement->ms_try.try_statement = parse_compound_statement(false);
10613 if (token.type == T___except) {
10615 expect('(', end_error);
10616 add_anchor_token(')');
10617 expression_t *const expr = parse_expression();
10618 mark_vars_read(expr, NULL);
10619 type_t * type = skip_typeref(expr->base.type);
10620 if (is_type_integer(type)) {
10621 type = promote_integer(type);
10622 } else if (is_type_valid(type)) {
10623 errorf(&expr->base.source_position,
10624 "__expect expression is not an integer, but '%T'", type);
10625 type = type_error_type;
10627 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10628 rem_anchor_token(')');
10629 expect(')', end_error);
10630 statement->ms_try.final_statement = parse_compound_statement(false);
10631 } else if (token.type == T__finally) {
10633 statement->ms_try.final_statement = parse_compound_statement(false);
10635 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10636 return create_invalid_statement();
10640 return create_invalid_statement();
10643 static statement_t *parse_empty_statement(void)
10645 if (warning.empty_statement) {
10646 warningf(HERE, "statement is empty");
10648 statement_t *const statement = create_empty_statement();
10653 static statement_t *parse_local_label_declaration(void)
10655 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10659 entity_t *begin = NULL, *end = NULL;
10662 if (token.type != T_IDENTIFIER) {
10663 parse_error_expected("while parsing local label declaration",
10664 T_IDENTIFIER, NULL);
10667 symbol_t *symbol = token.v.symbol;
10668 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10669 if (entity != NULL && entity->base.parent_scope == current_scope) {
10670 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10671 symbol, &entity->base.source_position);
10673 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10675 entity->base.parent_scope = current_scope;
10676 entity->base.namespc = NAMESPACE_LABEL;
10677 entity->base.source_position = token.source_position;
10678 entity->base.symbol = symbol;
10681 end->base.next = entity;
10686 environment_push(entity);
10690 if (token.type != ',')
10696 statement->declaration.declarations_begin = begin;
10697 statement->declaration.declarations_end = end;
10701 static void parse_namespace_definition(void)
10705 entity_t *entity = NULL;
10706 symbol_t *symbol = NULL;
10708 if (token.type == T_IDENTIFIER) {
10709 symbol = token.v.symbol;
10712 entity = get_entity(symbol, NAMESPACE_NORMAL);
10713 if (entity != NULL &&
10714 entity->kind != ENTITY_NAMESPACE &&
10715 entity->base.parent_scope == current_scope) {
10716 if (!is_error_entity(entity)) {
10717 error_redefined_as_different_kind(&token.source_position,
10718 entity, ENTITY_NAMESPACE);
10724 if (entity == NULL) {
10725 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10726 entity->base.symbol = symbol;
10727 entity->base.source_position = token.source_position;
10728 entity->base.namespc = NAMESPACE_NORMAL;
10729 entity->base.parent_scope = current_scope;
10732 if (token.type == '=') {
10733 /* TODO: parse namespace alias */
10734 panic("namespace alias definition not supported yet");
10737 environment_push(entity);
10738 append_entity(current_scope, entity);
10740 size_t const top = environment_top();
10741 scope_t *old_scope = scope_push(&entity->namespacee.members);
10743 expect('{', end_error);
10745 expect('}', end_error);
10748 assert(current_scope == &entity->namespacee.members);
10749 scope_pop(old_scope);
10750 environment_pop_to(top);
10754 * Parse a statement.
10755 * There's also parse_statement() which additionally checks for
10756 * "statement has no effect" warnings
10758 static statement_t *intern_parse_statement(void)
10760 statement_t *statement = NULL;
10762 /* declaration or statement */
10763 add_anchor_token(';');
10764 switch (token.type) {
10765 case T_IDENTIFIER: {
10766 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10767 if (la1_type == ':') {
10768 statement = parse_label_statement();
10769 } else if (is_typedef_symbol(token.v.symbol)) {
10770 statement = parse_declaration_statement();
10772 /* it's an identifier, the grammar says this must be an
10773 * expression statement. However it is common that users mistype
10774 * declaration types, so we guess a bit here to improve robustness
10775 * for incorrect programs */
10776 switch (la1_type) {
10779 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10780 goto expression_statment;
10785 statement = parse_declaration_statement();
10789 expression_statment:
10790 statement = parse_expression_statement();
10797 case T___extension__:
10798 /* This can be a prefix to a declaration or an expression statement.
10799 * We simply eat it now and parse the rest with tail recursion. */
10802 } while (token.type == T___extension__);
10803 bool old_gcc_extension = in_gcc_extension;
10804 in_gcc_extension = true;
10805 statement = intern_parse_statement();
10806 in_gcc_extension = old_gcc_extension;
10810 statement = parse_declaration_statement();
10814 statement = parse_local_label_declaration();
10817 case ';': statement = parse_empty_statement(); break;
10818 case '{': statement = parse_compound_statement(false); break;
10819 case T___leave: statement = parse_leave_statement(); break;
10820 case T___try: statement = parse_ms_try_statment(); break;
10821 case T_asm: statement = parse_asm_statement(); break;
10822 case T_break: statement = parse_break(); break;
10823 case T_case: statement = parse_case_statement(); break;
10824 case T_continue: statement = parse_continue(); break;
10825 case T_default: statement = parse_default_statement(); break;
10826 case T_do: statement = parse_do(); break;
10827 case T_for: statement = parse_for(); break;
10828 case T_goto: statement = parse_goto(); break;
10829 case T_if: statement = parse_if(); break;
10830 case T_return: statement = parse_return(); break;
10831 case T_switch: statement = parse_switch(); break;
10832 case T_while: statement = parse_while(); break;
10835 statement = parse_expression_statement();
10839 errorf(HERE, "unexpected token %K while parsing statement", &token);
10840 statement = create_invalid_statement();
10845 rem_anchor_token(';');
10847 assert(statement != NULL
10848 && statement->base.source_position.input_name != NULL);
10854 * parse a statement and emits "statement has no effect" warning if needed
10855 * (This is really a wrapper around intern_parse_statement with check for 1
10856 * single warning. It is needed, because for statement expressions we have
10857 * to avoid the warning on the last statement)
10859 static statement_t *parse_statement(void)
10861 statement_t *statement = intern_parse_statement();
10863 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10864 expression_t *expression = statement->expression.expression;
10865 if (!expression_has_effect(expression)) {
10866 warningf(&expression->base.source_position,
10867 "statement has no effect");
10875 * Parse a compound statement.
10877 static statement_t *parse_compound_statement(bool inside_expression_statement)
10879 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10881 PUSH_PARENT(statement);
10884 add_anchor_token('}');
10885 /* tokens, which can start a statement */
10886 /* TODO MS, __builtin_FOO */
10887 add_anchor_token('!');
10888 add_anchor_token('&');
10889 add_anchor_token('(');
10890 add_anchor_token('*');
10891 add_anchor_token('+');
10892 add_anchor_token('-');
10893 add_anchor_token('{');
10894 add_anchor_token('~');
10895 add_anchor_token(T_CHARACTER_CONSTANT);
10896 add_anchor_token(T_COLONCOLON);
10897 add_anchor_token(T_FLOATINGPOINT);
10898 add_anchor_token(T_IDENTIFIER);
10899 add_anchor_token(T_INTEGER);
10900 add_anchor_token(T_MINUSMINUS);
10901 add_anchor_token(T_PLUSPLUS);
10902 add_anchor_token(T_STRING_LITERAL);
10903 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10904 add_anchor_token(T_WIDE_STRING_LITERAL);
10905 add_anchor_token(T__Bool);
10906 add_anchor_token(T__Complex);
10907 add_anchor_token(T__Imaginary);
10908 add_anchor_token(T___FUNCTION__);
10909 add_anchor_token(T___PRETTY_FUNCTION__);
10910 add_anchor_token(T___alignof__);
10911 add_anchor_token(T___attribute__);
10912 add_anchor_token(T___builtin_va_start);
10913 add_anchor_token(T___extension__);
10914 add_anchor_token(T___func__);
10915 add_anchor_token(T___imag__);
10916 add_anchor_token(T___label__);
10917 add_anchor_token(T___real__);
10918 add_anchor_token(T___thread);
10919 add_anchor_token(T_asm);
10920 add_anchor_token(T_auto);
10921 add_anchor_token(T_bool);
10922 add_anchor_token(T_break);
10923 add_anchor_token(T_case);
10924 add_anchor_token(T_char);
10925 add_anchor_token(T_class);
10926 add_anchor_token(T_const);
10927 add_anchor_token(T_const_cast);
10928 add_anchor_token(T_continue);
10929 add_anchor_token(T_default);
10930 add_anchor_token(T_delete);
10931 add_anchor_token(T_double);
10932 add_anchor_token(T_do);
10933 add_anchor_token(T_dynamic_cast);
10934 add_anchor_token(T_enum);
10935 add_anchor_token(T_extern);
10936 add_anchor_token(T_false);
10937 add_anchor_token(T_float);
10938 add_anchor_token(T_for);
10939 add_anchor_token(T_goto);
10940 add_anchor_token(T_if);
10941 add_anchor_token(T_inline);
10942 add_anchor_token(T_int);
10943 add_anchor_token(T_long);
10944 add_anchor_token(T_new);
10945 add_anchor_token(T_operator);
10946 add_anchor_token(T_register);
10947 add_anchor_token(T_reinterpret_cast);
10948 add_anchor_token(T_restrict);
10949 add_anchor_token(T_return);
10950 add_anchor_token(T_short);
10951 add_anchor_token(T_signed);
10952 add_anchor_token(T_sizeof);
10953 add_anchor_token(T_static);
10954 add_anchor_token(T_static_cast);
10955 add_anchor_token(T_struct);
10956 add_anchor_token(T_switch);
10957 add_anchor_token(T_template);
10958 add_anchor_token(T_this);
10959 add_anchor_token(T_throw);
10960 add_anchor_token(T_true);
10961 add_anchor_token(T_try);
10962 add_anchor_token(T_typedef);
10963 add_anchor_token(T_typeid);
10964 add_anchor_token(T_typename);
10965 add_anchor_token(T_typeof);
10966 add_anchor_token(T_union);
10967 add_anchor_token(T_unsigned);
10968 add_anchor_token(T_using);
10969 add_anchor_token(T_void);
10970 add_anchor_token(T_volatile);
10971 add_anchor_token(T_wchar_t);
10972 add_anchor_token(T_while);
10974 size_t const top = environment_top();
10975 scope_t *old_scope = scope_push(&statement->compound.scope);
10977 statement_t **anchor = &statement->compound.statements;
10978 bool only_decls_so_far = true;
10979 while (token.type != '}') {
10980 if (token.type == T_EOF) {
10981 errorf(&statement->base.source_position,
10982 "EOF while parsing compound statement");
10985 statement_t *sub_statement = intern_parse_statement();
10986 if (is_invalid_statement(sub_statement)) {
10987 /* an error occurred. if we are at an anchor, return */
10993 if (warning.declaration_after_statement) {
10994 if (sub_statement->kind != STATEMENT_DECLARATION) {
10995 only_decls_so_far = false;
10996 } else if (!only_decls_so_far) {
10997 warningf(&sub_statement->base.source_position,
10998 "ISO C90 forbids mixed declarations and code");
11002 *anchor = sub_statement;
11004 while (sub_statement->base.next != NULL)
11005 sub_statement = sub_statement->base.next;
11007 anchor = &sub_statement->base.next;
11011 /* look over all statements again to produce no effect warnings */
11012 if (warning.unused_value) {
11013 statement_t *sub_statement = statement->compound.statements;
11014 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
11015 if (sub_statement->kind != STATEMENT_EXPRESSION)
11017 /* don't emit a warning for the last expression in an expression
11018 * statement as it has always an effect */
11019 if (inside_expression_statement && sub_statement->base.next == NULL)
11022 expression_t *expression = sub_statement->expression.expression;
11023 if (!expression_has_effect(expression)) {
11024 warningf(&expression->base.source_position,
11025 "statement has no effect");
11031 rem_anchor_token(T_while);
11032 rem_anchor_token(T_wchar_t);
11033 rem_anchor_token(T_volatile);
11034 rem_anchor_token(T_void);
11035 rem_anchor_token(T_using);
11036 rem_anchor_token(T_unsigned);
11037 rem_anchor_token(T_union);
11038 rem_anchor_token(T_typeof);
11039 rem_anchor_token(T_typename);
11040 rem_anchor_token(T_typeid);
11041 rem_anchor_token(T_typedef);
11042 rem_anchor_token(T_try);
11043 rem_anchor_token(T_true);
11044 rem_anchor_token(T_throw);
11045 rem_anchor_token(T_this);
11046 rem_anchor_token(T_template);
11047 rem_anchor_token(T_switch);
11048 rem_anchor_token(T_struct);
11049 rem_anchor_token(T_static_cast);
11050 rem_anchor_token(T_static);
11051 rem_anchor_token(T_sizeof);
11052 rem_anchor_token(T_signed);
11053 rem_anchor_token(T_short);
11054 rem_anchor_token(T_return);
11055 rem_anchor_token(T_restrict);
11056 rem_anchor_token(T_reinterpret_cast);
11057 rem_anchor_token(T_register);
11058 rem_anchor_token(T_operator);
11059 rem_anchor_token(T_new);
11060 rem_anchor_token(T_long);
11061 rem_anchor_token(T_int);
11062 rem_anchor_token(T_inline);
11063 rem_anchor_token(T_if);
11064 rem_anchor_token(T_goto);
11065 rem_anchor_token(T_for);
11066 rem_anchor_token(T_float);
11067 rem_anchor_token(T_false);
11068 rem_anchor_token(T_extern);
11069 rem_anchor_token(T_enum);
11070 rem_anchor_token(T_dynamic_cast);
11071 rem_anchor_token(T_do);
11072 rem_anchor_token(T_double);
11073 rem_anchor_token(T_delete);
11074 rem_anchor_token(T_default);
11075 rem_anchor_token(T_continue);
11076 rem_anchor_token(T_const_cast);
11077 rem_anchor_token(T_const);
11078 rem_anchor_token(T_class);
11079 rem_anchor_token(T_char);
11080 rem_anchor_token(T_case);
11081 rem_anchor_token(T_break);
11082 rem_anchor_token(T_bool);
11083 rem_anchor_token(T_auto);
11084 rem_anchor_token(T_asm);
11085 rem_anchor_token(T___thread);
11086 rem_anchor_token(T___real__);
11087 rem_anchor_token(T___label__);
11088 rem_anchor_token(T___imag__);
11089 rem_anchor_token(T___func__);
11090 rem_anchor_token(T___extension__);
11091 rem_anchor_token(T___builtin_va_start);
11092 rem_anchor_token(T___attribute__);
11093 rem_anchor_token(T___alignof__);
11094 rem_anchor_token(T___PRETTY_FUNCTION__);
11095 rem_anchor_token(T___FUNCTION__);
11096 rem_anchor_token(T__Imaginary);
11097 rem_anchor_token(T__Complex);
11098 rem_anchor_token(T__Bool);
11099 rem_anchor_token(T_WIDE_STRING_LITERAL);
11100 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
11101 rem_anchor_token(T_STRING_LITERAL);
11102 rem_anchor_token(T_PLUSPLUS);
11103 rem_anchor_token(T_MINUSMINUS);
11104 rem_anchor_token(T_INTEGER);
11105 rem_anchor_token(T_IDENTIFIER);
11106 rem_anchor_token(T_FLOATINGPOINT);
11107 rem_anchor_token(T_COLONCOLON);
11108 rem_anchor_token(T_CHARACTER_CONSTANT);
11109 rem_anchor_token('~');
11110 rem_anchor_token('{');
11111 rem_anchor_token('-');
11112 rem_anchor_token('+');
11113 rem_anchor_token('*');
11114 rem_anchor_token('(');
11115 rem_anchor_token('&');
11116 rem_anchor_token('!');
11117 rem_anchor_token('}');
11118 assert(current_scope == &statement->compound.scope);
11119 scope_pop(old_scope);
11120 environment_pop_to(top);
11127 * Check for unused global static functions and variables
11129 static void check_unused_globals(void)
11131 if (!warning.unused_function && !warning.unused_variable)
11134 for (const entity_t *entity = file_scope->entities; entity != NULL;
11135 entity = entity->base.next) {
11136 if (!is_declaration(entity))
11139 const declaration_t *declaration = &entity->declaration;
11140 if (declaration->used ||
11141 declaration->modifiers & DM_UNUSED ||
11142 declaration->modifiers & DM_USED ||
11143 declaration->storage_class != STORAGE_CLASS_STATIC)
11146 type_t *const type = declaration->type;
11148 if (entity->kind == ENTITY_FUNCTION) {
11149 /* inhibit warning for static inline functions */
11150 if (entity->function.is_inline)
11153 s = entity->function.statement != NULL ? "defined" : "declared";
11158 warningf(&declaration->base.source_position, "'%#T' %s but not used",
11159 type, declaration->base.symbol, s);
11163 static void parse_global_asm(void)
11165 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
11168 expect('(', end_error);
11170 statement->asms.asm_text = parse_string_literals();
11171 statement->base.next = unit->global_asm;
11172 unit->global_asm = statement;
11174 expect(')', end_error);
11175 expect(';', end_error);
11180 static void parse_linkage_specification(void)
11183 assert(token.type == T_STRING_LITERAL);
11185 const char *linkage = parse_string_literals().begin;
11187 linkage_kind_t old_linkage = current_linkage;
11188 linkage_kind_t new_linkage;
11189 if (strcmp(linkage, "C") == 0) {
11190 new_linkage = LINKAGE_C;
11191 } else if (strcmp(linkage, "C++") == 0) {
11192 new_linkage = LINKAGE_CXX;
11194 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
11195 new_linkage = LINKAGE_INVALID;
11197 current_linkage = new_linkage;
11199 if (token.type == '{') {
11202 expect('}', end_error);
11208 assert(current_linkage == new_linkage);
11209 current_linkage = old_linkage;
11212 static void parse_external(void)
11214 switch (token.type) {
11215 DECLARATION_START_NO_EXTERN
11217 case T___extension__:
11218 /* tokens below are for implicit int */
11219 case '&': /* & x; -> int& x; (and error later, because C++ has no
11221 case '*': /* * x; -> int* x; */
11222 case '(': /* (x); -> int (x); */
11223 parse_external_declaration();
11227 if (look_ahead(1)->type == T_STRING_LITERAL) {
11228 parse_linkage_specification();
11230 parse_external_declaration();
11235 parse_global_asm();
11239 parse_namespace_definition();
11243 if (!strict_mode) {
11245 warningf(HERE, "stray ';' outside of function");
11252 errorf(HERE, "stray %K outside of function", &token);
11253 if (token.type == '(' || token.type == '{' || token.type == '[')
11254 eat_until_matching_token(token.type);
11260 static void parse_externals(void)
11262 add_anchor_token('}');
11263 add_anchor_token(T_EOF);
11266 unsigned char token_anchor_copy[T_LAST_TOKEN];
11267 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
11270 while (token.type != T_EOF && token.type != '}') {
11272 bool anchor_leak = false;
11273 for (int i = 0; i != T_LAST_TOKEN; ++i) {
11274 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
11276 errorf(HERE, "Leaked anchor token %k %d times", i, count);
11277 anchor_leak = true;
11280 if (in_gcc_extension) {
11281 errorf(HERE, "Leaked __extension__");
11282 anchor_leak = true;
11292 rem_anchor_token(T_EOF);
11293 rem_anchor_token('}');
11297 * Parse a translation unit.
11299 static void parse_translation_unit(void)
11301 add_anchor_token(T_EOF);
11306 if (token.type == T_EOF)
11309 errorf(HERE, "stray %K outside of function", &token);
11310 if (token.type == '(' || token.type == '{' || token.type == '[')
11311 eat_until_matching_token(token.type);
11319 * @return the translation unit or NULL if errors occurred.
11321 void start_parsing(void)
11323 environment_stack = NEW_ARR_F(stack_entry_t, 0);
11324 label_stack = NEW_ARR_F(stack_entry_t, 0);
11325 diagnostic_count = 0;
11329 type_set_output(stderr);
11330 ast_set_output(stderr);
11332 assert(unit == NULL);
11333 unit = allocate_ast_zero(sizeof(unit[0]));
11335 assert(file_scope == NULL);
11336 file_scope = &unit->scope;
11338 assert(current_scope == NULL);
11339 scope_push(&unit->scope);
11341 create_gnu_builtins();
11343 create_microsoft_intrinsics();
11346 translation_unit_t *finish_parsing(void)
11348 assert(current_scope == &unit->scope);
11351 assert(file_scope == &unit->scope);
11352 check_unused_globals();
11355 DEL_ARR_F(environment_stack);
11356 DEL_ARR_F(label_stack);
11358 translation_unit_t *result = unit;
11363 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
11364 * are given length one. */
11365 static void complete_incomplete_arrays(void)
11367 size_t n = ARR_LEN(incomplete_arrays);
11368 for (size_t i = 0; i != n; ++i) {
11369 declaration_t *const decl = incomplete_arrays[i];
11370 type_t *const orig_type = decl->type;
11371 type_t *const type = skip_typeref(orig_type);
11373 if (!is_type_incomplete(type))
11376 if (warning.other) {
11377 warningf(&decl->base.source_position,
11378 "array '%#T' assumed to have one element",
11379 orig_type, decl->base.symbol);
11382 type_t *const new_type = duplicate_type(type);
11383 new_type->array.size_constant = true;
11384 new_type->array.has_implicit_size = true;
11385 new_type->array.size = 1;
11387 type_t *const result = identify_new_type(new_type);
11389 decl->type = result;
11395 lookahead_bufpos = 0;
11396 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
11399 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
11400 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
11401 parse_translation_unit();
11402 complete_incomplete_arrays();
11403 DEL_ARR_F(incomplete_arrays);
11404 incomplete_arrays = NULL;
11408 * create a builtin function.
11410 static entity_t *create_builtin_function(builtin_kind_t kind, const char *name, type_t *function_type)
11412 symbol_t *symbol = symbol_table_insert(name);
11413 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
11414 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
11415 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
11416 entity->declaration.type = function_type;
11417 entity->declaration.implicit = true;
11418 entity->base.symbol = symbol;
11419 entity->base.source_position = builtin_source_position;
11421 entity->function.btk = kind;
11423 record_entity(entity, /*is_definition=*/false);
11429 * Create predefined gnu builtins.
11431 static void create_gnu_builtins(void)
11433 #define GNU_BUILTIN(a, b) create_builtin_function(bk_gnu_builtin_##a, "__builtin_" #a, b)
11435 GNU_BUILTIN(alloca, make_function_1_type(type_void_ptr, type_size_t));
11436 GNU_BUILTIN(huge_val, make_function_0_type(type_double));
11437 GNU_BUILTIN(inf, make_function_0_type(type_double));
11438 GNU_BUILTIN(inff, make_function_0_type(type_float));
11439 GNU_BUILTIN(infl, make_function_0_type(type_long_double));
11440 GNU_BUILTIN(nan, make_function_1_type(type_double, type_char_ptr));
11441 GNU_BUILTIN(nanf, make_function_1_type(type_float, type_char_ptr));
11442 GNU_BUILTIN(nanl, make_function_1_type(type_long_double, type_char_ptr));
11443 GNU_BUILTIN(va_end, make_function_1_type(type_void, type_valist));
11444 GNU_BUILTIN(expect, make_function_2_type(type_long, type_long, type_long));
11445 GNU_BUILTIN(return_address, make_function_1_type(type_void_ptr, type_unsigned_int));
11446 GNU_BUILTIN(frame_address, make_function_1_type(type_void_ptr, type_unsigned_int));
11447 GNU_BUILTIN(ffs, make_function_1_type(type_int, type_unsigned_int));
11448 GNU_BUILTIN(clz, make_function_1_type(type_int, type_unsigned_int));
11449 GNU_BUILTIN(ctz, make_function_1_type(type_int, type_unsigned_int));
11450 GNU_BUILTIN(popcount, make_function_1_type(type_int, type_unsigned_int));
11451 GNU_BUILTIN(parity, make_function_1_type(type_int, type_unsigned_int));
11452 GNU_BUILTIN(prefetch, make_function_1_type_variadic(type_float, type_void_ptr));
11453 GNU_BUILTIN(trap, make_function_0_type_noreturn(type_void));
11459 * Create predefined MS intrinsics.
11461 static void create_microsoft_intrinsics(void)
11463 #define MS_BUILTIN(a, b) create_builtin_function(bk_ms##a, #a, b)
11465 /* intrinsics for all architectures */
11466 MS_BUILTIN(_rotl, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
11467 MS_BUILTIN(_rotr, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
11468 MS_BUILTIN(_rotl64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
11469 MS_BUILTIN(_rotr64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
11470 MS_BUILTIN(_byteswap_ushort, make_function_1_type(type_unsigned_short, type_unsigned_short));
11471 MS_BUILTIN(_byteswap_ulong, make_function_1_type(type_unsigned_long, type_unsigned_long));
11472 MS_BUILTIN(_byteswap_uint64, make_function_1_type(type_unsigned_int64, type_unsigned_int64));
11474 MS_BUILTIN(__debugbreak, make_function_0_type(type_void));
11475 MS_BUILTIN(_ReturnAddress, make_function_0_type(type_void_ptr));
11476 MS_BUILTIN(__popcount, make_function_1_type(type_unsigned_int, type_unsigned_int));
11479 MS_BUILTIN(_enable, make_function_0_type(type_void));
11480 MS_BUILTIN(_disable, make_function_0_type(type_void));
11481 MS_BUILTIN(__inbyte, make_function_1_type(type_unsigned_char, type_unsigned_short));
11482 MS_BUILTIN(__inword, make_function_1_type(type_unsigned_short, type_unsigned_short));
11483 MS_BUILTIN(__indword, make_function_1_type(type_unsigned_long, type_unsigned_short));
11484 MS_BUILTIN(__outbyte, make_function_2_type(type_void, type_unsigned_short, type_unsigned_char));
11485 MS_BUILTIN(__outword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_short));
11486 MS_BUILTIN(__outdword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_long));
11487 MS_BUILTIN(__ud2, make_function_0_type_noreturn(type_void));
11488 MS_BUILTIN(_BitScanForward, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
11489 MS_BUILTIN(_BitScanReverse, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
11490 MS_BUILTIN(_InterlockedExchange, make_function_2_type(type_long, type_long_ptr, type_long));
11491 MS_BUILTIN(_InterlockedExchange64, make_function_2_type(type_int64, type_int64_ptr, type_int64));
11493 if (machine_size <= 32) {
11494 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int));
11495 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int));
11497 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int64));
11498 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int64));
11505 * Initialize the parser.
11507 void init_parser(void)
11509 sym_anonymous = symbol_table_insert("<anonymous>");
11511 if (c_mode & _MS) {
11512 /* add predefined symbols for extended-decl-modifier */
11513 sym_align = symbol_table_insert("align");
11514 sym_allocate = symbol_table_insert("allocate");
11515 sym_dllimport = symbol_table_insert("dllimport");
11516 sym_dllexport = symbol_table_insert("dllexport");
11517 sym_naked = symbol_table_insert("naked");
11518 sym_noinline = symbol_table_insert("noinline");
11519 sym_returns_twice = symbol_table_insert("returns_twice");
11520 sym_noreturn = symbol_table_insert("noreturn");
11521 sym_nothrow = symbol_table_insert("nothrow");
11522 sym_novtable = symbol_table_insert("novtable");
11523 sym_property = symbol_table_insert("property");
11524 sym_get = symbol_table_insert("get");
11525 sym_put = symbol_table_insert("put");
11526 sym_selectany = symbol_table_insert("selectany");
11527 sym_thread = symbol_table_insert("thread");
11528 sym_uuid = symbol_table_insert("uuid");
11529 sym_deprecated = symbol_table_insert("deprecated");
11530 sym_restrict = symbol_table_insert("restrict");
11531 sym_noalias = symbol_table_insert("noalias");
11533 memset(token_anchor_set, 0, sizeof(token_anchor_set));
11535 init_expression_parsers();
11536 obstack_init(&temp_obst);
11538 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
11539 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
11543 * Terminate the parser.
11545 void exit_parser(void)
11547 obstack_free(&temp_obst, NULL);