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 2
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 have_arguments; /**< True, if this attribute has arguments. */
68 atomic_type_kind_t akind;
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;
102 * Capture a MS __base extension.
104 typedef struct based_spec_t {
105 source_position_t source_position;
106 variable_t *base_variable;
109 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
111 /** The current token. */
112 static token_t token;
113 /** The lookahead ring-buffer. */
114 static token_t lookahead_buffer[MAX_LOOKAHEAD];
115 /** Position of the next token in the lookahead buffer. */
116 static int lookahead_bufpos;
117 static stack_entry_t *environment_stack = NULL;
118 static stack_entry_t *label_stack = NULL;
119 static scope_t *file_scope = NULL;
120 static scope_t *current_scope = NULL;
121 /** Point to the current function declaration if inside a function. */
122 static function_t *current_function = NULL;
123 static entity_t *current_init_decl = NULL;
124 static switch_statement_t *current_switch = NULL;
125 static statement_t *current_loop = NULL;
126 static statement_t *current_parent = NULL;
127 static ms_try_statement_t *current_try = NULL;
128 static linkage_kind_t current_linkage = LINKAGE_INVALID;
129 static goto_statement_t *goto_first = NULL;
130 static goto_statement_t **goto_anchor = NULL;
131 static label_statement_t *label_first = NULL;
132 static label_statement_t **label_anchor = NULL;
133 /** current translation unit. */
134 static translation_unit_t *unit = NULL;
135 /** true if we are in a type property context (evaluation only for type. */
136 static bool in_type_prop = false;
137 /** true in we are in a __extension__ context. */
138 static bool in_gcc_extension = false;
139 static struct obstack temp_obst;
140 static entity_t *anonymous_entity;
141 static declaration_t **incomplete_arrays;
144 #define PUSH_PARENT(stmt) \
145 statement_t *const prev_parent = current_parent; \
146 ((void)(current_parent = (stmt)))
147 #define POP_PARENT ((void)(current_parent = prev_parent))
149 /** special symbol used for anonymous entities. */
150 static const symbol_t *sym_anonymous = NULL;
152 /* symbols for Microsoft extended-decl-modifier */
153 static const symbol_t *sym_align = NULL;
154 static const symbol_t *sym_allocate = NULL;
155 static const symbol_t *sym_dllimport = NULL;
156 static const symbol_t *sym_dllexport = NULL;
157 static const symbol_t *sym_naked = NULL;
158 static const symbol_t *sym_noinline = NULL;
159 static const symbol_t *sym_returns_twice = NULL;
160 static const symbol_t *sym_noreturn = NULL;
161 static const symbol_t *sym_nothrow = NULL;
162 static const symbol_t *sym_novtable = NULL;
163 static const symbol_t *sym_property = NULL;
164 static const symbol_t *sym_get = NULL;
165 static const symbol_t *sym_put = NULL;
166 static const symbol_t *sym_selectany = NULL;
167 static const symbol_t *sym_thread = NULL;
168 static const symbol_t *sym_uuid = NULL;
169 static const symbol_t *sym_deprecated = NULL;
170 static const symbol_t *sym_restrict = NULL;
171 static const symbol_t *sym_noalias = NULL;
173 /** The token anchor set */
174 static unsigned char token_anchor_set[T_LAST_TOKEN];
176 /** The current source position. */
177 #define HERE (&token.source_position)
179 /** true if we are in GCC mode. */
180 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
182 static type_t *type_valist;
184 static statement_t *parse_compound_statement(bool inside_expression_statement);
185 static statement_t *parse_statement(void);
187 static expression_t *parse_sub_expression(precedence_t);
188 static expression_t *parse_expression(void);
189 static type_t *parse_typename(void);
190 static void parse_externals(void);
191 static void parse_external(void);
193 static void parse_compound_type_entries(compound_t *compound_declaration);
195 typedef enum declarator_flags_t {
197 DECL_MAY_BE_ABSTRACT = 1U << 0,
198 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
199 DECL_IS_PARAMETER = 1U << 2
200 } declarator_flags_t;
202 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
203 declarator_flags_t flags);
205 static entity_t *record_entity(entity_t *entity, bool is_definition);
207 static void semantic_comparison(binary_expression_t *expression);
209 #define STORAGE_CLASSES \
210 STORAGE_CLASSES_NO_EXTERN \
213 #define STORAGE_CLASSES_NO_EXTERN \
220 #define TYPE_QUALIFIERS \
225 case T__forceinline: \
226 case T___attribute__:
228 #define COMPLEX_SPECIFIERS \
230 #define IMAGINARY_SPECIFIERS \
233 #define TYPE_SPECIFIERS \
235 case T___builtin_va_list: \
255 #define DECLARATION_START \
260 #define DECLARATION_START_NO_EXTERN \
261 STORAGE_CLASSES_NO_EXTERN \
265 #define TYPENAME_START \
269 #define EXPRESSION_START \
278 case T_CHARACTER_CONSTANT: \
279 case T_FLOATINGPOINT: \
283 case T_STRING_LITERAL: \
284 case T_WIDE_CHARACTER_CONSTANT: \
285 case T_WIDE_STRING_LITERAL: \
286 case T___FUNCDNAME__: \
287 case T___FUNCSIG__: \
288 case T___FUNCTION__: \
289 case T___PRETTY_FUNCTION__: \
290 case T___alignof__: \
291 case T___builtin_alloca: \
292 case T___builtin_classify_type: \
293 case T___builtin_constant_p: \
294 case T___builtin_expect: \
295 case T___builtin_huge_val: \
296 case T___builtin_inf: \
297 case T___builtin_inff: \
298 case T___builtin_infl: \
299 case T___builtin_isgreater: \
300 case T___builtin_isgreaterequal: \
301 case T___builtin_isless: \
302 case T___builtin_islessequal: \
303 case T___builtin_islessgreater: \
304 case T___builtin_isunordered: \
305 case T___builtin_nan: \
306 case T___builtin_nanf: \
307 case T___builtin_nanl: \
308 case T___builtin_offsetof: \
309 case T___builtin_prefetch: \
310 case T___builtin_va_arg: \
311 case T___builtin_va_end: \
312 case T___builtin_va_start: \
323 * Allocate an AST node with given size and
324 * initialize all fields with zero.
326 static void *allocate_ast_zero(size_t size)
328 void *res = allocate_ast(size);
329 memset(res, 0, size);
334 * Returns the size of an entity node.
336 * @param kind the entity kind
338 static size_t get_entity_struct_size(entity_kind_t kind)
340 static const size_t sizes[] = {
341 [ENTITY_VARIABLE] = sizeof(variable_t),
342 [ENTITY_PARAMETER] = sizeof(parameter_t),
343 [ENTITY_COMPOUND_MEMBER] = sizeof(compound_member_t),
344 [ENTITY_FUNCTION] = sizeof(function_t),
345 [ENTITY_TYPEDEF] = sizeof(typedef_t),
346 [ENTITY_STRUCT] = sizeof(compound_t),
347 [ENTITY_UNION] = sizeof(compound_t),
348 [ENTITY_ENUM] = sizeof(enum_t),
349 [ENTITY_ENUM_VALUE] = sizeof(enum_value_t),
350 [ENTITY_LABEL] = sizeof(label_t),
351 [ENTITY_LOCAL_LABEL] = sizeof(label_t),
352 [ENTITY_NAMESPACE] = sizeof(namespace_t)
354 assert(kind < sizeof(sizes) / sizeof(sizes[0]));
355 assert(sizes[kind] != 0);
360 * Allocate an entity of given kind and initialize all
363 static entity_t *allocate_entity_zero(entity_kind_t kind)
365 size_t size = get_entity_struct_size(kind);
366 entity_t *entity = allocate_ast_zero(size);
372 * Returns the size of a statement node.
374 * @param kind the statement kind
376 static size_t get_statement_struct_size(statement_kind_t kind)
378 static const size_t sizes[] = {
379 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
380 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
381 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
382 [STATEMENT_RETURN] = sizeof(return_statement_t),
383 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
384 [STATEMENT_LOCAL_LABEL] = sizeof(local_label_statement_t),
385 [STATEMENT_IF] = sizeof(if_statement_t),
386 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
387 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
388 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
389 [STATEMENT_BREAK] = sizeof(statement_base_t),
390 [STATEMENT_GOTO] = sizeof(goto_statement_t),
391 [STATEMENT_LABEL] = sizeof(label_statement_t),
392 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
393 [STATEMENT_WHILE] = sizeof(while_statement_t),
394 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
395 [STATEMENT_FOR] = sizeof(for_statement_t),
396 [STATEMENT_ASM] = sizeof(asm_statement_t),
397 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
398 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
400 assert(kind < sizeof(sizes) / sizeof(sizes[0]));
401 assert(sizes[kind] != 0);
406 * Returns the size of an expression node.
408 * @param kind the expression kind
410 static size_t get_expression_struct_size(expression_kind_t kind)
412 static const size_t sizes[] = {
413 [EXPR_INVALID] = sizeof(expression_base_t),
414 [EXPR_REFERENCE] = sizeof(reference_expression_t),
415 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
416 [EXPR_CONST] = sizeof(const_expression_t),
417 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
418 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
419 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
420 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
421 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
422 [EXPR_CALL] = sizeof(call_expression_t),
423 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
424 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
425 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
426 [EXPR_SELECT] = sizeof(select_expression_t),
427 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
428 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
429 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
430 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
431 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
432 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
433 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
434 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
435 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
436 [EXPR_VA_START] = sizeof(va_start_expression_t),
437 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
438 [EXPR_STATEMENT] = sizeof(statement_expression_t),
439 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
441 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
442 return sizes[EXPR_UNARY_FIRST];
444 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
445 return sizes[EXPR_BINARY_FIRST];
447 assert(kind < sizeof(sizes) / sizeof(sizes[0]));
448 assert(sizes[kind] != 0);
453 * Allocate a statement node of given kind and initialize all
454 * fields with zero. Sets its source position to the position
455 * of the current token.
457 static statement_t *allocate_statement_zero(statement_kind_t kind)
459 size_t size = get_statement_struct_size(kind);
460 statement_t *res = allocate_ast_zero(size);
462 res->base.kind = kind;
463 res->base.parent = current_parent;
464 res->base.source_position = token.source_position;
469 * Allocate an expression node of given kind and initialize all
472 static expression_t *allocate_expression_zero(expression_kind_t kind)
474 size_t size = get_expression_struct_size(kind);
475 expression_t *res = allocate_ast_zero(size);
477 res->base.kind = kind;
478 res->base.type = type_error_type;
479 res->base.source_position = token.source_position;
484 * Creates a new invalid expression at the source position
485 * of the current token.
487 static expression_t *create_invalid_expression(void)
489 return allocate_expression_zero(EXPR_INVALID);
493 * Creates a new invalid statement.
495 static statement_t *create_invalid_statement(void)
497 return allocate_statement_zero(STATEMENT_INVALID);
501 * Allocate a new empty statement.
503 static statement_t *create_empty_statement(void)
505 return allocate_statement_zero(STATEMENT_EMPTY);
509 * Returns the size of a type node.
511 * @param kind the type kind
513 static size_t get_type_struct_size(type_kind_t kind)
515 static const size_t sizes[] = {
516 [TYPE_ATOMIC] = sizeof(atomic_type_t),
517 [TYPE_COMPLEX] = sizeof(complex_type_t),
518 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
519 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
520 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
521 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
522 [TYPE_ENUM] = sizeof(enum_type_t),
523 [TYPE_FUNCTION] = sizeof(function_type_t),
524 [TYPE_POINTER] = sizeof(pointer_type_t),
525 [TYPE_ARRAY] = sizeof(array_type_t),
526 [TYPE_BUILTIN] = sizeof(builtin_type_t),
527 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
528 [TYPE_TYPEOF] = sizeof(typeof_type_t),
530 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
531 assert(kind <= TYPE_TYPEOF);
532 assert(sizes[kind] != 0);
537 * Allocate a type node of given kind and initialize all
540 * @param kind type kind to allocate
542 static type_t *allocate_type_zero(type_kind_t kind)
544 size_t size = get_type_struct_size(kind);
545 type_t *res = obstack_alloc(type_obst, size);
546 memset(res, 0, size);
547 res->base.kind = kind;
553 * Returns the size of an initializer node.
555 * @param kind the initializer kind
557 static size_t get_initializer_size(initializer_kind_t kind)
559 static const size_t sizes[] = {
560 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
561 [INITIALIZER_STRING] = sizeof(initializer_string_t),
562 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
563 [INITIALIZER_LIST] = sizeof(initializer_list_t),
564 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
566 assert(kind < sizeof(sizes) / sizeof(*sizes));
567 assert(sizes[kind] != 0);
572 * Allocate an initializer node of given kind and initialize all
575 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
577 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
584 * Free a type from the type obstack.
586 static void free_type(void *type)
588 obstack_free(type_obst, type);
592 * Returns the index of the top element of the environment stack.
594 static size_t environment_top(void)
596 return ARR_LEN(environment_stack);
600 * Returns the index of the top element of the global label stack.
602 static size_t label_top(void)
604 return ARR_LEN(label_stack);
608 * Return the next token.
610 static inline void next_token(void)
612 token = lookahead_buffer[lookahead_bufpos];
613 lookahead_buffer[lookahead_bufpos] = lexer_token;
616 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
619 print_token(stderr, &token);
620 fprintf(stderr, "\n");
625 * Return the next token with a given lookahead.
627 static inline const token_t *look_ahead(int num)
629 assert(num > 0 && num <= MAX_LOOKAHEAD);
630 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
631 return &lookahead_buffer[pos];
635 * Adds a token type to the token type anchor set (a multi-set).
637 static void add_anchor_token(int token_type)
639 assert(0 <= token_type && token_type < T_LAST_TOKEN);
640 ++token_anchor_set[token_type];
644 * Set the number of tokens types of the given type
645 * to zero and return the old count.
647 static int save_and_reset_anchor_state(int token_type)
649 assert(0 <= token_type && token_type < T_LAST_TOKEN);
650 int count = token_anchor_set[token_type];
651 token_anchor_set[token_type] = 0;
656 * Restore the number of token types to the given count.
658 static void restore_anchor_state(int token_type, int count)
660 assert(0 <= token_type && token_type < T_LAST_TOKEN);
661 token_anchor_set[token_type] = count;
665 * Remove a token type from the token type anchor set (a multi-set).
667 static void rem_anchor_token(int token_type)
669 assert(0 <= token_type && token_type < T_LAST_TOKEN);
670 assert(token_anchor_set[token_type] != 0);
671 --token_anchor_set[token_type];
675 * Return true if the token type of the current token is
678 static bool at_anchor(void)
682 return token_anchor_set[token.type];
686 * Eat tokens until a matching token type is found.
688 static void eat_until_matching_token(int type)
692 case '(': end_token = ')'; break;
693 case '{': end_token = '}'; break;
694 case '[': end_token = ']'; break;
695 default: end_token = type; break;
698 unsigned parenthesis_count = 0;
699 unsigned brace_count = 0;
700 unsigned bracket_count = 0;
701 while (token.type != end_token ||
702 parenthesis_count != 0 ||
704 bracket_count != 0) {
705 switch (token.type) {
707 case '(': ++parenthesis_count; break;
708 case '{': ++brace_count; break;
709 case '[': ++bracket_count; break;
712 if (parenthesis_count > 0)
722 if (bracket_count > 0)
725 if (token.type == end_token &&
726 parenthesis_count == 0 &&
740 * Eat input tokens until an anchor is found.
742 static void eat_until_anchor(void)
744 while (token_anchor_set[token.type] == 0) {
745 if (token.type == '(' || token.type == '{' || token.type == '[')
746 eat_until_matching_token(token.type);
752 * Eat a whole block from input tokens.
754 static void eat_block(void)
756 eat_until_matching_token('{');
757 if (token.type == '}')
761 #define eat(token_type) do { assert(token.type == (token_type)); next_token(); } while (0)
764 * Report a parse error because an expected token was not found.
767 #if defined __GNUC__ && __GNUC__ >= 4
768 __attribute__((sentinel))
770 void parse_error_expected(const char *message, ...)
772 if (message != NULL) {
773 errorf(HERE, "%s", message);
776 va_start(ap, message);
777 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
782 * Report an incompatible type.
784 static void type_error_incompatible(const char *msg,
785 const source_position_t *source_position, type_t *type1, type_t *type2)
787 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
792 * Expect the current token is the expected token.
793 * If not, generate an error, eat the current statement,
794 * and goto the end_error label.
796 #define expect(expected, error_label) \
798 if (UNLIKELY(token.type != (expected))) { \
799 parse_error_expected(NULL, (expected), NULL); \
800 add_anchor_token(expected); \
801 eat_until_anchor(); \
802 if (token.type == expected) \
804 rem_anchor_token(expected); \
811 * Push a given scope on the scope stack and make it the
814 static scope_t *scope_push(scope_t *new_scope)
816 if (current_scope != NULL) {
817 new_scope->depth = current_scope->depth + 1;
820 scope_t *old_scope = current_scope;
821 current_scope = new_scope;
826 * Pop the current scope from the scope stack.
828 static void scope_pop(scope_t *old_scope)
830 current_scope = old_scope;
834 * Search an entity by its symbol in a given namespace.
836 static entity_t *get_entity(const symbol_t *const symbol,
837 namespace_tag_t namespc)
839 entity_t *entity = symbol->entity;
840 for (; entity != NULL; entity = entity->base.symbol_next) {
841 if (entity->base.namespc == namespc)
849 * pushs an entity on the environment stack and links the corresponding symbol
852 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
854 symbol_t *symbol = entity->base.symbol;
855 entity_namespace_t namespc = entity->base.namespc;
856 assert(namespc != NAMESPACE_INVALID);
858 /* replace/add entity into entity list of the symbol */
861 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
866 /* replace an entry? */
867 if (iter->base.namespc == namespc) {
868 entity->base.symbol_next = iter->base.symbol_next;
874 /* remember old declaration */
876 entry.symbol = symbol;
877 entry.old_entity = iter;
878 entry.namespc = namespc;
879 ARR_APP1(stack_entry_t, *stack_ptr, entry);
883 * Push an entity on the environment stack.
885 static void environment_push(entity_t *entity)
887 assert(entity->base.source_position.input_name != NULL);
888 assert(entity->base.parent_scope != NULL);
889 stack_push(&environment_stack, entity);
893 * Push a declaration on the global label stack.
895 * @param declaration the declaration
897 static void label_push(entity_t *label)
899 /* we abuse the parameters scope as parent for the labels */
900 label->base.parent_scope = ¤t_function->parameters;
901 stack_push(&label_stack, label);
905 * pops symbols from the environment stack until @p new_top is the top element
907 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
909 stack_entry_t *stack = *stack_ptr;
910 size_t top = ARR_LEN(stack);
913 assert(new_top <= top);
917 for (i = top; i > new_top; --i) {
918 stack_entry_t *entry = &stack[i - 1];
920 entity_t *old_entity = entry->old_entity;
921 symbol_t *symbol = entry->symbol;
922 entity_namespace_t namespc = entry->namespc;
924 /* replace with old_entity/remove */
927 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
929 assert(iter != NULL);
930 /* replace an entry? */
931 if (iter->base.namespc == namespc)
935 /* restore definition from outer scopes (if there was one) */
936 if (old_entity != NULL) {
937 old_entity->base.symbol_next = iter->base.symbol_next;
938 *anchor = old_entity;
940 /* remove entry from list */
941 *anchor = iter->base.symbol_next;
945 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
949 * Pop all entries from the environment stack until the new_top
952 * @param new_top the new stack top
954 static void environment_pop_to(size_t new_top)
956 stack_pop_to(&environment_stack, new_top);
960 * Pop all entries from the global label stack until the new_top
963 * @param new_top the new stack top
965 static void label_pop_to(size_t new_top)
967 stack_pop_to(&label_stack, new_top);
970 static int get_akind_rank(atomic_type_kind_t akind)
976 * Return the type rank for an atomic type.
978 static int get_rank(const type_t *type)
980 assert(!is_typeref(type));
981 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
982 * and esp. footnote 108). However we can't fold constants (yet), so we
983 * can't decide whether unsigned int is possible, while int always works.
984 * (unsigned int would be preferable when possible... for stuff like
985 * struct { enum { ... } bla : 4; } ) */
986 if (type->kind == TYPE_ENUM)
987 return get_akind_rank(ATOMIC_TYPE_INT);
989 assert(type->kind == TYPE_ATOMIC);
990 return get_akind_rank(type->atomic.akind);
994 * Do integer promotion for a given type.
996 * @param type the type to promote
997 * @return the promoted type
999 static type_t *promote_integer(type_t *type)
1001 if (type->kind == TYPE_BITFIELD)
1002 type = type->bitfield.base_type;
1004 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
1011 * Create a cast expression.
1013 * @param expression the expression to cast
1014 * @param dest_type the destination type
1016 static expression_t *create_cast_expression(expression_t *expression,
1019 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
1021 cast->unary.value = expression;
1022 cast->base.type = dest_type;
1028 * Check if a given expression represents a null pointer constant.
1030 * @param expression the expression to check
1032 static bool is_null_pointer_constant(const expression_t *expression)
1034 /* skip void* cast */
1035 if (expression->kind == EXPR_UNARY_CAST
1036 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
1037 expression = expression->unary.value;
1040 /* TODO: not correct yet, should be any constant integer expression
1041 * which evaluates to 0 */
1042 if (expression->kind != EXPR_CONST)
1045 type_t *const type = skip_typeref(expression->base.type);
1046 if (!is_type_integer(type))
1049 return expression->conste.v.int_value == 0;
1053 * Create an implicit cast expression.
1055 * @param expression the expression to cast
1056 * @param dest_type the destination type
1058 static expression_t *create_implicit_cast(expression_t *expression,
1061 type_t *const source_type = expression->base.type;
1063 if (source_type == dest_type)
1066 return create_cast_expression(expression, dest_type);
1069 typedef enum assign_error_t {
1071 ASSIGN_ERROR_INCOMPATIBLE,
1072 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
1073 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
1074 ASSIGN_WARNING_POINTER_FROM_INT,
1075 ASSIGN_WARNING_INT_FROM_POINTER
1078 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
1079 const expression_t *const right,
1080 const char *context,
1081 const source_position_t *source_position)
1083 type_t *const orig_type_right = right->base.type;
1084 type_t *const type_left = skip_typeref(orig_type_left);
1085 type_t *const type_right = skip_typeref(orig_type_right);
1088 case ASSIGN_SUCCESS:
1090 case ASSIGN_ERROR_INCOMPATIBLE:
1091 errorf(source_position,
1092 "destination type '%T' in %s is incompatible with type '%T'",
1093 orig_type_left, context, orig_type_right);
1096 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1097 if (warning.other) {
1098 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
1099 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
1101 /* the left type has all qualifiers from the right type */
1102 unsigned missing_qualifiers
1103 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1104 warningf(source_position,
1105 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1106 orig_type_left, context, orig_type_right, missing_qualifiers);
1111 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1112 if (warning.other) {
1113 warningf(source_position,
1114 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1115 orig_type_left, context, right, orig_type_right);
1119 case ASSIGN_WARNING_POINTER_FROM_INT:
1120 if (warning.other) {
1121 warningf(source_position,
1122 "%s makes pointer '%T' from integer '%T' without a cast",
1123 context, orig_type_left, orig_type_right);
1127 case ASSIGN_WARNING_INT_FROM_POINTER:
1128 if (warning.other) {
1129 warningf(source_position,
1130 "%s makes integer '%T' from pointer '%T' without a cast",
1131 context, orig_type_left, orig_type_right);
1136 panic("invalid error value");
1140 /** Implements the rules from § 6.5.16.1 */
1141 static assign_error_t semantic_assign(type_t *orig_type_left,
1142 const expression_t *const right)
1144 type_t *const orig_type_right = right->base.type;
1145 type_t *const type_left = skip_typeref(orig_type_left);
1146 type_t *const type_right = skip_typeref(orig_type_right);
1148 if (is_type_pointer(type_left)) {
1149 if (is_null_pointer_constant(right)) {
1150 return ASSIGN_SUCCESS;
1151 } else if (is_type_pointer(type_right)) {
1152 type_t *points_to_left
1153 = skip_typeref(type_left->pointer.points_to);
1154 type_t *points_to_right
1155 = skip_typeref(type_right->pointer.points_to);
1156 assign_error_t res = ASSIGN_SUCCESS;
1158 /* the left type has all qualifiers from the right type */
1159 unsigned missing_qualifiers
1160 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1161 if (missing_qualifiers != 0) {
1162 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1165 points_to_left = get_unqualified_type(points_to_left);
1166 points_to_right = get_unqualified_type(points_to_right);
1168 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1171 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1172 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1173 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1176 if (!types_compatible(points_to_left, points_to_right)) {
1177 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1181 } else if (is_type_integer(type_right)) {
1182 return ASSIGN_WARNING_POINTER_FROM_INT;
1184 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1185 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1186 && is_type_pointer(type_right))) {
1187 return ASSIGN_SUCCESS;
1188 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1189 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1190 type_t *const unqual_type_left = get_unqualified_type(type_left);
1191 type_t *const unqual_type_right = get_unqualified_type(type_right);
1192 if (types_compatible(unqual_type_left, unqual_type_right)) {
1193 return ASSIGN_SUCCESS;
1195 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1196 return ASSIGN_WARNING_INT_FROM_POINTER;
1199 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1200 return ASSIGN_SUCCESS;
1202 return ASSIGN_ERROR_INCOMPATIBLE;
1205 static expression_t *parse_constant_expression(void)
1207 expression_t *result = parse_sub_expression(PREC_CONDITIONAL);
1209 if (!is_constant_expression(result)) {
1210 errorf(&result->base.source_position,
1211 "expression '%E' is not constant", result);
1217 static expression_t *parse_assignment_expression(void)
1219 return parse_sub_expression(PREC_ASSIGNMENT);
1222 static string_t parse_string_literals(void)
1224 assert(token.type == T_STRING_LITERAL);
1225 string_t result = token.v.string;
1229 while (token.type == T_STRING_LITERAL) {
1230 result = concat_strings(&result, &token.v.string);
1237 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1238 [GNU_AK_CONST] = "const",
1239 [GNU_AK_VOLATILE] = "volatile",
1240 [GNU_AK_CDECL] = "cdecl",
1241 [GNU_AK_STDCALL] = "stdcall",
1242 [GNU_AK_FASTCALL] = "fastcall",
1243 [GNU_AK_DEPRECATED] = "deprecated",
1244 [GNU_AK_NOINLINE] = "noinline",
1245 [GNU_AK_RETURNS_TWICE] = "returns_twice",
1246 [GNU_AK_NORETURN] = "noreturn",
1247 [GNU_AK_NAKED] = "naked",
1248 [GNU_AK_PURE] = "pure",
1249 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1250 [GNU_AK_MALLOC] = "malloc",
1251 [GNU_AK_WEAK] = "weak",
1252 [GNU_AK_CONSTRUCTOR] = "constructor",
1253 [GNU_AK_DESTRUCTOR] = "destructor",
1254 [GNU_AK_NOTHROW] = "nothrow",
1255 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1256 [GNU_AK_COMMON] = "common",
1257 [GNU_AK_NOCOMMON] = "nocommon",
1258 [GNU_AK_PACKED] = "packed",
1259 [GNU_AK_SHARED] = "shared",
1260 [GNU_AK_NOTSHARED] = "notshared",
1261 [GNU_AK_USED] = "used",
1262 [GNU_AK_UNUSED] = "unused",
1263 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1264 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1265 [GNU_AK_LONGCALL] = "longcall",
1266 [GNU_AK_SHORTCALL] = "shortcall",
1267 [GNU_AK_LONG_CALL] = "long_call",
1268 [GNU_AK_SHORT_CALL] = "short_call",
1269 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1270 [GNU_AK_INTERRUPT] = "interrupt",
1271 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1272 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1273 [GNU_AK_NESTING] = "nesting",
1274 [GNU_AK_NEAR] = "near",
1275 [GNU_AK_FAR] = "far",
1276 [GNU_AK_SIGNAL] = "signal",
1277 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1278 [GNU_AK_TINY_DATA] = "tiny_data",
1279 [GNU_AK_SAVEALL] = "saveall",
1280 [GNU_AK_FLATTEN] = "flatten",
1281 [GNU_AK_SSEREGPARM] = "sseregparm",
1282 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1283 [GNU_AK_RETURN_TWICE] = "return_twice",
1284 [GNU_AK_MAY_ALIAS] = "may_alias",
1285 [GNU_AK_MS_STRUCT] = "ms_struct",
1286 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1287 [GNU_AK_DLLIMPORT] = "dllimport",
1288 [GNU_AK_DLLEXPORT] = "dllexport",
1289 [GNU_AK_ALIGNED] = "aligned",
1290 [GNU_AK_ALIAS] = "alias",
1291 [GNU_AK_SECTION] = "section",
1292 [GNU_AK_FORMAT] = "format",
1293 [GNU_AK_FORMAT_ARG] = "format_arg",
1294 [GNU_AK_WEAKREF] = "weakref",
1295 [GNU_AK_NONNULL] = "nonnull",
1296 [GNU_AK_TLS_MODEL] = "tls_model",
1297 [GNU_AK_VISIBILITY] = "visibility",
1298 [GNU_AK_REGPARM] = "regparm",
1299 [GNU_AK_MODE] = "mode",
1300 [GNU_AK_MODEL] = "model",
1301 [GNU_AK_TRAP_EXIT] = "trap_exit",
1302 [GNU_AK_SP_SWITCH] = "sp_switch",
1303 [GNU_AK_SENTINEL] = "sentinel"
1307 * compare two string, ignoring double underscores on the second.
1309 static int strcmp_underscore(const char *s1, const char *s2)
1311 if (s2[0] == '_' && s2[1] == '_') {
1312 size_t len2 = strlen(s2);
1313 size_t len1 = strlen(s1);
1314 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1315 return strncmp(s1, s2+2, len2-4);
1319 return strcmp(s1, s2);
1323 * Allocate a new gnu temporal attribute of given kind.
1325 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1327 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1328 attribute->kind = kind;
1329 attribute->next = NULL;
1330 attribute->invalid = false;
1331 attribute->have_arguments = false;
1337 * Parse one constant expression argument of the given attribute.
1339 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1341 expression_t *expression;
1342 add_anchor_token(')');
1343 expression = parse_constant_expression();
1344 rem_anchor_token(')');
1345 expect(')', end_error);
1346 attribute->u.argument = fold_constant(expression);
1349 attribute->invalid = true;
1353 * Parse a list of constant expressions arguments of the given attribute.
1355 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1357 argument_list_t **list = &attribute->u.arguments;
1358 argument_list_t *entry;
1359 expression_t *expression;
1360 add_anchor_token(')');
1361 add_anchor_token(',');
1363 expression = parse_constant_expression();
1364 entry = obstack_alloc(&temp_obst, sizeof(entry));
1365 entry->argument = fold_constant(expression);
1368 list = &entry->next;
1369 if (token.type != ',')
1373 rem_anchor_token(',');
1374 rem_anchor_token(')');
1375 expect(')', end_error);
1378 attribute->invalid = true;
1382 * Parse one string literal argument of the given attribute.
1384 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1387 add_anchor_token('(');
1388 if (token.type != T_STRING_LITERAL) {
1389 parse_error_expected("while parsing attribute directive",
1390 T_STRING_LITERAL, NULL);
1393 *string = parse_string_literals();
1394 rem_anchor_token('(');
1395 expect(')', end_error);
1398 attribute->invalid = true;
1402 * Parse one tls model of the given attribute.
1404 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1406 static const char *const tls_models[] = {
1412 string_t string = { NULL, 0 };
1413 parse_gnu_attribute_string_arg(attribute, &string);
1414 if (string.begin != NULL) {
1415 for (size_t i = 0; i < 4; ++i) {
1416 if (strcmp(tls_models[i], string.begin) == 0) {
1417 attribute->u.value = i;
1421 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1423 attribute->invalid = true;
1427 * Parse one tls model of the given attribute.
1429 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1431 static const char *const visibilities[] = {
1437 string_t string = { NULL, 0 };
1438 parse_gnu_attribute_string_arg(attribute, &string);
1439 if (string.begin != NULL) {
1440 for (size_t i = 0; i < 4; ++i) {
1441 if (strcmp(visibilities[i], string.begin) == 0) {
1442 attribute->u.value = i;
1446 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1448 attribute->invalid = true;
1452 * Parse one (code) model of the given attribute.
1454 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1456 static const char *const visibilities[] = {
1461 string_t string = { NULL, 0 };
1462 parse_gnu_attribute_string_arg(attribute, &string);
1463 if (string.begin != NULL) {
1464 for (int i = 0; i < 3; ++i) {
1465 if (strcmp(visibilities[i], string.begin) == 0) {
1466 attribute->u.value = i;
1470 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1472 attribute->invalid = true;
1476 * Parse one mode of the given attribute.
1478 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1480 /* TODO: find out what is allowed here... */
1482 /* at least: byte, word, pointer, list of machine modes
1483 * __XXX___ is interpreted as XXX */
1484 add_anchor_token(')');
1486 if (token.type != T_IDENTIFIER) {
1487 expect(T_IDENTIFIER, end_error);
1490 /* This isn't really correct, the backend should provide a list of machine
1491 * specific modes (according to gcc philosophy that is...) */
1492 const char *symbol_str = token.v.symbol->string;
1493 if (strcmp_underscore("QI", symbol_str) == 0 ||
1494 strcmp_underscore("byte", symbol_str) == 0) {
1495 attribute->u.akind = ATOMIC_TYPE_CHAR;
1496 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1497 attribute->u.akind = ATOMIC_TYPE_SHORT;
1498 } else if (strcmp_underscore("SI", symbol_str) == 0
1499 || strcmp_underscore("word", symbol_str) == 0
1500 || strcmp_underscore("pointer", symbol_str) == 0) {
1501 attribute->u.akind = ATOMIC_TYPE_INT;
1502 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1503 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1506 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1507 attribute->invalid = true;
1511 rem_anchor_token(')');
1512 expect(')', end_error);
1515 attribute->invalid = true;
1519 * Parse one interrupt argument of the given attribute.
1521 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1523 static const char *const interrupts[] = {
1530 string_t string = { NULL, 0 };
1531 parse_gnu_attribute_string_arg(attribute, &string);
1532 if (string.begin != NULL) {
1533 for (size_t i = 0; i < 5; ++i) {
1534 if (strcmp(interrupts[i], string.begin) == 0) {
1535 attribute->u.value = i;
1539 errorf(HERE, "'%s' is not an interrupt", string.begin);
1541 attribute->invalid = true;
1545 * Parse ( identifier, const expression, const expression )
1547 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1549 static const char *const format_names[] = {
1557 if (token.type != T_IDENTIFIER) {
1558 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1561 const char *name = token.v.symbol->string;
1562 for (i = 0; i < 4; ++i) {
1563 if (strcmp_underscore(format_names[i], name) == 0)
1567 if (warning.attribute)
1568 warningf(HERE, "'%s' is an unrecognized format function type", name);
1572 expect(',', end_error);
1573 add_anchor_token(')');
1574 add_anchor_token(',');
1575 parse_constant_expression();
1576 rem_anchor_token(',');
1577 rem_anchor_token(')');
1579 expect(',', end_error);
1580 add_anchor_token(')');
1581 parse_constant_expression();
1582 rem_anchor_token(')');
1583 expect(')', end_error);
1586 attribute->u.value = true;
1590 * Check that a given GNU attribute has no arguments.
1592 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1594 if (!attribute->have_arguments)
1597 /* should have no arguments */
1598 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1599 eat_until_matching_token('(');
1600 /* we have already consumed '(', so we stop before ')', eat it */
1602 attribute->invalid = true;
1606 * Parse one GNU attribute.
1608 * Note that attribute names can be specified WITH or WITHOUT
1609 * double underscores, ie const or __const__.
1611 * The following attributes are parsed without arguments
1636 * no_instrument_function
1637 * warn_unused_result
1654 * externally_visible
1662 * The following attributes are parsed with arguments
1663 * aligned( const expression )
1664 * alias( string literal )
1665 * section( string literal )
1666 * format( identifier, const expression, const expression )
1667 * format_arg( const expression )
1668 * tls_model( string literal )
1669 * visibility( string literal )
1670 * regparm( const expression )
1671 * model( string leteral )
1672 * trap_exit( const expression )
1673 * sp_switch( string literal )
1675 * The following attributes might have arguments
1676 * weak_ref( string literal )
1677 * non_null( const expression // ',' )
1678 * interrupt( string literal )
1679 * sentinel( constant expression )
1681 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1683 gnu_attribute_t *head = *attributes;
1684 gnu_attribute_t *last = *attributes;
1685 decl_modifiers_t modifiers = 0;
1686 gnu_attribute_t *attribute;
1688 eat(T___attribute__);
1689 expect('(', end_error);
1690 expect('(', end_error);
1692 if (token.type != ')') {
1693 /* find the end of the list */
1695 while (last->next != NULL)
1699 /* non-empty attribute list */
1702 if (token.type == T_const) {
1704 } else if (token.type == T_volatile) {
1706 } else if (token.type == T_cdecl) {
1707 /* __attribute__((cdecl)), WITH ms mode */
1709 } else if (token.type == T_IDENTIFIER) {
1710 const symbol_t *sym = token.v.symbol;
1713 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1720 for (i = 0; i < GNU_AK_LAST; ++i) {
1721 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1724 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1727 if (kind == GNU_AK_LAST) {
1728 if (warning.attribute)
1729 warningf(HERE, "'%s' attribute directive ignored", name);
1731 /* skip possible arguments */
1732 if (token.type == '(') {
1733 eat_until_matching_token(')');
1736 /* check for arguments */
1737 attribute = allocate_gnu_attribute(kind);
1738 if (token.type == '(') {
1740 if (token.type == ')') {
1741 /* empty args are allowed */
1744 attribute->have_arguments = true;
1748 case GNU_AK_VOLATILE:
1753 case GNU_AK_NOCOMMON:
1755 case GNU_AK_NOTSHARED:
1756 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1757 case GNU_AK_WARN_UNUSED_RESULT:
1758 case GNU_AK_LONGCALL:
1759 case GNU_AK_SHORTCALL:
1760 case GNU_AK_LONG_CALL:
1761 case GNU_AK_SHORT_CALL:
1762 case GNU_AK_FUNCTION_VECTOR:
1763 case GNU_AK_INTERRUPT_HANDLER:
1764 case GNU_AK_NMI_HANDLER:
1765 case GNU_AK_NESTING:
1769 case GNU_AK_EIGTHBIT_DATA:
1770 case GNU_AK_TINY_DATA:
1771 case GNU_AK_SAVEALL:
1772 case GNU_AK_FLATTEN:
1773 case GNU_AK_SSEREGPARM:
1774 case GNU_AK_EXTERNALLY_VISIBLE:
1775 case GNU_AK_RETURN_TWICE:
1776 case GNU_AK_MAY_ALIAS:
1777 case GNU_AK_MS_STRUCT:
1778 case GNU_AK_GCC_STRUCT:
1781 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1782 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1783 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1784 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1785 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1786 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1787 case GNU_AK_CONST: modifiers |= DM_CONST; goto no_arg;
1788 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1789 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1790 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1791 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1792 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1793 case GNU_AK_RETURNS_TWICE: modifiers |= DM_RETURNS_TWICE; goto no_arg;
1794 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1795 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1796 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1797 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1798 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1799 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1801 case GNU_AK_ALIGNED:
1802 /* __align__ may be used without an argument */
1803 if (attribute->have_arguments) {
1804 parse_gnu_attribute_const_arg(attribute);
1808 case GNU_AK_FORMAT_ARG:
1809 case GNU_AK_REGPARM:
1810 case GNU_AK_TRAP_EXIT:
1811 if (!attribute->have_arguments) {
1812 /* should have arguments */
1813 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1814 attribute->invalid = true;
1816 parse_gnu_attribute_const_arg(attribute);
1819 case GNU_AK_SECTION:
1820 case GNU_AK_SP_SWITCH:
1821 if (!attribute->have_arguments) {
1822 /* should have arguments */
1823 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1824 attribute->invalid = true;
1826 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1829 if (!attribute->have_arguments) {
1830 /* should have arguments */
1831 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1832 attribute->invalid = true;
1834 parse_gnu_attribute_format_args(attribute);
1836 case GNU_AK_WEAKREF:
1837 /* may have one string argument */
1838 if (attribute->have_arguments)
1839 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1841 case GNU_AK_NONNULL:
1842 if (attribute->have_arguments)
1843 parse_gnu_attribute_const_arg_list(attribute);
1845 case GNU_AK_TLS_MODEL:
1846 if (!attribute->have_arguments) {
1847 /* should have arguments */
1848 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1850 parse_gnu_attribute_tls_model_arg(attribute);
1852 case GNU_AK_VISIBILITY:
1853 if (!attribute->have_arguments) {
1854 /* should have arguments */
1855 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1857 parse_gnu_attribute_visibility_arg(attribute);
1860 if (!attribute->have_arguments) {
1861 /* should have arguments */
1862 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1864 parse_gnu_attribute_model_arg(attribute);
1868 if (!attribute->have_arguments) {
1869 /* should have arguments */
1870 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1872 parse_gnu_attribute_mode_arg(attribute);
1875 case GNU_AK_INTERRUPT:
1876 /* may have one string argument */
1877 if (attribute->have_arguments)
1878 parse_gnu_attribute_interrupt_arg(attribute);
1880 case GNU_AK_SENTINEL:
1881 /* may have one string argument */
1882 if (attribute->have_arguments)
1883 parse_gnu_attribute_const_arg(attribute);
1886 /* already handled */
1890 check_no_argument(attribute, name);
1893 if (attribute != NULL) {
1895 last->next = attribute;
1898 head = last = attribute;
1902 if (token.type != ',')
1907 expect(')', end_error);
1908 expect(')', end_error);
1916 * Parse GNU attributes.
1918 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1920 decl_modifiers_t modifiers = 0;
1923 switch (token.type) {
1924 case T___attribute__:
1925 modifiers |= parse_gnu_attribute(attributes);
1930 expect('(', end_error);
1931 if (token.type != T_STRING_LITERAL) {
1932 parse_error_expected("while parsing assembler attribute",
1933 T_STRING_LITERAL, NULL);
1934 eat_until_matching_token('(');
1937 parse_string_literals();
1939 expect(')', end_error);
1942 case T_cdecl: modifiers |= DM_CDECL; break;
1943 case T__fastcall: modifiers |= DM_FASTCALL; break;
1944 case T__stdcall: modifiers |= DM_STDCALL; break;
1947 /* TODO record modifier */
1949 warningf(HERE, "Ignoring declaration modifier %K", &token);
1953 default: return modifiers;
1960 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1962 static entity_t *determine_lhs_ent(expression_t *const expr,
1965 switch (expr->kind) {
1966 case EXPR_REFERENCE: {
1967 entity_t *const entity = expr->reference.entity;
1968 /* we should only find variables as lvalues... */
1969 if (entity->base.kind != ENTITY_VARIABLE
1970 && entity->base.kind != ENTITY_PARAMETER)
1976 case EXPR_ARRAY_ACCESS: {
1977 expression_t *const ref = expr->array_access.array_ref;
1978 entity_t * ent = NULL;
1979 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1980 ent = determine_lhs_ent(ref, lhs_ent);
1983 mark_vars_read(expr->select.compound, lhs_ent);
1985 mark_vars_read(expr->array_access.index, lhs_ent);
1990 if (is_type_compound(skip_typeref(expr->base.type))) {
1991 return determine_lhs_ent(expr->select.compound, lhs_ent);
1993 mark_vars_read(expr->select.compound, lhs_ent);
1998 case EXPR_UNARY_DEREFERENCE: {
1999 expression_t *const val = expr->unary.value;
2000 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
2002 return determine_lhs_ent(val->unary.value, lhs_ent);
2004 mark_vars_read(val, NULL);
2010 mark_vars_read(expr, NULL);
2015 #define ENT_ANY ((entity_t*)-1)
2018 * Mark declarations, which are read. This is used to detect variables, which
2022 * x is not marked as "read", because it is only read to calculate its own new
2026 * x and y are not detected as "not read", because multiple variables are
2029 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
2031 switch (expr->kind) {
2032 case EXPR_REFERENCE: {
2033 entity_t *const entity = expr->reference.entity;
2034 if (entity->kind != ENTITY_VARIABLE
2035 && entity->kind != ENTITY_PARAMETER)
2038 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
2039 if (entity->kind == ENTITY_VARIABLE) {
2040 entity->variable.read = true;
2042 entity->parameter.read = true;
2049 // TODO respect pure/const
2050 mark_vars_read(expr->call.function, NULL);
2051 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
2052 mark_vars_read(arg->expression, NULL);
2056 case EXPR_CONDITIONAL:
2057 // TODO lhs_decl should depend on whether true/false have an effect
2058 mark_vars_read(expr->conditional.condition, NULL);
2059 if (expr->conditional.true_expression != NULL)
2060 mark_vars_read(expr->conditional.true_expression, lhs_ent);
2061 mark_vars_read(expr->conditional.false_expression, lhs_ent);
2065 if (lhs_ent == ENT_ANY
2066 && !is_type_compound(skip_typeref(expr->base.type)))
2068 mark_vars_read(expr->select.compound, lhs_ent);
2071 case EXPR_ARRAY_ACCESS: {
2072 expression_t *const ref = expr->array_access.array_ref;
2073 mark_vars_read(ref, lhs_ent);
2074 lhs_ent = determine_lhs_ent(ref, lhs_ent);
2075 mark_vars_read(expr->array_access.index, lhs_ent);
2080 mark_vars_read(expr->va_arge.ap, lhs_ent);
2083 case EXPR_UNARY_CAST:
2084 /* Special case: Use void cast to mark a variable as "read" */
2085 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
2090 case EXPR_UNARY_THROW:
2091 if (expr->unary.value == NULL)
2094 case EXPR_UNARY_DEREFERENCE:
2095 case EXPR_UNARY_DELETE:
2096 case EXPR_UNARY_DELETE_ARRAY:
2097 if (lhs_ent == ENT_ANY)
2101 case EXPR_UNARY_NEGATE:
2102 case EXPR_UNARY_PLUS:
2103 case EXPR_UNARY_BITWISE_NEGATE:
2104 case EXPR_UNARY_NOT:
2105 case EXPR_UNARY_TAKE_ADDRESS:
2106 case EXPR_UNARY_POSTFIX_INCREMENT:
2107 case EXPR_UNARY_POSTFIX_DECREMENT:
2108 case EXPR_UNARY_PREFIX_INCREMENT:
2109 case EXPR_UNARY_PREFIX_DECREMENT:
2110 case EXPR_UNARY_CAST_IMPLICIT:
2111 case EXPR_UNARY_ASSUME:
2113 mark_vars_read(expr->unary.value, lhs_ent);
2116 case EXPR_BINARY_ADD:
2117 case EXPR_BINARY_SUB:
2118 case EXPR_BINARY_MUL:
2119 case EXPR_BINARY_DIV:
2120 case EXPR_BINARY_MOD:
2121 case EXPR_BINARY_EQUAL:
2122 case EXPR_BINARY_NOTEQUAL:
2123 case EXPR_BINARY_LESS:
2124 case EXPR_BINARY_LESSEQUAL:
2125 case EXPR_BINARY_GREATER:
2126 case EXPR_BINARY_GREATEREQUAL:
2127 case EXPR_BINARY_BITWISE_AND:
2128 case EXPR_BINARY_BITWISE_OR:
2129 case EXPR_BINARY_BITWISE_XOR:
2130 case EXPR_BINARY_LOGICAL_AND:
2131 case EXPR_BINARY_LOGICAL_OR:
2132 case EXPR_BINARY_SHIFTLEFT:
2133 case EXPR_BINARY_SHIFTRIGHT:
2134 case EXPR_BINARY_COMMA:
2135 case EXPR_BINARY_ISGREATER:
2136 case EXPR_BINARY_ISGREATEREQUAL:
2137 case EXPR_BINARY_ISLESS:
2138 case EXPR_BINARY_ISLESSEQUAL:
2139 case EXPR_BINARY_ISLESSGREATER:
2140 case EXPR_BINARY_ISUNORDERED:
2141 mark_vars_read(expr->binary.left, lhs_ent);
2142 mark_vars_read(expr->binary.right, lhs_ent);
2145 case EXPR_BINARY_ASSIGN:
2146 case EXPR_BINARY_MUL_ASSIGN:
2147 case EXPR_BINARY_DIV_ASSIGN:
2148 case EXPR_BINARY_MOD_ASSIGN:
2149 case EXPR_BINARY_ADD_ASSIGN:
2150 case EXPR_BINARY_SUB_ASSIGN:
2151 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2152 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2153 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2154 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2155 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
2156 if (lhs_ent == ENT_ANY)
2158 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
2159 mark_vars_read(expr->binary.right, lhs_ent);
2164 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
2170 case EXPR_CHARACTER_CONSTANT:
2171 case EXPR_WIDE_CHARACTER_CONSTANT:
2172 case EXPR_STRING_LITERAL:
2173 case EXPR_WIDE_STRING_LITERAL:
2174 case EXPR_COMPOUND_LITERAL: // TODO init?
2176 case EXPR_CLASSIFY_TYPE:
2179 case EXPR_BUILTIN_SYMBOL:
2180 case EXPR_BUILTIN_CONSTANT_P:
2181 case EXPR_BUILTIN_PREFETCH:
2183 case EXPR_STATEMENT: // TODO
2184 case EXPR_LABEL_ADDRESS:
2185 case EXPR_REFERENCE_ENUM_VALUE:
2189 panic("unhandled expression");
2192 static designator_t *parse_designation(void)
2194 designator_t *result = NULL;
2195 designator_t *last = NULL;
2198 designator_t *designator;
2199 switch (token.type) {
2201 designator = allocate_ast_zero(sizeof(designator[0]));
2202 designator->source_position = token.source_position;
2204 add_anchor_token(']');
2205 designator->array_index = parse_constant_expression();
2206 rem_anchor_token(']');
2207 expect(']', end_error);
2210 designator = allocate_ast_zero(sizeof(designator[0]));
2211 designator->source_position = token.source_position;
2213 if (token.type != T_IDENTIFIER) {
2214 parse_error_expected("while parsing designator",
2215 T_IDENTIFIER, NULL);
2218 designator->symbol = token.v.symbol;
2222 expect('=', end_error);
2226 assert(designator != NULL);
2228 last->next = designator;
2230 result = designator;
2238 static initializer_t *initializer_from_string(array_type_t *type,
2239 const string_t *const string)
2241 /* TODO: check len vs. size of array type */
2244 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
2245 initializer->string.string = *string;
2250 static initializer_t *initializer_from_wide_string(array_type_t *const type,
2251 wide_string_t *const string)
2253 /* TODO: check len vs. size of array type */
2256 initializer_t *const initializer =
2257 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
2258 initializer->wide_string.string = *string;
2264 * Build an initializer from a given expression.
2266 static initializer_t *initializer_from_expression(type_t *orig_type,
2267 expression_t *expression)
2269 /* TODO check that expression is a constant expression */
2271 /* § 6.7.8.14/15 char array may be initialized by string literals */
2272 type_t *type = skip_typeref(orig_type);
2273 type_t *expr_type_orig = expression->base.type;
2274 type_t *expr_type = skip_typeref(expr_type_orig);
2275 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
2276 array_type_t *const array_type = &type->array;
2277 type_t *const element_type = skip_typeref(array_type->element_type);
2279 if (element_type->kind == TYPE_ATOMIC) {
2280 atomic_type_kind_t akind = element_type->atomic.akind;
2281 switch (expression->kind) {
2282 case EXPR_STRING_LITERAL:
2283 if (akind == ATOMIC_TYPE_CHAR
2284 || akind == ATOMIC_TYPE_SCHAR
2285 || akind == ATOMIC_TYPE_UCHAR) {
2286 return initializer_from_string(array_type,
2287 &expression->string.value);
2290 case EXPR_WIDE_STRING_LITERAL: {
2291 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
2292 if (get_unqualified_type(element_type) == bare_wchar_type) {
2293 return initializer_from_wide_string(array_type,
2294 &expression->wide_string.value);
2304 assign_error_t error = semantic_assign(type, expression);
2305 if (error == ASSIGN_ERROR_INCOMPATIBLE)
2307 report_assign_error(error, type, expression, "initializer",
2308 &expression->base.source_position);
2310 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
2312 if (type->kind == TYPE_BITFIELD) {
2313 type = type->bitfield.base_type;
2316 result->value.value = create_implicit_cast(expression, type);
2322 * Checks if a given expression can be used as an constant initializer.
2324 static bool is_initializer_constant(const expression_t *expression)
2326 return is_constant_expression(expression)
2327 || is_address_constant(expression);
2331 * Parses an scalar initializer.
2333 * § 6.7.8.11; eat {} without warning
2335 static initializer_t *parse_scalar_initializer(type_t *type,
2336 bool must_be_constant)
2338 /* there might be extra {} hierarchies */
2340 if (token.type == '{') {
2342 warningf(HERE, "extra curly braces around scalar initializer");
2346 } while (token.type == '{');
2349 expression_t *expression = parse_assignment_expression();
2350 mark_vars_read(expression, NULL);
2351 if (must_be_constant && !is_initializer_constant(expression)) {
2352 errorf(&expression->base.source_position,
2353 "Initialisation expression '%E' is not constant",
2357 initializer_t *initializer = initializer_from_expression(type, expression);
2359 if (initializer == NULL) {
2360 errorf(&expression->base.source_position,
2361 "expression '%E' (type '%T') doesn't match expected type '%T'",
2362 expression, expression->base.type, type);
2367 bool additional_warning_displayed = false;
2368 while (braces > 0) {
2369 if (token.type == ',') {
2372 if (token.type != '}') {
2373 if (!additional_warning_displayed && warning.other) {
2374 warningf(HERE, "additional elements in scalar initializer");
2375 additional_warning_displayed = true;
2386 * An entry in the type path.
2388 typedef struct type_path_entry_t type_path_entry_t;
2389 struct type_path_entry_t {
2390 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2392 size_t index; /**< For array types: the current index. */
2393 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2398 * A type path expression a position inside compound or array types.
2400 typedef struct type_path_t type_path_t;
2401 struct type_path_t {
2402 type_path_entry_t *path; /**< An flexible array containing the current path. */
2403 type_t *top_type; /**< type of the element the path points */
2404 size_t max_index; /**< largest index in outermost array */
2408 * Prints a type path for debugging.
2410 static __attribute__((unused)) void debug_print_type_path(
2411 const type_path_t *path)
2413 size_t len = ARR_LEN(path->path);
2415 for (size_t i = 0; i < len; ++i) {
2416 const type_path_entry_t *entry = & path->path[i];
2418 type_t *type = skip_typeref(entry->type);
2419 if (is_type_compound(type)) {
2420 /* in gcc mode structs can have no members */
2421 if (entry->v.compound_entry == NULL) {
2425 fprintf(stderr, ".%s",
2426 entry->v.compound_entry->base.symbol->string);
2427 } else if (is_type_array(type)) {
2428 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
2430 fprintf(stderr, "-INVALID-");
2433 if (path->top_type != NULL) {
2434 fprintf(stderr, " (");
2435 print_type(path->top_type);
2436 fprintf(stderr, ")");
2441 * Return the top type path entry, ie. in a path
2442 * (type).a.b returns the b.
2444 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2446 size_t len = ARR_LEN(path->path);
2448 return &path->path[len-1];
2452 * Enlarge the type path by an (empty) element.
2454 static type_path_entry_t *append_to_type_path(type_path_t *path)
2456 size_t len = ARR_LEN(path->path);
2457 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2459 type_path_entry_t *result = & path->path[len];
2460 memset(result, 0, sizeof(result[0]));
2465 * Descending into a sub-type. Enter the scope of the current top_type.
2467 static void descend_into_subtype(type_path_t *path)
2469 type_t *orig_top_type = path->top_type;
2470 type_t *top_type = skip_typeref(orig_top_type);
2472 type_path_entry_t *top = append_to_type_path(path);
2473 top->type = top_type;
2475 if (is_type_compound(top_type)) {
2476 compound_t *compound = top_type->compound.compound;
2477 entity_t *entry = compound->members.entities;
2479 if (entry != NULL) {
2480 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2481 top->v.compound_entry = &entry->declaration;
2482 path->top_type = entry->declaration.type;
2484 path->top_type = NULL;
2486 } else if (is_type_array(top_type)) {
2488 path->top_type = top_type->array.element_type;
2490 assert(!is_type_valid(top_type));
2495 * Pop an entry from the given type path, ie. returning from
2496 * (type).a.b to (type).a
2498 static void ascend_from_subtype(type_path_t *path)
2500 type_path_entry_t *top = get_type_path_top(path);
2502 path->top_type = top->type;
2504 size_t len = ARR_LEN(path->path);
2505 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2509 * Pop entries from the given type path until the given
2510 * path level is reached.
2512 static void ascend_to(type_path_t *path, size_t top_path_level)
2514 size_t len = ARR_LEN(path->path);
2516 while (len > top_path_level) {
2517 ascend_from_subtype(path);
2518 len = ARR_LEN(path->path);
2522 static bool walk_designator(type_path_t *path, const designator_t *designator,
2523 bool used_in_offsetof)
2525 for (; designator != NULL; designator = designator->next) {
2526 type_path_entry_t *top = get_type_path_top(path);
2527 type_t *orig_type = top->type;
2529 type_t *type = skip_typeref(orig_type);
2531 if (designator->symbol != NULL) {
2532 symbol_t *symbol = designator->symbol;
2533 if (!is_type_compound(type)) {
2534 if (is_type_valid(type)) {
2535 errorf(&designator->source_position,
2536 "'.%Y' designator used for non-compound type '%T'",
2540 top->type = type_error_type;
2541 top->v.compound_entry = NULL;
2542 orig_type = type_error_type;
2544 compound_t *compound = type->compound.compound;
2545 entity_t *iter = compound->members.entities;
2546 for (; iter != NULL; iter = iter->base.next) {
2547 if (iter->base.symbol == symbol) {
2552 errorf(&designator->source_position,
2553 "'%T' has no member named '%Y'", orig_type, symbol);
2556 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2557 if (used_in_offsetof) {
2558 type_t *real_type = skip_typeref(iter->declaration.type);
2559 if (real_type->kind == TYPE_BITFIELD) {
2560 errorf(&designator->source_position,
2561 "offsetof designator '%Y' may not specify bitfield",
2567 top->type = orig_type;
2568 top->v.compound_entry = &iter->declaration;
2569 orig_type = iter->declaration.type;
2572 expression_t *array_index = designator->array_index;
2573 assert(designator->array_index != NULL);
2575 if (!is_type_array(type)) {
2576 if (is_type_valid(type)) {
2577 errorf(&designator->source_position,
2578 "[%E] designator used for non-array type '%T'",
2579 array_index, orig_type);
2584 long index = fold_constant(array_index);
2585 if (!used_in_offsetof) {
2587 errorf(&designator->source_position,
2588 "array index [%E] must be positive", array_index);
2589 } else if (type->array.size_constant) {
2590 long array_size = type->array.size;
2591 if (index >= array_size) {
2592 errorf(&designator->source_position,
2593 "designator [%E] (%d) exceeds array size %d",
2594 array_index, index, array_size);
2599 top->type = orig_type;
2600 top->v.index = (size_t) index;
2601 orig_type = type->array.element_type;
2603 path->top_type = orig_type;
2605 if (designator->next != NULL) {
2606 descend_into_subtype(path);
2615 static void advance_current_object(type_path_t *path, size_t top_path_level)
2617 type_path_entry_t *top = get_type_path_top(path);
2619 type_t *type = skip_typeref(top->type);
2620 if (is_type_union(type)) {
2621 /* in unions only the first element is initialized */
2622 top->v.compound_entry = NULL;
2623 } else if (is_type_struct(type)) {
2624 declaration_t *entry = top->v.compound_entry;
2626 entity_t *next_entity = entry->base.next;
2627 if (next_entity != NULL) {
2628 assert(is_declaration(next_entity));
2629 entry = &next_entity->declaration;
2634 top->v.compound_entry = entry;
2635 if (entry != NULL) {
2636 path->top_type = entry->type;
2639 } else if (is_type_array(type)) {
2640 assert(is_type_array(type));
2644 if (!type->array.size_constant || top->v.index < type->array.size) {
2648 assert(!is_type_valid(type));
2652 /* we're past the last member of the current sub-aggregate, try if we
2653 * can ascend in the type hierarchy and continue with another subobject */
2654 size_t len = ARR_LEN(path->path);
2656 if (len > top_path_level) {
2657 ascend_from_subtype(path);
2658 advance_current_object(path, top_path_level);
2660 path->top_type = NULL;
2665 * skip until token is found.
2667 static void skip_until(int type)
2669 while (token.type != type) {
2670 if (token.type == T_EOF)
2677 * skip any {...} blocks until a closing bracket is reached.
2679 static void skip_initializers(void)
2681 if (token.type == '{')
2684 while (token.type != '}') {
2685 if (token.type == T_EOF)
2687 if (token.type == '{') {
2695 static initializer_t *create_empty_initializer(void)
2697 static initializer_t empty_initializer
2698 = { .list = { { INITIALIZER_LIST }, 0 } };
2699 return &empty_initializer;
2703 * Parse a part of an initialiser for a struct or union,
2705 static initializer_t *parse_sub_initializer(type_path_t *path,
2706 type_t *outer_type, size_t top_path_level,
2707 parse_initializer_env_t *env)
2709 if (token.type == '}') {
2710 /* empty initializer */
2711 return create_empty_initializer();
2714 type_t *orig_type = path->top_type;
2715 type_t *type = NULL;
2717 if (orig_type == NULL) {
2718 /* We are initializing an empty compound. */
2720 type = skip_typeref(orig_type);
2723 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2726 designator_t *designator = NULL;
2727 if (token.type == '.' || token.type == '[') {
2728 designator = parse_designation();
2729 goto finish_designator;
2730 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2731 /* GNU-style designator ("identifier: value") */
2732 designator = allocate_ast_zero(sizeof(designator[0]));
2733 designator->source_position = token.source_position;
2734 designator->symbol = token.v.symbol;
2739 /* reset path to toplevel, evaluate designator from there */
2740 ascend_to(path, top_path_level);
2741 if (!walk_designator(path, designator, false)) {
2742 /* can't continue after designation error */
2746 initializer_t *designator_initializer
2747 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2748 designator_initializer->designator.designator = designator;
2749 ARR_APP1(initializer_t*, initializers, designator_initializer);
2751 orig_type = path->top_type;
2752 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2757 if (token.type == '{') {
2758 if (type != NULL && is_type_scalar(type)) {
2759 sub = parse_scalar_initializer(type, env->must_be_constant);
2763 if (env->entity != NULL) {
2765 "extra brace group at end of initializer for '%Y'",
2766 env->entity->base.symbol);
2768 errorf(HERE, "extra brace group at end of initializer");
2771 descend_into_subtype(path);
2773 add_anchor_token('}');
2774 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2776 rem_anchor_token('}');
2779 ascend_from_subtype(path);
2780 expect('}', end_error);
2782 expect('}', end_error);
2783 goto error_parse_next;
2787 /* must be an expression */
2788 expression_t *expression = parse_assignment_expression();
2789 mark_vars_read(expression, NULL);
2791 if (env->must_be_constant && !is_initializer_constant(expression)) {
2792 errorf(&expression->base.source_position,
2793 "Initialisation expression '%E' is not constant",
2798 /* we are already outside, ... */
2799 type_t *const outer_type_skip = skip_typeref(outer_type);
2800 if (is_type_compound(outer_type_skip) &&
2801 !outer_type_skip->compound.compound->complete) {
2802 goto error_parse_next;
2807 /* handle { "string" } special case */
2808 if ((expression->kind == EXPR_STRING_LITERAL
2809 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2810 && outer_type != NULL) {
2811 sub = initializer_from_expression(outer_type, expression);
2813 if (token.type == ',') {
2816 if (token.type != '}' && warning.other) {
2817 warningf(HERE, "excessive elements in initializer for type '%T'",
2820 /* TODO: eat , ... */
2825 /* descend into subtypes until expression matches type */
2827 orig_type = path->top_type;
2828 type = skip_typeref(orig_type);
2830 sub = initializer_from_expression(orig_type, expression);
2834 if (!is_type_valid(type)) {
2837 if (is_type_scalar(type)) {
2838 errorf(&expression->base.source_position,
2839 "expression '%E' doesn't match expected type '%T'",
2840 expression, orig_type);
2844 descend_into_subtype(path);
2848 /* update largest index of top array */
2849 const type_path_entry_t *first = &path->path[0];
2850 type_t *first_type = first->type;
2851 first_type = skip_typeref(first_type);
2852 if (is_type_array(first_type)) {
2853 size_t index = first->v.index;
2854 if (index > path->max_index)
2855 path->max_index = index;
2859 /* append to initializers list */
2860 ARR_APP1(initializer_t*, initializers, sub);
2863 if (warning.other) {
2864 if (env->entity != NULL) {
2865 warningf(HERE, "excess elements in struct initializer for '%Y'",
2866 env->entity->base.symbol);
2868 warningf(HERE, "excess elements in struct initializer");
2874 if (token.type == '}') {
2877 expect(',', end_error);
2878 if (token.type == '}') {
2883 /* advance to the next declaration if we are not at the end */
2884 advance_current_object(path, top_path_level);
2885 orig_type = path->top_type;
2886 if (orig_type != NULL)
2887 type = skip_typeref(orig_type);
2893 size_t len = ARR_LEN(initializers);
2894 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2895 initializer_t *result = allocate_ast_zero(size);
2896 result->kind = INITIALIZER_LIST;
2897 result->list.len = len;
2898 memcpy(&result->list.initializers, initializers,
2899 len * sizeof(initializers[0]));
2901 DEL_ARR_F(initializers);
2902 ascend_to(path, top_path_level+1);
2907 skip_initializers();
2908 DEL_ARR_F(initializers);
2909 ascend_to(path, top_path_level+1);
2914 * Parses an initializer. Parsers either a compound literal
2915 * (env->declaration == NULL) or an initializer of a declaration.
2917 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2919 type_t *type = skip_typeref(env->type);
2920 size_t max_index = 0xdeadbeaf; // TODO: Resolve this uninitialized variable problem
2921 initializer_t *result;
2923 if (is_type_scalar(type)) {
2924 result = parse_scalar_initializer(type, env->must_be_constant);
2925 } else if (token.type == '{') {
2929 memset(&path, 0, sizeof(path));
2930 path.top_type = env->type;
2931 path.path = NEW_ARR_F(type_path_entry_t, 0);
2933 descend_into_subtype(&path);
2935 add_anchor_token('}');
2936 result = parse_sub_initializer(&path, env->type, 1, env);
2937 rem_anchor_token('}');
2939 max_index = path.max_index;
2940 DEL_ARR_F(path.path);
2942 expect('}', end_error);
2944 /* parse_scalar_initializer() also works in this case: we simply
2945 * have an expression without {} around it */
2946 result = parse_scalar_initializer(type, env->must_be_constant);
2949 /* § 6.7.8 (22) array initializers for arrays with unknown size determine
2950 * the array type size */
2951 if (is_type_array(type) && type->array.size_expression == NULL
2952 && result != NULL) {
2954 switch (result->kind) {
2955 case INITIALIZER_LIST:
2956 assert(max_index != 0xdeadbeaf);
2957 size = max_index + 1;
2960 case INITIALIZER_STRING:
2961 size = result->string.string.size;
2964 case INITIALIZER_WIDE_STRING:
2965 size = result->wide_string.string.size;
2968 case INITIALIZER_DESIGNATOR:
2969 case INITIALIZER_VALUE:
2970 /* can happen for parse errors */
2975 internal_errorf(HERE, "invalid initializer type");
2978 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2979 cnst->base.type = type_size_t;
2980 cnst->conste.v.int_value = size;
2982 type_t *new_type = duplicate_type(type);
2984 new_type->array.size_expression = cnst;
2985 new_type->array.size_constant = true;
2986 new_type->array.has_implicit_size = true;
2987 new_type->array.size = size;
2988 env->type = new_type;
2996 static void append_entity(scope_t *scope, entity_t *entity)
2998 if (scope->last_entity != NULL) {
2999 scope->last_entity->base.next = entity;
3001 scope->entities = entity;
3003 scope->last_entity = entity;
3007 static compound_t *parse_compound_type_specifier(bool is_struct)
3009 gnu_attribute_t *attributes = NULL;
3010 decl_modifiers_t modifiers = 0;
3017 symbol_t *symbol = NULL;
3018 compound_t *compound = NULL;
3020 if (token.type == T___attribute__) {
3021 modifiers |= parse_attributes(&attributes);
3024 if (token.type == T_IDENTIFIER) {
3025 symbol = token.v.symbol;
3028 namespace_tag_t const namespc =
3029 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
3030 entity_t *entity = get_entity(symbol, namespc);
3031 if (entity != NULL) {
3032 assert(entity->kind == (is_struct ? ENTITY_STRUCT : ENTITY_UNION));
3033 compound = &entity->compound;
3034 if (compound->base.parent_scope != current_scope &&
3035 (token.type == '{' || token.type == ';')) {
3036 /* we're in an inner scope and have a definition. Override
3037 existing definition in outer scope */
3039 } else if (compound->complete && token.type == '{') {
3040 assert(symbol != NULL);
3041 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
3042 is_struct ? "struct" : "union", symbol,
3043 &compound->base.source_position);
3044 /* clear members in the hope to avoid further errors */
3045 compound->members.entities = NULL;
3048 } else if (token.type != '{') {
3050 parse_error_expected("while parsing struct type specifier",
3051 T_IDENTIFIER, '{', NULL);
3053 parse_error_expected("while parsing union type specifier",
3054 T_IDENTIFIER, '{', NULL);
3060 if (compound == NULL) {
3061 entity_kind_t kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
3062 entity_t *entity = allocate_entity_zero(kind);
3063 compound = &entity->compound;
3065 compound->base.namespc =
3066 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
3067 compound->base.source_position = token.source_position;
3068 compound->base.symbol = symbol;
3069 compound->base.parent_scope = current_scope;
3070 if (symbol != NULL) {
3071 environment_push(entity);
3073 append_entity(current_scope, entity);
3076 if (token.type == '{') {
3077 parse_compound_type_entries(compound);
3078 modifiers |= parse_attributes(&attributes);
3080 if (symbol == NULL) {
3081 assert(anonymous_entity == NULL);
3082 anonymous_entity = (entity_t*)compound;
3086 compound->modifiers |= modifiers;
3090 static void parse_enum_entries(type_t *const enum_type)
3094 if (token.type == '}') {
3095 errorf(HERE, "empty enum not allowed");
3100 add_anchor_token('}');
3102 if (token.type != T_IDENTIFIER) {
3103 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
3105 rem_anchor_token('}');
3109 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
3110 entity->enum_value.enum_type = enum_type;
3111 entity->base.symbol = token.v.symbol;
3112 entity->base.source_position = token.source_position;
3115 if (token.type == '=') {
3117 expression_t *value = parse_constant_expression();
3119 value = create_implicit_cast(value, enum_type);
3120 entity->enum_value.value = value;
3125 record_entity(entity, false);
3127 if (token.type != ',')
3130 } while (token.type != '}');
3131 rem_anchor_token('}');
3133 expect('}', end_error);
3139 static type_t *parse_enum_specifier(void)
3141 gnu_attribute_t *attributes = NULL;
3146 if (token.type == T_IDENTIFIER) {
3147 symbol = token.v.symbol;
3150 entity = get_entity(symbol, NAMESPACE_ENUM);
3151 assert(entity == NULL || entity->kind == ENTITY_ENUM);
3152 } else if (token.type != '{') {
3153 parse_error_expected("while parsing enum type specifier",
3154 T_IDENTIFIER, '{', NULL);
3161 if (entity == NULL) {
3162 entity = allocate_entity_zero(ENTITY_ENUM);
3163 entity->base.namespc = NAMESPACE_ENUM;
3164 entity->base.source_position = token.source_position;
3165 entity->base.symbol = symbol;
3166 entity->base.parent_scope = current_scope;
3169 type_t *const type = allocate_type_zero(TYPE_ENUM);
3170 type->enumt.enume = &entity->enume;
3172 if (token.type == '{') {
3173 if (entity->enume.complete) {
3174 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
3175 symbol, &entity->base.source_position);
3177 if (symbol != NULL) {
3178 environment_push(entity);
3180 append_entity(current_scope, entity);
3181 entity->enume.complete = true;
3183 parse_enum_entries(type);
3184 parse_attributes(&attributes);
3186 if (symbol == NULL) {
3187 assert(anonymous_entity == NULL);
3188 anonymous_entity = entity;
3190 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
3191 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
3199 * if a symbol is a typedef to another type, return true
3201 static bool is_typedef_symbol(symbol_t *symbol)
3203 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
3204 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
3207 static type_t *parse_typeof(void)
3213 expect('(', end_error);
3214 add_anchor_token(')');
3216 expression_t *expression = NULL;
3218 bool old_type_prop = in_type_prop;
3219 bool old_gcc_extension = in_gcc_extension;
3220 in_type_prop = true;
3222 while (token.type == T___extension__) {
3223 /* This can be a prefix to a typename or an expression. */
3225 in_gcc_extension = true;
3227 switch (token.type) {
3229 if (is_typedef_symbol(token.v.symbol)) {
3230 type = parse_typename();
3232 expression = parse_expression();
3233 type = expression->base.type;
3238 type = parse_typename();
3242 expression = parse_expression();
3243 type = expression->base.type;
3246 in_type_prop = old_type_prop;
3247 in_gcc_extension = old_gcc_extension;
3249 rem_anchor_token(')');
3250 expect(')', end_error);
3252 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
3253 typeof_type->typeoft.expression = expression;
3254 typeof_type->typeoft.typeof_type = type;
3261 typedef enum specifiers_t {
3262 SPECIFIER_SIGNED = 1 << 0,
3263 SPECIFIER_UNSIGNED = 1 << 1,
3264 SPECIFIER_LONG = 1 << 2,
3265 SPECIFIER_INT = 1 << 3,
3266 SPECIFIER_DOUBLE = 1 << 4,
3267 SPECIFIER_CHAR = 1 << 5,
3268 SPECIFIER_WCHAR_T = 1 << 6,
3269 SPECIFIER_SHORT = 1 << 7,
3270 SPECIFIER_LONG_LONG = 1 << 8,
3271 SPECIFIER_FLOAT = 1 << 9,
3272 SPECIFIER_BOOL = 1 << 10,
3273 SPECIFIER_VOID = 1 << 11,
3274 SPECIFIER_INT8 = 1 << 12,
3275 SPECIFIER_INT16 = 1 << 13,
3276 SPECIFIER_INT32 = 1 << 14,
3277 SPECIFIER_INT64 = 1 << 15,
3278 SPECIFIER_INT128 = 1 << 16,
3279 SPECIFIER_COMPLEX = 1 << 17,
3280 SPECIFIER_IMAGINARY = 1 << 18,
3283 static type_t *create_builtin_type(symbol_t *const symbol,
3284 type_t *const real_type)
3286 type_t *type = allocate_type_zero(TYPE_BUILTIN);
3287 type->builtin.symbol = symbol;
3288 type->builtin.real_type = real_type;
3290 type_t *result = typehash_insert(type);
3291 if (type != result) {
3298 static type_t *get_typedef_type(symbol_t *symbol)
3300 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3301 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
3304 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
3305 type->typedeft.typedefe = &entity->typedefe;
3311 * check for the allowed MS alignment values.
3313 static bool check_alignment_value(long long intvalue)
3315 if (intvalue < 1 || intvalue > 8192) {
3316 errorf(HERE, "illegal alignment value");
3319 unsigned v = (unsigned)intvalue;
3320 for (unsigned i = 1; i <= 8192; i += i) {
3324 errorf(HERE, "alignment must be power of two");
3328 #define DET_MOD(name, tag) do { \
3329 if (*modifiers & tag && warning.other) warningf(HERE, #name " used more than once"); \
3330 *modifiers |= tag; \
3333 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
3335 decl_modifiers_t *modifiers = &specifiers->modifiers;
3338 if (token.type == T_restrict) {
3340 DET_MOD(restrict, DM_RESTRICT);
3342 } else if (token.type != T_IDENTIFIER)
3344 symbol_t *symbol = token.v.symbol;
3345 if (symbol == sym_align) {
3347 expect('(', end_error);
3348 if (token.type != T_INTEGER)
3350 if (check_alignment_value(token.v.intvalue)) {
3351 if (specifiers->alignment != 0 && warning.other)
3352 warningf(HERE, "align used more than once");
3353 specifiers->alignment = (unsigned char)token.v.intvalue;
3356 expect(')', end_error);
3357 } else if (symbol == sym_allocate) {
3359 expect('(', end_error);
3360 if (token.type != T_IDENTIFIER)
3362 (void)token.v.symbol;
3363 expect(')', end_error);
3364 } else if (symbol == sym_dllimport) {
3366 DET_MOD(dllimport, DM_DLLIMPORT);
3367 } else if (symbol == sym_dllexport) {
3369 DET_MOD(dllexport, DM_DLLEXPORT);
3370 } else if (symbol == sym_thread) {
3372 DET_MOD(thread, DM_THREAD);
3373 } else if (symbol == sym_naked) {
3375 DET_MOD(naked, DM_NAKED);
3376 } else if (symbol == sym_noinline) {
3378 DET_MOD(noinline, DM_NOINLINE);
3379 } else if (symbol == sym_returns_twice) {
3381 DET_MOD(returns_twice, DM_RETURNS_TWICE);
3382 } else if (symbol == sym_noreturn) {
3384 DET_MOD(noreturn, DM_NORETURN);
3385 } else if (symbol == sym_nothrow) {
3387 DET_MOD(nothrow, DM_NOTHROW);
3388 } else if (symbol == sym_novtable) {
3390 DET_MOD(novtable, DM_NOVTABLE);
3391 } else if (symbol == sym_property) {
3393 expect('(', end_error);
3395 bool is_get = false;
3396 if (token.type != T_IDENTIFIER)
3398 if (token.v.symbol == sym_get) {
3400 } else if (token.v.symbol == sym_put) {
3402 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3406 expect('=', end_error);
3407 if (token.type != T_IDENTIFIER)
3410 if (specifiers->get_property_sym != NULL) {
3411 errorf(HERE, "get property name already specified");
3413 specifiers->get_property_sym = token.v.symbol;
3416 if (specifiers->put_property_sym != NULL) {
3417 errorf(HERE, "put property name already specified");
3419 specifiers->put_property_sym = token.v.symbol;
3423 if (token.type == ',') {
3429 expect(')', end_error);
3430 } else if (symbol == sym_selectany) {
3432 DET_MOD(selectany, DM_SELECTANY);
3433 } else if (symbol == sym_uuid) {
3435 expect('(', end_error);
3436 if (token.type != T_STRING_LITERAL)
3439 expect(')', end_error);
3440 } else if (symbol == sym_deprecated) {
3442 if (specifiers->deprecated != 0 && warning.other)
3443 warningf(HERE, "deprecated used more than once");
3444 specifiers->deprecated = true;
3445 if (token.type == '(') {
3447 if (token.type == T_STRING_LITERAL) {
3448 specifiers->deprecated_string = token.v.string.begin;
3451 errorf(HERE, "string literal expected");
3453 expect(')', end_error);
3455 } else if (symbol == sym_noalias) {
3457 DET_MOD(noalias, DM_NOALIAS);
3460 warningf(HERE, "Unknown modifier '%Y' ignored", token.v.symbol);
3462 if (token.type == '(')
3466 if (token.type == ',')
3473 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
3475 entity_t *entity = allocate_entity_zero(kind);
3476 entity->base.source_position = *HERE;
3477 entity->base.symbol = symbol;
3478 if (is_declaration(entity)) {
3479 entity->declaration.type = type_error_type;
3480 entity->declaration.implicit = true;
3481 } else if (kind == ENTITY_TYPEDEF) {
3482 entity->typedefe.type = type_error_type;
3483 entity->typedefe.builtin = true;
3485 if (kind != ENTITY_COMPOUND_MEMBER)
3486 record_entity(entity, false);
3490 static void parse_microsoft_based(based_spec_t *based_spec)
3492 if (token.type != T_IDENTIFIER) {
3493 parse_error_expected("while parsing __based", T_IDENTIFIER, NULL);
3496 symbol_t *symbol = token.v.symbol;
3497 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3499 if (entity == NULL || entity->base.kind != ENTITY_VARIABLE) {
3500 errorf(HERE, "'%Y' is not a variable name.", symbol);
3501 entity = create_error_entity(symbol, ENTITY_VARIABLE);
3503 variable_t *variable = &entity->variable;
3505 if (based_spec->base_variable != NULL) {
3506 errorf(HERE, "__based type qualifier specified more than once");
3508 based_spec->source_position = token.source_position;
3509 based_spec->base_variable = variable;
3511 type_t *const type = variable->base.type;
3513 if (is_type_valid(type)) {
3514 if (! is_type_pointer(skip_typeref(type))) {
3515 errorf(HERE, "variable in __based modifier must have pointer type instead of '%T'", type);
3517 if (variable->base.base.parent_scope != file_scope) {
3518 errorf(HERE, "a nonstatic local variable may not be used in a __based specification");
3526 * Finish the construction of a struct type by calculating
3527 * its size, offsets, alignment.
3529 static void finish_struct_type(compound_type_t *type)
3531 assert(type->compound != NULL);
3533 compound_t *compound = type->compound;
3534 if (!compound->complete)
3539 il_alignment_t alignment = 1;
3540 bool need_pad = false;
3542 entity_t *entry = compound->members.entities;
3543 for (; entry != NULL; entry = entry->base.next) {
3544 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3547 type_t *m_type = skip_typeref(entry->declaration.type);
3548 if (! is_type_valid(m_type)) {
3549 /* simply ignore errors here */
3552 il_alignment_t m_alignment = m_type->base.alignment;
3553 if (m_alignment > alignment)
3554 alignment = m_alignment;
3556 offset = (size + m_alignment - 1) & -m_alignment;
3560 entry->compound_member.offset = offset;
3561 size = offset + m_type->base.size;
3563 if (type->base.alignment != 0) {
3564 alignment = type->base.alignment;
3567 offset = (size + alignment - 1) & -alignment;
3572 if (warning.padded) {
3573 warningf(&compound->base.source_position, "'%T' needs padding", type);
3576 if (compound->modifiers & DM_PACKED && warning.packed) {
3577 warningf(&compound->base.source_position,
3578 "superfluous packed attribute on '%T'", type);
3582 type->base.size = offset;
3583 type->base.alignment = alignment;
3587 * Finish the construction of an union type by calculating
3588 * its size and alignment.
3590 static void finish_union_type(compound_type_t *type)
3592 assert(type->compound != NULL);
3594 compound_t *compound = type->compound;
3595 if (! compound->complete)
3599 il_alignment_t alignment = 1;
3601 entity_t *entry = compound->members.entities;
3602 for (; entry != NULL; entry = entry->base.next) {
3603 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3606 type_t *m_type = skip_typeref(entry->declaration.type);
3607 if (! is_type_valid(m_type))
3610 entry->compound_member.offset = 0;
3611 if (m_type->base.size > size)
3612 size = m_type->base.size;
3613 if (m_type->base.alignment > alignment)
3614 alignment = m_type->base.alignment;
3616 if (type->base.alignment != 0) {
3617 alignment = type->base.alignment;
3619 size = (size + alignment - 1) & -alignment;
3620 type->base.size = size;
3621 type->base.alignment = alignment;
3624 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3626 type_t *type = NULL;
3627 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3628 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3629 unsigned type_specifiers = 0;
3630 bool newtype = false;
3631 bool saw_error = false;
3632 bool old_gcc_extension = in_gcc_extension;
3634 specifiers->source_position = token.source_position;
3637 specifiers->modifiers
3638 |= parse_attributes(&specifiers->gnu_attributes);
3639 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3640 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3642 switch (token.type) {
3644 #define MATCH_STORAGE_CLASS(token, class) \
3646 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3647 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3649 specifiers->storage_class = class; \
3650 if (specifiers->thread_local) \
3651 goto check_thread_storage_class; \
3655 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3656 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3657 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3658 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3659 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3663 expect('(', end_error);
3664 add_anchor_token(')');
3665 parse_microsoft_extended_decl_modifier(specifiers);
3666 rem_anchor_token(')');
3667 expect(')', end_error);
3671 if (specifiers->thread_local) {
3672 errorf(HERE, "duplicate '__thread'");
3674 specifiers->thread_local = true;
3675 check_thread_storage_class:
3676 switch (specifiers->storage_class) {
3677 case STORAGE_CLASS_EXTERN:
3678 case STORAGE_CLASS_NONE:
3679 case STORAGE_CLASS_STATIC:
3683 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
3684 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
3685 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
3686 wrong_thread_stoarge_class:
3687 errorf(HERE, "'__thread' used with '%s'", wrong);
3694 /* type qualifiers */
3695 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3697 qualifiers |= qualifier; \
3701 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3702 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3703 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3704 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3705 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3706 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3707 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3708 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3710 case T___extension__:
3712 in_gcc_extension = true;
3715 /* type specifiers */
3716 #define MATCH_SPECIFIER(token, specifier, name) \
3718 if (type_specifiers & specifier) { \
3719 errorf(HERE, "multiple " name " type specifiers given"); \
3721 type_specifiers |= specifier; \
3726 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3727 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3728 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3729 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3730 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3731 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3732 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3733 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3734 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
3735 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3736 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3737 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3738 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3739 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3740 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3741 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3742 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3743 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
3745 case T__forceinline:
3746 /* only in microsoft mode */
3747 specifiers->modifiers |= DM_FORCEINLINE;
3752 specifiers->is_inline = true;
3756 if (type_specifiers & SPECIFIER_LONG_LONG) {
3757 errorf(HERE, "multiple type specifiers given");
3758 } else if (type_specifiers & SPECIFIER_LONG) {
3759 type_specifiers |= SPECIFIER_LONG_LONG;
3761 type_specifiers |= SPECIFIER_LONG;
3767 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3769 type->compound.compound = parse_compound_type_specifier(true);
3770 finish_struct_type(&type->compound);
3774 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3775 type->compound.compound = parse_compound_type_specifier(false);
3776 if (type->compound.compound->modifiers & DM_TRANSPARENT_UNION)
3777 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3778 finish_union_type(&type->compound);
3782 type = parse_enum_specifier();
3785 type = parse_typeof();
3787 case T___builtin_va_list:
3788 type = duplicate_type(type_valist);
3792 case T_IDENTIFIER: {
3793 /* only parse identifier if we haven't found a type yet */
3794 if (type != NULL || type_specifiers != 0) {
3795 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3796 * declaration, so it doesn't generate errors about expecting '(' or
3798 switch (look_ahead(1)->type) {
3805 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3809 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3814 goto finish_specifiers;
3818 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3819 if (typedef_type == NULL) {
3820 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3821 * declaration, so it doesn't generate 'implicit int' followed by more
3822 * errors later on. */
3823 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3829 errorf(HERE, "%K does not name a type", &token);
3832 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3834 type = allocate_type_zero(TYPE_TYPEDEF);
3835 type->typedeft.typedefe = &entity->typedefe;
3839 if (la1_type == '&' || la1_type == '*')
3840 goto finish_specifiers;
3845 goto finish_specifiers;
3850 type = typedef_type;
3854 /* function specifier */
3856 goto finish_specifiers;
3861 in_gcc_extension = old_gcc_extension;
3863 if (type == NULL || (saw_error && type_specifiers != 0)) {
3864 atomic_type_kind_t atomic_type;
3866 /* match valid basic types */
3867 switch (type_specifiers) {
3868 case SPECIFIER_VOID:
3869 atomic_type = ATOMIC_TYPE_VOID;
3871 case SPECIFIER_WCHAR_T:
3872 atomic_type = ATOMIC_TYPE_WCHAR_T;
3874 case SPECIFIER_CHAR:
3875 atomic_type = ATOMIC_TYPE_CHAR;
3877 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3878 atomic_type = ATOMIC_TYPE_SCHAR;
3880 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3881 atomic_type = ATOMIC_TYPE_UCHAR;
3883 case SPECIFIER_SHORT:
3884 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3885 case SPECIFIER_SHORT | SPECIFIER_INT:
3886 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3887 atomic_type = ATOMIC_TYPE_SHORT;
3889 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3890 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3891 atomic_type = ATOMIC_TYPE_USHORT;
3894 case SPECIFIER_SIGNED:
3895 case SPECIFIER_SIGNED | SPECIFIER_INT:
3896 atomic_type = ATOMIC_TYPE_INT;
3898 case SPECIFIER_UNSIGNED:
3899 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3900 atomic_type = ATOMIC_TYPE_UINT;
3902 case SPECIFIER_LONG:
3903 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3904 case SPECIFIER_LONG | SPECIFIER_INT:
3905 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3906 atomic_type = ATOMIC_TYPE_LONG;
3908 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3909 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3910 atomic_type = ATOMIC_TYPE_ULONG;
3913 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3914 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3915 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3916 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3918 atomic_type = ATOMIC_TYPE_LONGLONG;
3919 goto warn_about_long_long;
3921 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3922 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3924 atomic_type = ATOMIC_TYPE_ULONGLONG;
3925 warn_about_long_long:
3926 if (warning.long_long) {
3927 warningf(&specifiers->source_position,
3928 "ISO C90 does not support 'long long'");
3932 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3933 atomic_type = unsigned_int8_type_kind;
3936 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3937 atomic_type = unsigned_int16_type_kind;
3940 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3941 atomic_type = unsigned_int32_type_kind;
3944 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3945 atomic_type = unsigned_int64_type_kind;
3948 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3949 atomic_type = unsigned_int128_type_kind;
3952 case SPECIFIER_INT8:
3953 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3954 atomic_type = int8_type_kind;
3957 case SPECIFIER_INT16:
3958 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3959 atomic_type = int16_type_kind;
3962 case SPECIFIER_INT32:
3963 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3964 atomic_type = int32_type_kind;
3967 case SPECIFIER_INT64:
3968 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3969 atomic_type = int64_type_kind;
3972 case SPECIFIER_INT128:
3973 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3974 atomic_type = int128_type_kind;
3977 case SPECIFIER_FLOAT:
3978 atomic_type = ATOMIC_TYPE_FLOAT;
3980 case SPECIFIER_DOUBLE:
3981 atomic_type = ATOMIC_TYPE_DOUBLE;
3983 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3984 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3986 case SPECIFIER_BOOL:
3987 atomic_type = ATOMIC_TYPE_BOOL;
3989 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3990 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3991 atomic_type = ATOMIC_TYPE_FLOAT;
3993 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3994 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3995 atomic_type = ATOMIC_TYPE_DOUBLE;
3997 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3998 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3999 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
4002 /* invalid specifier combination, give an error message */
4003 if (type_specifiers == 0) {
4007 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
4008 if (!(c_mode & _CXX) && !strict_mode) {
4009 if (warning.implicit_int) {
4010 warningf(HERE, "no type specifiers in declaration, using 'int'");
4012 atomic_type = ATOMIC_TYPE_INT;
4015 errorf(HERE, "no type specifiers given in declaration");
4017 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
4018 (type_specifiers & SPECIFIER_UNSIGNED)) {
4019 errorf(HERE, "signed and unsigned specifiers given");
4020 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
4021 errorf(HERE, "only integer types can be signed or unsigned");
4023 errorf(HERE, "multiple datatypes in declaration");
4028 if (type_specifiers & SPECIFIER_COMPLEX) {
4029 type = allocate_type_zero(TYPE_COMPLEX);
4030 type->complex.akind = atomic_type;
4031 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
4032 type = allocate_type_zero(TYPE_IMAGINARY);
4033 type->imaginary.akind = atomic_type;
4035 type = allocate_type_zero(TYPE_ATOMIC);
4036 type->atomic.akind = atomic_type;
4039 } else if (type_specifiers != 0) {
4040 errorf(HERE, "multiple datatypes in declaration");
4043 /* FIXME: check type qualifiers here */
4045 type->base.qualifiers = qualifiers;
4046 type->base.modifiers = modifiers;
4048 type_t *result = typehash_insert(type);
4049 if (newtype && result != type) {
4053 specifiers->type = result;
4057 specifiers->type = type_error_type;
4061 static type_qualifiers_t parse_type_qualifiers(void)
4063 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
4066 switch (token.type) {
4067 /* type qualifiers */
4068 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
4069 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
4070 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
4071 /* microsoft extended type modifiers */
4072 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
4073 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
4074 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
4075 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
4076 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
4085 * Parses an K&R identifier list
4087 static void parse_identifier_list(scope_t *scope)
4090 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
4091 entity->base.source_position = token.source_position;
4092 entity->base.namespc = NAMESPACE_NORMAL;
4093 entity->base.symbol = token.v.symbol;
4094 /* a K&R parameter has no type, yet */
4098 append_entity(scope, entity);
4100 if (token.type != ',') {
4104 } while (token.type == T_IDENTIFIER);
4107 static entity_t *parse_parameter(void)
4109 declaration_specifiers_t specifiers;
4110 memset(&specifiers, 0, sizeof(specifiers));
4112 parse_declaration_specifiers(&specifiers);
4114 entity_t *entity = parse_declarator(&specifiers,
4115 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
4116 anonymous_entity = NULL;
4120 static void semantic_parameter_incomplete(const entity_t *entity)
4122 assert(entity->kind == ENTITY_PARAMETER);
4124 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
4125 * list in a function declarator that is part of a
4126 * definition of that function shall not have
4127 * incomplete type. */
4128 type_t *type = skip_typeref(entity->declaration.type);
4129 if (is_type_incomplete(type)) {
4130 errorf(&entity->base.source_position,
4131 "parameter '%Y' has incomplete type '%T'", entity->base.symbol,
4132 entity->declaration.type);
4137 * Parses function type parameters (and optionally creates variable_t entities
4138 * for them in a scope)
4140 static void parse_parameters(function_type_t *type, scope_t *scope)
4143 add_anchor_token(')');
4144 int saved_comma_state = save_and_reset_anchor_state(',');
4146 if (token.type == T_IDENTIFIER &&
4147 !is_typedef_symbol(token.v.symbol)) {
4148 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
4149 if (la1_type == ',' || la1_type == ')') {
4150 type->kr_style_parameters = true;
4151 type->unspecified_parameters = true;
4152 parse_identifier_list(scope);
4153 goto parameters_finished;
4157 if (token.type == ')') {
4158 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
4159 if (!(c_mode & _CXX))
4160 type->unspecified_parameters = true;
4161 goto parameters_finished;
4164 function_parameter_t *parameter;
4165 function_parameter_t *last_parameter = NULL;
4168 switch (token.type) {
4171 type->variadic = true;
4172 goto parameters_finished;
4175 case T___extension__:
4178 entity_t *entity = parse_parameter();
4179 if (entity->kind == ENTITY_TYPEDEF) {
4180 errorf(&entity->base.source_position,
4181 "typedef not allowed as function parameter");
4184 assert(is_declaration(entity));
4186 /* func(void) is not a parameter */
4187 if (last_parameter == NULL
4188 && token.type == ')'
4189 && entity->base.symbol == NULL
4190 && skip_typeref(entity->declaration.type) == type_void) {
4191 goto parameters_finished;
4193 semantic_parameter_incomplete(entity);
4195 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
4196 memset(parameter, 0, sizeof(parameter[0]));
4197 parameter->type = entity->declaration.type;
4199 if (scope != NULL) {
4200 append_entity(scope, entity);
4203 if (last_parameter != NULL) {
4204 last_parameter->next = parameter;
4206 type->parameters = parameter;
4208 last_parameter = parameter;
4213 goto parameters_finished;
4215 if (token.type != ',') {
4216 goto parameters_finished;
4222 parameters_finished:
4223 rem_anchor_token(')');
4224 expect(')', end_error);
4227 restore_anchor_state(',', saved_comma_state);
4230 typedef enum construct_type_kind_t {
4233 CONSTRUCT_REFERENCE,
4236 } construct_type_kind_t;
4238 typedef struct construct_type_t construct_type_t;
4239 struct construct_type_t {
4240 construct_type_kind_t kind;
4241 construct_type_t *next;
4244 typedef struct parsed_pointer_t parsed_pointer_t;
4245 struct parsed_pointer_t {
4246 construct_type_t construct_type;
4247 type_qualifiers_t type_qualifiers;
4248 variable_t *base_variable; /**< MS __based extension. */
4251 typedef struct parsed_reference_t parsed_reference_t;
4252 struct parsed_reference_t {
4253 construct_type_t construct_type;
4256 typedef struct construct_function_type_t construct_function_type_t;
4257 struct construct_function_type_t {
4258 construct_type_t construct_type;
4259 type_t *function_type;
4262 typedef struct parsed_array_t parsed_array_t;
4263 struct parsed_array_t {
4264 construct_type_t construct_type;
4265 type_qualifiers_t type_qualifiers;
4271 typedef struct construct_base_type_t construct_base_type_t;
4272 struct construct_base_type_t {
4273 construct_type_t construct_type;
4277 static construct_type_t *parse_pointer_declarator(variable_t *base_variable)
4281 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
4282 memset(pointer, 0, sizeof(pointer[0]));
4283 pointer->construct_type.kind = CONSTRUCT_POINTER;
4284 pointer->type_qualifiers = parse_type_qualifiers();
4285 pointer->base_variable = base_variable;
4287 return &pointer->construct_type;
4290 static construct_type_t *parse_reference_declarator(void)
4294 parsed_reference_t *reference = obstack_alloc(&temp_obst, sizeof(reference[0]));
4295 memset(reference, 0, sizeof(reference[0]));
4296 reference->construct_type.kind = CONSTRUCT_REFERENCE;
4298 return (construct_type_t*)reference;
4301 static construct_type_t *parse_array_declarator(void)
4304 add_anchor_token(']');
4306 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
4307 memset(array, 0, sizeof(array[0]));
4308 array->construct_type.kind = CONSTRUCT_ARRAY;
4310 if (token.type == T_static) {
4311 array->is_static = true;
4315 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4316 if (type_qualifiers != 0) {
4317 if (token.type == T_static) {
4318 array->is_static = true;
4322 array->type_qualifiers = type_qualifiers;
4324 if (token.type == '*' && look_ahead(1)->type == ']') {
4325 array->is_variable = true;
4327 } else if (token.type != ']') {
4328 expression_t *const size = parse_assignment_expression();
4330 mark_vars_read(size, NULL);
4333 rem_anchor_token(']');
4334 expect(']', end_error);
4337 return &array->construct_type;
4340 static construct_type_t *parse_function_declarator(scope_t *scope,
4341 decl_modifiers_t modifiers)
4343 type_t *type = allocate_type_zero(TYPE_FUNCTION);
4344 function_type_t *ftype = &type->function;
4346 ftype->linkage = current_linkage;
4348 switch (modifiers & (DM_CDECL | DM_STDCALL | DM_FASTCALL | DM_THISCALL)) {
4349 case DM_NONE: break;
4350 case DM_CDECL: ftype->calling_convention = CC_CDECL; break;
4351 case DM_STDCALL: ftype->calling_convention = CC_STDCALL; break;
4352 case DM_FASTCALL: ftype->calling_convention = CC_FASTCALL; break;
4353 case DM_THISCALL: ftype->calling_convention = CC_THISCALL; break;
4356 errorf(HERE, "multiple calling conventions in declaration");
4360 parse_parameters(ftype, scope);
4362 construct_function_type_t *construct_function_type =
4363 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
4364 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
4365 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
4366 construct_function_type->function_type = type;
4368 return &construct_function_type->construct_type;
4371 typedef struct parse_declarator_env_t {
4372 decl_modifiers_t modifiers;
4374 source_position_t source_position;
4376 } parse_declarator_env_t;
4378 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env,
4379 bool may_be_abstract)
4381 /* construct a single linked list of construct_type_t's which describe
4382 * how to construct the final declarator type */
4383 construct_type_t *first = NULL;
4384 construct_type_t *last = NULL;
4385 gnu_attribute_t *attributes = NULL;
4387 decl_modifiers_t modifiers = parse_attributes(&attributes);
4389 /* MS __based extension */
4390 based_spec_t base_spec;
4391 base_spec.base_variable = NULL;
4394 construct_type_t *type;
4395 switch (token.type) {
4397 if (!(c_mode & _CXX))
4398 errorf(HERE, "references are only available for C++");
4399 if (base_spec.base_variable != NULL && warning.other) {
4400 warningf(&base_spec.source_position,
4401 "__based does not precede a pointer operator, ignored");
4403 type = parse_reference_declarator();
4405 base_spec.base_variable = NULL;
4409 type = parse_pointer_declarator(base_spec.base_variable);
4411 base_spec.base_variable = NULL;
4416 expect('(', end_error);
4417 add_anchor_token(')');
4418 parse_microsoft_based(&base_spec);
4419 rem_anchor_token(')');
4420 expect(')', end_error);
4424 goto ptr_operator_end;
4435 /* TODO: find out if this is correct */
4436 modifiers |= parse_attributes(&attributes);
4439 if (base_spec.base_variable != NULL && warning.other) {
4440 warningf(&base_spec.source_position,
4441 "__based does not precede a pointer operator, ignored");
4445 modifiers |= env->modifiers;
4446 env->modifiers = modifiers;
4449 construct_type_t *inner_types = NULL;
4451 switch (token.type) {
4454 errorf(HERE, "no identifier expected in typename");
4456 env->symbol = token.v.symbol;
4457 env->source_position = token.source_position;
4462 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
4463 * interpreted as ``function with no parameter specification'', rather
4464 * than redundant parentheses around the omitted identifier. */
4465 if (look_ahead(1)->type != ')') {
4467 add_anchor_token(')');
4468 inner_types = parse_inner_declarator(env, may_be_abstract);
4469 if (inner_types != NULL) {
4470 /* All later declarators only modify the return type */
4473 rem_anchor_token(')');
4474 expect(')', end_error);
4478 if (may_be_abstract)
4480 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4485 construct_type_t *p = last;
4488 construct_type_t *type;
4489 switch (token.type) {
4491 scope_t *scope = NULL;
4493 scope = &env->parameters;
4495 type = parse_function_declarator(scope, modifiers);
4499 type = parse_array_declarator();
4502 goto declarator_finished;
4505 /* insert in the middle of the list (behind p) */
4507 type->next = p->next;
4518 declarator_finished:
4519 /* append inner_types at the end of the list, we don't to set last anymore
4520 * as it's not needed anymore */
4522 assert(first == NULL);
4523 first = inner_types;
4525 last->next = inner_types;
4533 static void parse_declaration_attributes(entity_t *entity)
4535 gnu_attribute_t *attributes = NULL;
4536 decl_modifiers_t modifiers = parse_attributes(&attributes);
4542 if (entity->kind == ENTITY_TYPEDEF) {
4543 modifiers |= entity->typedefe.modifiers;
4544 type = entity->typedefe.type;
4546 assert(is_declaration(entity));
4547 modifiers |= entity->declaration.modifiers;
4548 type = entity->declaration.type;
4553 /* handle these strange/stupid mode attributes */
4554 gnu_attribute_t *attribute = attributes;
4555 for ( ; attribute != NULL; attribute = attribute->next) {
4556 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
4559 atomic_type_kind_t akind = attribute->u.akind;
4560 if (!is_type_signed(type)) {
4562 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
4563 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
4564 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
4565 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
4567 panic("invalid akind in mode attribute");
4571 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_SCHAR; break;
4572 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_SHORT; break;
4573 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_INT; break;
4574 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_LONGLONG; break;
4576 panic("invalid akind in mode attribute");
4580 type = make_atomic_type(akind, type->base.qualifiers);
4583 type_modifiers_t type_modifiers = type->base.modifiers;
4584 if (modifiers & DM_TRANSPARENT_UNION)
4585 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4587 if (type->base.modifiers != type_modifiers) {
4588 type_t *copy = duplicate_type(type);
4589 copy->base.modifiers = type_modifiers;
4591 type = typehash_insert(copy);
4593 obstack_free(type_obst, copy);
4597 if (entity->kind == ENTITY_TYPEDEF) {
4598 entity->typedefe.type = type;
4599 entity->typedefe.modifiers = modifiers;
4601 entity->declaration.type = type;
4602 entity->declaration.modifiers = modifiers;
4606 static type_t *construct_declarator_type(construct_type_t *construct_list, type_t *type)
4608 construct_type_t *iter = construct_list;
4609 for (; iter != NULL; iter = iter->next) {
4610 switch (iter->kind) {
4611 case CONSTRUCT_INVALID:
4612 internal_errorf(HERE, "invalid type construction found");
4613 case CONSTRUCT_FUNCTION: {
4614 construct_function_type_t *construct_function_type
4615 = (construct_function_type_t*) iter;
4617 type_t *function_type = construct_function_type->function_type;
4619 function_type->function.return_type = type;
4621 type_t *skipped_return_type = skip_typeref(type);
4623 if (is_type_function(skipped_return_type)) {
4624 errorf(HERE, "function returning function is not allowed");
4625 } else if (is_type_array(skipped_return_type)) {
4626 errorf(HERE, "function returning array is not allowed");
4628 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4630 "type qualifiers in return type of function type are meaningless");
4634 type = function_type;
4638 case CONSTRUCT_POINTER: {
4639 if (is_type_reference(skip_typeref(type)))
4640 errorf(HERE, "cannot declare a pointer to reference");
4642 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4643 type = make_based_pointer_type(type, parsed_pointer->type_qualifiers, parsed_pointer->base_variable);
4647 case CONSTRUCT_REFERENCE:
4648 if (is_type_reference(skip_typeref(type)))
4649 errorf(HERE, "cannot declare a reference to reference");
4651 type = make_reference_type(type);
4654 case CONSTRUCT_ARRAY: {
4655 if (is_type_reference(skip_typeref(type)))
4656 errorf(HERE, "cannot declare an array of references");
4658 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4659 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4661 expression_t *size_expression = parsed_array->size;
4662 if (size_expression != NULL) {
4664 = create_implicit_cast(size_expression, type_size_t);
4667 array_type->base.qualifiers = parsed_array->type_qualifiers;
4668 array_type->array.element_type = type;
4669 array_type->array.is_static = parsed_array->is_static;
4670 array_type->array.is_variable = parsed_array->is_variable;
4671 array_type->array.size_expression = size_expression;
4673 if (size_expression != NULL) {
4674 if (is_constant_expression(size_expression)) {
4675 array_type->array.size_constant = true;
4676 array_type->array.size
4677 = fold_constant(size_expression);
4679 array_type->array.is_vla = true;
4683 type_t *skipped_type = skip_typeref(type);
4685 if (is_type_incomplete(skipped_type)) {
4686 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4687 } else if (is_type_function(skipped_type)) {
4688 errorf(HERE, "array of functions is not allowed");
4695 type_t *hashed_type = typehash_insert(type);
4696 if (hashed_type != type) {
4697 /* the function type was constructed earlier freeing it here will
4698 * destroy other types... */
4699 if (iter->kind != CONSTRUCT_FUNCTION) {
4709 static type_t *automatic_type_conversion(type_t *orig_type);
4711 static type_t *semantic_parameter(const source_position_t *pos,
4713 const declaration_specifiers_t *specifiers,
4716 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
4717 * shall be adjusted to ``qualified pointer to type'',
4719 * §6.7.5.3:8 A declaration of a parameter as ``function returning
4720 * type'' shall be adjusted to ``pointer to function
4721 * returning type'', as in 6.3.2.1. */
4722 type = automatic_type_conversion(type);
4724 if (specifiers->is_inline && is_type_valid(type)) {
4725 errorf(pos, "parameter '%Y' declared 'inline'", symbol);
4728 /* §6.9.1:6 The declarations in the declaration list shall contain
4729 * no storage-class specifier other than register and no
4730 * initializations. */
4731 if (specifiers->thread_local || (
4732 specifiers->storage_class != STORAGE_CLASS_NONE &&
4733 specifiers->storage_class != STORAGE_CLASS_REGISTER)
4735 errorf(pos, "invalid storage class for parameter '%Y'", symbol);
4738 /* delay test for incomplete type, because we might have (void)
4739 * which is legal but incomplete... */
4744 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4745 declarator_flags_t flags)
4747 parse_declarator_env_t env;
4748 memset(&env, 0, sizeof(env));
4749 env.modifiers = specifiers->modifiers;
4751 construct_type_t *construct_type =
4752 parse_inner_declarator(&env, (flags & DECL_MAY_BE_ABSTRACT) != 0);
4754 construct_declarator_type(construct_type, specifiers->type);
4755 type_t *type = skip_typeref(orig_type);
4757 if (construct_type != NULL) {
4758 obstack_free(&temp_obst, construct_type);
4762 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4763 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4764 entity->base.symbol = env.symbol;
4765 entity->base.source_position = env.source_position;
4766 entity->typedefe.type = orig_type;
4768 if (anonymous_entity != NULL) {
4769 if (is_type_compound(type)) {
4770 assert(anonymous_entity->compound.alias == NULL);
4771 assert(anonymous_entity->kind == ENTITY_STRUCT ||
4772 anonymous_entity->kind == ENTITY_UNION);
4773 anonymous_entity->compound.alias = entity;
4774 anonymous_entity = NULL;
4775 } else if (is_type_enum(type)) {
4776 assert(anonymous_entity->enume.alias == NULL);
4777 assert(anonymous_entity->kind == ENTITY_ENUM);
4778 anonymous_entity->enume.alias = entity;
4779 anonymous_entity = NULL;
4783 /* create a declaration type entity */
4784 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
4785 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4787 if (specifiers->is_inline && is_type_valid(type)) {
4788 errorf(&env.source_position,
4789 "compound member '%Y' declared 'inline'", env.symbol);
4792 if (specifiers->thread_local ||
4793 specifiers->storage_class != STORAGE_CLASS_NONE) {
4794 errorf(&env.source_position,
4795 "compound member '%Y' must have no storage class",
4798 } else if (flags & DECL_IS_PARAMETER) {
4799 orig_type = semantic_parameter(&env.source_position, orig_type,
4800 specifiers, env.symbol);
4802 entity = allocate_entity_zero(ENTITY_PARAMETER);
4803 } else if (is_type_function(type)) {
4804 entity = allocate_entity_zero(ENTITY_FUNCTION);
4806 entity->function.is_inline = specifiers->is_inline;
4807 entity->function.parameters = env.parameters;
4809 if (specifiers->thread_local || (
4810 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4811 specifiers->storage_class != STORAGE_CLASS_NONE &&
4812 specifiers->storage_class != STORAGE_CLASS_STATIC)
4814 errorf(&env.source_position,
4815 "invalid storage class for function '%Y'", env.symbol);
4818 entity = allocate_entity_zero(ENTITY_VARIABLE);
4820 entity->variable.get_property_sym = specifiers->get_property_sym;
4821 entity->variable.put_property_sym = specifiers->put_property_sym;
4822 if (specifiers->alignment != 0) {
4823 /* TODO: add checks here */
4824 entity->variable.alignment = specifiers->alignment;
4827 if (specifiers->is_inline && is_type_valid(type)) {
4828 errorf(&env.source_position,
4829 "variable '%Y' declared 'inline'", env.symbol);
4832 entity->variable.thread_local = specifiers->thread_local;
4834 bool invalid_storage_class = false;
4835 if (current_scope == file_scope) {
4836 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4837 specifiers->storage_class != STORAGE_CLASS_NONE &&
4838 specifiers->storage_class != STORAGE_CLASS_STATIC) {
4839 invalid_storage_class = true;
4842 if (specifiers->thread_local &&
4843 specifiers->storage_class == STORAGE_CLASS_NONE) {
4844 invalid_storage_class = true;
4847 if (invalid_storage_class) {
4848 errorf(&env.source_position,
4849 "invalid storage class for variable '%Y'", env.symbol);
4853 entity->base.source_position = env.source_position;
4854 entity->base.symbol = env.symbol;
4855 entity->base.namespc = NAMESPACE_NORMAL;
4856 entity->declaration.type = orig_type;
4857 entity->declaration.modifiers = env.modifiers;
4858 entity->declaration.deprecated_string = specifiers->deprecated_string;
4860 storage_class_t storage_class = specifiers->storage_class;
4861 entity->declaration.declared_storage_class = storage_class;
4863 if (storage_class == STORAGE_CLASS_NONE && current_scope != file_scope)
4864 storage_class = STORAGE_CLASS_AUTO;
4865 entity->declaration.storage_class = storage_class;
4868 parse_declaration_attributes(entity);
4873 static type_t *parse_abstract_declarator(type_t *base_type)
4875 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4877 type_t *result = construct_declarator_type(construct_type, base_type);
4878 if (construct_type != NULL) {
4879 obstack_free(&temp_obst, construct_type);
4886 * Check if the declaration of main is suspicious. main should be a
4887 * function with external linkage, returning int, taking either zero
4888 * arguments, two, or three arguments of appropriate types, ie.
4890 * int main([ int argc, char **argv [, char **env ] ]).
4892 * @param decl the declaration to check
4893 * @param type the function type of the declaration
4895 static void check_type_of_main(const entity_t *entity)
4897 const source_position_t *pos = &entity->base.source_position;
4898 if (entity->kind != ENTITY_FUNCTION) {
4899 warningf(pos, "'main' is not a function");
4903 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4904 warningf(pos, "'main' is normally a non-static function");
4907 type_t *type = skip_typeref(entity->declaration.type);
4908 assert(is_type_function(type));
4910 function_type_t *func_type = &type->function;
4911 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4912 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4913 func_type->return_type);
4915 const function_parameter_t *parm = func_type->parameters;
4917 type_t *const first_type = parm->type;
4918 if (!types_compatible(skip_typeref(first_type), type_int)) {
4920 "first argument of 'main' should be 'int', but is '%T'",
4925 type_t *const second_type = parm->type;
4926 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4927 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4931 type_t *const third_type = parm->type;
4932 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4933 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4937 goto warn_arg_count;
4941 warningf(pos, "'main' takes only zero, two or three arguments");
4947 * Check if a symbol is the equal to "main".
4949 static bool is_sym_main(const symbol_t *const sym)
4951 return strcmp(sym->string, "main") == 0;
4954 static void error_redefined_as_different_kind(const source_position_t *pos,
4955 const entity_t *old, entity_kind_t new_kind)
4957 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4958 get_entity_kind_name(old->kind), old->base.symbol,
4959 get_entity_kind_name(new_kind), &old->base.source_position);
4963 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4964 * for various problems that occur for multiple definitions
4966 static entity_t *record_entity(entity_t *entity, const bool is_definition)
4968 const symbol_t *const symbol = entity->base.symbol;
4969 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4970 const source_position_t *pos = &entity->base.source_position;
4972 /* can happen in error cases */
4976 entity_t *previous_entity = get_entity(symbol, namespc);
4977 /* pushing the same entity twice will break the stack structure */
4978 assert(previous_entity != entity);
4980 if (entity->kind == ENTITY_FUNCTION) {
4981 type_t *const orig_type = entity->declaration.type;
4982 type_t *const type = skip_typeref(orig_type);
4984 assert(is_type_function(type));
4985 if (type->function.unspecified_parameters &&
4986 warning.strict_prototypes &&
4987 previous_entity == NULL) {
4988 warningf(pos, "function declaration '%#T' is not a prototype",
4992 if (warning.main && current_scope == file_scope
4993 && is_sym_main(symbol)) {
4994 check_type_of_main(entity);
4998 if (is_declaration(entity) &&
4999 warning.nested_externs &&
5000 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
5001 current_scope != file_scope) {
5002 warningf(pos, "nested extern declaration of '%#T'",
5003 entity->declaration.type, symbol);
5006 if (previous_entity != NULL &&
5007 previous_entity->base.parent_scope == ¤t_function->parameters &&
5008 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
5009 assert(previous_entity->kind == ENTITY_PARAMETER);
5011 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
5012 entity->declaration.type, symbol,
5013 previous_entity->declaration.type, symbol,
5014 &previous_entity->base.source_position);
5018 if (previous_entity != NULL &&
5019 previous_entity->base.parent_scope == current_scope) {
5020 if (previous_entity->kind != entity->kind) {
5021 error_redefined_as_different_kind(pos, previous_entity,
5025 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
5026 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
5027 symbol, &previous_entity->base.source_position);
5030 if (previous_entity->kind == ENTITY_TYPEDEF) {
5031 /* TODO: C++ allows this for exactly the same type */
5032 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
5033 symbol, &previous_entity->base.source_position);
5037 /* at this point we should have only VARIABLES or FUNCTIONS */
5038 assert(is_declaration(previous_entity) && is_declaration(entity));
5040 declaration_t *const prev_decl = &previous_entity->declaration;
5041 declaration_t *const decl = &entity->declaration;
5043 /* can happen for K&R style declarations */
5044 if (prev_decl->type == NULL &&
5045 previous_entity->kind == ENTITY_PARAMETER &&
5046 entity->kind == ENTITY_PARAMETER) {
5047 prev_decl->type = decl->type;
5048 prev_decl->storage_class = decl->storage_class;
5049 prev_decl->declared_storage_class = decl->declared_storage_class;
5050 prev_decl->modifiers = decl->modifiers;
5051 prev_decl->deprecated_string = decl->deprecated_string;
5052 return previous_entity;
5055 type_t *const orig_type = decl->type;
5056 assert(orig_type != NULL);
5057 type_t *const type = skip_typeref(orig_type);
5058 type_t * prev_type = skip_typeref(prev_decl->type);
5060 if (!types_compatible(type, prev_type)) {
5062 "declaration '%#T' is incompatible with '%#T' (declared %P)",
5063 orig_type, symbol, prev_decl->type, symbol,
5064 &previous_entity->base.source_position);
5066 unsigned old_storage_class = prev_decl->storage_class;
5067 if (warning.redundant_decls &&
5070 !(prev_decl->modifiers & DM_USED) &&
5071 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
5072 warningf(&previous_entity->base.source_position,
5073 "unnecessary static forward declaration for '%#T'",
5074 prev_decl->type, symbol);
5077 unsigned new_storage_class = decl->storage_class;
5078 if (is_type_incomplete(prev_type)) {
5079 prev_decl->type = type;
5083 /* pretend no storage class means extern for function
5084 * declarations (except if the previous declaration is neither
5085 * none nor extern) */
5086 if (entity->kind == ENTITY_FUNCTION) {
5087 if (prev_type->function.unspecified_parameters) {
5088 prev_decl->type = type;
5092 switch (old_storage_class) {
5093 case STORAGE_CLASS_NONE:
5094 old_storage_class = STORAGE_CLASS_EXTERN;
5097 case STORAGE_CLASS_EXTERN:
5098 if (is_definition) {
5099 if (warning.missing_prototypes &&
5100 prev_type->function.unspecified_parameters &&
5101 !is_sym_main(symbol)) {
5102 warningf(pos, "no previous prototype for '%#T'",
5105 } else if (new_storage_class == STORAGE_CLASS_NONE) {
5106 new_storage_class = STORAGE_CLASS_EXTERN;
5115 if (old_storage_class == STORAGE_CLASS_EXTERN &&
5116 new_storage_class == STORAGE_CLASS_EXTERN) {
5117 warn_redundant_declaration:
5118 if (!is_definition &&
5119 warning.redundant_decls &&
5120 is_type_valid(prev_type) &&
5121 strcmp(previous_entity->base.source_position.input_name,
5122 "<builtin>") != 0) {
5124 "redundant declaration for '%Y' (declared %P)",
5125 symbol, &previous_entity->base.source_position);
5127 } else if (current_function == NULL) {
5128 if (old_storage_class != STORAGE_CLASS_STATIC &&
5129 new_storage_class == STORAGE_CLASS_STATIC) {
5131 "static declaration of '%Y' follows non-static declaration (declared %P)",
5132 symbol, &previous_entity->base.source_position);
5133 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
5134 prev_decl->storage_class = STORAGE_CLASS_NONE;
5135 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
5137 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
5139 goto error_redeclaration;
5140 goto warn_redundant_declaration;
5142 } else if (is_type_valid(prev_type)) {
5143 if (old_storage_class == new_storage_class) {
5144 error_redeclaration:
5145 errorf(pos, "redeclaration of '%Y' (declared %P)",
5146 symbol, &previous_entity->base.source_position);
5149 "redeclaration of '%Y' with different linkage (declared %P)",
5150 symbol, &previous_entity->base.source_position);
5155 prev_decl->modifiers |= decl->modifiers;
5156 if (entity->kind == ENTITY_FUNCTION) {
5157 previous_entity->function.is_inline |= entity->function.is_inline;
5159 return previous_entity;
5162 if (entity->kind == ENTITY_FUNCTION) {
5163 if (is_definition &&
5164 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
5165 if (warning.missing_prototypes && !is_sym_main(symbol)) {
5166 warningf(pos, "no previous prototype for '%#T'",
5167 entity->declaration.type, symbol);
5168 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
5169 warningf(pos, "no previous declaration for '%#T'",
5170 entity->declaration.type, symbol);
5173 } else if (warning.missing_declarations &&
5174 entity->kind == ENTITY_VARIABLE &&
5175 current_scope == file_scope) {
5176 declaration_t *declaration = &entity->declaration;
5177 if (declaration->storage_class == STORAGE_CLASS_NONE) {
5178 warningf(pos, "no previous declaration for '%#T'",
5179 declaration->type, symbol);
5184 assert(entity->base.parent_scope == NULL);
5185 assert(current_scope != NULL);
5187 entity->base.parent_scope = current_scope;
5188 entity->base.namespc = NAMESPACE_NORMAL;
5189 environment_push(entity);
5190 append_entity(current_scope, entity);
5195 static void parser_error_multiple_definition(entity_t *entity,
5196 const source_position_t *source_position)
5198 errorf(source_position, "multiple definition of '%Y' (declared %P)",
5199 entity->base.symbol, &entity->base.source_position);
5202 static bool is_declaration_specifier(const token_t *token,
5203 bool only_specifiers_qualifiers)
5205 switch (token->type) {
5210 return is_typedef_symbol(token->v.symbol);
5212 case T___extension__:
5214 return !only_specifiers_qualifiers;
5221 static void parse_init_declarator_rest(entity_t *entity)
5223 assert(is_declaration(entity));
5224 declaration_t *const declaration = &entity->declaration;
5228 type_t *orig_type = declaration->type;
5229 type_t *type = skip_typeref(orig_type);
5231 if (entity->kind == ENTITY_VARIABLE
5232 && entity->variable.initializer != NULL) {
5233 parser_error_multiple_definition(entity, HERE);
5236 bool must_be_constant = false;
5237 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
5238 entity->base.parent_scope == file_scope) {
5239 must_be_constant = true;
5242 if (is_type_function(type)) {
5243 errorf(&entity->base.source_position,
5244 "function '%#T' is initialized like a variable",
5245 orig_type, entity->base.symbol);
5246 orig_type = type_error_type;
5249 parse_initializer_env_t env;
5250 env.type = orig_type;
5251 env.must_be_constant = must_be_constant;
5252 env.entity = entity;
5253 current_init_decl = entity;
5255 initializer_t *initializer = parse_initializer(&env);
5256 current_init_decl = NULL;
5258 if (entity->kind == ENTITY_VARIABLE) {
5259 /* § 6.7.5 (22) array initializers for arrays with unknown size
5260 * determine the array type size */
5261 declaration->type = env.type;
5262 entity->variable.initializer = initializer;
5266 /* parse rest of a declaration without any declarator */
5267 static void parse_anonymous_declaration_rest(
5268 const declaration_specifiers_t *specifiers)
5271 anonymous_entity = NULL;
5273 if (warning.other) {
5274 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
5275 specifiers->thread_local) {
5276 warningf(&specifiers->source_position,
5277 "useless storage class in empty declaration");
5280 type_t *type = specifiers->type;
5281 switch (type->kind) {
5282 case TYPE_COMPOUND_STRUCT:
5283 case TYPE_COMPOUND_UNION: {
5284 if (type->compound.compound->base.symbol == NULL) {
5285 warningf(&specifiers->source_position,
5286 "unnamed struct/union that defines no instances");
5295 warningf(&specifiers->source_position, "empty declaration");
5301 static void check_variable_type_complete(entity_t *ent)
5303 if (ent->kind != ENTITY_VARIABLE)
5306 /* §6.7:7 If an identifier for an object is declared with no linkage, the
5307 * type for the object shall be complete [...] */
5308 declaration_t *decl = &ent->declaration;
5309 if (decl->storage_class != STORAGE_CLASS_NONE)
5312 type_t *const orig_type = decl->type;
5313 type_t *const type = skip_typeref(orig_type);
5314 if (!is_type_incomplete(type))
5317 /* GCC allows global arrays without size and assigns them a length of one,
5318 * if no different declaration follows */
5319 if (is_type_array(type) &&
5321 ent->base.parent_scope == file_scope) {
5322 ARR_APP1(declaration_t*, incomplete_arrays, decl);
5326 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
5327 orig_type, ent->base.symbol);
5331 static void parse_declaration_rest(entity_t *ndeclaration,
5332 const declaration_specifiers_t *specifiers,
5333 parsed_declaration_func finished_declaration,
5334 declarator_flags_t flags)
5336 add_anchor_token(';');
5337 add_anchor_token(',');
5339 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
5341 if (token.type == '=') {
5342 parse_init_declarator_rest(entity);
5343 } else if (entity->kind == ENTITY_VARIABLE) {
5344 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
5345 * [...] where the extern specifier is explicitly used. */
5346 declaration_t *decl = &entity->declaration;
5347 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
5348 type_t *type = decl->type;
5349 if (is_type_reference(skip_typeref(type))) {
5350 errorf(&entity->base.source_position,
5351 "reference '%#T' must be initialized",
5352 type, entity->base.symbol);
5357 check_variable_type_complete(entity);
5359 if (token.type != ',')
5363 add_anchor_token('=');
5364 ndeclaration = parse_declarator(specifiers, flags);
5365 rem_anchor_token('=');
5367 expect(';', end_error);
5370 anonymous_entity = NULL;
5371 rem_anchor_token(';');
5372 rem_anchor_token(',');
5375 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
5377 symbol_t *symbol = entity->base.symbol;
5378 if (symbol == NULL) {
5379 errorf(HERE, "anonymous declaration not valid as function parameter");
5383 assert(entity->base.namespc == NAMESPACE_NORMAL);
5384 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
5385 if (previous_entity == NULL
5386 || previous_entity->base.parent_scope != current_scope) {
5387 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
5392 if (is_definition) {
5393 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
5396 return record_entity(entity, false);
5399 static void parse_declaration(parsed_declaration_func finished_declaration,
5400 declarator_flags_t flags)
5402 declaration_specifiers_t specifiers;
5403 memset(&specifiers, 0, sizeof(specifiers));
5405 add_anchor_token(';');
5406 parse_declaration_specifiers(&specifiers);
5407 rem_anchor_token(';');
5409 if (token.type == ';') {
5410 parse_anonymous_declaration_rest(&specifiers);
5412 entity_t *entity = parse_declarator(&specifiers, flags);
5413 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
5417 static type_t *get_default_promoted_type(type_t *orig_type)
5419 type_t *result = orig_type;
5421 type_t *type = skip_typeref(orig_type);
5422 if (is_type_integer(type)) {
5423 result = promote_integer(type);
5424 } else if (type == type_float) {
5425 result = type_double;
5431 static void parse_kr_declaration_list(entity_t *entity)
5433 if (entity->kind != ENTITY_FUNCTION)
5436 type_t *type = skip_typeref(entity->declaration.type);
5437 assert(is_type_function(type));
5438 if (!type->function.kr_style_parameters)
5442 add_anchor_token('{');
5444 /* push function parameters */
5445 size_t const top = environment_top();
5446 scope_t *old_scope = scope_push(&entity->function.parameters);
5448 entity_t *parameter = entity->function.parameters.entities;
5449 for ( ; parameter != NULL; parameter = parameter->base.next) {
5450 assert(parameter->base.parent_scope == NULL);
5451 parameter->base.parent_scope = current_scope;
5452 environment_push(parameter);
5455 /* parse declaration list */
5457 switch (token.type) {
5459 case T___extension__:
5460 /* This covers symbols, which are no type, too, and results in
5461 * better error messages. The typical cases are misspelled type
5462 * names and missing includes. */
5464 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
5472 /* pop function parameters */
5473 assert(current_scope == &entity->function.parameters);
5474 scope_pop(old_scope);
5475 environment_pop_to(top);
5477 /* update function type */
5478 type_t *new_type = duplicate_type(type);
5480 function_parameter_t *parameters = NULL;
5481 function_parameter_t *last_parameter = NULL;
5483 parameter = entity->function.parameters.entities;
5484 for (; parameter != NULL; parameter = parameter->base.next) {
5485 type_t *parameter_type = parameter->declaration.type;
5486 if (parameter_type == NULL) {
5488 errorf(HERE, "no type specified for function parameter '%Y'",
5489 parameter->base.symbol);
5491 if (warning.implicit_int) {
5492 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5493 parameter->base.symbol);
5495 parameter_type = type_int;
5496 parameter->declaration.type = parameter_type;
5500 semantic_parameter_incomplete(parameter);
5501 parameter_type = parameter->declaration.type;
5504 * we need the default promoted types for the function type
5506 parameter_type = get_default_promoted_type(parameter_type);
5508 function_parameter_t *function_parameter
5509 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
5510 memset(function_parameter, 0, sizeof(function_parameter[0]));
5512 function_parameter->type = parameter_type;
5513 if (last_parameter != NULL) {
5514 last_parameter->next = function_parameter;
5516 parameters = function_parameter;
5518 last_parameter = function_parameter;
5521 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
5523 new_type->function.parameters = parameters;
5524 new_type->function.unspecified_parameters = true;
5526 type = typehash_insert(new_type);
5527 if (type != new_type) {
5528 obstack_free(type_obst, new_type);
5531 entity->declaration.type = type;
5533 rem_anchor_token('{');
5536 static bool first_err = true;
5539 * When called with first_err set, prints the name of the current function,
5542 static void print_in_function(void)
5546 diagnosticf("%s: In function '%Y':\n",
5547 current_function->base.base.source_position.input_name,
5548 current_function->base.base.symbol);
5553 * Check if all labels are defined in the current function.
5554 * Check if all labels are used in the current function.
5556 static void check_labels(void)
5558 for (const goto_statement_t *goto_statement = goto_first;
5559 goto_statement != NULL;
5560 goto_statement = goto_statement->next) {
5561 /* skip computed gotos */
5562 if (goto_statement->expression != NULL)
5565 label_t *label = goto_statement->label;
5568 if (label->base.source_position.input_name == NULL) {
5569 print_in_function();
5570 errorf(&goto_statement->base.source_position,
5571 "label '%Y' used but not defined", label->base.symbol);
5575 if (warning.unused_label) {
5576 for (const label_statement_t *label_statement = label_first;
5577 label_statement != NULL;
5578 label_statement = label_statement->next) {
5579 label_t *label = label_statement->label;
5581 if (! label->used) {
5582 print_in_function();
5583 warningf(&label_statement->base.source_position,
5584 "label '%Y' defined but not used", label->base.symbol);
5590 static void warn_unused_entity(entity_t *entity, entity_t *last)
5592 entity_t const *const end = last != NULL ? last->base.next : NULL;
5593 for (; entity != end; entity = entity->base.next) {
5594 if (!is_declaration(entity))
5597 declaration_t *declaration = &entity->declaration;
5598 if (declaration->implicit)
5601 if (!declaration->used) {
5602 print_in_function();
5603 const char *what = get_entity_kind_name(entity->kind);
5604 warningf(&entity->base.source_position, "%s '%Y' is unused",
5605 what, entity->base.symbol);
5606 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
5607 print_in_function();
5608 const char *what = get_entity_kind_name(entity->kind);
5609 warningf(&entity->base.source_position, "%s '%Y' is never read",
5610 what, entity->base.symbol);
5615 static void check_unused_variables(statement_t *const stmt, void *const env)
5619 switch (stmt->kind) {
5620 case STATEMENT_DECLARATION: {
5621 declaration_statement_t const *const decls = &stmt->declaration;
5622 warn_unused_entity(decls->declarations_begin,
5623 decls->declarations_end);
5628 warn_unused_entity(stmt->fors.scope.entities, NULL);
5637 * Check declarations of current_function for unused entities.
5639 static void check_declarations(void)
5641 if (warning.unused_parameter) {
5642 const scope_t *scope = ¤t_function->parameters;
5644 /* do not issue unused warnings for main */
5645 if (!is_sym_main(current_function->base.base.symbol)) {
5646 warn_unused_entity(scope->entities, NULL);
5649 if (warning.unused_variable) {
5650 walk_statements(current_function->statement, check_unused_variables,
5655 static int determine_truth(expression_t const* const cond)
5658 !is_constant_expression(cond) ? 0 :
5659 fold_constant(cond) != 0 ? 1 :
5663 static void check_reachable(statement_t *);
5664 static bool reaches_end;
5666 static bool expression_returns(expression_t const *const expr)
5668 switch (expr->kind) {
5670 expression_t const *const func = expr->call.function;
5671 if (func->kind == EXPR_REFERENCE) {
5672 entity_t *entity = func->reference.entity;
5673 if (entity->kind == ENTITY_FUNCTION
5674 && entity->declaration.modifiers & DM_NORETURN)
5678 if (!expression_returns(func))
5681 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5682 if (!expression_returns(arg->expression))
5689 case EXPR_REFERENCE:
5690 case EXPR_REFERENCE_ENUM_VALUE:
5692 case EXPR_CHARACTER_CONSTANT:
5693 case EXPR_WIDE_CHARACTER_CONSTANT:
5694 case EXPR_STRING_LITERAL:
5695 case EXPR_WIDE_STRING_LITERAL:
5696 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5697 case EXPR_LABEL_ADDRESS:
5698 case EXPR_CLASSIFY_TYPE:
5699 case EXPR_SIZEOF: // TODO handle obscure VLA case
5702 case EXPR_BUILTIN_SYMBOL:
5703 case EXPR_BUILTIN_CONSTANT_P:
5704 case EXPR_BUILTIN_PREFETCH:
5709 case EXPR_STATEMENT: {
5710 bool old_reaches_end = reaches_end;
5711 reaches_end = false;
5712 check_reachable(expr->statement.statement);
5713 bool returns = reaches_end;
5714 reaches_end = old_reaches_end;
5718 case EXPR_CONDITIONAL:
5719 // TODO handle constant expression
5721 if (!expression_returns(expr->conditional.condition))
5724 if (expr->conditional.true_expression != NULL
5725 && expression_returns(expr->conditional.true_expression))
5728 return expression_returns(expr->conditional.false_expression);
5731 return expression_returns(expr->select.compound);
5733 case EXPR_ARRAY_ACCESS:
5735 expression_returns(expr->array_access.array_ref) &&
5736 expression_returns(expr->array_access.index);
5739 return expression_returns(expr->va_starte.ap);
5742 return expression_returns(expr->va_arge.ap);
5744 EXPR_UNARY_CASES_MANDATORY
5745 return expression_returns(expr->unary.value);
5747 case EXPR_UNARY_THROW:
5751 // TODO handle constant lhs of && and ||
5753 expression_returns(expr->binary.left) &&
5754 expression_returns(expr->binary.right);
5760 panic("unhandled expression");
5763 static bool initializer_returns(initializer_t const *const init)
5765 switch (init->kind) {
5766 case INITIALIZER_VALUE:
5767 return expression_returns(init->value.value);
5769 case INITIALIZER_LIST: {
5770 initializer_t * const* i = init->list.initializers;
5771 initializer_t * const* const end = i + init->list.len;
5772 bool returns = true;
5773 for (; i != end; ++i) {
5774 if (!initializer_returns(*i))
5780 case INITIALIZER_STRING:
5781 case INITIALIZER_WIDE_STRING:
5782 case INITIALIZER_DESIGNATOR: // designators have no payload
5785 panic("unhandled initializer");
5788 static bool noreturn_candidate;
5790 static void check_reachable(statement_t *const stmt)
5792 if (stmt->base.reachable)
5794 if (stmt->kind != STATEMENT_DO_WHILE)
5795 stmt->base.reachable = true;
5797 statement_t *last = stmt;
5799 switch (stmt->kind) {
5800 case STATEMENT_INVALID:
5801 case STATEMENT_EMPTY:
5802 case STATEMENT_LOCAL_LABEL:
5804 next = stmt->base.next;
5807 case STATEMENT_DECLARATION: {
5808 declaration_statement_t const *const decl = &stmt->declaration;
5809 entity_t const * ent = decl->declarations_begin;
5810 entity_t const *const last = decl->declarations_end;
5812 for (;; ent = ent->base.next) {
5813 if (ent->kind == ENTITY_VARIABLE &&
5814 ent->variable.initializer != NULL &&
5815 !initializer_returns(ent->variable.initializer)) {
5822 next = stmt->base.next;
5826 case STATEMENT_COMPOUND:
5827 next = stmt->compound.statements;
5830 case STATEMENT_RETURN: {
5831 expression_t const *const val = stmt->returns.value;
5832 if (val == NULL || expression_returns(val))
5833 noreturn_candidate = false;
5837 case STATEMENT_IF: {
5838 if_statement_t const *const ifs = &stmt->ifs;
5839 expression_t const *const cond = ifs->condition;
5841 if (!expression_returns(cond))
5844 int const val = determine_truth(cond);
5847 check_reachable(ifs->true_statement);
5852 if (ifs->false_statement != NULL) {
5853 check_reachable(ifs->false_statement);
5857 next = stmt->base.next;
5861 case STATEMENT_SWITCH: {
5862 switch_statement_t const *const switchs = &stmt->switchs;
5863 expression_t const *const expr = switchs->expression;
5865 if (!expression_returns(expr))
5868 if (is_constant_expression(expr)) {
5869 long const val = fold_constant(expr);
5870 case_label_statement_t * defaults = NULL;
5871 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5872 if (i->expression == NULL) {
5877 if (i->first_case <= val && val <= i->last_case) {
5878 check_reachable((statement_t*)i);
5883 if (defaults != NULL) {
5884 check_reachable((statement_t*)defaults);
5888 bool has_default = false;
5889 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5890 if (i->expression == NULL)
5893 check_reachable((statement_t*)i);
5900 next = stmt->base.next;
5904 case STATEMENT_EXPRESSION: {
5905 /* Check for noreturn function call */
5906 expression_t const *const expr = stmt->expression.expression;
5907 if (!expression_returns(expr))
5910 next = stmt->base.next;
5914 case STATEMENT_CONTINUE: {
5915 statement_t *parent = stmt;
5917 parent = parent->base.parent;
5918 if (parent == NULL) /* continue not within loop */
5922 switch (parent->kind) {
5923 case STATEMENT_WHILE: goto continue_while;
5924 case STATEMENT_DO_WHILE: goto continue_do_while;
5925 case STATEMENT_FOR: goto continue_for;
5932 case STATEMENT_BREAK: {
5933 statement_t *parent = stmt;
5935 parent = parent->base.parent;
5936 if (parent == NULL) /* break not within loop/switch */
5939 switch (parent->kind) {
5940 case STATEMENT_SWITCH:
5941 case STATEMENT_WHILE:
5942 case STATEMENT_DO_WHILE:
5945 next = parent->base.next;
5946 goto found_break_parent;
5955 case STATEMENT_GOTO:
5956 if (stmt->gotos.expression) {
5957 if (!expression_returns(stmt->gotos.expression))
5960 statement_t *parent = stmt->base.parent;
5961 if (parent == NULL) /* top level goto */
5965 next = stmt->gotos.label->statement;
5966 if (next == NULL) /* missing label */
5971 case STATEMENT_LABEL:
5972 next = stmt->label.statement;
5975 case STATEMENT_CASE_LABEL:
5976 next = stmt->case_label.statement;
5979 case STATEMENT_WHILE: {
5980 while_statement_t const *const whiles = &stmt->whiles;
5981 expression_t const *const cond = whiles->condition;
5983 if (!expression_returns(cond))
5986 int const val = determine_truth(cond);
5989 check_reachable(whiles->body);
5994 next = stmt->base.next;
5998 case STATEMENT_DO_WHILE:
5999 next = stmt->do_while.body;
6002 case STATEMENT_FOR: {
6003 for_statement_t *const fors = &stmt->fors;
6005 if (fors->condition_reachable)
6007 fors->condition_reachable = true;
6009 expression_t const *const cond = fors->condition;
6014 } else if (expression_returns(cond)) {
6015 val = determine_truth(cond);
6021 check_reachable(fors->body);
6026 next = stmt->base.next;
6030 case STATEMENT_MS_TRY: {
6031 ms_try_statement_t const *const ms_try = &stmt->ms_try;
6032 check_reachable(ms_try->try_statement);
6033 next = ms_try->final_statement;
6037 case STATEMENT_LEAVE: {
6038 statement_t *parent = stmt;
6040 parent = parent->base.parent;
6041 if (parent == NULL) /* __leave not within __try */
6044 if (parent->kind == STATEMENT_MS_TRY) {
6046 next = parent->ms_try.final_statement;
6054 panic("invalid statement kind");
6057 while (next == NULL) {
6058 next = last->base.parent;
6060 noreturn_candidate = false;
6062 type_t *const type = current_function->base.type;
6063 assert(is_type_function(type));
6064 type_t *const ret = skip_typeref(type->function.return_type);
6065 if (warning.return_type &&
6066 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
6067 is_type_valid(ret) &&
6068 !is_sym_main(current_function->base.base.symbol)) {
6069 warningf(&stmt->base.source_position,
6070 "control reaches end of non-void function");
6075 switch (next->kind) {
6076 case STATEMENT_INVALID:
6077 case STATEMENT_EMPTY:
6078 case STATEMENT_DECLARATION:
6079 case STATEMENT_LOCAL_LABEL:
6080 case STATEMENT_EXPRESSION:
6082 case STATEMENT_RETURN:
6083 case STATEMENT_CONTINUE:
6084 case STATEMENT_BREAK:
6085 case STATEMENT_GOTO:
6086 case STATEMENT_LEAVE:
6087 panic("invalid control flow in function");
6089 case STATEMENT_COMPOUND:
6090 if (next->compound.stmt_expr) {
6096 case STATEMENT_SWITCH:
6097 case STATEMENT_LABEL:
6098 case STATEMENT_CASE_LABEL:
6100 next = next->base.next;
6103 case STATEMENT_WHILE: {
6105 if (next->base.reachable)
6107 next->base.reachable = true;
6109 while_statement_t const *const whiles = &next->whiles;
6110 expression_t const *const cond = whiles->condition;
6112 if (!expression_returns(cond))
6115 int const val = determine_truth(cond);
6118 check_reachable(whiles->body);
6124 next = next->base.next;
6128 case STATEMENT_DO_WHILE: {
6130 if (next->base.reachable)
6132 next->base.reachable = true;
6134 do_while_statement_t const *const dw = &next->do_while;
6135 expression_t const *const cond = dw->condition;
6137 if (!expression_returns(cond))
6140 int const val = determine_truth(cond);
6143 check_reachable(dw->body);
6149 next = next->base.next;
6153 case STATEMENT_FOR: {
6155 for_statement_t *const fors = &next->fors;
6157 fors->step_reachable = true;
6159 if (fors->condition_reachable)
6161 fors->condition_reachable = true;
6163 expression_t const *const cond = fors->condition;
6168 } else if (expression_returns(cond)) {
6169 val = determine_truth(cond);
6175 check_reachable(fors->body);
6181 next = next->base.next;
6185 case STATEMENT_MS_TRY:
6187 next = next->ms_try.final_statement;
6192 check_reachable(next);
6195 static void check_unreachable(statement_t* const stmt, void *const env)
6199 switch (stmt->kind) {
6200 case STATEMENT_DO_WHILE:
6201 if (!stmt->base.reachable) {
6202 expression_t const *const cond = stmt->do_while.condition;
6203 if (determine_truth(cond) >= 0) {
6204 warningf(&cond->base.source_position,
6205 "condition of do-while-loop is unreachable");
6210 case STATEMENT_FOR: {
6211 for_statement_t const* const fors = &stmt->fors;
6213 // if init and step are unreachable, cond is unreachable, too
6214 if (!stmt->base.reachable && !fors->step_reachable) {
6215 warningf(&stmt->base.source_position, "statement is unreachable");
6217 if (!stmt->base.reachable && fors->initialisation != NULL) {
6218 warningf(&fors->initialisation->base.source_position,
6219 "initialisation of for-statement is unreachable");
6222 if (!fors->condition_reachable && fors->condition != NULL) {
6223 warningf(&fors->condition->base.source_position,
6224 "condition of for-statement is unreachable");
6227 if (!fors->step_reachable && fors->step != NULL) {
6228 warningf(&fors->step->base.source_position,
6229 "step of for-statement is unreachable");
6235 case STATEMENT_COMPOUND:
6236 if (stmt->compound.statements != NULL)
6238 goto warn_unreachable;
6240 case STATEMENT_DECLARATION: {
6241 /* Only warn if there is at least one declarator with an initializer.
6242 * This typically occurs in switch statements. */
6243 declaration_statement_t const *const decl = &stmt->declaration;
6244 entity_t const * ent = decl->declarations_begin;
6245 entity_t const *const last = decl->declarations_end;
6247 for (;; ent = ent->base.next) {
6248 if (ent->kind == ENTITY_VARIABLE &&
6249 ent->variable.initializer != NULL) {
6250 goto warn_unreachable;
6260 if (!stmt->base.reachable)
6261 warningf(&stmt->base.source_position, "statement is unreachable");
6266 static void parse_external_declaration(void)
6268 /* function-definitions and declarations both start with declaration
6270 declaration_specifiers_t specifiers;
6271 memset(&specifiers, 0, sizeof(specifiers));
6273 add_anchor_token(';');
6274 parse_declaration_specifiers(&specifiers);
6275 rem_anchor_token(';');
6277 /* must be a declaration */
6278 if (token.type == ';') {
6279 parse_anonymous_declaration_rest(&specifiers);
6283 add_anchor_token(',');
6284 add_anchor_token('=');
6285 add_anchor_token(';');
6286 add_anchor_token('{');
6288 /* declarator is common to both function-definitions and declarations */
6289 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
6291 rem_anchor_token('{');
6292 rem_anchor_token(';');
6293 rem_anchor_token('=');
6294 rem_anchor_token(',');
6296 /* must be a declaration */
6297 switch (token.type) {
6301 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
6306 /* must be a function definition */
6307 parse_kr_declaration_list(ndeclaration);
6309 if (token.type != '{') {
6310 parse_error_expected("while parsing function definition", '{', NULL);
6311 eat_until_matching_token(';');
6315 assert(is_declaration(ndeclaration));
6316 type_t *type = skip_typeref(ndeclaration->declaration.type);
6318 if (!is_type_function(type)) {
6319 if (is_type_valid(type)) {
6320 errorf(HERE, "declarator '%#T' has a body but is not a function type",
6321 type, ndeclaration->base.symbol);
6327 if (warning.aggregate_return &&
6328 is_type_compound(skip_typeref(type->function.return_type))) {
6329 warningf(HERE, "function '%Y' returns an aggregate",
6330 ndeclaration->base.symbol);
6332 if (warning.traditional && !type->function.unspecified_parameters) {
6333 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
6334 ndeclaration->base.symbol);
6336 if (warning.old_style_definition && type->function.unspecified_parameters) {
6337 warningf(HERE, "old-style function definition '%Y'",
6338 ndeclaration->base.symbol);
6341 /* § 6.7.5.3 (14) a function definition with () means no
6342 * parameters (and not unspecified parameters) */
6343 if (type->function.unspecified_parameters
6344 && type->function.parameters == NULL
6345 && !type->function.kr_style_parameters) {
6346 type_t *duplicate = duplicate_type(type);
6347 duplicate->function.unspecified_parameters = false;
6349 type = typehash_insert(duplicate);
6350 if (type != duplicate) {
6351 obstack_free(type_obst, duplicate);
6353 ndeclaration->declaration.type = type;
6356 entity_t *const entity = record_entity(ndeclaration, true);
6357 assert(entity->kind == ENTITY_FUNCTION);
6358 assert(ndeclaration->kind == ENTITY_FUNCTION);
6360 function_t *function = &entity->function;
6361 if (ndeclaration != entity) {
6362 function->parameters = ndeclaration->function.parameters;
6364 assert(is_declaration(entity));
6365 type = skip_typeref(entity->declaration.type);
6367 /* push function parameters and switch scope */
6368 size_t const top = environment_top();
6369 scope_t *old_scope = scope_push(&function->parameters);
6371 entity_t *parameter = function->parameters.entities;
6372 for (; parameter != NULL; parameter = parameter->base.next) {
6373 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
6374 parameter->base.parent_scope = current_scope;
6376 assert(parameter->base.parent_scope == NULL
6377 || parameter->base.parent_scope == current_scope);
6378 parameter->base.parent_scope = current_scope;
6379 if (parameter->base.symbol == NULL) {
6380 errorf(¶meter->base.source_position, "parameter name omitted");
6383 environment_push(parameter);
6386 if (function->statement != NULL) {
6387 parser_error_multiple_definition(entity, HERE);
6390 /* parse function body */
6391 int label_stack_top = label_top();
6392 function_t *old_current_function = current_function;
6393 current_function = function;
6394 current_parent = NULL;
6397 goto_anchor = &goto_first;
6399 label_anchor = &label_first;
6401 statement_t *const body = parse_compound_statement(false);
6402 function->statement = body;
6405 check_declarations();
6406 if (warning.return_type ||
6407 warning.unreachable_code ||
6408 (warning.missing_noreturn
6409 && !(function->base.modifiers & DM_NORETURN))) {
6410 noreturn_candidate = true;
6411 check_reachable(body);
6412 if (warning.unreachable_code)
6413 walk_statements(body, check_unreachable, NULL);
6414 if (warning.missing_noreturn &&
6415 noreturn_candidate &&
6416 !(function->base.modifiers & DM_NORETURN)) {
6417 warningf(&body->base.source_position,
6418 "function '%#T' is candidate for attribute 'noreturn'",
6419 type, entity->base.symbol);
6423 assert(current_parent == NULL);
6424 assert(current_function == function);
6425 current_function = old_current_function;
6426 label_pop_to(label_stack_top);
6429 assert(current_scope == &function->parameters);
6430 scope_pop(old_scope);
6431 environment_pop_to(top);
6434 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
6435 source_position_t *source_position,
6436 const symbol_t *symbol)
6438 type_t *type = allocate_type_zero(TYPE_BITFIELD);
6440 type->bitfield.base_type = base_type;
6441 type->bitfield.size_expression = size;
6444 type_t *skipped_type = skip_typeref(base_type);
6445 if (!is_type_integer(skipped_type)) {
6446 errorf(HERE, "bitfield base type '%T' is not an integer type",
6450 bit_size = skipped_type->base.size * 8;
6453 if (is_constant_expression(size)) {
6454 long v = fold_constant(size);
6457 errorf(source_position, "negative width in bit-field '%Y'", symbol);
6458 } else if (v == 0) {
6459 errorf(source_position, "zero width for bit-field '%Y'", symbol);
6460 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
6461 errorf(source_position, "width of '%Y' exceeds its type", symbol);
6463 type->bitfield.bit_size = v;
6470 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
6472 entity_t *iter = compound->members.entities;
6473 for (; iter != NULL; iter = iter->base.next) {
6474 if (iter->kind != ENTITY_COMPOUND_MEMBER)
6477 if (iter->base.symbol == symbol) {
6479 } else if (iter->base.symbol == NULL) {
6480 type_t *type = skip_typeref(iter->declaration.type);
6481 if (is_type_compound(type)) {
6483 = find_compound_entry(type->compound.compound, symbol);
6494 static void parse_compound_declarators(compound_t *compound,
6495 const declaration_specifiers_t *specifiers)
6500 if (token.type == ':') {
6501 source_position_t source_position = *HERE;
6504 type_t *base_type = specifiers->type;
6505 expression_t *size = parse_constant_expression();
6507 type_t *type = make_bitfield_type(base_type, size,
6508 &source_position, sym_anonymous);
6510 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
6511 entity->base.namespc = NAMESPACE_NORMAL;
6512 entity->base.source_position = source_position;
6513 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
6514 entity->declaration.storage_class = STORAGE_CLASS_NONE;
6515 entity->declaration.modifiers = specifiers->modifiers;
6516 entity->declaration.type = type;
6518 entity = parse_declarator(specifiers,
6519 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
6520 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6522 if (token.type == ':') {
6523 source_position_t source_position = *HERE;
6525 expression_t *size = parse_constant_expression();
6527 type_t *type = entity->declaration.type;
6528 type_t *bitfield_type = make_bitfield_type(type, size,
6529 &source_position, entity->base.symbol);
6530 entity->declaration.type = bitfield_type;
6534 /* make sure we don't define a symbol multiple times */
6535 symbol_t *symbol = entity->base.symbol;
6536 if (symbol != NULL) {
6537 entity_t *prev = find_compound_entry(compound, symbol);
6540 errorf(&entity->base.source_position,
6541 "multiple declarations of symbol '%Y' (declared %P)",
6542 symbol, &prev->base.source_position);
6546 append_entity(&compound->members, entity);
6548 type_t *orig_type = entity->declaration.type;
6549 type_t *type = skip_typeref(orig_type);
6550 if (is_type_function(type)) {
6551 errorf(&entity->base.source_position,
6552 "compound member '%Y' must not have function type '%T'",
6553 entity->base.symbol, orig_type);
6554 } else if (is_type_incomplete(type)) {
6555 /* §6.7.2.1:16 flexible array member */
6556 if (is_type_array(type) &&
6557 token.type == ';' &&
6558 look_ahead(1)->type == '}') {
6559 compound->has_flexible_member = true;
6561 errorf(&entity->base.source_position,
6562 "compound member '%Y' has incomplete type '%T'",
6563 entity->base.symbol, orig_type);
6567 if (token.type != ',')
6571 expect(';', end_error);
6574 anonymous_entity = NULL;
6577 static void parse_compound_type_entries(compound_t *compound)
6580 add_anchor_token('}');
6582 while (token.type != '}') {
6583 if (token.type == T_EOF) {
6584 errorf(HERE, "EOF while parsing struct");
6587 declaration_specifiers_t specifiers;
6588 memset(&specifiers, 0, sizeof(specifiers));
6589 parse_declaration_specifiers(&specifiers);
6591 parse_compound_declarators(compound, &specifiers);
6593 rem_anchor_token('}');
6597 compound->complete = true;
6600 static type_t *parse_typename(void)
6602 declaration_specifiers_t specifiers;
6603 memset(&specifiers, 0, sizeof(specifiers));
6604 parse_declaration_specifiers(&specifiers);
6605 if (specifiers.storage_class != STORAGE_CLASS_NONE ||
6606 specifiers.thread_local) {
6607 /* TODO: improve error message, user does probably not know what a
6608 * storage class is...
6610 errorf(HERE, "typename may not have a storage class");
6613 type_t *result = parse_abstract_declarator(specifiers.type);
6621 typedef expression_t* (*parse_expression_function)(void);
6622 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6624 typedef struct expression_parser_function_t expression_parser_function_t;
6625 struct expression_parser_function_t {
6626 parse_expression_function parser;
6627 unsigned infix_precedence;
6628 parse_expression_infix_function infix_parser;
6631 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6634 * Prints an error message if an expression was expected but not read
6636 static expression_t *expected_expression_error(void)
6638 /* skip the error message if the error token was read */
6639 if (token.type != T_ERROR) {
6640 errorf(HERE, "expected expression, got token %K", &token);
6644 return create_invalid_expression();
6648 * Parse a string constant.
6650 static expression_t *parse_string_const(void)
6653 if (token.type == T_STRING_LITERAL) {
6654 string_t res = token.v.string;
6656 while (token.type == T_STRING_LITERAL) {
6657 res = concat_strings(&res, &token.v.string);
6660 if (token.type != T_WIDE_STRING_LITERAL) {
6661 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6662 /* note: that we use type_char_ptr here, which is already the
6663 * automatic converted type. revert_automatic_type_conversion
6664 * will construct the array type */
6665 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6666 cnst->string.value = res;
6670 wres = concat_string_wide_string(&res, &token.v.wide_string);
6672 wres = token.v.wide_string;
6677 switch (token.type) {
6678 case T_WIDE_STRING_LITERAL:
6679 wres = concat_wide_strings(&wres, &token.v.wide_string);
6682 case T_STRING_LITERAL:
6683 wres = concat_wide_string_string(&wres, &token.v.string);
6687 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6688 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6689 cnst->wide_string.value = wres;
6698 * Parse a boolean constant.
6700 static expression_t *parse_bool_const(bool value)
6702 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6703 cnst->base.type = type_bool;
6704 cnst->conste.v.int_value = value;
6712 * Parse an integer constant.
6714 static expression_t *parse_int_const(void)
6716 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6717 cnst->base.type = token.datatype;
6718 cnst->conste.v.int_value = token.v.intvalue;
6726 * Parse a character constant.
6728 static expression_t *parse_character_constant(void)
6730 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6731 cnst->base.type = token.datatype;
6732 cnst->conste.v.character = token.v.string;
6734 if (cnst->conste.v.character.size != 1) {
6736 errorf(HERE, "more than 1 character in character constant");
6737 } else if (warning.multichar) {
6738 warningf(HERE, "multi-character character constant");
6747 * Parse a wide character constant.
6749 static expression_t *parse_wide_character_constant(void)
6751 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6752 cnst->base.type = token.datatype;
6753 cnst->conste.v.wide_character = token.v.wide_string;
6755 if (cnst->conste.v.wide_character.size != 1) {
6757 errorf(HERE, "more than 1 character in character constant");
6758 } else if (warning.multichar) {
6759 warningf(HERE, "multi-character character constant");
6768 * Parse a float constant.
6770 static expression_t *parse_float_const(void)
6772 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6773 cnst->base.type = token.datatype;
6774 cnst->conste.v.float_value = token.v.floatvalue;
6781 static entity_t *create_implicit_function(symbol_t *symbol,
6782 const source_position_t *source_position)
6784 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6785 ntype->function.return_type = type_int;
6786 ntype->function.unspecified_parameters = true;
6787 ntype->function.linkage = LINKAGE_C;
6789 type_t *type = typehash_insert(ntype);
6790 if (type != ntype) {
6794 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6795 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6796 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6797 entity->declaration.type = type;
6798 entity->declaration.implicit = true;
6799 entity->base.symbol = symbol;
6800 entity->base.source_position = *source_position;
6802 bool strict_prototypes_old = warning.strict_prototypes;
6803 warning.strict_prototypes = false;
6804 record_entity(entity, false);
6805 warning.strict_prototypes = strict_prototypes_old;
6811 * Creates a return_type (func)(argument_type) function type if not
6814 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6815 type_t *argument_type2)
6817 function_parameter_t *parameter2
6818 = obstack_alloc(type_obst, sizeof(parameter2[0]));
6819 memset(parameter2, 0, sizeof(parameter2[0]));
6820 parameter2->type = argument_type2;
6822 function_parameter_t *parameter1
6823 = obstack_alloc(type_obst, sizeof(parameter1[0]));
6824 memset(parameter1, 0, sizeof(parameter1[0]));
6825 parameter1->type = argument_type1;
6826 parameter1->next = parameter2;
6828 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6829 type->function.return_type = return_type;
6830 type->function.parameters = parameter1;
6832 type_t *result = typehash_insert(type);
6833 if (result != type) {
6841 * Creates a return_type (func)(argument_type) function type if not
6844 * @param return_type the return type
6845 * @param argument_type the argument type
6847 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6849 function_parameter_t *parameter
6850 = obstack_alloc(type_obst, sizeof(parameter[0]));
6851 memset(parameter, 0, sizeof(parameter[0]));
6852 parameter->type = argument_type;
6854 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6855 type->function.return_type = return_type;
6856 type->function.parameters = parameter;
6858 type_t *result = typehash_insert(type);
6859 if (result != type) {
6866 static type_t *make_function_0_type(type_t *return_type)
6868 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6869 type->function.return_type = return_type;
6870 type->function.parameters = NULL;
6872 type_t *result = typehash_insert(type);
6873 if (result != type) {
6881 * Creates a function type for some function like builtins.
6883 * @param symbol the symbol describing the builtin
6885 static type_t *get_builtin_symbol_type(symbol_t *symbol)
6887 switch (symbol->ID) {
6888 case T___builtin_alloca:
6889 return make_function_1_type(type_void_ptr, type_size_t);
6890 case T___builtin_huge_val:
6891 return make_function_0_type(type_double);
6892 case T___builtin_inf:
6893 return make_function_0_type(type_double);
6894 case T___builtin_inff:
6895 return make_function_0_type(type_float);
6896 case T___builtin_infl:
6897 return make_function_0_type(type_long_double);
6898 case T___builtin_nan:
6899 return make_function_1_type(type_double, type_char_ptr);
6900 case T___builtin_nanf:
6901 return make_function_1_type(type_float, type_char_ptr);
6902 case T___builtin_nanl:
6903 return make_function_1_type(type_long_double, type_char_ptr);
6904 case T___builtin_va_end:
6905 return make_function_1_type(type_void, type_valist);
6906 case T___builtin_expect:
6907 return make_function_2_type(type_long, type_long, type_long);
6909 internal_errorf(HERE, "not implemented builtin identifier found");
6914 * Performs automatic type cast as described in § 6.3.2.1.
6916 * @param orig_type the original type
6918 static type_t *automatic_type_conversion(type_t *orig_type)
6920 type_t *type = skip_typeref(orig_type);
6921 if (is_type_array(type)) {
6922 array_type_t *array_type = &type->array;
6923 type_t *element_type = array_type->element_type;
6924 unsigned qualifiers = array_type->base.qualifiers;
6926 return make_pointer_type(element_type, qualifiers);
6929 if (is_type_function(type)) {
6930 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6937 * reverts the automatic casts of array to pointer types and function
6938 * to function-pointer types as defined § 6.3.2.1
6940 type_t *revert_automatic_type_conversion(const expression_t *expression)
6942 switch (expression->kind) {
6943 case EXPR_REFERENCE: {
6944 entity_t *entity = expression->reference.entity;
6945 if (is_declaration(entity)) {
6946 return entity->declaration.type;
6947 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6948 return entity->enum_value.enum_type;
6950 panic("no declaration or enum in reference");
6955 entity_t *entity = expression->select.compound_entry;
6956 assert(is_declaration(entity));
6957 type_t *type = entity->declaration.type;
6958 return get_qualified_type(type,
6959 expression->base.type->base.qualifiers);
6962 case EXPR_UNARY_DEREFERENCE: {
6963 const expression_t *const value = expression->unary.value;
6964 type_t *const type = skip_typeref(value->base.type);
6965 assert(is_type_pointer(type));
6966 return type->pointer.points_to;
6969 case EXPR_BUILTIN_SYMBOL:
6970 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
6972 case EXPR_ARRAY_ACCESS: {
6973 const expression_t *array_ref = expression->array_access.array_ref;
6974 type_t *type_left = skip_typeref(array_ref->base.type);
6975 if (!is_type_valid(type_left))
6977 assert(is_type_pointer(type_left));
6978 return type_left->pointer.points_to;
6981 case EXPR_STRING_LITERAL: {
6982 size_t size = expression->string.value.size;
6983 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6986 case EXPR_WIDE_STRING_LITERAL: {
6987 size_t size = expression->wide_string.value.size;
6988 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6991 case EXPR_COMPOUND_LITERAL:
6992 return expression->compound_literal.type;
6997 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();
7473 static expression_t *parse_builtin_symbol(void)
7475 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
7477 symbol_t *symbol = token.v.symbol;
7479 expression->builtin_symbol.symbol = symbol;
7482 type_t *type = get_builtin_symbol_type(symbol);
7483 type = automatic_type_conversion(type);
7485 expression->base.type = type;
7490 * Parses a __builtin_constant() expression.
7492 static expression_t *parse_builtin_constant(void)
7494 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
7496 eat(T___builtin_constant_p);
7498 expect('(', end_error);
7499 add_anchor_token(')');
7500 expression->builtin_constant.value = parse_assignment_expression();
7501 rem_anchor_token(')');
7502 expect(')', end_error);
7503 expression->base.type = type_int;
7507 return create_invalid_expression();
7511 * Parses a __builtin_prefetch() expression.
7513 static expression_t *parse_builtin_prefetch(void)
7515 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
7517 eat(T___builtin_prefetch);
7519 expect('(', end_error);
7520 add_anchor_token(')');
7521 expression->builtin_prefetch.adr = parse_assignment_expression();
7522 if (token.type == ',') {
7524 expression->builtin_prefetch.rw = parse_assignment_expression();
7526 if (token.type == ',') {
7528 expression->builtin_prefetch.locality = parse_assignment_expression();
7530 rem_anchor_token(')');
7531 expect(')', end_error);
7532 expression->base.type = type_void;
7536 return create_invalid_expression();
7540 * Parses a __builtin_is_*() compare expression.
7542 static expression_t *parse_compare_builtin(void)
7544 expression_t *expression;
7546 switch (token.type) {
7547 case T___builtin_isgreater:
7548 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
7550 case T___builtin_isgreaterequal:
7551 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
7553 case T___builtin_isless:
7554 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
7556 case T___builtin_islessequal:
7557 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
7559 case T___builtin_islessgreater:
7560 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
7562 case T___builtin_isunordered:
7563 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
7566 internal_errorf(HERE, "invalid compare builtin found");
7568 expression->base.source_position = *HERE;
7571 expect('(', end_error);
7572 expression->binary.left = parse_assignment_expression();
7573 expect(',', end_error);
7574 expression->binary.right = parse_assignment_expression();
7575 expect(')', end_error);
7577 type_t *const orig_type_left = expression->binary.left->base.type;
7578 type_t *const orig_type_right = expression->binary.right->base.type;
7580 type_t *const type_left = skip_typeref(orig_type_left);
7581 type_t *const type_right = skip_typeref(orig_type_right);
7582 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7583 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7584 type_error_incompatible("invalid operands in comparison",
7585 &expression->base.source_position, orig_type_left, orig_type_right);
7588 semantic_comparison(&expression->binary);
7593 return create_invalid_expression();
7598 * Parses a __builtin_expect(, end_error) expression.
7600 static expression_t *parse_builtin_expect(void, end_error)
7602 expression_t *expression
7603 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7605 eat(T___builtin_expect);
7607 expect('(', end_error);
7608 expression->binary.left = parse_assignment_expression();
7609 expect(',', end_error);
7610 expression->binary.right = parse_constant_expression();
7611 expect(')', end_error);
7613 expression->base.type = expression->binary.left->base.type;
7617 return create_invalid_expression();
7622 * Parses a MS assume() expression.
7624 static expression_t *parse_assume(void)
7626 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7630 expect('(', end_error);
7631 add_anchor_token(')');
7632 expression->unary.value = parse_assignment_expression();
7633 rem_anchor_token(')');
7634 expect(')', end_error);
7636 expression->base.type = type_void;
7639 return create_invalid_expression();
7643 * Return the declaration for a given label symbol or create a new one.
7645 * @param symbol the symbol of the label
7647 static label_t *get_label(symbol_t *symbol)
7650 assert(current_function != NULL);
7652 label = get_entity(symbol, NAMESPACE_LABEL);
7653 /* if we found a local label, we already created the declaration */
7654 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7655 if (label->base.parent_scope != current_scope) {
7656 assert(label->base.parent_scope->depth < current_scope->depth);
7657 current_function->goto_to_outer = true;
7659 return &label->label;
7662 label = get_entity(symbol, NAMESPACE_LABEL);
7663 /* if we found a label in the same function, then we already created the
7666 && label->base.parent_scope == ¤t_function->parameters) {
7667 return &label->label;
7670 /* otherwise we need to create a new one */
7671 label = allocate_entity_zero(ENTITY_LABEL);
7672 label->base.namespc = NAMESPACE_LABEL;
7673 label->base.symbol = symbol;
7677 return &label->label;
7681 * Parses a GNU && label address expression.
7683 static expression_t *parse_label_address(void)
7685 source_position_t source_position = token.source_position;
7687 if (token.type != T_IDENTIFIER) {
7688 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7691 symbol_t *symbol = token.v.symbol;
7694 label_t *label = get_label(symbol);
7696 label->address_taken = true;
7698 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7699 expression->base.source_position = source_position;
7701 /* label address is threaten as a void pointer */
7702 expression->base.type = type_void_ptr;
7703 expression->label_address.label = label;
7706 return create_invalid_expression();
7710 * Parse a microsoft __noop expression.
7712 static expression_t *parse_noop_expression(void)
7714 /* the result is a (int)0 */
7715 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7716 cnst->base.type = type_int;
7717 cnst->conste.v.int_value = 0;
7718 cnst->conste.is_ms_noop = true;
7722 if (token.type == '(') {
7723 /* parse arguments */
7725 add_anchor_token(')');
7726 add_anchor_token(',');
7728 if (token.type != ')') {
7730 (void)parse_assignment_expression();
7731 if (token.type != ',')
7737 rem_anchor_token(',');
7738 rem_anchor_token(')');
7739 expect(')', end_error);
7746 * Parses a primary expression.
7748 static expression_t *parse_primary_expression(void)
7750 switch (token.type) {
7751 case T_false: return parse_bool_const(false);
7752 case T_true: return parse_bool_const(true);
7753 case T_INTEGER: return parse_int_const();
7754 case T_CHARACTER_CONSTANT: return parse_character_constant();
7755 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7756 case T_FLOATINGPOINT: return parse_float_const();
7757 case T_STRING_LITERAL:
7758 case T_WIDE_STRING_LITERAL: return parse_string_const();
7759 case T_IDENTIFIER: return parse_reference();
7760 case T___FUNCTION__:
7761 case T___func__: return parse_function_keyword();
7762 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7763 case T___FUNCSIG__: return parse_funcsig_keyword();
7764 case T___FUNCDNAME__: return parse_funcdname_keyword();
7765 case T___builtin_offsetof: return parse_offsetof();
7766 case T___builtin_va_start: return parse_va_start();
7767 case T___builtin_va_arg: return parse_va_arg();
7768 case T___builtin_expect:
7769 case T___builtin_alloca:
7770 case T___builtin_inf:
7771 case T___builtin_inff:
7772 case T___builtin_infl:
7773 case T___builtin_nan:
7774 case T___builtin_nanf:
7775 case T___builtin_nanl:
7776 case T___builtin_huge_val:
7777 case T___builtin_va_end: return parse_builtin_symbol();
7778 case T___builtin_isgreater:
7779 case T___builtin_isgreaterequal:
7780 case T___builtin_isless:
7781 case T___builtin_islessequal:
7782 case T___builtin_islessgreater:
7783 case T___builtin_isunordered: return parse_compare_builtin();
7784 case T___builtin_constant_p: return parse_builtin_constant();
7785 case T___builtin_prefetch: return parse_builtin_prefetch();
7786 case T__assume: return parse_assume();
7789 return parse_label_address();
7792 case '(': return parse_parenthesized_expression();
7793 case T___noop: return parse_noop_expression();
7796 errorf(HERE, "unexpected token %K, expected an expression", &token);
7797 return create_invalid_expression();
7801 * Check if the expression has the character type and issue a warning then.
7803 static void check_for_char_index_type(const expression_t *expression)
7805 type_t *const type = expression->base.type;
7806 const type_t *const base_type = skip_typeref(type);
7808 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7809 warning.char_subscripts) {
7810 warningf(&expression->base.source_position,
7811 "array subscript has type '%T'", type);
7815 static expression_t *parse_array_expression(expression_t *left)
7817 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7820 add_anchor_token(']');
7822 expression_t *inside = parse_expression();
7824 type_t *const orig_type_left = left->base.type;
7825 type_t *const orig_type_inside = inside->base.type;
7827 type_t *const type_left = skip_typeref(orig_type_left);
7828 type_t *const type_inside = skip_typeref(orig_type_inside);
7830 type_t *return_type;
7831 array_access_expression_t *array_access = &expression->array_access;
7832 if (is_type_pointer(type_left)) {
7833 return_type = type_left->pointer.points_to;
7834 array_access->array_ref = left;
7835 array_access->index = inside;
7836 check_for_char_index_type(inside);
7837 } else if (is_type_pointer(type_inside)) {
7838 return_type = type_inside->pointer.points_to;
7839 array_access->array_ref = inside;
7840 array_access->index = left;
7841 array_access->flipped = true;
7842 check_for_char_index_type(left);
7844 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7846 "array access on object with non-pointer types '%T', '%T'",
7847 orig_type_left, orig_type_inside);
7849 return_type = type_error_type;
7850 array_access->array_ref = left;
7851 array_access->index = inside;
7854 expression->base.type = automatic_type_conversion(return_type);
7856 rem_anchor_token(']');
7857 expect(']', end_error);
7862 static expression_t *parse_typeprop(expression_kind_t const kind)
7864 expression_t *tp_expression = allocate_expression_zero(kind);
7865 tp_expression->base.type = type_size_t;
7867 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7869 /* we only refer to a type property, mark this case */
7870 bool old = in_type_prop;
7871 in_type_prop = true;
7874 expression_t *expression;
7875 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7877 add_anchor_token(')');
7878 orig_type = parse_typename();
7879 rem_anchor_token(')');
7880 expect(')', end_error);
7882 if (token.type == '{') {
7883 /* It was not sizeof(type) after all. It is sizeof of an expression
7884 * starting with a compound literal */
7885 expression = parse_compound_literal(orig_type);
7886 goto typeprop_expression;
7889 expression = parse_sub_expression(PREC_UNARY);
7891 typeprop_expression:
7892 tp_expression->typeprop.tp_expression = expression;
7894 orig_type = revert_automatic_type_conversion(expression);
7895 expression->base.type = orig_type;
7898 tp_expression->typeprop.type = orig_type;
7899 type_t const* const type = skip_typeref(orig_type);
7900 char const* const wrong_type =
7901 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7902 is_type_incomplete(type) ? "incomplete" :
7903 type->kind == TYPE_FUNCTION ? "function designator" :
7904 type->kind == TYPE_BITFIELD ? "bitfield" :
7906 if (wrong_type != NULL) {
7907 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7908 errorf(&tp_expression->base.source_position,
7909 "operand of %s expression must not be of %s type '%T'",
7910 what, wrong_type, orig_type);
7915 return tp_expression;
7918 static expression_t *parse_sizeof(void)
7920 return parse_typeprop(EXPR_SIZEOF);
7923 static expression_t *parse_alignof(void)
7925 return parse_typeprop(EXPR_ALIGNOF);
7928 static expression_t *parse_select_expression(expression_t *compound)
7930 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7931 select->select.compound = compound;
7933 assert(token.type == '.' || token.type == T_MINUSGREATER);
7934 bool is_pointer = (token.type == T_MINUSGREATER);
7937 if (token.type != T_IDENTIFIER) {
7938 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7941 symbol_t *symbol = token.v.symbol;
7944 type_t *const orig_type = compound->base.type;
7945 type_t *const type = skip_typeref(orig_type);
7948 bool saw_error = false;
7949 if (is_type_pointer(type)) {
7952 "request for member '%Y' in something not a struct or union, but '%T'",
7956 type_left = skip_typeref(type->pointer.points_to);
7958 if (is_pointer && is_type_valid(type)) {
7959 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7966 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7967 type_left->kind == TYPE_COMPOUND_UNION) {
7968 compound_t *compound = type_left->compound.compound;
7970 if (!compound->complete) {
7971 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7973 goto create_error_entry;
7976 entry = find_compound_entry(compound, symbol);
7977 if (entry == NULL) {
7978 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7979 goto create_error_entry;
7982 if (is_type_valid(type_left) && !saw_error) {
7984 "request for member '%Y' in something not a struct or union, but '%T'",
7988 entry = create_error_entity(symbol, ENTITY_COMPOUND_MEMBER);
7991 assert(is_declaration(entry));
7992 select->select.compound_entry = entry;
7994 type_t *entry_type = entry->declaration.type;
7996 = get_qualified_type(entry_type, type_left->base.qualifiers);
7998 /* we always do the auto-type conversions; the & and sizeof parser contains
7999 * code to revert this! */
8000 select->base.type = automatic_type_conversion(res_type);
8002 type_t *skipped = skip_typeref(res_type);
8003 if (skipped->kind == TYPE_BITFIELD) {
8004 select->base.type = skipped->bitfield.base_type;
8010 static void check_call_argument(const function_parameter_t *parameter,
8011 call_argument_t *argument, unsigned pos)
8013 type_t *expected_type = parameter->type;
8014 type_t *expected_type_skip = skip_typeref(expected_type);
8015 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
8016 expression_t *arg_expr = argument->expression;
8017 type_t *arg_type = skip_typeref(arg_expr->base.type);
8019 /* handle transparent union gnu extension */
8020 if (is_type_union(expected_type_skip)
8021 && (expected_type_skip->base.modifiers
8022 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
8023 compound_t *union_decl = expected_type_skip->compound.compound;
8024 type_t *best_type = NULL;
8025 entity_t *entry = union_decl->members.entities;
8026 for ( ; entry != NULL; entry = entry->base.next) {
8027 assert(is_declaration(entry));
8028 type_t *decl_type = entry->declaration.type;
8029 error = semantic_assign(decl_type, arg_expr);
8030 if (error == ASSIGN_ERROR_INCOMPATIBLE
8031 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
8034 if (error == ASSIGN_SUCCESS) {
8035 best_type = decl_type;
8036 } else if (best_type == NULL) {
8037 best_type = decl_type;
8041 if (best_type != NULL) {
8042 expected_type = best_type;
8046 error = semantic_assign(expected_type, arg_expr);
8047 argument->expression = create_implicit_cast(argument->expression,
8050 if (error != ASSIGN_SUCCESS) {
8051 /* report exact scope in error messages (like "in argument 3") */
8053 snprintf(buf, sizeof(buf), "call argument %u", pos);
8054 report_assign_error(error, expected_type, arg_expr, buf,
8055 &arg_expr->base.source_position);
8056 } else if (warning.traditional || warning.conversion) {
8057 type_t *const promoted_type = get_default_promoted_type(arg_type);
8058 if (!types_compatible(expected_type_skip, promoted_type) &&
8059 !types_compatible(expected_type_skip, type_void_ptr) &&
8060 !types_compatible(type_void_ptr, promoted_type)) {
8061 /* Deliberately show the skipped types in this warning */
8062 warningf(&arg_expr->base.source_position,
8063 "passing call argument %u as '%T' rather than '%T' due to prototype",
8064 pos, expected_type_skip, promoted_type);
8070 * Parse a call expression, ie. expression '( ... )'.
8072 * @param expression the function address
8074 static expression_t *parse_call_expression(expression_t *expression)
8076 expression_t *result = allocate_expression_zero(EXPR_CALL);
8077 call_expression_t *call = &result->call;
8078 call->function = expression;
8080 type_t *const orig_type = expression->base.type;
8081 type_t *const type = skip_typeref(orig_type);
8083 function_type_t *function_type = NULL;
8084 if (is_type_pointer(type)) {
8085 type_t *const to_type = skip_typeref(type->pointer.points_to);
8087 if (is_type_function(to_type)) {
8088 function_type = &to_type->function;
8089 call->base.type = function_type->return_type;
8093 if (function_type == NULL && is_type_valid(type)) {
8094 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
8097 /* parse arguments */
8099 add_anchor_token(')');
8100 add_anchor_token(',');
8102 if (token.type != ')') {
8103 call_argument_t *last_argument = NULL;
8106 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8108 argument->expression = parse_assignment_expression();
8109 if (last_argument == NULL) {
8110 call->arguments = argument;
8112 last_argument->next = argument;
8114 last_argument = argument;
8116 if (token.type != ',')
8121 rem_anchor_token(',');
8122 rem_anchor_token(')');
8123 expect(')', end_error);
8125 if (function_type == NULL)
8128 function_parameter_t *parameter = function_type->parameters;
8129 call_argument_t *argument = call->arguments;
8130 if (!function_type->unspecified_parameters) {
8131 for (unsigned pos = 0; parameter != NULL && argument != NULL;
8132 parameter = parameter->next, argument = argument->next) {
8133 check_call_argument(parameter, argument, ++pos);
8136 if (parameter != NULL) {
8137 errorf(HERE, "too few arguments to function '%E'", expression);
8138 } else if (argument != NULL && !function_type->variadic) {
8139 errorf(HERE, "too many arguments to function '%E'", expression);
8143 /* do default promotion */
8144 for (; argument != NULL; argument = argument->next) {
8145 type_t *type = argument->expression->base.type;
8147 type = get_default_promoted_type(type);
8149 argument->expression
8150 = create_implicit_cast(argument->expression, type);
8153 check_format(&result->call);
8155 if (warning.aggregate_return &&
8156 is_type_compound(skip_typeref(function_type->return_type))) {
8157 warningf(&result->base.source_position,
8158 "function call has aggregate value");
8165 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
8167 static bool same_compound_type(const type_t *type1, const type_t *type2)
8170 is_type_compound(type1) &&
8171 type1->kind == type2->kind &&
8172 type1->compound.compound == type2->compound.compound;
8175 static expression_t const *get_reference_address(expression_t const *expr)
8177 bool regular_take_address = true;
8179 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8180 expr = expr->unary.value;
8182 regular_take_address = false;
8185 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8188 expr = expr->unary.value;
8191 if (expr->kind != EXPR_REFERENCE)
8194 /* special case for functions which are automatically converted to a
8195 * pointer to function without an extra TAKE_ADDRESS operation */
8196 if (!regular_take_address &&
8197 expr->reference.entity->kind != ENTITY_FUNCTION) {
8204 static void warn_reference_address_as_bool(expression_t const* expr)
8206 if (!warning.address)
8209 expr = get_reference_address(expr);
8211 warningf(&expr->base.source_position,
8212 "the address of '%Y' will always evaluate as 'true'",
8213 expr->reference.entity->base.symbol);
8217 static void warn_assignment_in_condition(const expression_t *const expr)
8219 if (!warning.parentheses)
8221 if (expr->base.kind != EXPR_BINARY_ASSIGN)
8223 if (expr->base.parenthesized)
8225 warningf(&expr->base.source_position,
8226 "suggest parentheses around assignment used as truth value");
8229 static void semantic_condition(expression_t const *const expr,
8230 char const *const context)
8232 type_t *const type = skip_typeref(expr->base.type);
8233 if (is_type_scalar(type)) {
8234 warn_reference_address_as_bool(expr);
8235 warn_assignment_in_condition(expr);
8236 } else if (is_type_valid(type)) {
8237 errorf(&expr->base.source_position,
8238 "%s must have scalar type", context);
8243 * Parse a conditional expression, ie. 'expression ? ... : ...'.
8245 * @param expression the conditional expression
8247 static expression_t *parse_conditional_expression(expression_t *expression)
8249 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
8251 conditional_expression_t *conditional = &result->conditional;
8252 conditional->condition = expression;
8255 add_anchor_token(':');
8257 /* §6.5.15:2 The first operand shall have scalar type. */
8258 semantic_condition(expression, "condition of conditional operator");
8260 expression_t *true_expression = expression;
8261 bool gnu_cond = false;
8262 if (GNU_MODE && token.type == ':') {
8265 true_expression = parse_expression();
8267 rem_anchor_token(':');
8268 expect(':', end_error);
8270 expression_t *false_expression =
8271 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
8273 type_t *const orig_true_type = true_expression->base.type;
8274 type_t *const orig_false_type = false_expression->base.type;
8275 type_t *const true_type = skip_typeref(orig_true_type);
8276 type_t *const false_type = skip_typeref(orig_false_type);
8279 type_t *result_type;
8280 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
8281 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
8282 /* ISO/IEC 14882:1998(E) §5.16:2 */
8283 if (true_expression->kind == EXPR_UNARY_THROW) {
8284 result_type = false_type;
8285 } else if (false_expression->kind == EXPR_UNARY_THROW) {
8286 result_type = true_type;
8288 if (warning.other && (
8289 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
8290 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
8292 warningf(&conditional->base.source_position,
8293 "ISO C forbids conditional expression with only one void side");
8295 result_type = type_void;
8297 } else if (is_type_arithmetic(true_type)
8298 && is_type_arithmetic(false_type)) {
8299 result_type = semantic_arithmetic(true_type, false_type);
8301 true_expression = create_implicit_cast(true_expression, result_type);
8302 false_expression = create_implicit_cast(false_expression, result_type);
8304 conditional->true_expression = true_expression;
8305 conditional->false_expression = false_expression;
8306 conditional->base.type = result_type;
8307 } else if (same_compound_type(true_type, false_type)) {
8308 /* just take 1 of the 2 types */
8309 result_type = true_type;
8310 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
8311 type_t *pointer_type;
8313 expression_t *other_expression;
8314 if (is_type_pointer(true_type) &&
8315 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
8316 pointer_type = true_type;
8317 other_type = false_type;
8318 other_expression = false_expression;
8320 pointer_type = false_type;
8321 other_type = true_type;
8322 other_expression = true_expression;
8325 if (is_null_pointer_constant(other_expression)) {
8326 result_type = pointer_type;
8327 } else if (is_type_pointer(other_type)) {
8328 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
8329 type_t *to2 = skip_typeref(other_type->pointer.points_to);
8332 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
8333 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
8335 } else if (types_compatible(get_unqualified_type(to1),
8336 get_unqualified_type(to2))) {
8339 if (warning.other) {
8340 warningf(&conditional->base.source_position,
8341 "pointer types '%T' and '%T' in conditional expression are incompatible",
8342 true_type, false_type);
8347 type_t *const type =
8348 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
8349 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
8350 } else if (is_type_integer(other_type)) {
8351 if (warning.other) {
8352 warningf(&conditional->base.source_position,
8353 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
8355 result_type = pointer_type;
8357 if (is_type_valid(other_type)) {
8358 type_error_incompatible("while parsing conditional",
8359 &expression->base.source_position, true_type, false_type);
8361 result_type = type_error_type;
8364 if (is_type_valid(true_type) && is_type_valid(false_type)) {
8365 type_error_incompatible("while parsing conditional",
8366 &conditional->base.source_position, true_type,
8369 result_type = type_error_type;
8372 conditional->true_expression
8373 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
8374 conditional->false_expression
8375 = create_implicit_cast(false_expression, result_type);
8376 conditional->base.type = result_type;
8381 * Parse an extension expression.
8383 static expression_t *parse_extension(void)
8385 eat(T___extension__);
8387 bool old_gcc_extension = in_gcc_extension;
8388 in_gcc_extension = true;
8389 expression_t *expression = parse_sub_expression(PREC_UNARY);
8390 in_gcc_extension = old_gcc_extension;
8395 * Parse a __builtin_classify_type() expression.
8397 static expression_t *parse_builtin_classify_type(void)
8399 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
8400 result->base.type = type_int;
8402 eat(T___builtin_classify_type);
8404 expect('(', end_error);
8405 add_anchor_token(')');
8406 expression_t *expression = parse_expression();
8407 rem_anchor_token(')');
8408 expect(')', end_error);
8409 result->classify_type.type_expression = expression;
8413 return create_invalid_expression();
8417 * Parse a delete expression
8418 * ISO/IEC 14882:1998(E) §5.3.5
8420 static expression_t *parse_delete(void)
8422 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
8423 result->base.type = type_void;
8427 if (token.type == '[') {
8429 result->kind = EXPR_UNARY_DELETE_ARRAY;
8430 expect(']', end_error);
8434 expression_t *const value = parse_sub_expression(PREC_CAST);
8435 result->unary.value = value;
8437 type_t *const type = skip_typeref(value->base.type);
8438 if (!is_type_pointer(type)) {
8439 if (is_type_valid(type)) {
8440 errorf(&value->base.source_position,
8441 "operand of delete must have pointer type");
8443 } else if (warning.other &&
8444 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
8445 warningf(&value->base.source_position,
8446 "deleting 'void*' is undefined");
8453 * Parse a throw expression
8454 * ISO/IEC 14882:1998(E) §15:1
8456 static expression_t *parse_throw(void)
8458 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
8459 result->base.type = type_void;
8463 expression_t *value = NULL;
8464 switch (token.type) {
8466 value = parse_assignment_expression();
8467 /* ISO/IEC 14882:1998(E) §15.1:3 */
8468 type_t *const orig_type = value->base.type;
8469 type_t *const type = skip_typeref(orig_type);
8470 if (is_type_incomplete(type)) {
8471 errorf(&value->base.source_position,
8472 "cannot throw object of incomplete type '%T'", orig_type);
8473 } else if (is_type_pointer(type)) {
8474 type_t *const points_to = skip_typeref(type->pointer.points_to);
8475 if (is_type_incomplete(points_to) &&
8476 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8477 errorf(&value->base.source_position,
8478 "cannot throw pointer to incomplete type '%T'", orig_type);
8486 result->unary.value = value;
8491 static bool check_pointer_arithmetic(const source_position_t *source_position,
8492 type_t *pointer_type,
8493 type_t *orig_pointer_type)
8495 type_t *points_to = pointer_type->pointer.points_to;
8496 points_to = skip_typeref(points_to);
8498 if (is_type_incomplete(points_to)) {
8499 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8500 errorf(source_position,
8501 "arithmetic with pointer to incomplete type '%T' not allowed",
8504 } else if (warning.pointer_arith) {
8505 warningf(source_position,
8506 "pointer of type '%T' used in arithmetic",
8509 } else if (is_type_function(points_to)) {
8511 errorf(source_position,
8512 "arithmetic with pointer to function type '%T' not allowed",
8515 } else if (warning.pointer_arith) {
8516 warningf(source_position,
8517 "pointer to a function '%T' used in arithmetic",
8524 static bool is_lvalue(const expression_t *expression)
8526 /* TODO: doesn't seem to be consistent with §6.3.2.1 (1) */
8527 switch (expression->kind) {
8528 case EXPR_ARRAY_ACCESS:
8529 case EXPR_COMPOUND_LITERAL:
8530 case EXPR_REFERENCE:
8532 case EXPR_UNARY_DEREFERENCE:
8536 type_t *type = skip_typeref(expression->base.type);
8538 /* ISO/IEC 14882:1998(E) §3.10:3 */
8539 is_type_reference(type) ||
8540 /* Claim it is an lvalue, if the type is invalid. There was a parse
8541 * error before, which maybe prevented properly recognizing it as
8543 !is_type_valid(type);
8548 static void semantic_incdec(unary_expression_t *expression)
8550 type_t *const orig_type = expression->value->base.type;
8551 type_t *const type = skip_typeref(orig_type);
8552 if (is_type_pointer(type)) {
8553 if (!check_pointer_arithmetic(&expression->base.source_position,
8557 } else if (!is_type_real(type) && is_type_valid(type)) {
8558 /* TODO: improve error message */
8559 errorf(&expression->base.source_position,
8560 "operation needs an arithmetic or pointer type");
8563 if (!is_lvalue(expression->value)) {
8564 /* TODO: improve error message */
8565 errorf(&expression->base.source_position, "lvalue required as operand");
8567 expression->base.type = orig_type;
8570 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8572 type_t *const orig_type = expression->value->base.type;
8573 type_t *const type = skip_typeref(orig_type);
8574 if (!is_type_arithmetic(type)) {
8575 if (is_type_valid(type)) {
8576 /* TODO: improve error message */
8577 errorf(&expression->base.source_position,
8578 "operation needs an arithmetic type");
8583 expression->base.type = orig_type;
8586 static void semantic_unexpr_plus(unary_expression_t *expression)
8588 semantic_unexpr_arithmetic(expression);
8589 if (warning.traditional)
8590 warningf(&expression->base.source_position,
8591 "traditional C rejects the unary plus operator");
8594 static void semantic_not(unary_expression_t *expression)
8596 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8597 semantic_condition(expression->value, "operand of !");
8598 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8601 static void semantic_unexpr_integer(unary_expression_t *expression)
8603 type_t *const orig_type = expression->value->base.type;
8604 type_t *const type = skip_typeref(orig_type);
8605 if (!is_type_integer(type)) {
8606 if (is_type_valid(type)) {
8607 errorf(&expression->base.source_position,
8608 "operand of ~ must be of integer type");
8613 expression->base.type = orig_type;
8616 static void semantic_dereference(unary_expression_t *expression)
8618 type_t *const orig_type = expression->value->base.type;
8619 type_t *const type = skip_typeref(orig_type);
8620 if (!is_type_pointer(type)) {
8621 if (is_type_valid(type)) {
8622 errorf(&expression->base.source_position,
8623 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8628 type_t *result_type = type->pointer.points_to;
8629 result_type = automatic_type_conversion(result_type);
8630 expression->base.type = result_type;
8634 * Record that an address is taken (expression represents an lvalue).
8636 * @param expression the expression
8637 * @param may_be_register if true, the expression might be an register
8639 static void set_address_taken(expression_t *expression, bool may_be_register)
8641 if (expression->kind != EXPR_REFERENCE)
8644 entity_t *const entity = expression->reference.entity;
8646 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8649 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8650 && !may_be_register) {
8651 errorf(&expression->base.source_position,
8652 "address of register %s '%Y' requested",
8653 get_entity_kind_name(entity->kind), entity->base.symbol);
8656 if (entity->kind == ENTITY_VARIABLE) {
8657 entity->variable.address_taken = true;
8659 assert(entity->kind == ENTITY_PARAMETER);
8660 entity->parameter.address_taken = true;
8665 * Check the semantic of the address taken expression.
8667 static void semantic_take_addr(unary_expression_t *expression)
8669 expression_t *value = expression->value;
8670 value->base.type = revert_automatic_type_conversion(value);
8672 type_t *orig_type = value->base.type;
8673 type_t *type = skip_typeref(orig_type);
8674 if (!is_type_valid(type))
8678 if (!is_lvalue(value)) {
8679 errorf(&expression->base.source_position, "'&' requires an lvalue");
8681 if (type->kind == TYPE_BITFIELD) {
8682 errorf(&expression->base.source_position,
8683 "'&' not allowed on object with bitfield type '%T'",
8687 set_address_taken(value, false);
8689 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8692 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8693 static expression_t *parse_##unexpression_type(void) \
8695 expression_t *unary_expression \
8696 = allocate_expression_zero(unexpression_type); \
8698 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8700 sfunc(&unary_expression->unary); \
8702 return unary_expression; \
8705 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8706 semantic_unexpr_arithmetic)
8707 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8708 semantic_unexpr_plus)
8709 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8711 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8712 semantic_dereference)
8713 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8715 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8716 semantic_unexpr_integer)
8717 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8719 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8722 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8724 static expression_t *parse_##unexpression_type(expression_t *left) \
8726 expression_t *unary_expression \
8727 = allocate_expression_zero(unexpression_type); \
8729 unary_expression->unary.value = left; \
8731 sfunc(&unary_expression->unary); \
8733 return unary_expression; \
8736 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8737 EXPR_UNARY_POSTFIX_INCREMENT,
8739 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8740 EXPR_UNARY_POSTFIX_DECREMENT,
8743 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8745 /* TODO: handle complex + imaginary types */
8747 type_left = get_unqualified_type(type_left);
8748 type_right = get_unqualified_type(type_right);
8750 /* § 6.3.1.8 Usual arithmetic conversions */
8751 if (type_left == type_long_double || type_right == type_long_double) {
8752 return type_long_double;
8753 } else if (type_left == type_double || type_right == type_double) {
8755 } else if (type_left == type_float || type_right == type_float) {
8759 type_left = promote_integer(type_left);
8760 type_right = promote_integer(type_right);
8762 if (type_left == type_right)
8765 bool const signed_left = is_type_signed(type_left);
8766 bool const signed_right = is_type_signed(type_right);
8767 int const rank_left = get_rank(type_left);
8768 int const rank_right = get_rank(type_right);
8770 if (signed_left == signed_right)
8771 return rank_left >= rank_right ? type_left : type_right;
8780 u_rank = rank_right;
8781 u_type = type_right;
8783 s_rank = rank_right;
8784 s_type = type_right;
8789 if (u_rank >= s_rank)
8792 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8794 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8795 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8799 case ATOMIC_TYPE_INT: return type_unsigned_int;
8800 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8801 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8803 default: panic("invalid atomic type");
8808 * Check the semantic restrictions for a binary expression.
8810 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8812 expression_t *const left = expression->left;
8813 expression_t *const right = expression->right;
8814 type_t *const orig_type_left = left->base.type;
8815 type_t *const orig_type_right = right->base.type;
8816 type_t *const type_left = skip_typeref(orig_type_left);
8817 type_t *const type_right = skip_typeref(orig_type_right);
8819 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8820 /* TODO: improve error message */
8821 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8822 errorf(&expression->base.source_position,
8823 "operation needs arithmetic types");
8828 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8829 expression->left = create_implicit_cast(left, arithmetic_type);
8830 expression->right = create_implicit_cast(right, arithmetic_type);
8831 expression->base.type = arithmetic_type;
8834 static void warn_div_by_zero(binary_expression_t const *const expression)
8836 if (!warning.div_by_zero ||
8837 !is_type_integer(expression->base.type))
8840 expression_t const *const right = expression->right;
8841 /* The type of the right operand can be different for /= */
8842 if (is_type_integer(right->base.type) &&
8843 is_constant_expression(right) &&
8844 fold_constant(right) == 0) {
8845 warningf(&expression->base.source_position, "division by zero");
8850 * Check the semantic restrictions for a div/mod expression.
8852 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
8853 semantic_binexpr_arithmetic(expression);
8854 warn_div_by_zero(expression);
8857 static void warn_addsub_in_shift(const expression_t *const expr)
8859 if (expr->base.parenthesized)
8863 switch (expr->kind) {
8864 case EXPR_BINARY_ADD: op = '+'; break;
8865 case EXPR_BINARY_SUB: op = '-'; break;
8869 warningf(&expr->base.source_position,
8870 "suggest parentheses around '%c' inside shift", op);
8873 static void semantic_shift_op(binary_expression_t *expression)
8875 expression_t *const left = expression->left;
8876 expression_t *const right = expression->right;
8877 type_t *const orig_type_left = left->base.type;
8878 type_t *const orig_type_right = right->base.type;
8879 type_t * type_left = skip_typeref(orig_type_left);
8880 type_t * type_right = skip_typeref(orig_type_right);
8882 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8883 /* TODO: improve error message */
8884 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8885 errorf(&expression->base.source_position,
8886 "operands of shift operation must have integer types");
8891 if (warning.parentheses) {
8892 warn_addsub_in_shift(left);
8893 warn_addsub_in_shift(right);
8896 type_left = promote_integer(type_left);
8897 type_right = promote_integer(type_right);
8899 expression->left = create_implicit_cast(left, type_left);
8900 expression->right = create_implicit_cast(right, type_right);
8901 expression->base.type = type_left;
8904 static void semantic_add(binary_expression_t *expression)
8906 expression_t *const left = expression->left;
8907 expression_t *const right = expression->right;
8908 type_t *const orig_type_left = left->base.type;
8909 type_t *const orig_type_right = right->base.type;
8910 type_t *const type_left = skip_typeref(orig_type_left);
8911 type_t *const type_right = skip_typeref(orig_type_right);
8914 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8915 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8916 expression->left = create_implicit_cast(left, arithmetic_type);
8917 expression->right = create_implicit_cast(right, arithmetic_type);
8918 expression->base.type = arithmetic_type;
8919 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8920 check_pointer_arithmetic(&expression->base.source_position,
8921 type_left, orig_type_left);
8922 expression->base.type = type_left;
8923 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8924 check_pointer_arithmetic(&expression->base.source_position,
8925 type_right, orig_type_right);
8926 expression->base.type = type_right;
8927 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8928 errorf(&expression->base.source_position,
8929 "invalid operands to binary + ('%T', '%T')",
8930 orig_type_left, orig_type_right);
8934 static void semantic_sub(binary_expression_t *expression)
8936 expression_t *const left = expression->left;
8937 expression_t *const right = expression->right;
8938 type_t *const orig_type_left = left->base.type;
8939 type_t *const orig_type_right = right->base.type;
8940 type_t *const type_left = skip_typeref(orig_type_left);
8941 type_t *const type_right = skip_typeref(orig_type_right);
8942 source_position_t const *const pos = &expression->base.source_position;
8945 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8946 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8947 expression->left = create_implicit_cast(left, arithmetic_type);
8948 expression->right = create_implicit_cast(right, arithmetic_type);
8949 expression->base.type = arithmetic_type;
8950 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8951 check_pointer_arithmetic(&expression->base.source_position,
8952 type_left, orig_type_left);
8953 expression->base.type = type_left;
8954 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8955 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8956 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8957 if (!types_compatible(unqual_left, unqual_right)) {
8959 "subtracting pointers to incompatible types '%T' and '%T'",
8960 orig_type_left, orig_type_right);
8961 } else if (!is_type_object(unqual_left)) {
8962 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8963 errorf(pos, "subtracting pointers to non-object types '%T'",
8965 } else if (warning.other) {
8966 warningf(pos, "subtracting pointers to void");
8969 expression->base.type = type_ptrdiff_t;
8970 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8971 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8972 orig_type_left, orig_type_right);
8976 static void warn_string_literal_address(expression_t const* expr)
8978 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8979 expr = expr->unary.value;
8980 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8982 expr = expr->unary.value;
8985 if (expr->kind == EXPR_STRING_LITERAL ||
8986 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8987 warningf(&expr->base.source_position,
8988 "comparison with string literal results in unspecified behaviour");
8992 static void warn_comparison_in_comparison(const expression_t *const expr)
8994 if (expr->base.parenthesized)
8996 switch (expr->base.kind) {
8997 case EXPR_BINARY_LESS:
8998 case EXPR_BINARY_GREATER:
8999 case EXPR_BINARY_LESSEQUAL:
9000 case EXPR_BINARY_GREATEREQUAL:
9001 case EXPR_BINARY_NOTEQUAL:
9002 case EXPR_BINARY_EQUAL:
9003 warningf(&expr->base.source_position,
9004 "comparisons like 'x <= y < z' do not have their mathematical meaning");
9012 * Check the semantics of comparison expressions.
9014 * @param expression The expression to check.
9016 static void semantic_comparison(binary_expression_t *expression)
9018 expression_t *left = expression->left;
9019 expression_t *right = expression->right;
9021 if (warning.address) {
9022 warn_string_literal_address(left);
9023 warn_string_literal_address(right);
9025 expression_t const* const func_left = get_reference_address(left);
9026 if (func_left != NULL && is_null_pointer_constant(right)) {
9027 warningf(&expression->base.source_position,
9028 "the address of '%Y' will never be NULL",
9029 func_left->reference.entity->base.symbol);
9032 expression_t const* const func_right = get_reference_address(right);
9033 if (func_right != NULL && is_null_pointer_constant(right)) {
9034 warningf(&expression->base.source_position,
9035 "the address of '%Y' will never be NULL",
9036 func_right->reference.entity->base.symbol);
9040 if (warning.parentheses) {
9041 warn_comparison_in_comparison(left);
9042 warn_comparison_in_comparison(right);
9045 type_t *orig_type_left = left->base.type;
9046 type_t *orig_type_right = right->base.type;
9047 type_t *type_left = skip_typeref(orig_type_left);
9048 type_t *type_right = skip_typeref(orig_type_right);
9050 /* TODO non-arithmetic types */
9051 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9052 /* test for signed vs unsigned compares */
9053 if (warning.sign_compare &&
9054 (expression->base.kind != EXPR_BINARY_EQUAL &&
9055 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
9056 (is_type_signed(type_left) != is_type_signed(type_right))) {
9058 /* check if 1 of the operands is a constant, in this case we just
9059 * check wether we can safely represent the resulting constant in
9060 * the type of the other operand. */
9061 expression_t *const_expr = NULL;
9062 expression_t *other_expr = NULL;
9064 if (is_constant_expression(left)) {
9067 } else if (is_constant_expression(right)) {
9072 if (const_expr != NULL) {
9073 type_t *other_type = skip_typeref(other_expr->base.type);
9074 long val = fold_constant(const_expr);
9075 /* TODO: check if val can be represented by other_type */
9079 warningf(&expression->base.source_position,
9080 "comparison between signed and unsigned");
9082 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9083 expression->left = create_implicit_cast(left, arithmetic_type);
9084 expression->right = create_implicit_cast(right, arithmetic_type);
9085 expression->base.type = arithmetic_type;
9086 if (warning.float_equal &&
9087 (expression->base.kind == EXPR_BINARY_EQUAL ||
9088 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
9089 is_type_float(arithmetic_type)) {
9090 warningf(&expression->base.source_position,
9091 "comparing floating point with == or != is unsafe");
9093 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
9094 /* TODO check compatibility */
9095 } else if (is_type_pointer(type_left)) {
9096 expression->right = create_implicit_cast(right, type_left);
9097 } else if (is_type_pointer(type_right)) {
9098 expression->left = create_implicit_cast(left, type_right);
9099 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9100 type_error_incompatible("invalid operands in comparison",
9101 &expression->base.source_position,
9102 type_left, type_right);
9104 expression->base.type = c_mode & _CXX ? type_bool : type_int;
9108 * Checks if a compound type has constant fields.
9110 static bool has_const_fields(const compound_type_t *type)
9112 compound_t *compound = type->compound;
9113 entity_t *entry = compound->members.entities;
9115 for (; entry != NULL; entry = entry->base.next) {
9116 if (!is_declaration(entry))
9119 const type_t *decl_type = skip_typeref(entry->declaration.type);
9120 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
9127 static bool is_valid_assignment_lhs(expression_t const* const left)
9129 type_t *const orig_type_left = revert_automatic_type_conversion(left);
9130 type_t *const type_left = skip_typeref(orig_type_left);
9132 if (!is_lvalue(left)) {
9133 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
9138 if (left->kind == EXPR_REFERENCE
9139 && left->reference.entity->kind == ENTITY_FUNCTION) {
9140 errorf(HERE, "cannot assign to function '%E'", left);
9144 if (is_type_array(type_left)) {
9145 errorf(HERE, "cannot assign to array '%E'", left);
9148 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
9149 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
9153 if (is_type_incomplete(type_left)) {
9154 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
9155 left, orig_type_left);
9158 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
9159 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
9160 left, orig_type_left);
9167 static void semantic_arithmetic_assign(binary_expression_t *expression)
9169 expression_t *left = expression->left;
9170 expression_t *right = expression->right;
9171 type_t *orig_type_left = left->base.type;
9172 type_t *orig_type_right = right->base.type;
9174 if (!is_valid_assignment_lhs(left))
9177 type_t *type_left = skip_typeref(orig_type_left);
9178 type_t *type_right = skip_typeref(orig_type_right);
9180 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
9181 /* TODO: improve error message */
9182 if (is_type_valid(type_left) && is_type_valid(type_right)) {
9183 errorf(&expression->base.source_position,
9184 "operation needs arithmetic types");
9189 /* combined instructions are tricky. We can't create an implicit cast on
9190 * the left side, because we need the uncasted form for the store.
9191 * The ast2firm pass has to know that left_type must be right_type
9192 * for the arithmetic operation and create a cast by itself */
9193 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9194 expression->right = create_implicit_cast(right, arithmetic_type);
9195 expression->base.type = type_left;
9198 static void semantic_divmod_assign(binary_expression_t *expression)
9200 semantic_arithmetic_assign(expression);
9201 warn_div_by_zero(expression);
9204 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
9206 expression_t *const left = expression->left;
9207 expression_t *const right = expression->right;
9208 type_t *const orig_type_left = left->base.type;
9209 type_t *const orig_type_right = right->base.type;
9210 type_t *const type_left = skip_typeref(orig_type_left);
9211 type_t *const type_right = skip_typeref(orig_type_right);
9213 if (!is_valid_assignment_lhs(left))
9216 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9217 /* combined instructions are tricky. We can't create an implicit cast on
9218 * the left side, because we need the uncasted form for the store.
9219 * The ast2firm pass has to know that left_type must be right_type
9220 * for the arithmetic operation and create a cast by itself */
9221 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
9222 expression->right = create_implicit_cast(right, arithmetic_type);
9223 expression->base.type = type_left;
9224 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
9225 check_pointer_arithmetic(&expression->base.source_position,
9226 type_left, orig_type_left);
9227 expression->base.type = type_left;
9228 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9229 errorf(&expression->base.source_position,
9230 "incompatible types '%T' and '%T' in assignment",
9231 orig_type_left, orig_type_right);
9235 static void warn_logical_and_within_or(const expression_t *const expr)
9237 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
9239 if (expr->base.parenthesized)
9241 warningf(&expr->base.source_position,
9242 "suggest parentheses around && within ||");
9246 * Check the semantic restrictions of a logical expression.
9248 static void semantic_logical_op(binary_expression_t *expression)
9250 /* §6.5.13:2 Each of the operands shall have scalar type.
9251 * §6.5.14:2 Each of the operands shall have scalar type. */
9252 semantic_condition(expression->left, "left operand of logical operator");
9253 semantic_condition(expression->right, "right operand of logical operator");
9254 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
9255 warning.parentheses) {
9256 warn_logical_and_within_or(expression->left);
9257 warn_logical_and_within_or(expression->right);
9259 expression->base.type = c_mode & _CXX ? type_bool : type_int;
9263 * Check the semantic restrictions of a binary assign expression.
9265 static void semantic_binexpr_assign(binary_expression_t *expression)
9267 expression_t *left = expression->left;
9268 type_t *orig_type_left = left->base.type;
9270 if (!is_valid_assignment_lhs(left))
9273 assign_error_t error = semantic_assign(orig_type_left, expression->right);
9274 report_assign_error(error, orig_type_left, expression->right,
9275 "assignment", &left->base.source_position);
9276 expression->right = create_implicit_cast(expression->right, orig_type_left);
9277 expression->base.type = orig_type_left;
9281 * Determine if the outermost operation (or parts thereof) of the given
9282 * expression has no effect in order to generate a warning about this fact.
9283 * Therefore in some cases this only examines some of the operands of the
9284 * expression (see comments in the function and examples below).
9286 * f() + 23; // warning, because + has no effect
9287 * x || f(); // no warning, because x controls execution of f()
9288 * x ? y : f(); // warning, because y has no effect
9289 * (void)x; // no warning to be able to suppress the warning
9290 * This function can NOT be used for an "expression has definitely no effect"-
9292 static bool expression_has_effect(const expression_t *const expr)
9294 switch (expr->kind) {
9295 case EXPR_UNKNOWN: break;
9296 case EXPR_INVALID: return true; /* do NOT warn */
9297 case EXPR_REFERENCE: return false;
9298 case EXPR_REFERENCE_ENUM_VALUE: return false;
9299 /* suppress the warning for microsoft __noop operations */
9300 case EXPR_CONST: return expr->conste.is_ms_noop;
9301 case EXPR_CHARACTER_CONSTANT: return false;
9302 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
9303 case EXPR_STRING_LITERAL: return false;
9304 case EXPR_WIDE_STRING_LITERAL: return false;
9305 case EXPR_LABEL_ADDRESS: return false;
9308 const call_expression_t *const call = &expr->call;
9309 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
9312 switch (call->function->builtin_symbol.symbol->ID) {
9313 case T___builtin_va_end: return true;
9314 default: return false;
9318 /* Generate the warning if either the left or right hand side of a
9319 * conditional expression has no effect */
9320 case EXPR_CONDITIONAL: {
9321 const conditional_expression_t *const cond = &expr->conditional;
9323 expression_has_effect(cond->true_expression) &&
9324 expression_has_effect(cond->false_expression);
9327 case EXPR_SELECT: return false;
9328 case EXPR_ARRAY_ACCESS: return false;
9329 case EXPR_SIZEOF: return false;
9330 case EXPR_CLASSIFY_TYPE: return false;
9331 case EXPR_ALIGNOF: return false;
9333 case EXPR_FUNCNAME: return false;
9334 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
9335 case EXPR_BUILTIN_CONSTANT_P: return false;
9336 case EXPR_BUILTIN_PREFETCH: return true;
9337 case EXPR_OFFSETOF: return false;
9338 case EXPR_VA_START: return true;
9339 case EXPR_VA_ARG: return true;
9340 case EXPR_STATEMENT: return true; // TODO
9341 case EXPR_COMPOUND_LITERAL: return false;
9343 case EXPR_UNARY_NEGATE: return false;
9344 case EXPR_UNARY_PLUS: return false;
9345 case EXPR_UNARY_BITWISE_NEGATE: return false;
9346 case EXPR_UNARY_NOT: return false;
9347 case EXPR_UNARY_DEREFERENCE: return false;
9348 case EXPR_UNARY_TAKE_ADDRESS: return false;
9349 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
9350 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
9351 case EXPR_UNARY_PREFIX_INCREMENT: return true;
9352 case EXPR_UNARY_PREFIX_DECREMENT: return true;
9354 /* Treat void casts as if they have an effect in order to being able to
9355 * suppress the warning */
9356 case EXPR_UNARY_CAST: {
9357 type_t *const type = skip_typeref(expr->base.type);
9358 return is_type_atomic(type, ATOMIC_TYPE_VOID);
9361 case EXPR_UNARY_CAST_IMPLICIT: return true;
9362 case EXPR_UNARY_ASSUME: return true;
9363 case EXPR_UNARY_DELETE: return true;
9364 case EXPR_UNARY_DELETE_ARRAY: return true;
9365 case EXPR_UNARY_THROW: return true;
9367 case EXPR_BINARY_ADD: return false;
9368 case EXPR_BINARY_SUB: return false;
9369 case EXPR_BINARY_MUL: return false;
9370 case EXPR_BINARY_DIV: return false;
9371 case EXPR_BINARY_MOD: return false;
9372 case EXPR_BINARY_EQUAL: return false;
9373 case EXPR_BINARY_NOTEQUAL: return false;
9374 case EXPR_BINARY_LESS: return false;
9375 case EXPR_BINARY_LESSEQUAL: return false;
9376 case EXPR_BINARY_GREATER: return false;
9377 case EXPR_BINARY_GREATEREQUAL: return false;
9378 case EXPR_BINARY_BITWISE_AND: return false;
9379 case EXPR_BINARY_BITWISE_OR: return false;
9380 case EXPR_BINARY_BITWISE_XOR: return false;
9381 case EXPR_BINARY_SHIFTLEFT: return false;
9382 case EXPR_BINARY_SHIFTRIGHT: return false;
9383 case EXPR_BINARY_ASSIGN: return true;
9384 case EXPR_BINARY_MUL_ASSIGN: return true;
9385 case EXPR_BINARY_DIV_ASSIGN: return true;
9386 case EXPR_BINARY_MOD_ASSIGN: return true;
9387 case EXPR_BINARY_ADD_ASSIGN: return true;
9388 case EXPR_BINARY_SUB_ASSIGN: return true;
9389 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
9390 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
9391 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
9392 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
9393 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
9395 /* Only examine the right hand side of && and ||, because the left hand
9396 * side already has the effect of controlling the execution of the right
9398 case EXPR_BINARY_LOGICAL_AND:
9399 case EXPR_BINARY_LOGICAL_OR:
9400 /* Only examine the right hand side of a comma expression, because the left
9401 * hand side has a separate warning */
9402 case EXPR_BINARY_COMMA:
9403 return expression_has_effect(expr->binary.right);
9405 case EXPR_BINARY_ISGREATER: return false;
9406 case EXPR_BINARY_ISGREATEREQUAL: return false;
9407 case EXPR_BINARY_ISLESS: return false;
9408 case EXPR_BINARY_ISLESSEQUAL: return false;
9409 case EXPR_BINARY_ISLESSGREATER: return false;
9410 case EXPR_BINARY_ISUNORDERED: return false;
9413 internal_errorf(HERE, "unexpected expression");
9416 static void semantic_comma(binary_expression_t *expression)
9418 if (warning.unused_value) {
9419 const expression_t *const left = expression->left;
9420 if (!expression_has_effect(left)) {
9421 warningf(&left->base.source_position,
9422 "left-hand operand of comma expression has no effect");
9425 expression->base.type = expression->right->base.type;
9429 * @param prec_r precedence of the right operand
9431 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
9432 static expression_t *parse_##binexpression_type(expression_t *left) \
9434 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
9435 binexpr->binary.left = left; \
9438 expression_t *right = parse_sub_expression(prec_r); \
9440 binexpr->binary.right = right; \
9441 sfunc(&binexpr->binary); \
9446 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
9447 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
9448 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
9449 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
9450 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
9451 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
9452 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
9453 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
9454 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
9455 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
9456 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
9457 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
9458 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
9459 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
9460 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
9461 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
9462 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
9463 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
9464 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
9465 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9466 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9467 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9468 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9469 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9470 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9471 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9472 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9473 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9474 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9475 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9478 static expression_t *parse_sub_expression(precedence_t precedence)
9480 if (token.type < 0) {
9481 return expected_expression_error();
9484 expression_parser_function_t *parser
9485 = &expression_parsers[token.type];
9486 source_position_t source_position = token.source_position;
9489 if (parser->parser != NULL) {
9490 left = parser->parser();
9492 left = parse_primary_expression();
9494 assert(left != NULL);
9495 left->base.source_position = source_position;
9498 if (token.type < 0) {
9499 return expected_expression_error();
9502 parser = &expression_parsers[token.type];
9503 if (parser->infix_parser == NULL)
9505 if (parser->infix_precedence < precedence)
9508 left = parser->infix_parser(left);
9510 assert(left != NULL);
9511 assert(left->kind != EXPR_UNKNOWN);
9512 left->base.source_position = source_position;
9519 * Parse an expression.
9521 static expression_t *parse_expression(void)
9523 return parse_sub_expression(PREC_EXPRESSION);
9527 * Register a parser for a prefix-like operator.
9529 * @param parser the parser function
9530 * @param token_type the token type of the prefix token
9532 static void register_expression_parser(parse_expression_function parser,
9535 expression_parser_function_t *entry = &expression_parsers[token_type];
9537 if (entry->parser != NULL) {
9538 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9539 panic("trying to register multiple expression parsers for a token");
9541 entry->parser = parser;
9545 * Register a parser for an infix operator with given precedence.
9547 * @param parser the parser function
9548 * @param token_type the token type of the infix operator
9549 * @param precedence the precedence of the operator
9551 static void register_infix_parser(parse_expression_infix_function parser,
9552 int token_type, unsigned precedence)
9554 expression_parser_function_t *entry = &expression_parsers[token_type];
9556 if (entry->infix_parser != NULL) {
9557 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9558 panic("trying to register multiple infix expression parsers for a "
9561 entry->infix_parser = parser;
9562 entry->infix_precedence = precedence;
9566 * Initialize the expression parsers.
9568 static void init_expression_parsers(void)
9570 memset(&expression_parsers, 0, sizeof(expression_parsers));
9572 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9573 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9574 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9575 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9576 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9577 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9578 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9579 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9580 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9581 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9582 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9583 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9584 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9585 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9586 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9587 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9588 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9589 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9590 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9591 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9592 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9593 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9594 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9595 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9596 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9597 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9598 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9599 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9600 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9601 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9602 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9603 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9604 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9605 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9606 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9607 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9608 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9610 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9611 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9612 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9613 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9614 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9615 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9616 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9617 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9618 register_expression_parser(parse_sizeof, T_sizeof);
9619 register_expression_parser(parse_alignof, T___alignof__);
9620 register_expression_parser(parse_extension, T___extension__);
9621 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9622 register_expression_parser(parse_delete, T_delete);
9623 register_expression_parser(parse_throw, T_throw);
9627 * Parse a asm statement arguments specification.
9629 static asm_argument_t *parse_asm_arguments(bool is_out)
9631 asm_argument_t *result = NULL;
9632 asm_argument_t **anchor = &result;
9634 while (token.type == T_STRING_LITERAL || token.type == '[') {
9635 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9636 memset(argument, 0, sizeof(argument[0]));
9638 if (token.type == '[') {
9640 if (token.type != T_IDENTIFIER) {
9641 parse_error_expected("while parsing asm argument",
9642 T_IDENTIFIER, NULL);
9645 argument->symbol = token.v.symbol;
9647 expect(']', end_error);
9650 argument->constraints = parse_string_literals();
9651 expect('(', end_error);
9652 add_anchor_token(')');
9653 expression_t *expression = parse_expression();
9654 rem_anchor_token(')');
9656 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9657 * change size or type representation (e.g. int -> long is ok, but
9658 * int -> float is not) */
9659 if (expression->kind == EXPR_UNARY_CAST) {
9660 type_t *const type = expression->base.type;
9661 type_kind_t const kind = type->kind;
9662 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9665 if (kind == TYPE_ATOMIC) {
9666 atomic_type_kind_t const akind = type->atomic.akind;
9667 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9668 size = get_atomic_type_size(akind);
9670 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9671 size = get_atomic_type_size(get_intptr_kind());
9675 expression_t *const value = expression->unary.value;
9676 type_t *const value_type = value->base.type;
9677 type_kind_t const value_kind = value_type->kind;
9679 unsigned value_flags;
9680 unsigned value_size;
9681 if (value_kind == TYPE_ATOMIC) {
9682 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9683 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9684 value_size = get_atomic_type_size(value_akind);
9685 } else if (value_kind == TYPE_POINTER) {
9686 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9687 value_size = get_atomic_type_size(get_intptr_kind());
9692 if (value_flags != flags || value_size != size)
9696 } while (expression->kind == EXPR_UNARY_CAST);
9700 if (!is_lvalue(expression)) {
9701 errorf(&expression->base.source_position,
9702 "asm output argument is not an lvalue");
9705 if (argument->constraints.begin[0] == '+')
9706 mark_vars_read(expression, NULL);
9708 mark_vars_read(expression, NULL);
9710 argument->expression = expression;
9711 expect(')', end_error);
9713 set_address_taken(expression, true);
9716 anchor = &argument->next;
9718 if (token.type != ',')
9729 * Parse a asm statement clobber specification.
9731 static asm_clobber_t *parse_asm_clobbers(void)
9733 asm_clobber_t *result = NULL;
9734 asm_clobber_t *last = NULL;
9736 while (token.type == T_STRING_LITERAL) {
9737 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9738 clobber->clobber = parse_string_literals();
9741 last->next = clobber;
9747 if (token.type != ',')
9756 * Parse an asm statement.
9758 static statement_t *parse_asm_statement(void)
9760 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9761 asm_statement_t *asm_statement = &statement->asms;
9765 if (token.type == T_volatile) {
9767 asm_statement->is_volatile = true;
9770 expect('(', end_error);
9771 add_anchor_token(')');
9772 add_anchor_token(':');
9773 asm_statement->asm_text = parse_string_literals();
9775 if (token.type != ':') {
9776 rem_anchor_token(':');
9781 asm_statement->outputs = parse_asm_arguments(true);
9782 if (token.type != ':') {
9783 rem_anchor_token(':');
9788 asm_statement->inputs = parse_asm_arguments(false);
9789 if (token.type != ':') {
9790 rem_anchor_token(':');
9793 rem_anchor_token(':');
9796 asm_statement->clobbers = parse_asm_clobbers();
9799 rem_anchor_token(')');
9800 expect(')', end_error);
9801 expect(';', end_error);
9803 if (asm_statement->outputs == NULL) {
9804 /* GCC: An 'asm' instruction without any output operands will be treated
9805 * identically to a volatile 'asm' instruction. */
9806 asm_statement->is_volatile = true;
9811 return create_invalid_statement();
9815 * Parse a case statement.
9817 static statement_t *parse_case_statement(void)
9819 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9820 source_position_t *const pos = &statement->base.source_position;
9824 expression_t *const expression = parse_expression();
9825 statement->case_label.expression = expression;
9826 if (!is_constant_expression(expression)) {
9827 /* This check does not prevent the error message in all cases of an
9828 * prior error while parsing the expression. At least it catches the
9829 * common case of a mistyped enum entry. */
9830 if (is_type_valid(skip_typeref(expression->base.type))) {
9831 errorf(pos, "case label does not reduce to an integer constant");
9833 statement->case_label.is_bad = true;
9835 long const val = fold_constant(expression);
9836 statement->case_label.first_case = val;
9837 statement->case_label.last_case = val;
9841 if (token.type == T_DOTDOTDOT) {
9843 expression_t *const end_range = parse_expression();
9844 statement->case_label.end_range = end_range;
9845 if (!is_constant_expression(end_range)) {
9846 /* This check does not prevent the error message in all cases of an
9847 * prior error while parsing the expression. At least it catches the
9848 * common case of a mistyped enum entry. */
9849 if (is_type_valid(skip_typeref(end_range->base.type))) {
9850 errorf(pos, "case range does not reduce to an integer constant");
9852 statement->case_label.is_bad = true;
9854 long const val = fold_constant(end_range);
9855 statement->case_label.last_case = val;
9857 if (warning.other && val < statement->case_label.first_case) {
9858 statement->case_label.is_empty_range = true;
9859 warningf(pos, "empty range specified");
9865 PUSH_PARENT(statement);
9867 expect(':', end_error);
9870 if (current_switch != NULL) {
9871 if (! statement->case_label.is_bad) {
9872 /* Check for duplicate case values */
9873 case_label_statement_t *c = &statement->case_label;
9874 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9875 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9878 if (c->last_case < l->first_case || c->first_case > l->last_case)
9881 errorf(pos, "duplicate case value (previously used %P)",
9882 &l->base.source_position);
9886 /* link all cases into the switch statement */
9887 if (current_switch->last_case == NULL) {
9888 current_switch->first_case = &statement->case_label;
9890 current_switch->last_case->next = &statement->case_label;
9892 current_switch->last_case = &statement->case_label;
9894 errorf(pos, "case label not within a switch statement");
9897 statement_t *const inner_stmt = parse_statement();
9898 statement->case_label.statement = inner_stmt;
9899 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9900 errorf(&inner_stmt->base.source_position, "declaration after case label");
9908 * Parse a default statement.
9910 static statement_t *parse_default_statement(void)
9912 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9916 PUSH_PARENT(statement);
9918 expect(':', end_error);
9919 if (current_switch != NULL) {
9920 const case_label_statement_t *def_label = current_switch->default_label;
9921 if (def_label != NULL) {
9922 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9923 &def_label->base.source_position);
9925 current_switch->default_label = &statement->case_label;
9927 /* link all cases into the switch statement */
9928 if (current_switch->last_case == NULL) {
9929 current_switch->first_case = &statement->case_label;
9931 current_switch->last_case->next = &statement->case_label;
9933 current_switch->last_case = &statement->case_label;
9936 errorf(&statement->base.source_position,
9937 "'default' label not within a switch statement");
9940 statement_t *const inner_stmt = parse_statement();
9941 statement->case_label.statement = inner_stmt;
9942 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9943 errorf(&inner_stmt->base.source_position, "declaration after default label");
9950 return create_invalid_statement();
9954 * Parse a label statement.
9956 static statement_t *parse_label_statement(void)
9958 assert(token.type == T_IDENTIFIER);
9959 symbol_t *symbol = token.v.symbol;
9960 label_t *label = get_label(symbol);
9962 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9963 statement->label.label = label;
9967 PUSH_PARENT(statement);
9969 /* if statement is already set then the label is defined twice,
9970 * otherwise it was just mentioned in a goto/local label declaration so far
9972 if (label->statement != NULL) {
9973 errorf(HERE, "duplicate label '%Y' (declared %P)",
9974 symbol, &label->base.source_position);
9976 label->base.source_position = token.source_position;
9977 label->statement = statement;
9982 if (token.type == '}') {
9983 /* TODO only warn? */
9984 if (warning.other && false) {
9985 warningf(HERE, "label at end of compound statement");
9986 statement->label.statement = create_empty_statement();
9988 errorf(HERE, "label at end of compound statement");
9989 statement->label.statement = create_invalid_statement();
9991 } else if (token.type == ';') {
9992 /* Eat an empty statement here, to avoid the warning about an empty
9993 * statement after a label. label:; is commonly used to have a label
9994 * before a closing brace. */
9995 statement->label.statement = create_empty_statement();
9998 statement_t *const inner_stmt = parse_statement();
9999 statement->label.statement = inner_stmt;
10000 if (inner_stmt->kind == STATEMENT_DECLARATION) {
10001 errorf(&inner_stmt->base.source_position, "declaration after label");
10005 /* remember the labels in a list for later checking */
10006 *label_anchor = &statement->label;
10007 label_anchor = &statement->label.next;
10014 * Parse an if statement.
10016 static statement_t *parse_if(void)
10018 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
10022 PUSH_PARENT(statement);
10024 add_anchor_token('{');
10026 expect('(', end_error);
10027 add_anchor_token(')');
10028 expression_t *const expr = parse_expression();
10029 statement->ifs.condition = expr;
10030 /* §6.8.4.1:1 The controlling expression of an if statement shall have
10032 semantic_condition(expr, "condition of 'if'-statment");
10033 mark_vars_read(expr, NULL);
10034 rem_anchor_token(')');
10035 expect(')', end_error);
10038 rem_anchor_token('{');
10040 add_anchor_token(T_else);
10041 statement_t *const true_stmt = parse_statement();
10042 statement->ifs.true_statement = true_stmt;
10043 rem_anchor_token(T_else);
10045 if (token.type == T_else) {
10047 statement->ifs.false_statement = parse_statement();
10048 } else if (warning.parentheses &&
10049 true_stmt->kind == STATEMENT_IF &&
10050 true_stmt->ifs.false_statement != NULL) {
10051 warningf(&true_stmt->base.source_position,
10052 "suggest explicit braces to avoid ambiguous 'else'");
10060 * Check that all enums are handled in a switch.
10062 * @param statement the switch statement to check
10064 static void check_enum_cases(const switch_statement_t *statement) {
10065 const type_t *type = skip_typeref(statement->expression->base.type);
10066 if (! is_type_enum(type))
10068 const enum_type_t *enumt = &type->enumt;
10070 /* if we have a default, no warnings */
10071 if (statement->default_label != NULL)
10074 /* FIXME: calculation of value should be done while parsing */
10075 /* TODO: quadratic algorithm here. Change to an n log n one */
10076 long last_value = -1;
10077 const entity_t *entry = enumt->enume->base.next;
10078 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
10079 entry = entry->base.next) {
10080 const expression_t *expression = entry->enum_value.value;
10081 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
10082 bool found = false;
10083 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
10084 if (l->expression == NULL)
10086 if (l->first_case <= value && value <= l->last_case) {
10092 warningf(&statement->base.source_position,
10093 "enumeration value '%Y' not handled in switch",
10094 entry->base.symbol);
10096 last_value = value;
10101 * Parse a switch statement.
10103 static statement_t *parse_switch(void)
10105 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
10109 PUSH_PARENT(statement);
10111 expect('(', end_error);
10112 add_anchor_token(')');
10113 expression_t *const expr = parse_expression();
10114 mark_vars_read(expr, NULL);
10115 type_t * type = skip_typeref(expr->base.type);
10116 if (is_type_integer(type)) {
10117 type = promote_integer(type);
10118 if (warning.traditional) {
10119 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
10120 warningf(&expr->base.source_position,
10121 "'%T' switch expression not converted to '%T' in ISO C",
10125 } else if (is_type_valid(type)) {
10126 errorf(&expr->base.source_position,
10127 "switch quantity is not an integer, but '%T'", type);
10128 type = type_error_type;
10130 statement->switchs.expression = create_implicit_cast(expr, type);
10131 expect(')', end_error);
10132 rem_anchor_token(')');
10134 switch_statement_t *rem = current_switch;
10135 current_switch = &statement->switchs;
10136 statement->switchs.body = parse_statement();
10137 current_switch = rem;
10139 if (warning.switch_default &&
10140 statement->switchs.default_label == NULL) {
10141 warningf(&statement->base.source_position, "switch has no default case");
10143 if (warning.switch_enum)
10144 check_enum_cases(&statement->switchs);
10150 return create_invalid_statement();
10153 static statement_t *parse_loop_body(statement_t *const loop)
10155 statement_t *const rem = current_loop;
10156 current_loop = loop;
10158 statement_t *const body = parse_statement();
10160 current_loop = rem;
10165 * Parse a while statement.
10167 static statement_t *parse_while(void)
10169 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
10173 PUSH_PARENT(statement);
10175 expect('(', end_error);
10176 add_anchor_token(')');
10177 expression_t *const cond = parse_expression();
10178 statement->whiles.condition = cond;
10179 /* §6.8.5:2 The controlling expression of an iteration statement shall
10180 * have scalar type. */
10181 semantic_condition(cond, "condition of 'while'-statement");
10182 mark_vars_read(cond, NULL);
10183 rem_anchor_token(')');
10184 expect(')', end_error);
10186 statement->whiles.body = parse_loop_body(statement);
10192 return create_invalid_statement();
10196 * Parse a do statement.
10198 static statement_t *parse_do(void)
10200 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
10204 PUSH_PARENT(statement);
10206 add_anchor_token(T_while);
10207 statement->do_while.body = parse_loop_body(statement);
10208 rem_anchor_token(T_while);
10210 expect(T_while, end_error);
10211 expect('(', end_error);
10212 add_anchor_token(')');
10213 expression_t *const cond = parse_expression();
10214 statement->do_while.condition = cond;
10215 /* §6.8.5:2 The controlling expression of an iteration statement shall
10216 * have scalar type. */
10217 semantic_condition(cond, "condition of 'do-while'-statement");
10218 mark_vars_read(cond, NULL);
10219 rem_anchor_token(')');
10220 expect(')', end_error);
10221 expect(';', end_error);
10227 return create_invalid_statement();
10231 * Parse a for statement.
10233 static statement_t *parse_for(void)
10235 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
10239 expect('(', end_error1);
10240 add_anchor_token(')');
10242 PUSH_PARENT(statement);
10244 size_t const top = environment_top();
10245 scope_t *old_scope = scope_push(&statement->fors.scope);
10247 if (token.type == ';') {
10249 } else if (is_declaration_specifier(&token, false)) {
10250 parse_declaration(record_entity, DECL_FLAGS_NONE);
10252 add_anchor_token(';');
10253 expression_t *const init = parse_expression();
10254 statement->fors.initialisation = init;
10255 mark_vars_read(init, ENT_ANY);
10256 if (warning.unused_value && !expression_has_effect(init)) {
10257 warningf(&init->base.source_position,
10258 "initialisation of 'for'-statement has no effect");
10260 rem_anchor_token(';');
10261 expect(';', end_error2);
10264 if (token.type != ';') {
10265 add_anchor_token(';');
10266 expression_t *const cond = parse_expression();
10267 statement->fors.condition = cond;
10268 /* §6.8.5:2 The controlling expression of an iteration statement
10269 * shall have scalar type. */
10270 semantic_condition(cond, "condition of 'for'-statement");
10271 mark_vars_read(cond, NULL);
10272 rem_anchor_token(';');
10274 expect(';', end_error2);
10275 if (token.type != ')') {
10276 expression_t *const step = parse_expression();
10277 statement->fors.step = step;
10278 mark_vars_read(step, ENT_ANY);
10279 if (warning.unused_value && !expression_has_effect(step)) {
10280 warningf(&step->base.source_position,
10281 "step of 'for'-statement has no effect");
10284 expect(')', end_error2);
10285 rem_anchor_token(')');
10286 statement->fors.body = parse_loop_body(statement);
10288 assert(current_scope == &statement->fors.scope);
10289 scope_pop(old_scope);
10290 environment_pop_to(top);
10297 rem_anchor_token(')');
10298 assert(current_scope == &statement->fors.scope);
10299 scope_pop(old_scope);
10300 environment_pop_to(top);
10304 return create_invalid_statement();
10308 * Parse a goto statement.
10310 static statement_t *parse_goto(void)
10312 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
10315 if (GNU_MODE && token.type == '*') {
10317 expression_t *expression = parse_expression();
10318 mark_vars_read(expression, NULL);
10320 /* Argh: although documentation says the expression must be of type void*,
10321 * gcc accepts anything that can be casted into void* without error */
10322 type_t *type = expression->base.type;
10324 if (type != type_error_type) {
10325 if (!is_type_pointer(type) && !is_type_integer(type)) {
10326 errorf(&expression->base.source_position,
10327 "cannot convert to a pointer type");
10328 } else if (warning.other && type != type_void_ptr) {
10329 warningf(&expression->base.source_position,
10330 "type of computed goto expression should be 'void*' not '%T'", type);
10332 expression = create_implicit_cast(expression, type_void_ptr);
10335 statement->gotos.expression = expression;
10337 if (token.type != T_IDENTIFIER) {
10339 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
10341 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
10342 eat_until_anchor();
10345 symbol_t *symbol = token.v.symbol;
10348 statement->gotos.label = get_label(symbol);
10351 /* remember the goto's in a list for later checking */
10352 *goto_anchor = &statement->gotos;
10353 goto_anchor = &statement->gotos.next;
10355 expect(';', end_error);
10359 return create_invalid_statement();
10363 * Parse a continue statement.
10365 static statement_t *parse_continue(void)
10367 if (current_loop == NULL) {
10368 errorf(HERE, "continue statement not within loop");
10371 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
10374 expect(';', end_error);
10381 * Parse a break statement.
10383 static statement_t *parse_break(void)
10385 if (current_switch == NULL && current_loop == NULL) {
10386 errorf(HERE, "break statement not within loop or switch");
10389 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
10392 expect(';', end_error);
10399 * Parse a __leave statement.
10401 static statement_t *parse_leave_statement(void)
10403 if (current_try == NULL) {
10404 errorf(HERE, "__leave statement not within __try");
10407 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
10410 expect(';', end_error);
10417 * Check if a given entity represents a local variable.
10419 static bool is_local_variable(const entity_t *entity)
10421 if (entity->kind != ENTITY_VARIABLE)
10424 switch ((storage_class_tag_t) entity->declaration.storage_class) {
10425 case STORAGE_CLASS_AUTO:
10426 case STORAGE_CLASS_REGISTER: {
10427 const type_t *type = skip_typeref(entity->declaration.type);
10428 if (is_type_function(type)) {
10440 * Check if a given expression represents a local variable.
10442 static bool expression_is_local_variable(const expression_t *expression)
10444 if (expression->base.kind != EXPR_REFERENCE) {
10447 const entity_t *entity = expression->reference.entity;
10448 return is_local_variable(entity);
10452 * Check if a given expression represents a local variable and
10453 * return its declaration then, else return NULL.
10455 entity_t *expression_is_variable(const expression_t *expression)
10457 if (expression->base.kind != EXPR_REFERENCE) {
10460 entity_t *entity = expression->reference.entity;
10461 if (entity->kind != ENTITY_VARIABLE)
10468 * Parse a return statement.
10470 static statement_t *parse_return(void)
10474 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10476 expression_t *return_value = NULL;
10477 if (token.type != ';') {
10478 return_value = parse_expression();
10479 mark_vars_read(return_value, NULL);
10482 const type_t *const func_type = skip_typeref(current_function->base.type);
10483 assert(is_type_function(func_type));
10484 type_t *const return_type = skip_typeref(func_type->function.return_type);
10486 source_position_t const *const pos = &statement->base.source_position;
10487 if (return_value != NULL) {
10488 type_t *return_value_type = skip_typeref(return_value->base.type);
10490 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10491 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10492 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10493 /* Only warn in C mode, because GCC does the same */
10494 if (c_mode & _CXX || strict_mode) {
10496 "'return' with a value, in function returning 'void'");
10497 } else if (warning.other) {
10499 "'return' with a value, in function returning 'void'");
10501 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10502 /* Only warn in C mode, because GCC does the same */
10505 "'return' with expression in function return 'void'");
10506 } else if (warning.other) {
10508 "'return' with expression in function return 'void'");
10512 assign_error_t error = semantic_assign(return_type, return_value);
10513 report_assign_error(error, return_type, return_value, "'return'",
10516 return_value = create_implicit_cast(return_value, return_type);
10517 /* check for returning address of a local var */
10518 if (warning.other && return_value != NULL
10519 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10520 const expression_t *expression = return_value->unary.value;
10521 if (expression_is_local_variable(expression)) {
10522 warningf(pos, "function returns address of local variable");
10525 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10526 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10527 if (c_mode & _CXX || strict_mode) {
10529 "'return' without value, in function returning non-void");
10532 "'return' without value, in function returning non-void");
10535 statement->returns.value = return_value;
10537 expect(';', end_error);
10544 * Parse a declaration statement.
10546 static statement_t *parse_declaration_statement(void)
10548 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10550 entity_t *before = current_scope->last_entity;
10552 parse_external_declaration();
10554 parse_declaration(record_entity, DECL_FLAGS_NONE);
10557 if (before == NULL) {
10558 statement->declaration.declarations_begin = current_scope->entities;
10560 statement->declaration.declarations_begin = before->base.next;
10562 statement->declaration.declarations_end = current_scope->last_entity;
10568 * Parse an expression statement, ie. expr ';'.
10570 static statement_t *parse_expression_statement(void)
10572 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10574 expression_t *const expr = parse_expression();
10575 statement->expression.expression = expr;
10576 mark_vars_read(expr, ENT_ANY);
10578 expect(';', end_error);
10585 * Parse a microsoft __try { } __finally { } or
10586 * __try{ } __except() { }
10588 static statement_t *parse_ms_try_statment(void)
10590 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10593 PUSH_PARENT(statement);
10595 ms_try_statement_t *rem = current_try;
10596 current_try = &statement->ms_try;
10597 statement->ms_try.try_statement = parse_compound_statement(false);
10602 if (token.type == T___except) {
10604 expect('(', end_error);
10605 add_anchor_token(')');
10606 expression_t *const expr = parse_expression();
10607 mark_vars_read(expr, NULL);
10608 type_t * type = skip_typeref(expr->base.type);
10609 if (is_type_integer(type)) {
10610 type = promote_integer(type);
10611 } else if (is_type_valid(type)) {
10612 errorf(&expr->base.source_position,
10613 "__expect expression is not an integer, but '%T'", type);
10614 type = type_error_type;
10616 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10617 rem_anchor_token(')');
10618 expect(')', end_error);
10619 statement->ms_try.final_statement = parse_compound_statement(false);
10620 } else if (token.type == T__finally) {
10622 statement->ms_try.final_statement = parse_compound_statement(false);
10624 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10625 return create_invalid_statement();
10629 return create_invalid_statement();
10632 static statement_t *parse_empty_statement(void)
10634 if (warning.empty_statement) {
10635 warningf(HERE, "statement is empty");
10637 statement_t *const statement = create_empty_statement();
10642 static statement_t *parse_local_label_declaration(void)
10644 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10648 entity_t *begin = NULL, *end = NULL;
10651 if (token.type != T_IDENTIFIER) {
10652 parse_error_expected("while parsing local label declaration",
10653 T_IDENTIFIER, NULL);
10656 symbol_t *symbol = token.v.symbol;
10657 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10658 if (entity != NULL && entity->base.parent_scope == current_scope) {
10659 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10660 symbol, &entity->base.source_position);
10662 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10664 entity->base.parent_scope = current_scope;
10665 entity->base.namespc = NAMESPACE_LABEL;
10666 entity->base.source_position = token.source_position;
10667 entity->base.symbol = symbol;
10670 end->base.next = entity;
10675 environment_push(entity);
10679 if (token.type != ',')
10685 statement->declaration.declarations_begin = begin;
10686 statement->declaration.declarations_end = end;
10690 static void parse_namespace_definition(void)
10694 entity_t *entity = NULL;
10695 symbol_t *symbol = NULL;
10697 if (token.type == T_IDENTIFIER) {
10698 symbol = token.v.symbol;
10701 entity = get_entity(symbol, NAMESPACE_NORMAL);
10702 if (entity != NULL && entity->kind != ENTITY_NAMESPACE
10703 && entity->base.parent_scope == current_scope) {
10704 error_redefined_as_different_kind(&token.source_position,
10705 entity, ENTITY_NAMESPACE);
10710 if (entity == NULL) {
10711 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10712 entity->base.symbol = symbol;
10713 entity->base.source_position = token.source_position;
10714 entity->base.namespc = NAMESPACE_NORMAL;
10715 entity->base.parent_scope = current_scope;
10718 if (token.type == '=') {
10719 /* TODO: parse namespace alias */
10720 panic("namespace alias definition not supported yet");
10723 environment_push(entity);
10724 append_entity(current_scope, entity);
10726 size_t const top = environment_top();
10727 scope_t *old_scope = scope_push(&entity->namespacee.members);
10729 expect('{', end_error);
10731 expect('}', end_error);
10734 assert(current_scope == &entity->namespacee.members);
10735 scope_pop(old_scope);
10736 environment_pop_to(top);
10740 * Parse a statement.
10741 * There's also parse_statement() which additionally checks for
10742 * "statement has no effect" warnings
10744 static statement_t *intern_parse_statement(void)
10746 statement_t *statement = NULL;
10748 /* declaration or statement */
10749 add_anchor_token(';');
10750 switch (token.type) {
10751 case T_IDENTIFIER: {
10752 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10753 if (la1_type == ':') {
10754 statement = parse_label_statement();
10755 } else if (is_typedef_symbol(token.v.symbol)) {
10756 statement = parse_declaration_statement();
10758 /* it's an identifier, the grammar says this must be an
10759 * expression statement. However it is common that users mistype
10760 * declaration types, so we guess a bit here to improve robustness
10761 * for incorrect programs */
10762 switch (la1_type) {
10765 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10766 goto expression_statment;
10771 statement = parse_declaration_statement();
10775 expression_statment:
10776 statement = parse_expression_statement();
10783 case T___extension__:
10784 /* This can be a prefix to a declaration or an expression statement.
10785 * We simply eat it now and parse the rest with tail recursion. */
10788 } while (token.type == T___extension__);
10789 bool old_gcc_extension = in_gcc_extension;
10790 in_gcc_extension = true;
10791 statement = intern_parse_statement();
10792 in_gcc_extension = old_gcc_extension;
10796 statement = parse_declaration_statement();
10800 statement = parse_local_label_declaration();
10803 case ';': statement = parse_empty_statement(); break;
10804 case '{': statement = parse_compound_statement(false); break;
10805 case T___leave: statement = parse_leave_statement(); break;
10806 case T___try: statement = parse_ms_try_statment(); break;
10807 case T_asm: statement = parse_asm_statement(); break;
10808 case T_break: statement = parse_break(); break;
10809 case T_case: statement = parse_case_statement(); break;
10810 case T_continue: statement = parse_continue(); break;
10811 case T_default: statement = parse_default_statement(); break;
10812 case T_do: statement = parse_do(); break;
10813 case T_for: statement = parse_for(); break;
10814 case T_goto: statement = parse_goto(); break;
10815 case T_if: statement = parse_if(); break;
10816 case T_return: statement = parse_return(); break;
10817 case T_switch: statement = parse_switch(); break;
10818 case T_while: statement = parse_while(); break;
10821 statement = parse_expression_statement();
10825 errorf(HERE, "unexpected token %K while parsing statement", &token);
10826 statement = create_invalid_statement();
10831 rem_anchor_token(';');
10833 assert(statement != NULL
10834 && statement->base.source_position.input_name != NULL);
10840 * parse a statement and emits "statement has no effect" warning if needed
10841 * (This is really a wrapper around intern_parse_statement with check for 1
10842 * single warning. It is needed, because for statement expressions we have
10843 * to avoid the warning on the last statement)
10845 static statement_t *parse_statement(void)
10847 statement_t *statement = intern_parse_statement();
10849 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10850 expression_t *expression = statement->expression.expression;
10851 if (!expression_has_effect(expression)) {
10852 warningf(&expression->base.source_position,
10853 "statement has no effect");
10861 * Parse a compound statement.
10863 static statement_t *parse_compound_statement(bool inside_expression_statement)
10865 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10867 PUSH_PARENT(statement);
10870 add_anchor_token('}');
10871 /* tokens, which can start a statement */
10872 /* TODO MS, __builtin_FOO */
10873 add_anchor_token('!');
10874 add_anchor_token('&');
10875 add_anchor_token('(');
10876 add_anchor_token('*');
10877 add_anchor_token('+');
10878 add_anchor_token('-');
10879 add_anchor_token('{');
10880 add_anchor_token('~');
10881 add_anchor_token(T_CHARACTER_CONSTANT);
10882 add_anchor_token(T_COLONCOLON);
10883 add_anchor_token(T_FLOATINGPOINT);
10884 add_anchor_token(T_IDENTIFIER);
10885 add_anchor_token(T_INTEGER);
10886 add_anchor_token(T_MINUSMINUS);
10887 add_anchor_token(T_PLUSPLUS);
10888 add_anchor_token(T_STRING_LITERAL);
10889 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10890 add_anchor_token(T_WIDE_STRING_LITERAL);
10891 add_anchor_token(T__Bool);
10892 add_anchor_token(T__Complex);
10893 add_anchor_token(T__Imaginary);
10894 add_anchor_token(T___FUNCTION__);
10895 add_anchor_token(T___PRETTY_FUNCTION__);
10896 add_anchor_token(T___alignof__);
10897 add_anchor_token(T___attribute__);
10898 add_anchor_token(T___builtin_va_start);
10899 add_anchor_token(T___extension__);
10900 add_anchor_token(T___func__);
10901 add_anchor_token(T___imag__);
10902 add_anchor_token(T___label__);
10903 add_anchor_token(T___real__);
10904 add_anchor_token(T___thread);
10905 add_anchor_token(T_asm);
10906 add_anchor_token(T_auto);
10907 add_anchor_token(T_bool);
10908 add_anchor_token(T_break);
10909 add_anchor_token(T_case);
10910 add_anchor_token(T_char);
10911 add_anchor_token(T_class);
10912 add_anchor_token(T_const);
10913 add_anchor_token(T_const_cast);
10914 add_anchor_token(T_continue);
10915 add_anchor_token(T_default);
10916 add_anchor_token(T_delete);
10917 add_anchor_token(T_double);
10918 add_anchor_token(T_do);
10919 add_anchor_token(T_dynamic_cast);
10920 add_anchor_token(T_enum);
10921 add_anchor_token(T_extern);
10922 add_anchor_token(T_false);
10923 add_anchor_token(T_float);
10924 add_anchor_token(T_for);
10925 add_anchor_token(T_goto);
10926 add_anchor_token(T_if);
10927 add_anchor_token(T_inline);
10928 add_anchor_token(T_int);
10929 add_anchor_token(T_long);
10930 add_anchor_token(T_new);
10931 add_anchor_token(T_operator);
10932 add_anchor_token(T_register);
10933 add_anchor_token(T_reinterpret_cast);
10934 add_anchor_token(T_restrict);
10935 add_anchor_token(T_return);
10936 add_anchor_token(T_short);
10937 add_anchor_token(T_signed);
10938 add_anchor_token(T_sizeof);
10939 add_anchor_token(T_static);
10940 add_anchor_token(T_static_cast);
10941 add_anchor_token(T_struct);
10942 add_anchor_token(T_switch);
10943 add_anchor_token(T_template);
10944 add_anchor_token(T_this);
10945 add_anchor_token(T_throw);
10946 add_anchor_token(T_true);
10947 add_anchor_token(T_try);
10948 add_anchor_token(T_typedef);
10949 add_anchor_token(T_typeid);
10950 add_anchor_token(T_typename);
10951 add_anchor_token(T_typeof);
10952 add_anchor_token(T_union);
10953 add_anchor_token(T_unsigned);
10954 add_anchor_token(T_using);
10955 add_anchor_token(T_void);
10956 add_anchor_token(T_volatile);
10957 add_anchor_token(T_wchar_t);
10958 add_anchor_token(T_while);
10960 size_t const top = environment_top();
10961 scope_t *old_scope = scope_push(&statement->compound.scope);
10963 statement_t **anchor = &statement->compound.statements;
10964 bool only_decls_so_far = true;
10965 while (token.type != '}') {
10966 if (token.type == T_EOF) {
10967 errorf(&statement->base.source_position,
10968 "EOF while parsing compound statement");
10971 statement_t *sub_statement = intern_parse_statement();
10972 if (is_invalid_statement(sub_statement)) {
10973 /* an error occurred. if we are at an anchor, return */
10979 if (warning.declaration_after_statement) {
10980 if (sub_statement->kind != STATEMENT_DECLARATION) {
10981 only_decls_so_far = false;
10982 } else if (!only_decls_so_far) {
10983 warningf(&sub_statement->base.source_position,
10984 "ISO C90 forbids mixed declarations and code");
10988 *anchor = sub_statement;
10990 while (sub_statement->base.next != NULL)
10991 sub_statement = sub_statement->base.next;
10993 anchor = &sub_statement->base.next;
10997 /* look over all statements again to produce no effect warnings */
10998 if (warning.unused_value) {
10999 statement_t *sub_statement = statement->compound.statements;
11000 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
11001 if (sub_statement->kind != STATEMENT_EXPRESSION)
11003 /* don't emit a warning for the last expression in an expression
11004 * statement as it has always an effect */
11005 if (inside_expression_statement && sub_statement->base.next == NULL)
11008 expression_t *expression = sub_statement->expression.expression;
11009 if (!expression_has_effect(expression)) {
11010 warningf(&expression->base.source_position,
11011 "statement has no effect");
11017 rem_anchor_token(T_while);
11018 rem_anchor_token(T_wchar_t);
11019 rem_anchor_token(T_volatile);
11020 rem_anchor_token(T_void);
11021 rem_anchor_token(T_using);
11022 rem_anchor_token(T_unsigned);
11023 rem_anchor_token(T_union);
11024 rem_anchor_token(T_typeof);
11025 rem_anchor_token(T_typename);
11026 rem_anchor_token(T_typeid);
11027 rem_anchor_token(T_typedef);
11028 rem_anchor_token(T_try);
11029 rem_anchor_token(T_true);
11030 rem_anchor_token(T_throw);
11031 rem_anchor_token(T_this);
11032 rem_anchor_token(T_template);
11033 rem_anchor_token(T_switch);
11034 rem_anchor_token(T_struct);
11035 rem_anchor_token(T_static_cast);
11036 rem_anchor_token(T_static);
11037 rem_anchor_token(T_sizeof);
11038 rem_anchor_token(T_signed);
11039 rem_anchor_token(T_short);
11040 rem_anchor_token(T_return);
11041 rem_anchor_token(T_restrict);
11042 rem_anchor_token(T_reinterpret_cast);
11043 rem_anchor_token(T_register);
11044 rem_anchor_token(T_operator);
11045 rem_anchor_token(T_new);
11046 rem_anchor_token(T_long);
11047 rem_anchor_token(T_int);
11048 rem_anchor_token(T_inline);
11049 rem_anchor_token(T_if);
11050 rem_anchor_token(T_goto);
11051 rem_anchor_token(T_for);
11052 rem_anchor_token(T_float);
11053 rem_anchor_token(T_false);
11054 rem_anchor_token(T_extern);
11055 rem_anchor_token(T_enum);
11056 rem_anchor_token(T_dynamic_cast);
11057 rem_anchor_token(T_do);
11058 rem_anchor_token(T_double);
11059 rem_anchor_token(T_delete);
11060 rem_anchor_token(T_default);
11061 rem_anchor_token(T_continue);
11062 rem_anchor_token(T_const_cast);
11063 rem_anchor_token(T_const);
11064 rem_anchor_token(T_class);
11065 rem_anchor_token(T_char);
11066 rem_anchor_token(T_case);
11067 rem_anchor_token(T_break);
11068 rem_anchor_token(T_bool);
11069 rem_anchor_token(T_auto);
11070 rem_anchor_token(T_asm);
11071 rem_anchor_token(T___thread);
11072 rem_anchor_token(T___real__);
11073 rem_anchor_token(T___label__);
11074 rem_anchor_token(T___imag__);
11075 rem_anchor_token(T___func__);
11076 rem_anchor_token(T___extension__);
11077 rem_anchor_token(T___builtin_va_start);
11078 rem_anchor_token(T___attribute__);
11079 rem_anchor_token(T___alignof__);
11080 rem_anchor_token(T___PRETTY_FUNCTION__);
11081 rem_anchor_token(T___FUNCTION__);
11082 rem_anchor_token(T__Imaginary);
11083 rem_anchor_token(T__Complex);
11084 rem_anchor_token(T__Bool);
11085 rem_anchor_token(T_WIDE_STRING_LITERAL);
11086 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
11087 rem_anchor_token(T_STRING_LITERAL);
11088 rem_anchor_token(T_PLUSPLUS);
11089 rem_anchor_token(T_MINUSMINUS);
11090 rem_anchor_token(T_INTEGER);
11091 rem_anchor_token(T_IDENTIFIER);
11092 rem_anchor_token(T_FLOATINGPOINT);
11093 rem_anchor_token(T_COLONCOLON);
11094 rem_anchor_token(T_CHARACTER_CONSTANT);
11095 rem_anchor_token('~');
11096 rem_anchor_token('{');
11097 rem_anchor_token('-');
11098 rem_anchor_token('+');
11099 rem_anchor_token('*');
11100 rem_anchor_token('(');
11101 rem_anchor_token('&');
11102 rem_anchor_token('!');
11103 rem_anchor_token('}');
11104 assert(current_scope == &statement->compound.scope);
11105 scope_pop(old_scope);
11106 environment_pop_to(top);
11113 * Check for unused global static functions and variables
11115 static void check_unused_globals(void)
11117 if (!warning.unused_function && !warning.unused_variable)
11120 for (const entity_t *entity = file_scope->entities; entity != NULL;
11121 entity = entity->base.next) {
11122 if (!is_declaration(entity))
11125 const declaration_t *declaration = &entity->declaration;
11126 if (declaration->used ||
11127 declaration->modifiers & DM_UNUSED ||
11128 declaration->modifiers & DM_USED ||
11129 declaration->storage_class != STORAGE_CLASS_STATIC)
11132 type_t *const type = declaration->type;
11134 if (entity->kind == ENTITY_FUNCTION) {
11135 /* inhibit warning for static inline functions */
11136 if (entity->function.is_inline)
11139 s = entity->function.statement != NULL ? "defined" : "declared";
11144 warningf(&declaration->base.source_position, "'%#T' %s but not used",
11145 type, declaration->base.symbol, s);
11149 static void parse_global_asm(void)
11151 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
11154 expect('(', end_error);
11156 statement->asms.asm_text = parse_string_literals();
11157 statement->base.next = unit->global_asm;
11158 unit->global_asm = statement;
11160 expect(')', end_error);
11161 expect(';', end_error);
11166 static void parse_linkage_specification(void)
11169 assert(token.type == T_STRING_LITERAL);
11171 const char *linkage = parse_string_literals().begin;
11173 linkage_kind_t old_linkage = current_linkage;
11174 linkage_kind_t new_linkage;
11175 if (strcmp(linkage, "C") == 0) {
11176 new_linkage = LINKAGE_C;
11177 } else if (strcmp(linkage, "C++") == 0) {
11178 new_linkage = LINKAGE_CXX;
11180 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
11181 new_linkage = LINKAGE_INVALID;
11183 current_linkage = new_linkage;
11185 if (token.type == '{') {
11188 expect('}', end_error);
11194 assert(current_linkage == new_linkage);
11195 current_linkage = old_linkage;
11198 static void parse_external(void)
11200 switch (token.type) {
11201 DECLARATION_START_NO_EXTERN
11203 case T___extension__:
11204 /* tokens below are for implicit int */
11205 case '&': /* & x; -> int& x; (and error later, because C++ has no
11207 case '*': /* * x; -> int* x; */
11208 case '(': /* (x); -> int (x); */
11209 parse_external_declaration();
11213 if (look_ahead(1)->type == T_STRING_LITERAL) {
11214 parse_linkage_specification();
11216 parse_external_declaration();
11221 parse_global_asm();
11225 parse_namespace_definition();
11229 if (!strict_mode) {
11231 warningf(HERE, "stray ';' outside of function");
11238 errorf(HERE, "stray %K outside of function", &token);
11239 if (token.type == '(' || token.type == '{' || token.type == '[')
11240 eat_until_matching_token(token.type);
11246 static void parse_externals(void)
11248 add_anchor_token('}');
11249 add_anchor_token(T_EOF);
11252 unsigned char token_anchor_copy[T_LAST_TOKEN];
11253 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
11256 while (token.type != T_EOF && token.type != '}') {
11258 bool anchor_leak = false;
11259 for (int i = 0; i != T_LAST_TOKEN; ++i) {
11260 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
11262 errorf(HERE, "Leaked anchor token %k %d times", i, count);
11263 anchor_leak = true;
11266 if (in_gcc_extension) {
11267 errorf(HERE, "Leaked __extension__");
11268 anchor_leak = true;
11278 rem_anchor_token(T_EOF);
11279 rem_anchor_token('}');
11283 * Parse a translation unit.
11285 static void parse_translation_unit(void)
11287 add_anchor_token(T_EOF);
11292 if (token.type == T_EOF)
11295 errorf(HERE, "stray %K outside of function", &token);
11296 if (token.type == '(' || token.type == '{' || token.type == '[')
11297 eat_until_matching_token(token.type);
11305 * @return the translation unit or NULL if errors occurred.
11307 void start_parsing(void)
11309 environment_stack = NEW_ARR_F(stack_entry_t, 0);
11310 label_stack = NEW_ARR_F(stack_entry_t, 0);
11311 diagnostic_count = 0;
11315 type_set_output(stderr);
11316 ast_set_output(stderr);
11318 assert(unit == NULL);
11319 unit = allocate_ast_zero(sizeof(unit[0]));
11321 assert(file_scope == NULL);
11322 file_scope = &unit->scope;
11324 assert(current_scope == NULL);
11325 scope_push(&unit->scope);
11328 translation_unit_t *finish_parsing(void)
11330 assert(current_scope == &unit->scope);
11333 assert(file_scope == &unit->scope);
11334 check_unused_globals();
11337 DEL_ARR_F(environment_stack);
11338 DEL_ARR_F(label_stack);
11340 translation_unit_t *result = unit;
11345 /* GCC allows global arrays without size and assigns them a length of one,
11346 * if no different declaration follows */
11347 static void complete_incomplete_arrays(void)
11349 size_t n = ARR_LEN(incomplete_arrays);
11350 for (size_t i = 0; i != n; ++i) {
11351 declaration_t *const decl = incomplete_arrays[i];
11352 type_t *const orig_type = decl->type;
11353 type_t *const type = skip_typeref(orig_type);
11355 if (!is_type_incomplete(type))
11358 if (warning.other) {
11359 warningf(&decl->base.source_position,
11360 "array '%#T' assumed to have one element",
11361 orig_type, decl->base.symbol);
11364 type_t *const new_type = duplicate_type(type);
11365 new_type->array.size_constant = true;
11366 new_type->array.has_implicit_size = true;
11367 new_type->array.size = 1;
11369 type_t *const result = typehash_insert(new_type);
11370 if (type != result)
11373 decl->type = result;
11379 lookahead_bufpos = 0;
11380 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
11383 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
11384 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
11385 parse_translation_unit();
11386 complete_incomplete_arrays();
11387 DEL_ARR_F(incomplete_arrays);
11388 incomplete_arrays = NULL;
11392 * Initialize the parser.
11394 void init_parser(void)
11396 sym_anonymous = symbol_table_insert("<anonymous>");
11398 if (c_mode & _MS) {
11399 /* add predefined symbols for extended-decl-modifier */
11400 sym_align = symbol_table_insert("align");
11401 sym_allocate = symbol_table_insert("allocate");
11402 sym_dllimport = symbol_table_insert("dllimport");
11403 sym_dllexport = symbol_table_insert("dllexport");
11404 sym_naked = symbol_table_insert("naked");
11405 sym_noinline = symbol_table_insert("noinline");
11406 sym_returns_twice = symbol_table_insert("returns_twice");
11407 sym_noreturn = symbol_table_insert("noreturn");
11408 sym_nothrow = symbol_table_insert("nothrow");
11409 sym_novtable = symbol_table_insert("novtable");
11410 sym_property = symbol_table_insert("property");
11411 sym_get = symbol_table_insert("get");
11412 sym_put = symbol_table_insert("put");
11413 sym_selectany = symbol_table_insert("selectany");
11414 sym_thread = symbol_table_insert("thread");
11415 sym_uuid = symbol_table_insert("uuid");
11416 sym_deprecated = symbol_table_insert("deprecated");
11417 sym_restrict = symbol_table_insert("restrict");
11418 sym_noalias = symbol_table_insert("noalias");
11420 memset(token_anchor_set, 0, sizeof(token_anchor_set));
11422 init_expression_parsers();
11423 obstack_init(&temp_obst);
11425 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
11426 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
11430 * Terminate the parser.
11432 void exit_parser(void)
11434 obstack_free(&temp_obst, NULL);