2 * This file is part of cparser.
3 * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "lang_features.h"
38 #include "walk_statements.h"
40 #include "adt/bitfiddle.h"
41 #include "adt/error.h"
42 #include "adt/array.h"
44 //#define PRINT_TOKENS
45 #define MAX_LOOKAHEAD 1
50 entity_namespace_t namespc;
53 typedef struct argument_list_t argument_list_t;
54 struct argument_list_t {
56 argument_list_t *next;
59 typedef struct gnu_attribute_t gnu_attribute_t;
60 struct gnu_attribute_t {
61 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
62 gnu_attribute_t *next;
63 bool invalid; /**< Set if this attribute had argument errors, */
64 bool has_arguments; /**< True, if this attribute has arguments. */
69 long argument; /**< Single argument. */
70 argument_list_t *arguments; /**< List of argument expressions. */
74 typedef struct declaration_specifiers_t declaration_specifiers_t;
75 struct declaration_specifiers_t {
76 source_position_t source_position;
77 storage_class_t storage_class;
78 unsigned char alignment; /**< Alignment, 0 if not set. */
80 bool thread_local : 1; /**< GCC __thread */
82 decl_modifiers_t modifiers; /**< declaration modifiers */
83 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
84 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
85 symbol_t *get_property_sym; /**< the name of the get property if set. */
86 symbol_t *put_property_sym; /**< the name of the put property if set. */
91 * An environment for parsing initializers (and compound literals).
93 typedef struct parse_initializer_env_t {
94 type_t *type; /**< the type of the initializer. In case of an
95 array type with unspecified size this gets
96 adjusted to the actual size. */
97 entity_t *entity; /**< the variable that is initialized if any */
98 bool must_be_constant;
99 } parse_initializer_env_t;
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 size_t 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 static void create_gnu_builtins(void);
210 static void create_microsoft_intrinsics(void);
212 #define STORAGE_CLASSES \
213 STORAGE_CLASSES_NO_EXTERN \
216 #define STORAGE_CLASSES_NO_EXTERN \
223 #define TYPE_QUALIFIERS \
228 case T__forceinline: \
229 case T___attribute__:
231 #define COMPLEX_SPECIFIERS \
233 #define IMAGINARY_SPECIFIERS \
236 #define TYPE_SPECIFIERS \
238 case T___builtin_va_list: \
258 #define DECLARATION_START \
263 #define DECLARATION_START_NO_EXTERN \
264 STORAGE_CLASSES_NO_EXTERN \
268 #define TYPENAME_START \
272 #define EXPRESSION_START \
281 case T_CHARACTER_CONSTANT: \
282 case T_FLOATINGPOINT: \
286 case T_STRING_LITERAL: \
287 case T_WIDE_CHARACTER_CONSTANT: \
288 case T_WIDE_STRING_LITERAL: \
289 case T___FUNCDNAME__: \
290 case T___FUNCSIG__: \
291 case T___FUNCTION__: \
292 case T___PRETTY_FUNCTION__: \
293 case T___alignof__: \
294 case T___builtin_classify_type: \
295 case T___builtin_constant_p: \
296 case T___builtin_isgreater: \
297 case T___builtin_isgreaterequal: \
298 case T___builtin_isless: \
299 case T___builtin_islessequal: \
300 case T___builtin_islessgreater: \
301 case T___builtin_isunordered: \
302 case T___builtin_offsetof: \
303 case T___builtin_va_arg: \
304 case T___builtin_va_start: \
315 * Allocate an AST node with given size and
316 * initialize all fields with zero.
318 static void *allocate_ast_zero(size_t size)
320 void *res = allocate_ast(size);
321 memset(res, 0, size);
326 * Returns the size of an entity node.
328 * @param kind the entity kind
330 static size_t get_entity_struct_size(entity_kind_t kind)
332 static const size_t sizes[] = {
333 [ENTITY_VARIABLE] = sizeof(variable_t),
334 [ENTITY_PARAMETER] = sizeof(parameter_t),
335 [ENTITY_COMPOUND_MEMBER] = sizeof(compound_member_t),
336 [ENTITY_FUNCTION] = sizeof(function_t),
337 [ENTITY_TYPEDEF] = sizeof(typedef_t),
338 [ENTITY_STRUCT] = sizeof(compound_t),
339 [ENTITY_UNION] = sizeof(compound_t),
340 [ENTITY_ENUM] = sizeof(enum_t),
341 [ENTITY_ENUM_VALUE] = sizeof(enum_value_t),
342 [ENTITY_LABEL] = sizeof(label_t),
343 [ENTITY_LOCAL_LABEL] = sizeof(label_t),
344 [ENTITY_NAMESPACE] = sizeof(namespace_t)
346 assert(kind < lengthof(sizes));
347 assert(sizes[kind] != 0);
352 * Allocate an entity of given kind and initialize all
355 static entity_t *allocate_entity_zero(entity_kind_t kind)
357 size_t size = get_entity_struct_size(kind);
358 entity_t *entity = allocate_ast_zero(size);
364 * Returns the size of a statement node.
366 * @param kind the statement kind
368 static size_t get_statement_struct_size(statement_kind_t kind)
370 static const size_t sizes[] = {
371 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
372 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
373 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
374 [STATEMENT_RETURN] = sizeof(return_statement_t),
375 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
376 [STATEMENT_IF] = sizeof(if_statement_t),
377 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
378 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
379 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
380 [STATEMENT_BREAK] = sizeof(statement_base_t),
381 [STATEMENT_GOTO] = sizeof(goto_statement_t),
382 [STATEMENT_LABEL] = sizeof(label_statement_t),
383 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
384 [STATEMENT_WHILE] = sizeof(while_statement_t),
385 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
386 [STATEMENT_FOR] = sizeof(for_statement_t),
387 [STATEMENT_ASM] = sizeof(asm_statement_t),
388 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
389 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
391 assert(kind < lengthof(sizes));
392 assert(sizes[kind] != 0);
397 * Returns the size of an expression node.
399 * @param kind the expression kind
401 static size_t get_expression_struct_size(expression_kind_t kind)
403 static const size_t sizes[] = {
404 [EXPR_INVALID] = sizeof(expression_base_t),
405 [EXPR_REFERENCE] = sizeof(reference_expression_t),
406 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
407 [EXPR_CONST] = sizeof(const_expression_t),
408 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
409 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
410 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
411 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
412 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
413 [EXPR_CALL] = sizeof(call_expression_t),
414 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
415 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
416 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
417 [EXPR_SELECT] = sizeof(select_expression_t),
418 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
419 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
420 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
421 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
422 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
423 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
424 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
425 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
426 [EXPR_VA_START] = sizeof(va_start_expression_t),
427 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
428 [EXPR_STATEMENT] = sizeof(statement_expression_t),
429 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
431 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
432 return sizes[EXPR_UNARY_FIRST];
434 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
435 return sizes[EXPR_BINARY_FIRST];
437 assert(kind < lengthof(sizes));
438 assert(sizes[kind] != 0);
443 * Allocate a statement node of given kind and initialize all
444 * fields with zero. Sets its source position to the position
445 * of the current token.
447 static statement_t *allocate_statement_zero(statement_kind_t kind)
449 size_t size = get_statement_struct_size(kind);
450 statement_t *res = allocate_ast_zero(size);
452 res->base.kind = kind;
453 res->base.parent = current_parent;
454 res->base.source_position = token.source_position;
459 * Allocate an expression node of given kind and initialize all
462 static expression_t *allocate_expression_zero(expression_kind_t kind)
464 size_t size = get_expression_struct_size(kind);
465 expression_t *res = allocate_ast_zero(size);
467 res->base.kind = kind;
468 res->base.type = type_error_type;
469 res->base.source_position = token.source_position;
474 * Creates a new invalid expression at the source position
475 * of the current token.
477 static expression_t *create_invalid_expression(void)
479 return allocate_expression_zero(EXPR_INVALID);
483 * Creates a new invalid statement.
485 static statement_t *create_invalid_statement(void)
487 return allocate_statement_zero(STATEMENT_INVALID);
491 * Allocate a new empty statement.
493 static statement_t *create_empty_statement(void)
495 return allocate_statement_zero(STATEMENT_EMPTY);
499 * Returns the size of a type node.
501 * @param kind the type kind
503 static size_t get_type_struct_size(type_kind_t kind)
505 static const size_t sizes[] = {
506 [TYPE_ATOMIC] = sizeof(atomic_type_t),
507 [TYPE_COMPLEX] = sizeof(complex_type_t),
508 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
509 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
510 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
511 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
512 [TYPE_ENUM] = sizeof(enum_type_t),
513 [TYPE_FUNCTION] = sizeof(function_type_t),
514 [TYPE_POINTER] = sizeof(pointer_type_t),
515 [TYPE_ARRAY] = sizeof(array_type_t),
516 [TYPE_BUILTIN] = sizeof(builtin_type_t),
517 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
518 [TYPE_TYPEOF] = sizeof(typeof_type_t),
520 assert(lengthof(sizes) == (int)TYPE_TYPEOF + 1);
521 assert(kind <= TYPE_TYPEOF);
522 assert(sizes[kind] != 0);
527 * Allocate a type node of given kind and initialize all
530 * @param kind type kind to allocate
532 static type_t *allocate_type_zero(type_kind_t kind)
534 size_t size = get_type_struct_size(kind);
535 type_t *res = obstack_alloc(type_obst, size);
536 memset(res, 0, size);
537 res->base.kind = kind;
543 * Returns the size of an initializer node.
545 * @param kind the initializer kind
547 static size_t get_initializer_size(initializer_kind_t kind)
549 static const size_t sizes[] = {
550 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
551 [INITIALIZER_STRING] = sizeof(initializer_string_t),
552 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
553 [INITIALIZER_LIST] = sizeof(initializer_list_t),
554 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
556 assert(kind < lengthof(sizes));
557 assert(sizes[kind] != 0);
562 * Allocate an initializer node of given kind and initialize all
565 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
567 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
574 * Returns the index of the top element of the environment stack.
576 static size_t environment_top(void)
578 return ARR_LEN(environment_stack);
582 * Returns the index of the top element of the global label stack.
584 static size_t label_top(void)
586 return ARR_LEN(label_stack);
590 * Return the next token.
592 static inline void next_token(void)
594 token = lookahead_buffer[lookahead_bufpos];
595 lookahead_buffer[lookahead_bufpos] = lexer_token;
598 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
601 print_token(stderr, &token);
602 fprintf(stderr, "\n");
607 * Return the next token with a given lookahead.
609 static inline const token_t *look_ahead(size_t num)
611 assert(0 < num && num <= MAX_LOOKAHEAD);
612 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
613 return &lookahead_buffer[pos];
617 * Adds a token type to the token type anchor set (a multi-set).
619 static void add_anchor_token(int token_type)
621 assert(0 <= token_type && token_type < T_LAST_TOKEN);
622 ++token_anchor_set[token_type];
626 * Set the number of tokens types of the given type
627 * to zero and return the old count.
629 static int save_and_reset_anchor_state(int token_type)
631 assert(0 <= token_type && token_type < T_LAST_TOKEN);
632 int count = token_anchor_set[token_type];
633 token_anchor_set[token_type] = 0;
638 * Restore the number of token types to the given count.
640 static void restore_anchor_state(int token_type, int count)
642 assert(0 <= token_type && token_type < T_LAST_TOKEN);
643 token_anchor_set[token_type] = count;
647 * Remove a token type from the token type anchor set (a multi-set).
649 static void rem_anchor_token(int token_type)
651 assert(0 <= token_type && token_type < T_LAST_TOKEN);
652 assert(token_anchor_set[token_type] != 0);
653 --token_anchor_set[token_type];
657 * Return true if the token type of the current token is
660 static bool at_anchor(void)
664 return token_anchor_set[token.type];
668 * Eat tokens until a matching token type is found.
670 static void eat_until_matching_token(int type)
674 case '(': end_token = ')'; break;
675 case '{': end_token = '}'; break;
676 case '[': end_token = ']'; break;
677 default: end_token = type; break;
680 unsigned parenthesis_count = 0;
681 unsigned brace_count = 0;
682 unsigned bracket_count = 0;
683 while (token.type != end_token ||
684 parenthesis_count != 0 ||
686 bracket_count != 0) {
687 switch (token.type) {
689 case '(': ++parenthesis_count; break;
690 case '{': ++brace_count; break;
691 case '[': ++bracket_count; break;
694 if (parenthesis_count > 0)
704 if (bracket_count > 0)
707 if (token.type == end_token &&
708 parenthesis_count == 0 &&
722 * Eat input tokens until an anchor is found.
724 static void eat_until_anchor(void)
726 while (token_anchor_set[token.type] == 0) {
727 if (token.type == '(' || token.type == '{' || token.type == '[')
728 eat_until_matching_token(token.type);
734 * Eat a whole block from input tokens.
736 static void eat_block(void)
738 eat_until_matching_token('{');
739 if (token.type == '}')
743 #define eat(token_type) (assert(token.type == (token_type)), next_token())
746 * Report a parse error because an expected token was not found.
749 #if defined __GNUC__ && __GNUC__ >= 4
750 __attribute__((sentinel))
752 void parse_error_expected(const char *message, ...)
754 if (message != NULL) {
755 errorf(HERE, "%s", message);
758 va_start(ap, message);
759 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
764 * Report an incompatible type.
766 static void type_error_incompatible(const char *msg,
767 const source_position_t *source_position, type_t *type1, type_t *type2)
769 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
774 * Expect the current token is the expected token.
775 * If not, generate an error, eat the current statement,
776 * and goto the end_error label.
778 #define expect(expected, error_label) \
780 if (UNLIKELY(token.type != (expected))) { \
781 parse_error_expected(NULL, (expected), NULL); \
782 add_anchor_token(expected); \
783 eat_until_anchor(); \
784 if (token.type == expected) \
786 rem_anchor_token(expected); \
793 * Push a given scope on the scope stack and make it the
796 static scope_t *scope_push(scope_t *new_scope)
798 if (current_scope != NULL) {
799 new_scope->depth = current_scope->depth + 1;
802 scope_t *old_scope = current_scope;
803 current_scope = new_scope;
808 * Pop the current scope from the scope stack.
810 static void scope_pop(scope_t *old_scope)
812 current_scope = old_scope;
816 * Search an entity by its symbol in a given namespace.
818 static entity_t *get_entity(const symbol_t *const symbol,
819 namespace_tag_t namespc)
821 entity_t *entity = symbol->entity;
822 for (; entity != NULL; entity = entity->base.symbol_next) {
823 if (entity->base.namespc == namespc)
831 * pushs an entity on the environment stack and links the corresponding symbol
834 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
836 symbol_t *symbol = entity->base.symbol;
837 entity_namespace_t namespc = entity->base.namespc;
838 assert(namespc != NAMESPACE_INVALID);
840 /* replace/add entity into entity list of the symbol */
843 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
848 /* replace an entry? */
849 if (iter->base.namespc == namespc) {
850 entity->base.symbol_next = iter->base.symbol_next;
856 /* remember old declaration */
858 entry.symbol = symbol;
859 entry.old_entity = iter;
860 entry.namespc = namespc;
861 ARR_APP1(stack_entry_t, *stack_ptr, entry);
865 * Push an entity on the environment stack.
867 static void environment_push(entity_t *entity)
869 assert(entity->base.source_position.input_name != NULL);
870 assert(entity->base.parent_scope != NULL);
871 stack_push(&environment_stack, entity);
875 * Push a declaration on the global label stack.
877 * @param declaration the declaration
879 static void label_push(entity_t *label)
881 /* we abuse the parameters scope as parent for the labels */
882 label->base.parent_scope = ¤t_function->parameters;
883 stack_push(&label_stack, label);
887 * pops symbols from the environment stack until @p new_top is the top element
889 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
891 stack_entry_t *stack = *stack_ptr;
892 size_t top = ARR_LEN(stack);
895 assert(new_top <= top);
899 for (i = top; i > new_top; --i) {
900 stack_entry_t *entry = &stack[i - 1];
902 entity_t *old_entity = entry->old_entity;
903 symbol_t *symbol = entry->symbol;
904 entity_namespace_t namespc = entry->namespc;
906 /* replace with old_entity/remove */
909 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
911 assert(iter != NULL);
912 /* replace an entry? */
913 if (iter->base.namespc == namespc)
917 /* restore definition from outer scopes (if there was one) */
918 if (old_entity != NULL) {
919 old_entity->base.symbol_next = iter->base.symbol_next;
920 *anchor = old_entity;
922 /* remove entry from list */
923 *anchor = iter->base.symbol_next;
927 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
931 * Pop all entries from the environment stack until the new_top
934 * @param new_top the new stack top
936 static void environment_pop_to(size_t new_top)
938 stack_pop_to(&environment_stack, new_top);
942 * Pop all entries from the global label stack until the new_top
945 * @param new_top the new stack top
947 static void label_pop_to(size_t new_top)
949 stack_pop_to(&label_stack, new_top);
952 static int get_akind_rank(atomic_type_kind_t akind)
958 * Return the type rank for an atomic type.
960 static int get_rank(const type_t *type)
962 assert(!is_typeref(type));
963 if (type->kind == TYPE_ENUM)
964 return get_akind_rank(type->enumt.akind);
966 assert(type->kind == TYPE_ATOMIC);
967 return get_akind_rank(type->atomic.akind);
971 * Do integer promotion for a given type.
973 * @param type the type to promote
974 * @return the promoted type
976 static type_t *promote_integer(type_t *type)
978 if (type->kind == TYPE_BITFIELD)
979 type = type->bitfield.base_type;
981 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
988 * Create a cast expression.
990 * @param expression the expression to cast
991 * @param dest_type the destination type
993 static expression_t *create_cast_expression(expression_t *expression,
996 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
998 cast->unary.value = expression;
999 cast->base.type = dest_type;
1005 * Check if a given expression represents a null pointer constant.
1007 * @param expression the expression to check
1009 static bool is_null_pointer_constant(const expression_t *expression)
1011 /* skip void* cast */
1012 if (expression->kind == EXPR_UNARY_CAST ||
1013 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
1014 type_t *const type = skip_typeref(expression->base.type);
1015 if (types_compatible(type, type_void_ptr))
1016 expression = expression->unary.value;
1019 type_t *const type = skip_typeref(expression->base.type);
1021 is_type_integer(type) &&
1022 is_constant_expression(expression) &&
1023 fold_constant(expression) == 0;
1027 * Create an implicit cast expression.
1029 * @param expression the expression to cast
1030 * @param dest_type the destination type
1032 static expression_t *create_implicit_cast(expression_t *expression,
1035 type_t *const source_type = expression->base.type;
1037 if (source_type == dest_type)
1040 return create_cast_expression(expression, dest_type);
1043 typedef enum assign_error_t {
1045 ASSIGN_ERROR_INCOMPATIBLE,
1046 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
1047 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
1048 ASSIGN_WARNING_POINTER_FROM_INT,
1049 ASSIGN_WARNING_INT_FROM_POINTER
1052 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
1053 const expression_t *const right,
1054 const char *context,
1055 const source_position_t *source_position)
1057 type_t *const orig_type_right = right->base.type;
1058 type_t *const type_left = skip_typeref(orig_type_left);
1059 type_t *const type_right = skip_typeref(orig_type_right);
1062 case ASSIGN_SUCCESS:
1064 case ASSIGN_ERROR_INCOMPATIBLE:
1065 errorf(source_position,
1066 "destination type '%T' in %s is incompatible with type '%T'",
1067 orig_type_left, context, orig_type_right);
1070 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1071 if (warning.other) {
1072 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
1073 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
1075 /* the left type has all qualifiers from the right type */
1076 unsigned missing_qualifiers
1077 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1078 warningf(source_position,
1079 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1080 orig_type_left, context, orig_type_right, missing_qualifiers);
1085 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1086 if (warning.other) {
1087 warningf(source_position,
1088 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1089 orig_type_left, context, right, orig_type_right);
1093 case ASSIGN_WARNING_POINTER_FROM_INT:
1094 if (warning.other) {
1095 warningf(source_position,
1096 "%s makes pointer '%T' from integer '%T' without a cast",
1097 context, orig_type_left, orig_type_right);
1101 case ASSIGN_WARNING_INT_FROM_POINTER:
1102 if (warning.other) {
1103 warningf(source_position,
1104 "%s makes integer '%T' from pointer '%T' without a cast",
1105 context, orig_type_left, orig_type_right);
1110 panic("invalid error value");
1114 /** Implements the rules from §6.5.16.1 */
1115 static assign_error_t semantic_assign(type_t *orig_type_left,
1116 const expression_t *const right)
1118 type_t *const orig_type_right = right->base.type;
1119 type_t *const type_left = skip_typeref(orig_type_left);
1120 type_t *const type_right = skip_typeref(orig_type_right);
1122 if (is_type_pointer(type_left)) {
1123 if (is_null_pointer_constant(right)) {
1124 return ASSIGN_SUCCESS;
1125 } else if (is_type_pointer(type_right)) {
1126 type_t *points_to_left
1127 = skip_typeref(type_left->pointer.points_to);
1128 type_t *points_to_right
1129 = skip_typeref(type_right->pointer.points_to);
1130 assign_error_t res = ASSIGN_SUCCESS;
1132 /* the left type has all qualifiers from the right type */
1133 unsigned missing_qualifiers
1134 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1135 if (missing_qualifiers != 0) {
1136 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1139 points_to_left = get_unqualified_type(points_to_left);
1140 points_to_right = get_unqualified_type(points_to_right);
1142 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1145 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1146 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1147 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1150 if (!types_compatible(points_to_left, points_to_right)) {
1151 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1155 } else if (is_type_integer(type_right)) {
1156 return ASSIGN_WARNING_POINTER_FROM_INT;
1158 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1159 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1160 && is_type_pointer(type_right))) {
1161 return ASSIGN_SUCCESS;
1162 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1163 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1164 type_t *const unqual_type_left = get_unqualified_type(type_left);
1165 type_t *const unqual_type_right = get_unqualified_type(type_right);
1166 if (types_compatible(unqual_type_left, unqual_type_right)) {
1167 return ASSIGN_SUCCESS;
1169 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1170 return ASSIGN_WARNING_INT_FROM_POINTER;
1173 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1174 return ASSIGN_SUCCESS;
1176 return ASSIGN_ERROR_INCOMPATIBLE;
1179 static expression_t *parse_constant_expression(void)
1181 expression_t *result = parse_sub_expression(PREC_CONDITIONAL);
1183 if (!is_constant_expression(result)) {
1184 errorf(&result->base.source_position,
1185 "expression '%E' is not constant", result);
1191 static expression_t *parse_assignment_expression(void)
1193 return parse_sub_expression(PREC_ASSIGNMENT);
1196 static string_t parse_string_literals(void)
1198 assert(token.type == T_STRING_LITERAL);
1199 string_t result = token.v.string;
1203 while (token.type == T_STRING_LITERAL) {
1204 result = concat_strings(&result, &token.v.string);
1211 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1212 [GNU_AK_CONST] = "const",
1213 [GNU_AK_VOLATILE] = "volatile",
1214 [GNU_AK_CDECL] = "cdecl",
1215 [GNU_AK_STDCALL] = "stdcall",
1216 [GNU_AK_FASTCALL] = "fastcall",
1217 [GNU_AK_DEPRECATED] = "deprecated",
1218 [GNU_AK_NOINLINE] = "noinline",
1219 [GNU_AK_RETURNS_TWICE] = "returns_twice",
1220 [GNU_AK_NORETURN] = "noreturn",
1221 [GNU_AK_NAKED] = "naked",
1222 [GNU_AK_PURE] = "pure",
1223 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1224 [GNU_AK_MALLOC] = "malloc",
1225 [GNU_AK_WEAK] = "weak",
1226 [GNU_AK_CONSTRUCTOR] = "constructor",
1227 [GNU_AK_DESTRUCTOR] = "destructor",
1228 [GNU_AK_NOTHROW] = "nothrow",
1229 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1230 [GNU_AK_COMMON] = "common",
1231 [GNU_AK_NOCOMMON] = "nocommon",
1232 [GNU_AK_PACKED] = "packed",
1233 [GNU_AK_SHARED] = "shared",
1234 [GNU_AK_NOTSHARED] = "notshared",
1235 [GNU_AK_USED] = "used",
1236 [GNU_AK_UNUSED] = "unused",
1237 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1238 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1239 [GNU_AK_LONGCALL] = "longcall",
1240 [GNU_AK_SHORTCALL] = "shortcall",
1241 [GNU_AK_LONG_CALL] = "long_call",
1242 [GNU_AK_SHORT_CALL] = "short_call",
1243 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1244 [GNU_AK_INTERRUPT] = "interrupt",
1245 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1246 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1247 [GNU_AK_NESTING] = "nesting",
1248 [GNU_AK_NEAR] = "near",
1249 [GNU_AK_FAR] = "far",
1250 [GNU_AK_SIGNAL] = "signal",
1251 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1252 [GNU_AK_TINY_DATA] = "tiny_data",
1253 [GNU_AK_SAVEALL] = "saveall",
1254 [GNU_AK_FLATTEN] = "flatten",
1255 [GNU_AK_SSEREGPARM] = "sseregparm",
1256 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1257 [GNU_AK_RETURN_TWICE] = "return_twice",
1258 [GNU_AK_MAY_ALIAS] = "may_alias",
1259 [GNU_AK_MS_STRUCT] = "ms_struct",
1260 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1261 [GNU_AK_DLLIMPORT] = "dllimport",
1262 [GNU_AK_DLLEXPORT] = "dllexport",
1263 [GNU_AK_ALIGNED] = "aligned",
1264 [GNU_AK_ALIAS] = "alias",
1265 [GNU_AK_SECTION] = "section",
1266 [GNU_AK_FORMAT] = "format",
1267 [GNU_AK_FORMAT_ARG] = "format_arg",
1268 [GNU_AK_WEAKREF] = "weakref",
1269 [GNU_AK_NONNULL] = "nonnull",
1270 [GNU_AK_TLS_MODEL] = "tls_model",
1271 [GNU_AK_VISIBILITY] = "visibility",
1272 [GNU_AK_REGPARM] = "regparm",
1273 [GNU_AK_MODE] = "mode",
1274 [GNU_AK_MODEL] = "model",
1275 [GNU_AK_TRAP_EXIT] = "trap_exit",
1276 [GNU_AK_SP_SWITCH] = "sp_switch",
1277 [GNU_AK_SENTINEL] = "sentinel"
1281 * compare two string, ignoring double underscores on the second.
1283 static int strcmp_underscore(const char *s1, const char *s2)
1285 if (s2[0] == '_' && s2[1] == '_') {
1286 size_t len2 = strlen(s2);
1287 size_t len1 = strlen(s1);
1288 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1289 return strncmp(s1, s2+2, len2-4);
1293 return strcmp(s1, s2);
1297 * Allocate a new gnu temporal attribute of given kind.
1299 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1301 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1302 attribute->kind = kind;
1303 attribute->next = NULL;
1304 attribute->invalid = false;
1305 attribute->has_arguments = false;
1311 * Parse one constant expression argument of the given attribute.
1313 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1315 expression_t *expression;
1316 add_anchor_token(')');
1317 expression = parse_constant_expression();
1318 rem_anchor_token(')');
1319 expect(')', end_error);
1320 attribute->u.argument = fold_constant(expression);
1323 attribute->invalid = true;
1327 * Parse a list of constant expressions arguments of the given attribute.
1329 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1331 argument_list_t **list = &attribute->u.arguments;
1332 argument_list_t *entry;
1333 expression_t *expression;
1334 add_anchor_token(')');
1335 add_anchor_token(',');
1337 expression = parse_constant_expression();
1338 entry = obstack_alloc(&temp_obst, sizeof(entry));
1339 entry->argument = fold_constant(expression);
1342 list = &entry->next;
1343 if (token.type != ',')
1347 rem_anchor_token(',');
1348 rem_anchor_token(')');
1349 expect(')', end_error);
1352 attribute->invalid = true;
1356 * Parse one string literal argument of the given attribute.
1358 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1361 add_anchor_token('(');
1362 if (token.type != T_STRING_LITERAL) {
1363 parse_error_expected("while parsing attribute directive",
1364 T_STRING_LITERAL, NULL);
1367 *string = parse_string_literals();
1368 rem_anchor_token('(');
1369 expect(')', end_error);
1372 attribute->invalid = true;
1376 * Parse one tls model of the given attribute.
1378 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1380 static const char *const tls_models[] = {
1386 string_t string = { NULL, 0 };
1387 parse_gnu_attribute_string_arg(attribute, &string);
1388 if (string.begin != NULL) {
1389 for (size_t i = 0; i < 4; ++i) {
1390 if (strcmp(tls_models[i], string.begin) == 0) {
1391 attribute->u.value = i;
1395 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1397 attribute->invalid = true;
1401 * Parse one tls model of the given attribute.
1403 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1405 static const char *const visibilities[] = {
1411 string_t string = { NULL, 0 };
1412 parse_gnu_attribute_string_arg(attribute, &string);
1413 if (string.begin != NULL) {
1414 for (size_t i = 0; i < 4; ++i) {
1415 if (strcmp(visibilities[i], string.begin) == 0) {
1416 attribute->u.value = i;
1420 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1422 attribute->invalid = true;
1426 * Parse one (code) model of the given attribute.
1428 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1430 static const char *const visibilities[] = {
1435 string_t string = { NULL, 0 };
1436 parse_gnu_attribute_string_arg(attribute, &string);
1437 if (string.begin != NULL) {
1438 for (int i = 0; i < 3; ++i) {
1439 if (strcmp(visibilities[i], string.begin) == 0) {
1440 attribute->u.value = i;
1444 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1446 attribute->invalid = true;
1450 * Parse one mode of the given attribute.
1452 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1454 add_anchor_token(')');
1456 if (token.type != T_IDENTIFIER) {
1457 expect(T_IDENTIFIER, end_error);
1460 attribute->u.symbol = token.v.symbol;
1463 rem_anchor_token(')');
1464 expect(')', end_error);
1467 attribute->invalid = true;
1471 * Parse one interrupt argument of the given attribute.
1473 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1475 static const char *const interrupts[] = {
1482 string_t string = { NULL, 0 };
1483 parse_gnu_attribute_string_arg(attribute, &string);
1484 if (string.begin != NULL) {
1485 for (size_t i = 0; i < 5; ++i) {
1486 if (strcmp(interrupts[i], string.begin) == 0) {
1487 attribute->u.value = i;
1491 errorf(HERE, "'%s' is not an interrupt", string.begin);
1493 attribute->invalid = true;
1497 * Parse ( identifier, const expression, const expression )
1499 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1501 static const char *const format_names[] = {
1509 if (token.type != T_IDENTIFIER) {
1510 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1513 const char *name = token.v.symbol->string;
1514 for (i = 0; i < 4; ++i) {
1515 if (strcmp_underscore(format_names[i], name) == 0)
1519 if (warning.attribute)
1520 warningf(HERE, "'%s' is an unrecognized format function type", name);
1524 expect(',', end_error);
1525 add_anchor_token(')');
1526 add_anchor_token(',');
1527 parse_constant_expression();
1528 rem_anchor_token(',');
1529 rem_anchor_token(')');
1531 expect(',', end_error);
1532 add_anchor_token(')');
1533 parse_constant_expression();
1534 rem_anchor_token(')');
1535 expect(')', end_error);
1538 attribute->u.value = true;
1542 * Check that a given GNU attribute has no arguments.
1544 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1546 if (!attribute->has_arguments)
1549 /* should have no arguments */
1550 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1551 eat_until_matching_token('(');
1552 /* we have already consumed '(', so we stop before ')', eat it */
1554 attribute->invalid = true;
1558 * Parse one GNU attribute.
1560 * Note that attribute names can be specified WITH or WITHOUT
1561 * double underscores, ie const or __const__.
1563 * The following attributes are parsed without arguments
1588 * no_instrument_function
1589 * warn_unused_result
1606 * externally_visible
1614 * The following attributes are parsed with arguments
1615 * aligned( const expression )
1616 * alias( string literal )
1617 * section( string literal )
1618 * format( identifier, const expression, const expression )
1619 * format_arg( const expression )
1620 * tls_model( string literal )
1621 * visibility( string literal )
1622 * regparm( const expression )
1623 * model( string leteral )
1624 * trap_exit( const expression )
1625 * sp_switch( string literal )
1627 * The following attributes might have arguments
1628 * weak_ref( string literal )
1629 * non_null( const expression // ',' )
1630 * interrupt( string literal )
1631 * sentinel( constant expression )
1633 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1635 gnu_attribute_t *head = *attributes;
1636 gnu_attribute_t *last = *attributes;
1637 decl_modifiers_t modifiers = 0;
1638 gnu_attribute_t *attribute;
1640 eat(T___attribute__);
1641 expect('(', end_error);
1642 expect('(', end_error);
1644 if (token.type != ')') {
1645 /* find the end of the list */
1647 while (last->next != NULL)
1651 /* non-empty attribute list */
1654 if (token.type == T_const) {
1656 } else if (token.type == T_volatile) {
1658 } else if (token.type == T_cdecl) {
1659 /* __attribute__((cdecl)), WITH ms mode */
1661 } else if (token.type == T_IDENTIFIER) {
1662 const symbol_t *sym = token.v.symbol;
1665 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1672 for (i = 0; i < GNU_AK_LAST; ++i) {
1673 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1676 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1679 if (kind == GNU_AK_LAST) {
1680 if (warning.attribute)
1681 warningf(HERE, "'%s' attribute directive ignored", name);
1683 /* skip possible arguments */
1684 if (token.type == '(') {
1685 eat_until_matching_token(')');
1688 /* check for arguments */
1689 attribute = allocate_gnu_attribute(kind);
1690 if (token.type == '(') {
1692 if (token.type == ')') {
1693 /* empty args are allowed */
1696 attribute->has_arguments = true;
1700 case GNU_AK_VOLATILE:
1705 case GNU_AK_NOCOMMON:
1707 case GNU_AK_NOTSHARED:
1708 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1709 case GNU_AK_WARN_UNUSED_RESULT:
1710 case GNU_AK_LONGCALL:
1711 case GNU_AK_SHORTCALL:
1712 case GNU_AK_LONG_CALL:
1713 case GNU_AK_SHORT_CALL:
1714 case GNU_AK_FUNCTION_VECTOR:
1715 case GNU_AK_INTERRUPT_HANDLER:
1716 case GNU_AK_NMI_HANDLER:
1717 case GNU_AK_NESTING:
1721 case GNU_AK_EIGTHBIT_DATA:
1722 case GNU_AK_TINY_DATA:
1723 case GNU_AK_SAVEALL:
1724 case GNU_AK_FLATTEN:
1725 case GNU_AK_SSEREGPARM:
1726 case GNU_AK_EXTERNALLY_VISIBLE:
1727 case GNU_AK_RETURN_TWICE:
1728 case GNU_AK_MAY_ALIAS:
1729 case GNU_AK_MS_STRUCT:
1730 case GNU_AK_GCC_STRUCT:
1733 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1734 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1735 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1736 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1737 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1738 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1739 case GNU_AK_CONST: modifiers |= DM_CONST; goto no_arg;
1740 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1741 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1742 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1743 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1744 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1745 case GNU_AK_RETURNS_TWICE: modifiers |= DM_RETURNS_TWICE; goto no_arg;
1746 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1747 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1748 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1749 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1750 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1751 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1753 case GNU_AK_ALIGNED:
1754 /* __align__ may be used without an argument */
1755 if (attribute->has_arguments) {
1756 parse_gnu_attribute_const_arg(attribute);
1760 case GNU_AK_FORMAT_ARG:
1761 case GNU_AK_REGPARM:
1762 case GNU_AK_TRAP_EXIT:
1763 if (!attribute->has_arguments) {
1764 /* should have arguments */
1765 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1766 attribute->invalid = true;
1768 parse_gnu_attribute_const_arg(attribute);
1771 case GNU_AK_SECTION:
1772 case GNU_AK_SP_SWITCH:
1773 if (!attribute->has_arguments) {
1774 /* should have arguments */
1775 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1776 attribute->invalid = true;
1778 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1781 if (!attribute->has_arguments) {
1782 /* should have arguments */
1783 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1784 attribute->invalid = true;
1786 parse_gnu_attribute_format_args(attribute);
1788 case GNU_AK_WEAKREF:
1789 /* may have one string argument */
1790 if (attribute->has_arguments)
1791 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1793 case GNU_AK_NONNULL:
1794 if (attribute->has_arguments)
1795 parse_gnu_attribute_const_arg_list(attribute);
1797 case GNU_AK_TLS_MODEL:
1798 if (!attribute->has_arguments) {
1799 /* should have arguments */
1800 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1802 parse_gnu_attribute_tls_model_arg(attribute);
1804 case GNU_AK_VISIBILITY:
1805 if (!attribute->has_arguments) {
1806 /* should have arguments */
1807 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1809 parse_gnu_attribute_visibility_arg(attribute);
1812 if (!attribute->has_arguments) {
1813 /* should have arguments */
1814 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1816 parse_gnu_attribute_model_arg(attribute);
1820 if (!attribute->has_arguments) {
1821 /* should have arguments */
1822 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1824 parse_gnu_attribute_mode_arg(attribute);
1827 case GNU_AK_INTERRUPT:
1828 /* may have one string argument */
1829 if (attribute->has_arguments)
1830 parse_gnu_attribute_interrupt_arg(attribute);
1832 case GNU_AK_SENTINEL:
1833 /* may have one string argument */
1834 if (attribute->has_arguments)
1835 parse_gnu_attribute_const_arg(attribute);
1838 /* already handled */
1842 check_no_argument(attribute, name);
1845 if (attribute != NULL) {
1847 last->next = attribute;
1850 head = last = attribute;
1854 if (token.type != ',')
1859 expect(')', end_error);
1860 expect(')', end_error);
1868 * Parse GNU attributes.
1870 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1872 decl_modifiers_t modifiers = 0;
1875 switch (token.type) {
1876 case T___attribute__:
1877 modifiers |= parse_gnu_attribute(attributes);
1882 expect('(', end_error);
1883 if (token.type != T_STRING_LITERAL) {
1884 parse_error_expected("while parsing assembler attribute",
1885 T_STRING_LITERAL, NULL);
1886 eat_until_matching_token('(');
1889 parse_string_literals();
1891 expect(')', end_error);
1894 case T_cdecl: modifiers |= DM_CDECL; break;
1895 case T__fastcall: modifiers |= DM_FASTCALL; break;
1896 case T__stdcall: modifiers |= DM_STDCALL; break;
1899 /* TODO record modifier */
1901 warningf(HERE, "Ignoring declaration modifier %K", &token);
1905 default: return modifiers;
1912 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1914 static entity_t *determine_lhs_ent(expression_t *const expr,
1917 switch (expr->kind) {
1918 case EXPR_REFERENCE: {
1919 entity_t *const entity = expr->reference.entity;
1920 /* we should only find variables as lvalues... */
1921 if (entity->base.kind != ENTITY_VARIABLE
1922 && entity->base.kind != ENTITY_PARAMETER)
1928 case EXPR_ARRAY_ACCESS: {
1929 expression_t *const ref = expr->array_access.array_ref;
1930 entity_t * ent = NULL;
1931 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1932 ent = determine_lhs_ent(ref, lhs_ent);
1935 mark_vars_read(expr->select.compound, lhs_ent);
1937 mark_vars_read(expr->array_access.index, lhs_ent);
1942 if (is_type_compound(skip_typeref(expr->base.type))) {
1943 return determine_lhs_ent(expr->select.compound, lhs_ent);
1945 mark_vars_read(expr->select.compound, lhs_ent);
1950 case EXPR_UNARY_DEREFERENCE: {
1951 expression_t *const val = expr->unary.value;
1952 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1954 return determine_lhs_ent(val->unary.value, lhs_ent);
1956 mark_vars_read(val, NULL);
1962 mark_vars_read(expr, NULL);
1967 #define ENT_ANY ((entity_t*)-1)
1970 * Mark declarations, which are read. This is used to detect variables, which
1974 * x is not marked as "read", because it is only read to calculate its own new
1978 * x and y are not detected as "not read", because multiple variables are
1981 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1983 switch (expr->kind) {
1984 case EXPR_REFERENCE: {
1985 entity_t *const entity = expr->reference.entity;
1986 if (entity->kind != ENTITY_VARIABLE
1987 && entity->kind != ENTITY_PARAMETER)
1990 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1991 if (entity->kind == ENTITY_VARIABLE) {
1992 entity->variable.read = true;
1994 entity->parameter.read = true;
2001 // TODO respect pure/const
2002 mark_vars_read(expr->call.function, NULL);
2003 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
2004 mark_vars_read(arg->expression, NULL);
2008 case EXPR_CONDITIONAL:
2009 // TODO lhs_decl should depend on whether true/false have an effect
2010 mark_vars_read(expr->conditional.condition, NULL);
2011 if (expr->conditional.true_expression != NULL)
2012 mark_vars_read(expr->conditional.true_expression, lhs_ent);
2013 mark_vars_read(expr->conditional.false_expression, lhs_ent);
2017 if (lhs_ent == ENT_ANY
2018 && !is_type_compound(skip_typeref(expr->base.type)))
2020 mark_vars_read(expr->select.compound, lhs_ent);
2023 case EXPR_ARRAY_ACCESS: {
2024 expression_t *const ref = expr->array_access.array_ref;
2025 mark_vars_read(ref, lhs_ent);
2026 lhs_ent = determine_lhs_ent(ref, lhs_ent);
2027 mark_vars_read(expr->array_access.index, lhs_ent);
2032 mark_vars_read(expr->va_arge.ap, lhs_ent);
2035 case EXPR_UNARY_CAST:
2036 /* Special case: Use void cast to mark a variable as "read" */
2037 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
2042 case EXPR_UNARY_THROW:
2043 if (expr->unary.value == NULL)
2046 case EXPR_UNARY_DEREFERENCE:
2047 case EXPR_UNARY_DELETE:
2048 case EXPR_UNARY_DELETE_ARRAY:
2049 if (lhs_ent == ENT_ANY)
2053 case EXPR_UNARY_NEGATE:
2054 case EXPR_UNARY_PLUS:
2055 case EXPR_UNARY_BITWISE_NEGATE:
2056 case EXPR_UNARY_NOT:
2057 case EXPR_UNARY_TAKE_ADDRESS:
2058 case EXPR_UNARY_POSTFIX_INCREMENT:
2059 case EXPR_UNARY_POSTFIX_DECREMENT:
2060 case EXPR_UNARY_PREFIX_INCREMENT:
2061 case EXPR_UNARY_PREFIX_DECREMENT:
2062 case EXPR_UNARY_CAST_IMPLICIT:
2063 case EXPR_UNARY_ASSUME:
2065 mark_vars_read(expr->unary.value, lhs_ent);
2068 case EXPR_BINARY_ADD:
2069 case EXPR_BINARY_SUB:
2070 case EXPR_BINARY_MUL:
2071 case EXPR_BINARY_DIV:
2072 case EXPR_BINARY_MOD:
2073 case EXPR_BINARY_EQUAL:
2074 case EXPR_BINARY_NOTEQUAL:
2075 case EXPR_BINARY_LESS:
2076 case EXPR_BINARY_LESSEQUAL:
2077 case EXPR_BINARY_GREATER:
2078 case EXPR_BINARY_GREATEREQUAL:
2079 case EXPR_BINARY_BITWISE_AND:
2080 case EXPR_BINARY_BITWISE_OR:
2081 case EXPR_BINARY_BITWISE_XOR:
2082 case EXPR_BINARY_LOGICAL_AND:
2083 case EXPR_BINARY_LOGICAL_OR:
2084 case EXPR_BINARY_SHIFTLEFT:
2085 case EXPR_BINARY_SHIFTRIGHT:
2086 case EXPR_BINARY_COMMA:
2087 case EXPR_BINARY_ISGREATER:
2088 case EXPR_BINARY_ISGREATEREQUAL:
2089 case EXPR_BINARY_ISLESS:
2090 case EXPR_BINARY_ISLESSEQUAL:
2091 case EXPR_BINARY_ISLESSGREATER:
2092 case EXPR_BINARY_ISUNORDERED:
2093 mark_vars_read(expr->binary.left, lhs_ent);
2094 mark_vars_read(expr->binary.right, lhs_ent);
2097 case EXPR_BINARY_ASSIGN:
2098 case EXPR_BINARY_MUL_ASSIGN:
2099 case EXPR_BINARY_DIV_ASSIGN:
2100 case EXPR_BINARY_MOD_ASSIGN:
2101 case EXPR_BINARY_ADD_ASSIGN:
2102 case EXPR_BINARY_SUB_ASSIGN:
2103 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2104 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2105 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2106 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2107 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
2108 if (lhs_ent == ENT_ANY)
2110 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
2111 mark_vars_read(expr->binary.right, lhs_ent);
2116 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
2122 case EXPR_CHARACTER_CONSTANT:
2123 case EXPR_WIDE_CHARACTER_CONSTANT:
2124 case EXPR_STRING_LITERAL:
2125 case EXPR_WIDE_STRING_LITERAL:
2126 case EXPR_COMPOUND_LITERAL: // TODO init?
2128 case EXPR_CLASSIFY_TYPE:
2131 case EXPR_BUILTIN_CONSTANT_P:
2132 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
2134 case EXPR_STATEMENT: // TODO
2135 case EXPR_LABEL_ADDRESS:
2136 case EXPR_REFERENCE_ENUM_VALUE:
2140 panic("unhandled expression");
2143 static designator_t *parse_designation(void)
2145 designator_t *result = NULL;
2146 designator_t *last = NULL;
2149 designator_t *designator;
2150 switch (token.type) {
2152 designator = allocate_ast_zero(sizeof(designator[0]));
2153 designator->source_position = token.source_position;
2155 add_anchor_token(']');
2156 designator->array_index = parse_constant_expression();
2157 rem_anchor_token(']');
2158 expect(']', end_error);
2161 designator = allocate_ast_zero(sizeof(designator[0]));
2162 designator->source_position = token.source_position;
2164 if (token.type != T_IDENTIFIER) {
2165 parse_error_expected("while parsing designator",
2166 T_IDENTIFIER, NULL);
2169 designator->symbol = token.v.symbol;
2173 expect('=', end_error);
2177 assert(designator != NULL);
2179 last->next = designator;
2181 result = designator;
2189 static initializer_t *initializer_from_string(array_type_t *type,
2190 const string_t *const string)
2192 /* TODO: check len vs. size of array type */
2195 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
2196 initializer->string.string = *string;
2201 static initializer_t *initializer_from_wide_string(array_type_t *const type,
2202 wide_string_t *const string)
2204 /* TODO: check len vs. size of array type */
2207 initializer_t *const initializer =
2208 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
2209 initializer->wide_string.string = *string;
2215 * Build an initializer from a given expression.
2217 static initializer_t *initializer_from_expression(type_t *orig_type,
2218 expression_t *expression)
2220 /* TODO check that expression is a constant expression */
2222 /* §6.7.8.14/15 char array may be initialized by string literals */
2223 type_t *type = skip_typeref(orig_type);
2224 type_t *expr_type_orig = expression->base.type;
2225 type_t *expr_type = skip_typeref(expr_type_orig);
2226 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
2227 array_type_t *const array_type = &type->array;
2228 type_t *const element_type = skip_typeref(array_type->element_type);
2230 if (element_type->kind == TYPE_ATOMIC) {
2231 atomic_type_kind_t akind = element_type->atomic.akind;
2232 switch (expression->kind) {
2233 case EXPR_STRING_LITERAL:
2234 if (akind == ATOMIC_TYPE_CHAR
2235 || akind == ATOMIC_TYPE_SCHAR
2236 || akind == ATOMIC_TYPE_UCHAR) {
2237 return initializer_from_string(array_type,
2238 &expression->string.value);
2242 case EXPR_WIDE_STRING_LITERAL: {
2243 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
2244 if (get_unqualified_type(element_type) == bare_wchar_type) {
2245 return initializer_from_wide_string(array_type,
2246 &expression->wide_string.value);
2257 assign_error_t error = semantic_assign(type, expression);
2258 if (error == ASSIGN_ERROR_INCOMPATIBLE)
2260 report_assign_error(error, type, expression, "initializer",
2261 &expression->base.source_position);
2263 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
2265 if (type->kind == TYPE_BITFIELD) {
2266 type = type->bitfield.base_type;
2269 result->value.value = create_implicit_cast(expression, type);
2275 * Checks if a given expression can be used as an constant initializer.
2277 static bool is_initializer_constant(const expression_t *expression)
2279 return is_constant_expression(expression)
2280 || is_address_constant(expression);
2284 * Parses an scalar initializer.
2286 * §6.7.8.11; eat {} without warning
2288 static initializer_t *parse_scalar_initializer(type_t *type,
2289 bool must_be_constant)
2291 /* there might be extra {} hierarchies */
2293 if (token.type == '{') {
2295 warningf(HERE, "extra curly braces around scalar initializer");
2299 } while (token.type == '{');
2302 expression_t *expression = parse_assignment_expression();
2303 mark_vars_read(expression, NULL);
2304 if (must_be_constant && !is_initializer_constant(expression)) {
2305 errorf(&expression->base.source_position,
2306 "Initialisation expression '%E' is not constant",
2310 initializer_t *initializer = initializer_from_expression(type, expression);
2312 if (initializer == NULL) {
2313 errorf(&expression->base.source_position,
2314 "expression '%E' (type '%T') doesn't match expected type '%T'",
2315 expression, expression->base.type, type);
2320 bool additional_warning_displayed = false;
2321 while (braces > 0) {
2322 if (token.type == ',') {
2325 if (token.type != '}') {
2326 if (!additional_warning_displayed && warning.other) {
2327 warningf(HERE, "additional elements in scalar initializer");
2328 additional_warning_displayed = true;
2339 * An entry in the type path.
2341 typedef struct type_path_entry_t type_path_entry_t;
2342 struct type_path_entry_t {
2343 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2345 size_t index; /**< For array types: the current index. */
2346 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2351 * A type path expression a position inside compound or array types.
2353 typedef struct type_path_t type_path_t;
2354 struct type_path_t {
2355 type_path_entry_t *path; /**< An flexible array containing the current path. */
2356 type_t *top_type; /**< type of the element the path points */
2357 size_t max_index; /**< largest index in outermost array */
2361 * Prints a type path for debugging.
2363 static __attribute__((unused)) void debug_print_type_path(
2364 const type_path_t *path)
2366 size_t len = ARR_LEN(path->path);
2368 for (size_t i = 0; i < len; ++i) {
2369 const type_path_entry_t *entry = & path->path[i];
2371 type_t *type = skip_typeref(entry->type);
2372 if (is_type_compound(type)) {
2373 /* in gcc mode structs can have no members */
2374 if (entry->v.compound_entry == NULL) {
2378 fprintf(stderr, ".%s",
2379 entry->v.compound_entry->base.symbol->string);
2380 } else if (is_type_array(type)) {
2381 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
2383 fprintf(stderr, "-INVALID-");
2386 if (path->top_type != NULL) {
2387 fprintf(stderr, " (");
2388 print_type(path->top_type);
2389 fprintf(stderr, ")");
2394 * Return the top type path entry, ie. in a path
2395 * (type).a.b returns the b.
2397 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2399 size_t len = ARR_LEN(path->path);
2401 return &path->path[len-1];
2405 * Enlarge the type path by an (empty) element.
2407 static type_path_entry_t *append_to_type_path(type_path_t *path)
2409 size_t len = ARR_LEN(path->path);
2410 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2412 type_path_entry_t *result = & path->path[len];
2413 memset(result, 0, sizeof(result[0]));
2418 * Descending into a sub-type. Enter the scope of the current top_type.
2420 static void descend_into_subtype(type_path_t *path)
2422 type_t *orig_top_type = path->top_type;
2423 type_t *top_type = skip_typeref(orig_top_type);
2425 type_path_entry_t *top = append_to_type_path(path);
2426 top->type = top_type;
2428 if (is_type_compound(top_type)) {
2429 compound_t *compound = top_type->compound.compound;
2430 entity_t *entry = compound->members.entities;
2432 if (entry != NULL) {
2433 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2434 top->v.compound_entry = &entry->declaration;
2435 path->top_type = entry->declaration.type;
2437 path->top_type = NULL;
2439 } else if (is_type_array(top_type)) {
2441 path->top_type = top_type->array.element_type;
2443 assert(!is_type_valid(top_type));
2448 * Pop an entry from the given type path, ie. returning from
2449 * (type).a.b to (type).a
2451 static void ascend_from_subtype(type_path_t *path)
2453 type_path_entry_t *top = get_type_path_top(path);
2455 path->top_type = top->type;
2457 size_t len = ARR_LEN(path->path);
2458 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2462 * Pop entries from the given type path until the given
2463 * path level is reached.
2465 static void ascend_to(type_path_t *path, size_t top_path_level)
2467 size_t len = ARR_LEN(path->path);
2469 while (len > top_path_level) {
2470 ascend_from_subtype(path);
2471 len = ARR_LEN(path->path);
2475 static bool walk_designator(type_path_t *path, const designator_t *designator,
2476 bool used_in_offsetof)
2478 for (; designator != NULL; designator = designator->next) {
2479 type_path_entry_t *top = get_type_path_top(path);
2480 type_t *orig_type = top->type;
2482 type_t *type = skip_typeref(orig_type);
2484 if (designator->symbol != NULL) {
2485 symbol_t *symbol = designator->symbol;
2486 if (!is_type_compound(type)) {
2487 if (is_type_valid(type)) {
2488 errorf(&designator->source_position,
2489 "'.%Y' designator used for non-compound type '%T'",
2493 top->type = type_error_type;
2494 top->v.compound_entry = NULL;
2495 orig_type = type_error_type;
2497 compound_t *compound = type->compound.compound;
2498 entity_t *iter = compound->members.entities;
2499 for (; iter != NULL; iter = iter->base.next) {
2500 if (iter->base.symbol == symbol) {
2505 errorf(&designator->source_position,
2506 "'%T' has no member named '%Y'", orig_type, symbol);
2509 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2510 if (used_in_offsetof) {
2511 type_t *real_type = skip_typeref(iter->declaration.type);
2512 if (real_type->kind == TYPE_BITFIELD) {
2513 errorf(&designator->source_position,
2514 "offsetof designator '%Y' may not specify bitfield",
2520 top->type = orig_type;
2521 top->v.compound_entry = &iter->declaration;
2522 orig_type = iter->declaration.type;
2525 expression_t *array_index = designator->array_index;
2526 assert(designator->array_index != NULL);
2528 if (!is_type_array(type)) {
2529 if (is_type_valid(type)) {
2530 errorf(&designator->source_position,
2531 "[%E] designator used for non-array type '%T'",
2532 array_index, orig_type);
2537 long index = fold_constant(array_index);
2538 if (!used_in_offsetof) {
2540 errorf(&designator->source_position,
2541 "array index [%E] must be positive", array_index);
2542 } else if (type->array.size_constant) {
2543 long array_size = type->array.size;
2544 if (index >= array_size) {
2545 errorf(&designator->source_position,
2546 "designator [%E] (%d) exceeds array size %d",
2547 array_index, index, array_size);
2552 top->type = orig_type;
2553 top->v.index = (size_t) index;
2554 orig_type = type->array.element_type;
2556 path->top_type = orig_type;
2558 if (designator->next != NULL) {
2559 descend_into_subtype(path);
2568 static void advance_current_object(type_path_t *path, size_t top_path_level)
2570 type_path_entry_t *top = get_type_path_top(path);
2572 type_t *type = skip_typeref(top->type);
2573 if (is_type_union(type)) {
2574 /* in unions only the first element is initialized */
2575 top->v.compound_entry = NULL;
2576 } else if (is_type_struct(type)) {
2577 declaration_t *entry = top->v.compound_entry;
2579 entity_t *next_entity = entry->base.next;
2580 if (next_entity != NULL) {
2581 assert(is_declaration(next_entity));
2582 entry = &next_entity->declaration;
2587 top->v.compound_entry = entry;
2588 if (entry != NULL) {
2589 path->top_type = entry->type;
2592 } else if (is_type_array(type)) {
2593 assert(is_type_array(type));
2597 if (!type->array.size_constant || top->v.index < type->array.size) {
2601 assert(!is_type_valid(type));
2605 /* we're past the last member of the current sub-aggregate, try if we
2606 * can ascend in the type hierarchy and continue with another subobject */
2607 size_t len = ARR_LEN(path->path);
2609 if (len > top_path_level) {
2610 ascend_from_subtype(path);
2611 advance_current_object(path, top_path_level);
2613 path->top_type = NULL;
2618 * skip until token is found.
2620 static void skip_until(int type)
2622 while (token.type != type) {
2623 if (token.type == T_EOF)
2630 * skip any {...} blocks until a closing bracket is reached.
2632 static void skip_initializers(void)
2634 if (token.type == '{')
2637 while (token.type != '}') {
2638 if (token.type == T_EOF)
2640 if (token.type == '{') {
2648 static initializer_t *create_empty_initializer(void)
2650 static initializer_t empty_initializer
2651 = { .list = { { INITIALIZER_LIST }, 0 } };
2652 return &empty_initializer;
2656 * Parse a part of an initialiser for a struct or union,
2658 static initializer_t *parse_sub_initializer(type_path_t *path,
2659 type_t *outer_type, size_t top_path_level,
2660 parse_initializer_env_t *env)
2662 if (token.type == '}') {
2663 /* empty initializer */
2664 return create_empty_initializer();
2667 type_t *orig_type = path->top_type;
2668 type_t *type = NULL;
2670 if (orig_type == NULL) {
2671 /* We are initializing an empty compound. */
2673 type = skip_typeref(orig_type);
2676 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2679 designator_t *designator = NULL;
2680 if (token.type == '.' || token.type == '[') {
2681 designator = parse_designation();
2682 goto finish_designator;
2683 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2684 /* GNU-style designator ("identifier: value") */
2685 designator = allocate_ast_zero(sizeof(designator[0]));
2686 designator->source_position = token.source_position;
2687 designator->symbol = token.v.symbol;
2692 /* reset path to toplevel, evaluate designator from there */
2693 ascend_to(path, top_path_level);
2694 if (!walk_designator(path, designator, false)) {
2695 /* can't continue after designation error */
2699 initializer_t *designator_initializer
2700 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2701 designator_initializer->designator.designator = designator;
2702 ARR_APP1(initializer_t*, initializers, designator_initializer);
2704 orig_type = path->top_type;
2705 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2710 if (token.type == '{') {
2711 if (type != NULL && is_type_scalar(type)) {
2712 sub = parse_scalar_initializer(type, env->must_be_constant);
2716 if (env->entity != NULL) {
2718 "extra brace group at end of initializer for '%Y'",
2719 env->entity->base.symbol);
2721 errorf(HERE, "extra brace group at end of initializer");
2724 descend_into_subtype(path);
2726 add_anchor_token('}');
2727 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2729 rem_anchor_token('}');
2732 ascend_from_subtype(path);
2733 expect('}', end_error);
2735 expect('}', end_error);
2736 goto error_parse_next;
2740 /* must be an expression */
2741 expression_t *expression = parse_assignment_expression();
2742 mark_vars_read(expression, NULL);
2744 if (env->must_be_constant && !is_initializer_constant(expression)) {
2745 errorf(&expression->base.source_position,
2746 "Initialisation expression '%E' is not constant",
2751 /* we are already outside, ... */
2752 type_t *const outer_type_skip = skip_typeref(outer_type);
2753 if (is_type_compound(outer_type_skip) &&
2754 !outer_type_skip->compound.compound->complete) {
2755 goto error_parse_next;
2760 /* handle { "string" } special case */
2761 if ((expression->kind == EXPR_STRING_LITERAL
2762 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2763 && outer_type != NULL) {
2764 sub = initializer_from_expression(outer_type, expression);
2766 if (token.type == ',') {
2769 if (token.type != '}' && warning.other) {
2770 warningf(HERE, "excessive elements in initializer for type '%T'",
2773 /* TODO: eat , ... */
2778 /* descend into subtypes until expression matches type */
2780 orig_type = path->top_type;
2781 type = skip_typeref(orig_type);
2783 sub = initializer_from_expression(orig_type, expression);
2787 if (!is_type_valid(type)) {
2790 if (is_type_scalar(type)) {
2791 errorf(&expression->base.source_position,
2792 "expression '%E' doesn't match expected type '%T'",
2793 expression, orig_type);
2797 descend_into_subtype(path);
2801 /* update largest index of top array */
2802 const type_path_entry_t *first = &path->path[0];
2803 type_t *first_type = first->type;
2804 first_type = skip_typeref(first_type);
2805 if (is_type_array(first_type)) {
2806 size_t index = first->v.index;
2807 if (index > path->max_index)
2808 path->max_index = index;
2812 /* append to initializers list */
2813 ARR_APP1(initializer_t*, initializers, sub);
2816 if (warning.other) {
2817 if (env->entity != NULL) {
2818 warningf(HERE, "excess elements in struct initializer for '%Y'",
2819 env->entity->base.symbol);
2821 warningf(HERE, "excess elements in struct initializer");
2827 if (token.type == '}') {
2830 expect(',', end_error);
2831 if (token.type == '}') {
2836 /* advance to the next declaration if we are not at the end */
2837 advance_current_object(path, top_path_level);
2838 orig_type = path->top_type;
2839 if (orig_type != NULL)
2840 type = skip_typeref(orig_type);
2846 size_t len = ARR_LEN(initializers);
2847 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2848 initializer_t *result = allocate_ast_zero(size);
2849 result->kind = INITIALIZER_LIST;
2850 result->list.len = len;
2851 memcpy(&result->list.initializers, initializers,
2852 len * sizeof(initializers[0]));
2854 DEL_ARR_F(initializers);
2855 ascend_to(path, top_path_level+1);
2860 skip_initializers();
2861 DEL_ARR_F(initializers);
2862 ascend_to(path, top_path_level+1);
2867 * Parses an initializer. Parsers either a compound literal
2868 * (env->declaration == NULL) or an initializer of a declaration.
2870 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2872 type_t *type = skip_typeref(env->type);
2873 size_t max_index = 0xdeadbeaf; // TODO: Resolve this uninitialized variable problem
2874 initializer_t *result;
2876 if (is_type_scalar(type)) {
2877 result = parse_scalar_initializer(type, env->must_be_constant);
2878 } else if (token.type == '{') {
2882 memset(&path, 0, sizeof(path));
2883 path.top_type = env->type;
2884 path.path = NEW_ARR_F(type_path_entry_t, 0);
2886 descend_into_subtype(&path);
2888 add_anchor_token('}');
2889 result = parse_sub_initializer(&path, env->type, 1, env);
2890 rem_anchor_token('}');
2892 max_index = path.max_index;
2893 DEL_ARR_F(path.path);
2895 expect('}', end_error);
2897 /* parse_scalar_initializer() also works in this case: we simply
2898 * have an expression without {} around it */
2899 result = parse_scalar_initializer(type, env->must_be_constant);
2902 /* §6.7.8:22 array initializers for arrays with unknown size determine
2903 * the array type size */
2904 if (is_type_array(type) && type->array.size_expression == NULL
2905 && result != NULL) {
2907 switch (result->kind) {
2908 case INITIALIZER_LIST:
2909 assert(max_index != 0xdeadbeaf);
2910 size = max_index + 1;
2913 case INITIALIZER_STRING:
2914 size = result->string.string.size;
2917 case INITIALIZER_WIDE_STRING:
2918 size = result->wide_string.string.size;
2921 case INITIALIZER_DESIGNATOR:
2922 case INITIALIZER_VALUE:
2923 /* can happen for parse errors */
2928 internal_errorf(HERE, "invalid initializer type");
2931 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2932 cnst->base.type = type_size_t;
2933 cnst->conste.v.int_value = size;
2935 type_t *new_type = duplicate_type(type);
2937 new_type->array.size_expression = cnst;
2938 new_type->array.size_constant = true;
2939 new_type->array.has_implicit_size = true;
2940 new_type->array.size = size;
2941 env->type = new_type;
2949 static void append_entity(scope_t *scope, entity_t *entity)
2951 if (scope->last_entity != NULL) {
2952 scope->last_entity->base.next = entity;
2954 scope->entities = entity;
2956 scope->last_entity = entity;
2960 static compound_t *parse_compound_type_specifier(bool is_struct)
2962 gnu_attribute_t *attributes = NULL;
2963 decl_modifiers_t modifiers = 0;
2970 symbol_t *symbol = NULL;
2971 compound_t *compound = NULL;
2973 if (token.type == T___attribute__) {
2974 modifiers |= parse_attributes(&attributes);
2977 if (token.type == T_IDENTIFIER) {
2978 symbol = token.v.symbol;
2981 namespace_tag_t const namespc =
2982 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2983 entity_t *entity = get_entity(symbol, namespc);
2984 if (entity != NULL) {
2985 assert(entity->kind == (is_struct ? ENTITY_STRUCT : ENTITY_UNION));
2986 compound = &entity->compound;
2987 if (compound->base.parent_scope != current_scope &&
2988 (token.type == '{' || token.type == ';')) {
2989 /* we're in an inner scope and have a definition. Shadow
2990 * existing definition in outer scope */
2992 } else if (compound->complete && token.type == '{') {
2993 assert(symbol != NULL);
2994 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2995 is_struct ? "struct" : "union", symbol,
2996 &compound->base.source_position);
2997 /* clear members in the hope to avoid further errors */
2998 compound->members.entities = NULL;
3001 } else if (token.type != '{') {
3003 parse_error_expected("while parsing struct type specifier",
3004 T_IDENTIFIER, '{', NULL);
3006 parse_error_expected("while parsing union type specifier",
3007 T_IDENTIFIER, '{', NULL);
3013 if (compound == NULL) {
3014 entity_kind_t kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
3015 entity_t *entity = allocate_entity_zero(kind);
3016 compound = &entity->compound;
3018 compound->base.namespc =
3019 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
3020 compound->base.source_position = token.source_position;
3021 compound->base.symbol = symbol;
3022 compound->base.parent_scope = current_scope;
3023 if (symbol != NULL) {
3024 environment_push(entity);
3026 append_entity(current_scope, entity);
3029 if (token.type == '{') {
3030 parse_compound_type_entries(compound);
3031 modifiers |= parse_attributes(&attributes);
3033 if (symbol == NULL) {
3034 assert(anonymous_entity == NULL);
3035 anonymous_entity = (entity_t*)compound;
3039 compound->modifiers |= modifiers;
3043 static void parse_enum_entries(type_t *const enum_type)
3047 if (token.type == '}') {
3048 errorf(HERE, "empty enum not allowed");
3053 add_anchor_token('}');
3055 if (token.type != T_IDENTIFIER) {
3056 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
3058 rem_anchor_token('}');
3062 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
3063 entity->enum_value.enum_type = enum_type;
3064 entity->base.symbol = token.v.symbol;
3065 entity->base.source_position = token.source_position;
3068 if (token.type == '=') {
3070 expression_t *value = parse_constant_expression();
3072 value = create_implicit_cast(value, enum_type);
3073 entity->enum_value.value = value;
3078 record_entity(entity, false);
3080 if (token.type != ',')
3083 } while (token.type != '}');
3084 rem_anchor_token('}');
3086 expect('}', end_error);
3092 static type_t *parse_enum_specifier(void)
3094 gnu_attribute_t *attributes = NULL;
3099 if (token.type == T_IDENTIFIER) {
3100 symbol = token.v.symbol;
3103 entity = get_entity(symbol, NAMESPACE_ENUM);
3104 if (entity != NULL) {
3105 assert(entity->kind == ENTITY_ENUM);
3106 if (entity->base.parent_scope != current_scope &&
3107 (token.type == '{' || token.type == ';')) {
3108 /* we're in an inner scope and have a definition. Shadow
3109 * existing definition in outer scope */
3111 } else if (entity->enume.complete && token.type == '{') {
3112 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
3113 symbol, &entity->base.source_position);
3116 } else if (token.type != '{') {
3117 parse_error_expected("while parsing enum type specifier",
3118 T_IDENTIFIER, '{', NULL);
3125 if (entity == NULL) {
3126 entity = allocate_entity_zero(ENTITY_ENUM);
3127 entity->base.namespc = NAMESPACE_ENUM;
3128 entity->base.source_position = token.source_position;
3129 entity->base.symbol = symbol;
3130 entity->base.parent_scope = current_scope;
3133 type_t *const type = allocate_type_zero(TYPE_ENUM);
3134 type->enumt.enume = &entity->enume;
3135 type->enumt.akind = ATOMIC_TYPE_INT;
3137 if (token.type == '{') {
3138 if (symbol != NULL) {
3139 environment_push(entity);
3141 append_entity(current_scope, entity);
3142 entity->enume.complete = true;
3144 parse_enum_entries(type);
3145 parse_attributes(&attributes);
3147 if (symbol == NULL) {
3148 assert(anonymous_entity == NULL);
3149 anonymous_entity = entity;
3151 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
3152 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
3160 * if a symbol is a typedef to another type, return true
3162 static bool is_typedef_symbol(symbol_t *symbol)
3164 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
3165 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
3168 static type_t *parse_typeof(void)
3174 expect('(', end_error);
3175 add_anchor_token(')');
3177 expression_t *expression = NULL;
3179 bool old_type_prop = in_type_prop;
3180 bool old_gcc_extension = in_gcc_extension;
3181 in_type_prop = true;
3183 while (token.type == T___extension__) {
3184 /* This can be a prefix to a typename or an expression. */
3186 in_gcc_extension = true;
3188 switch (token.type) {
3190 if (is_typedef_symbol(token.v.symbol)) {
3191 type = parse_typename();
3193 expression = parse_expression();
3194 type = revert_automatic_type_conversion(expression);
3199 type = parse_typename();
3203 expression = parse_expression();
3204 type = expression->base.type;
3207 in_type_prop = old_type_prop;
3208 in_gcc_extension = old_gcc_extension;
3210 rem_anchor_token(')');
3211 expect(')', end_error);
3213 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
3214 typeof_type->typeoft.expression = expression;
3215 typeof_type->typeoft.typeof_type = type;
3222 typedef enum specifiers_t {
3223 SPECIFIER_SIGNED = 1 << 0,
3224 SPECIFIER_UNSIGNED = 1 << 1,
3225 SPECIFIER_LONG = 1 << 2,
3226 SPECIFIER_INT = 1 << 3,
3227 SPECIFIER_DOUBLE = 1 << 4,
3228 SPECIFIER_CHAR = 1 << 5,
3229 SPECIFIER_WCHAR_T = 1 << 6,
3230 SPECIFIER_SHORT = 1 << 7,
3231 SPECIFIER_LONG_LONG = 1 << 8,
3232 SPECIFIER_FLOAT = 1 << 9,
3233 SPECIFIER_BOOL = 1 << 10,
3234 SPECIFIER_VOID = 1 << 11,
3235 SPECIFIER_INT8 = 1 << 12,
3236 SPECIFIER_INT16 = 1 << 13,
3237 SPECIFIER_INT32 = 1 << 14,
3238 SPECIFIER_INT64 = 1 << 15,
3239 SPECIFIER_INT128 = 1 << 16,
3240 SPECIFIER_COMPLEX = 1 << 17,
3241 SPECIFIER_IMAGINARY = 1 << 18,
3244 static type_t *create_builtin_type(symbol_t *const symbol,
3245 type_t *const real_type)
3247 type_t *type = allocate_type_zero(TYPE_BUILTIN);
3248 type->builtin.symbol = symbol;
3249 type->builtin.real_type = real_type;
3250 return identify_new_type(type);
3253 static type_t *get_typedef_type(symbol_t *symbol)
3255 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3256 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
3259 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
3260 type->typedeft.typedefe = &entity->typedefe;
3266 * check for the allowed MS alignment values.
3268 static bool check_alignment_value(long long intvalue)
3270 if (intvalue < 1 || intvalue > 8192) {
3271 errorf(HERE, "illegal alignment value");
3274 unsigned v = (unsigned)intvalue;
3275 for (unsigned i = 1; i <= 8192; i += i) {
3279 errorf(HERE, "alignment must be power of two");
3283 #define DET_MOD(name, tag) do { \
3284 if (*modifiers & tag && warning.other) warningf(HERE, #name " used more than once"); \
3285 *modifiers |= tag; \
3288 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
3290 decl_modifiers_t *modifiers = &specifiers->modifiers;
3293 if (token.type == T_restrict) {
3295 DET_MOD(restrict, DM_RESTRICT);
3297 } else if (token.type != T_IDENTIFIER)
3299 symbol_t *symbol = token.v.symbol;
3300 if (symbol == sym_align) {
3302 expect('(', end_error);
3303 if (token.type != T_INTEGER)
3305 if (check_alignment_value(token.v.intvalue)) {
3306 if (specifiers->alignment != 0 && warning.other)
3307 warningf(HERE, "align used more than once");
3308 specifiers->alignment = (unsigned char)token.v.intvalue;
3311 expect(')', end_error);
3312 } else if (symbol == sym_allocate) {
3314 expect('(', end_error);
3315 if (token.type != T_IDENTIFIER)
3317 (void)token.v.symbol;
3318 expect(')', end_error);
3319 } else if (symbol == sym_dllimport) {
3321 DET_MOD(dllimport, DM_DLLIMPORT);
3322 } else if (symbol == sym_dllexport) {
3324 DET_MOD(dllexport, DM_DLLEXPORT);
3325 } else if (symbol == sym_thread) {
3327 DET_MOD(thread, DM_THREAD);
3328 } else if (symbol == sym_naked) {
3330 DET_MOD(naked, DM_NAKED);
3331 } else if (symbol == sym_noinline) {
3333 DET_MOD(noinline, DM_NOINLINE);
3334 } else if (symbol == sym_returns_twice) {
3336 DET_MOD(returns_twice, DM_RETURNS_TWICE);
3337 } else if (symbol == sym_noreturn) {
3339 DET_MOD(noreturn, DM_NORETURN);
3340 } else if (symbol == sym_nothrow) {
3342 DET_MOD(nothrow, DM_NOTHROW);
3343 } else if (symbol == sym_novtable) {
3345 DET_MOD(novtable, DM_NOVTABLE);
3346 } else if (symbol == sym_property) {
3348 expect('(', end_error);
3350 bool is_get = false;
3351 if (token.type != T_IDENTIFIER)
3353 if (token.v.symbol == sym_get) {
3355 } else if (token.v.symbol == sym_put) {
3357 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3361 expect('=', end_error);
3362 if (token.type != T_IDENTIFIER)
3365 if (specifiers->get_property_sym != NULL) {
3366 errorf(HERE, "get property name already specified");
3368 specifiers->get_property_sym = token.v.symbol;
3371 if (specifiers->put_property_sym != NULL) {
3372 errorf(HERE, "put property name already specified");
3374 specifiers->put_property_sym = token.v.symbol;
3378 if (token.type == ',') {
3384 expect(')', end_error);
3385 } else if (symbol == sym_selectany) {
3387 DET_MOD(selectany, DM_SELECTANY);
3388 } else if (symbol == sym_uuid) {
3390 expect('(', end_error);
3391 if (token.type != T_STRING_LITERAL)
3394 expect(')', end_error);
3395 } else if (symbol == sym_deprecated) {
3397 if (specifiers->deprecated != 0 && warning.other)
3398 warningf(HERE, "deprecated used more than once");
3399 specifiers->deprecated = true;
3400 if (token.type == '(') {
3402 if (token.type == T_STRING_LITERAL) {
3403 specifiers->deprecated_string = token.v.string.begin;
3406 errorf(HERE, "string literal expected");
3408 expect(')', end_error);
3410 } else if (symbol == sym_noalias) {
3412 DET_MOD(noalias, DM_NOALIAS);
3415 warningf(HERE, "Unknown modifier '%Y' ignored", token.v.symbol);
3417 if (token.type == '(')
3421 if (token.type == ',')
3428 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
3430 entity_t *entity = allocate_entity_zero(kind);
3431 entity->base.source_position = *HERE;
3432 entity->base.symbol = symbol;
3433 if (is_declaration(entity)) {
3434 entity->declaration.type = type_error_type;
3435 entity->declaration.implicit = true;
3436 } else if (kind == ENTITY_TYPEDEF) {
3437 entity->typedefe.type = type_error_type;
3438 entity->typedefe.builtin = true;
3440 if (kind != ENTITY_COMPOUND_MEMBER)
3441 record_entity(entity, false);
3445 static void parse_microsoft_based(based_spec_t *based_spec)
3447 if (token.type != T_IDENTIFIER) {
3448 parse_error_expected("while parsing __based", T_IDENTIFIER, NULL);
3451 symbol_t *symbol = token.v.symbol;
3452 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3454 if (entity == NULL || entity->base.kind != ENTITY_VARIABLE) {
3455 errorf(HERE, "'%Y' is not a variable name.", symbol);
3456 entity = create_error_entity(symbol, ENTITY_VARIABLE);
3458 variable_t *variable = &entity->variable;
3460 if (based_spec->base_variable != NULL) {
3461 errorf(HERE, "__based type qualifier specified more than once");
3463 based_spec->source_position = token.source_position;
3464 based_spec->base_variable = variable;
3466 type_t *const type = variable->base.type;
3468 if (is_type_valid(type)) {
3469 if (! is_type_pointer(skip_typeref(type))) {
3470 errorf(HERE, "variable in __based modifier must have pointer type instead of '%T'", type);
3472 if (variable->base.base.parent_scope != file_scope) {
3473 errorf(HERE, "a nonstatic local variable may not be used in a __based specification");
3481 * Finish the construction of a struct type by calculating
3482 * its size, offsets, alignment.
3484 static void finish_struct_type(compound_type_t *type)
3486 assert(type->compound != NULL);
3488 compound_t *compound = type->compound;
3489 if (!compound->complete)
3494 il_alignment_t alignment = 1;
3495 bool need_pad = false;
3497 entity_t *entry = compound->members.entities;
3498 for (; entry != NULL; entry = entry->base.next) {
3499 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3502 type_t *m_type = skip_typeref(entry->declaration.type);
3503 if (! is_type_valid(m_type)) {
3504 /* simply ignore errors here */
3507 il_alignment_t m_alignment = m_type->base.alignment;
3508 if (m_alignment > alignment)
3509 alignment = m_alignment;
3511 offset = (size + m_alignment - 1) & -m_alignment;
3515 entry->compound_member.offset = offset;
3516 size = offset + m_type->base.size;
3518 if (type->base.alignment != 0) {
3519 alignment = type->base.alignment;
3522 offset = (size + alignment - 1) & -alignment;
3527 if (warning.padded) {
3528 warningf(&compound->base.source_position, "'%T' needs padding", type);
3531 if (compound->modifiers & DM_PACKED && warning.packed) {
3532 warningf(&compound->base.source_position,
3533 "superfluous packed attribute on '%T'", type);
3537 type->base.size = offset;
3538 type->base.alignment = alignment;
3542 * Finish the construction of an union type by calculating
3543 * its size and alignment.
3545 static void finish_union_type(compound_type_t *type)
3547 assert(type->compound != NULL);
3549 compound_t *compound = type->compound;
3550 if (! compound->complete)
3554 il_alignment_t alignment = 1;
3556 entity_t *entry = compound->members.entities;
3557 for (; entry != NULL; entry = entry->base.next) {
3558 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3561 type_t *m_type = skip_typeref(entry->declaration.type);
3562 if (! is_type_valid(m_type))
3565 entry->compound_member.offset = 0;
3566 if (m_type->base.size > size)
3567 size = m_type->base.size;
3568 if (m_type->base.alignment > alignment)
3569 alignment = m_type->base.alignment;
3571 if (type->base.alignment != 0) {
3572 alignment = type->base.alignment;
3574 size = (size + alignment - 1) & -alignment;
3575 type->base.size = size;
3576 type->base.alignment = alignment;
3579 static type_t *handle_attribute_mode(const gnu_attribute_t *attribute,
3582 type_t *type = skip_typeref(orig_type);
3584 /* at least: byte, word, pointer, list of machine modes
3585 * __XXX___ is interpreted as XXX */
3587 /* This isn't really correct, the backend should provide a list of machine
3588 * specific modes (according to gcc philosophy that is...) */
3589 const char *symbol_str = attribute->u.symbol->string;
3590 bool sign = is_type_signed(type);
3591 atomic_type_kind_t akind;
3592 if (strcmp_underscore("QI", symbol_str) == 0 ||
3593 strcmp_underscore("byte", symbol_str) == 0) {
3594 akind = sign ? ATOMIC_TYPE_CHAR : ATOMIC_TYPE_UCHAR;
3595 } else if (strcmp_underscore("HI", symbol_str) == 0) {
3596 akind = sign ? ATOMIC_TYPE_SHORT : ATOMIC_TYPE_USHORT;
3597 } else if (strcmp_underscore("SI", symbol_str) == 0
3598 || strcmp_underscore("word", symbol_str) == 0
3599 || strcmp_underscore("pointer", symbol_str) == 0) {
3600 akind = sign ? ATOMIC_TYPE_INT : ATOMIC_TYPE_UINT;
3601 } else if (strcmp_underscore("DI", symbol_str) == 0) {
3602 akind = sign ? ATOMIC_TYPE_LONGLONG : ATOMIC_TYPE_ULONGLONG;
3605 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
3609 if (type->kind == TYPE_ATOMIC) {
3610 type_t *copy = duplicate_type(type);
3611 copy->atomic.akind = akind;
3612 return identify_new_type(copy);
3613 } else if (type->kind == TYPE_ENUM) {
3614 type_t *copy = duplicate_type(type);
3615 copy->enumt.akind = akind;
3616 return identify_new_type(copy);
3617 } else if (is_type_pointer(type)) {
3618 warningf(HERE, "__attribute__((mode)) on pointers not implemented yet (ignored)");
3622 errorf(HERE, "__attribute__((mode)) only allowed on integer, enum or pointer type");
3626 static type_t *handle_type_attributes(const gnu_attribute_t *attributes,
3629 const gnu_attribute_t *attribute = attributes;
3630 for ( ; attribute != NULL; attribute = attribute->next) {
3631 if (attribute->invalid)
3634 if (attribute->kind == GNU_AK_MODE) {
3635 type = handle_attribute_mode(attribute, type);
3636 } else if (attribute->kind == GNU_AK_ALIGNED) {
3637 int alignment = 32; /* TODO: fill in maximum useful alignment for
3639 if (attribute->has_arguments)
3640 alignment = attribute->u.argument;
3642 type_t *copy = duplicate_type(type);
3643 copy->base.alignment = attribute->u.argument;
3644 type = identify_new_type(copy);
3651 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3653 type_t *type = NULL;
3654 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3655 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3656 unsigned type_specifiers = 0;
3657 bool newtype = false;
3658 bool saw_error = false;
3659 bool old_gcc_extension = in_gcc_extension;
3661 specifiers->source_position = token.source_position;
3664 specifiers->modifiers
3665 |= parse_attributes(&specifiers->gnu_attributes);
3667 switch (token.type) {
3669 #define MATCH_STORAGE_CLASS(token, class) \
3671 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3672 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3674 specifiers->storage_class = class; \
3675 if (specifiers->thread_local) \
3676 goto check_thread_storage_class; \
3680 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3681 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3682 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3683 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3684 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3688 expect('(', end_error);
3689 add_anchor_token(')');
3690 parse_microsoft_extended_decl_modifier(specifiers);
3691 rem_anchor_token(')');
3692 expect(')', end_error);
3696 if (specifiers->thread_local) {
3697 errorf(HERE, "duplicate '__thread'");
3699 specifiers->thread_local = true;
3700 check_thread_storage_class:
3701 switch (specifiers->storage_class) {
3702 case STORAGE_CLASS_EXTERN:
3703 case STORAGE_CLASS_NONE:
3704 case STORAGE_CLASS_STATIC:
3708 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
3709 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
3710 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
3711 wrong_thread_stoarge_class:
3712 errorf(HERE, "'__thread' used with '%s'", wrong);
3719 /* type qualifiers */
3720 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3722 qualifiers |= qualifier; \
3726 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3727 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3728 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3729 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3730 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3731 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3732 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3733 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3735 case T___extension__:
3737 in_gcc_extension = true;
3740 /* type specifiers */
3741 #define MATCH_SPECIFIER(token, specifier, name) \
3743 if (type_specifiers & specifier) { \
3744 errorf(HERE, "multiple " name " type specifiers given"); \
3746 type_specifiers |= specifier; \
3751 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3752 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3753 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3754 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3755 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3756 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3757 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3758 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3759 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
3760 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3761 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3762 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3763 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3764 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3765 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3766 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3767 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3768 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
3770 case T__forceinline:
3771 /* only in microsoft mode */
3772 specifiers->modifiers |= DM_FORCEINLINE;
3777 specifiers->is_inline = true;
3781 if (type_specifiers & SPECIFIER_LONG_LONG) {
3782 errorf(HERE, "multiple type specifiers given");
3783 } else if (type_specifiers & SPECIFIER_LONG) {
3784 type_specifiers |= SPECIFIER_LONG_LONG;
3786 type_specifiers |= SPECIFIER_LONG;
3792 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3794 type->compound.compound = parse_compound_type_specifier(true);
3795 finish_struct_type(&type->compound);
3799 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3800 type->compound.compound = parse_compound_type_specifier(false);
3801 if (type->compound.compound->modifiers & DM_TRANSPARENT_UNION)
3802 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3803 finish_union_type(&type->compound);
3807 type = parse_enum_specifier();
3810 type = parse_typeof();
3812 case T___builtin_va_list:
3813 type = duplicate_type(type_valist);
3817 case T_IDENTIFIER: {
3818 /* only parse identifier if we haven't found a type yet */
3819 if (type != NULL || type_specifiers != 0) {
3820 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3821 * declaration, so it doesn't generate errors about expecting '(' or
3823 switch (look_ahead(1)->type) {
3830 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3834 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3839 goto finish_specifiers;
3843 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3844 if (typedef_type == NULL) {
3845 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3846 * declaration, so it doesn't generate 'implicit int' followed by more
3847 * errors later on. */
3848 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3854 errorf(HERE, "%K does not name a type", &token);
3857 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3859 type = allocate_type_zero(TYPE_TYPEDEF);
3860 type->typedeft.typedefe = &entity->typedefe;
3864 if (la1_type == '&' || la1_type == '*')
3865 goto finish_specifiers;
3870 goto finish_specifiers;
3875 type = typedef_type;
3879 /* function specifier */
3881 goto finish_specifiers;
3886 specifiers->modifiers
3887 |= parse_attributes(&specifiers->gnu_attributes);
3889 in_gcc_extension = old_gcc_extension;
3891 if (type == NULL || (saw_error && type_specifiers != 0)) {
3892 atomic_type_kind_t atomic_type;
3894 /* match valid basic types */
3895 switch (type_specifiers) {
3896 case SPECIFIER_VOID:
3897 atomic_type = ATOMIC_TYPE_VOID;
3899 case SPECIFIER_WCHAR_T:
3900 atomic_type = ATOMIC_TYPE_WCHAR_T;
3902 case SPECIFIER_CHAR:
3903 atomic_type = ATOMIC_TYPE_CHAR;
3905 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3906 atomic_type = ATOMIC_TYPE_SCHAR;
3908 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3909 atomic_type = ATOMIC_TYPE_UCHAR;
3911 case SPECIFIER_SHORT:
3912 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3913 case SPECIFIER_SHORT | SPECIFIER_INT:
3914 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3915 atomic_type = ATOMIC_TYPE_SHORT;
3917 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3918 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3919 atomic_type = ATOMIC_TYPE_USHORT;
3922 case SPECIFIER_SIGNED:
3923 case SPECIFIER_SIGNED | SPECIFIER_INT:
3924 atomic_type = ATOMIC_TYPE_INT;
3926 case SPECIFIER_UNSIGNED:
3927 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3928 atomic_type = ATOMIC_TYPE_UINT;
3930 case SPECIFIER_LONG:
3931 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3932 case SPECIFIER_LONG | SPECIFIER_INT:
3933 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3934 atomic_type = ATOMIC_TYPE_LONG;
3936 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3937 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3938 atomic_type = ATOMIC_TYPE_ULONG;
3941 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3942 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3943 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3944 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3946 atomic_type = ATOMIC_TYPE_LONGLONG;
3947 goto warn_about_long_long;
3949 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3950 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3952 atomic_type = ATOMIC_TYPE_ULONGLONG;
3953 warn_about_long_long:
3954 if (warning.long_long) {
3955 warningf(&specifiers->source_position,
3956 "ISO C90 does not support 'long long'");
3960 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3961 atomic_type = unsigned_int8_type_kind;
3964 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3965 atomic_type = unsigned_int16_type_kind;
3968 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3969 atomic_type = unsigned_int32_type_kind;
3972 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3973 atomic_type = unsigned_int64_type_kind;
3976 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3977 atomic_type = unsigned_int128_type_kind;
3980 case SPECIFIER_INT8:
3981 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3982 atomic_type = int8_type_kind;
3985 case SPECIFIER_INT16:
3986 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3987 atomic_type = int16_type_kind;
3990 case SPECIFIER_INT32:
3991 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3992 atomic_type = int32_type_kind;
3995 case SPECIFIER_INT64:
3996 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3997 atomic_type = int64_type_kind;
4000 case SPECIFIER_INT128:
4001 case SPECIFIER_SIGNED | SPECIFIER_INT128:
4002 atomic_type = int128_type_kind;
4005 case SPECIFIER_FLOAT:
4006 atomic_type = ATOMIC_TYPE_FLOAT;
4008 case SPECIFIER_DOUBLE:
4009 atomic_type = ATOMIC_TYPE_DOUBLE;
4011 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
4012 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
4014 case SPECIFIER_BOOL:
4015 atomic_type = ATOMIC_TYPE_BOOL;
4017 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
4018 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
4019 atomic_type = ATOMIC_TYPE_FLOAT;
4021 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
4022 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
4023 atomic_type = ATOMIC_TYPE_DOUBLE;
4025 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
4026 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
4027 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
4030 /* invalid specifier combination, give an error message */
4031 if (type_specifiers == 0) {
4035 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
4036 if (!(c_mode & _CXX) && !strict_mode) {
4037 if (warning.implicit_int) {
4038 warningf(HERE, "no type specifiers in declaration, using 'int'");
4040 atomic_type = ATOMIC_TYPE_INT;
4043 errorf(HERE, "no type specifiers given in declaration");
4045 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
4046 (type_specifiers & SPECIFIER_UNSIGNED)) {
4047 errorf(HERE, "signed and unsigned specifiers given");
4048 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
4049 errorf(HERE, "only integer types can be signed or unsigned");
4051 errorf(HERE, "multiple datatypes in declaration");
4056 if (type_specifiers & SPECIFIER_COMPLEX) {
4057 type = allocate_type_zero(TYPE_COMPLEX);
4058 type->complex.akind = atomic_type;
4059 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
4060 type = allocate_type_zero(TYPE_IMAGINARY);
4061 type->imaginary.akind = atomic_type;
4063 type = allocate_type_zero(TYPE_ATOMIC);
4064 type->atomic.akind = atomic_type;
4066 type->base.alignment = get_atomic_type_alignment(atomic_type);
4067 unsigned const size = get_atomic_type_size(atomic_type);
4069 type_specifiers & SPECIFIER_COMPLEX ? size * 2 : size;
4071 } else if (type_specifiers != 0) {
4072 errorf(HERE, "multiple datatypes in declaration");
4075 /* FIXME: check type qualifiers here */
4077 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
4078 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4079 type->base.qualifiers = qualifiers;
4080 type->base.modifiers = modifiers;
4083 type = identify_new_type(type);
4085 type = typehash_insert(type);
4088 type = handle_type_attributes(specifiers->gnu_attributes, type);
4089 specifiers->type = type;
4093 specifiers->type = type_error_type;
4097 static type_qualifiers_t parse_type_qualifiers(void)
4099 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
4102 switch (token.type) {
4103 /* type qualifiers */
4104 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
4105 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
4106 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
4107 /* microsoft extended type modifiers */
4108 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
4109 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
4110 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
4111 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
4112 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
4121 * Parses an K&R identifier list
4123 static void parse_identifier_list(scope_t *scope)
4126 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
4127 entity->base.source_position = token.source_position;
4128 entity->base.namespc = NAMESPACE_NORMAL;
4129 entity->base.symbol = token.v.symbol;
4130 /* a K&R parameter has no type, yet */
4134 append_entity(scope, entity);
4136 if (token.type != ',') {
4140 } while (token.type == T_IDENTIFIER);
4143 static entity_t *parse_parameter(void)
4145 declaration_specifiers_t specifiers;
4146 memset(&specifiers, 0, sizeof(specifiers));
4148 parse_declaration_specifiers(&specifiers);
4150 entity_t *entity = parse_declarator(&specifiers,
4151 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
4152 anonymous_entity = NULL;
4156 static void semantic_parameter_incomplete(const entity_t *entity)
4158 assert(entity->kind == ENTITY_PARAMETER);
4160 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
4161 * list in a function declarator that is part of a
4162 * definition of that function shall not have
4163 * incomplete type. */
4164 type_t *type = skip_typeref(entity->declaration.type);
4165 if (is_type_incomplete(type)) {
4166 errorf(&entity->base.source_position,
4167 "parameter '%Y' has incomplete type '%T'", entity->base.symbol,
4168 entity->declaration.type);
4173 * Parses function type parameters (and optionally creates variable_t entities
4174 * for them in a scope)
4176 static void parse_parameters(function_type_t *type, scope_t *scope)
4179 add_anchor_token(')');
4180 int saved_comma_state = save_and_reset_anchor_state(',');
4182 if (token.type == T_IDENTIFIER &&
4183 !is_typedef_symbol(token.v.symbol)) {
4184 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
4185 if (la1_type == ',' || la1_type == ')') {
4186 type->kr_style_parameters = true;
4187 type->unspecified_parameters = true;
4188 parse_identifier_list(scope);
4189 goto parameters_finished;
4193 if (token.type == ')') {
4194 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
4195 if (!(c_mode & _CXX))
4196 type->unspecified_parameters = true;
4197 goto parameters_finished;
4200 function_parameter_t *parameter;
4201 function_parameter_t *last_parameter = NULL;
4204 switch (token.type) {
4207 type->variadic = true;
4208 goto parameters_finished;
4211 case T___extension__:
4214 entity_t *entity = parse_parameter();
4215 if (entity->kind == ENTITY_TYPEDEF) {
4216 errorf(&entity->base.source_position,
4217 "typedef not allowed as function parameter");
4220 assert(is_declaration(entity));
4222 /* func(void) is not a parameter */
4223 if (last_parameter == NULL
4224 && token.type == ')'
4225 && entity->base.symbol == NULL
4226 && skip_typeref(entity->declaration.type) == type_void) {
4227 goto parameters_finished;
4229 semantic_parameter_incomplete(entity);
4231 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
4232 memset(parameter, 0, sizeof(parameter[0]));
4233 parameter->type = entity->declaration.type;
4235 if (scope != NULL) {
4236 append_entity(scope, entity);
4239 if (last_parameter != NULL) {
4240 last_parameter->next = parameter;
4242 type->parameters = parameter;
4244 last_parameter = parameter;
4249 goto parameters_finished;
4251 if (token.type != ',') {
4252 goto parameters_finished;
4258 parameters_finished:
4259 rem_anchor_token(')');
4260 expect(')', end_error);
4263 restore_anchor_state(',', saved_comma_state);
4266 typedef enum construct_type_kind_t {
4269 CONSTRUCT_REFERENCE,
4272 } construct_type_kind_t;
4274 typedef struct construct_type_t construct_type_t;
4275 struct construct_type_t {
4276 construct_type_kind_t kind;
4277 construct_type_t *next;
4280 typedef struct parsed_pointer_t parsed_pointer_t;
4281 struct parsed_pointer_t {
4282 construct_type_t construct_type;
4283 type_qualifiers_t type_qualifiers;
4284 variable_t *base_variable; /**< MS __based extension. */
4287 typedef struct parsed_reference_t parsed_reference_t;
4288 struct parsed_reference_t {
4289 construct_type_t construct_type;
4292 typedef struct construct_function_type_t construct_function_type_t;
4293 struct construct_function_type_t {
4294 construct_type_t construct_type;
4295 type_t *function_type;
4298 typedef struct parsed_array_t parsed_array_t;
4299 struct parsed_array_t {
4300 construct_type_t construct_type;
4301 type_qualifiers_t type_qualifiers;
4307 typedef struct construct_base_type_t construct_base_type_t;
4308 struct construct_base_type_t {
4309 construct_type_t construct_type;
4313 static construct_type_t *parse_pointer_declarator(variable_t *base_variable)
4317 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
4318 memset(pointer, 0, sizeof(pointer[0]));
4319 pointer->construct_type.kind = CONSTRUCT_POINTER;
4320 pointer->type_qualifiers = parse_type_qualifiers();
4321 pointer->base_variable = base_variable;
4323 return &pointer->construct_type;
4326 static construct_type_t *parse_reference_declarator(void)
4330 parsed_reference_t *reference = obstack_alloc(&temp_obst, sizeof(reference[0]));
4331 memset(reference, 0, sizeof(reference[0]));
4332 reference->construct_type.kind = CONSTRUCT_REFERENCE;
4334 return (construct_type_t*)reference;
4337 static construct_type_t *parse_array_declarator(void)
4340 add_anchor_token(']');
4342 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
4343 memset(array, 0, sizeof(array[0]));
4344 array->construct_type.kind = CONSTRUCT_ARRAY;
4346 if (token.type == T_static) {
4347 array->is_static = true;
4351 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4352 if (type_qualifiers != 0) {
4353 if (token.type == T_static) {
4354 array->is_static = true;
4358 array->type_qualifiers = type_qualifiers;
4360 if (token.type == '*' && look_ahead(1)->type == ']') {
4361 array->is_variable = true;
4363 } else if (token.type != ']') {
4364 expression_t *const size = parse_assignment_expression();
4366 mark_vars_read(size, NULL);
4369 rem_anchor_token(']');
4370 expect(']', end_error);
4373 return &array->construct_type;
4376 static construct_type_t *parse_function_declarator(scope_t *scope,
4377 decl_modifiers_t modifiers)
4379 type_t *type = allocate_type_zero(TYPE_FUNCTION);
4380 function_type_t *ftype = &type->function;
4382 ftype->linkage = current_linkage;
4384 switch (modifiers & (DM_CDECL | DM_STDCALL | DM_FASTCALL | DM_THISCALL)) {
4385 case DM_NONE: break;
4386 case DM_CDECL: ftype->calling_convention = CC_CDECL; break;
4387 case DM_STDCALL: ftype->calling_convention = CC_STDCALL; break;
4388 case DM_FASTCALL: ftype->calling_convention = CC_FASTCALL; break;
4389 case DM_THISCALL: ftype->calling_convention = CC_THISCALL; break;
4392 errorf(HERE, "multiple calling conventions in declaration");
4396 parse_parameters(ftype, scope);
4398 construct_function_type_t *construct_function_type =
4399 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
4400 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
4401 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
4402 construct_function_type->function_type = type;
4404 return &construct_function_type->construct_type;
4407 typedef struct parse_declarator_env_t {
4408 decl_modifiers_t modifiers;
4410 source_position_t source_position;
4412 } parse_declarator_env_t;
4414 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env,
4415 bool may_be_abstract)
4417 /* construct a single linked list of construct_type_t's which describe
4418 * how to construct the final declarator type */
4419 construct_type_t *first = NULL;
4420 construct_type_t *last = NULL;
4421 gnu_attribute_t *attributes = NULL;
4423 decl_modifiers_t modifiers = parse_attributes(&attributes);
4425 /* MS __based extension */
4426 based_spec_t base_spec;
4427 base_spec.base_variable = NULL;
4430 construct_type_t *type;
4431 switch (token.type) {
4433 if (!(c_mode & _CXX))
4434 errorf(HERE, "references are only available for C++");
4435 if (base_spec.base_variable != NULL && warning.other) {
4436 warningf(&base_spec.source_position,
4437 "__based does not precede a pointer operator, ignored");
4439 type = parse_reference_declarator();
4441 base_spec.base_variable = NULL;
4445 type = parse_pointer_declarator(base_spec.base_variable);
4447 base_spec.base_variable = NULL;
4452 expect('(', end_error);
4453 add_anchor_token(')');
4454 parse_microsoft_based(&base_spec);
4455 rem_anchor_token(')');
4456 expect(')', end_error);
4460 goto ptr_operator_end;
4471 /* TODO: find out if this is correct */
4472 modifiers |= parse_attributes(&attributes);
4475 if (base_spec.base_variable != NULL && warning.other) {
4476 warningf(&base_spec.source_position,
4477 "__based does not precede a pointer operator, ignored");
4481 modifiers |= env->modifiers;
4482 env->modifiers = modifiers;
4485 construct_type_t *inner_types = NULL;
4487 switch (token.type) {
4490 errorf(HERE, "no identifier expected in typename");
4492 env->symbol = token.v.symbol;
4493 env->source_position = token.source_position;
4498 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
4499 * interpreted as ``function with no parameter specification'', rather
4500 * than redundant parentheses around the omitted identifier. */
4501 if (look_ahead(1)->type != ')') {
4503 add_anchor_token(')');
4504 inner_types = parse_inner_declarator(env, may_be_abstract);
4505 if (inner_types != NULL) {
4506 /* All later declarators only modify the return type */
4509 rem_anchor_token(')');
4510 expect(')', end_error);
4514 if (may_be_abstract)
4516 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4521 construct_type_t *p = last;
4524 construct_type_t *type;
4525 switch (token.type) {
4527 scope_t *scope = NULL;
4529 scope = &env->parameters;
4531 type = parse_function_declarator(scope, modifiers);
4535 type = parse_array_declarator();
4538 goto declarator_finished;
4541 /* insert in the middle of the list (behind p) */
4543 type->next = p->next;
4554 declarator_finished:
4555 /* append inner_types at the end of the list, we don't to set last anymore
4556 * as it's not needed anymore */
4558 assert(first == NULL);
4559 first = inner_types;
4561 last->next = inner_types;
4569 static void parse_declaration_attributes(entity_t *entity)
4571 gnu_attribute_t *attributes = NULL;
4572 decl_modifiers_t modifiers = parse_attributes(&attributes);
4578 if (entity->kind == ENTITY_TYPEDEF) {
4579 modifiers |= entity->typedefe.modifiers;
4580 type = entity->typedefe.type;
4582 assert(is_declaration(entity));
4583 modifiers |= entity->declaration.modifiers;
4584 type = entity->declaration.type;
4589 gnu_attribute_t *attribute = attributes;
4590 for ( ; attribute != NULL; attribute = attribute->next) {
4591 if (attribute->invalid)
4594 if (attribute->kind == GNU_AK_MODE) {
4595 type = handle_attribute_mode(attribute, type);
4596 } else if (attribute->kind == GNU_AK_ALIGNED) {
4597 int alignment = 32; /* TODO: fill in maximum usefull alignment for target machine */
4598 if (attribute->has_arguments)
4599 alignment = attribute->u.argument;
4601 if (entity->kind == ENTITY_TYPEDEF) {
4602 type_t *copy = duplicate_type(type);
4603 copy->base.alignment = attribute->u.argument;
4604 type = identify_new_type(copy);
4605 } else if(entity->kind == ENTITY_VARIABLE) {
4606 entity->variable.alignment = alignment;
4607 } else if(entity->kind == ENTITY_COMPOUND_MEMBER) {
4608 entity->compound_member.alignment = alignment;
4613 type_modifiers_t type_modifiers = type->base.modifiers;
4614 if (modifiers & DM_TRANSPARENT_UNION)
4615 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4617 if (type->base.modifiers != type_modifiers) {
4618 type_t *copy = duplicate_type(type);
4619 copy->base.modifiers = type_modifiers;
4620 type = identify_new_type(copy);
4623 if (entity->kind == ENTITY_TYPEDEF) {
4624 entity->typedefe.type = type;
4625 entity->typedefe.modifiers = modifiers;
4627 entity->declaration.type = type;
4628 entity->declaration.modifiers = modifiers;
4632 static type_t *construct_declarator_type(construct_type_t *construct_list, type_t *type)
4634 construct_type_t *iter = construct_list;
4635 for (; iter != NULL; iter = iter->next) {
4636 switch (iter->kind) {
4637 case CONSTRUCT_INVALID:
4638 internal_errorf(HERE, "invalid type construction found");
4639 case CONSTRUCT_FUNCTION: {
4640 construct_function_type_t *construct_function_type
4641 = (construct_function_type_t*) iter;
4643 type_t *function_type = construct_function_type->function_type;
4645 function_type->function.return_type = type;
4647 type_t *skipped_return_type = skip_typeref(type);
4649 if (is_type_function(skipped_return_type)) {
4650 errorf(HERE, "function returning function is not allowed");
4651 } else if (is_type_array(skipped_return_type)) {
4652 errorf(HERE, "function returning array is not allowed");
4654 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4656 "type qualifiers in return type of function type are meaningless");
4660 type = function_type;
4664 case CONSTRUCT_POINTER: {
4665 if (is_type_reference(skip_typeref(type)))
4666 errorf(HERE, "cannot declare a pointer to reference");
4668 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4669 type = make_based_pointer_type(type, parsed_pointer->type_qualifiers, parsed_pointer->base_variable);
4673 case CONSTRUCT_REFERENCE:
4674 if (is_type_reference(skip_typeref(type)))
4675 errorf(HERE, "cannot declare a reference to reference");
4677 type = make_reference_type(type);
4680 case CONSTRUCT_ARRAY: {
4681 if (is_type_reference(skip_typeref(type)))
4682 errorf(HERE, "cannot declare an array of references");
4684 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4685 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4687 expression_t *size_expression = parsed_array->size;
4688 if (size_expression != NULL) {
4690 = create_implicit_cast(size_expression, type_size_t);
4693 array_type->base.qualifiers = parsed_array->type_qualifiers;
4694 array_type->array.element_type = type;
4695 array_type->array.is_static = parsed_array->is_static;
4696 array_type->array.is_variable = parsed_array->is_variable;
4697 array_type->array.size_expression = size_expression;
4699 if (size_expression != NULL) {
4700 if (is_constant_expression(size_expression)) {
4701 array_type->array.size_constant = true;
4702 array_type->array.size
4703 = fold_constant(size_expression);
4705 array_type->array.is_vla = true;
4709 type_t *skipped_type = skip_typeref(type);
4711 if (is_type_incomplete(skipped_type)) {
4712 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4713 } else if (is_type_function(skipped_type)) {
4714 errorf(HERE, "array of functions is not allowed");
4721 /* The function type was constructed earlier. Freeing it here will
4722 * destroy other types. */
4723 if (iter->kind == CONSTRUCT_FUNCTION) {
4724 type = typehash_insert(type);
4726 type = identify_new_type(type);
4733 static type_t *automatic_type_conversion(type_t *orig_type);
4735 static type_t *semantic_parameter(const source_position_t *pos,
4737 const declaration_specifiers_t *specifiers,
4740 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
4741 * shall be adjusted to ``qualified pointer to type'',
4743 * §6.7.5.3:8 A declaration of a parameter as ``function returning
4744 * type'' shall be adjusted to ``pointer to function
4745 * returning type'', as in 6.3.2.1. */
4746 type = automatic_type_conversion(type);
4748 if (specifiers->is_inline && is_type_valid(type)) {
4749 errorf(pos, "parameter '%Y' declared 'inline'", symbol);
4752 /* §6.9.1:6 The declarations in the declaration list shall contain
4753 * no storage-class specifier other than register and no
4754 * initializations. */
4755 if (specifiers->thread_local || (
4756 specifiers->storage_class != STORAGE_CLASS_NONE &&
4757 specifiers->storage_class != STORAGE_CLASS_REGISTER)
4759 errorf(pos, "invalid storage class for parameter '%Y'", symbol);
4762 /* delay test for incomplete type, because we might have (void)
4763 * which is legal but incomplete... */
4768 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4769 declarator_flags_t flags)
4771 parse_declarator_env_t env;
4772 memset(&env, 0, sizeof(env));
4773 env.modifiers = specifiers->modifiers;
4775 construct_type_t *construct_type =
4776 parse_inner_declarator(&env, (flags & DECL_MAY_BE_ABSTRACT) != 0);
4778 construct_declarator_type(construct_type, specifiers->type);
4779 type_t *type = skip_typeref(orig_type);
4781 if (construct_type != NULL) {
4782 obstack_free(&temp_obst, construct_type);
4786 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4787 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4788 entity->base.symbol = env.symbol;
4789 entity->base.source_position = env.source_position;
4790 entity->typedefe.type = orig_type;
4792 if (anonymous_entity != NULL) {
4793 if (is_type_compound(type)) {
4794 assert(anonymous_entity->compound.alias == NULL);
4795 assert(anonymous_entity->kind == ENTITY_STRUCT ||
4796 anonymous_entity->kind == ENTITY_UNION);
4797 anonymous_entity->compound.alias = entity;
4798 anonymous_entity = NULL;
4799 } else if (is_type_enum(type)) {
4800 assert(anonymous_entity->enume.alias == NULL);
4801 assert(anonymous_entity->kind == ENTITY_ENUM);
4802 anonymous_entity->enume.alias = entity;
4803 anonymous_entity = NULL;
4807 /* create a declaration type entity */
4808 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
4809 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4811 if (env.symbol != NULL) {
4812 if (specifiers->is_inline && is_type_valid(type)) {
4813 errorf(&env.source_position,
4814 "compound member '%Y' declared 'inline'", env.symbol);
4817 if (specifiers->thread_local ||
4818 specifiers->storage_class != STORAGE_CLASS_NONE) {
4819 errorf(&env.source_position,
4820 "compound member '%Y' must have no storage class",
4824 } else if (flags & DECL_IS_PARAMETER) {
4825 orig_type = semantic_parameter(&env.source_position, orig_type,
4826 specifiers, env.symbol);
4828 entity = allocate_entity_zero(ENTITY_PARAMETER);
4829 } else if (is_type_function(type)) {
4830 entity = allocate_entity_zero(ENTITY_FUNCTION);
4832 entity->function.is_inline = specifiers->is_inline;
4833 entity->function.parameters = env.parameters;
4835 if (env.symbol != NULL) {
4836 if (specifiers->thread_local || (
4837 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4838 specifiers->storage_class != STORAGE_CLASS_NONE &&
4839 specifiers->storage_class != STORAGE_CLASS_STATIC
4841 errorf(&env.source_position,
4842 "invalid storage class for function '%Y'", env.symbol);
4846 entity = allocate_entity_zero(ENTITY_VARIABLE);
4848 entity->variable.get_property_sym = specifiers->get_property_sym;
4849 entity->variable.put_property_sym = specifiers->put_property_sym;
4851 entity->variable.thread_local = specifiers->thread_local;
4853 if (env.symbol != NULL) {
4854 if (specifiers->is_inline && is_type_valid(type)) {
4855 errorf(&env.source_position,
4856 "variable '%Y' declared 'inline'", env.symbol);
4859 bool invalid_storage_class = false;
4860 if (current_scope == file_scope) {
4861 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4862 specifiers->storage_class != STORAGE_CLASS_NONE &&
4863 specifiers->storage_class != STORAGE_CLASS_STATIC) {
4864 invalid_storage_class = true;
4867 if (specifiers->thread_local &&
4868 specifiers->storage_class == STORAGE_CLASS_NONE) {
4869 invalid_storage_class = true;
4872 if (invalid_storage_class) {
4873 errorf(&env.source_position,
4874 "invalid storage class for variable '%Y'", env.symbol);
4879 if (env.symbol != NULL) {
4880 entity->base.symbol = env.symbol;
4881 entity->base.source_position = env.source_position;
4883 entity->base.source_position = specifiers->source_position;
4885 entity->base.namespc = NAMESPACE_NORMAL;
4886 entity->declaration.type = orig_type;
4887 entity->declaration.modifiers = env.modifiers;
4888 entity->declaration.deprecated_string = specifiers->deprecated_string;
4890 storage_class_t storage_class = specifiers->storage_class;
4891 entity->declaration.declared_storage_class = storage_class;
4893 if (storage_class == STORAGE_CLASS_NONE && current_scope != file_scope)
4894 storage_class = STORAGE_CLASS_AUTO;
4895 entity->declaration.storage_class = storage_class;
4898 parse_declaration_attributes(entity);
4903 static type_t *parse_abstract_declarator(type_t *base_type)
4905 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4907 type_t *result = construct_declarator_type(construct_type, base_type);
4908 if (construct_type != NULL) {
4909 obstack_free(&temp_obst, construct_type);
4916 * Check if the declaration of main is suspicious. main should be a
4917 * function with external linkage, returning int, taking either zero
4918 * arguments, two, or three arguments of appropriate types, ie.
4920 * int main([ int argc, char **argv [, char **env ] ]).
4922 * @param decl the declaration to check
4923 * @param type the function type of the declaration
4925 static void check_type_of_main(const entity_t *entity)
4927 const source_position_t *pos = &entity->base.source_position;
4928 if (entity->kind != ENTITY_FUNCTION) {
4929 warningf(pos, "'main' is not a function");
4933 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4934 warningf(pos, "'main' is normally a non-static function");
4937 type_t *type = skip_typeref(entity->declaration.type);
4938 assert(is_type_function(type));
4940 function_type_t *func_type = &type->function;
4941 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4942 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4943 func_type->return_type);
4945 const function_parameter_t *parm = func_type->parameters;
4947 type_t *const first_type = parm->type;
4948 if (!types_compatible(skip_typeref(first_type), type_int)) {
4950 "first argument of 'main' should be 'int', but is '%T'",
4955 type_t *const second_type = parm->type;
4956 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4957 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4961 type_t *const third_type = parm->type;
4962 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4963 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4967 goto warn_arg_count;
4971 warningf(pos, "'main' takes only zero, two or three arguments");
4977 * Check if a symbol is the equal to "main".
4979 static bool is_sym_main(const symbol_t *const sym)
4981 return strcmp(sym->string, "main") == 0;
4984 static void error_redefined_as_different_kind(const source_position_t *pos,
4985 const entity_t *old, entity_kind_t new_kind)
4987 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4988 get_entity_kind_name(old->kind), old->base.symbol,
4989 get_entity_kind_name(new_kind), &old->base.source_position);
4992 static bool is_error_entity(entity_t *const ent)
4994 if (is_declaration(ent)) {
4995 return is_type_valid(skip_typeref(ent->declaration.type));
4996 } else if (ent->kind == ENTITY_TYPEDEF) {
4997 return is_type_valid(skip_typeref(ent->typedefe.type));
5003 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
5004 * for various problems that occur for multiple definitions
5006 static entity_t *record_entity(entity_t *entity, const bool is_definition)
5008 const symbol_t *const symbol = entity->base.symbol;
5009 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
5010 const source_position_t *pos = &entity->base.source_position;
5012 /* can happen in error cases */
5016 entity_t *const previous_entity = get_entity(symbol, namespc);
5017 /* pushing the same entity twice will break the stack structure */
5018 assert(previous_entity != entity);
5020 if (entity->kind == ENTITY_FUNCTION) {
5021 type_t *const orig_type = entity->declaration.type;
5022 type_t *const type = skip_typeref(orig_type);
5024 assert(is_type_function(type));
5025 if (type->function.unspecified_parameters &&
5026 warning.strict_prototypes &&
5027 previous_entity == NULL) {
5028 warningf(pos, "function declaration '%#T' is not a prototype",
5032 if (warning.main && current_scope == file_scope
5033 && is_sym_main(symbol)) {
5034 check_type_of_main(entity);
5038 if (is_declaration(entity) &&
5039 warning.nested_externs &&
5040 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
5041 current_scope != file_scope) {
5042 warningf(pos, "nested extern declaration of '%#T'",
5043 entity->declaration.type, symbol);
5046 if (previous_entity != NULL) {
5047 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
5048 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
5049 assert(previous_entity->kind == ENTITY_PARAMETER);
5051 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
5052 entity->declaration.type, symbol,
5053 previous_entity->declaration.type, symbol,
5054 &previous_entity->base.source_position);
5058 if (previous_entity->base.parent_scope == current_scope) {
5059 if (previous_entity->kind != entity->kind) {
5060 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
5061 error_redefined_as_different_kind(pos, previous_entity,
5066 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
5067 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
5068 symbol, &previous_entity->base.source_position);
5071 if (previous_entity->kind == ENTITY_TYPEDEF) {
5072 /* TODO: C++ allows this for exactly the same type */
5073 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
5074 symbol, &previous_entity->base.source_position);
5078 /* at this point we should have only VARIABLES or FUNCTIONS */
5079 assert(is_declaration(previous_entity) && is_declaration(entity));
5081 declaration_t *const prev_decl = &previous_entity->declaration;
5082 declaration_t *const decl = &entity->declaration;
5084 /* can happen for K&R style declarations */
5085 if (prev_decl->type == NULL &&
5086 previous_entity->kind == ENTITY_PARAMETER &&
5087 entity->kind == ENTITY_PARAMETER) {
5088 prev_decl->type = decl->type;
5089 prev_decl->storage_class = decl->storage_class;
5090 prev_decl->declared_storage_class = decl->declared_storage_class;
5091 prev_decl->modifiers = decl->modifiers;
5092 prev_decl->deprecated_string = decl->deprecated_string;
5093 return previous_entity;
5096 type_t *const orig_type = decl->type;
5097 assert(orig_type != NULL);
5098 type_t *const type = skip_typeref(orig_type);
5099 type_t *const prev_type = skip_typeref(prev_decl->type);
5101 if (!types_compatible(type, prev_type)) {
5103 "declaration '%#T' is incompatible with '%#T' (declared %P)",
5104 orig_type, symbol, prev_decl->type, symbol,
5105 &previous_entity->base.source_position);
5107 unsigned old_storage_class = prev_decl->storage_class;
5108 if (warning.redundant_decls &&
5111 !(prev_decl->modifiers & DM_USED) &&
5112 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
5113 warningf(&previous_entity->base.source_position,
5114 "unnecessary static forward declaration for '%#T'",
5115 prev_decl->type, symbol);
5118 storage_class_t new_storage_class = decl->storage_class;
5120 /* pretend no storage class means extern for function
5121 * declarations (except if the previous declaration is neither
5122 * none nor extern) */
5123 if (entity->kind == ENTITY_FUNCTION) {
5124 /* the previous declaration could have unspecified parameters or
5125 * be a typedef, so use the new type */
5126 if (prev_type->function.unspecified_parameters || is_definition)
5127 prev_decl->type = type;
5129 switch (old_storage_class) {
5130 case STORAGE_CLASS_NONE:
5131 old_storage_class = STORAGE_CLASS_EXTERN;
5134 case STORAGE_CLASS_EXTERN:
5135 if (is_definition) {
5136 if (warning.missing_prototypes &&
5137 prev_type->function.unspecified_parameters &&
5138 !is_sym_main(symbol)) {
5139 warningf(pos, "no previous prototype for '%#T'",
5142 } else if (new_storage_class == STORAGE_CLASS_NONE) {
5143 new_storage_class = STORAGE_CLASS_EXTERN;
5150 } else if (is_type_incomplete(prev_type)) {
5151 prev_decl->type = type;
5154 if (old_storage_class == STORAGE_CLASS_EXTERN &&
5155 new_storage_class == STORAGE_CLASS_EXTERN) {
5156 warn_redundant_declaration:
5157 if (!is_definition &&
5158 warning.redundant_decls &&
5159 is_type_valid(prev_type) &&
5160 strcmp(previous_entity->base.source_position.input_name,
5161 "<builtin>") != 0) {
5163 "redundant declaration for '%Y' (declared %P)",
5164 symbol, &previous_entity->base.source_position);
5166 } else if (current_function == NULL) {
5167 if (old_storage_class != STORAGE_CLASS_STATIC &&
5168 new_storage_class == STORAGE_CLASS_STATIC) {
5170 "static declaration of '%Y' follows non-static declaration (declared %P)",
5171 symbol, &previous_entity->base.source_position);
5172 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
5173 prev_decl->storage_class = STORAGE_CLASS_NONE;
5174 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
5176 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
5178 goto error_redeclaration;
5179 goto warn_redundant_declaration;
5181 } else if (is_type_valid(prev_type)) {
5182 if (old_storage_class == new_storage_class) {
5183 error_redeclaration:
5184 errorf(pos, "redeclaration of '%Y' (declared %P)",
5185 symbol, &previous_entity->base.source_position);
5188 "redeclaration of '%Y' with different linkage (declared %P)",
5189 symbol, &previous_entity->base.source_position);
5194 prev_decl->modifiers |= decl->modifiers;
5195 if (entity->kind == ENTITY_FUNCTION) {
5196 previous_entity->function.is_inline |= entity->function.is_inline;
5198 return previous_entity;
5201 if (warning.shadow) {
5202 warningf(pos, "%s '%Y' shadows %s (declared %P)",
5203 get_entity_kind_name(entity->kind), symbol,
5204 get_entity_kind_name(previous_entity->kind),
5205 &previous_entity->base.source_position);
5209 if (entity->kind == ENTITY_FUNCTION) {
5210 if (is_definition &&
5211 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
5212 if (warning.missing_prototypes && !is_sym_main(symbol)) {
5213 warningf(pos, "no previous prototype for '%#T'",
5214 entity->declaration.type, symbol);
5215 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
5216 warningf(pos, "no previous declaration for '%#T'",
5217 entity->declaration.type, symbol);
5220 } else if (warning.missing_declarations &&
5221 entity->kind == ENTITY_VARIABLE &&
5222 current_scope == file_scope) {
5223 declaration_t *declaration = &entity->declaration;
5224 if (declaration->storage_class == STORAGE_CLASS_NONE) {
5225 warningf(pos, "no previous declaration for '%#T'",
5226 declaration->type, symbol);
5231 assert(entity->base.parent_scope == NULL);
5232 assert(current_scope != NULL);
5234 entity->base.parent_scope = current_scope;
5235 entity->base.namespc = NAMESPACE_NORMAL;
5236 environment_push(entity);
5237 append_entity(current_scope, entity);
5242 static void parser_error_multiple_definition(entity_t *entity,
5243 const source_position_t *source_position)
5245 errorf(source_position, "multiple definition of '%Y' (declared %P)",
5246 entity->base.symbol, &entity->base.source_position);
5249 static bool is_declaration_specifier(const token_t *token,
5250 bool only_specifiers_qualifiers)
5252 switch (token->type) {
5257 return is_typedef_symbol(token->v.symbol);
5259 case T___extension__:
5261 return !only_specifiers_qualifiers;
5268 static void parse_init_declarator_rest(entity_t *entity)
5270 assert(is_declaration(entity));
5271 declaration_t *const declaration = &entity->declaration;
5275 type_t *orig_type = declaration->type;
5276 type_t *type = skip_typeref(orig_type);
5278 if (entity->kind == ENTITY_VARIABLE
5279 && entity->variable.initializer != NULL) {
5280 parser_error_multiple_definition(entity, HERE);
5283 bool must_be_constant = false;
5284 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
5285 entity->base.parent_scope == file_scope) {
5286 must_be_constant = true;
5289 if (is_type_function(type)) {
5290 errorf(&entity->base.source_position,
5291 "function '%#T' is initialized like a variable",
5292 orig_type, entity->base.symbol);
5293 orig_type = type_error_type;
5296 parse_initializer_env_t env;
5297 env.type = orig_type;
5298 env.must_be_constant = must_be_constant;
5299 env.entity = entity;
5300 current_init_decl = entity;
5302 initializer_t *initializer = parse_initializer(&env);
5303 current_init_decl = NULL;
5305 if (entity->kind == ENTITY_VARIABLE) {
5306 /* §6.7.5:22 array initializers for arrays with unknown size
5307 * determine the array type size */
5308 declaration->type = env.type;
5309 entity->variable.initializer = initializer;
5313 /* parse rest of a declaration without any declarator */
5314 static void parse_anonymous_declaration_rest(
5315 const declaration_specifiers_t *specifiers)
5318 anonymous_entity = NULL;
5320 if (warning.other) {
5321 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
5322 specifiers->thread_local) {
5323 warningf(&specifiers->source_position,
5324 "useless storage class in empty declaration");
5327 type_t *type = specifiers->type;
5328 switch (type->kind) {
5329 case TYPE_COMPOUND_STRUCT:
5330 case TYPE_COMPOUND_UNION: {
5331 if (type->compound.compound->base.symbol == NULL) {
5332 warningf(&specifiers->source_position,
5333 "unnamed struct/union that defines no instances");
5342 warningf(&specifiers->source_position, "empty declaration");
5348 static void check_variable_type_complete(entity_t *ent)
5350 if (ent->kind != ENTITY_VARIABLE)
5353 /* §6.7:7 If an identifier for an object is declared with no linkage, the
5354 * type for the object shall be complete [...] */
5355 declaration_t *decl = &ent->declaration;
5356 if (decl->storage_class != STORAGE_CLASS_NONE)
5359 type_t *const orig_type = decl->type;
5360 type_t *const type = skip_typeref(orig_type);
5361 if (!is_type_incomplete(type))
5364 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
5365 * are given length one. */
5366 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
5367 ARR_APP1(declaration_t*, incomplete_arrays, decl);
5371 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
5372 orig_type, ent->base.symbol);
5376 static void parse_declaration_rest(entity_t *ndeclaration,
5377 const declaration_specifiers_t *specifiers,
5378 parsed_declaration_func finished_declaration,
5379 declarator_flags_t flags)
5381 add_anchor_token(';');
5382 add_anchor_token(',');
5384 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
5386 if (token.type == '=') {
5387 parse_init_declarator_rest(entity);
5388 } else if (entity->kind == ENTITY_VARIABLE) {
5389 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
5390 * [...] where the extern specifier is explicitly used. */
5391 declaration_t *decl = &entity->declaration;
5392 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
5393 type_t *type = decl->type;
5394 if (is_type_reference(skip_typeref(type))) {
5395 errorf(&entity->base.source_position,
5396 "reference '%#T' must be initialized",
5397 type, entity->base.symbol);
5402 check_variable_type_complete(entity);
5404 if (token.type != ',')
5408 add_anchor_token('=');
5409 ndeclaration = parse_declarator(specifiers, flags);
5410 rem_anchor_token('=');
5412 expect(';', end_error);
5415 anonymous_entity = NULL;
5416 rem_anchor_token(';');
5417 rem_anchor_token(',');
5420 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
5422 symbol_t *symbol = entity->base.symbol;
5423 if (symbol == NULL) {
5424 errorf(HERE, "anonymous declaration not valid as function parameter");
5428 assert(entity->base.namespc == NAMESPACE_NORMAL);
5429 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
5430 if (previous_entity == NULL
5431 || previous_entity->base.parent_scope != current_scope) {
5432 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
5437 if (is_definition) {
5438 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
5441 return record_entity(entity, false);
5444 static void parse_declaration(parsed_declaration_func finished_declaration,
5445 declarator_flags_t flags)
5447 declaration_specifiers_t specifiers;
5448 memset(&specifiers, 0, sizeof(specifiers));
5450 add_anchor_token(';');
5451 parse_declaration_specifiers(&specifiers);
5452 rem_anchor_token(';');
5454 if (token.type == ';') {
5455 parse_anonymous_declaration_rest(&specifiers);
5457 entity_t *entity = parse_declarator(&specifiers, flags);
5458 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
5462 static type_t *get_default_promoted_type(type_t *orig_type)
5464 type_t *result = orig_type;
5466 type_t *type = skip_typeref(orig_type);
5467 if (is_type_integer(type)) {
5468 result = promote_integer(type);
5469 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
5470 result = type_double;
5476 static void parse_kr_declaration_list(entity_t *entity)
5478 if (entity->kind != ENTITY_FUNCTION)
5481 type_t *type = skip_typeref(entity->declaration.type);
5482 assert(is_type_function(type));
5483 if (!type->function.kr_style_parameters)
5487 add_anchor_token('{');
5489 /* push function parameters */
5490 size_t const top = environment_top();
5491 scope_t *old_scope = scope_push(&entity->function.parameters);
5493 entity_t *parameter = entity->function.parameters.entities;
5494 for ( ; parameter != NULL; parameter = parameter->base.next) {
5495 assert(parameter->base.parent_scope == NULL);
5496 parameter->base.parent_scope = current_scope;
5497 environment_push(parameter);
5500 /* parse declaration list */
5502 switch (token.type) {
5504 case T___extension__:
5505 /* This covers symbols, which are no type, too, and results in
5506 * better error messages. The typical cases are misspelled type
5507 * names and missing includes. */
5509 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
5517 /* pop function parameters */
5518 assert(current_scope == &entity->function.parameters);
5519 scope_pop(old_scope);
5520 environment_pop_to(top);
5522 /* update function type */
5523 type_t *new_type = duplicate_type(type);
5525 function_parameter_t *parameters = NULL;
5526 function_parameter_t *last_parameter = NULL;
5528 parameter = entity->function.parameters.entities;
5529 for (; parameter != NULL; parameter = parameter->base.next) {
5530 if (parameter->kind != ENTITY_PARAMETER)
5533 type_t *parameter_type = parameter->declaration.type;
5534 if (parameter_type == NULL) {
5536 errorf(HERE, "no type specified for function parameter '%Y'",
5537 parameter->base.symbol);
5539 if (warning.implicit_int) {
5540 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5541 parameter->base.symbol);
5543 parameter_type = type_int;
5544 parameter->declaration.type = parameter_type;
5548 semantic_parameter_incomplete(parameter);
5549 parameter_type = parameter->declaration.type;
5552 * we need the default promoted types for the function type
5554 parameter_type = get_default_promoted_type(parameter_type);
5556 function_parameter_t *function_parameter
5557 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
5558 memset(function_parameter, 0, sizeof(function_parameter[0]));
5560 function_parameter->type = parameter_type;
5561 if (last_parameter != NULL) {
5562 last_parameter->next = function_parameter;
5564 parameters = function_parameter;
5566 last_parameter = function_parameter;
5569 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
5571 new_type->function.parameters = parameters;
5572 new_type->function.unspecified_parameters = true;
5574 new_type = identify_new_type(new_type);
5576 entity->declaration.type = new_type;
5578 rem_anchor_token('{');
5581 static bool first_err = true;
5584 * When called with first_err set, prints the name of the current function,
5587 static void print_in_function(void)
5591 diagnosticf("%s: In function '%Y':\n",
5592 current_function->base.base.source_position.input_name,
5593 current_function->base.base.symbol);
5598 * Check if all labels are defined in the current function.
5599 * Check if all labels are used in the current function.
5601 static void check_labels(void)
5603 for (const goto_statement_t *goto_statement = goto_first;
5604 goto_statement != NULL;
5605 goto_statement = goto_statement->next) {
5606 /* skip computed gotos */
5607 if (goto_statement->expression != NULL)
5610 label_t *label = goto_statement->label;
5613 if (label->base.source_position.input_name == NULL) {
5614 print_in_function();
5615 errorf(&goto_statement->base.source_position,
5616 "label '%Y' used but not defined", label->base.symbol);
5620 if (warning.unused_label) {
5621 for (const label_statement_t *label_statement = label_first;
5622 label_statement != NULL;
5623 label_statement = label_statement->next) {
5624 label_t *label = label_statement->label;
5626 if (! label->used) {
5627 print_in_function();
5628 warningf(&label_statement->base.source_position,
5629 "label '%Y' defined but not used", label->base.symbol);
5635 static void warn_unused_entity(entity_t *entity, entity_t *last)
5637 entity_t const *const end = last != NULL ? last->base.next : NULL;
5638 for (; entity != end; entity = entity->base.next) {
5639 if (!is_declaration(entity))
5642 declaration_t *declaration = &entity->declaration;
5643 if (declaration->implicit)
5646 if (!declaration->used) {
5647 print_in_function();
5648 const char *what = get_entity_kind_name(entity->kind);
5649 warningf(&entity->base.source_position, "%s '%Y' is unused",
5650 what, entity->base.symbol);
5651 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
5652 print_in_function();
5653 const char *what = get_entity_kind_name(entity->kind);
5654 warningf(&entity->base.source_position, "%s '%Y' is never read",
5655 what, entity->base.symbol);
5660 static void check_unused_variables(statement_t *const stmt, void *const env)
5664 switch (stmt->kind) {
5665 case STATEMENT_DECLARATION: {
5666 declaration_statement_t const *const decls = &stmt->declaration;
5667 warn_unused_entity(decls->declarations_begin,
5668 decls->declarations_end);
5673 warn_unused_entity(stmt->fors.scope.entities, NULL);
5682 * Check declarations of current_function for unused entities.
5684 static void check_declarations(void)
5686 if (warning.unused_parameter) {
5687 const scope_t *scope = ¤t_function->parameters;
5689 /* do not issue unused warnings for main */
5690 if (!is_sym_main(current_function->base.base.symbol)) {
5691 warn_unused_entity(scope->entities, NULL);
5694 if (warning.unused_variable) {
5695 walk_statements(current_function->statement, check_unused_variables,
5700 static int determine_truth(expression_t const* const cond)
5703 !is_constant_expression(cond) ? 0 :
5704 fold_constant(cond) != 0 ? 1 :
5708 static void check_reachable(statement_t *);
5709 static bool reaches_end;
5711 static bool expression_returns(expression_t const *const expr)
5713 switch (expr->kind) {
5715 expression_t const *const func = expr->call.function;
5716 if (func->kind == EXPR_REFERENCE) {
5717 entity_t *entity = func->reference.entity;
5718 if (entity->kind == ENTITY_FUNCTION
5719 && entity->declaration.modifiers & DM_NORETURN)
5723 if (!expression_returns(func))
5726 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5727 if (!expression_returns(arg->expression))
5734 case EXPR_REFERENCE:
5735 case EXPR_REFERENCE_ENUM_VALUE:
5737 case EXPR_CHARACTER_CONSTANT:
5738 case EXPR_WIDE_CHARACTER_CONSTANT:
5739 case EXPR_STRING_LITERAL:
5740 case EXPR_WIDE_STRING_LITERAL:
5741 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5742 case EXPR_LABEL_ADDRESS:
5743 case EXPR_CLASSIFY_TYPE:
5744 case EXPR_SIZEOF: // TODO handle obscure VLA case
5747 case EXPR_BUILTIN_CONSTANT_P:
5748 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
5753 case EXPR_STATEMENT: {
5754 bool old_reaches_end = reaches_end;
5755 reaches_end = false;
5756 check_reachable(expr->statement.statement);
5757 bool returns = reaches_end;
5758 reaches_end = old_reaches_end;
5762 case EXPR_CONDITIONAL:
5763 // TODO handle constant expression
5765 if (!expression_returns(expr->conditional.condition))
5768 if (expr->conditional.true_expression != NULL
5769 && expression_returns(expr->conditional.true_expression))
5772 return expression_returns(expr->conditional.false_expression);
5775 return expression_returns(expr->select.compound);
5777 case EXPR_ARRAY_ACCESS:
5779 expression_returns(expr->array_access.array_ref) &&
5780 expression_returns(expr->array_access.index);
5783 return expression_returns(expr->va_starte.ap);
5786 return expression_returns(expr->va_arge.ap);
5788 EXPR_UNARY_CASES_MANDATORY
5789 return expression_returns(expr->unary.value);
5791 case EXPR_UNARY_THROW:
5795 // TODO handle constant lhs of && and ||
5797 expression_returns(expr->binary.left) &&
5798 expression_returns(expr->binary.right);
5804 panic("unhandled expression");
5807 static bool initializer_returns(initializer_t const *const init)
5809 switch (init->kind) {
5810 case INITIALIZER_VALUE:
5811 return expression_returns(init->value.value);
5813 case INITIALIZER_LIST: {
5814 initializer_t * const* i = init->list.initializers;
5815 initializer_t * const* const end = i + init->list.len;
5816 bool returns = true;
5817 for (; i != end; ++i) {
5818 if (!initializer_returns(*i))
5824 case INITIALIZER_STRING:
5825 case INITIALIZER_WIDE_STRING:
5826 case INITIALIZER_DESIGNATOR: // designators have no payload
5829 panic("unhandled initializer");
5832 static bool noreturn_candidate;
5834 static void check_reachable(statement_t *const stmt)
5836 if (stmt->base.reachable)
5838 if (stmt->kind != STATEMENT_DO_WHILE)
5839 stmt->base.reachable = true;
5841 statement_t *last = stmt;
5843 switch (stmt->kind) {
5844 case STATEMENT_INVALID:
5845 case STATEMENT_EMPTY:
5847 next = stmt->base.next;
5850 case STATEMENT_DECLARATION: {
5851 declaration_statement_t const *const decl = &stmt->declaration;
5852 entity_t const * ent = decl->declarations_begin;
5853 entity_t const *const last = decl->declarations_end;
5855 for (;; ent = ent->base.next) {
5856 if (ent->kind == ENTITY_VARIABLE &&
5857 ent->variable.initializer != NULL &&
5858 !initializer_returns(ent->variable.initializer)) {
5865 next = stmt->base.next;
5869 case STATEMENT_COMPOUND:
5870 next = stmt->compound.statements;
5872 next = stmt->base.next;
5875 case STATEMENT_RETURN: {
5876 expression_t const *const val = stmt->returns.value;
5877 if (val == NULL || expression_returns(val))
5878 noreturn_candidate = false;
5882 case STATEMENT_IF: {
5883 if_statement_t const *const ifs = &stmt->ifs;
5884 expression_t const *const cond = ifs->condition;
5886 if (!expression_returns(cond))
5889 int const val = determine_truth(cond);
5892 check_reachable(ifs->true_statement);
5897 if (ifs->false_statement != NULL) {
5898 check_reachable(ifs->false_statement);
5902 next = stmt->base.next;
5906 case STATEMENT_SWITCH: {
5907 switch_statement_t const *const switchs = &stmt->switchs;
5908 expression_t const *const expr = switchs->expression;
5910 if (!expression_returns(expr))
5913 if (is_constant_expression(expr)) {
5914 long const val = fold_constant(expr);
5915 case_label_statement_t * defaults = NULL;
5916 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5917 if (i->expression == NULL) {
5922 if (i->first_case <= val && val <= i->last_case) {
5923 check_reachable((statement_t*)i);
5928 if (defaults != NULL) {
5929 check_reachable((statement_t*)defaults);
5933 bool has_default = false;
5934 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5935 if (i->expression == NULL)
5938 check_reachable((statement_t*)i);
5945 next = stmt->base.next;
5949 case STATEMENT_EXPRESSION: {
5950 /* Check for noreturn function call */
5951 expression_t const *const expr = stmt->expression.expression;
5952 if (!expression_returns(expr))
5955 next = stmt->base.next;
5959 case STATEMENT_CONTINUE: {
5960 statement_t *parent = stmt;
5962 parent = parent->base.parent;
5963 if (parent == NULL) /* continue not within loop */
5967 switch (parent->kind) {
5968 case STATEMENT_WHILE: goto continue_while;
5969 case STATEMENT_DO_WHILE: goto continue_do_while;
5970 case STATEMENT_FOR: goto continue_for;
5977 case STATEMENT_BREAK: {
5978 statement_t *parent = stmt;
5980 parent = parent->base.parent;
5981 if (parent == NULL) /* break not within loop/switch */
5984 switch (parent->kind) {
5985 case STATEMENT_SWITCH:
5986 case STATEMENT_WHILE:
5987 case STATEMENT_DO_WHILE:
5990 next = parent->base.next;
5991 goto found_break_parent;
6000 case STATEMENT_GOTO:
6001 if (stmt->gotos.expression) {
6002 if (!expression_returns(stmt->gotos.expression))
6005 statement_t *parent = stmt->base.parent;
6006 if (parent == NULL) /* top level goto */
6010 next = stmt->gotos.label->statement;
6011 if (next == NULL) /* missing label */
6016 case STATEMENT_LABEL:
6017 next = stmt->label.statement;
6020 case STATEMENT_CASE_LABEL:
6021 next = stmt->case_label.statement;
6024 case STATEMENT_WHILE: {
6025 while_statement_t const *const whiles = &stmt->whiles;
6026 expression_t const *const cond = whiles->condition;
6028 if (!expression_returns(cond))
6031 int const val = determine_truth(cond);
6034 check_reachable(whiles->body);
6039 next = stmt->base.next;
6043 case STATEMENT_DO_WHILE:
6044 next = stmt->do_while.body;
6047 case STATEMENT_FOR: {
6048 for_statement_t *const fors = &stmt->fors;
6050 if (fors->condition_reachable)
6052 fors->condition_reachable = true;
6054 expression_t const *const cond = fors->condition;
6059 } else if (expression_returns(cond)) {
6060 val = determine_truth(cond);
6066 check_reachable(fors->body);
6071 next = stmt->base.next;
6075 case STATEMENT_MS_TRY: {
6076 ms_try_statement_t const *const ms_try = &stmt->ms_try;
6077 check_reachable(ms_try->try_statement);
6078 next = ms_try->final_statement;
6082 case STATEMENT_LEAVE: {
6083 statement_t *parent = stmt;
6085 parent = parent->base.parent;
6086 if (parent == NULL) /* __leave not within __try */
6089 if (parent->kind == STATEMENT_MS_TRY) {
6091 next = parent->ms_try.final_statement;
6099 panic("invalid statement kind");
6102 while (next == NULL) {
6103 next = last->base.parent;
6105 noreturn_candidate = false;
6107 type_t *const type = skip_typeref(current_function->base.type);
6108 assert(is_type_function(type));
6109 type_t *const ret = skip_typeref(type->function.return_type);
6110 if (warning.return_type &&
6111 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
6112 is_type_valid(ret) &&
6113 !is_sym_main(current_function->base.base.symbol)) {
6114 warningf(&stmt->base.source_position,
6115 "control reaches end of non-void function");
6120 switch (next->kind) {
6121 case STATEMENT_INVALID:
6122 case STATEMENT_EMPTY:
6123 case STATEMENT_DECLARATION:
6124 case STATEMENT_EXPRESSION:
6126 case STATEMENT_RETURN:
6127 case STATEMENT_CONTINUE:
6128 case STATEMENT_BREAK:
6129 case STATEMENT_GOTO:
6130 case STATEMENT_LEAVE:
6131 panic("invalid control flow in function");
6133 case STATEMENT_COMPOUND:
6134 if (next->compound.stmt_expr) {
6140 case STATEMENT_SWITCH:
6141 case STATEMENT_LABEL:
6142 case STATEMENT_CASE_LABEL:
6144 next = next->base.next;
6147 case STATEMENT_WHILE: {
6149 if (next->base.reachable)
6151 next->base.reachable = true;
6153 while_statement_t const *const whiles = &next->whiles;
6154 expression_t const *const cond = whiles->condition;
6156 if (!expression_returns(cond))
6159 int const val = determine_truth(cond);
6162 check_reachable(whiles->body);
6168 next = next->base.next;
6172 case STATEMENT_DO_WHILE: {
6174 if (next->base.reachable)
6176 next->base.reachable = true;
6178 do_while_statement_t const *const dw = &next->do_while;
6179 expression_t const *const cond = dw->condition;
6181 if (!expression_returns(cond))
6184 int const val = determine_truth(cond);
6187 check_reachable(dw->body);
6193 next = next->base.next;
6197 case STATEMENT_FOR: {
6199 for_statement_t *const fors = &next->fors;
6201 fors->step_reachable = true;
6203 if (fors->condition_reachable)
6205 fors->condition_reachable = true;
6207 expression_t const *const cond = fors->condition;
6212 } else if (expression_returns(cond)) {
6213 val = determine_truth(cond);
6219 check_reachable(fors->body);
6225 next = next->base.next;
6229 case STATEMENT_MS_TRY:
6231 next = next->ms_try.final_statement;
6236 check_reachable(next);
6239 static void check_unreachable(statement_t* const stmt, void *const env)
6243 switch (stmt->kind) {
6244 case STATEMENT_DO_WHILE:
6245 if (!stmt->base.reachable) {
6246 expression_t const *const cond = stmt->do_while.condition;
6247 if (determine_truth(cond) >= 0) {
6248 warningf(&cond->base.source_position,
6249 "condition of do-while-loop is unreachable");
6254 case STATEMENT_FOR: {
6255 for_statement_t const* const fors = &stmt->fors;
6257 // if init and step are unreachable, cond is unreachable, too
6258 if (!stmt->base.reachable && !fors->step_reachable) {
6259 warningf(&stmt->base.source_position, "statement is unreachable");
6261 if (!stmt->base.reachable && fors->initialisation != NULL) {
6262 warningf(&fors->initialisation->base.source_position,
6263 "initialisation of for-statement is unreachable");
6266 if (!fors->condition_reachable && fors->condition != NULL) {
6267 warningf(&fors->condition->base.source_position,
6268 "condition of for-statement is unreachable");
6271 if (!fors->step_reachable && fors->step != NULL) {
6272 warningf(&fors->step->base.source_position,
6273 "step of for-statement is unreachable");
6279 case STATEMENT_COMPOUND:
6280 if (stmt->compound.statements != NULL)
6282 goto warn_unreachable;
6284 case STATEMENT_DECLARATION: {
6285 /* Only warn if there is at least one declarator with an initializer.
6286 * This typically occurs in switch statements. */
6287 declaration_statement_t const *const decl = &stmt->declaration;
6288 entity_t const * ent = decl->declarations_begin;
6289 entity_t const *const last = decl->declarations_end;
6291 for (;; ent = ent->base.next) {
6292 if (ent->kind == ENTITY_VARIABLE &&
6293 ent->variable.initializer != NULL) {
6294 goto warn_unreachable;
6304 if (!stmt->base.reachable)
6305 warningf(&stmt->base.source_position, "statement is unreachable");
6310 static void parse_external_declaration(void)
6312 /* function-definitions and declarations both start with declaration
6314 declaration_specifiers_t specifiers;
6315 memset(&specifiers, 0, sizeof(specifiers));
6317 add_anchor_token(';');
6318 parse_declaration_specifiers(&specifiers);
6319 rem_anchor_token(';');
6321 /* must be a declaration */
6322 if (token.type == ';') {
6323 parse_anonymous_declaration_rest(&specifiers);
6327 add_anchor_token(',');
6328 add_anchor_token('=');
6329 add_anchor_token(';');
6330 add_anchor_token('{');
6332 /* declarator is common to both function-definitions and declarations */
6333 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
6335 rem_anchor_token('{');
6336 rem_anchor_token(';');
6337 rem_anchor_token('=');
6338 rem_anchor_token(',');
6340 /* must be a declaration */
6341 switch (token.type) {
6345 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
6350 /* must be a function definition */
6351 parse_kr_declaration_list(ndeclaration);
6353 if (token.type != '{') {
6354 parse_error_expected("while parsing function definition", '{', NULL);
6355 eat_until_matching_token(';');
6359 assert(is_declaration(ndeclaration));
6360 type_t *const orig_type = ndeclaration->declaration.type;
6361 type_t * type = skip_typeref(orig_type);
6363 if (!is_type_function(type)) {
6364 if (is_type_valid(type)) {
6365 errorf(HERE, "declarator '%#T' has a body but is not a function type",
6366 type, ndeclaration->base.symbol);
6370 } else if (is_typeref(orig_type)) {
6372 errorf(&ndeclaration->base.source_position,
6373 "type of function definition '%#T' is a typedef",
6374 orig_type, ndeclaration->base.symbol);
6377 if (warning.aggregate_return &&
6378 is_type_compound(skip_typeref(type->function.return_type))) {
6379 warningf(HERE, "function '%Y' returns an aggregate",
6380 ndeclaration->base.symbol);
6382 if (warning.traditional && !type->function.unspecified_parameters) {
6383 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
6384 ndeclaration->base.symbol);
6386 if (warning.old_style_definition && type->function.unspecified_parameters) {
6387 warningf(HERE, "old-style function definition '%Y'",
6388 ndeclaration->base.symbol);
6391 /* §6.7.5.3:14 a function definition with () means no
6392 * parameters (and not unspecified parameters) */
6393 if (type->function.unspecified_parameters &&
6394 type->function.parameters == NULL &&
6395 !type->function.kr_style_parameters) {
6396 type_t *copy = duplicate_type(type);
6397 copy->function.unspecified_parameters = false;
6398 type = identify_new_type(copy);
6400 ndeclaration->declaration.type = type;
6403 entity_t *const entity = record_entity(ndeclaration, true);
6404 assert(entity->kind == ENTITY_FUNCTION);
6405 assert(ndeclaration->kind == ENTITY_FUNCTION);
6407 function_t *function = &entity->function;
6408 if (ndeclaration != entity) {
6409 function->parameters = ndeclaration->function.parameters;
6411 assert(is_declaration(entity));
6412 type = skip_typeref(entity->declaration.type);
6414 /* push function parameters and switch scope */
6415 size_t const top = environment_top();
6416 scope_t *old_scope = scope_push(&function->parameters);
6418 entity_t *parameter = function->parameters.entities;
6419 for (; parameter != NULL; parameter = parameter->base.next) {
6420 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
6421 parameter->base.parent_scope = current_scope;
6423 assert(parameter->base.parent_scope == NULL
6424 || parameter->base.parent_scope == current_scope);
6425 parameter->base.parent_scope = current_scope;
6426 if (parameter->base.symbol == NULL) {
6427 errorf(¶meter->base.source_position, "parameter name omitted");
6430 environment_push(parameter);
6433 if (function->statement != NULL) {
6434 parser_error_multiple_definition(entity, HERE);
6437 /* parse function body */
6438 int label_stack_top = label_top();
6439 function_t *old_current_function = current_function;
6440 current_function = function;
6441 current_parent = NULL;
6444 goto_anchor = &goto_first;
6446 label_anchor = &label_first;
6448 statement_t *const body = parse_compound_statement(false);
6449 function->statement = body;
6452 check_declarations();
6453 if (warning.return_type ||
6454 warning.unreachable_code ||
6455 (warning.missing_noreturn
6456 && !(function->base.modifiers & DM_NORETURN))) {
6457 noreturn_candidate = true;
6458 check_reachable(body);
6459 if (warning.unreachable_code)
6460 walk_statements(body, check_unreachable, NULL);
6461 if (warning.missing_noreturn &&
6462 noreturn_candidate &&
6463 !(function->base.modifiers & DM_NORETURN)) {
6464 warningf(&body->base.source_position,
6465 "function '%#T' is candidate for attribute 'noreturn'",
6466 type, entity->base.symbol);
6470 assert(current_parent == NULL);
6471 assert(current_function == function);
6472 current_function = old_current_function;
6473 label_pop_to(label_stack_top);
6476 assert(current_scope == &function->parameters);
6477 scope_pop(old_scope);
6478 environment_pop_to(top);
6481 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
6482 source_position_t *source_position,
6483 const symbol_t *symbol)
6485 type_t *type = allocate_type_zero(TYPE_BITFIELD);
6487 type->bitfield.base_type = base_type;
6488 type->bitfield.size_expression = size;
6491 type_t *skipped_type = skip_typeref(base_type);
6492 if (!is_type_integer(skipped_type)) {
6493 errorf(HERE, "bitfield base type '%T' is not an integer type",
6497 bit_size = skipped_type->base.size * 8;
6500 if (is_constant_expression(size)) {
6501 long v = fold_constant(size);
6504 errorf(source_position, "negative width in bit-field '%Y'", symbol);
6505 } else if (v == 0) {
6506 errorf(source_position, "zero width for bit-field '%Y'", symbol);
6507 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
6508 errorf(source_position, "width of '%Y' exceeds its type", symbol);
6510 type->bitfield.bit_size = v;
6517 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
6519 entity_t *iter = compound->members.entities;
6520 for (; iter != NULL; iter = iter->base.next) {
6521 if (iter->kind != ENTITY_COMPOUND_MEMBER)
6524 if (iter->base.symbol == symbol) {
6526 } else if (iter->base.symbol == NULL) {
6527 type_t *type = skip_typeref(iter->declaration.type);
6528 if (is_type_compound(type)) {
6530 = find_compound_entry(type->compound.compound, symbol);
6541 static void parse_compound_declarators(compound_t *compound,
6542 const declaration_specifiers_t *specifiers)
6547 if (token.type == ':') {
6548 source_position_t source_position = *HERE;
6551 type_t *base_type = specifiers->type;
6552 expression_t *size = parse_constant_expression();
6554 type_t *type = make_bitfield_type(base_type, size,
6555 &source_position, sym_anonymous);
6557 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
6558 entity->base.namespc = NAMESPACE_NORMAL;
6559 entity->base.source_position = source_position;
6560 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
6561 entity->declaration.storage_class = STORAGE_CLASS_NONE;
6562 entity->declaration.modifiers = specifiers->modifiers;
6563 entity->declaration.type = type;
6564 append_entity(&compound->members, entity);
6566 entity = parse_declarator(specifiers,
6567 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
6568 if (entity->kind == ENTITY_TYPEDEF) {
6569 errorf(&entity->base.source_position,
6570 "typedef not allowed as compound member");
6572 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6574 /* make sure we don't define a symbol multiple times */
6575 symbol_t *symbol = entity->base.symbol;
6576 if (symbol != NULL) {
6577 entity_t *prev = find_compound_entry(compound, symbol);
6579 errorf(&entity->base.source_position,
6580 "multiple declarations of symbol '%Y' (declared %P)",
6581 symbol, &prev->base.source_position);
6585 if (token.type == ':') {
6586 source_position_t source_position = *HERE;
6588 expression_t *size = parse_constant_expression();
6590 type_t *type = entity->declaration.type;
6591 type_t *bitfield_type = make_bitfield_type(type, size,
6592 &source_position, entity->base.symbol);
6593 entity->declaration.type = bitfield_type;
6595 type_t *orig_type = entity->declaration.type;
6596 type_t *type = skip_typeref(orig_type);
6597 if (is_type_function(type)) {
6598 errorf(&entity->base.source_position,
6599 "compound member '%Y' must not have function type '%T'",
6600 entity->base.symbol, orig_type);
6601 } else if (is_type_incomplete(type)) {
6602 /* §6.7.2.1:16 flexible array member */
6603 if (is_type_array(type) &&
6604 token.type == ';' &&
6605 look_ahead(1)->type == '}') {
6606 compound->has_flexible_member = true;
6608 errorf(&entity->base.source_position,
6609 "compound member '%Y' has incomplete type '%T'",
6610 entity->base.symbol, orig_type);
6615 append_entity(&compound->members, entity);
6619 if (token.type != ',')
6623 expect(';', end_error);
6626 anonymous_entity = NULL;
6629 static void parse_compound_type_entries(compound_t *compound)
6632 add_anchor_token('}');
6634 while (token.type != '}') {
6635 if (token.type == T_EOF) {
6636 errorf(HERE, "EOF while parsing struct");
6639 declaration_specifiers_t specifiers;
6640 memset(&specifiers, 0, sizeof(specifiers));
6641 parse_declaration_specifiers(&specifiers);
6643 parse_compound_declarators(compound, &specifiers);
6645 rem_anchor_token('}');
6649 compound->complete = true;
6652 static type_t *parse_typename(void)
6654 declaration_specifiers_t specifiers;
6655 memset(&specifiers, 0, sizeof(specifiers));
6656 parse_declaration_specifiers(&specifiers);
6657 if (specifiers.storage_class != STORAGE_CLASS_NONE ||
6658 specifiers.thread_local) {
6659 /* TODO: improve error message, user does probably not know what a
6660 * storage class is...
6662 errorf(HERE, "typename may not have a storage class");
6665 type_t *result = parse_abstract_declarator(specifiers.type);
6673 typedef expression_t* (*parse_expression_function)(void);
6674 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6676 typedef struct expression_parser_function_t expression_parser_function_t;
6677 struct expression_parser_function_t {
6678 parse_expression_function parser;
6679 precedence_t infix_precedence;
6680 parse_expression_infix_function infix_parser;
6683 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6686 * Prints an error message if an expression was expected but not read
6688 static expression_t *expected_expression_error(void)
6690 /* skip the error message if the error token was read */
6691 if (token.type != T_ERROR) {
6692 errorf(HERE, "expected expression, got token %K", &token);
6696 return create_invalid_expression();
6700 * Parse a string constant.
6702 static expression_t *parse_string_const(void)
6705 if (token.type == T_STRING_LITERAL) {
6706 string_t res = token.v.string;
6708 while (token.type == T_STRING_LITERAL) {
6709 res = concat_strings(&res, &token.v.string);
6712 if (token.type != T_WIDE_STRING_LITERAL) {
6713 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6714 /* note: that we use type_char_ptr here, which is already the
6715 * automatic converted type. revert_automatic_type_conversion
6716 * will construct the array type */
6717 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6718 cnst->string.value = res;
6722 wres = concat_string_wide_string(&res, &token.v.wide_string);
6724 wres = token.v.wide_string;
6729 switch (token.type) {
6730 case T_WIDE_STRING_LITERAL:
6731 wres = concat_wide_strings(&wres, &token.v.wide_string);
6734 case T_STRING_LITERAL:
6735 wres = concat_wide_string_string(&wres, &token.v.string);
6739 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6740 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6741 cnst->wide_string.value = wres;
6750 * Parse a boolean constant.
6752 static expression_t *parse_bool_const(bool value)
6754 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6755 cnst->base.type = type_bool;
6756 cnst->conste.v.int_value = value;
6764 * Parse an integer constant.
6766 static expression_t *parse_int_const(void)
6768 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6769 cnst->base.type = token.datatype;
6770 cnst->conste.v.int_value = token.v.intvalue;
6778 * Parse a character constant.
6780 static expression_t *parse_character_constant(void)
6782 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6783 cnst->base.type = token.datatype;
6784 cnst->conste.v.character = token.v.string;
6786 if (cnst->conste.v.character.size != 1) {
6788 errorf(HERE, "more than 1 character in character constant");
6789 } else if (warning.multichar) {
6790 warningf(HERE, "multi-character character constant");
6799 * Parse a wide character constant.
6801 static expression_t *parse_wide_character_constant(void)
6803 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6804 cnst->base.type = token.datatype;
6805 cnst->conste.v.wide_character = token.v.wide_string;
6807 if (cnst->conste.v.wide_character.size != 1) {
6809 errorf(HERE, "more than 1 character in character constant");
6810 } else if (warning.multichar) {
6811 warningf(HERE, "multi-character character constant");
6820 * Parse a float constant.
6822 static expression_t *parse_float_const(void)
6824 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6825 cnst->base.type = token.datatype;
6826 cnst->conste.v.float_value = token.v.floatvalue;
6833 static entity_t *create_implicit_function(symbol_t *symbol,
6834 const source_position_t *source_position)
6836 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6837 ntype->function.return_type = type_int;
6838 ntype->function.unspecified_parameters = true;
6839 ntype->function.linkage = LINKAGE_C;
6840 type_t *type = identify_new_type(ntype);
6842 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6843 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6844 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6845 entity->declaration.type = type;
6846 entity->declaration.implicit = true;
6847 entity->base.symbol = symbol;
6848 entity->base.source_position = *source_position;
6850 bool strict_prototypes_old = warning.strict_prototypes;
6851 warning.strict_prototypes = false;
6852 record_entity(entity, false);
6853 warning.strict_prototypes = strict_prototypes_old;
6859 * Creates a return_type (func)(argument_type) function type if not
6862 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6863 type_t *argument_type2)
6865 function_parameter_t *parameter2
6866 = obstack_alloc(type_obst, sizeof(parameter2[0]));
6867 memset(parameter2, 0, sizeof(parameter2[0]));
6868 parameter2->type = argument_type2;
6870 function_parameter_t *parameter1
6871 = obstack_alloc(type_obst, sizeof(parameter1[0]));
6872 memset(parameter1, 0, sizeof(parameter1[0]));
6873 parameter1->type = argument_type1;
6874 parameter1->next = parameter2;
6876 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6877 type->function.return_type = return_type;
6878 type->function.parameters = parameter1;
6880 return identify_new_type(type);
6884 * Creates a return_type (func)(argument_type) function type if not
6887 * @param return_type the return type
6888 * @param argument_type the argument type
6890 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6892 function_parameter_t *parameter
6893 = obstack_alloc(type_obst, sizeof(parameter[0]));
6894 memset(parameter, 0, sizeof(parameter[0]));
6895 parameter->type = argument_type;
6897 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6898 type->function.return_type = return_type;
6899 type->function.parameters = parameter;
6901 return identify_new_type(type);
6904 static type_t *make_function_1_type_variadic(type_t *return_type, type_t *argument_type)
6906 type_t *res = make_function_1_type(return_type, argument_type);
6907 res->function.variadic = 1;
6912 * Creates a return_type (func)(void) function type if not
6915 * @param return_type the return type
6917 static type_t *make_function_0_type(type_t *return_type)
6919 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6920 type->function.return_type = return_type;
6921 type->function.parameters = NULL;
6923 return identify_new_type(type);
6927 * Creates a NO_RETURN return_type (func)(void) function type if not
6930 * @param return_type the return type
6932 static type_t *make_function_0_type_noreturn(type_t *return_type)
6934 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6935 type->function.return_type = return_type;
6936 type->function.parameters = NULL;
6937 type->function.base.modifiers |= DM_NORETURN;
6940 return identify_new_type(type);
6944 * Performs automatic type cast as described in §6.3.2.1.
6946 * @param orig_type the original type
6948 static type_t *automatic_type_conversion(type_t *orig_type)
6950 type_t *type = skip_typeref(orig_type);
6951 if (is_type_array(type)) {
6952 array_type_t *array_type = &type->array;
6953 type_t *element_type = array_type->element_type;
6954 unsigned qualifiers = array_type->base.qualifiers;
6956 return make_pointer_type(element_type, qualifiers);
6959 if (is_type_function(type)) {
6960 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6967 * reverts the automatic casts of array to pointer types and function
6968 * to function-pointer types as defined §6.3.2.1
6970 type_t *revert_automatic_type_conversion(const expression_t *expression)
6972 switch (expression->kind) {
6973 case EXPR_REFERENCE: {
6974 entity_t *entity = expression->reference.entity;
6975 if (is_declaration(entity)) {
6976 return entity->declaration.type;
6977 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6978 return entity->enum_value.enum_type;
6980 panic("no declaration or enum in reference");
6985 entity_t *entity = expression->select.compound_entry;
6986 assert(is_declaration(entity));
6987 type_t *type = entity->declaration.type;
6988 return get_qualified_type(type,
6989 expression->base.type->base.qualifiers);
6992 case EXPR_UNARY_DEREFERENCE: {
6993 const expression_t *const value = expression->unary.value;
6994 type_t *const type = skip_typeref(value->base.type);
6995 if (!is_type_pointer(type))
6996 return type_error_type;
6997 return type->pointer.points_to;
7000 case EXPR_ARRAY_ACCESS: {
7001 const expression_t *array_ref = expression->array_access.array_ref;
7002 type_t *type_left = skip_typeref(array_ref->base.type);
7003 if (!is_type_pointer(type_left))
7004 return type_error_type;
7005 return type_left->pointer.points_to;
7008 case EXPR_STRING_LITERAL: {
7009 size_t size = expression->string.value.size;
7010 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
7013 case EXPR_WIDE_STRING_LITERAL: {
7014 size_t size = expression->wide_string.value.size;
7015 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
7018 case EXPR_COMPOUND_LITERAL:
7019 return expression->compound_literal.type;
7022 return expression->base.type;
7026 static expression_t *parse_reference(void)
7028 symbol_t *const symbol = token.v.symbol;
7030 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
7032 if (entity == NULL) {
7033 if (!strict_mode && look_ahead(1)->type == '(') {
7034 /* an implicitly declared function */
7035 if (warning.error_implicit_function_declaration) {
7036 errorf(HERE, "implicit declaration of function '%Y'", symbol);
7037 } else if (warning.implicit_function_declaration) {
7038 warningf(HERE, "implicit declaration of function '%Y'", symbol);
7041 entity = create_implicit_function(symbol, HERE);
7043 errorf(HERE, "unknown identifier '%Y' found.", symbol);
7044 entity = create_error_entity(symbol, ENTITY_VARIABLE);
7050 if (is_declaration(entity)) {
7051 orig_type = entity->declaration.type;
7052 } else if (entity->kind == ENTITY_ENUM_VALUE) {
7053 orig_type = entity->enum_value.enum_type;
7054 } else if (entity->kind == ENTITY_TYPEDEF) {
7055 errorf(HERE, "encountered typedef name '%Y' while parsing expression",
7058 return create_invalid_expression();
7060 panic("expected declaration or enum value in reference");
7063 /* we always do the auto-type conversions; the & and sizeof parser contains
7064 * code to revert this! */
7065 type_t *type = automatic_type_conversion(orig_type);
7067 expression_kind_t kind = EXPR_REFERENCE;
7068 if (entity->kind == ENTITY_ENUM_VALUE)
7069 kind = EXPR_REFERENCE_ENUM_VALUE;
7071 expression_t *expression = allocate_expression_zero(kind);
7072 expression->reference.entity = entity;
7073 expression->base.type = type;
7075 /* this declaration is used */
7076 if (is_declaration(entity)) {
7077 entity->declaration.used = true;
7080 if (entity->base.parent_scope != file_scope
7081 && entity->base.parent_scope->depth < current_function->parameters.depth
7082 && is_type_valid(orig_type) && !is_type_function(orig_type)) {
7083 if (entity->kind == ENTITY_VARIABLE) {
7084 /* access of a variable from an outer function */
7085 entity->variable.address_taken = true;
7086 } else if (entity->kind == ENTITY_PARAMETER) {
7087 entity->parameter.address_taken = true;
7089 current_function->need_closure = true;
7092 /* check for deprecated functions */
7093 if (warning.deprecated_declarations
7094 && is_declaration(entity)
7095 && entity->declaration.modifiers & DM_DEPRECATED) {
7096 declaration_t *declaration = &entity->declaration;
7098 char const *const prefix = entity->kind == ENTITY_FUNCTION ?
7099 "function" : "variable";
7101 if (declaration->deprecated_string != NULL) {
7102 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
7103 prefix, entity->base.symbol, &entity->base.source_position,
7104 declaration->deprecated_string);
7106 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
7107 entity->base.symbol, &entity->base.source_position);
7111 if (warning.init_self && entity == current_init_decl && !in_type_prop
7112 && entity->kind == ENTITY_VARIABLE) {
7113 current_init_decl = NULL;
7114 warningf(HERE, "variable '%#T' is initialized by itself",
7115 entity->declaration.type, entity->base.symbol);
7122 static bool semantic_cast(expression_t *cast)
7124 expression_t *expression = cast->unary.value;
7125 type_t *orig_dest_type = cast->base.type;
7126 type_t *orig_type_right = expression->base.type;
7127 type_t const *dst_type = skip_typeref(orig_dest_type);
7128 type_t const *src_type = skip_typeref(orig_type_right);
7129 source_position_t const *pos = &cast->base.source_position;
7131 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
7132 if (dst_type == type_void)
7135 /* only integer and pointer can be casted to pointer */
7136 if (is_type_pointer(dst_type) &&
7137 !is_type_pointer(src_type) &&
7138 !is_type_integer(src_type) &&
7139 is_type_valid(src_type)) {
7140 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
7144 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
7145 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
7149 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
7150 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
7154 if (warning.cast_qual &&
7155 is_type_pointer(src_type) &&
7156 is_type_pointer(dst_type)) {
7157 type_t *src = skip_typeref(src_type->pointer.points_to);
7158 type_t *dst = skip_typeref(dst_type->pointer.points_to);
7159 unsigned missing_qualifiers =
7160 src->base.qualifiers & ~dst->base.qualifiers;
7161 if (missing_qualifiers != 0) {
7163 "cast discards qualifiers '%Q' in pointer target type of '%T'",
7164 missing_qualifiers, orig_type_right);
7170 static expression_t *parse_compound_literal(type_t *type)
7172 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
7174 parse_initializer_env_t env;
7177 env.must_be_constant = false;
7178 initializer_t *initializer = parse_initializer(&env);
7181 expression->compound_literal.initializer = initializer;
7182 expression->compound_literal.type = type;
7183 expression->base.type = automatic_type_conversion(type);
7189 * Parse a cast expression.
7191 static expression_t *parse_cast(void)
7193 add_anchor_token(')');
7195 source_position_t source_position = token.source_position;
7197 type_t *type = parse_typename();
7199 rem_anchor_token(')');
7200 expect(')', end_error);
7202 if (token.type == '{') {
7203 return parse_compound_literal(type);
7206 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
7207 cast->base.source_position = source_position;
7209 expression_t *value = parse_sub_expression(PREC_CAST);
7210 cast->base.type = type;
7211 cast->unary.value = value;
7213 if (! semantic_cast(cast)) {
7214 /* TODO: record the error in the AST. else it is impossible to detect it */
7219 return create_invalid_expression();
7223 * Parse a statement expression.
7225 static expression_t *parse_statement_expression(void)
7227 add_anchor_token(')');
7229 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
7231 statement_t *statement = parse_compound_statement(true);
7232 statement->compound.stmt_expr = true;
7233 expression->statement.statement = statement;
7235 /* find last statement and use its type */
7236 type_t *type = type_void;
7237 const statement_t *stmt = statement->compound.statements;
7239 while (stmt->base.next != NULL)
7240 stmt = stmt->base.next;
7242 if (stmt->kind == STATEMENT_EXPRESSION) {
7243 type = stmt->expression.expression->base.type;
7245 } else if (warning.other) {
7246 warningf(&expression->base.source_position, "empty statement expression ({})");
7248 expression->base.type = type;
7250 rem_anchor_token(')');
7251 expect(')', end_error);
7258 * Parse a parenthesized expression.
7260 static expression_t *parse_parenthesized_expression(void)
7264 switch (token.type) {
7266 /* gcc extension: a statement expression */
7267 return parse_statement_expression();
7271 return parse_cast();
7273 if (is_typedef_symbol(token.v.symbol)) {
7274 return parse_cast();
7278 add_anchor_token(')');
7279 expression_t *result = parse_expression();
7280 result->base.parenthesized = true;
7281 rem_anchor_token(')');
7282 expect(')', end_error);
7288 static expression_t *parse_function_keyword(void)
7292 if (current_function == NULL) {
7293 errorf(HERE, "'__func__' used outside of a function");
7296 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7297 expression->base.type = type_char_ptr;
7298 expression->funcname.kind = FUNCNAME_FUNCTION;
7305 static expression_t *parse_pretty_function_keyword(void)
7307 if (current_function == NULL) {
7308 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
7311 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7312 expression->base.type = type_char_ptr;
7313 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
7315 eat(T___PRETTY_FUNCTION__);
7320 static expression_t *parse_funcsig_keyword(void)
7322 if (current_function == NULL) {
7323 errorf(HERE, "'__FUNCSIG__' used outside of a function");
7326 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7327 expression->base.type = type_char_ptr;
7328 expression->funcname.kind = FUNCNAME_FUNCSIG;
7335 static expression_t *parse_funcdname_keyword(void)
7337 if (current_function == NULL) {
7338 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
7341 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7342 expression->base.type = type_char_ptr;
7343 expression->funcname.kind = FUNCNAME_FUNCDNAME;
7345 eat(T___FUNCDNAME__);
7350 static designator_t *parse_designator(void)
7352 designator_t *result = allocate_ast_zero(sizeof(result[0]));
7353 result->source_position = *HERE;
7355 if (token.type != T_IDENTIFIER) {
7356 parse_error_expected("while parsing member designator",
7357 T_IDENTIFIER, NULL);
7360 result->symbol = token.v.symbol;
7363 designator_t *last_designator = result;
7365 if (token.type == '.') {
7367 if (token.type != T_IDENTIFIER) {
7368 parse_error_expected("while parsing member designator",
7369 T_IDENTIFIER, NULL);
7372 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
7373 designator->source_position = *HERE;
7374 designator->symbol = token.v.symbol;
7377 last_designator->next = designator;
7378 last_designator = designator;
7381 if (token.type == '[') {
7383 add_anchor_token(']');
7384 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
7385 designator->source_position = *HERE;
7386 designator->array_index = parse_expression();
7387 rem_anchor_token(']');
7388 expect(']', end_error);
7389 if (designator->array_index == NULL) {
7393 last_designator->next = designator;
7394 last_designator = designator;
7406 * Parse the __builtin_offsetof() expression.
7408 static expression_t *parse_offsetof(void)
7410 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
7411 expression->base.type = type_size_t;
7413 eat(T___builtin_offsetof);
7415 expect('(', end_error);
7416 add_anchor_token(',');
7417 type_t *type = parse_typename();
7418 rem_anchor_token(',');
7419 expect(',', end_error);
7420 add_anchor_token(')');
7421 designator_t *designator = parse_designator();
7422 rem_anchor_token(')');
7423 expect(')', end_error);
7425 expression->offsetofe.type = type;
7426 expression->offsetofe.designator = designator;
7429 memset(&path, 0, sizeof(path));
7430 path.top_type = type;
7431 path.path = NEW_ARR_F(type_path_entry_t, 0);
7433 descend_into_subtype(&path);
7435 if (!walk_designator(&path, designator, true)) {
7436 return create_invalid_expression();
7439 DEL_ARR_F(path.path);
7443 return create_invalid_expression();
7447 * Parses a _builtin_va_start() expression.
7449 static expression_t *parse_va_start(void)
7451 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
7453 eat(T___builtin_va_start);
7455 expect('(', end_error);
7456 add_anchor_token(',');
7457 expression->va_starte.ap = parse_assignment_expression();
7458 rem_anchor_token(',');
7459 expect(',', end_error);
7460 expression_t *const expr = parse_assignment_expression();
7461 if (expr->kind == EXPR_REFERENCE) {
7462 entity_t *const entity = expr->reference.entity;
7463 if (entity->base.parent_scope != ¤t_function->parameters
7464 || entity->base.next != NULL
7465 || entity->kind != ENTITY_PARAMETER) {
7466 errorf(&expr->base.source_position,
7467 "second argument of 'va_start' must be last parameter of the current function");
7469 expression->va_starte.parameter = &entity->variable;
7471 expect(')', end_error);
7474 expect(')', end_error);
7476 return create_invalid_expression();
7480 * Parses a _builtin_va_arg() expression.
7482 static expression_t *parse_va_arg(void)
7484 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
7486 eat(T___builtin_va_arg);
7488 expect('(', end_error);
7489 expression->va_arge.ap = parse_assignment_expression();
7490 expect(',', end_error);
7491 expression->base.type = parse_typename();
7492 expect(')', end_error);
7496 return create_invalid_expression();
7500 * Parses a __builtin_constant_p() expression.
7502 static expression_t *parse_builtin_constant(void)
7504 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
7506 eat(T___builtin_constant_p);
7508 expect('(', end_error);
7509 add_anchor_token(')');
7510 expression->builtin_constant.value = parse_assignment_expression();
7511 rem_anchor_token(')');
7512 expect(')', end_error);
7513 expression->base.type = type_int;
7517 return create_invalid_expression();
7521 * Parses a __builtin_types_compatible_p() expression.
7523 static expression_t *parse_builtin_types_compatible(void)
7525 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
7527 eat(T___builtin_types_compatible_p);
7529 expect('(', end_error);
7530 add_anchor_token(')');
7531 add_anchor_token(',');
7532 expression->builtin_types_compatible.left = parse_typename();
7533 rem_anchor_token(',');
7534 expect(',', end_error);
7535 expression->builtin_types_compatible.right = parse_typename();
7536 rem_anchor_token(')');
7537 expect(')', end_error);
7538 expression->base.type = type_int;
7542 return create_invalid_expression();
7546 * Parses a __builtin_is_*() compare expression.
7548 static expression_t *parse_compare_builtin(void)
7550 expression_t *expression;
7552 switch (token.type) {
7553 case T___builtin_isgreater:
7554 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
7556 case T___builtin_isgreaterequal:
7557 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
7559 case T___builtin_isless:
7560 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
7562 case T___builtin_islessequal:
7563 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
7565 case T___builtin_islessgreater:
7566 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
7568 case T___builtin_isunordered:
7569 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
7572 internal_errorf(HERE, "invalid compare builtin found");
7574 expression->base.source_position = *HERE;
7577 expect('(', end_error);
7578 expression->binary.left = parse_assignment_expression();
7579 expect(',', end_error);
7580 expression->binary.right = parse_assignment_expression();
7581 expect(')', end_error);
7583 type_t *const orig_type_left = expression->binary.left->base.type;
7584 type_t *const orig_type_right = expression->binary.right->base.type;
7586 type_t *const type_left = skip_typeref(orig_type_left);
7587 type_t *const type_right = skip_typeref(orig_type_right);
7588 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7589 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7590 type_error_incompatible("invalid operands in comparison",
7591 &expression->base.source_position, orig_type_left, orig_type_right);
7594 semantic_comparison(&expression->binary);
7599 return create_invalid_expression();
7604 * Parses a __builtin_expect(, end_error) expression.
7606 static expression_t *parse_builtin_expect(void, end_error)
7608 expression_t *expression
7609 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7611 eat(T___builtin_expect);
7613 expect('(', end_error);
7614 expression->binary.left = parse_assignment_expression();
7615 expect(',', end_error);
7616 expression->binary.right = parse_constant_expression();
7617 expect(')', end_error);
7619 expression->base.type = expression->binary.left->base.type;
7623 return create_invalid_expression();
7628 * Parses a MS assume() expression.
7630 static expression_t *parse_assume(void)
7632 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7636 expect('(', end_error);
7637 add_anchor_token(')');
7638 expression->unary.value = parse_assignment_expression();
7639 rem_anchor_token(')');
7640 expect(')', end_error);
7642 expression->base.type = type_void;
7645 return create_invalid_expression();
7649 * Return the declaration for a given label symbol or create a new one.
7651 * @param symbol the symbol of the label
7653 static label_t *get_label(symbol_t *symbol)
7656 assert(current_function != NULL);
7658 label = get_entity(symbol, NAMESPACE_LABEL);
7659 /* if we found a local label, we already created the declaration */
7660 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7661 if (label->base.parent_scope != current_scope) {
7662 assert(label->base.parent_scope->depth < current_scope->depth);
7663 current_function->goto_to_outer = true;
7665 return &label->label;
7668 label = get_entity(symbol, NAMESPACE_LABEL);
7669 /* if we found a label in the same function, then we already created the
7672 && label->base.parent_scope == ¤t_function->parameters) {
7673 return &label->label;
7676 /* otherwise we need to create a new one */
7677 label = allocate_entity_zero(ENTITY_LABEL);
7678 label->base.namespc = NAMESPACE_LABEL;
7679 label->base.symbol = symbol;
7683 return &label->label;
7687 * Parses a GNU && label address expression.
7689 static expression_t *parse_label_address(void)
7691 source_position_t source_position = token.source_position;
7693 if (token.type != T_IDENTIFIER) {
7694 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7697 symbol_t *symbol = token.v.symbol;
7700 label_t *label = get_label(symbol);
7702 label->address_taken = true;
7704 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7705 expression->base.source_position = source_position;
7707 /* label address is threaten as a void pointer */
7708 expression->base.type = type_void_ptr;
7709 expression->label_address.label = label;
7712 return create_invalid_expression();
7716 * Parse a microsoft __noop expression.
7718 static expression_t *parse_noop_expression(void)
7720 /* the result is a (int)0 */
7721 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7722 cnst->base.type = type_int;
7723 cnst->conste.v.int_value = 0;
7724 cnst->conste.is_ms_noop = true;
7728 if (token.type == '(') {
7729 /* parse arguments */
7731 add_anchor_token(')');
7732 add_anchor_token(',');
7734 if (token.type != ')') {
7736 (void)parse_assignment_expression();
7737 if (token.type != ',')
7743 rem_anchor_token(',');
7744 rem_anchor_token(')');
7745 expect(')', end_error);
7752 * Parses a primary expression.
7754 static expression_t *parse_primary_expression(void)
7756 switch (token.type) {
7757 case T_false: return parse_bool_const(false);
7758 case T_true: return parse_bool_const(true);
7759 case T_INTEGER: return parse_int_const();
7760 case T_CHARACTER_CONSTANT: return parse_character_constant();
7761 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7762 case T_FLOATINGPOINT: return parse_float_const();
7763 case T_STRING_LITERAL:
7764 case T_WIDE_STRING_LITERAL: return parse_string_const();
7765 case T_IDENTIFIER: return parse_reference();
7766 case T___FUNCTION__:
7767 case T___func__: return parse_function_keyword();
7768 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7769 case T___FUNCSIG__: return parse_funcsig_keyword();
7770 case T___FUNCDNAME__: return parse_funcdname_keyword();
7771 case T___builtin_offsetof: return parse_offsetof();
7772 case T___builtin_va_start: return parse_va_start();
7773 case T___builtin_va_arg: return parse_va_arg();
7774 case T___builtin_isgreater:
7775 case T___builtin_isgreaterequal:
7776 case T___builtin_isless:
7777 case T___builtin_islessequal:
7778 case T___builtin_islessgreater:
7779 case T___builtin_isunordered: return parse_compare_builtin();
7780 case T___builtin_constant_p: return parse_builtin_constant();
7781 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7782 case T__assume: return parse_assume();
7785 return parse_label_address();
7788 case '(': return parse_parenthesized_expression();
7789 case T___noop: return parse_noop_expression();
7792 errorf(HERE, "unexpected token %K, expected an expression", &token);
7793 return create_invalid_expression();
7797 * Check if the expression has the character type and issue a warning then.
7799 static void check_for_char_index_type(const expression_t *expression)
7801 type_t *const type = expression->base.type;
7802 const type_t *const base_type = skip_typeref(type);
7804 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7805 warning.char_subscripts) {
7806 warningf(&expression->base.source_position,
7807 "array subscript has type '%T'", type);
7811 static expression_t *parse_array_expression(expression_t *left)
7813 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7816 add_anchor_token(']');
7818 expression_t *inside = parse_expression();
7820 type_t *const orig_type_left = left->base.type;
7821 type_t *const orig_type_inside = inside->base.type;
7823 type_t *const type_left = skip_typeref(orig_type_left);
7824 type_t *const type_inside = skip_typeref(orig_type_inside);
7826 type_t *return_type;
7827 array_access_expression_t *array_access = &expression->array_access;
7828 if (is_type_pointer(type_left)) {
7829 return_type = type_left->pointer.points_to;
7830 array_access->array_ref = left;
7831 array_access->index = inside;
7832 check_for_char_index_type(inside);
7833 } else if (is_type_pointer(type_inside)) {
7834 return_type = type_inside->pointer.points_to;
7835 array_access->array_ref = inside;
7836 array_access->index = left;
7837 array_access->flipped = true;
7838 check_for_char_index_type(left);
7840 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7842 "array access on object with non-pointer types '%T', '%T'",
7843 orig_type_left, orig_type_inside);
7845 return_type = type_error_type;
7846 array_access->array_ref = left;
7847 array_access->index = inside;
7850 expression->base.type = automatic_type_conversion(return_type);
7852 rem_anchor_token(']');
7853 expect(']', end_error);
7858 static expression_t *parse_typeprop(expression_kind_t const kind)
7860 expression_t *tp_expression = allocate_expression_zero(kind);
7861 tp_expression->base.type = type_size_t;
7863 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7865 /* we only refer to a type property, mark this case */
7866 bool old = in_type_prop;
7867 in_type_prop = true;
7870 expression_t *expression;
7871 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7873 add_anchor_token(')');
7874 orig_type = parse_typename();
7875 rem_anchor_token(')');
7876 expect(')', end_error);
7878 if (token.type == '{') {
7879 /* It was not sizeof(type) after all. It is sizeof of an expression
7880 * starting with a compound literal */
7881 expression = parse_compound_literal(orig_type);
7882 goto typeprop_expression;
7885 expression = parse_sub_expression(PREC_UNARY);
7887 typeprop_expression:
7888 tp_expression->typeprop.tp_expression = expression;
7890 orig_type = revert_automatic_type_conversion(expression);
7891 expression->base.type = orig_type;
7894 tp_expression->typeprop.type = orig_type;
7895 type_t const* const type = skip_typeref(orig_type);
7896 char const* const wrong_type =
7897 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7898 is_type_incomplete(type) ? "incomplete" :
7899 type->kind == TYPE_FUNCTION ? "function designator" :
7900 type->kind == TYPE_BITFIELD ? "bitfield" :
7902 if (wrong_type != NULL) {
7903 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7904 errorf(&tp_expression->base.source_position,
7905 "operand of %s expression must not be of %s type '%T'",
7906 what, wrong_type, orig_type);
7911 return tp_expression;
7914 static expression_t *parse_sizeof(void)
7916 return parse_typeprop(EXPR_SIZEOF);
7919 static expression_t *parse_alignof(void)
7921 return parse_typeprop(EXPR_ALIGNOF);
7924 static expression_t *parse_select_expression(expression_t *compound)
7926 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7927 select->select.compound = compound;
7929 assert(token.type == '.' || token.type == T_MINUSGREATER);
7930 bool is_pointer = (token.type == T_MINUSGREATER);
7933 if (token.type != T_IDENTIFIER) {
7934 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7937 symbol_t *symbol = token.v.symbol;
7940 type_t *const orig_type = compound->base.type;
7941 type_t *const type = skip_typeref(orig_type);
7944 bool saw_error = false;
7945 if (is_type_pointer(type)) {
7948 "request for member '%Y' in something not a struct or union, but '%T'",
7952 type_left = skip_typeref(type->pointer.points_to);
7954 if (is_pointer && is_type_valid(type)) {
7955 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7962 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7963 type_left->kind == TYPE_COMPOUND_UNION) {
7964 compound_t *compound = type_left->compound.compound;
7966 if (!compound->complete) {
7967 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7969 goto create_error_entry;
7972 entry = find_compound_entry(compound, symbol);
7973 if (entry == NULL) {
7974 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7975 goto create_error_entry;
7978 if (is_type_valid(type_left) && !saw_error) {
7980 "request for member '%Y' in something not a struct or union, but '%T'",
7984 entry = create_error_entity(symbol, ENTITY_COMPOUND_MEMBER);
7987 assert(is_declaration(entry));
7988 select->select.compound_entry = entry;
7990 type_t *entry_type = entry->declaration.type;
7992 = get_qualified_type(entry_type, type_left->base.qualifiers);
7994 /* we always do the auto-type conversions; the & and sizeof parser contains
7995 * code to revert this! */
7996 select->base.type = automatic_type_conversion(res_type);
7998 type_t *skipped = skip_typeref(res_type);
7999 if (skipped->kind == TYPE_BITFIELD) {
8000 select->base.type = skipped->bitfield.base_type;
8006 static void check_call_argument(const function_parameter_t *parameter,
8007 call_argument_t *argument, unsigned pos)
8009 type_t *expected_type = parameter->type;
8010 type_t *expected_type_skip = skip_typeref(expected_type);
8011 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
8012 expression_t *arg_expr = argument->expression;
8013 type_t *arg_type = skip_typeref(arg_expr->base.type);
8015 /* handle transparent union gnu extension */
8016 if (is_type_union(expected_type_skip)
8017 && (expected_type_skip->base.modifiers
8018 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
8019 compound_t *union_decl = expected_type_skip->compound.compound;
8020 type_t *best_type = NULL;
8021 entity_t *entry = union_decl->members.entities;
8022 for ( ; entry != NULL; entry = entry->base.next) {
8023 assert(is_declaration(entry));
8024 type_t *decl_type = entry->declaration.type;
8025 error = semantic_assign(decl_type, arg_expr);
8026 if (error == ASSIGN_ERROR_INCOMPATIBLE
8027 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
8030 if (error == ASSIGN_SUCCESS) {
8031 best_type = decl_type;
8032 } else if (best_type == NULL) {
8033 best_type = decl_type;
8037 if (best_type != NULL) {
8038 expected_type = best_type;
8042 error = semantic_assign(expected_type, arg_expr);
8043 argument->expression = create_implicit_cast(argument->expression,
8046 if (error != ASSIGN_SUCCESS) {
8047 /* report exact scope in error messages (like "in argument 3") */
8049 snprintf(buf, sizeof(buf), "call argument %u", pos);
8050 report_assign_error(error, expected_type, arg_expr, buf,
8051 &arg_expr->base.source_position);
8052 } else if (warning.traditional || warning.conversion) {
8053 type_t *const promoted_type = get_default_promoted_type(arg_type);
8054 if (!types_compatible(expected_type_skip, promoted_type) &&
8055 !types_compatible(expected_type_skip, type_void_ptr) &&
8056 !types_compatible(type_void_ptr, promoted_type)) {
8057 /* Deliberately show the skipped types in this warning */
8058 warningf(&arg_expr->base.source_position,
8059 "passing call argument %u as '%T' rather than '%T' due to prototype",
8060 pos, expected_type_skip, promoted_type);
8066 * Handle the semantic restrictions of builtin calls
8068 static void handle_builtin_argument_restrictions(call_expression_t *call) {
8069 switch (call->function->reference.entity->function.btk) {
8070 case bk_gnu_builtin_return_address:
8071 case bk_gnu_builtin_frame_address: {
8072 /* argument must be constant */
8073 call_argument_t *argument = call->arguments;
8075 if (! is_constant_expression(argument->expression)) {
8076 errorf(&call->base.source_position,
8077 "argument of '%Y' must be a constant expression",
8078 call->function->reference.entity->base.symbol);
8082 case bk_gnu_builtin_prefetch: {
8083 /* second and third argument must be constant if existent */
8084 call_argument_t *rw = call->arguments->next;
8085 call_argument_t *locality = NULL;
8088 if (! is_constant_expression(rw->expression)) {
8089 errorf(&call->base.source_position,
8090 "second argument of '%Y' must be a constant expression",
8091 call->function->reference.entity->base.symbol);
8093 locality = rw->next;
8095 if (locality != NULL) {
8096 if (! is_constant_expression(locality->expression)) {
8097 errorf(&call->base.source_position,
8098 "third argument of '%Y' must be a constant expression",
8099 call->function->reference.entity->base.symbol);
8101 locality = rw->next;
8111 * Parse a call expression, ie. expression '( ... )'.
8113 * @param expression the function address
8115 static expression_t *parse_call_expression(expression_t *expression)
8117 expression_t *result = allocate_expression_zero(EXPR_CALL);
8118 call_expression_t *call = &result->call;
8119 call->function = expression;
8121 type_t *const orig_type = expression->base.type;
8122 type_t *const type = skip_typeref(orig_type);
8124 function_type_t *function_type = NULL;
8125 if (is_type_pointer(type)) {
8126 type_t *const to_type = skip_typeref(type->pointer.points_to);
8128 if (is_type_function(to_type)) {
8129 function_type = &to_type->function;
8130 call->base.type = function_type->return_type;
8134 if (function_type == NULL && is_type_valid(type)) {
8135 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
8138 /* parse arguments */
8140 add_anchor_token(')');
8141 add_anchor_token(',');
8143 if (token.type != ')') {
8144 call_argument_t *last_argument = NULL;
8147 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8149 argument->expression = parse_assignment_expression();
8150 if (last_argument == NULL) {
8151 call->arguments = argument;
8153 last_argument->next = argument;
8155 last_argument = argument;
8157 if (token.type != ',')
8162 rem_anchor_token(',');
8163 rem_anchor_token(')');
8164 expect(')', end_error);
8166 if (function_type == NULL)
8169 function_parameter_t *parameter = function_type->parameters;
8170 call_argument_t *argument = call->arguments;
8171 if (!function_type->unspecified_parameters) {
8172 for (unsigned pos = 0; parameter != NULL && argument != NULL;
8173 parameter = parameter->next, argument = argument->next) {
8174 check_call_argument(parameter, argument, ++pos);
8177 if (parameter != NULL) {
8178 errorf(HERE, "too few arguments to function '%E'", expression);
8179 } else if (argument != NULL && !function_type->variadic) {
8180 errorf(HERE, "too many arguments to function '%E'", expression);
8184 /* do default promotion */
8185 for (; argument != NULL; argument = argument->next) {
8186 type_t *type = argument->expression->base.type;
8188 type = get_default_promoted_type(type);
8190 argument->expression
8191 = create_implicit_cast(argument->expression, type);
8194 check_format(&result->call);
8196 if (warning.aggregate_return &&
8197 is_type_compound(skip_typeref(function_type->return_type))) {
8198 warningf(&result->base.source_position,
8199 "function call has aggregate value");
8202 if (call->function->kind == EXPR_REFERENCE) {
8203 reference_expression_t *reference = &call->function->reference;
8204 if (reference->entity->kind == ENTITY_FUNCTION &&
8205 reference->entity->function.btk != bk_none)
8206 handle_builtin_argument_restrictions(call);
8213 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
8215 static bool same_compound_type(const type_t *type1, const type_t *type2)
8218 is_type_compound(type1) &&
8219 type1->kind == type2->kind &&
8220 type1->compound.compound == type2->compound.compound;
8223 static expression_t const *get_reference_address(expression_t const *expr)
8225 bool regular_take_address = true;
8227 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8228 expr = expr->unary.value;
8230 regular_take_address = false;
8233 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8236 expr = expr->unary.value;
8239 if (expr->kind != EXPR_REFERENCE)
8242 /* special case for functions which are automatically converted to a
8243 * pointer to function without an extra TAKE_ADDRESS operation */
8244 if (!regular_take_address &&
8245 expr->reference.entity->kind != ENTITY_FUNCTION) {
8252 static void warn_reference_address_as_bool(expression_t const* expr)
8254 if (!warning.address)
8257 expr = get_reference_address(expr);
8259 warningf(&expr->base.source_position,
8260 "the address of '%Y' will always evaluate as 'true'",
8261 expr->reference.entity->base.symbol);
8265 static void warn_assignment_in_condition(const expression_t *const expr)
8267 if (!warning.parentheses)
8269 if (expr->base.kind != EXPR_BINARY_ASSIGN)
8271 if (expr->base.parenthesized)
8273 warningf(&expr->base.source_position,
8274 "suggest parentheses around assignment used as truth value");
8277 static void semantic_condition(expression_t const *const expr,
8278 char const *const context)
8280 type_t *const type = skip_typeref(expr->base.type);
8281 if (is_type_scalar(type)) {
8282 warn_reference_address_as_bool(expr);
8283 warn_assignment_in_condition(expr);
8284 } else if (is_type_valid(type)) {
8285 errorf(&expr->base.source_position,
8286 "%s must have scalar type", context);
8291 * Parse a conditional expression, ie. 'expression ? ... : ...'.
8293 * @param expression the conditional expression
8295 static expression_t *parse_conditional_expression(expression_t *expression)
8297 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
8299 conditional_expression_t *conditional = &result->conditional;
8300 conditional->condition = expression;
8303 add_anchor_token(':');
8305 /* §6.5.15:2 The first operand shall have scalar type. */
8306 semantic_condition(expression, "condition of conditional operator");
8308 expression_t *true_expression = expression;
8309 bool gnu_cond = false;
8310 if (GNU_MODE && token.type == ':') {
8313 true_expression = parse_expression();
8315 rem_anchor_token(':');
8316 expect(':', end_error);
8318 expression_t *false_expression =
8319 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
8321 type_t *const orig_true_type = true_expression->base.type;
8322 type_t *const orig_false_type = false_expression->base.type;
8323 type_t *const true_type = skip_typeref(orig_true_type);
8324 type_t *const false_type = skip_typeref(orig_false_type);
8327 type_t *result_type;
8328 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
8329 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
8330 /* ISO/IEC 14882:1998(E) §5.16:2 */
8331 if (true_expression->kind == EXPR_UNARY_THROW) {
8332 result_type = false_type;
8333 } else if (false_expression->kind == EXPR_UNARY_THROW) {
8334 result_type = true_type;
8336 if (warning.other && (
8337 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
8338 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
8340 warningf(&conditional->base.source_position,
8341 "ISO C forbids conditional expression with only one void side");
8343 result_type = type_void;
8345 } else if (is_type_arithmetic(true_type)
8346 && is_type_arithmetic(false_type)) {
8347 result_type = semantic_arithmetic(true_type, false_type);
8349 true_expression = create_implicit_cast(true_expression, result_type);
8350 false_expression = create_implicit_cast(false_expression, result_type);
8352 conditional->true_expression = true_expression;
8353 conditional->false_expression = false_expression;
8354 conditional->base.type = result_type;
8355 } else if (same_compound_type(true_type, false_type)) {
8356 /* just take 1 of the 2 types */
8357 result_type = true_type;
8358 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
8359 type_t *pointer_type;
8361 expression_t *other_expression;
8362 if (is_type_pointer(true_type) &&
8363 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
8364 pointer_type = true_type;
8365 other_type = false_type;
8366 other_expression = false_expression;
8368 pointer_type = false_type;
8369 other_type = true_type;
8370 other_expression = true_expression;
8373 if (is_null_pointer_constant(other_expression)) {
8374 result_type = pointer_type;
8375 } else if (is_type_pointer(other_type)) {
8376 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
8377 type_t *to2 = skip_typeref(other_type->pointer.points_to);
8380 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
8381 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
8383 } else if (types_compatible(get_unqualified_type(to1),
8384 get_unqualified_type(to2))) {
8387 if (warning.other) {
8388 warningf(&conditional->base.source_position,
8389 "pointer types '%T' and '%T' in conditional expression are incompatible",
8390 true_type, false_type);
8395 type_t *const type =
8396 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
8397 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
8398 } else if (is_type_integer(other_type)) {
8399 if (warning.other) {
8400 warningf(&conditional->base.source_position,
8401 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
8403 result_type = pointer_type;
8405 if (is_type_valid(other_type)) {
8406 type_error_incompatible("while parsing conditional",
8407 &expression->base.source_position, true_type, false_type);
8409 result_type = type_error_type;
8412 if (is_type_valid(true_type) && is_type_valid(false_type)) {
8413 type_error_incompatible("while parsing conditional",
8414 &conditional->base.source_position, true_type,
8417 result_type = type_error_type;
8420 conditional->true_expression
8421 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
8422 conditional->false_expression
8423 = create_implicit_cast(false_expression, result_type);
8424 conditional->base.type = result_type;
8429 * Parse an extension expression.
8431 static expression_t *parse_extension(void)
8433 eat(T___extension__);
8435 bool old_gcc_extension = in_gcc_extension;
8436 in_gcc_extension = true;
8437 expression_t *expression = parse_sub_expression(PREC_UNARY);
8438 in_gcc_extension = old_gcc_extension;
8443 * Parse a __builtin_classify_type() expression.
8445 static expression_t *parse_builtin_classify_type(void)
8447 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
8448 result->base.type = type_int;
8450 eat(T___builtin_classify_type);
8452 expect('(', end_error);
8453 add_anchor_token(')');
8454 expression_t *expression = parse_expression();
8455 rem_anchor_token(')');
8456 expect(')', end_error);
8457 result->classify_type.type_expression = expression;
8461 return create_invalid_expression();
8465 * Parse a delete expression
8466 * ISO/IEC 14882:1998(E) §5.3.5
8468 static expression_t *parse_delete(void)
8470 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
8471 result->base.type = type_void;
8475 if (token.type == '[') {
8477 result->kind = EXPR_UNARY_DELETE_ARRAY;
8478 expect(']', end_error);
8482 expression_t *const value = parse_sub_expression(PREC_CAST);
8483 result->unary.value = value;
8485 type_t *const type = skip_typeref(value->base.type);
8486 if (!is_type_pointer(type)) {
8487 if (is_type_valid(type)) {
8488 errorf(&value->base.source_position,
8489 "operand of delete must have pointer type");
8491 } else if (warning.other &&
8492 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
8493 warningf(&value->base.source_position,
8494 "deleting 'void*' is undefined");
8501 * Parse a throw expression
8502 * ISO/IEC 14882:1998(E) §15:1
8504 static expression_t *parse_throw(void)
8506 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
8507 result->base.type = type_void;
8511 expression_t *value = NULL;
8512 switch (token.type) {
8514 value = parse_assignment_expression();
8515 /* ISO/IEC 14882:1998(E) §15.1:3 */
8516 type_t *const orig_type = value->base.type;
8517 type_t *const type = skip_typeref(orig_type);
8518 if (is_type_incomplete(type)) {
8519 errorf(&value->base.source_position,
8520 "cannot throw object of incomplete type '%T'", orig_type);
8521 } else if (is_type_pointer(type)) {
8522 type_t *const points_to = skip_typeref(type->pointer.points_to);
8523 if (is_type_incomplete(points_to) &&
8524 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8525 errorf(&value->base.source_position,
8526 "cannot throw pointer to incomplete type '%T'", orig_type);
8534 result->unary.value = value;
8539 static bool check_pointer_arithmetic(const source_position_t *source_position,
8540 type_t *pointer_type,
8541 type_t *orig_pointer_type)
8543 type_t *points_to = pointer_type->pointer.points_to;
8544 points_to = skip_typeref(points_to);
8546 if (is_type_incomplete(points_to)) {
8547 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8548 errorf(source_position,
8549 "arithmetic with pointer to incomplete type '%T' not allowed",
8552 } else if (warning.pointer_arith) {
8553 warningf(source_position,
8554 "pointer of type '%T' used in arithmetic",
8557 } else if (is_type_function(points_to)) {
8559 errorf(source_position,
8560 "arithmetic with pointer to function type '%T' not allowed",
8563 } else if (warning.pointer_arith) {
8564 warningf(source_position,
8565 "pointer to a function '%T' used in arithmetic",
8572 static bool is_lvalue(const expression_t *expression)
8574 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
8575 switch (expression->kind) {
8576 case EXPR_ARRAY_ACCESS:
8577 case EXPR_COMPOUND_LITERAL:
8578 case EXPR_REFERENCE:
8580 case EXPR_UNARY_DEREFERENCE:
8584 type_t *type = skip_typeref(expression->base.type);
8586 /* ISO/IEC 14882:1998(E) §3.10:3 */
8587 is_type_reference(type) ||
8588 /* Claim it is an lvalue, if the type is invalid. There was a parse
8589 * error before, which maybe prevented properly recognizing it as
8591 !is_type_valid(type);
8596 static void semantic_incdec(unary_expression_t *expression)
8598 type_t *const orig_type = expression->value->base.type;
8599 type_t *const type = skip_typeref(orig_type);
8600 if (is_type_pointer(type)) {
8601 if (!check_pointer_arithmetic(&expression->base.source_position,
8605 } else if (!is_type_real(type) && is_type_valid(type)) {
8606 /* TODO: improve error message */
8607 errorf(&expression->base.source_position,
8608 "operation needs an arithmetic or pointer type");
8611 if (!is_lvalue(expression->value)) {
8612 /* TODO: improve error message */
8613 errorf(&expression->base.source_position, "lvalue required as operand");
8615 expression->base.type = orig_type;
8618 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8620 type_t *const orig_type = expression->value->base.type;
8621 type_t *const type = skip_typeref(orig_type);
8622 if (!is_type_arithmetic(type)) {
8623 if (is_type_valid(type)) {
8624 /* TODO: improve error message */
8625 errorf(&expression->base.source_position,
8626 "operation needs an arithmetic type");
8631 expression->base.type = orig_type;
8634 static void semantic_unexpr_plus(unary_expression_t *expression)
8636 semantic_unexpr_arithmetic(expression);
8637 if (warning.traditional)
8638 warningf(&expression->base.source_position,
8639 "traditional C rejects the unary plus operator");
8642 static void semantic_not(unary_expression_t *expression)
8644 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8645 semantic_condition(expression->value, "operand of !");
8646 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8649 static void semantic_unexpr_integer(unary_expression_t *expression)
8651 type_t *const orig_type = expression->value->base.type;
8652 type_t *const type = skip_typeref(orig_type);
8653 if (!is_type_integer(type)) {
8654 if (is_type_valid(type)) {
8655 errorf(&expression->base.source_position,
8656 "operand of ~ must be of integer type");
8661 expression->base.type = orig_type;
8664 static void semantic_dereference(unary_expression_t *expression)
8666 type_t *const orig_type = expression->value->base.type;
8667 type_t *const type = skip_typeref(orig_type);
8668 if (!is_type_pointer(type)) {
8669 if (is_type_valid(type)) {
8670 errorf(&expression->base.source_position,
8671 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8676 type_t *result_type = type->pointer.points_to;
8677 result_type = automatic_type_conversion(result_type);
8678 expression->base.type = result_type;
8682 * Record that an address is taken (expression represents an lvalue).
8684 * @param expression the expression
8685 * @param may_be_register if true, the expression might be an register
8687 static void set_address_taken(expression_t *expression, bool may_be_register)
8689 if (expression->kind != EXPR_REFERENCE)
8692 entity_t *const entity = expression->reference.entity;
8694 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8697 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8698 && !may_be_register) {
8699 errorf(&expression->base.source_position,
8700 "address of register %s '%Y' requested",
8701 get_entity_kind_name(entity->kind), entity->base.symbol);
8704 if (entity->kind == ENTITY_VARIABLE) {
8705 entity->variable.address_taken = true;
8707 assert(entity->kind == ENTITY_PARAMETER);
8708 entity->parameter.address_taken = true;
8713 * Check the semantic of the address taken expression.
8715 static void semantic_take_addr(unary_expression_t *expression)
8717 expression_t *value = expression->value;
8718 value->base.type = revert_automatic_type_conversion(value);
8720 type_t *orig_type = value->base.type;
8721 type_t *type = skip_typeref(orig_type);
8722 if (!is_type_valid(type))
8726 if (!is_lvalue(value)) {
8727 errorf(&expression->base.source_position, "'&' requires an lvalue");
8729 if (type->kind == TYPE_BITFIELD) {
8730 errorf(&expression->base.source_position,
8731 "'&' not allowed on object with bitfield type '%T'",
8735 set_address_taken(value, false);
8737 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8740 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8741 static expression_t *parse_##unexpression_type(void) \
8743 expression_t *unary_expression \
8744 = allocate_expression_zero(unexpression_type); \
8746 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8748 sfunc(&unary_expression->unary); \
8750 return unary_expression; \
8753 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8754 semantic_unexpr_arithmetic)
8755 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8756 semantic_unexpr_plus)
8757 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8759 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8760 semantic_dereference)
8761 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8763 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8764 semantic_unexpr_integer)
8765 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8767 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8770 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8772 static expression_t *parse_##unexpression_type(expression_t *left) \
8774 expression_t *unary_expression \
8775 = allocate_expression_zero(unexpression_type); \
8777 unary_expression->unary.value = left; \
8779 sfunc(&unary_expression->unary); \
8781 return unary_expression; \
8784 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8785 EXPR_UNARY_POSTFIX_INCREMENT,
8787 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8788 EXPR_UNARY_POSTFIX_DECREMENT,
8791 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8793 /* TODO: handle complex + imaginary types */
8795 type_left = get_unqualified_type(type_left);
8796 type_right = get_unqualified_type(type_right);
8798 /* §6.3.1.8 Usual arithmetic conversions */
8799 if (type_left == type_long_double || type_right == type_long_double) {
8800 return type_long_double;
8801 } else if (type_left == type_double || type_right == type_double) {
8803 } else if (type_left == type_float || type_right == type_float) {
8807 type_left = promote_integer(type_left);
8808 type_right = promote_integer(type_right);
8810 if (type_left == type_right)
8813 bool const signed_left = is_type_signed(type_left);
8814 bool const signed_right = is_type_signed(type_right);
8815 int const rank_left = get_rank(type_left);
8816 int const rank_right = get_rank(type_right);
8818 if (signed_left == signed_right)
8819 return rank_left >= rank_right ? type_left : type_right;
8828 u_rank = rank_right;
8829 u_type = type_right;
8831 s_rank = rank_right;
8832 s_type = type_right;
8837 if (u_rank >= s_rank)
8840 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8842 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8843 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8847 case ATOMIC_TYPE_INT: return type_unsigned_int;
8848 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8849 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8851 default: panic("invalid atomic type");
8856 * Check the semantic restrictions for a binary expression.
8858 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8860 expression_t *const left = expression->left;
8861 expression_t *const right = expression->right;
8862 type_t *const orig_type_left = left->base.type;
8863 type_t *const orig_type_right = right->base.type;
8864 type_t *const type_left = skip_typeref(orig_type_left);
8865 type_t *const type_right = skip_typeref(orig_type_right);
8867 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8868 /* TODO: improve error message */
8869 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8870 errorf(&expression->base.source_position,
8871 "operation needs arithmetic types");
8876 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8877 expression->left = create_implicit_cast(left, arithmetic_type);
8878 expression->right = create_implicit_cast(right, arithmetic_type);
8879 expression->base.type = arithmetic_type;
8882 static void warn_div_by_zero(binary_expression_t const *const expression)
8884 if (!warning.div_by_zero ||
8885 !is_type_integer(expression->base.type))
8888 expression_t const *const right = expression->right;
8889 /* The type of the right operand can be different for /= */
8890 if (is_type_integer(right->base.type) &&
8891 is_constant_expression(right) &&
8892 fold_constant(right) == 0) {
8893 warningf(&expression->base.source_position, "division by zero");
8898 * Check the semantic restrictions for a div/mod expression.
8900 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8902 semantic_binexpr_arithmetic(expression);
8903 warn_div_by_zero(expression);
8906 static void warn_addsub_in_shift(const expression_t *const expr)
8908 if (expr->base.parenthesized)
8912 switch (expr->kind) {
8913 case EXPR_BINARY_ADD: op = '+'; break;
8914 case EXPR_BINARY_SUB: op = '-'; break;
8918 warningf(&expr->base.source_position,
8919 "suggest parentheses around '%c' inside shift", op);
8922 static void semantic_shift_op(binary_expression_t *expression)
8924 expression_t *const left = expression->left;
8925 expression_t *const right = expression->right;
8926 type_t *const orig_type_left = left->base.type;
8927 type_t *const orig_type_right = right->base.type;
8928 type_t * type_left = skip_typeref(orig_type_left);
8929 type_t * type_right = skip_typeref(orig_type_right);
8931 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8932 /* TODO: improve error message */
8933 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8934 errorf(&expression->base.source_position,
8935 "operands of shift operation must have integer types");
8940 if (warning.parentheses) {
8941 warn_addsub_in_shift(left);
8942 warn_addsub_in_shift(right);
8945 type_left = promote_integer(type_left);
8946 type_right = promote_integer(type_right);
8948 expression->left = create_implicit_cast(left, type_left);
8949 expression->right = create_implicit_cast(right, type_right);
8950 expression->base.type = type_left;
8953 static void semantic_add(binary_expression_t *expression)
8955 expression_t *const left = expression->left;
8956 expression_t *const right = expression->right;
8957 type_t *const orig_type_left = left->base.type;
8958 type_t *const orig_type_right = right->base.type;
8959 type_t *const type_left = skip_typeref(orig_type_left);
8960 type_t *const type_right = skip_typeref(orig_type_right);
8963 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8964 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8965 expression->left = create_implicit_cast(left, arithmetic_type);
8966 expression->right = create_implicit_cast(right, arithmetic_type);
8967 expression->base.type = arithmetic_type;
8968 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8969 check_pointer_arithmetic(&expression->base.source_position,
8970 type_left, orig_type_left);
8971 expression->base.type = type_left;
8972 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8973 check_pointer_arithmetic(&expression->base.source_position,
8974 type_right, orig_type_right);
8975 expression->base.type = type_right;
8976 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8977 errorf(&expression->base.source_position,
8978 "invalid operands to binary + ('%T', '%T')",
8979 orig_type_left, orig_type_right);
8983 static void semantic_sub(binary_expression_t *expression)
8985 expression_t *const left = expression->left;
8986 expression_t *const right = expression->right;
8987 type_t *const orig_type_left = left->base.type;
8988 type_t *const orig_type_right = right->base.type;
8989 type_t *const type_left = skip_typeref(orig_type_left);
8990 type_t *const type_right = skip_typeref(orig_type_right);
8991 source_position_t const *const pos = &expression->base.source_position;
8994 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8995 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8996 expression->left = create_implicit_cast(left, arithmetic_type);
8997 expression->right = create_implicit_cast(right, arithmetic_type);
8998 expression->base.type = arithmetic_type;
8999 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
9000 check_pointer_arithmetic(&expression->base.source_position,
9001 type_left, orig_type_left);
9002 expression->base.type = type_left;
9003 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
9004 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
9005 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
9006 if (!types_compatible(unqual_left, unqual_right)) {
9008 "subtracting pointers to incompatible types '%T' and '%T'",
9009 orig_type_left, orig_type_right);
9010 } else if (!is_type_object(unqual_left)) {
9011 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
9012 errorf(pos, "subtracting pointers to non-object types '%T'",
9014 } else if (warning.other) {
9015 warningf(pos, "subtracting pointers to void");
9018 expression->base.type = type_ptrdiff_t;
9019 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9020 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
9021 orig_type_left, orig_type_right);
9025 static void warn_string_literal_address(expression_t const* expr)
9027 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
9028 expr = expr->unary.value;
9029 if (expr->kind != EXPR_UNARY_DEREFERENCE)
9031 expr = expr->unary.value;
9034 if (expr->kind == EXPR_STRING_LITERAL ||
9035 expr->kind == EXPR_WIDE_STRING_LITERAL) {
9036 warningf(&expr->base.source_position,
9037 "comparison with string literal results in unspecified behaviour");
9041 static void warn_comparison_in_comparison(const expression_t *const expr)
9043 if (expr->base.parenthesized)
9045 switch (expr->base.kind) {
9046 case EXPR_BINARY_LESS:
9047 case EXPR_BINARY_GREATER:
9048 case EXPR_BINARY_LESSEQUAL:
9049 case EXPR_BINARY_GREATEREQUAL:
9050 case EXPR_BINARY_NOTEQUAL:
9051 case EXPR_BINARY_EQUAL:
9052 warningf(&expr->base.source_position,
9053 "comparisons like 'x <= y < z' do not have their mathematical meaning");
9060 static bool maybe_negative(expression_t const *const expr)
9063 !is_constant_expression(expr) ||
9064 fold_constant(expr) < 0;
9068 * Check the semantics of comparison expressions.
9070 * @param expression The expression to check.
9072 static void semantic_comparison(binary_expression_t *expression)
9074 expression_t *left = expression->left;
9075 expression_t *right = expression->right;
9077 if (warning.address) {
9078 warn_string_literal_address(left);
9079 warn_string_literal_address(right);
9081 expression_t const* const func_left = get_reference_address(left);
9082 if (func_left != NULL && is_null_pointer_constant(right)) {
9083 warningf(&expression->base.source_position,
9084 "the address of '%Y' will never be NULL",
9085 func_left->reference.entity->base.symbol);
9088 expression_t const* const func_right = get_reference_address(right);
9089 if (func_right != NULL && is_null_pointer_constant(right)) {
9090 warningf(&expression->base.source_position,
9091 "the address of '%Y' will never be NULL",
9092 func_right->reference.entity->base.symbol);
9096 if (warning.parentheses) {
9097 warn_comparison_in_comparison(left);
9098 warn_comparison_in_comparison(right);
9101 type_t *orig_type_left = left->base.type;
9102 type_t *orig_type_right = right->base.type;
9103 type_t *type_left = skip_typeref(orig_type_left);
9104 type_t *type_right = skip_typeref(orig_type_right);
9106 /* TODO non-arithmetic types */
9107 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9108 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9110 /* test for signed vs unsigned compares */
9111 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
9112 bool const signed_left = is_type_signed(type_left);
9113 bool const signed_right = is_type_signed(type_right);
9114 if (signed_left != signed_right) {
9115 /* FIXME long long needs better const folding magic */
9116 /* TODO check whether constant value can be represented by other type */
9117 if ((signed_left && maybe_negative(left)) ||
9118 (signed_right && maybe_negative(right))) {
9119 warningf(&expression->base.source_position,
9120 "comparison between signed and unsigned");
9125 expression->left = create_implicit_cast(left, arithmetic_type);
9126 expression->right = create_implicit_cast(right, arithmetic_type);
9127 expression->base.type = arithmetic_type;
9128 if (warning.float_equal &&
9129 (expression->base.kind == EXPR_BINARY_EQUAL ||
9130 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
9131 is_type_float(arithmetic_type)) {
9132 warningf(&expression->base.source_position,
9133 "comparing floating point with == or != is unsafe");
9135 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
9136 /* TODO check compatibility */
9137 } else if (is_type_pointer(type_left)) {
9138 expression->right = create_implicit_cast(right, type_left);
9139 } else if (is_type_pointer(type_right)) {
9140 expression->left = create_implicit_cast(left, type_right);
9141 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9142 type_error_incompatible("invalid operands in comparison",
9143 &expression->base.source_position,
9144 type_left, type_right);
9146 expression->base.type = c_mode & _CXX ? type_bool : type_int;
9150 * Checks if a compound type has constant fields.
9152 static bool has_const_fields(const compound_type_t *type)
9154 compound_t *compound = type->compound;
9155 entity_t *entry = compound->members.entities;
9157 for (; entry != NULL; entry = entry->base.next) {
9158 if (!is_declaration(entry))
9161 const type_t *decl_type = skip_typeref(entry->declaration.type);
9162 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
9169 static bool is_valid_assignment_lhs(expression_t const* const left)
9171 type_t *const orig_type_left = revert_automatic_type_conversion(left);
9172 type_t *const type_left = skip_typeref(orig_type_left);
9174 if (!is_lvalue(left)) {
9175 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
9180 if (left->kind == EXPR_REFERENCE
9181 && left->reference.entity->kind == ENTITY_FUNCTION) {
9182 errorf(HERE, "cannot assign to function '%E'", left);
9186 if (is_type_array(type_left)) {
9187 errorf(HERE, "cannot assign to array '%E'", left);
9190 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
9191 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
9195 if (is_type_incomplete(type_left)) {
9196 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
9197 left, orig_type_left);
9200 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
9201 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
9202 left, orig_type_left);
9209 static void semantic_arithmetic_assign(binary_expression_t *expression)
9211 expression_t *left = expression->left;
9212 expression_t *right = expression->right;
9213 type_t *orig_type_left = left->base.type;
9214 type_t *orig_type_right = right->base.type;
9216 if (!is_valid_assignment_lhs(left))
9219 type_t *type_left = skip_typeref(orig_type_left);
9220 type_t *type_right = skip_typeref(orig_type_right);
9222 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
9223 /* TODO: improve error message */
9224 if (is_type_valid(type_left) && is_type_valid(type_right)) {
9225 errorf(&expression->base.source_position,
9226 "operation needs arithmetic types");
9231 /* combined instructions are tricky. We can't create an implicit cast on
9232 * the left side, because we need the uncasted form for the store.
9233 * The ast2firm pass has to know that left_type must be right_type
9234 * for the arithmetic operation and create a cast by itself */
9235 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9236 expression->right = create_implicit_cast(right, arithmetic_type);
9237 expression->base.type = type_left;
9240 static void semantic_divmod_assign(binary_expression_t *expression)
9242 semantic_arithmetic_assign(expression);
9243 warn_div_by_zero(expression);
9246 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
9248 expression_t *const left = expression->left;
9249 expression_t *const right = expression->right;
9250 type_t *const orig_type_left = left->base.type;
9251 type_t *const orig_type_right = right->base.type;
9252 type_t *const type_left = skip_typeref(orig_type_left);
9253 type_t *const type_right = skip_typeref(orig_type_right);
9255 if (!is_valid_assignment_lhs(left))
9258 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9259 /* combined instructions are tricky. We can't create an implicit cast on
9260 * the left side, because we need the uncasted form for the store.
9261 * The ast2firm pass has to know that left_type must be right_type
9262 * for the arithmetic operation and create a cast by itself */
9263 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
9264 expression->right = create_implicit_cast(right, arithmetic_type);
9265 expression->base.type = type_left;
9266 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
9267 check_pointer_arithmetic(&expression->base.source_position,
9268 type_left, orig_type_left);
9269 expression->base.type = type_left;
9270 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9271 errorf(&expression->base.source_position,
9272 "incompatible types '%T' and '%T' in assignment",
9273 orig_type_left, orig_type_right);
9277 static void warn_logical_and_within_or(const expression_t *const expr)
9279 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
9281 if (expr->base.parenthesized)
9283 warningf(&expr->base.source_position,
9284 "suggest parentheses around && within ||");
9288 * Check the semantic restrictions of a logical expression.
9290 static void semantic_logical_op(binary_expression_t *expression)
9292 /* §6.5.13:2 Each of the operands shall have scalar type.
9293 * §6.5.14:2 Each of the operands shall have scalar type. */
9294 semantic_condition(expression->left, "left operand of logical operator");
9295 semantic_condition(expression->right, "right operand of logical operator");
9296 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
9297 warning.parentheses) {
9298 warn_logical_and_within_or(expression->left);
9299 warn_logical_and_within_or(expression->right);
9301 expression->base.type = c_mode & _CXX ? type_bool : type_int;
9305 * Check the semantic restrictions of a binary assign expression.
9307 static void semantic_binexpr_assign(binary_expression_t *expression)
9309 expression_t *left = expression->left;
9310 type_t *orig_type_left = left->base.type;
9312 if (!is_valid_assignment_lhs(left))
9315 assign_error_t error = semantic_assign(orig_type_left, expression->right);
9316 report_assign_error(error, orig_type_left, expression->right,
9317 "assignment", &left->base.source_position);
9318 expression->right = create_implicit_cast(expression->right, orig_type_left);
9319 expression->base.type = orig_type_left;
9323 * Determine if the outermost operation (or parts thereof) of the given
9324 * expression has no effect in order to generate a warning about this fact.
9325 * Therefore in some cases this only examines some of the operands of the
9326 * expression (see comments in the function and examples below).
9328 * f() + 23; // warning, because + has no effect
9329 * x || f(); // no warning, because x controls execution of f()
9330 * x ? y : f(); // warning, because y has no effect
9331 * (void)x; // no warning to be able to suppress the warning
9332 * This function can NOT be used for an "expression has definitely no effect"-
9334 static bool expression_has_effect(const expression_t *const expr)
9336 switch (expr->kind) {
9337 case EXPR_UNKNOWN: break;
9338 case EXPR_INVALID: return true; /* do NOT warn */
9339 case EXPR_REFERENCE: return false;
9340 case EXPR_REFERENCE_ENUM_VALUE: return false;
9341 /* suppress the warning for microsoft __noop operations */
9342 case EXPR_CONST: return expr->conste.is_ms_noop;
9343 case EXPR_CHARACTER_CONSTANT: return false;
9344 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
9345 case EXPR_STRING_LITERAL: return false;
9346 case EXPR_WIDE_STRING_LITERAL: return false;
9347 case EXPR_LABEL_ADDRESS: return false;
9350 const call_expression_t *const call = &expr->call;
9351 if (call->function->kind != EXPR_REFERENCE)
9354 switch (call->function->reference.entity->function.btk) {
9355 case bk_gnu_builtin_prefetch:
9356 case bk_gnu_builtin_va_end: return true;
9357 default: return false;
9361 /* Generate the warning if either the left or right hand side of a
9362 * conditional expression has no effect */
9363 case EXPR_CONDITIONAL: {
9364 conditional_expression_t const *const cond = &expr->conditional;
9365 expression_t const *const t = cond->true_expression;
9367 (t == NULL || expression_has_effect(t)) &&
9368 expression_has_effect(cond->false_expression);
9371 case EXPR_SELECT: return false;
9372 case EXPR_ARRAY_ACCESS: return false;
9373 case EXPR_SIZEOF: return false;
9374 case EXPR_CLASSIFY_TYPE: return false;
9375 case EXPR_ALIGNOF: return false;
9377 case EXPR_FUNCNAME: return false;
9378 case EXPR_BUILTIN_CONSTANT_P: return false;
9379 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
9380 case EXPR_OFFSETOF: return false;
9381 case EXPR_VA_START: return true;
9382 case EXPR_VA_ARG: return true;
9383 case EXPR_STATEMENT: return true; // TODO
9384 case EXPR_COMPOUND_LITERAL: return false;
9386 case EXPR_UNARY_NEGATE: return false;
9387 case EXPR_UNARY_PLUS: return false;
9388 case EXPR_UNARY_BITWISE_NEGATE: return false;
9389 case EXPR_UNARY_NOT: return false;
9390 case EXPR_UNARY_DEREFERENCE: return false;
9391 case EXPR_UNARY_TAKE_ADDRESS: return false;
9392 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
9393 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
9394 case EXPR_UNARY_PREFIX_INCREMENT: return true;
9395 case EXPR_UNARY_PREFIX_DECREMENT: return true;
9397 /* Treat void casts as if they have an effect in order to being able to
9398 * suppress the warning */
9399 case EXPR_UNARY_CAST: {
9400 type_t *const type = skip_typeref(expr->base.type);
9401 return is_type_atomic(type, ATOMIC_TYPE_VOID);
9404 case EXPR_UNARY_CAST_IMPLICIT: return true;
9405 case EXPR_UNARY_ASSUME: return true;
9406 case EXPR_UNARY_DELETE: return true;
9407 case EXPR_UNARY_DELETE_ARRAY: return true;
9408 case EXPR_UNARY_THROW: return true;
9410 case EXPR_BINARY_ADD: return false;
9411 case EXPR_BINARY_SUB: return false;
9412 case EXPR_BINARY_MUL: return false;
9413 case EXPR_BINARY_DIV: return false;
9414 case EXPR_BINARY_MOD: return false;
9415 case EXPR_BINARY_EQUAL: return false;
9416 case EXPR_BINARY_NOTEQUAL: return false;
9417 case EXPR_BINARY_LESS: return false;
9418 case EXPR_BINARY_LESSEQUAL: return false;
9419 case EXPR_BINARY_GREATER: return false;
9420 case EXPR_BINARY_GREATEREQUAL: return false;
9421 case EXPR_BINARY_BITWISE_AND: return false;
9422 case EXPR_BINARY_BITWISE_OR: return false;
9423 case EXPR_BINARY_BITWISE_XOR: return false;
9424 case EXPR_BINARY_SHIFTLEFT: return false;
9425 case EXPR_BINARY_SHIFTRIGHT: return false;
9426 case EXPR_BINARY_ASSIGN: return true;
9427 case EXPR_BINARY_MUL_ASSIGN: return true;
9428 case EXPR_BINARY_DIV_ASSIGN: return true;
9429 case EXPR_BINARY_MOD_ASSIGN: return true;
9430 case EXPR_BINARY_ADD_ASSIGN: return true;
9431 case EXPR_BINARY_SUB_ASSIGN: return true;
9432 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
9433 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
9434 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
9435 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
9436 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
9438 /* Only examine the right hand side of && and ||, because the left hand
9439 * side already has the effect of controlling the execution of the right
9441 case EXPR_BINARY_LOGICAL_AND:
9442 case EXPR_BINARY_LOGICAL_OR:
9443 /* Only examine the right hand side of a comma expression, because the left
9444 * hand side has a separate warning */
9445 case EXPR_BINARY_COMMA:
9446 return expression_has_effect(expr->binary.right);
9448 case EXPR_BINARY_ISGREATER: return false;
9449 case EXPR_BINARY_ISGREATEREQUAL: return false;
9450 case EXPR_BINARY_ISLESS: return false;
9451 case EXPR_BINARY_ISLESSEQUAL: return false;
9452 case EXPR_BINARY_ISLESSGREATER: return false;
9453 case EXPR_BINARY_ISUNORDERED: return false;
9456 internal_errorf(HERE, "unexpected expression");
9459 static void semantic_comma(binary_expression_t *expression)
9461 if (warning.unused_value) {
9462 const expression_t *const left = expression->left;
9463 if (!expression_has_effect(left)) {
9464 warningf(&left->base.source_position,
9465 "left-hand operand of comma expression has no effect");
9468 expression->base.type = expression->right->base.type;
9472 * @param prec_r precedence of the right operand
9474 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
9475 static expression_t *parse_##binexpression_type(expression_t *left) \
9477 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
9478 binexpr->binary.left = left; \
9481 expression_t *right = parse_sub_expression(prec_r); \
9483 binexpr->binary.right = right; \
9484 sfunc(&binexpr->binary); \
9489 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
9490 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
9491 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
9492 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
9493 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
9494 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
9495 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
9496 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
9497 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
9498 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
9499 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
9500 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
9501 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
9502 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
9503 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
9504 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
9505 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
9506 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
9507 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
9508 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9509 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9510 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9511 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9512 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9513 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9514 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9515 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9516 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9517 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9518 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9521 static expression_t *parse_sub_expression(precedence_t precedence)
9523 if (token.type < 0) {
9524 return expected_expression_error();
9527 expression_parser_function_t *parser
9528 = &expression_parsers[token.type];
9529 source_position_t source_position = token.source_position;
9532 if (parser->parser != NULL) {
9533 left = parser->parser();
9535 left = parse_primary_expression();
9537 assert(left != NULL);
9538 left->base.source_position = source_position;
9541 if (token.type < 0) {
9542 return expected_expression_error();
9545 parser = &expression_parsers[token.type];
9546 if (parser->infix_parser == NULL)
9548 if (parser->infix_precedence < precedence)
9551 left = parser->infix_parser(left);
9553 assert(left != NULL);
9554 assert(left->kind != EXPR_UNKNOWN);
9555 left->base.source_position = source_position;
9562 * Parse an expression.
9564 static expression_t *parse_expression(void)
9566 return parse_sub_expression(PREC_EXPRESSION);
9570 * Register a parser for a prefix-like operator.
9572 * @param parser the parser function
9573 * @param token_type the token type of the prefix token
9575 static void register_expression_parser(parse_expression_function parser,
9578 expression_parser_function_t *entry = &expression_parsers[token_type];
9580 if (entry->parser != NULL) {
9581 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9582 panic("trying to register multiple expression parsers for a token");
9584 entry->parser = parser;
9588 * Register a parser for an infix operator with given precedence.
9590 * @param parser the parser function
9591 * @param token_type the token type of the infix operator
9592 * @param precedence the precedence of the operator
9594 static void register_infix_parser(parse_expression_infix_function parser,
9595 int token_type, precedence_t precedence)
9597 expression_parser_function_t *entry = &expression_parsers[token_type];
9599 if (entry->infix_parser != NULL) {
9600 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9601 panic("trying to register multiple infix expression parsers for a "
9604 entry->infix_parser = parser;
9605 entry->infix_precedence = precedence;
9609 * Initialize the expression parsers.
9611 static void init_expression_parsers(void)
9613 memset(&expression_parsers, 0, sizeof(expression_parsers));
9615 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9616 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9617 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9618 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9619 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9620 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9621 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9622 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9623 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9624 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9625 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9626 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9627 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9628 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9629 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9630 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9631 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9632 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9633 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9634 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9635 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9636 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9637 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9638 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9639 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9640 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9641 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9642 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9643 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9644 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9645 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9646 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9647 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9648 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9649 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9650 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9651 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9653 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9654 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9655 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9656 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9657 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9658 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9659 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9660 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9661 register_expression_parser(parse_sizeof, T_sizeof);
9662 register_expression_parser(parse_alignof, T___alignof__);
9663 register_expression_parser(parse_extension, T___extension__);
9664 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9665 register_expression_parser(parse_delete, T_delete);
9666 register_expression_parser(parse_throw, T_throw);
9670 * Parse a asm statement arguments specification.
9672 static asm_argument_t *parse_asm_arguments(bool is_out)
9674 asm_argument_t *result = NULL;
9675 asm_argument_t **anchor = &result;
9677 while (token.type == T_STRING_LITERAL || token.type == '[') {
9678 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9679 memset(argument, 0, sizeof(argument[0]));
9681 if (token.type == '[') {
9683 if (token.type != T_IDENTIFIER) {
9684 parse_error_expected("while parsing asm argument",
9685 T_IDENTIFIER, NULL);
9688 argument->symbol = token.v.symbol;
9690 expect(']', end_error);
9693 argument->constraints = parse_string_literals();
9694 expect('(', end_error);
9695 add_anchor_token(')');
9696 expression_t *expression = parse_expression();
9697 rem_anchor_token(')');
9699 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9700 * change size or type representation (e.g. int -> long is ok, but
9701 * int -> float is not) */
9702 if (expression->kind == EXPR_UNARY_CAST) {
9703 type_t *const type = expression->base.type;
9704 type_kind_t const kind = type->kind;
9705 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9708 if (kind == TYPE_ATOMIC) {
9709 atomic_type_kind_t const akind = type->atomic.akind;
9710 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9711 size = get_atomic_type_size(akind);
9713 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9714 size = get_atomic_type_size(get_intptr_kind());
9718 expression_t *const value = expression->unary.value;
9719 type_t *const value_type = value->base.type;
9720 type_kind_t const value_kind = value_type->kind;
9722 unsigned value_flags;
9723 unsigned value_size;
9724 if (value_kind == TYPE_ATOMIC) {
9725 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9726 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9727 value_size = get_atomic_type_size(value_akind);
9728 } else if (value_kind == TYPE_POINTER) {
9729 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9730 value_size = get_atomic_type_size(get_intptr_kind());
9735 if (value_flags != flags || value_size != size)
9739 } while (expression->kind == EXPR_UNARY_CAST);
9743 if (!is_lvalue(expression)) {
9744 errorf(&expression->base.source_position,
9745 "asm output argument is not an lvalue");
9748 if (argument->constraints.begin[0] == '+')
9749 mark_vars_read(expression, NULL);
9751 mark_vars_read(expression, NULL);
9753 argument->expression = expression;
9754 expect(')', end_error);
9756 set_address_taken(expression, true);
9759 anchor = &argument->next;
9761 if (token.type != ',')
9772 * Parse a asm statement clobber specification.
9774 static asm_clobber_t *parse_asm_clobbers(void)
9776 asm_clobber_t *result = NULL;
9777 asm_clobber_t *last = NULL;
9779 while (token.type == T_STRING_LITERAL) {
9780 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9781 clobber->clobber = parse_string_literals();
9784 last->next = clobber;
9790 if (token.type != ',')
9799 * Parse an asm statement.
9801 static statement_t *parse_asm_statement(void)
9803 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9804 asm_statement_t *asm_statement = &statement->asms;
9808 if (token.type == T_volatile) {
9810 asm_statement->is_volatile = true;
9813 expect('(', end_error);
9814 add_anchor_token(')');
9815 add_anchor_token(':');
9816 asm_statement->asm_text = parse_string_literals();
9818 if (token.type != ':') {
9819 rem_anchor_token(':');
9824 asm_statement->outputs = parse_asm_arguments(true);
9825 if (token.type != ':') {
9826 rem_anchor_token(':');
9831 asm_statement->inputs = parse_asm_arguments(false);
9832 if (token.type != ':') {
9833 rem_anchor_token(':');
9836 rem_anchor_token(':');
9839 asm_statement->clobbers = parse_asm_clobbers();
9842 rem_anchor_token(')');
9843 expect(')', end_error);
9844 expect(';', end_error);
9846 if (asm_statement->outputs == NULL) {
9847 /* GCC: An 'asm' instruction without any output operands will be treated
9848 * identically to a volatile 'asm' instruction. */
9849 asm_statement->is_volatile = true;
9854 return create_invalid_statement();
9858 * Parse a case statement.
9860 static statement_t *parse_case_statement(void)
9862 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9863 source_position_t *const pos = &statement->base.source_position;
9867 expression_t *const expression = parse_expression();
9868 statement->case_label.expression = expression;
9869 if (!is_constant_expression(expression)) {
9870 /* This check does not prevent the error message in all cases of an
9871 * prior error while parsing the expression. At least it catches the
9872 * common case of a mistyped enum entry. */
9873 if (is_type_valid(skip_typeref(expression->base.type))) {
9874 errorf(pos, "case label does not reduce to an integer constant");
9876 statement->case_label.is_bad = true;
9878 long const val = fold_constant(expression);
9879 statement->case_label.first_case = val;
9880 statement->case_label.last_case = val;
9884 if (token.type == T_DOTDOTDOT) {
9886 expression_t *const end_range = parse_expression();
9887 statement->case_label.end_range = end_range;
9888 if (!is_constant_expression(end_range)) {
9889 /* This check does not prevent the error message in all cases of an
9890 * prior error while parsing the expression. At least it catches the
9891 * common case of a mistyped enum entry. */
9892 if (is_type_valid(skip_typeref(end_range->base.type))) {
9893 errorf(pos, "case range does not reduce to an integer constant");
9895 statement->case_label.is_bad = true;
9897 long const val = fold_constant(end_range);
9898 statement->case_label.last_case = val;
9900 if (warning.other && val < statement->case_label.first_case) {
9901 statement->case_label.is_empty_range = true;
9902 warningf(pos, "empty range specified");
9908 PUSH_PARENT(statement);
9910 expect(':', end_error);
9913 if (current_switch != NULL) {
9914 if (! statement->case_label.is_bad) {
9915 /* Check for duplicate case values */
9916 case_label_statement_t *c = &statement->case_label;
9917 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9918 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9921 if (c->last_case < l->first_case || c->first_case > l->last_case)
9924 errorf(pos, "duplicate case value (previously used %P)",
9925 &l->base.source_position);
9929 /* link all cases into the switch statement */
9930 if (current_switch->last_case == NULL) {
9931 current_switch->first_case = &statement->case_label;
9933 current_switch->last_case->next = &statement->case_label;
9935 current_switch->last_case = &statement->case_label;
9937 errorf(pos, "case 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 case label");
9951 * Parse a default statement.
9953 static statement_t *parse_default_statement(void)
9955 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9959 PUSH_PARENT(statement);
9961 expect(':', end_error);
9962 if (current_switch != NULL) {
9963 const case_label_statement_t *def_label = current_switch->default_label;
9964 if (def_label != NULL) {
9965 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9966 &def_label->base.source_position);
9968 current_switch->default_label = &statement->case_label;
9970 /* link all cases into the switch statement */
9971 if (current_switch->last_case == NULL) {
9972 current_switch->first_case = &statement->case_label;
9974 current_switch->last_case->next = &statement->case_label;
9976 current_switch->last_case = &statement->case_label;
9979 errorf(&statement->base.source_position,
9980 "'default' label not within a switch statement");
9983 statement_t *const inner_stmt = parse_statement();
9984 statement->case_label.statement = inner_stmt;
9985 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9986 errorf(&inner_stmt->base.source_position, "declaration after default label");
9993 return create_invalid_statement();
9997 * Parse a label statement.
9999 static statement_t *parse_label_statement(void)
10001 assert(token.type == T_IDENTIFIER);
10002 symbol_t *symbol = token.v.symbol;
10003 label_t *label = get_label(symbol);
10005 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
10006 statement->label.label = label;
10010 PUSH_PARENT(statement);
10012 /* if statement is already set then the label is defined twice,
10013 * otherwise it was just mentioned in a goto/local label declaration so far
10015 if (label->statement != NULL) {
10016 errorf(HERE, "duplicate label '%Y' (declared %P)",
10017 symbol, &label->base.source_position);
10019 label->base.source_position = token.source_position;
10020 label->statement = statement;
10025 if (token.type == '}') {
10026 /* TODO only warn? */
10027 if (warning.other && false) {
10028 warningf(HERE, "label at end of compound statement");
10029 statement->label.statement = create_empty_statement();
10031 errorf(HERE, "label at end of compound statement");
10032 statement->label.statement = create_invalid_statement();
10034 } else if (token.type == ';') {
10035 /* Eat an empty statement here, to avoid the warning about an empty
10036 * statement after a label. label:; is commonly used to have a label
10037 * before a closing brace. */
10038 statement->label.statement = create_empty_statement();
10041 statement_t *const inner_stmt = parse_statement();
10042 statement->label.statement = inner_stmt;
10043 if (inner_stmt->kind == STATEMENT_DECLARATION) {
10044 errorf(&inner_stmt->base.source_position, "declaration after label");
10048 /* remember the labels in a list for later checking */
10049 *label_anchor = &statement->label;
10050 label_anchor = &statement->label.next;
10057 * Parse an if statement.
10059 static statement_t *parse_if(void)
10061 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
10065 PUSH_PARENT(statement);
10067 add_anchor_token('{');
10069 expect('(', end_error);
10070 add_anchor_token(')');
10071 expression_t *const expr = parse_expression();
10072 statement->ifs.condition = expr;
10073 /* §6.8.4.1:1 The controlling expression of an if statement shall have
10075 semantic_condition(expr, "condition of 'if'-statment");
10076 mark_vars_read(expr, NULL);
10077 rem_anchor_token(')');
10078 expect(')', end_error);
10081 rem_anchor_token('{');
10083 add_anchor_token(T_else);
10084 statement_t *const true_stmt = parse_statement();
10085 statement->ifs.true_statement = true_stmt;
10086 rem_anchor_token(T_else);
10088 if (token.type == T_else) {
10090 statement->ifs.false_statement = parse_statement();
10091 } else if (warning.parentheses &&
10092 true_stmt->kind == STATEMENT_IF &&
10093 true_stmt->ifs.false_statement != NULL) {
10094 warningf(&true_stmt->base.source_position,
10095 "suggest explicit braces to avoid ambiguous 'else'");
10103 * Check that all enums are handled in a switch.
10105 * @param statement the switch statement to check
10107 static void check_enum_cases(const switch_statement_t *statement)
10109 const type_t *type = skip_typeref(statement->expression->base.type);
10110 if (! is_type_enum(type))
10112 const enum_type_t *enumt = &type->enumt;
10114 /* if we have a default, no warnings */
10115 if (statement->default_label != NULL)
10118 /* FIXME: calculation of value should be done while parsing */
10119 /* TODO: quadratic algorithm here. Change to an n log n one */
10120 long last_value = -1;
10121 const entity_t *entry = enumt->enume->base.next;
10122 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
10123 entry = entry->base.next) {
10124 const expression_t *expression = entry->enum_value.value;
10125 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
10126 bool found = false;
10127 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
10128 if (l->expression == NULL)
10130 if (l->first_case <= value && value <= l->last_case) {
10136 warningf(&statement->base.source_position,
10137 "enumeration value '%Y' not handled in switch",
10138 entry->base.symbol);
10140 last_value = value;
10145 * Parse a switch statement.
10147 static statement_t *parse_switch(void)
10149 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
10153 PUSH_PARENT(statement);
10155 expect('(', end_error);
10156 add_anchor_token(')');
10157 expression_t *const expr = parse_expression();
10158 mark_vars_read(expr, NULL);
10159 type_t * type = skip_typeref(expr->base.type);
10160 if (is_type_integer(type)) {
10161 type = promote_integer(type);
10162 if (warning.traditional) {
10163 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
10164 warningf(&expr->base.source_position,
10165 "'%T' switch expression not converted to '%T' in ISO C",
10169 } else if (is_type_valid(type)) {
10170 errorf(&expr->base.source_position,
10171 "switch quantity is not an integer, but '%T'", type);
10172 type = type_error_type;
10174 statement->switchs.expression = create_implicit_cast(expr, type);
10175 expect(')', end_error);
10176 rem_anchor_token(')');
10178 switch_statement_t *rem = current_switch;
10179 current_switch = &statement->switchs;
10180 statement->switchs.body = parse_statement();
10181 current_switch = rem;
10183 if (warning.switch_default &&
10184 statement->switchs.default_label == NULL) {
10185 warningf(&statement->base.source_position, "switch has no default case");
10187 if (warning.switch_enum)
10188 check_enum_cases(&statement->switchs);
10194 return create_invalid_statement();
10197 static statement_t *parse_loop_body(statement_t *const loop)
10199 statement_t *const rem = current_loop;
10200 current_loop = loop;
10202 statement_t *const body = parse_statement();
10204 current_loop = rem;
10209 * Parse a while statement.
10211 static statement_t *parse_while(void)
10213 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
10217 PUSH_PARENT(statement);
10219 expect('(', end_error);
10220 add_anchor_token(')');
10221 expression_t *const cond = parse_expression();
10222 statement->whiles.condition = cond;
10223 /* §6.8.5:2 The controlling expression of an iteration statement shall
10224 * have scalar type. */
10225 semantic_condition(cond, "condition of 'while'-statement");
10226 mark_vars_read(cond, NULL);
10227 rem_anchor_token(')');
10228 expect(')', end_error);
10230 statement->whiles.body = parse_loop_body(statement);
10236 return create_invalid_statement();
10240 * Parse a do statement.
10242 static statement_t *parse_do(void)
10244 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
10248 PUSH_PARENT(statement);
10250 add_anchor_token(T_while);
10251 statement->do_while.body = parse_loop_body(statement);
10252 rem_anchor_token(T_while);
10254 expect(T_while, end_error);
10255 expect('(', end_error);
10256 add_anchor_token(')');
10257 expression_t *const cond = parse_expression();
10258 statement->do_while.condition = cond;
10259 /* §6.8.5:2 The controlling expression of an iteration statement shall
10260 * have scalar type. */
10261 semantic_condition(cond, "condition of 'do-while'-statement");
10262 mark_vars_read(cond, NULL);
10263 rem_anchor_token(')');
10264 expect(')', end_error);
10265 expect(';', end_error);
10271 return create_invalid_statement();
10275 * Parse a for statement.
10277 static statement_t *parse_for(void)
10279 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
10283 expect('(', end_error1);
10284 add_anchor_token(')');
10286 PUSH_PARENT(statement);
10288 size_t const top = environment_top();
10289 scope_t *old_scope = scope_push(&statement->fors.scope);
10291 if (token.type == ';') {
10293 } else if (is_declaration_specifier(&token, false)) {
10294 parse_declaration(record_entity, DECL_FLAGS_NONE);
10296 add_anchor_token(';');
10297 expression_t *const init = parse_expression();
10298 statement->fors.initialisation = init;
10299 mark_vars_read(init, ENT_ANY);
10300 if (warning.unused_value && !expression_has_effect(init)) {
10301 warningf(&init->base.source_position,
10302 "initialisation of 'for'-statement has no effect");
10304 rem_anchor_token(';');
10305 expect(';', end_error2);
10308 if (token.type != ';') {
10309 add_anchor_token(';');
10310 expression_t *const cond = parse_expression();
10311 statement->fors.condition = cond;
10312 /* §6.8.5:2 The controlling expression of an iteration statement
10313 * shall have scalar type. */
10314 semantic_condition(cond, "condition of 'for'-statement");
10315 mark_vars_read(cond, NULL);
10316 rem_anchor_token(';');
10318 expect(';', end_error2);
10319 if (token.type != ')') {
10320 expression_t *const step = parse_expression();
10321 statement->fors.step = step;
10322 mark_vars_read(step, ENT_ANY);
10323 if (warning.unused_value && !expression_has_effect(step)) {
10324 warningf(&step->base.source_position,
10325 "step of 'for'-statement has no effect");
10328 expect(')', end_error2);
10329 rem_anchor_token(')');
10330 statement->fors.body = parse_loop_body(statement);
10332 assert(current_scope == &statement->fors.scope);
10333 scope_pop(old_scope);
10334 environment_pop_to(top);
10341 rem_anchor_token(')');
10342 assert(current_scope == &statement->fors.scope);
10343 scope_pop(old_scope);
10344 environment_pop_to(top);
10348 return create_invalid_statement();
10352 * Parse a goto statement.
10354 static statement_t *parse_goto(void)
10356 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
10359 if (GNU_MODE && token.type == '*') {
10361 expression_t *expression = parse_expression();
10362 mark_vars_read(expression, NULL);
10364 /* Argh: although documentation says the expression must be of type void*,
10365 * gcc accepts anything that can be casted into void* without error */
10366 type_t *type = expression->base.type;
10368 if (type != type_error_type) {
10369 if (!is_type_pointer(type) && !is_type_integer(type)) {
10370 errorf(&expression->base.source_position,
10371 "cannot convert to a pointer type");
10372 } else if (warning.other && type != type_void_ptr) {
10373 warningf(&expression->base.source_position,
10374 "type of computed goto expression should be 'void*' not '%T'", type);
10376 expression = create_implicit_cast(expression, type_void_ptr);
10379 statement->gotos.expression = expression;
10381 if (token.type != T_IDENTIFIER) {
10383 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
10385 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
10386 eat_until_anchor();
10389 symbol_t *symbol = token.v.symbol;
10392 statement->gotos.label = get_label(symbol);
10395 /* remember the goto's in a list for later checking */
10396 *goto_anchor = &statement->gotos;
10397 goto_anchor = &statement->gotos.next;
10399 expect(';', end_error);
10403 return create_invalid_statement();
10407 * Parse a continue statement.
10409 static statement_t *parse_continue(void)
10411 if (current_loop == NULL) {
10412 errorf(HERE, "continue statement not within loop");
10415 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
10418 expect(';', end_error);
10425 * Parse a break statement.
10427 static statement_t *parse_break(void)
10429 if (current_switch == NULL && current_loop == NULL) {
10430 errorf(HERE, "break statement not within loop or switch");
10433 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
10436 expect(';', end_error);
10443 * Parse a __leave statement.
10445 static statement_t *parse_leave_statement(void)
10447 if (current_try == NULL) {
10448 errorf(HERE, "__leave statement not within __try");
10451 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
10454 expect(';', end_error);
10461 * Check if a given entity represents a local variable.
10463 static bool is_local_variable(const entity_t *entity)
10465 if (entity->kind != ENTITY_VARIABLE)
10468 switch ((storage_class_tag_t) entity->declaration.storage_class) {
10469 case STORAGE_CLASS_AUTO:
10470 case STORAGE_CLASS_REGISTER: {
10471 const type_t *type = skip_typeref(entity->declaration.type);
10472 if (is_type_function(type)) {
10484 * Check if a given expression represents a local variable.
10486 static bool expression_is_local_variable(const expression_t *expression)
10488 if (expression->base.kind != EXPR_REFERENCE) {
10491 const entity_t *entity = expression->reference.entity;
10492 return is_local_variable(entity);
10496 * Check if a given expression represents a local variable and
10497 * return its declaration then, else return NULL.
10499 entity_t *expression_is_variable(const expression_t *expression)
10501 if (expression->base.kind != EXPR_REFERENCE) {
10504 entity_t *entity = expression->reference.entity;
10505 if (entity->kind != ENTITY_VARIABLE)
10512 * Parse a return statement.
10514 static statement_t *parse_return(void)
10518 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10520 expression_t *return_value = NULL;
10521 if (token.type != ';') {
10522 return_value = parse_expression();
10523 mark_vars_read(return_value, NULL);
10526 const type_t *const func_type = skip_typeref(current_function->base.type);
10527 assert(is_type_function(func_type));
10528 type_t *const return_type = skip_typeref(func_type->function.return_type);
10530 source_position_t const *const pos = &statement->base.source_position;
10531 if (return_value != NULL) {
10532 type_t *return_value_type = skip_typeref(return_value->base.type);
10534 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10535 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10536 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10537 /* Only warn in C mode, because GCC does the same */
10538 if (c_mode & _CXX || strict_mode) {
10540 "'return' with a value, in function returning 'void'");
10541 } else if (warning.other) {
10543 "'return' with a value, in function returning 'void'");
10545 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10546 /* Only warn in C mode, because GCC does the same */
10549 "'return' with expression in function return 'void'");
10550 } else if (warning.other) {
10552 "'return' with expression in function return 'void'");
10556 assign_error_t error = semantic_assign(return_type, return_value);
10557 report_assign_error(error, return_type, return_value, "'return'",
10560 return_value = create_implicit_cast(return_value, return_type);
10561 /* check for returning address of a local var */
10562 if (warning.other && return_value != NULL
10563 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10564 const expression_t *expression = return_value->unary.value;
10565 if (expression_is_local_variable(expression)) {
10566 warningf(pos, "function returns address of local variable");
10569 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10570 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10571 if (c_mode & _CXX || strict_mode) {
10573 "'return' without value, in function returning non-void");
10576 "'return' without value, in function returning non-void");
10579 statement->returns.value = return_value;
10581 expect(';', end_error);
10588 * Parse a declaration statement.
10590 static statement_t *parse_declaration_statement(void)
10592 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10594 entity_t *before = current_scope->last_entity;
10596 parse_external_declaration();
10598 parse_declaration(record_entity, DECL_FLAGS_NONE);
10601 declaration_statement_t *const decl = &statement->declaration;
10602 entity_t *const begin =
10603 before != NULL ? before->base.next : current_scope->entities;
10604 decl->declarations_begin = begin;
10605 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10611 * Parse an expression statement, ie. expr ';'.
10613 static statement_t *parse_expression_statement(void)
10615 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10617 expression_t *const expr = parse_expression();
10618 statement->expression.expression = expr;
10619 mark_vars_read(expr, ENT_ANY);
10621 expect(';', end_error);
10628 * Parse a microsoft __try { } __finally { } or
10629 * __try{ } __except() { }
10631 static statement_t *parse_ms_try_statment(void)
10633 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10636 PUSH_PARENT(statement);
10638 ms_try_statement_t *rem = current_try;
10639 current_try = &statement->ms_try;
10640 statement->ms_try.try_statement = parse_compound_statement(false);
10645 if (token.type == T___except) {
10647 expect('(', end_error);
10648 add_anchor_token(')');
10649 expression_t *const expr = parse_expression();
10650 mark_vars_read(expr, NULL);
10651 type_t * type = skip_typeref(expr->base.type);
10652 if (is_type_integer(type)) {
10653 type = promote_integer(type);
10654 } else if (is_type_valid(type)) {
10655 errorf(&expr->base.source_position,
10656 "__expect expression is not an integer, but '%T'", type);
10657 type = type_error_type;
10659 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10660 rem_anchor_token(')');
10661 expect(')', end_error);
10662 statement->ms_try.final_statement = parse_compound_statement(false);
10663 } else if (token.type == T__finally) {
10665 statement->ms_try.final_statement = parse_compound_statement(false);
10667 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10668 return create_invalid_statement();
10672 return create_invalid_statement();
10675 static statement_t *parse_empty_statement(void)
10677 if (warning.empty_statement) {
10678 warningf(HERE, "statement is empty");
10680 statement_t *const statement = create_empty_statement();
10685 static statement_t *parse_local_label_declaration(void)
10687 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10691 entity_t *begin = NULL, *end = NULL;
10694 if (token.type != T_IDENTIFIER) {
10695 parse_error_expected("while parsing local label declaration",
10696 T_IDENTIFIER, NULL);
10699 symbol_t *symbol = token.v.symbol;
10700 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10701 if (entity != NULL && entity->base.parent_scope == current_scope) {
10702 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10703 symbol, &entity->base.source_position);
10705 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10707 entity->base.parent_scope = current_scope;
10708 entity->base.namespc = NAMESPACE_LABEL;
10709 entity->base.source_position = token.source_position;
10710 entity->base.symbol = symbol;
10713 end->base.next = entity;
10718 environment_push(entity);
10722 if (token.type != ',')
10728 statement->declaration.declarations_begin = begin;
10729 statement->declaration.declarations_end = end;
10733 static void parse_namespace_definition(void)
10737 entity_t *entity = NULL;
10738 symbol_t *symbol = NULL;
10740 if (token.type == T_IDENTIFIER) {
10741 symbol = token.v.symbol;
10744 entity = get_entity(symbol, NAMESPACE_NORMAL);
10745 if (entity != NULL &&
10746 entity->kind != ENTITY_NAMESPACE &&
10747 entity->base.parent_scope == current_scope) {
10748 if (!is_error_entity(entity)) {
10749 error_redefined_as_different_kind(&token.source_position,
10750 entity, ENTITY_NAMESPACE);
10756 if (entity == NULL) {
10757 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10758 entity->base.symbol = symbol;
10759 entity->base.source_position = token.source_position;
10760 entity->base.namespc = NAMESPACE_NORMAL;
10761 entity->base.parent_scope = current_scope;
10764 if (token.type == '=') {
10765 /* TODO: parse namespace alias */
10766 panic("namespace alias definition not supported yet");
10769 environment_push(entity);
10770 append_entity(current_scope, entity);
10772 size_t const top = environment_top();
10773 scope_t *old_scope = scope_push(&entity->namespacee.members);
10775 expect('{', end_error);
10777 expect('}', end_error);
10780 assert(current_scope == &entity->namespacee.members);
10781 scope_pop(old_scope);
10782 environment_pop_to(top);
10786 * Parse a statement.
10787 * There's also parse_statement() which additionally checks for
10788 * "statement has no effect" warnings
10790 static statement_t *intern_parse_statement(void)
10792 statement_t *statement = NULL;
10794 /* declaration or statement */
10795 add_anchor_token(';');
10796 switch (token.type) {
10797 case T_IDENTIFIER: {
10798 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10799 if (la1_type == ':') {
10800 statement = parse_label_statement();
10801 } else if (is_typedef_symbol(token.v.symbol)) {
10802 statement = parse_declaration_statement();
10804 /* it's an identifier, the grammar says this must be an
10805 * expression statement. However it is common that users mistype
10806 * declaration types, so we guess a bit here to improve robustness
10807 * for incorrect programs */
10808 switch (la1_type) {
10811 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10812 goto expression_statment;
10817 statement = parse_declaration_statement();
10821 expression_statment:
10822 statement = parse_expression_statement();
10829 case T___extension__:
10830 /* This can be a prefix to a declaration or an expression statement.
10831 * We simply eat it now and parse the rest with tail recursion. */
10834 } while (token.type == T___extension__);
10835 bool old_gcc_extension = in_gcc_extension;
10836 in_gcc_extension = true;
10837 statement = intern_parse_statement();
10838 in_gcc_extension = old_gcc_extension;
10842 statement = parse_declaration_statement();
10846 statement = parse_local_label_declaration();
10849 case ';': statement = parse_empty_statement(); break;
10850 case '{': statement = parse_compound_statement(false); break;
10851 case T___leave: statement = parse_leave_statement(); break;
10852 case T___try: statement = parse_ms_try_statment(); break;
10853 case T_asm: statement = parse_asm_statement(); break;
10854 case T_break: statement = parse_break(); break;
10855 case T_case: statement = parse_case_statement(); break;
10856 case T_continue: statement = parse_continue(); break;
10857 case T_default: statement = parse_default_statement(); break;
10858 case T_do: statement = parse_do(); break;
10859 case T_for: statement = parse_for(); break;
10860 case T_goto: statement = parse_goto(); break;
10861 case T_if: statement = parse_if(); break;
10862 case T_return: statement = parse_return(); break;
10863 case T_switch: statement = parse_switch(); break;
10864 case T_while: statement = parse_while(); break;
10867 statement = parse_expression_statement();
10871 errorf(HERE, "unexpected token %K while parsing statement", &token);
10872 statement = create_invalid_statement();
10877 rem_anchor_token(';');
10879 assert(statement != NULL
10880 && statement->base.source_position.input_name != NULL);
10886 * parse a statement and emits "statement has no effect" warning if needed
10887 * (This is really a wrapper around intern_parse_statement with check for 1
10888 * single warning. It is needed, because for statement expressions we have
10889 * to avoid the warning on the last statement)
10891 static statement_t *parse_statement(void)
10893 statement_t *statement = intern_parse_statement();
10895 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10896 expression_t *expression = statement->expression.expression;
10897 if (!expression_has_effect(expression)) {
10898 warningf(&expression->base.source_position,
10899 "statement has no effect");
10907 * Parse a compound statement.
10909 static statement_t *parse_compound_statement(bool inside_expression_statement)
10911 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10913 PUSH_PARENT(statement);
10916 add_anchor_token('}');
10917 /* tokens, which can start a statement */
10918 /* TODO MS, __builtin_FOO */
10919 add_anchor_token('!');
10920 add_anchor_token('&');
10921 add_anchor_token('(');
10922 add_anchor_token('*');
10923 add_anchor_token('+');
10924 add_anchor_token('-');
10925 add_anchor_token('{');
10926 add_anchor_token('~');
10927 add_anchor_token(T_CHARACTER_CONSTANT);
10928 add_anchor_token(T_COLONCOLON);
10929 add_anchor_token(T_FLOATINGPOINT);
10930 add_anchor_token(T_IDENTIFIER);
10931 add_anchor_token(T_INTEGER);
10932 add_anchor_token(T_MINUSMINUS);
10933 add_anchor_token(T_PLUSPLUS);
10934 add_anchor_token(T_STRING_LITERAL);
10935 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10936 add_anchor_token(T_WIDE_STRING_LITERAL);
10937 add_anchor_token(T__Bool);
10938 add_anchor_token(T__Complex);
10939 add_anchor_token(T__Imaginary);
10940 add_anchor_token(T___FUNCTION__);
10941 add_anchor_token(T___PRETTY_FUNCTION__);
10942 add_anchor_token(T___alignof__);
10943 add_anchor_token(T___attribute__);
10944 add_anchor_token(T___builtin_va_start);
10945 add_anchor_token(T___extension__);
10946 add_anchor_token(T___func__);
10947 add_anchor_token(T___imag__);
10948 add_anchor_token(T___label__);
10949 add_anchor_token(T___real__);
10950 add_anchor_token(T___thread);
10951 add_anchor_token(T_asm);
10952 add_anchor_token(T_auto);
10953 add_anchor_token(T_bool);
10954 add_anchor_token(T_break);
10955 add_anchor_token(T_case);
10956 add_anchor_token(T_char);
10957 add_anchor_token(T_class);
10958 add_anchor_token(T_const);
10959 add_anchor_token(T_const_cast);
10960 add_anchor_token(T_continue);
10961 add_anchor_token(T_default);
10962 add_anchor_token(T_delete);
10963 add_anchor_token(T_double);
10964 add_anchor_token(T_do);
10965 add_anchor_token(T_dynamic_cast);
10966 add_anchor_token(T_enum);
10967 add_anchor_token(T_extern);
10968 add_anchor_token(T_false);
10969 add_anchor_token(T_float);
10970 add_anchor_token(T_for);
10971 add_anchor_token(T_goto);
10972 add_anchor_token(T_if);
10973 add_anchor_token(T_inline);
10974 add_anchor_token(T_int);
10975 add_anchor_token(T_long);
10976 add_anchor_token(T_new);
10977 add_anchor_token(T_operator);
10978 add_anchor_token(T_register);
10979 add_anchor_token(T_reinterpret_cast);
10980 add_anchor_token(T_restrict);
10981 add_anchor_token(T_return);
10982 add_anchor_token(T_short);
10983 add_anchor_token(T_signed);
10984 add_anchor_token(T_sizeof);
10985 add_anchor_token(T_static);
10986 add_anchor_token(T_static_cast);
10987 add_anchor_token(T_struct);
10988 add_anchor_token(T_switch);
10989 add_anchor_token(T_template);
10990 add_anchor_token(T_this);
10991 add_anchor_token(T_throw);
10992 add_anchor_token(T_true);
10993 add_anchor_token(T_try);
10994 add_anchor_token(T_typedef);
10995 add_anchor_token(T_typeid);
10996 add_anchor_token(T_typename);
10997 add_anchor_token(T_typeof);
10998 add_anchor_token(T_union);
10999 add_anchor_token(T_unsigned);
11000 add_anchor_token(T_using);
11001 add_anchor_token(T_void);
11002 add_anchor_token(T_volatile);
11003 add_anchor_token(T_wchar_t);
11004 add_anchor_token(T_while);
11006 size_t const top = environment_top();
11007 scope_t *old_scope = scope_push(&statement->compound.scope);
11009 statement_t **anchor = &statement->compound.statements;
11010 bool only_decls_so_far = true;
11011 while (token.type != '}') {
11012 if (token.type == T_EOF) {
11013 errorf(&statement->base.source_position,
11014 "EOF while parsing compound statement");
11017 statement_t *sub_statement = intern_parse_statement();
11018 if (is_invalid_statement(sub_statement)) {
11019 /* an error occurred. if we are at an anchor, return */
11025 if (warning.declaration_after_statement) {
11026 if (sub_statement->kind != STATEMENT_DECLARATION) {
11027 only_decls_so_far = false;
11028 } else if (!only_decls_so_far) {
11029 warningf(&sub_statement->base.source_position,
11030 "ISO C90 forbids mixed declarations and code");
11034 *anchor = sub_statement;
11036 while (sub_statement->base.next != NULL)
11037 sub_statement = sub_statement->base.next;
11039 anchor = &sub_statement->base.next;
11043 /* look over all statements again to produce no effect warnings */
11044 if (warning.unused_value) {
11045 statement_t *sub_statement = statement->compound.statements;
11046 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
11047 if (sub_statement->kind != STATEMENT_EXPRESSION)
11049 /* don't emit a warning for the last expression in an expression
11050 * statement as it has always an effect */
11051 if (inside_expression_statement && sub_statement->base.next == NULL)
11054 expression_t *expression = sub_statement->expression.expression;
11055 if (!expression_has_effect(expression)) {
11056 warningf(&expression->base.source_position,
11057 "statement has no effect");
11063 rem_anchor_token(T_while);
11064 rem_anchor_token(T_wchar_t);
11065 rem_anchor_token(T_volatile);
11066 rem_anchor_token(T_void);
11067 rem_anchor_token(T_using);
11068 rem_anchor_token(T_unsigned);
11069 rem_anchor_token(T_union);
11070 rem_anchor_token(T_typeof);
11071 rem_anchor_token(T_typename);
11072 rem_anchor_token(T_typeid);
11073 rem_anchor_token(T_typedef);
11074 rem_anchor_token(T_try);
11075 rem_anchor_token(T_true);
11076 rem_anchor_token(T_throw);
11077 rem_anchor_token(T_this);
11078 rem_anchor_token(T_template);
11079 rem_anchor_token(T_switch);
11080 rem_anchor_token(T_struct);
11081 rem_anchor_token(T_static_cast);
11082 rem_anchor_token(T_static);
11083 rem_anchor_token(T_sizeof);
11084 rem_anchor_token(T_signed);
11085 rem_anchor_token(T_short);
11086 rem_anchor_token(T_return);
11087 rem_anchor_token(T_restrict);
11088 rem_anchor_token(T_reinterpret_cast);
11089 rem_anchor_token(T_register);
11090 rem_anchor_token(T_operator);
11091 rem_anchor_token(T_new);
11092 rem_anchor_token(T_long);
11093 rem_anchor_token(T_int);
11094 rem_anchor_token(T_inline);
11095 rem_anchor_token(T_if);
11096 rem_anchor_token(T_goto);
11097 rem_anchor_token(T_for);
11098 rem_anchor_token(T_float);
11099 rem_anchor_token(T_false);
11100 rem_anchor_token(T_extern);
11101 rem_anchor_token(T_enum);
11102 rem_anchor_token(T_dynamic_cast);
11103 rem_anchor_token(T_do);
11104 rem_anchor_token(T_double);
11105 rem_anchor_token(T_delete);
11106 rem_anchor_token(T_default);
11107 rem_anchor_token(T_continue);
11108 rem_anchor_token(T_const_cast);
11109 rem_anchor_token(T_const);
11110 rem_anchor_token(T_class);
11111 rem_anchor_token(T_char);
11112 rem_anchor_token(T_case);
11113 rem_anchor_token(T_break);
11114 rem_anchor_token(T_bool);
11115 rem_anchor_token(T_auto);
11116 rem_anchor_token(T_asm);
11117 rem_anchor_token(T___thread);
11118 rem_anchor_token(T___real__);
11119 rem_anchor_token(T___label__);
11120 rem_anchor_token(T___imag__);
11121 rem_anchor_token(T___func__);
11122 rem_anchor_token(T___extension__);
11123 rem_anchor_token(T___builtin_va_start);
11124 rem_anchor_token(T___attribute__);
11125 rem_anchor_token(T___alignof__);
11126 rem_anchor_token(T___PRETTY_FUNCTION__);
11127 rem_anchor_token(T___FUNCTION__);
11128 rem_anchor_token(T__Imaginary);
11129 rem_anchor_token(T__Complex);
11130 rem_anchor_token(T__Bool);
11131 rem_anchor_token(T_WIDE_STRING_LITERAL);
11132 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
11133 rem_anchor_token(T_STRING_LITERAL);
11134 rem_anchor_token(T_PLUSPLUS);
11135 rem_anchor_token(T_MINUSMINUS);
11136 rem_anchor_token(T_INTEGER);
11137 rem_anchor_token(T_IDENTIFIER);
11138 rem_anchor_token(T_FLOATINGPOINT);
11139 rem_anchor_token(T_COLONCOLON);
11140 rem_anchor_token(T_CHARACTER_CONSTANT);
11141 rem_anchor_token('~');
11142 rem_anchor_token('{');
11143 rem_anchor_token('-');
11144 rem_anchor_token('+');
11145 rem_anchor_token('*');
11146 rem_anchor_token('(');
11147 rem_anchor_token('&');
11148 rem_anchor_token('!');
11149 rem_anchor_token('}');
11150 assert(current_scope == &statement->compound.scope);
11151 scope_pop(old_scope);
11152 environment_pop_to(top);
11159 * Check for unused global static functions and variables
11161 static void check_unused_globals(void)
11163 if (!warning.unused_function && !warning.unused_variable)
11166 for (const entity_t *entity = file_scope->entities; entity != NULL;
11167 entity = entity->base.next) {
11168 if (!is_declaration(entity))
11171 const declaration_t *declaration = &entity->declaration;
11172 if (declaration->used ||
11173 declaration->modifiers & DM_UNUSED ||
11174 declaration->modifiers & DM_USED ||
11175 declaration->storage_class != STORAGE_CLASS_STATIC)
11178 type_t *const type = declaration->type;
11180 if (entity->kind == ENTITY_FUNCTION) {
11181 /* inhibit warning for static inline functions */
11182 if (entity->function.is_inline)
11185 s = entity->function.statement != NULL ? "defined" : "declared";
11190 warningf(&declaration->base.source_position, "'%#T' %s but not used",
11191 type, declaration->base.symbol, s);
11195 static void parse_global_asm(void)
11197 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
11200 expect('(', end_error);
11202 statement->asms.asm_text = parse_string_literals();
11203 statement->base.next = unit->global_asm;
11204 unit->global_asm = statement;
11206 expect(')', end_error);
11207 expect(';', end_error);
11212 static void parse_linkage_specification(void)
11215 assert(token.type == T_STRING_LITERAL);
11217 const char *linkage = parse_string_literals().begin;
11219 linkage_kind_t old_linkage = current_linkage;
11220 linkage_kind_t new_linkage;
11221 if (strcmp(linkage, "C") == 0) {
11222 new_linkage = LINKAGE_C;
11223 } else if (strcmp(linkage, "C++") == 0) {
11224 new_linkage = LINKAGE_CXX;
11226 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
11227 new_linkage = LINKAGE_INVALID;
11229 current_linkage = new_linkage;
11231 if (token.type == '{') {
11234 expect('}', end_error);
11240 assert(current_linkage == new_linkage);
11241 current_linkage = old_linkage;
11244 static void parse_external(void)
11246 switch (token.type) {
11247 DECLARATION_START_NO_EXTERN
11249 case T___extension__:
11250 /* tokens below are for implicit int */
11251 case '&': /* & x; -> int& x; (and error later, because C++ has no
11253 case '*': /* * x; -> int* x; */
11254 case '(': /* (x); -> int (x); */
11255 parse_external_declaration();
11259 if (look_ahead(1)->type == T_STRING_LITERAL) {
11260 parse_linkage_specification();
11262 parse_external_declaration();
11267 parse_global_asm();
11271 parse_namespace_definition();
11275 if (!strict_mode) {
11277 warningf(HERE, "stray ';' outside of function");
11284 errorf(HERE, "stray %K outside of function", &token);
11285 if (token.type == '(' || token.type == '{' || token.type == '[')
11286 eat_until_matching_token(token.type);
11292 static void parse_externals(void)
11294 add_anchor_token('}');
11295 add_anchor_token(T_EOF);
11298 unsigned char token_anchor_copy[T_LAST_TOKEN];
11299 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
11302 while (token.type != T_EOF && token.type != '}') {
11304 bool anchor_leak = false;
11305 for (int i = 0; i != T_LAST_TOKEN; ++i) {
11306 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
11308 errorf(HERE, "Leaked anchor token %k %d times", i, count);
11309 anchor_leak = true;
11312 if (in_gcc_extension) {
11313 errorf(HERE, "Leaked __extension__");
11314 anchor_leak = true;
11324 rem_anchor_token(T_EOF);
11325 rem_anchor_token('}');
11329 * Parse a translation unit.
11331 static void parse_translation_unit(void)
11333 add_anchor_token(T_EOF);
11338 if (token.type == T_EOF)
11341 errorf(HERE, "stray %K outside of function", &token);
11342 if (token.type == '(' || token.type == '{' || token.type == '[')
11343 eat_until_matching_token(token.type);
11351 * @return the translation unit or NULL if errors occurred.
11353 void start_parsing(void)
11355 environment_stack = NEW_ARR_F(stack_entry_t, 0);
11356 label_stack = NEW_ARR_F(stack_entry_t, 0);
11357 diagnostic_count = 0;
11361 type_set_output(stderr);
11362 ast_set_output(stderr);
11364 assert(unit == NULL);
11365 unit = allocate_ast_zero(sizeof(unit[0]));
11367 assert(file_scope == NULL);
11368 file_scope = &unit->scope;
11370 assert(current_scope == NULL);
11371 scope_push(&unit->scope);
11373 create_gnu_builtins();
11375 create_microsoft_intrinsics();
11378 translation_unit_t *finish_parsing(void)
11380 assert(current_scope == &unit->scope);
11383 assert(file_scope == &unit->scope);
11384 check_unused_globals();
11387 DEL_ARR_F(environment_stack);
11388 DEL_ARR_F(label_stack);
11390 translation_unit_t *result = unit;
11395 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
11396 * are given length one. */
11397 static void complete_incomplete_arrays(void)
11399 size_t n = ARR_LEN(incomplete_arrays);
11400 for (size_t i = 0; i != n; ++i) {
11401 declaration_t *const decl = incomplete_arrays[i];
11402 type_t *const orig_type = decl->type;
11403 type_t *const type = skip_typeref(orig_type);
11405 if (!is_type_incomplete(type))
11408 if (warning.other) {
11409 warningf(&decl->base.source_position,
11410 "array '%#T' assumed to have one element",
11411 orig_type, decl->base.symbol);
11414 type_t *const new_type = duplicate_type(type);
11415 new_type->array.size_constant = true;
11416 new_type->array.has_implicit_size = true;
11417 new_type->array.size = 1;
11419 type_t *const result = identify_new_type(new_type);
11421 decl->type = result;
11427 lookahead_bufpos = 0;
11428 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
11431 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
11432 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
11433 parse_translation_unit();
11434 complete_incomplete_arrays();
11435 DEL_ARR_F(incomplete_arrays);
11436 incomplete_arrays = NULL;
11440 * create a builtin function.
11442 static entity_t *create_builtin_function(builtin_kind_t kind, const char *name, type_t *function_type)
11444 symbol_t *symbol = symbol_table_insert(name);
11445 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
11446 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
11447 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
11448 entity->declaration.type = function_type;
11449 entity->declaration.implicit = true;
11450 entity->base.symbol = symbol;
11451 entity->base.source_position = builtin_source_position;
11453 entity->function.btk = kind;
11455 record_entity(entity, /*is_definition=*/false);
11461 * Create predefined gnu builtins.
11463 static void create_gnu_builtins(void) {
11465 #define STR(a) _STR(a)
11466 #define CONCAT(a,b) a##b
11467 #define GNU_BUILTIN_NAME(a) STR(CONCAT(__builtin_, a))
11468 #define GNU_BUILTIN(a, b) create_builtin_function(CONCAT(bk_gnu_builtin_, a), GNU_BUILTIN_NAME(a), b)
11470 GNU_BUILTIN(alloca, make_function_1_type(type_void_ptr, type_size_t));
11471 GNU_BUILTIN(huge_val, make_function_0_type(type_double));
11472 GNU_BUILTIN(inf, make_function_0_type(type_double));
11473 GNU_BUILTIN(inff, make_function_0_type(type_float));
11474 GNU_BUILTIN(infl, make_function_0_type(type_long_double));
11475 GNU_BUILTIN(nan, make_function_1_type(type_double, type_char_ptr));
11476 GNU_BUILTIN(nanf, make_function_1_type(type_float, type_char_ptr));
11477 GNU_BUILTIN(nanl, make_function_1_type(type_long_double, type_char_ptr));
11478 GNU_BUILTIN(va_end, make_function_1_type(type_void, type_valist));
11479 GNU_BUILTIN(expect, make_function_2_type(type_long, type_long, type_long));
11480 GNU_BUILTIN(return_address, make_function_1_type(type_void_ptr, type_unsigned_int));
11481 GNU_BUILTIN(frame_address, make_function_1_type(type_void_ptr, type_unsigned_int));
11482 GNU_BUILTIN(ffs, make_function_1_type(type_int, type_unsigned_int));
11483 GNU_BUILTIN(clz, make_function_1_type(type_int, type_unsigned_int));
11484 GNU_BUILTIN(ctz, make_function_1_type(type_int, type_unsigned_int));
11485 GNU_BUILTIN(popcount, make_function_1_type(type_int, type_unsigned_int));
11486 GNU_BUILTIN(parity, make_function_1_type(type_int, type_unsigned_int));
11487 GNU_BUILTIN(prefetch, make_function_1_type_variadic(type_float, type_void_ptr));
11488 GNU_BUILTIN(trap, make_function_0_type_noreturn(type_void));
11491 #undef GNU_BUILTIN_NAME
11498 * Create predefined MS intrinsics.
11500 static void create_microsoft_intrinsics(void) {
11502 #define STR(a) _STR(a)
11503 #define CONCAT(a,b) a##b
11504 #define MS_BUILTIN(a, b) create_builtin_function(CONCAT(bk_ms, a), STR(a), b)
11506 MS_BUILTIN(__debugbreak, make_function_0_type(type_void));
11507 MS_BUILTIN(_ReturnAddress, make_function_0_type(type_void_ptr));
11508 MS_BUILTIN(__popcount, make_function_1_type(type_unsigned_int, type_unsigned_int));
11509 MS_BUILTIN(__ud2, make_function_0_type_noreturn(type_void));
11518 * Initialize the parser.
11520 void init_parser(void)
11522 sym_anonymous = symbol_table_insert("<anonymous>");
11524 if (c_mode & _MS) {
11525 /* add predefined symbols for extended-decl-modifier */
11526 sym_align = symbol_table_insert("align");
11527 sym_allocate = symbol_table_insert("allocate");
11528 sym_dllimport = symbol_table_insert("dllimport");
11529 sym_dllexport = symbol_table_insert("dllexport");
11530 sym_naked = symbol_table_insert("naked");
11531 sym_noinline = symbol_table_insert("noinline");
11532 sym_returns_twice = symbol_table_insert("returns_twice");
11533 sym_noreturn = symbol_table_insert("noreturn");
11534 sym_nothrow = symbol_table_insert("nothrow");
11535 sym_novtable = symbol_table_insert("novtable");
11536 sym_property = symbol_table_insert("property");
11537 sym_get = symbol_table_insert("get");
11538 sym_put = symbol_table_insert("put");
11539 sym_selectany = symbol_table_insert("selectany");
11540 sym_thread = symbol_table_insert("thread");
11541 sym_uuid = symbol_table_insert("uuid");
11542 sym_deprecated = symbol_table_insert("deprecated");
11543 sym_restrict = symbol_table_insert("restrict");
11544 sym_noalias = symbol_table_insert("noalias");
11546 memset(token_anchor_set, 0, sizeof(token_anchor_set));
11548 init_expression_parsers();
11549 obstack_init(&temp_obst);
11551 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
11552 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
11556 * Terminate the parser.
11558 void exit_parser(void)
11560 obstack_free(&temp_obst, NULL);