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"
36 #include "lang_features.h"
38 #include "adt/bitfiddle.h"
39 #include "adt/error.h"
40 #include "adt/array.h"
42 /** if wchar_t is equal to unsigned short. */
43 bool opt_short_wchar_t =
50 //#define PRINT_TOKENS
51 #define MAX_LOOKAHEAD 2
54 declaration_t *old_declaration;
56 unsigned short namespc;
59 typedef struct argument_list_t argument_list_t;
60 struct argument_list_t {
62 argument_list_t *next;
65 typedef struct gnu_attribute_t gnu_attribute_t;
66 struct gnu_attribute_t {
67 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
68 gnu_attribute_t *next;
69 bool invalid; /**< Set if this attribute had argument errors, */
70 bool have_arguments; /**< True, if this attribute has arguments. */
74 atomic_type_kind_t akind;
75 long argument; /**< Single argument. */
76 argument_list_t *arguments; /**< List of argument expressions. */
80 typedef struct declaration_specifiers_t declaration_specifiers_t;
81 struct declaration_specifiers_t {
82 source_position_t source_position;
83 unsigned char declared_storage_class;
84 unsigned char alignment; /**< Alignment, 0 if not set. */
85 unsigned int is_inline : 1;
86 unsigned int deprecated : 1;
87 decl_modifiers_t modifiers; /**< declaration modifiers */
88 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
89 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
90 symbol_t *get_property_sym; /**< the name of the get property if set. */
91 symbol_t *put_property_sym; /**< the name of the put property if set. */
96 * An environment for parsing initializers (and compound literals).
98 typedef struct parse_initializer_env_t {
99 type_t *type; /**< the type of the initializer. In case of an
100 array type with unspecified size this gets
101 adjusted to the actual size. */
102 declaration_t *declaration; /**< the declaration that is initialized if any */
103 bool must_be_constant;
104 } parse_initializer_env_t;
106 typedef declaration_t* (*parsed_declaration_func) (declaration_t *declaration, bool is_definition);
108 /** The current token. */
109 static token_t token;
110 /** The lookahead ring-buffer. */
111 static token_t lookahead_buffer[MAX_LOOKAHEAD];
112 /** Position of the next token in the lookahead buffer. */
113 static int lookahead_bufpos;
114 static stack_entry_t *environment_stack = NULL;
115 static stack_entry_t *label_stack = NULL;
116 static stack_entry_t *local_label_stack = NULL;
117 /** The global file scope. */
118 static scope_t *file_scope = NULL;
119 /** The current scope. */
120 static scope_t *scope = NULL;
121 static declaration_t *last_declaration = NULL;
122 /** Point to the current function declaration if inside a function. */
123 static declaration_t *current_function = NULL;
124 static declaration_t *current_init_decl = NULL;
125 static switch_statement_t *current_switch = NULL;
126 static statement_t *current_loop = NULL;
127 static statement_t *current_parent = NULL;
128 static ms_try_statement_t *current_try = NULL;
129 static goto_statement_t *goto_first = NULL;
130 static goto_statement_t *goto_last = NULL;
131 static label_statement_t *label_first = NULL;
132 static label_statement_t *label_last = 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;
142 #define PUSH_PARENT(stmt) \
143 statement_t *const prev_parent = current_parent; \
144 current_parent = (stmt);
145 #define POP_PARENT ((void)(current_parent = prev_parent))
147 static source_position_t null_position = { NULL, 0 };
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_noreturn = NULL;
160 static const symbol_t *sym_nothrow = NULL;
161 static const symbol_t *sym_novtable = NULL;
162 static const symbol_t *sym_property = NULL;
163 static const symbol_t *sym_get = NULL;
164 static const symbol_t *sym_put = NULL;
165 static const symbol_t *sym_selectany = NULL;
166 static const symbol_t *sym_thread = NULL;
167 static const symbol_t *sym_uuid = NULL;
168 static const symbol_t *sym_deprecated = NULL;
169 static const symbol_t *sym_restrict = NULL;
170 static const symbol_t *sym_noalias = NULL;
172 /** The token anchor set */
173 static unsigned char token_anchor_set[T_LAST_TOKEN];
175 /** The current source position. */
176 #define HERE (&token.source_position)
178 /** true if we are in GCC mode. */
179 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
181 static type_t *type_valist;
183 static statement_t *parse_compound_statement(bool inside_expression_statement);
184 static statement_t *parse_statement(void);
186 static expression_t *parse_sub_expression(unsigned precedence);
187 static expression_t *parse_expression(void);
188 static type_t *parse_typename(void);
190 static void parse_compound_type_entries(declaration_t *compound_declaration);
191 static declaration_t *parse_declarator(
192 const declaration_specifiers_t *specifiers, bool may_be_abstract);
193 static declaration_t *record_declaration(declaration_t *declaration, bool is_definition);
195 static void semantic_comparison(binary_expression_t *expression);
197 #define STORAGE_CLASSES \
205 #define TYPE_QUALIFIERS \
210 case T__forceinline: \
211 case T___attribute__:
213 #ifdef PROVIDE_COMPLEX
214 #define COMPLEX_SPECIFIERS \
216 #define IMAGINARY_SPECIFIERS \
219 #define COMPLEX_SPECIFIERS
220 #define IMAGINARY_SPECIFIERS
223 #define TYPE_SPECIFIERS \
238 case T___builtin_va_list: \
243 #define DECLARATION_START \
248 #define TYPENAME_START \
253 * Allocate an AST node with given size and
254 * initialize all fields with zero.
256 static void *allocate_ast_zero(size_t size)
258 void *res = allocate_ast(size);
259 memset(res, 0, size);
263 static declaration_t *allocate_declaration_zero(void)
265 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
266 declaration->type = type_error_type;
267 declaration->alignment = 0;
272 * Returns the size of a statement node.
274 * @param kind the statement kind
276 static size_t get_statement_struct_size(statement_kind_t kind)
278 static const size_t sizes[] = {
279 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
280 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
281 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
282 [STATEMENT_RETURN] = sizeof(return_statement_t),
283 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
284 [STATEMENT_IF] = sizeof(if_statement_t),
285 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
286 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
287 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
288 [STATEMENT_BREAK] = sizeof(statement_base_t),
289 [STATEMENT_GOTO] = sizeof(goto_statement_t),
290 [STATEMENT_LABEL] = sizeof(label_statement_t),
291 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
292 [STATEMENT_WHILE] = sizeof(while_statement_t),
293 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
294 [STATEMENT_FOR] = sizeof(for_statement_t),
295 [STATEMENT_ASM] = sizeof(asm_statement_t),
296 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
297 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
299 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
300 assert(sizes[kind] != 0);
305 * Returns the size of an expression node.
307 * @param kind the expression kind
309 static size_t get_expression_struct_size(expression_kind_t kind)
311 static const size_t sizes[] = {
312 [EXPR_INVALID] = sizeof(expression_base_t),
313 [EXPR_REFERENCE] = sizeof(reference_expression_t),
314 [EXPR_CONST] = sizeof(const_expression_t),
315 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
316 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
317 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
318 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
319 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
320 [EXPR_CALL] = sizeof(call_expression_t),
321 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
322 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
323 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
324 [EXPR_SELECT] = sizeof(select_expression_t),
325 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
326 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
327 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
328 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
329 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
330 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
331 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
332 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
333 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
334 [EXPR_VA_START] = sizeof(va_start_expression_t),
335 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
336 [EXPR_STATEMENT] = sizeof(statement_expression_t),
337 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
339 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
340 return sizes[EXPR_UNARY_FIRST];
342 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
343 return sizes[EXPR_BINARY_FIRST];
345 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
346 assert(sizes[kind] != 0);
351 * Allocate a statement node of given kind and initialize all
354 static statement_t *allocate_statement_zero(statement_kind_t kind)
356 size_t size = get_statement_struct_size(kind);
357 statement_t *res = allocate_ast_zero(size);
359 res->base.kind = kind;
360 res->base.parent = current_parent;
361 res->base.source_position = token.source_position;
366 * Allocate an expression node of given kind and initialize all
369 static expression_t *allocate_expression_zero(expression_kind_t kind)
371 size_t size = get_expression_struct_size(kind);
372 expression_t *res = allocate_ast_zero(size);
374 res->base.kind = kind;
375 res->base.type = type_error_type;
380 * Creates a new invalid expression.
382 static expression_t *create_invalid_expression(void)
384 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
385 expression->base.source_position = token.source_position;
390 * Creates a new invalid statement.
392 static statement_t *create_invalid_statement(void)
394 return allocate_statement_zero(STATEMENT_INVALID);
398 * Allocate a new empty statement.
400 static statement_t *create_empty_statement(void)
402 return allocate_statement_zero(STATEMENT_EMPTY);
406 * Returns the size of a type node.
408 * @param kind the type kind
410 static size_t get_type_struct_size(type_kind_t kind)
412 static const size_t sizes[] = {
413 [TYPE_ATOMIC] = sizeof(atomic_type_t),
414 [TYPE_COMPLEX] = sizeof(complex_type_t),
415 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
416 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
417 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
418 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
419 [TYPE_ENUM] = sizeof(enum_type_t),
420 [TYPE_FUNCTION] = sizeof(function_type_t),
421 [TYPE_POINTER] = sizeof(pointer_type_t),
422 [TYPE_ARRAY] = sizeof(array_type_t),
423 [TYPE_BUILTIN] = sizeof(builtin_type_t),
424 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
425 [TYPE_TYPEOF] = sizeof(typeof_type_t),
427 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
428 assert(kind <= TYPE_TYPEOF);
429 assert(sizes[kind] != 0);
434 * Allocate a type node of given kind and initialize all
437 * @param kind type kind to allocate
438 * @param source_position the source position of the type definition
440 static type_t *allocate_type_zero(type_kind_t kind, const source_position_t *source_position)
442 size_t size = get_type_struct_size(kind);
443 type_t *res = obstack_alloc(type_obst, size);
444 memset(res, 0, size);
446 res->base.kind = kind;
447 res->base.source_position = *source_position;
452 * Returns the size of an initializer node.
454 * @param kind the initializer kind
456 static size_t get_initializer_size(initializer_kind_t kind)
458 static const size_t sizes[] = {
459 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
460 [INITIALIZER_STRING] = sizeof(initializer_string_t),
461 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
462 [INITIALIZER_LIST] = sizeof(initializer_list_t),
463 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
465 assert(kind < sizeof(sizes) / sizeof(*sizes));
466 assert(sizes[kind] != 0);
471 * Allocate an initializer node of given kind and initialize all
474 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
476 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
483 * Free a type from the type obstack.
485 static void free_type(void *type)
487 obstack_free(type_obst, type);
491 * Returns the index of the top element of the environment stack.
493 static size_t environment_top(void)
495 return ARR_LEN(environment_stack);
499 * Returns the index of the top element of the global label stack.
501 static size_t label_top(void)
503 return ARR_LEN(label_stack);
507 * Returns the index of the top element of the local label stack.
509 static size_t local_label_top(void)
511 return ARR_LEN(local_label_stack);
515 * Return the next token.
517 static inline void next_token(void)
519 token = lookahead_buffer[lookahead_bufpos];
520 lookahead_buffer[lookahead_bufpos] = lexer_token;
523 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
526 print_token(stderr, &token);
527 fprintf(stderr, "\n");
532 * Return the next token with a given lookahead.
534 static inline const token_t *look_ahead(int num)
536 assert(num > 0 && num <= MAX_LOOKAHEAD);
537 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
538 return &lookahead_buffer[pos];
542 * Adds a token to the token anchor set (a multi-set).
544 static void add_anchor_token(int token_type)
546 assert(0 <= token_type && token_type < T_LAST_TOKEN);
547 ++token_anchor_set[token_type];
550 static int save_and_reset_anchor_state(int token_type)
552 assert(0 <= token_type && token_type < T_LAST_TOKEN);
553 int count = token_anchor_set[token_type];
554 token_anchor_set[token_type] = 0;
558 static void restore_anchor_state(int token_type, int count)
560 assert(0 <= token_type && token_type < T_LAST_TOKEN);
561 token_anchor_set[token_type] = count;
565 * Remove a token from the token anchor set (a multi-set).
567 static void rem_anchor_token(int token_type)
569 assert(0 <= token_type && token_type < T_LAST_TOKEN);
570 assert(token_anchor_set[token_type] != 0);
571 --token_anchor_set[token_type];
574 static bool at_anchor(void)
578 return token_anchor_set[token.type];
582 * Eat tokens until a matching token is found.
584 static void eat_until_matching_token(int type)
588 case '(': end_token = ')'; break;
589 case '{': end_token = '}'; break;
590 case '[': end_token = ']'; break;
591 default: end_token = type; break;
594 unsigned parenthesis_count = 0;
595 unsigned brace_count = 0;
596 unsigned bracket_count = 0;
597 while (token.type != end_token ||
598 parenthesis_count != 0 ||
600 bracket_count != 0) {
601 switch (token.type) {
603 case '(': ++parenthesis_count; break;
604 case '{': ++brace_count; break;
605 case '[': ++bracket_count; break;
608 if (parenthesis_count > 0)
618 if (bracket_count > 0)
621 if (token.type == end_token &&
622 parenthesis_count == 0 &&
636 * Eat input tokens until an anchor is found.
638 static void eat_until_anchor(void)
640 while (token_anchor_set[token.type] == 0) {
641 if (token.type == '(' || token.type == '{' || token.type == '[')
642 eat_until_matching_token(token.type);
647 static void eat_block(void)
649 eat_until_matching_token('{');
650 if (token.type == '}')
654 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while (0)
657 * Report a parse error because an expected token was not found.
660 #if defined __GNUC__ && __GNUC__ >= 4
661 __attribute__((sentinel))
663 void parse_error_expected(const char *message, ...)
665 if (message != NULL) {
666 errorf(HERE, "%s", message);
669 va_start(ap, message);
670 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
675 * Report a type error.
677 static void type_error(const char *msg, const source_position_t *source_position,
680 errorf(source_position, "%s, but found type '%T'", msg, type);
684 * Report an incompatible type.
686 static void type_error_incompatible(const char *msg,
687 const source_position_t *source_position, type_t *type1, type_t *type2)
689 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
694 * Expect the the current token is the expected token.
695 * If not, generate an error, eat the current statement,
696 * and goto the end_error label.
698 #define expect(expected) \
700 if (UNLIKELY(token.type != (expected))) { \
701 parse_error_expected(NULL, (expected), NULL); \
702 add_anchor_token(expected); \
703 eat_until_anchor(); \
704 if (token.type == expected) \
706 rem_anchor_token(expected); \
712 static void scope_push(scope_t *new_scope)
715 scope->last_declaration = last_declaration;
716 new_scope->depth = scope->depth + 1;
718 new_scope->parent = scope;
721 last_declaration = new_scope->last_declaration;
724 static void scope_pop(void)
726 scope->last_declaration = last_declaration;
727 scope = scope->parent;
728 last_declaration = scope->last_declaration;
732 * Search a symbol in a given namespace and returns its declaration or
733 * NULL if this symbol was not found.
735 static declaration_t *get_declaration(const symbol_t *const symbol,
736 const namespace_t namespc)
738 declaration_t *declaration = symbol->declaration;
739 for( ; declaration != NULL; declaration = declaration->symbol_next) {
740 if (declaration->namespc == namespc)
748 * pushs an environment_entry on the environment stack and links the
749 * corresponding symbol to the new entry
751 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
753 symbol_t *symbol = declaration->symbol;
754 namespace_t namespc = (namespace_t) declaration->namespc;
756 /* replace/add declaration into declaration list of the symbol */
757 declaration_t **anchor;
759 for (anchor = &symbol->declaration;; anchor = &iter->symbol_next) {
764 /* replace an entry? */
765 if (iter->namespc == namespc) {
766 declaration->symbol_next = iter->symbol_next;
770 *anchor = declaration;
772 /* remember old declaration */
774 entry.symbol = symbol;
775 entry.old_declaration = iter;
776 entry.namespc = (unsigned short) namespc;
777 ARR_APP1(stack_entry_t, *stack_ptr, entry);
781 * Push a declaration on the environment stack.
783 * @param declaration the declaration
785 static void environment_push(declaration_t *declaration)
787 assert(declaration->source_position.input_name != NULL);
788 assert(declaration->parent_scope != NULL);
789 stack_push(&environment_stack, declaration);
793 * Push a declaration on the global label stack.
795 * @param declaration the declaration
797 static void label_push(declaration_t *declaration)
799 declaration->parent_scope = ¤t_function->scope;
800 stack_push(&label_stack, declaration);
804 * Push a declaration of the local label stack.
806 * @param declaration the declaration
808 static void local_label_push(declaration_t *declaration)
810 assert(declaration->parent_scope != NULL);
811 stack_push(&local_label_stack, declaration);
815 * pops symbols from the environment stack until @p new_top is the top element
817 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
819 stack_entry_t *stack = *stack_ptr;
820 size_t top = ARR_LEN(stack);
823 assert(new_top <= top);
827 for(i = top; i > new_top; --i) {
828 stack_entry_t *entry = &stack[i - 1];
830 declaration_t *old_declaration = entry->old_declaration;
831 symbol_t *symbol = entry->symbol;
832 namespace_t namespc = (namespace_t)entry->namespc;
834 /* replace/remove declaration */
835 declaration_t **anchor;
837 for (anchor = &symbol->declaration;; anchor = &iter->symbol_next) {
839 assert(iter != NULL);
840 /* replace an entry? */
841 if (iter->namespc == namespc)
845 /* Not all declarations adhere scopes (e.g. jump labels), so this
846 * correction is necessary */
847 if (old_declaration != NULL) {
848 old_declaration->symbol_next = iter->symbol_next;
849 *anchor = old_declaration;
851 *anchor = iter->symbol_next;
855 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
859 * Pop all entries from the environment stack until the new_top
862 * @param new_top the new stack top
864 static void environment_pop_to(size_t new_top)
866 stack_pop_to(&environment_stack, new_top);
870 * Pop all entries from the global label stack until the new_top
873 * @param new_top the new stack top
875 static void label_pop_to(size_t new_top)
877 stack_pop_to(&label_stack, new_top);
881 * Pop all entries from the local label stack until the new_top
884 * @param new_top the new stack top
886 static void local_label_pop_to(size_t new_top)
888 stack_pop_to(&local_label_stack, new_top);
892 static int get_akind_rank(atomic_type_kind_t akind)
897 static int get_rank(const type_t *type)
899 assert(!is_typeref(type));
900 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
901 * and esp. footnote 108). However we can't fold constants (yet), so we
902 * can't decide whether unsigned int is possible, while int always works.
903 * (unsigned int would be preferable when possible... for stuff like
904 * struct { enum { ... } bla : 4; } ) */
905 if (type->kind == TYPE_ENUM)
906 return get_akind_rank(ATOMIC_TYPE_INT);
908 assert(type->kind == TYPE_ATOMIC);
909 return get_akind_rank(type->atomic.akind);
912 static type_t *promote_integer(type_t *type)
914 if (type->kind == TYPE_BITFIELD)
915 type = type->bitfield.base_type;
917 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
924 * Create a cast expression.
926 * @param expression the expression to cast
927 * @param dest_type the destination type
929 static expression_t *create_cast_expression(expression_t *expression,
932 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
934 cast->unary.value = expression;
935 cast->base.type = dest_type;
941 * Check if a given expression represents the 0 pointer constant.
943 static bool is_null_pointer_constant(const expression_t *expression)
945 /* skip void* cast */
946 if (expression->kind == EXPR_UNARY_CAST
947 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
948 expression = expression->unary.value;
951 /* TODO: not correct yet, should be any constant integer expression
952 * which evaluates to 0 */
953 if (expression->kind != EXPR_CONST)
956 type_t *const type = skip_typeref(expression->base.type);
957 if (!is_type_integer(type))
960 return expression->conste.v.int_value == 0;
964 * Create an implicit cast expression.
966 * @param expression the expression to cast
967 * @param dest_type the destination type
969 static expression_t *create_implicit_cast(expression_t *expression,
972 type_t *const source_type = expression->base.type;
974 if (source_type == dest_type)
977 return create_cast_expression(expression, dest_type);
980 typedef enum assign_error_t {
982 ASSIGN_ERROR_INCOMPATIBLE,
983 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
984 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
985 ASSIGN_WARNING_POINTER_FROM_INT,
986 ASSIGN_WARNING_INT_FROM_POINTER
989 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
990 const expression_t *const right,
992 const source_position_t *source_position)
994 type_t *const orig_type_right = right->base.type;
995 type_t *const type_left = skip_typeref(orig_type_left);
996 type_t *const type_right = skip_typeref(orig_type_right);
1001 case ASSIGN_ERROR_INCOMPATIBLE:
1002 errorf(source_position,
1003 "destination type '%T' in %s is incompatible with type '%T'",
1004 orig_type_left, context, orig_type_right);
1007 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1008 type_t *points_to_left
1009 = skip_typeref(type_left->pointer.points_to);
1010 type_t *points_to_right
1011 = skip_typeref(type_right->pointer.points_to);
1013 /* the left type has all qualifiers from the right type */
1014 unsigned missing_qualifiers
1015 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1016 warningf(source_position,
1017 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1018 orig_type_left, context, orig_type_right, missing_qualifiers);
1022 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1023 warningf(source_position,
1024 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1025 orig_type_left, context, right, orig_type_right);
1028 case ASSIGN_WARNING_POINTER_FROM_INT:
1029 warningf(source_position,
1030 "%s makes pointer '%T' from integer '%T' without a cast",
1031 context, orig_type_left, orig_type_right);
1034 case ASSIGN_WARNING_INT_FROM_POINTER:
1035 warningf(source_position,
1036 "%s makes integer '%T' from pointer '%T' without a cast",
1037 context, orig_type_left, orig_type_right);
1041 panic("invalid error value");
1045 /** Implements the rules from § 6.5.16.1 */
1046 static assign_error_t semantic_assign(type_t *orig_type_left,
1047 const expression_t *const right)
1049 type_t *const orig_type_right = right->base.type;
1050 type_t *const type_left = skip_typeref(orig_type_left);
1051 type_t *const type_right = skip_typeref(orig_type_right);
1053 if (is_type_pointer(type_left)) {
1054 if (is_null_pointer_constant(right)) {
1055 return ASSIGN_SUCCESS;
1056 } else if (is_type_pointer(type_right)) {
1057 type_t *points_to_left
1058 = skip_typeref(type_left->pointer.points_to);
1059 type_t *points_to_right
1060 = skip_typeref(type_right->pointer.points_to);
1061 assign_error_t res = ASSIGN_SUCCESS;
1063 /* the left type has all qualifiers from the right type */
1064 unsigned missing_qualifiers
1065 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1066 if (missing_qualifiers != 0) {
1067 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1070 points_to_left = get_unqualified_type(points_to_left);
1071 points_to_right = get_unqualified_type(points_to_right);
1073 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
1074 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1078 if (!types_compatible(points_to_left, points_to_right)) {
1079 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1083 } else if (is_type_integer(type_right)) {
1084 return ASSIGN_WARNING_POINTER_FROM_INT;
1086 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1087 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1088 && is_type_pointer(type_right))) {
1089 return ASSIGN_SUCCESS;
1090 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1091 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1092 type_t *const unqual_type_left = get_unqualified_type(type_left);
1093 type_t *const unqual_type_right = get_unqualified_type(type_right);
1094 if (types_compatible(unqual_type_left, unqual_type_right)) {
1095 return ASSIGN_SUCCESS;
1097 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1098 return ASSIGN_WARNING_INT_FROM_POINTER;
1101 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1102 return ASSIGN_SUCCESS;
1104 return ASSIGN_ERROR_INCOMPATIBLE;
1107 static expression_t *parse_constant_expression(void)
1109 /* start parsing at precedence 7 (conditional expression) */
1110 expression_t *result = parse_sub_expression(7);
1112 if (!is_constant_expression(result)) {
1113 errorf(&result->base.source_position,
1114 "expression '%E' is not constant\n", result);
1120 static expression_t *parse_assignment_expression(void)
1122 /* start parsing at precedence 2 (assignment expression) */
1123 return parse_sub_expression(2);
1126 static type_t *make_global_typedef(const char *name, type_t *type)
1128 symbol_t *const symbol = symbol_table_insert(name);
1130 declaration_t *const declaration = allocate_declaration_zero();
1131 declaration->namespc = NAMESPACE_NORMAL;
1132 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
1133 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
1134 declaration->type = type;
1135 declaration->symbol = symbol;
1136 declaration->source_position = builtin_source_position;
1137 declaration->implicit = true;
1139 record_declaration(declaration, false);
1141 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
1142 typedef_type->typedeft.declaration = declaration;
1144 return typedef_type;
1147 static string_t parse_string_literals(void)
1149 assert(token.type == T_STRING_LITERAL);
1150 string_t result = token.v.string;
1154 while (token.type == T_STRING_LITERAL) {
1155 result = concat_strings(&result, &token.v.string);
1162 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1163 [GNU_AK_CONST] = "const",
1164 [GNU_AK_VOLATILE] = "volatile",
1165 [GNU_AK_CDECL] = "cdecl",
1166 [GNU_AK_STDCALL] = "stdcall",
1167 [GNU_AK_FASTCALL] = "fastcall",
1168 [GNU_AK_DEPRECATED] = "deprecated",
1169 [GNU_AK_NOINLINE] = "noinline",
1170 [GNU_AK_NORETURN] = "noreturn",
1171 [GNU_AK_NAKED] = "naked",
1172 [GNU_AK_PURE] = "pure",
1173 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1174 [GNU_AK_MALLOC] = "malloc",
1175 [GNU_AK_WEAK] = "weak",
1176 [GNU_AK_CONSTRUCTOR] = "constructor",
1177 [GNU_AK_DESTRUCTOR] = "destructor",
1178 [GNU_AK_NOTHROW] = "nothrow",
1179 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1180 [GNU_AK_COMMON] = "common",
1181 [GNU_AK_NOCOMMON] = "nocommon",
1182 [GNU_AK_PACKED] = "packed",
1183 [GNU_AK_SHARED] = "shared",
1184 [GNU_AK_NOTSHARED] = "notshared",
1185 [GNU_AK_USED] = "used",
1186 [GNU_AK_UNUSED] = "unused",
1187 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1188 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1189 [GNU_AK_LONGCALL] = "longcall",
1190 [GNU_AK_SHORTCALL] = "shortcall",
1191 [GNU_AK_LONG_CALL] = "long_call",
1192 [GNU_AK_SHORT_CALL] = "short_call",
1193 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1194 [GNU_AK_INTERRUPT] = "interrupt",
1195 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1196 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1197 [GNU_AK_NESTING] = "nesting",
1198 [GNU_AK_NEAR] = "near",
1199 [GNU_AK_FAR] = "far",
1200 [GNU_AK_SIGNAL] = "signal",
1201 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1202 [GNU_AK_TINY_DATA] = "tiny_data",
1203 [GNU_AK_SAVEALL] = "saveall",
1204 [GNU_AK_FLATTEN] = "flatten",
1205 [GNU_AK_SSEREGPARM] = "sseregparm",
1206 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1207 [GNU_AK_RETURN_TWICE] = "return_twice",
1208 [GNU_AK_MAY_ALIAS] = "may_alias",
1209 [GNU_AK_MS_STRUCT] = "ms_struct",
1210 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1211 [GNU_AK_DLLIMPORT] = "dllimport",
1212 [GNU_AK_DLLEXPORT] = "dllexport",
1213 [GNU_AK_ALIGNED] = "aligned",
1214 [GNU_AK_ALIAS] = "alias",
1215 [GNU_AK_SECTION] = "section",
1216 [GNU_AK_FORMAT] = "format",
1217 [GNU_AK_FORMAT_ARG] = "format_arg",
1218 [GNU_AK_WEAKREF] = "weakref",
1219 [GNU_AK_NONNULL] = "nonnull",
1220 [GNU_AK_TLS_MODEL] = "tls_model",
1221 [GNU_AK_VISIBILITY] = "visibility",
1222 [GNU_AK_REGPARM] = "regparm",
1223 [GNU_AK_MODE] = "mode",
1224 [GNU_AK_MODEL] = "model",
1225 [GNU_AK_TRAP_EXIT] = "trap_exit",
1226 [GNU_AK_SP_SWITCH] = "sp_switch",
1227 [GNU_AK_SENTINEL] = "sentinel"
1231 * compare two string, ignoring double underscores on the second.
1233 static int strcmp_underscore(const char *s1, const char *s2)
1235 if (s2[0] == '_' && s2[1] == '_') {
1236 size_t len2 = strlen(s2);
1237 size_t len1 = strlen(s1);
1238 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1239 return strncmp(s1, s2+2, len2-4);
1243 return strcmp(s1, s2);
1247 * Allocate a new gnu temporal attribute.
1249 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1251 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1252 attribute->kind = kind;
1253 attribute->next = NULL;
1254 attribute->invalid = false;
1255 attribute->have_arguments = false;
1261 * parse one constant expression argument.
1263 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1265 expression_t *expression;
1266 add_anchor_token(')');
1267 expression = parse_constant_expression();
1268 rem_anchor_token(')');
1270 attribute->u.argument = fold_constant(expression);
1273 attribute->invalid = true;
1277 * parse a list of constant expressions arguments.
1279 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1281 argument_list_t **list = &attribute->u.arguments;
1282 argument_list_t *entry;
1283 expression_t *expression;
1284 add_anchor_token(')');
1285 add_anchor_token(',');
1287 expression = parse_constant_expression();
1288 entry = obstack_alloc(&temp_obst, sizeof(entry));
1289 entry->argument = fold_constant(expression);
1292 list = &entry->next;
1293 if (token.type != ',')
1297 rem_anchor_token(',');
1298 rem_anchor_token(')');
1302 attribute->invalid = true;
1306 * parse one string literal argument.
1308 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1311 add_anchor_token('(');
1312 if (token.type != T_STRING_LITERAL) {
1313 parse_error_expected("while parsing attribute directive",
1314 T_STRING_LITERAL, NULL);
1317 *string = parse_string_literals();
1318 rem_anchor_token('(');
1322 attribute->invalid = true;
1326 * parse one tls model.
1328 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1330 static const char *const tls_models[] = {
1336 string_t string = { NULL, 0 };
1337 parse_gnu_attribute_string_arg(attribute, &string);
1338 if (string.begin != NULL) {
1339 for(size_t i = 0; i < 4; ++i) {
1340 if (strcmp(tls_models[i], string.begin) == 0) {
1341 attribute->u.value = i;
1345 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1347 attribute->invalid = true;
1351 * parse one tls model.
1353 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1355 static const char *const visibilities[] = {
1361 string_t string = { NULL, 0 };
1362 parse_gnu_attribute_string_arg(attribute, &string);
1363 if (string.begin != NULL) {
1364 for(size_t i = 0; i < 4; ++i) {
1365 if (strcmp(visibilities[i], string.begin) == 0) {
1366 attribute->u.value = i;
1370 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1372 attribute->invalid = true;
1376 * parse one (code) model.
1378 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1380 static const char *const visibilities[] = {
1385 string_t string = { NULL, 0 };
1386 parse_gnu_attribute_string_arg(attribute, &string);
1387 if (string.begin != NULL) {
1388 for(int i = 0; i < 3; ++i) {
1389 if (strcmp(visibilities[i], string.begin) == 0) {
1390 attribute->u.value = i;
1394 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1396 attribute->invalid = true;
1399 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1401 /* TODO: find out what is allowed here... */
1403 /* at least: byte, word, pointer, list of machine modes
1404 * __XXX___ is interpreted as XXX */
1405 add_anchor_token(')');
1407 if (token.type != T_IDENTIFIER) {
1408 expect(T_IDENTIFIER);
1411 /* This isn't really correct, the backend should provide a list of machine
1412 * specific modes (according to gcc philosophy that is...) */
1413 const char *symbol_str = token.v.symbol->string;
1414 if (strcmp_underscore("QI", symbol_str) == 0 ||
1415 strcmp_underscore("byte", symbol_str) == 0) {
1416 attribute->u.akind = ATOMIC_TYPE_CHAR;
1417 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1418 attribute->u.akind = ATOMIC_TYPE_SHORT;
1419 } else if (strcmp_underscore("SI", symbol_str) == 0
1420 || strcmp_underscore("word", symbol_str) == 0
1421 || strcmp_underscore("pointer", symbol_str) == 0) {
1422 attribute->u.akind = ATOMIC_TYPE_INT;
1423 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1424 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1426 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1427 attribute->invalid = true;
1431 rem_anchor_token(')');
1435 attribute->invalid = true;
1439 * parse one interrupt argument.
1441 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1443 static const char *const interrupts[] = {
1450 string_t string = { NULL, 0 };
1451 parse_gnu_attribute_string_arg(attribute, &string);
1452 if (string.begin != NULL) {
1453 for(size_t i = 0; i < 5; ++i) {
1454 if (strcmp(interrupts[i], string.begin) == 0) {
1455 attribute->u.value = i;
1459 errorf(HERE, "'%s' is not an interrupt", string.begin);
1461 attribute->invalid = true;
1465 * parse ( identifier, const expression, const expression )
1467 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1469 static const char *const format_names[] = {
1477 if (token.type != T_IDENTIFIER) {
1478 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1481 const char *name = token.v.symbol->string;
1482 for(i = 0; i < 4; ++i) {
1483 if (strcmp_underscore(format_names[i], name) == 0)
1487 if (warning.attribute)
1488 warningf(HERE, "'%s' is an unrecognized format function type", name);
1493 add_anchor_token(')');
1494 add_anchor_token(',');
1495 parse_constant_expression();
1496 rem_anchor_token(',');
1497 rem_anchor_token(')');
1500 add_anchor_token(')');
1501 parse_constant_expression();
1502 rem_anchor_token(')');
1506 attribute->u.value = true;
1509 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1511 if (!attribute->have_arguments)
1514 /* should have no arguments */
1515 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1516 eat_until_matching_token('(');
1517 /* we have already consumed '(', so we stop before ')', eat it */
1519 attribute->invalid = true;
1523 * Parse one GNU attribute.
1525 * Note that attribute names can be specified WITH or WITHOUT
1526 * double underscores, ie const or __const__.
1528 * The following attributes are parsed without arguments
1553 * no_instrument_function
1554 * warn_unused_result
1571 * externally_visible
1579 * The following attributes are parsed with arguments
1580 * aligned( const expression )
1581 * alias( string literal )
1582 * section( string literal )
1583 * format( identifier, const expression, const expression )
1584 * format_arg( const expression )
1585 * tls_model( string literal )
1586 * visibility( string literal )
1587 * regparm( const expression )
1588 * model( string leteral )
1589 * trap_exit( const expression )
1590 * sp_switch( string literal )
1592 * The following attributes might have arguments
1593 * weak_ref( string literal )
1594 * non_null( const expression // ',' )
1595 * interrupt( string literal )
1596 * sentinel( constant expression )
1598 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1600 gnu_attribute_t *head = *attributes;
1601 gnu_attribute_t *last = *attributes;
1602 decl_modifiers_t modifiers = 0;
1603 gnu_attribute_t *attribute;
1605 eat(T___attribute__);
1609 if (token.type != ')') {
1610 /* find the end of the list */
1612 while (last->next != NULL)
1616 /* non-empty attribute list */
1619 if (token.type == T_const) {
1621 } else if (token.type == T_volatile) {
1623 } else if (token.type == T_cdecl) {
1624 /* __attribute__((cdecl)), WITH ms mode */
1626 } else if (token.type == T_IDENTIFIER) {
1627 const symbol_t *sym = token.v.symbol;
1630 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1637 for(i = 0; i < GNU_AK_LAST; ++i) {
1638 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1641 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1644 if (kind == GNU_AK_LAST) {
1645 if (warning.attribute)
1646 warningf(HERE, "'%s' attribute directive ignored", name);
1648 /* skip possible arguments */
1649 if (token.type == '(') {
1650 eat_until_matching_token(')');
1653 /* check for arguments */
1654 attribute = allocate_gnu_attribute(kind);
1655 if (token.type == '(') {
1657 if (token.type == ')') {
1658 /* empty args are allowed */
1661 attribute->have_arguments = true;
1665 case GNU_AK_VOLATILE:
1670 case GNU_AK_NOCOMMON:
1672 case GNU_AK_NOTSHARED:
1673 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1674 case GNU_AK_WARN_UNUSED_RESULT:
1675 case GNU_AK_LONGCALL:
1676 case GNU_AK_SHORTCALL:
1677 case GNU_AK_LONG_CALL:
1678 case GNU_AK_SHORT_CALL:
1679 case GNU_AK_FUNCTION_VECTOR:
1680 case GNU_AK_INTERRUPT_HANDLER:
1681 case GNU_AK_NMI_HANDLER:
1682 case GNU_AK_NESTING:
1686 case GNU_AK_EIGTHBIT_DATA:
1687 case GNU_AK_TINY_DATA:
1688 case GNU_AK_SAVEALL:
1689 case GNU_AK_FLATTEN:
1690 case GNU_AK_SSEREGPARM:
1691 case GNU_AK_EXTERNALLY_VISIBLE:
1692 case GNU_AK_RETURN_TWICE:
1693 case GNU_AK_MAY_ALIAS:
1694 case GNU_AK_MS_STRUCT:
1695 case GNU_AK_GCC_STRUCT:
1698 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1699 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1700 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1701 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1702 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1703 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1704 case GNU_AK_CONST: modifiers |= DM_CONST; goto no_arg;
1705 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1706 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1707 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1708 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1709 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1710 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1711 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1712 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1713 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1714 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1715 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1717 case GNU_AK_ALIGNED:
1718 /* __align__ may be used without an argument */
1719 if (attribute->have_arguments) {
1720 parse_gnu_attribute_const_arg(attribute);
1724 case GNU_AK_FORMAT_ARG:
1725 case GNU_AK_REGPARM:
1726 case GNU_AK_TRAP_EXIT:
1727 if (!attribute->have_arguments) {
1728 /* should have arguments */
1729 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1730 attribute->invalid = true;
1732 parse_gnu_attribute_const_arg(attribute);
1735 case GNU_AK_SECTION:
1736 case GNU_AK_SP_SWITCH:
1737 if (!attribute->have_arguments) {
1738 /* should have arguments */
1739 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1740 attribute->invalid = true;
1742 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1745 if (!attribute->have_arguments) {
1746 /* should have arguments */
1747 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1748 attribute->invalid = true;
1750 parse_gnu_attribute_format_args(attribute);
1752 case GNU_AK_WEAKREF:
1753 /* may have one string argument */
1754 if (attribute->have_arguments)
1755 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1757 case GNU_AK_NONNULL:
1758 if (attribute->have_arguments)
1759 parse_gnu_attribute_const_arg_list(attribute);
1761 case GNU_AK_TLS_MODEL:
1762 if (!attribute->have_arguments) {
1763 /* should have arguments */
1764 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1766 parse_gnu_attribute_tls_model_arg(attribute);
1768 case GNU_AK_VISIBILITY:
1769 if (!attribute->have_arguments) {
1770 /* should have arguments */
1771 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1773 parse_gnu_attribute_visibility_arg(attribute);
1776 if (!attribute->have_arguments) {
1777 /* should have arguments */
1778 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1780 parse_gnu_attribute_model_arg(attribute);
1784 if (!attribute->have_arguments) {
1785 /* should have arguments */
1786 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1788 parse_gnu_attribute_mode_arg(attribute);
1791 case GNU_AK_INTERRUPT:
1792 /* may have one string argument */
1793 if (attribute->have_arguments)
1794 parse_gnu_attribute_interrupt_arg(attribute);
1796 case GNU_AK_SENTINEL:
1797 /* may have one string argument */
1798 if (attribute->have_arguments)
1799 parse_gnu_attribute_const_arg(attribute);
1802 /* already handled */
1806 check_no_argument(attribute, name);
1809 if (attribute != NULL) {
1811 last->next = attribute;
1814 head = last = attribute;
1818 if (token.type != ',')
1832 * Parse GNU attributes.
1834 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1836 decl_modifiers_t modifiers = 0;
1839 switch(token.type) {
1840 case T___attribute__:
1841 modifiers |= parse_gnu_attribute(attributes);
1847 if (token.type != T_STRING_LITERAL) {
1848 parse_error_expected("while parsing assembler attribute",
1849 T_STRING_LITERAL, NULL);
1850 eat_until_matching_token('(');
1853 parse_string_literals();
1858 case T_cdecl: modifiers |= DM_CDECL; break;
1859 case T__fastcall: modifiers |= DM_FASTCALL; break;
1860 case T__stdcall: modifiers |= DM_STDCALL; break;
1863 /* TODO record modifier */
1864 warningf(HERE, "Ignoring declaration modifier %K", &token);
1868 default: return modifiers;
1875 static designator_t *parse_designation(void)
1877 designator_t *result = NULL;
1878 designator_t *last = NULL;
1881 designator_t *designator;
1882 switch(token.type) {
1884 designator = allocate_ast_zero(sizeof(designator[0]));
1885 designator->source_position = token.source_position;
1887 add_anchor_token(']');
1888 designator->array_index = parse_constant_expression();
1889 rem_anchor_token(']');
1893 designator = allocate_ast_zero(sizeof(designator[0]));
1894 designator->source_position = token.source_position;
1896 if (token.type != T_IDENTIFIER) {
1897 parse_error_expected("while parsing designator",
1898 T_IDENTIFIER, NULL);
1901 designator->symbol = token.v.symbol;
1909 assert(designator != NULL);
1911 last->next = designator;
1913 result = designator;
1921 static initializer_t *initializer_from_string(array_type_t *type,
1922 const string_t *const string)
1924 /* TODO: check len vs. size of array type */
1927 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1928 initializer->string.string = *string;
1933 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1934 wide_string_t *const string)
1936 /* TODO: check len vs. size of array type */
1939 initializer_t *const initializer =
1940 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1941 initializer->wide_string.string = *string;
1947 * Build an initializer from a given expression.
1949 static initializer_t *initializer_from_expression(type_t *orig_type,
1950 expression_t *expression)
1952 /* TODO check that expression is a constant expression */
1954 /* § 6.7.8.14/15 char array may be initialized by string literals */
1955 type_t *type = skip_typeref(orig_type);
1956 type_t *expr_type_orig = expression->base.type;
1957 type_t *expr_type = skip_typeref(expr_type_orig);
1958 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1959 array_type_t *const array_type = &type->array;
1960 type_t *const element_type = skip_typeref(array_type->element_type);
1962 if (element_type->kind == TYPE_ATOMIC) {
1963 atomic_type_kind_t akind = element_type->atomic.akind;
1964 switch (expression->kind) {
1965 case EXPR_STRING_LITERAL:
1966 if (akind == ATOMIC_TYPE_CHAR
1967 || akind == ATOMIC_TYPE_SCHAR
1968 || akind == ATOMIC_TYPE_UCHAR) {
1969 return initializer_from_string(array_type,
1970 &expression->string.value);
1973 case EXPR_WIDE_STRING_LITERAL: {
1974 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1975 if (get_unqualified_type(element_type) == bare_wchar_type) {
1976 return initializer_from_wide_string(array_type,
1977 &expression->wide_string.value);
1987 assign_error_t error = semantic_assign(type, expression);
1988 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1990 report_assign_error(error, type, expression, "initializer",
1991 &expression->base.source_position);
1993 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1994 if (type->kind == TYPE_BITFIELD) {
1995 type = type->bitfield.base_type;
1997 result->value.value = create_implicit_cast(expression, type);
2003 * Checks if a given expression can be used as an constant initializer.
2005 static bool is_initializer_constant(const expression_t *expression)
2007 return is_constant_expression(expression)
2008 || is_address_constant(expression);
2012 * Parses an scalar initializer.
2014 * § 6.7.8.11; eat {} without warning
2016 static initializer_t *parse_scalar_initializer(type_t *type,
2017 bool must_be_constant)
2019 /* there might be extra {} hierarchies */
2021 if (token.type == '{') {
2022 warningf(HERE, "extra curly braces around scalar initializer");
2026 } while (token.type == '{');
2029 expression_t *expression = parse_assignment_expression();
2030 if (must_be_constant && !is_initializer_constant(expression)) {
2031 errorf(&expression->base.source_position,
2032 "Initialisation expression '%E' is not constant\n",
2036 initializer_t *initializer = initializer_from_expression(type, expression);
2038 if (initializer == NULL) {
2039 errorf(&expression->base.source_position,
2040 "expression '%E' (type '%T') doesn't match expected type '%T'",
2041 expression, expression->base.type, type);
2046 bool additional_warning_displayed = false;
2047 while (braces > 0) {
2048 if (token.type == ',') {
2051 if (token.type != '}') {
2052 if (!additional_warning_displayed) {
2053 warningf(HERE, "additional elements in scalar initializer");
2054 additional_warning_displayed = true;
2065 * An entry in the type path.
2067 typedef struct type_path_entry_t type_path_entry_t;
2068 struct type_path_entry_t {
2069 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2071 size_t index; /**< For array types: the current index. */
2072 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2077 * A type path expression a position inside compound or array types.
2079 typedef struct type_path_t type_path_t;
2080 struct type_path_t {
2081 type_path_entry_t *path; /**< An flexible array containing the current path. */
2082 type_t *top_type; /**< type of the element the path points */
2083 size_t max_index; /**< largest index in outermost array */
2087 * Prints a type path for debugging.
2089 static __attribute__((unused)) void debug_print_type_path(
2090 const type_path_t *path)
2092 size_t len = ARR_LEN(path->path);
2094 for(size_t i = 0; i < len; ++i) {
2095 const type_path_entry_t *entry = & path->path[i];
2097 type_t *type = skip_typeref(entry->type);
2098 if (is_type_compound(type)) {
2099 /* in gcc mode structs can have no members */
2100 if (entry->v.compound_entry == NULL) {
2104 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
2105 } else if (is_type_array(type)) {
2106 fprintf(stderr, "[%zu]", entry->v.index);
2108 fprintf(stderr, "-INVALID-");
2111 if (path->top_type != NULL) {
2112 fprintf(stderr, " (");
2113 print_type(path->top_type);
2114 fprintf(stderr, ")");
2119 * Return the top type path entry, ie. in a path
2120 * (type).a.b returns the b.
2122 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2124 size_t len = ARR_LEN(path->path);
2126 return &path->path[len-1];
2130 * Enlarge the type path by an (empty) element.
2132 static type_path_entry_t *append_to_type_path(type_path_t *path)
2134 size_t len = ARR_LEN(path->path);
2135 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2137 type_path_entry_t *result = & path->path[len];
2138 memset(result, 0, sizeof(result[0]));
2143 * Descending into a sub-type. Enter the scope of the current
2146 static void descend_into_subtype(type_path_t *path)
2148 type_t *orig_top_type = path->top_type;
2149 type_t *top_type = skip_typeref(orig_top_type);
2151 type_path_entry_t *top = append_to_type_path(path);
2152 top->type = top_type;
2154 if (is_type_compound(top_type)) {
2155 declaration_t *declaration = top_type->compound.declaration;
2156 declaration_t *entry = declaration->scope.declarations;
2157 top->v.compound_entry = entry;
2159 if (entry != NULL) {
2160 path->top_type = entry->type;
2162 path->top_type = NULL;
2164 } else if (is_type_array(top_type)) {
2166 path->top_type = top_type->array.element_type;
2168 assert(!is_type_valid(top_type));
2173 * Pop an entry from the given type path, ie. returning from
2174 * (type).a.b to (type).a
2176 static void ascend_from_subtype(type_path_t *path)
2178 type_path_entry_t *top = get_type_path_top(path);
2180 path->top_type = top->type;
2182 size_t len = ARR_LEN(path->path);
2183 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2187 * Pop entries from the given type path until the given
2188 * path level is reached.
2190 static void ascend_to(type_path_t *path, size_t top_path_level)
2192 size_t len = ARR_LEN(path->path);
2194 while (len > top_path_level) {
2195 ascend_from_subtype(path);
2196 len = ARR_LEN(path->path);
2200 static bool walk_designator(type_path_t *path, const designator_t *designator,
2201 bool used_in_offsetof)
2203 for( ; designator != NULL; designator = designator->next) {
2204 type_path_entry_t *top = get_type_path_top(path);
2205 type_t *orig_type = top->type;
2207 type_t *type = skip_typeref(orig_type);
2209 if (designator->symbol != NULL) {
2210 symbol_t *symbol = designator->symbol;
2211 if (!is_type_compound(type)) {
2212 if (is_type_valid(type)) {
2213 errorf(&designator->source_position,
2214 "'.%Y' designator used for non-compound type '%T'",
2218 top->type = type_error_type;
2219 top->v.compound_entry = NULL;
2220 orig_type = type_error_type;
2222 declaration_t *declaration = type->compound.declaration;
2223 declaration_t *iter = declaration->scope.declarations;
2224 for( ; iter != NULL; iter = iter->next) {
2225 if (iter->symbol == symbol) {
2230 errorf(&designator->source_position,
2231 "'%T' has no member named '%Y'", orig_type, symbol);
2234 if (used_in_offsetof) {
2235 type_t *real_type = skip_typeref(iter->type);
2236 if (real_type->kind == TYPE_BITFIELD) {
2237 errorf(&designator->source_position,
2238 "offsetof designator '%Y' may not specify bitfield",
2244 top->type = orig_type;
2245 top->v.compound_entry = iter;
2246 orig_type = iter->type;
2249 expression_t *array_index = designator->array_index;
2250 assert(designator->array_index != NULL);
2252 if (!is_type_array(type)) {
2253 if (is_type_valid(type)) {
2254 errorf(&designator->source_position,
2255 "[%E] designator used for non-array type '%T'",
2256 array_index, orig_type);
2261 long index = fold_constant(array_index);
2262 if (!used_in_offsetof) {
2264 errorf(&designator->source_position,
2265 "array index [%E] must be positive", array_index);
2266 } else if (type->array.size_constant) {
2267 long array_size = type->array.size;
2268 if (index >= array_size) {
2269 errorf(&designator->source_position,
2270 "designator [%E] (%d) exceeds array size %d",
2271 array_index, index, array_size);
2276 top->type = orig_type;
2277 top->v.index = (size_t) index;
2278 orig_type = type->array.element_type;
2280 path->top_type = orig_type;
2282 if (designator->next != NULL) {
2283 descend_into_subtype(path);
2292 static void advance_current_object(type_path_t *path, size_t top_path_level)
2294 type_path_entry_t *top = get_type_path_top(path);
2296 type_t *type = skip_typeref(top->type);
2297 if (is_type_union(type)) {
2298 /* in unions only the first element is initialized */
2299 top->v.compound_entry = NULL;
2300 } else if (is_type_struct(type)) {
2301 declaration_t *entry = top->v.compound_entry;
2303 entry = entry->next;
2304 top->v.compound_entry = entry;
2305 if (entry != NULL) {
2306 path->top_type = entry->type;
2309 } else if (is_type_array(type)) {
2310 assert(is_type_array(type));
2314 if (!type->array.size_constant || top->v.index < type->array.size) {
2318 assert(!is_type_valid(type));
2322 /* we're past the last member of the current sub-aggregate, try if we
2323 * can ascend in the type hierarchy and continue with another subobject */
2324 size_t len = ARR_LEN(path->path);
2326 if (len > top_path_level) {
2327 ascend_from_subtype(path);
2328 advance_current_object(path, top_path_level);
2330 path->top_type = NULL;
2335 * skip until token is found.
2337 static void skip_until(int type)
2339 while (token.type != type) {
2340 if (token.type == T_EOF)
2347 * skip any {...} blocks until a closing bracket is reached.
2349 static void skip_initializers(void)
2351 if (token.type == '{')
2354 while (token.type != '}') {
2355 if (token.type == T_EOF)
2357 if (token.type == '{') {
2365 static initializer_t *create_empty_initializer(void)
2367 static initializer_t empty_initializer
2368 = { .list = { { INITIALIZER_LIST }, 0 } };
2369 return &empty_initializer;
2373 * Parse a part of an initialiser for a struct or union,
2375 static initializer_t *parse_sub_initializer(type_path_t *path,
2376 type_t *outer_type, size_t top_path_level,
2377 parse_initializer_env_t *env)
2379 if (token.type == '}') {
2380 /* empty initializer */
2381 return create_empty_initializer();
2384 type_t *orig_type = path->top_type;
2385 type_t *type = NULL;
2387 if (orig_type == NULL) {
2388 /* We are initializing an empty compound. */
2390 type = skip_typeref(orig_type);
2393 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2396 designator_t *designator = NULL;
2397 if (token.type == '.' || token.type == '[') {
2398 designator = parse_designation();
2399 goto finish_designator;
2400 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2401 /* GNU-style designator ("identifier: value") */
2402 designator = allocate_ast_zero(sizeof(designator[0]));
2403 designator->source_position = token.source_position;
2404 designator->symbol = token.v.symbol;
2409 /* reset path to toplevel, evaluate designator from there */
2410 ascend_to(path, top_path_level);
2411 if (!walk_designator(path, designator, false)) {
2412 /* can't continue after designation error */
2416 initializer_t *designator_initializer
2417 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2418 designator_initializer->designator.designator = designator;
2419 ARR_APP1(initializer_t*, initializers, designator_initializer);
2421 orig_type = path->top_type;
2422 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2427 if (token.type == '{') {
2428 if (type != NULL && is_type_scalar(type)) {
2429 sub = parse_scalar_initializer(type, env->must_be_constant);
2433 if (env->declaration != NULL) {
2434 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2435 env->declaration->symbol);
2437 errorf(HERE, "extra brace group at end of initializer");
2440 descend_into_subtype(path);
2442 add_anchor_token('}');
2443 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2445 rem_anchor_token('}');
2448 ascend_from_subtype(path);
2452 goto error_parse_next;
2456 /* must be an expression */
2457 expression_t *expression = parse_assignment_expression();
2459 if (env->must_be_constant && !is_initializer_constant(expression)) {
2460 errorf(&expression->base.source_position,
2461 "Initialisation expression '%E' is not constant\n",
2466 /* we are already outside, ... */
2467 type_t *const outer_type_skip = skip_typeref(outer_type);
2468 if (is_type_compound(outer_type_skip) &&
2469 !outer_type_skip->compound.declaration->init.complete) {
2470 goto error_parse_next;
2475 /* handle { "string" } special case */
2476 if ((expression->kind == EXPR_STRING_LITERAL
2477 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2478 && outer_type != NULL) {
2479 sub = initializer_from_expression(outer_type, expression);
2481 if (token.type == ',') {
2484 if (token.type != '}') {
2485 warningf(HERE, "excessive elements in initializer for type '%T'",
2488 /* TODO: eat , ... */
2493 /* descend into subtypes until expression matches type */
2495 orig_type = path->top_type;
2496 type = skip_typeref(orig_type);
2498 sub = initializer_from_expression(orig_type, expression);
2502 if (!is_type_valid(type)) {
2505 if (is_type_scalar(type)) {
2506 errorf(&expression->base.source_position,
2507 "expression '%E' doesn't match expected type '%T'",
2508 expression, orig_type);
2512 descend_into_subtype(path);
2516 /* update largest index of top array */
2517 const type_path_entry_t *first = &path->path[0];
2518 type_t *first_type = first->type;
2519 first_type = skip_typeref(first_type);
2520 if (is_type_array(first_type)) {
2521 size_t index = first->v.index;
2522 if (index > path->max_index)
2523 path->max_index = index;
2527 /* append to initializers list */
2528 ARR_APP1(initializer_t*, initializers, sub);
2531 if (env->declaration != NULL)
2532 warningf(HERE, "excess elements in struct initializer for '%Y'",
2533 env->declaration->symbol);
2535 warningf(HERE, "excess elements in struct initializer");
2539 if (token.type == '}') {
2543 if (token.type == '}') {
2548 /* advance to the next declaration if we are not at the end */
2549 advance_current_object(path, top_path_level);
2550 orig_type = path->top_type;
2551 if (orig_type != NULL)
2552 type = skip_typeref(orig_type);
2558 size_t len = ARR_LEN(initializers);
2559 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2560 initializer_t *result = allocate_ast_zero(size);
2561 result->kind = INITIALIZER_LIST;
2562 result->list.len = len;
2563 memcpy(&result->list.initializers, initializers,
2564 len * sizeof(initializers[0]));
2566 DEL_ARR_F(initializers);
2567 ascend_to(path, top_path_level+1);
2572 skip_initializers();
2573 DEL_ARR_F(initializers);
2574 ascend_to(path, top_path_level+1);
2579 * Parses an initializer. Parsers either a compound literal
2580 * (env->declaration == NULL) or an initializer of a declaration.
2582 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2584 type_t *type = skip_typeref(env->type);
2585 initializer_t *result = NULL;
2588 if (is_type_scalar(type)) {
2589 result = parse_scalar_initializer(type, env->must_be_constant);
2590 } else if (token.type == '{') {
2594 memset(&path, 0, sizeof(path));
2595 path.top_type = env->type;
2596 path.path = NEW_ARR_F(type_path_entry_t, 0);
2598 descend_into_subtype(&path);
2600 add_anchor_token('}');
2601 result = parse_sub_initializer(&path, env->type, 1, env);
2602 rem_anchor_token('}');
2604 max_index = path.max_index;
2605 DEL_ARR_F(path.path);
2609 /* parse_scalar_initializer() also works in this case: we simply
2610 * have an expression without {} around it */
2611 result = parse_scalar_initializer(type, env->must_be_constant);
2614 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2615 * the array type size */
2616 if (is_type_array(type) && type->array.size_expression == NULL
2617 && result != NULL) {
2619 switch (result->kind) {
2620 case INITIALIZER_LIST:
2621 size = max_index + 1;
2624 case INITIALIZER_STRING:
2625 size = result->string.string.size;
2628 case INITIALIZER_WIDE_STRING:
2629 size = result->wide_string.string.size;
2632 case INITIALIZER_DESIGNATOR:
2633 case INITIALIZER_VALUE:
2634 /* can happen for parse errors */
2639 internal_errorf(HERE, "invalid initializer type");
2642 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2643 cnst->base.type = type_size_t;
2644 cnst->conste.v.int_value = size;
2646 type_t *new_type = duplicate_type(type);
2648 new_type->array.size_expression = cnst;
2649 new_type->array.size_constant = true;
2650 new_type->array.size = size;
2651 env->type = new_type;
2659 static declaration_t *append_declaration(declaration_t *declaration);
2661 static declaration_t *parse_compound_type_specifier(bool is_struct)
2663 gnu_attribute_t *attributes = NULL;
2664 decl_modifiers_t modifiers = 0;
2671 symbol_t *symbol = NULL;
2672 declaration_t *declaration = NULL;
2674 if (token.type == T___attribute__) {
2675 modifiers |= parse_attributes(&attributes);
2678 if (token.type == T_IDENTIFIER) {
2679 symbol = token.v.symbol;
2682 namespace_t const namespc =
2683 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2684 declaration = get_declaration(symbol, namespc);
2685 if (declaration != NULL) {
2686 if (declaration->parent_scope != scope &&
2687 (token.type == '{' || token.type == ';')) {
2689 } else if (declaration->init.complete &&
2690 token.type == '{') {
2691 assert(symbol != NULL);
2692 errorf(HERE, "multiple definitions of '%s %Y' (previous definition at %P)",
2693 is_struct ? "struct" : "union", symbol,
2694 &declaration->source_position);
2695 declaration->scope.declarations = NULL;
2698 } else if (token.type != '{') {
2700 parse_error_expected("while parsing struct type specifier",
2701 T_IDENTIFIER, '{', NULL);
2703 parse_error_expected("while parsing union type specifier",
2704 T_IDENTIFIER, '{', NULL);
2710 if (declaration == NULL) {
2711 declaration = allocate_declaration_zero();
2712 declaration->namespc =
2713 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2714 declaration->source_position = token.source_position;
2715 declaration->symbol = symbol;
2716 declaration->parent_scope = scope;
2717 if (symbol != NULL) {
2718 environment_push(declaration);
2720 append_declaration(declaration);
2723 if (token.type == '{') {
2724 declaration->init.complete = true;
2726 parse_compound_type_entries(declaration);
2727 modifiers |= parse_attributes(&attributes);
2730 declaration->modifiers |= modifiers;
2734 static void parse_enum_entries(type_t *const enum_type)
2738 if (token.type == '}') {
2740 errorf(HERE, "empty enum not allowed");
2744 add_anchor_token('}');
2746 if (token.type != T_IDENTIFIER) {
2747 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2749 rem_anchor_token('}');
2753 declaration_t *const entry = allocate_declaration_zero();
2754 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
2755 entry->type = enum_type;
2756 entry->symbol = token.v.symbol;
2757 entry->source_position = token.source_position;
2760 if (token.type == '=') {
2762 expression_t *value = parse_constant_expression();
2764 value = create_implicit_cast(value, enum_type);
2765 entry->init.enum_value = value;
2770 record_declaration(entry, false);
2772 if (token.type != ',')
2775 } while (token.type != '}');
2776 rem_anchor_token('}');
2784 static type_t *parse_enum_specifier(void)
2786 gnu_attribute_t *attributes = NULL;
2787 declaration_t *declaration;
2791 if (token.type == T_IDENTIFIER) {
2792 symbol = token.v.symbol;
2795 declaration = get_declaration(symbol, NAMESPACE_ENUM);
2796 } else if (token.type != '{') {
2797 parse_error_expected("while parsing enum type specifier",
2798 T_IDENTIFIER, '{', NULL);
2805 if (declaration == NULL) {
2806 declaration = allocate_declaration_zero();
2807 declaration->namespc = NAMESPACE_ENUM;
2808 declaration->source_position = token.source_position;
2809 declaration->symbol = symbol;
2810 declaration->parent_scope = scope;
2813 type_t *const type = allocate_type_zero(TYPE_ENUM, &declaration->source_position);
2814 type->enumt.declaration = declaration;
2816 if (token.type == '{') {
2817 if (declaration->init.complete) {
2818 errorf(HERE, "multiple definitions of enum %Y", symbol);
2820 if (symbol != NULL) {
2821 environment_push(declaration);
2823 append_declaration(declaration);
2824 declaration->init.complete = true;
2826 parse_enum_entries(type);
2827 parse_attributes(&attributes);
2834 * if a symbol is a typedef to another type, return true
2836 static bool is_typedef_symbol(symbol_t *symbol)
2838 const declaration_t *const declaration =
2839 get_declaration(symbol, NAMESPACE_NORMAL);
2841 declaration != NULL &&
2842 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
2845 static type_t *parse_typeof(void)
2852 add_anchor_token(')');
2854 expression_t *expression = NULL;
2856 bool old_type_prop = in_type_prop;
2857 bool old_gcc_extension = in_gcc_extension;
2858 in_type_prop = true;
2860 while (token.type == T___extension__) {
2861 /* This can be a prefix to a typename or an expression. */
2863 in_gcc_extension = true;
2865 switch (token.type) {
2867 if (is_typedef_symbol(token.v.symbol)) {
2868 type = parse_typename();
2870 expression = parse_expression();
2871 type = expression->base.type;
2876 type = parse_typename();
2880 expression = parse_expression();
2881 type = expression->base.type;
2884 in_type_prop = old_type_prop;
2885 in_gcc_extension = old_gcc_extension;
2887 rem_anchor_token(')');
2890 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, &expression->base.source_position);
2891 typeof_type->typeoft.expression = expression;
2892 typeof_type->typeoft.typeof_type = type;
2899 typedef enum specifiers_t {
2900 SPECIFIER_SIGNED = 1 << 0,
2901 SPECIFIER_UNSIGNED = 1 << 1,
2902 SPECIFIER_LONG = 1 << 2,
2903 SPECIFIER_INT = 1 << 3,
2904 SPECIFIER_DOUBLE = 1 << 4,
2905 SPECIFIER_CHAR = 1 << 5,
2906 SPECIFIER_SHORT = 1 << 6,
2907 SPECIFIER_LONG_LONG = 1 << 7,
2908 SPECIFIER_FLOAT = 1 << 8,
2909 SPECIFIER_BOOL = 1 << 9,
2910 SPECIFIER_VOID = 1 << 10,
2911 SPECIFIER_INT8 = 1 << 11,
2912 SPECIFIER_INT16 = 1 << 12,
2913 SPECIFIER_INT32 = 1 << 13,
2914 SPECIFIER_INT64 = 1 << 14,
2915 SPECIFIER_INT128 = 1 << 15,
2916 SPECIFIER_COMPLEX = 1 << 16,
2917 SPECIFIER_IMAGINARY = 1 << 17,
2920 static type_t *create_builtin_type(symbol_t *const symbol,
2921 type_t *const real_type)
2923 type_t *type = allocate_type_zero(TYPE_BUILTIN, &builtin_source_position);
2924 type->builtin.symbol = symbol;
2925 type->builtin.real_type = real_type;
2927 type_t *result = typehash_insert(type);
2928 if (type != result) {
2935 static type_t *get_typedef_type(symbol_t *symbol)
2937 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
2938 if (declaration == NULL ||
2939 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
2942 type_t *type = allocate_type_zero(TYPE_TYPEDEF, &declaration->source_position);
2943 type->typedeft.declaration = declaration;
2949 * check for the allowed MS alignment values.
2951 static bool check_alignment_value(long long intvalue)
2953 if (intvalue < 1 || intvalue > 8192) {
2954 errorf(HERE, "illegal alignment value");
2957 unsigned v = (unsigned)intvalue;
2958 for (unsigned i = 1; i <= 8192; i += i) {
2962 errorf(HERE, "alignment must be power of two");
2966 #define DET_MOD(name, tag) do { \
2967 if (*modifiers & tag) warningf(HERE, #name " used more than once"); \
2968 *modifiers |= tag; \
2971 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
2973 decl_modifiers_t *modifiers = &specifiers->modifiers;
2976 if (token.type == T_restrict) {
2978 DET_MOD(restrict, DM_RESTRICT);
2980 } else if (token.type != T_IDENTIFIER)
2982 symbol_t *symbol = token.v.symbol;
2983 if (symbol == sym_align) {
2986 if (token.type != T_INTEGER)
2988 if (check_alignment_value(token.v.intvalue)) {
2989 if (specifiers->alignment != 0)
2990 warningf(HERE, "align used more than once");
2991 specifiers->alignment = (unsigned char)token.v.intvalue;
2995 } else if (symbol == sym_allocate) {
2998 if (token.type != T_IDENTIFIER)
3000 (void)token.v.symbol;
3002 } else if (symbol == sym_dllimport) {
3004 DET_MOD(dllimport, DM_DLLIMPORT);
3005 } else if (symbol == sym_dllexport) {
3007 DET_MOD(dllexport, DM_DLLEXPORT);
3008 } else if (symbol == sym_thread) {
3010 DET_MOD(thread, DM_THREAD);
3011 } else if (symbol == sym_naked) {
3013 DET_MOD(naked, DM_NAKED);
3014 } else if (symbol == sym_noinline) {
3016 DET_MOD(noinline, DM_NOINLINE);
3017 } else if (symbol == sym_noreturn) {
3019 DET_MOD(noreturn, DM_NORETURN);
3020 } else if (symbol == sym_nothrow) {
3022 DET_MOD(nothrow, DM_NOTHROW);
3023 } else if (symbol == sym_novtable) {
3025 DET_MOD(novtable, DM_NOVTABLE);
3026 } else if (symbol == sym_property) {
3030 bool is_get = false;
3031 if (token.type != T_IDENTIFIER)
3033 if (token.v.symbol == sym_get) {
3035 } else if (token.v.symbol == sym_put) {
3037 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3042 if (token.type != T_IDENTIFIER)
3045 if (specifiers->get_property_sym != NULL) {
3046 errorf(HERE, "get property name already specified");
3048 specifiers->get_property_sym = token.v.symbol;
3051 if (specifiers->put_property_sym != NULL) {
3052 errorf(HERE, "put property name already specified");
3054 specifiers->put_property_sym = token.v.symbol;
3058 if (token.type == ',') {
3065 } else if (symbol == sym_selectany) {
3067 DET_MOD(selectany, DM_SELECTANY);
3068 } else if (symbol == sym_uuid) {
3071 if (token.type != T_STRING_LITERAL)
3075 } else if (symbol == sym_deprecated) {
3077 if (specifiers->deprecated != 0)
3078 warningf(HERE, "deprecated used more than once");
3079 specifiers->deprecated = 1;
3080 if (token.type == '(') {
3082 if (token.type == T_STRING_LITERAL) {
3083 specifiers->deprecated_string = token.v.string.begin;
3086 errorf(HERE, "string literal expected");
3090 } else if (symbol == sym_noalias) {
3092 DET_MOD(noalias, DM_NOALIAS);
3094 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
3096 if (token.type == '(')
3100 if (token.type == ',')
3107 static declaration_t *create_error_declaration(symbol_t *symbol, storage_class_tag_t storage_class)
3109 declaration_t *const decl = allocate_declaration_zero();
3110 decl->source_position = *HERE;
3111 decl->declared_storage_class = storage_class;
3112 decl->storage_class =
3113 storage_class != STORAGE_CLASS_NONE || scope == file_scope ?
3114 storage_class : STORAGE_CLASS_AUTO;
3115 decl->symbol = symbol;
3116 decl->implicit = true;
3117 record_declaration(decl, false);
3122 * Finish the construction of a struct type by calculating
3123 * its size, offsets, alignment.
3125 static void finish_struct_type(compound_type_t *type) {
3126 if (type->declaration == NULL)
3128 declaration_t *struct_decl = type->declaration;
3129 if (! struct_decl->init.complete)
3134 il_alignment_t alignment = 1;
3135 bool need_pad = false;
3137 declaration_t *entry = struct_decl->scope.declarations;
3138 for (; entry != NULL; entry = entry->next) {
3139 if (entry->namespc != NAMESPACE_NORMAL)
3142 type_t *m_type = skip_typeref(entry->type);
3143 if (! is_type_valid(m_type)) {
3144 /* simply ignore errors here */
3147 il_alignment_t m_alignment = m_type->base.alignment;
3148 if (m_alignment > alignment)
3149 alignment = m_alignment;
3151 offset = (size + m_alignment - 1) & -m_alignment;
3155 entry->offset = offset;
3156 size = offset + m_type->base.size;
3158 if (type->base.alignment != 0) {
3159 alignment = type->base.alignment;
3162 offset = (size + alignment - 1) & -alignment;
3166 if (warning.padded && need_pad) {
3167 warningf(&struct_decl->source_position,
3168 "'%#T' needs padding", type, struct_decl->symbol);
3170 if (warning.packed && !need_pad) {
3171 warningf(&struct_decl->source_position,
3172 "superfluous packed attribute on '%#T'",
3173 type, struct_decl->symbol);
3176 type->base.size = offset;
3177 type->base.alignment = alignment;
3181 * Finish the construction of an union type by calculating
3182 * its size and alignment.
3184 static void finish_union_type(compound_type_t *type) {
3185 if (type->declaration == NULL)
3187 declaration_t *union_decl = type->declaration;
3188 if (! union_decl->init.complete)
3192 il_alignment_t alignment = 1;
3194 declaration_t *entry = union_decl->scope.declarations;
3195 for (; entry != NULL; entry = entry->next) {
3196 if (entry->namespc != NAMESPACE_NORMAL)
3199 type_t *m_type = skip_typeref(entry->type);
3200 if (! is_type_valid(m_type))
3204 if (m_type->base.size > size)
3205 size = m_type->base.size;
3206 if (m_type->base.alignment > alignment)
3207 alignment = m_type->base.alignment;
3209 if (type->base.alignment != 0) {
3210 alignment = type->base.alignment;
3212 size = (size + alignment - 1) & -alignment;
3213 type->base.size = size;
3214 type->base.alignment = alignment;
3217 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3219 type_t *type = NULL;
3220 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3221 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3222 unsigned type_specifiers = 0;
3223 bool newtype = false;
3224 bool saw_error = false;
3225 bool old_gcc_extension = in_gcc_extension;
3227 specifiers->source_position = token.source_position;
3230 specifiers->modifiers
3231 |= parse_attributes(&specifiers->gnu_attributes);
3232 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3233 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3235 switch (token.type) {
3238 #define MATCH_STORAGE_CLASS(token, class) \
3240 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
3241 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3243 specifiers->declared_storage_class = class; \
3247 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3248 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3249 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3250 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3251 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3256 add_anchor_token(')');
3257 parse_microsoft_extended_decl_modifier(specifiers);
3258 rem_anchor_token(')');
3263 switch (specifiers->declared_storage_class) {
3264 case STORAGE_CLASS_NONE:
3265 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
3268 case STORAGE_CLASS_EXTERN:
3269 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
3272 case STORAGE_CLASS_STATIC:
3273 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
3277 errorf(HERE, "multiple storage classes in declaration specifiers");
3283 /* type qualifiers */
3284 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3286 qualifiers |= qualifier; \
3290 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3291 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3292 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3293 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3294 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3295 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3296 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3297 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3299 case T___extension__:
3301 in_gcc_extension = true;
3304 /* type specifiers */
3305 #define MATCH_SPECIFIER(token, specifier, name) \
3308 if (type_specifiers & specifier) { \
3309 errorf(HERE, "multiple " name " type specifiers given"); \
3311 type_specifiers |= specifier; \
3315 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3316 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3317 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3318 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3319 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3320 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3321 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3322 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3323 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3324 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3325 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3326 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3327 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3328 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3329 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3330 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3332 case T__forceinline:
3333 /* only in microsoft mode */
3334 specifiers->modifiers |= DM_FORCEINLINE;
3339 specifiers->is_inline = true;
3344 if (type_specifiers & SPECIFIER_LONG_LONG) {
3345 errorf(HERE, "multiple type specifiers given");
3346 } else if (type_specifiers & SPECIFIER_LONG) {
3347 type_specifiers |= SPECIFIER_LONG_LONG;
3349 type_specifiers |= SPECIFIER_LONG;
3354 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
3356 type->compound.declaration = parse_compound_type_specifier(true);
3357 finish_struct_type(&type->compound);
3361 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
3362 type->compound.declaration = parse_compound_type_specifier(false);
3363 if (type->compound.declaration->modifiers & DM_TRANSPARENT_UNION)
3364 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3365 finish_union_type(&type->compound);
3369 type = parse_enum_specifier();
3372 type = parse_typeof();
3374 case T___builtin_va_list:
3375 type = duplicate_type(type_valist);
3379 case T_IDENTIFIER: {
3380 /* only parse identifier if we haven't found a type yet */
3381 if (type != NULL || type_specifiers != 0) {
3382 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3383 * declaration, so it doesn't generate errors about expecting '(' or
3385 switch (look_ahead(1)->type) {
3392 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3395 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3400 goto finish_specifiers;
3404 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3405 if (typedef_type == NULL) {
3406 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3407 * declaration, so it doesn't generate 'implicit int' followed by more
3408 * errors later on. */
3409 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3414 errorf(HERE, "%K does not name a type", &token);
3416 declaration_t *const decl =
3417 create_error_declaration(token.v.symbol, STORAGE_CLASS_TYPEDEF);
3419 type = allocate_type_zero(TYPE_TYPEDEF, HERE);
3420 type->typedeft.declaration = decl;
3424 if (la1_type == '*')
3425 goto finish_specifiers;
3430 goto finish_specifiers;
3435 type = typedef_type;
3439 /* function specifier */
3441 goto finish_specifiers;
3446 in_gcc_extension = old_gcc_extension;
3448 if (type == NULL || (saw_error && type_specifiers != 0)) {
3449 atomic_type_kind_t atomic_type;
3451 /* match valid basic types */
3452 switch(type_specifiers) {
3453 case SPECIFIER_VOID:
3454 atomic_type = ATOMIC_TYPE_VOID;
3456 case SPECIFIER_CHAR:
3457 atomic_type = ATOMIC_TYPE_CHAR;
3459 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3460 atomic_type = ATOMIC_TYPE_SCHAR;
3462 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3463 atomic_type = ATOMIC_TYPE_UCHAR;
3465 case SPECIFIER_SHORT:
3466 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3467 case SPECIFIER_SHORT | SPECIFIER_INT:
3468 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3469 atomic_type = ATOMIC_TYPE_SHORT;
3471 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3472 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3473 atomic_type = ATOMIC_TYPE_USHORT;
3476 case SPECIFIER_SIGNED:
3477 case SPECIFIER_SIGNED | SPECIFIER_INT:
3478 atomic_type = ATOMIC_TYPE_INT;
3480 case SPECIFIER_UNSIGNED:
3481 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3482 atomic_type = ATOMIC_TYPE_UINT;
3484 case SPECIFIER_LONG:
3485 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3486 case SPECIFIER_LONG | SPECIFIER_INT:
3487 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3488 atomic_type = ATOMIC_TYPE_LONG;
3490 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3491 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3492 atomic_type = ATOMIC_TYPE_ULONG;
3495 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3496 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3497 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3498 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3500 atomic_type = ATOMIC_TYPE_LONGLONG;
3501 goto warn_about_long_long;
3503 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3504 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3506 atomic_type = ATOMIC_TYPE_ULONGLONG;
3507 warn_about_long_long:
3508 if (warning.long_long) {
3509 warningf(&specifiers->source_position,
3510 "ISO C90 does not support 'long long'");
3514 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3515 atomic_type = unsigned_int8_type_kind;
3518 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3519 atomic_type = unsigned_int16_type_kind;
3522 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3523 atomic_type = unsigned_int32_type_kind;
3526 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3527 atomic_type = unsigned_int64_type_kind;
3530 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3531 atomic_type = unsigned_int128_type_kind;
3534 case SPECIFIER_INT8:
3535 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3536 atomic_type = int8_type_kind;
3539 case SPECIFIER_INT16:
3540 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3541 atomic_type = int16_type_kind;
3544 case SPECIFIER_INT32:
3545 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3546 atomic_type = int32_type_kind;
3549 case SPECIFIER_INT64:
3550 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3551 atomic_type = int64_type_kind;
3554 case SPECIFIER_INT128:
3555 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3556 atomic_type = int128_type_kind;
3559 case SPECIFIER_FLOAT:
3560 atomic_type = ATOMIC_TYPE_FLOAT;
3562 case SPECIFIER_DOUBLE:
3563 atomic_type = ATOMIC_TYPE_DOUBLE;
3565 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3566 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3568 case SPECIFIER_BOOL:
3569 atomic_type = ATOMIC_TYPE_BOOL;
3571 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3572 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3573 atomic_type = ATOMIC_TYPE_FLOAT;
3575 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3576 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3577 atomic_type = ATOMIC_TYPE_DOUBLE;
3579 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3580 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3581 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3584 /* invalid specifier combination, give an error message */
3585 if (type_specifiers == 0) {
3590 if (warning.implicit_int) {
3591 warningf(HERE, "no type specifiers in declaration, using 'int'");
3593 atomic_type = ATOMIC_TYPE_INT;
3596 errorf(HERE, "no type specifiers given in declaration");
3598 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3599 (type_specifiers & SPECIFIER_UNSIGNED)) {
3600 errorf(HERE, "signed and unsigned specifiers given");
3601 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3602 errorf(HERE, "only integer types can be signed or unsigned");
3604 errorf(HERE, "multiple datatypes in declaration");
3609 if (type_specifiers & SPECIFIER_COMPLEX) {
3610 type = allocate_type_zero(TYPE_COMPLEX, &builtin_source_position);
3611 type->complex.akind = atomic_type;
3612 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3613 type = allocate_type_zero(TYPE_IMAGINARY, &builtin_source_position);
3614 type->imaginary.akind = atomic_type;
3616 type = allocate_type_zero(TYPE_ATOMIC, &builtin_source_position);
3617 type->atomic.akind = atomic_type;
3620 } else if (type_specifiers != 0) {
3621 errorf(HERE, "multiple datatypes in declaration");
3624 /* FIXME: check type qualifiers here */
3626 type->base.qualifiers = qualifiers;
3627 type->base.modifiers = modifiers;
3629 type_t *result = typehash_insert(type);
3630 if (newtype && result != type) {
3634 specifiers->type = result;
3638 specifiers->type = type_error_type;
3642 static type_qualifiers_t parse_type_qualifiers(void)
3644 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3647 switch(token.type) {
3648 /* type qualifiers */
3649 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3650 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3651 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3652 /* microsoft extended type modifiers */
3653 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3654 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3655 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3656 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3657 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3666 * Parses an K&R identifier list and return a list of declarations.
3668 * @param last points to the last declaration in the list
3669 * @return the list of declarations
3671 static declaration_t *parse_identifier_list(declaration_t **last)
3673 declaration_t *declarations = NULL;
3674 declaration_t *last_declaration = NULL;
3676 declaration_t *const declaration = allocate_declaration_zero();
3677 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3678 declaration->source_position = token.source_position;
3679 declaration->symbol = token.v.symbol;
3682 if (last_declaration != NULL) {
3683 last_declaration->next = declaration;
3685 declarations = declaration;
3687 last_declaration = declaration;
3689 if (token.type != ',') {
3693 } while (token.type == T_IDENTIFIER);
3695 *last = last_declaration;
3696 return declarations;
3699 static type_t *automatic_type_conversion(type_t *orig_type);
3701 static void semantic_parameter(declaration_t *declaration)
3703 /* TODO: improve error messages */
3704 source_position_t const* const pos = &declaration->source_position;
3706 switch (declaration->declared_storage_class) {
3707 case STORAGE_CLASS_TYPEDEF:
3708 errorf(pos, "typedef not allowed in parameter list");
3711 /* Allowed storage classes */
3712 case STORAGE_CLASS_NONE:
3713 case STORAGE_CLASS_REGISTER:
3717 errorf(pos, "parameter may only have none or register storage class");
3721 type_t *const orig_type = declaration->type;
3722 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
3723 * sugar. Turn it into a pointer.
3724 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
3725 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
3727 type_t *const type = automatic_type_conversion(orig_type);
3728 declaration->type = type;
3730 if (is_type_incomplete(skip_typeref(type))) {
3731 errorf(pos, "parameter '%#T' is of incomplete type",
3732 orig_type, declaration->symbol);
3736 static declaration_t *parse_parameter(void)
3738 declaration_specifiers_t specifiers;
3739 memset(&specifiers, 0, sizeof(specifiers));
3741 parse_declaration_specifiers(&specifiers);
3743 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
3749 * Parses a function type parameter list and return a list of declarations.
3751 * @param last point to the last element of the list
3752 * @return the parameter list
3754 static declaration_t *parse_parameters(function_type_t *type, declaration_t **last)
3756 declaration_t *declarations = NULL;
3759 add_anchor_token(')');
3760 int saved_comma_state = save_and_reset_anchor_state(',');
3762 if (token.type == T_IDENTIFIER &&
3763 !is_typedef_symbol(token.v.symbol)) {
3764 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3765 if (la1_type == ',' || la1_type == ')') {
3766 type->kr_style_parameters = true;
3767 declarations = parse_identifier_list(last);
3768 goto parameters_finished;
3772 if (token.type == ')') {
3773 type->unspecified_parameters = 1;
3774 goto parameters_finished;
3777 declaration_t *declaration;
3778 declaration_t *last_declaration = NULL;
3779 function_parameter_t *parameter;
3780 function_parameter_t *last_parameter = NULL;
3783 switch(token.type) {
3787 goto parameters_finished;
3790 case T___extension__:
3792 declaration = parse_parameter();
3794 /* func(void) is not a parameter */
3795 if (last_parameter == NULL
3796 && token.type == ')'
3797 && declaration->symbol == NULL
3798 && skip_typeref(declaration->type) == type_void) {
3799 goto parameters_finished;
3801 semantic_parameter(declaration);
3803 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
3804 memset(parameter, 0, sizeof(parameter[0]));
3805 parameter->type = declaration->type;
3807 if (last_parameter != NULL) {
3808 last_declaration->next = declaration;
3809 last_parameter->next = parameter;
3811 type->parameters = parameter;
3812 declarations = declaration;
3814 last_parameter = parameter;
3815 last_declaration = declaration;
3819 goto parameters_finished;
3821 if (token.type != ',') {
3822 goto parameters_finished;
3828 parameters_finished:
3829 rem_anchor_token(')');
3832 restore_anchor_state(',', saved_comma_state);
3833 *last = last_declaration;
3834 return declarations;
3837 restore_anchor_state(',', saved_comma_state);
3842 typedef enum construct_type_kind_t {
3847 } construct_type_kind_t;
3849 typedef struct construct_type_t construct_type_t;
3850 struct construct_type_t {
3851 construct_type_kind_t kind;
3852 construct_type_t *next;
3855 typedef struct parsed_pointer_t parsed_pointer_t;
3856 struct parsed_pointer_t {
3857 construct_type_t construct_type;
3858 type_qualifiers_t type_qualifiers;
3861 typedef struct construct_function_type_t construct_function_type_t;
3862 struct construct_function_type_t {
3863 construct_type_t construct_type;
3864 type_t *function_type;
3867 typedef struct parsed_array_t parsed_array_t;
3868 struct parsed_array_t {
3869 construct_type_t construct_type;
3870 type_qualifiers_t type_qualifiers;
3876 typedef struct construct_base_type_t construct_base_type_t;
3877 struct construct_base_type_t {
3878 construct_type_t construct_type;
3882 static construct_type_t *parse_pointer_declarator(void)
3886 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3887 memset(pointer, 0, sizeof(pointer[0]));
3888 pointer->construct_type.kind = CONSTRUCT_POINTER;
3889 pointer->type_qualifiers = parse_type_qualifiers();
3891 return (construct_type_t*) pointer;
3894 static construct_type_t *parse_array_declarator(void)
3897 add_anchor_token(']');
3899 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
3900 memset(array, 0, sizeof(array[0]));
3901 array->construct_type.kind = CONSTRUCT_ARRAY;
3903 if (token.type == T_static) {
3904 array->is_static = true;
3908 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3909 if (type_qualifiers != 0) {
3910 if (token.type == T_static) {
3911 array->is_static = true;
3915 array->type_qualifiers = type_qualifiers;
3917 if (token.type == '*' && look_ahead(1)->type == ']') {
3918 array->is_variable = true;
3920 } else if (token.type != ']') {
3921 array->size = parse_assignment_expression();
3924 rem_anchor_token(']');
3928 return (construct_type_t*) array;
3931 static construct_type_t *parse_function_declarator(declaration_t *declaration)
3934 if (declaration != NULL) {
3935 type = allocate_type_zero(TYPE_FUNCTION, &declaration->source_position);
3937 unsigned mask = declaration->modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
3939 if (mask & (mask-1)) {
3940 const char *first = NULL, *second = NULL;
3942 /* more than one calling convention set */
3943 if (declaration->modifiers & DM_CDECL) {
3944 if (first == NULL) first = "cdecl";
3945 else if (second == NULL) second = "cdecl";
3947 if (declaration->modifiers & DM_STDCALL) {
3948 if (first == NULL) first = "stdcall";
3949 else if (second == NULL) second = "stdcall";
3951 if (declaration->modifiers & DM_FASTCALL) {
3952 if (first == NULL) first = "fastcall";
3953 else if (second == NULL) second = "fastcall";
3955 if (declaration->modifiers & DM_THISCALL) {
3956 if (first == NULL) first = "thiscall";
3957 else if (second == NULL) second = "thiscall";
3959 errorf(&declaration->source_position, "%s and %s attributes are not compatible", first, second);
3962 if (declaration->modifiers & DM_CDECL)
3963 type->function.calling_convention = CC_CDECL;
3964 else if (declaration->modifiers & DM_STDCALL)
3965 type->function.calling_convention = CC_STDCALL;
3966 else if (declaration->modifiers & DM_FASTCALL)
3967 type->function.calling_convention = CC_FASTCALL;
3968 else if (declaration->modifiers & DM_THISCALL)
3969 type->function.calling_convention = CC_THISCALL;
3971 type = allocate_type_zero(TYPE_FUNCTION, HERE);
3974 declaration_t *last;
3975 declaration_t *parameters = parse_parameters(&type->function, &last);
3976 if (declaration != NULL) {
3977 declaration->scope.declarations = parameters;
3978 declaration->scope.last_declaration = last;
3979 declaration->scope.is_parameter = true;
3982 construct_function_type_t *construct_function_type =
3983 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
3984 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
3985 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
3986 construct_function_type->function_type = type;
3988 return &construct_function_type->construct_type;
3991 static void fix_declaration_type(declaration_t *declaration)
3993 decl_modifiers_t declaration_modifiers = declaration->modifiers;
3994 type_modifiers_t type_modifiers = declaration->type->base.modifiers;
3996 if (declaration_modifiers & DM_TRANSPARENT_UNION)
3997 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3999 if (declaration->type->base.modifiers == type_modifiers)
4002 type_t *copy = duplicate_type(declaration->type);
4003 copy->base.modifiers = type_modifiers;
4005 type_t *result = typehash_insert(copy);
4006 if (result != copy) {
4007 obstack_free(type_obst, copy);
4010 declaration->type = result;
4013 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
4014 bool may_be_abstract)
4016 /* construct a single linked list of construct_type_t's which describe
4017 * how to construct the final declarator type */
4018 construct_type_t *first = NULL;
4019 construct_type_t *last = NULL;
4020 gnu_attribute_t *attributes = NULL;
4022 decl_modifiers_t modifiers = parse_attributes(&attributes);
4025 while (token.type == '*') {
4026 construct_type_t *type = parse_pointer_declarator();
4036 /* TODO: find out if this is correct */
4037 modifiers |= parse_attributes(&attributes);
4040 if (declaration != NULL)
4041 declaration->modifiers |= modifiers;
4043 construct_type_t *inner_types = NULL;
4045 switch(token.type) {
4047 if (declaration == NULL) {
4048 errorf(HERE, "no identifier expected in typename");
4050 declaration->symbol = token.v.symbol;
4051 declaration->source_position = token.source_position;
4057 add_anchor_token(')');
4058 inner_types = parse_inner_declarator(declaration, may_be_abstract);
4059 if (inner_types != NULL) {
4060 /* All later declarators only modify the return type, not declaration */
4063 rem_anchor_token(')');
4067 if (may_be_abstract)
4069 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4074 construct_type_t *p = last;
4077 construct_type_t *type;
4078 switch(token.type) {
4080 type = parse_function_declarator(declaration);
4083 type = parse_array_declarator();
4086 goto declarator_finished;
4089 /* insert in the middle of the list (behind p) */
4091 type->next = p->next;
4102 declarator_finished:
4103 /* append inner_types at the end of the list, we don't to set last anymore
4104 * as it's not needed anymore */
4106 assert(first == NULL);
4107 first = inner_types;
4109 last->next = inner_types;
4117 static void parse_declaration_attributes(declaration_t *declaration)
4119 gnu_attribute_t *attributes = NULL;
4120 decl_modifiers_t modifiers = parse_attributes(&attributes);
4122 if (declaration == NULL)
4125 declaration->modifiers |= modifiers;
4126 /* check if we have these stupid mode attributes... */
4127 type_t *old_type = declaration->type;
4128 if (old_type == NULL)
4131 gnu_attribute_t *attribute = attributes;
4132 for ( ; attribute != NULL; attribute = attribute->next) {
4133 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
4136 atomic_type_kind_t akind = attribute->u.akind;
4137 if (!is_type_signed(old_type)) {
4139 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
4140 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
4141 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
4142 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
4144 panic("invalid akind in mode attribute");
4148 = make_atomic_type(akind, old_type->base.qualifiers);
4152 static type_t *construct_declarator_type(construct_type_t *construct_list,
4155 construct_type_t *iter = construct_list;
4156 for( ; iter != NULL; iter = iter->next) {
4157 switch(iter->kind) {
4158 case CONSTRUCT_INVALID:
4159 internal_errorf(HERE, "invalid type construction found");
4160 case CONSTRUCT_FUNCTION: {
4161 construct_function_type_t *construct_function_type
4162 = (construct_function_type_t*) iter;
4164 type_t *function_type = construct_function_type->function_type;
4166 function_type->function.return_type = type;
4168 type_t *skipped_return_type = skip_typeref(type);
4170 if (is_type_function(skipped_return_type)) {
4171 errorf(HERE, "function returning function is not allowed");
4172 } else if (is_type_array(skipped_return_type)) {
4173 errorf(HERE, "function returning array is not allowed");
4175 if (skipped_return_type->base.qualifiers != 0) {
4177 "type qualifiers in return type of function type are meaningless");
4181 type = function_type;
4185 case CONSTRUCT_POINTER: {
4186 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4187 type_t *pointer_type = allocate_type_zero(TYPE_POINTER, &null_position);
4188 pointer_type->pointer.points_to = type;
4189 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
4191 type = pointer_type;
4195 case CONSTRUCT_ARRAY: {
4196 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4197 type_t *array_type = allocate_type_zero(TYPE_ARRAY, &null_position);
4199 expression_t *size_expression = parsed_array->size;
4200 if (size_expression != NULL) {
4202 = create_implicit_cast(size_expression, type_size_t);
4205 array_type->base.qualifiers = parsed_array->type_qualifiers;
4206 array_type->array.element_type = type;
4207 array_type->array.is_static = parsed_array->is_static;
4208 array_type->array.is_variable = parsed_array->is_variable;
4209 array_type->array.size_expression = size_expression;
4211 if (size_expression != NULL) {
4212 if (is_constant_expression(size_expression)) {
4213 array_type->array.size_constant = true;
4214 array_type->array.size
4215 = fold_constant(size_expression);
4217 array_type->array.is_vla = true;
4221 type_t *skipped_type = skip_typeref(type);
4223 if (is_type_incomplete(skipped_type)) {
4224 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4225 } else if (is_type_function(skipped_type)) {
4226 errorf(HERE, "array of functions is not allowed");
4233 type_t *hashed_type = typehash_insert(type);
4234 if (hashed_type != type) {
4235 /* the function type was constructed earlier freeing it here will
4236 * destroy other types... */
4237 if (iter->kind != CONSTRUCT_FUNCTION) {
4247 static declaration_t *parse_declarator(
4248 const declaration_specifiers_t *specifiers, bool may_be_abstract)
4250 declaration_t *const declaration = allocate_declaration_zero();
4251 declaration->source_position = specifiers->source_position;
4252 declaration->declared_storage_class = specifiers->declared_storage_class;
4253 declaration->modifiers = specifiers->modifiers;
4254 declaration->deprecated_string = specifiers->deprecated_string;
4255 declaration->get_property_sym = specifiers->get_property_sym;
4256 declaration->put_property_sym = specifiers->put_property_sym;
4257 declaration->is_inline = specifiers->is_inline;
4259 declaration->storage_class = specifiers->declared_storage_class;
4260 if (declaration->storage_class == STORAGE_CLASS_NONE &&
4261 scope != file_scope) {
4262 declaration->storage_class = STORAGE_CLASS_AUTO;
4265 if (specifiers->alignment != 0) {
4266 /* TODO: add checks here */
4267 declaration->alignment = specifiers->alignment;
4270 construct_type_t *construct_type
4271 = parse_inner_declarator(declaration, may_be_abstract);
4272 type_t *const type = specifiers->type;
4273 declaration->type = construct_declarator_type(construct_type, type);
4275 parse_declaration_attributes(declaration);
4277 fix_declaration_type(declaration);
4279 if (construct_type != NULL) {
4280 obstack_free(&temp_obst, construct_type);
4286 static type_t *parse_abstract_declarator(type_t *base_type)
4288 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4290 type_t *result = construct_declarator_type(construct_type, base_type);
4291 if (construct_type != NULL) {
4292 obstack_free(&temp_obst, construct_type);
4298 static declaration_t *append_declaration(declaration_t* const declaration)
4300 if (last_declaration != NULL) {
4301 last_declaration->next = declaration;
4303 scope->declarations = declaration;
4305 last_declaration = declaration;
4310 * Check if the declaration of main is suspicious. main should be a
4311 * function with external linkage, returning int, taking either zero
4312 * arguments, two, or three arguments of appropriate types, ie.
4314 * int main([ int argc, char **argv [, char **env ] ]).
4316 * @param decl the declaration to check
4317 * @param type the function type of the declaration
4319 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
4321 if (decl->storage_class == STORAGE_CLASS_STATIC) {
4322 warningf(&decl->source_position,
4323 "'main' is normally a non-static function");
4325 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4326 warningf(&decl->source_position,
4327 "return type of 'main' should be 'int', but is '%T'",
4328 func_type->return_type);
4330 const function_parameter_t *parm = func_type->parameters;
4332 type_t *const first_type = parm->type;
4333 if (!types_compatible(skip_typeref(first_type), type_int)) {
4334 warningf(&decl->source_position,
4335 "first argument of 'main' should be 'int', but is '%T'", first_type);
4339 type_t *const second_type = parm->type;
4340 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4341 warningf(&decl->source_position,
4342 "second argument of 'main' should be 'char**', but is '%T'", second_type);
4346 type_t *const third_type = parm->type;
4347 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4348 warningf(&decl->source_position,
4349 "third argument of 'main' should be 'char**', but is '%T'", third_type);
4353 goto warn_arg_count;
4357 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
4363 * Check if a symbol is the equal to "main".
4365 static bool is_sym_main(const symbol_t *const sym)
4367 return strcmp(sym->string, "main") == 0;
4370 static declaration_t *record_declaration(
4371 declaration_t *const declaration,
4372 const bool is_definition)
4374 const symbol_t *const symbol = declaration->symbol;
4375 const namespace_t namespc = (namespace_t)declaration->namespc;
4377 assert(symbol != NULL);
4378 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4380 type_t *const orig_type = declaration->type;
4381 type_t *const type = skip_typeref(orig_type);
4382 if (is_type_function(type) &&
4383 type->function.unspecified_parameters &&
4384 warning.strict_prototypes &&
4385 previous_declaration == NULL) {
4386 warningf(&declaration->source_position,
4387 "function declaration '%#T' is not a prototype",
4391 if (warning.main && is_type_function(type) && is_sym_main(symbol)) {
4392 check_type_of_main(declaration, &type->function);
4395 if (warning.nested_externs &&
4396 declaration->storage_class == STORAGE_CLASS_EXTERN &&
4397 scope != file_scope) {
4398 warningf(&declaration->source_position,
4399 "nested extern declaration of '%#T'", declaration->type, symbol);
4402 assert(declaration != previous_declaration);
4403 if (previous_declaration != NULL &&
4404 previous_declaration->parent_scope->is_parameter &&
4405 scope->depth == previous_declaration->parent_scope->depth + 1) {
4406 errorf(&declaration->source_position,
4407 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4408 orig_type, symbol, previous_declaration->type, symbol,
4409 &previous_declaration->source_position);
4412 if (previous_declaration != NULL &&
4413 previous_declaration->parent_scope == scope) {
4414 /* can happen for K&R style declarations */
4415 if (previous_declaration->type == NULL) {
4416 previous_declaration->type = declaration->type;
4419 const type_t *prev_type = skip_typeref(previous_declaration->type);
4420 if (!types_compatible(type, prev_type)) {
4421 errorf(&declaration->source_position,
4422 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4423 orig_type, symbol, previous_declaration->type, symbol,
4424 &previous_declaration->source_position);
4426 unsigned old_storage_class = previous_declaration->storage_class;
4427 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
4428 errorf(&declaration->source_position,
4429 "redeclaration of enum entry '%Y' (declared %P)",
4430 symbol, &previous_declaration->source_position);
4431 return previous_declaration;
4434 if (warning.redundant_decls &&
4436 previous_declaration->storage_class == STORAGE_CLASS_STATIC &&
4437 !(previous_declaration->modifiers & DM_USED) &&
4438 !previous_declaration->used) {
4439 warningf(&previous_declaration->source_position,
4440 "unnecessary static forward declaration for '%#T'",
4441 previous_declaration->type, symbol);
4444 unsigned new_storage_class = declaration->storage_class;
4446 if (is_type_incomplete(prev_type)) {
4447 previous_declaration->type = type;
4451 /* pretend no storage class means extern for function
4452 * declarations (except if the previous declaration is neither
4453 * none nor extern) */
4454 if (is_type_function(type)) {
4455 if (prev_type->function.unspecified_parameters) {
4456 previous_declaration->type = type;
4460 switch (old_storage_class) {
4461 case STORAGE_CLASS_NONE:
4462 old_storage_class = STORAGE_CLASS_EXTERN;
4465 case STORAGE_CLASS_EXTERN:
4466 if (is_definition) {
4467 if (warning.missing_prototypes &&
4468 prev_type->function.unspecified_parameters &&
4469 !is_sym_main(symbol)) {
4470 warningf(&declaration->source_position,
4471 "no previous prototype for '%#T'",
4474 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4475 new_storage_class = STORAGE_CLASS_EXTERN;
4484 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4485 new_storage_class == STORAGE_CLASS_EXTERN) {
4486 warn_redundant_declaration:
4487 if (!is_definition &&
4488 warning.redundant_decls &&
4489 is_type_valid(prev_type) &&
4490 strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
4491 warningf(&declaration->source_position,
4492 "redundant declaration for '%Y' (declared %P)",
4493 symbol, &previous_declaration->source_position);
4495 } else if (current_function == NULL) {
4496 if (old_storage_class != STORAGE_CLASS_STATIC &&
4497 new_storage_class == STORAGE_CLASS_STATIC) {
4498 errorf(&declaration->source_position,
4499 "static declaration of '%Y' follows non-static declaration (declared %P)",
4500 symbol, &previous_declaration->source_position);
4501 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4502 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4503 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4505 goto warn_redundant_declaration;
4507 } else if (is_type_valid(prev_type)) {
4508 if (old_storage_class == new_storage_class) {
4509 errorf(&declaration->source_position,
4510 "redeclaration of '%Y' (declared %P)",
4511 symbol, &previous_declaration->source_position);
4513 errorf(&declaration->source_position,
4514 "redeclaration of '%Y' with different linkage (declared %P)",
4515 symbol, &previous_declaration->source_position);
4520 previous_declaration->modifiers |= declaration->modifiers;
4521 previous_declaration->is_inline |= declaration->is_inline;
4522 return previous_declaration;
4523 } else if (is_type_function(type)) {
4524 if (is_definition &&
4525 declaration->storage_class != STORAGE_CLASS_STATIC) {
4526 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4527 warningf(&declaration->source_position,
4528 "no previous prototype for '%#T'", orig_type, symbol);
4529 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4530 warningf(&declaration->source_position,
4531 "no previous declaration for '%#T'", orig_type,
4536 if (warning.missing_declarations &&
4537 scope == file_scope && (
4538 declaration->storage_class == STORAGE_CLASS_NONE ||
4539 declaration->storage_class == STORAGE_CLASS_THREAD
4541 warningf(&declaration->source_position,
4542 "no previous declaration for '%#T'", orig_type, symbol);
4546 assert(declaration->parent_scope == NULL);
4547 assert(scope != NULL);
4549 declaration->parent_scope = scope;
4551 environment_push(declaration);
4552 return append_declaration(declaration);
4555 static void parser_error_multiple_definition(declaration_t *declaration,
4556 const source_position_t *source_position)
4558 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4559 declaration->symbol, &declaration->source_position);
4562 static bool is_declaration_specifier(const token_t *token,
4563 bool only_specifiers_qualifiers)
4565 switch (token->type) {
4570 return is_typedef_symbol(token->v.symbol);
4572 case T___extension__:
4574 return !only_specifiers_qualifiers;
4581 static void parse_init_declarator_rest(declaration_t *declaration)
4585 type_t *orig_type = declaration->type;
4586 type_t *type = skip_typeref(orig_type);
4588 if (declaration->init.initializer != NULL) {
4589 parser_error_multiple_definition(declaration, HERE);
4592 bool must_be_constant = false;
4593 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4594 declaration->storage_class == STORAGE_CLASS_THREAD_STATIC ||
4595 declaration->parent_scope == file_scope) {
4596 must_be_constant = true;
4599 if (is_type_function(type)) {
4600 errorf(&declaration->source_position,
4601 "function '%#T' is initialized like a variable",
4602 orig_type, declaration->symbol);
4603 orig_type = type_error_type;
4606 parse_initializer_env_t env;
4607 env.type = orig_type;
4608 env.must_be_constant = must_be_constant;
4609 env.declaration = current_init_decl = declaration;
4611 initializer_t *initializer = parse_initializer(&env);
4612 current_init_decl = NULL;
4614 if (!is_type_function(type)) {
4615 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
4616 * the array type size */
4617 declaration->type = env.type;
4618 declaration->init.initializer = initializer;
4622 /* parse rest of a declaration without any declarator */
4623 static void parse_anonymous_declaration_rest(
4624 const declaration_specifiers_t *specifiers)
4628 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) {
4629 warningf(&specifiers->source_position,
4630 "useless storage class in empty declaration");
4633 type_t *type = specifiers->type;
4634 switch (type->kind) {
4635 case TYPE_COMPOUND_STRUCT:
4636 case TYPE_COMPOUND_UNION: {
4637 if (type->compound.declaration->symbol == NULL) {
4638 warningf(&specifiers->source_position,
4639 "unnamed struct/union that defines no instances");
4648 warningf(&specifiers->source_position, "empty declaration");
4652 #ifdef RECORD_EMPTY_DECLARATIONS
4653 declaration_t *const declaration = allocate_declaration_zero();
4654 declaration->type = specifiers->type;
4655 declaration->declared_storage_class = specifiers->declared_storage_class;
4656 declaration->source_position = specifiers->source_position;
4657 declaration->modifiers = specifiers->modifiers;
4658 declaration->storage_class = STORAGE_CLASS_NONE;
4660 append_declaration(declaration);
4664 static void parse_declaration_rest(declaration_t *ndeclaration,
4665 const declaration_specifiers_t *specifiers,
4666 parsed_declaration_func finished_declaration)
4668 add_anchor_token(';');
4669 add_anchor_token(',');
4671 declaration_t *declaration =
4672 finished_declaration(ndeclaration, token.type == '=');
4674 type_t *orig_type = declaration->type;
4675 type_t *type = skip_typeref(orig_type);
4677 if (type->kind != TYPE_FUNCTION &&
4678 declaration->is_inline &&
4679 is_type_valid(type)) {
4680 warningf(&declaration->source_position,
4681 "variable '%Y' declared 'inline'\n", declaration->symbol);
4684 if (token.type == '=') {
4685 parse_init_declarator_rest(declaration);
4688 if (token.type != ',')
4692 add_anchor_token('=');
4693 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4694 rem_anchor_token('=');
4699 rem_anchor_token(';');
4700 rem_anchor_token(',');
4703 static declaration_t *finished_kr_declaration(declaration_t *declaration, bool is_definition)
4705 symbol_t *symbol = declaration->symbol;
4706 if (symbol == NULL) {
4707 errorf(HERE, "anonymous declaration not valid as function parameter");
4710 namespace_t namespc = (namespace_t) declaration->namespc;
4711 if (namespc != NAMESPACE_NORMAL) {
4712 return record_declaration(declaration, false);
4715 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4716 if (previous_declaration == NULL ||
4717 previous_declaration->parent_scope != scope) {
4718 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4723 if (is_definition) {
4724 errorf(HERE, "parameter %Y is initialised", declaration->symbol);
4727 if (previous_declaration->type == NULL) {
4728 previous_declaration->type = declaration->type;
4729 previous_declaration->declared_storage_class = declaration->declared_storage_class;
4730 previous_declaration->storage_class = declaration->storage_class;
4731 previous_declaration->parent_scope = scope;
4732 return previous_declaration;
4734 return record_declaration(declaration, false);
4738 static void parse_declaration(parsed_declaration_func finished_declaration)
4740 declaration_specifiers_t specifiers;
4741 memset(&specifiers, 0, sizeof(specifiers));
4743 add_anchor_token(';');
4744 parse_declaration_specifiers(&specifiers);
4745 rem_anchor_token(';');
4747 if (token.type == ';') {
4748 parse_anonymous_declaration_rest(&specifiers);
4750 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4751 parse_declaration_rest(declaration, &specifiers, finished_declaration);
4755 static type_t *get_default_promoted_type(type_t *orig_type)
4757 type_t *result = orig_type;
4759 type_t *type = skip_typeref(orig_type);
4760 if (is_type_integer(type)) {
4761 result = promote_integer(type);
4762 } else if (type == type_float) {
4763 result = type_double;
4769 static void parse_kr_declaration_list(declaration_t *declaration)
4771 type_t *type = skip_typeref(declaration->type);
4772 if (!is_type_function(type))
4775 if (!type->function.kr_style_parameters)
4778 add_anchor_token('{');
4780 /* push function parameters */
4781 size_t const top = environment_top();
4782 scope_push(&declaration->scope);
4784 declaration_t *parameter = declaration->scope.declarations;
4785 for ( ; parameter != NULL; parameter = parameter->next) {
4786 assert(parameter->parent_scope == NULL);
4787 parameter->parent_scope = scope;
4788 environment_push(parameter);
4791 /* parse declaration list */
4792 while (is_declaration_specifier(&token, false)) {
4793 parse_declaration(finished_kr_declaration);
4796 /* pop function parameters */
4797 assert(scope == &declaration->scope);
4799 environment_pop_to(top);
4801 /* update function type */
4802 type_t *new_type = duplicate_type(type);
4804 function_parameter_t *parameters = NULL;
4805 function_parameter_t *last_parameter = NULL;
4807 declaration_t *parameter_declaration = declaration->scope.declarations;
4808 for( ; parameter_declaration != NULL;
4809 parameter_declaration = parameter_declaration->next) {
4810 type_t *parameter_type = parameter_declaration->type;
4811 if (parameter_type == NULL) {
4813 errorf(HERE, "no type specified for function parameter '%Y'",
4814 parameter_declaration->symbol);
4816 if (warning.implicit_int) {
4817 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4818 parameter_declaration->symbol);
4820 parameter_type = type_int;
4821 parameter_declaration->type = parameter_type;
4825 semantic_parameter(parameter_declaration);
4826 parameter_type = parameter_declaration->type;
4829 * we need the default promoted types for the function type
4831 parameter_type = get_default_promoted_type(parameter_type);
4833 function_parameter_t *function_parameter
4834 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
4835 memset(function_parameter, 0, sizeof(function_parameter[0]));
4837 function_parameter->type = parameter_type;
4838 if (last_parameter != NULL) {
4839 last_parameter->next = function_parameter;
4841 parameters = function_parameter;
4843 last_parameter = function_parameter;
4846 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
4848 new_type->function.parameters = parameters;
4849 new_type->function.unspecified_parameters = true;
4851 type = typehash_insert(new_type);
4852 if (type != new_type) {
4853 obstack_free(type_obst, new_type);
4856 declaration->type = type;
4858 rem_anchor_token('{');
4861 static bool first_err = true;
4864 * When called with first_err set, prints the name of the current function,
4867 static void print_in_function(void)
4871 diagnosticf("%s: In function '%Y':\n",
4872 current_function->source_position.input_name,
4873 current_function->symbol);
4878 * Check if all labels are defined in the current function.
4879 * Check if all labels are used in the current function.
4881 static void check_labels(void)
4883 for (const goto_statement_t *goto_statement = goto_first;
4884 goto_statement != NULL;
4885 goto_statement = goto_statement->next) {
4886 /* skip computed gotos */
4887 if (goto_statement->expression != NULL)
4890 declaration_t *label = goto_statement->label;
4893 if (label->source_position.input_name == NULL) {
4894 print_in_function();
4895 errorf(&goto_statement->base.source_position,
4896 "label '%Y' used but not defined", label->symbol);
4899 goto_first = goto_last = NULL;
4901 if (warning.unused_label) {
4902 for (const label_statement_t *label_statement = label_first;
4903 label_statement != NULL;
4904 label_statement = label_statement->next) {
4905 const declaration_t *label = label_statement->label;
4907 if (! label->used) {
4908 print_in_function();
4909 warningf(&label_statement->base.source_position,
4910 "label '%Y' defined but not used", label->symbol);
4914 label_first = label_last = NULL;
4918 * Check declarations of current_function for unused entities.
4920 static void check_declarations(void)
4922 if (warning.unused_parameter) {
4923 const scope_t *scope = ¤t_function->scope;
4925 if (is_sym_main(current_function->symbol)) {
4926 /* do not issue unused warnings for main */
4929 const declaration_t *parameter = scope->declarations;
4930 for (; parameter != NULL; parameter = parameter->next) {
4931 if (! parameter->used) {
4932 print_in_function();
4933 warningf(¶meter->source_position,
4934 "unused parameter '%Y'", parameter->symbol);
4938 if (warning.unused_variable) {
4942 static int determine_truth(expression_t const* const cond)
4945 !is_constant_expression(cond) ? 0 :
4946 fold_constant(cond) != 0 ? 1 :
4950 static bool noreturn_candidate;
4952 static void check_reachable(statement_t *const stmt)
4954 if (stmt->base.reachable)
4956 if (stmt->kind != STATEMENT_DO_WHILE)
4957 stmt->base.reachable = true;
4959 statement_t *last = stmt;
4961 switch (stmt->kind) {
4962 case STATEMENT_INVALID:
4963 case STATEMENT_EMPTY:
4964 case STATEMENT_DECLARATION:
4966 next = stmt->base.next;
4969 case STATEMENT_COMPOUND:
4970 next = stmt->compound.statements;
4973 case STATEMENT_RETURN:
4974 noreturn_candidate = false;
4977 case STATEMENT_IF: {
4978 if_statement_t const* const ifs = &stmt->ifs;
4979 int const val = determine_truth(ifs->condition);
4982 check_reachable(ifs->true_statement);
4987 if (ifs->false_statement != NULL) {
4988 check_reachable(ifs->false_statement);
4992 next = stmt->base.next;
4996 case STATEMENT_SWITCH: {
4997 switch_statement_t const *const switchs = &stmt->switchs;
4998 expression_t const *const expr = switchs->expression;
5000 if (is_constant_expression(expr)) {
5001 long const val = fold_constant(expr);
5002 case_label_statement_t * defaults = NULL;
5003 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5004 if (i->expression == NULL) {
5009 if (i->first_case <= val && val <= i->last_case) {
5010 check_reachable((statement_t*)i);
5015 if (defaults != NULL) {
5016 check_reachable((statement_t*)defaults);
5020 bool has_default = false;
5021 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5022 if (i->expression == NULL)
5025 check_reachable((statement_t*)i);
5032 next = stmt->base.next;
5036 case STATEMENT_EXPRESSION: {
5037 /* Check for noreturn function call */
5038 expression_t const *const expr = stmt->expression.expression;
5039 if (expr->kind == EXPR_CALL) {
5040 expression_t const *const func = expr->call.function;
5041 if (func->kind == EXPR_REFERENCE) {
5042 declaration_t const *const decl = func->reference.declaration;
5043 if (decl != NULL && decl->modifiers & DM_NORETURN) {
5049 next = stmt->base.next;
5053 case STATEMENT_CONTINUE: {
5054 statement_t *parent = stmt;
5056 parent = parent->base.parent;
5057 if (parent == NULL) /* continue not within loop */
5061 switch (parent->kind) {
5062 case STATEMENT_WHILE: goto continue_while;
5063 case STATEMENT_DO_WHILE: goto continue_do_while;
5064 case STATEMENT_FOR: goto continue_for;
5071 case STATEMENT_BREAK: {
5072 statement_t *parent = stmt;
5074 parent = parent->base.parent;
5075 if (parent == NULL) /* break not within loop/switch */
5078 switch (parent->kind) {
5079 case STATEMENT_SWITCH:
5080 case STATEMENT_WHILE:
5081 case STATEMENT_DO_WHILE:
5084 next = parent->base.next;
5085 goto found_break_parent;
5094 case STATEMENT_GOTO:
5095 if (stmt->gotos.expression) {
5096 statement_t *parent = stmt->base.parent;
5097 if (parent == NULL) /* top level goto */
5101 next = stmt->gotos.label->init.statement;
5102 if (next == NULL) /* missing label */
5107 case STATEMENT_LABEL:
5108 next = stmt->label.statement;
5111 case STATEMENT_CASE_LABEL:
5112 next = stmt->case_label.statement;
5115 case STATEMENT_WHILE: {
5116 while_statement_t const *const whiles = &stmt->whiles;
5117 int const val = determine_truth(whiles->condition);
5120 check_reachable(whiles->body);
5125 next = stmt->base.next;
5129 case STATEMENT_DO_WHILE:
5130 next = stmt->do_while.body;
5133 case STATEMENT_FOR: {
5134 for_statement_t *const fors = &stmt->fors;
5136 if (fors->condition_reachable)
5138 fors->condition_reachable = true;
5140 expression_t const *const cond = fors->condition;
5142 cond == NULL ? 1 : determine_truth(cond);
5145 check_reachable(fors->body);
5150 next = stmt->base.next;
5154 case STATEMENT_MS_TRY: {
5155 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5156 check_reachable(ms_try->try_statement);
5157 next = ms_try->final_statement;
5161 case STATEMENT_LEAVE: {
5162 statement_t *parent = stmt;
5164 parent = parent->base.parent;
5165 if (parent == NULL) /* __leave not within __try */
5168 if (parent->kind == STATEMENT_MS_TRY) {
5170 next = parent->ms_try.final_statement;
5178 while (next == NULL) {
5179 next = last->base.parent;
5181 noreturn_candidate = false;
5183 type_t *const type = current_function->type;
5184 assert(is_type_function(type));
5185 type_t *const ret = skip_typeref(type->function.return_type);
5186 if (warning.return_type &&
5187 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5188 is_type_valid(ret) &&
5189 !is_sym_main(current_function->symbol)) {
5190 warningf(&stmt->base.source_position,
5191 "control reaches end of non-void function");
5196 switch (next->kind) {
5197 case STATEMENT_INVALID:
5198 case STATEMENT_EMPTY:
5199 case STATEMENT_DECLARATION:
5200 case STATEMENT_EXPRESSION:
5202 case STATEMENT_RETURN:
5203 case STATEMENT_CONTINUE:
5204 case STATEMENT_BREAK:
5205 case STATEMENT_GOTO:
5206 case STATEMENT_LEAVE:
5207 panic("invalid control flow in function");
5209 case STATEMENT_COMPOUND:
5211 case STATEMENT_SWITCH:
5212 case STATEMENT_LABEL:
5213 case STATEMENT_CASE_LABEL:
5215 next = next->base.next;
5218 case STATEMENT_WHILE: {
5220 if (next->base.reachable)
5222 next->base.reachable = true;
5224 while_statement_t const *const whiles = &next->whiles;
5225 int const val = determine_truth(whiles->condition);
5228 check_reachable(whiles->body);
5234 next = next->base.next;
5238 case STATEMENT_DO_WHILE: {
5240 if (next->base.reachable)
5242 next->base.reachable = true;
5244 do_while_statement_t const *const dw = &next->do_while;
5245 int const val = determine_truth(dw->condition);
5248 check_reachable(dw->body);
5254 next = next->base.next;
5258 case STATEMENT_FOR: {
5260 for_statement_t *const fors = &next->fors;
5262 fors->step_reachable = true;
5264 if (fors->condition_reachable)
5266 fors->condition_reachable = true;
5268 expression_t const *const cond = fors->condition;
5270 cond == NULL ? 1 : determine_truth(cond);
5273 check_reachable(fors->body);
5279 next = next->base.next;
5283 case STATEMENT_MS_TRY:
5285 next = next->ms_try.final_statement;
5291 next = stmt->base.parent;
5293 warningf(&stmt->base.source_position,
5294 "control reaches end of non-void function");
5298 check_reachable(next);
5301 static void check_unreachable(statement_t const* const stmt)
5303 if (!stmt->base.reachable &&
5304 stmt->kind != STATEMENT_DO_WHILE &&
5305 stmt->kind != STATEMENT_FOR &&
5306 (stmt->kind != STATEMENT_COMPOUND || stmt->compound.statements == NULL)) {
5307 warningf(&stmt->base.source_position, "statement is unreachable");
5310 switch (stmt->kind) {
5311 case STATEMENT_INVALID:
5312 case STATEMENT_EMPTY:
5313 case STATEMENT_RETURN:
5314 case STATEMENT_DECLARATION:
5315 case STATEMENT_EXPRESSION:
5316 case STATEMENT_CONTINUE:
5317 case STATEMENT_BREAK:
5318 case STATEMENT_GOTO:
5320 case STATEMENT_LEAVE:
5323 case STATEMENT_COMPOUND:
5324 if (stmt->compound.statements)
5325 check_unreachable(stmt->compound.statements);
5329 check_unreachable(stmt->ifs.true_statement);
5330 if (stmt->ifs.false_statement != NULL)
5331 check_unreachable(stmt->ifs.false_statement);
5334 case STATEMENT_SWITCH:
5335 check_unreachable(stmt->switchs.body);
5338 case STATEMENT_LABEL:
5339 check_unreachable(stmt->label.statement);
5342 case STATEMENT_CASE_LABEL:
5343 check_unreachable(stmt->case_label.statement);
5346 case STATEMENT_WHILE:
5347 check_unreachable(stmt->whiles.body);
5350 case STATEMENT_DO_WHILE:
5351 check_unreachable(stmt->do_while.body);
5352 if (!stmt->base.reachable) {
5353 expression_t const *const cond = stmt->do_while.condition;
5354 if (determine_truth(cond) >= 0) {
5355 warningf(&cond->base.source_position,
5356 "condition of do-while-loop is unreachable");
5361 case STATEMENT_FOR: {
5362 for_statement_t const* const fors = &stmt->fors;
5364 // if init and step are unreachable, cond is unreachable, too
5365 if (!stmt->base.reachable && !fors->step_reachable) {
5366 warningf(&stmt->base.source_position, "statement is unreachable");
5368 if (!stmt->base.reachable && fors->initialisation != NULL) {
5369 warningf(&fors->initialisation->base.source_position,
5370 "initialisation of for-statement is unreachable");
5373 if (!fors->condition_reachable && fors->condition != NULL) {
5374 warningf(&fors->condition->base.source_position,
5375 "condition of for-statement is unreachable");
5378 if (!fors->step_reachable && fors->step != NULL) {
5379 warningf(&fors->step->base.source_position,
5380 "step of for-statement is unreachable");
5384 check_unreachable(fors->body);
5388 case STATEMENT_MS_TRY: {
5389 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5390 check_unreachable(ms_try->try_statement);
5391 check_unreachable(ms_try->final_statement);
5395 if (stmt->base.next)
5396 check_unreachable(stmt->base.next);
5399 static void parse_external_declaration(void)
5401 /* function-definitions and declarations both start with declaration
5403 declaration_specifiers_t specifiers;
5404 memset(&specifiers, 0, sizeof(specifiers));
5406 add_anchor_token(';');
5407 parse_declaration_specifiers(&specifiers);
5408 rem_anchor_token(';');
5410 /* must be a declaration */
5411 if (token.type == ';') {
5412 parse_anonymous_declaration_rest(&specifiers);
5416 add_anchor_token(',');
5417 add_anchor_token('=');
5418 add_anchor_token(';');
5419 add_anchor_token('{');
5421 /* declarator is common to both function-definitions and declarations */
5422 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5424 rem_anchor_token('{');
5425 rem_anchor_token(';');
5426 rem_anchor_token('=');
5427 rem_anchor_token(',');
5429 /* must be a declaration */
5430 switch (token.type) {
5434 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
5438 /* must be a function definition */
5439 parse_kr_declaration_list(ndeclaration);
5441 if (token.type != '{') {
5442 parse_error_expected("while parsing function definition", '{', NULL);
5443 eat_until_matching_token(';');
5447 type_t *type = ndeclaration->type;
5449 /* note that we don't skip typerefs: the standard doesn't allow them here
5450 * (so we can't use is_type_function here) */
5451 if (type->kind != TYPE_FUNCTION) {
5452 if (is_type_valid(type)) {
5453 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5454 type, ndeclaration->symbol);
5460 if (warning.aggregate_return &&
5461 is_type_compound(skip_typeref(type->function.return_type))) {
5462 warningf(HERE, "function '%Y' returns an aggregate",
5463 ndeclaration->symbol);
5465 if (warning.traditional && !type->function.unspecified_parameters) {
5466 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5467 ndeclaration->symbol);
5469 if (warning.old_style_definition && type->function.unspecified_parameters) {
5470 warningf(HERE, "old-style function definition '%Y'",
5471 ndeclaration->symbol);
5474 /* § 6.7.5.3 (14) a function definition with () means no
5475 * parameters (and not unspecified parameters) */
5476 if (type->function.unspecified_parameters
5477 && type->function.parameters == NULL
5478 && !type->function.kr_style_parameters) {
5479 type_t *duplicate = duplicate_type(type);
5480 duplicate->function.unspecified_parameters = false;
5482 type = typehash_insert(duplicate);
5483 if (type != duplicate) {
5484 obstack_free(type_obst, duplicate);
5486 ndeclaration->type = type;
5489 declaration_t *const declaration = record_declaration(ndeclaration, true);
5490 if (ndeclaration != declaration) {
5491 declaration->scope = ndeclaration->scope;
5493 type = skip_typeref(declaration->type);
5495 /* push function parameters and switch scope */
5496 size_t const top = environment_top();
5497 scope_push(&declaration->scope);
5499 declaration_t *parameter = declaration->scope.declarations;
5500 for( ; parameter != NULL; parameter = parameter->next) {
5501 if (parameter->parent_scope == &ndeclaration->scope) {
5502 parameter->parent_scope = scope;
5504 assert(parameter->parent_scope == NULL
5505 || parameter->parent_scope == scope);
5506 parameter->parent_scope = scope;
5507 if (parameter->symbol == NULL) {
5508 errorf(¶meter->source_position, "parameter name omitted");
5511 environment_push(parameter);
5514 if (declaration->init.statement != NULL) {
5515 parser_error_multiple_definition(declaration, HERE);
5518 /* parse function body */
5519 int label_stack_top = label_top();
5520 declaration_t *old_current_function = current_function;
5521 current_function = declaration;
5522 current_parent = NULL;
5524 statement_t *const body = parse_compound_statement(false);
5525 declaration->init.statement = body;
5528 check_declarations();
5529 if (warning.return_type ||
5530 warning.unreachable_code ||
5531 (warning.missing_noreturn && !(declaration->modifiers & DM_NORETURN))) {
5532 noreturn_candidate = true;
5533 check_reachable(body);
5534 if (warning.unreachable_code)
5535 check_unreachable(body);
5536 if (warning.missing_noreturn &&
5537 noreturn_candidate &&
5538 !(declaration->modifiers & DM_NORETURN)) {
5539 warningf(&body->base.source_position,
5540 "function '%#T' is candidate for attribute 'noreturn'",
5541 type, declaration->symbol);
5545 assert(current_parent == NULL);
5546 assert(current_function == declaration);
5547 current_function = old_current_function;
5548 label_pop_to(label_stack_top);
5551 assert(scope == &declaration->scope);
5553 environment_pop_to(top);
5556 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5557 source_position_t *source_position,
5558 const symbol_t *symbol)
5560 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
5562 type->bitfield.base_type = base_type;
5563 type->bitfield.size_expression = size;
5566 type_t *skipped_type = skip_typeref(base_type);
5567 if (!is_type_integer(skipped_type)) {
5568 errorf(HERE, "bitfield base type '%T' is not an integer type",
5572 bit_size = skipped_type->base.size * 8;
5575 if (is_constant_expression(size)) {
5576 long v = fold_constant(size);
5579 errorf(source_position, "negative width in bit-field '%Y'",
5581 } else if (v == 0) {
5582 errorf(source_position, "zero width for bit-field '%Y'",
5584 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5585 errorf(source_position, "width of '%Y' exceeds its type",
5588 type->bitfield.bit_size = v;
5595 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
5598 declaration_t *iter = compound_declaration->scope.declarations;
5599 for( ; iter != NULL; iter = iter->next) {
5600 if (iter->namespc != NAMESPACE_NORMAL)
5603 if (iter->symbol == NULL) {
5604 type_t *type = skip_typeref(iter->type);
5605 if (is_type_compound(type)) {
5606 declaration_t *result
5607 = find_compound_entry(type->compound.declaration, symbol);
5614 if (iter->symbol == symbol) {
5622 static void parse_compound_declarators(declaration_t *struct_declaration,
5623 const declaration_specifiers_t *specifiers)
5625 declaration_t *last_declaration = struct_declaration->scope.declarations;
5626 if (last_declaration != NULL) {
5627 while (last_declaration->next != NULL) {
5628 last_declaration = last_declaration->next;
5633 declaration_t *declaration;
5635 if (token.type == ':') {
5636 source_position_t source_position = *HERE;
5639 type_t *base_type = specifiers->type;
5640 expression_t *size = parse_constant_expression();
5642 type_t *type = make_bitfield_type(base_type, size,
5643 &source_position, sym_anonymous);
5645 declaration = allocate_declaration_zero();
5646 declaration->namespc = NAMESPACE_NORMAL;
5647 declaration->declared_storage_class = STORAGE_CLASS_NONE;
5648 declaration->storage_class = STORAGE_CLASS_NONE;
5649 declaration->source_position = source_position;
5650 declaration->modifiers = specifiers->modifiers;
5651 declaration->type = type;
5653 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
5655 type_t *orig_type = declaration->type;
5656 type_t *type = skip_typeref(orig_type);
5658 if (token.type == ':') {
5659 source_position_t source_position = *HERE;
5661 expression_t *size = parse_constant_expression();
5663 type_t *bitfield_type = make_bitfield_type(orig_type, size,
5664 &source_position, declaration->symbol);
5665 declaration->type = bitfield_type;
5667 /* TODO we ignore arrays for now... what is missing is a check
5668 * that they're at the end of the struct */
5669 if (is_type_incomplete(type) && !is_type_array(type)) {
5671 "compound member '%Y' has incomplete type '%T'",
5672 declaration->symbol, orig_type);
5673 } else if (is_type_function(type)) {
5674 errorf(HERE, "compound member '%Y' must not have function type '%T'",
5675 declaration->symbol, orig_type);
5680 /* make sure we don't define a symbol multiple times */
5681 symbol_t *symbol = declaration->symbol;
5682 if (symbol != NULL) {
5683 declaration_t *prev_decl
5684 = find_compound_entry(struct_declaration, symbol);
5686 if (prev_decl != NULL) {
5687 assert(prev_decl->symbol == symbol);
5688 errorf(&declaration->source_position,
5689 "multiple declarations of symbol '%Y' (declared %P)",
5690 symbol, &prev_decl->source_position);
5694 /* append declaration */
5695 if (last_declaration != NULL) {
5696 last_declaration->next = declaration;
5698 struct_declaration->scope.declarations = declaration;
5700 last_declaration = declaration;
5702 if (token.type != ',')
5712 static void parse_compound_type_entries(declaration_t *compound_declaration)
5715 add_anchor_token('}');
5717 while (token.type != '}') {
5718 if (token.type == T_EOF) {
5719 errorf(HERE, "EOF while parsing struct");
5722 declaration_specifiers_t specifiers;
5723 memset(&specifiers, 0, sizeof(specifiers));
5724 parse_declaration_specifiers(&specifiers);
5726 parse_compound_declarators(compound_declaration, &specifiers);
5728 rem_anchor_token('}');
5732 static type_t *parse_typename(void)
5734 declaration_specifiers_t specifiers;
5735 memset(&specifiers, 0, sizeof(specifiers));
5736 parse_declaration_specifiers(&specifiers);
5737 if (specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
5738 /* TODO: improve error message, user does probably not know what a
5739 * storage class is...
5741 errorf(HERE, "typename may not have a storage class");
5744 type_t *result = parse_abstract_declarator(specifiers.type);
5752 typedef expression_t* (*parse_expression_function) (unsigned precedence);
5753 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
5754 expression_t *left);
5756 typedef struct expression_parser_function_t expression_parser_function_t;
5757 struct expression_parser_function_t {
5758 unsigned precedence;
5759 parse_expression_function parser;
5760 unsigned infix_precedence;
5761 parse_expression_infix_function infix_parser;
5764 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5767 * Prints an error message if an expression was expected but not read
5769 static expression_t *expected_expression_error(void)
5771 /* skip the error message if the error token was read */
5772 if (token.type != T_ERROR) {
5773 errorf(HERE, "expected expression, got token '%K'", &token);
5777 return create_invalid_expression();
5781 * Parse a string constant.
5783 static expression_t *parse_string_const(void)
5786 if (token.type == T_STRING_LITERAL) {
5787 string_t res = token.v.string;
5789 while (token.type == T_STRING_LITERAL) {
5790 res = concat_strings(&res, &token.v.string);
5793 if (token.type != T_WIDE_STRING_LITERAL) {
5794 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
5795 /* note: that we use type_char_ptr here, which is already the
5796 * automatic converted type. revert_automatic_type_conversion
5797 * will construct the array type */
5798 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
5799 cnst->string.value = res;
5803 wres = concat_string_wide_string(&res, &token.v.wide_string);
5805 wres = token.v.wide_string;
5810 switch (token.type) {
5811 case T_WIDE_STRING_LITERAL:
5812 wres = concat_wide_strings(&wres, &token.v.wide_string);
5815 case T_STRING_LITERAL:
5816 wres = concat_wide_string_string(&wres, &token.v.string);
5820 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5821 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5822 cnst->wide_string.value = wres;
5831 * Parse an integer constant.
5833 static expression_t *parse_int_const(void)
5835 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5836 cnst->base.source_position = *HERE;
5837 cnst->base.type = token.datatype;
5838 cnst->conste.v.int_value = token.v.intvalue;
5846 * Parse a character constant.
5848 static expression_t *parse_character_constant(void)
5850 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
5852 cnst->base.source_position = *HERE;
5853 cnst->base.type = token.datatype;
5854 cnst->conste.v.character = token.v.string;
5856 if (cnst->conste.v.character.size != 1) {
5857 if (warning.multichar && GNU_MODE) {
5858 warningf(HERE, "multi-character character constant");
5860 errorf(HERE, "more than 1 characters in character constant");
5869 * Parse a wide character constant.
5871 static expression_t *parse_wide_character_constant(void)
5873 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
5875 cnst->base.source_position = *HERE;
5876 cnst->base.type = token.datatype;
5877 cnst->conste.v.wide_character = token.v.wide_string;
5879 if (cnst->conste.v.wide_character.size != 1) {
5880 if (warning.multichar && GNU_MODE) {
5881 warningf(HERE, "multi-character character constant");
5883 errorf(HERE, "more than 1 characters in character constant");
5892 * Parse a float constant.
5894 static expression_t *parse_float_const(void)
5896 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5897 cnst->base.type = token.datatype;
5898 cnst->conste.v.float_value = token.v.floatvalue;
5905 static declaration_t *create_implicit_function(symbol_t *symbol,
5906 const source_position_t *source_position)
5908 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
5909 ntype->function.return_type = type_int;
5910 ntype->function.unspecified_parameters = true;
5912 type_t *type = typehash_insert(ntype);
5913 if (type != ntype) {
5917 declaration_t *const declaration = allocate_declaration_zero();
5918 declaration->storage_class = STORAGE_CLASS_EXTERN;
5919 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
5920 declaration->type = type;
5921 declaration->symbol = symbol;
5922 declaration->source_position = *source_position;
5923 declaration->implicit = true;
5925 bool strict_prototypes_old = warning.strict_prototypes;
5926 warning.strict_prototypes = false;
5927 record_declaration(declaration, false);
5928 warning.strict_prototypes = strict_prototypes_old;
5934 * Creates a return_type (func)(argument_type) function type if not
5937 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
5938 type_t *argument_type2)
5940 function_parameter_t *parameter2
5941 = obstack_alloc(type_obst, sizeof(parameter2[0]));
5942 memset(parameter2, 0, sizeof(parameter2[0]));
5943 parameter2->type = argument_type2;
5945 function_parameter_t *parameter1
5946 = obstack_alloc(type_obst, sizeof(parameter1[0]));
5947 memset(parameter1, 0, sizeof(parameter1[0]));
5948 parameter1->type = argument_type1;
5949 parameter1->next = parameter2;
5951 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5952 type->function.return_type = return_type;
5953 type->function.parameters = parameter1;
5955 type_t *result = typehash_insert(type);
5956 if (result != type) {
5964 * Creates a return_type (func)(argument_type) function type if not
5967 * @param return_type the return type
5968 * @param argument_type the argument type
5970 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
5972 function_parameter_t *parameter
5973 = obstack_alloc(type_obst, sizeof(parameter[0]));
5974 memset(parameter, 0, sizeof(parameter[0]));
5975 parameter->type = argument_type;
5977 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5978 type->function.return_type = return_type;
5979 type->function.parameters = parameter;
5981 type_t *result = typehash_insert(type);
5982 if (result != type) {
5989 static type_t *make_function_0_type(type_t *return_type)
5991 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5992 type->function.return_type = return_type;
5993 type->function.parameters = NULL;
5995 type_t *result = typehash_insert(type);
5996 if (result != type) {
6004 * Creates a function type for some function like builtins.
6006 * @param symbol the symbol describing the builtin
6008 static type_t *get_builtin_symbol_type(symbol_t *symbol)
6010 switch(symbol->ID) {
6011 case T___builtin_alloca:
6012 return make_function_1_type(type_void_ptr, type_size_t);
6013 case T___builtin_huge_val:
6014 return make_function_0_type(type_double);
6015 case T___builtin_inf:
6016 return make_function_0_type(type_double);
6017 case T___builtin_inff:
6018 return make_function_0_type(type_float);
6019 case T___builtin_infl:
6020 return make_function_0_type(type_long_double);
6021 case T___builtin_nan:
6022 return make_function_1_type(type_double, type_char_ptr);
6023 case T___builtin_nanf:
6024 return make_function_1_type(type_float, type_char_ptr);
6025 case T___builtin_nanl:
6026 return make_function_1_type(type_long_double, type_char_ptr);
6027 case T___builtin_va_end:
6028 return make_function_1_type(type_void, type_valist);
6029 case T___builtin_expect:
6030 return make_function_2_type(type_long, type_long, type_long);
6032 internal_errorf(HERE, "not implemented builtin symbol found");
6037 * Performs automatic type cast as described in § 6.3.2.1.
6039 * @param orig_type the original type
6041 static type_t *automatic_type_conversion(type_t *orig_type)
6043 type_t *type = skip_typeref(orig_type);
6044 if (is_type_array(type)) {
6045 array_type_t *array_type = &type->array;
6046 type_t *element_type = array_type->element_type;
6047 unsigned qualifiers = array_type->base.qualifiers;
6049 return make_pointer_type(element_type, qualifiers);
6052 if (is_type_function(type)) {
6053 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6060 * reverts the automatic casts of array to pointer types and function
6061 * to function-pointer types as defined § 6.3.2.1
6063 type_t *revert_automatic_type_conversion(const expression_t *expression)
6065 switch (expression->kind) {
6066 case EXPR_REFERENCE: return expression->reference.declaration->type;
6069 return get_qualified_type(expression->select.compound_entry->type,
6070 expression->base.type->base.qualifiers);
6072 case EXPR_UNARY_DEREFERENCE: {
6073 const expression_t *const value = expression->unary.value;
6074 type_t *const type = skip_typeref(value->base.type);
6075 assert(is_type_pointer(type));
6076 return type->pointer.points_to;
6079 case EXPR_BUILTIN_SYMBOL:
6080 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
6082 case EXPR_ARRAY_ACCESS: {
6083 const expression_t *array_ref = expression->array_access.array_ref;
6084 type_t *type_left = skip_typeref(array_ref->base.type);
6085 if (!is_type_valid(type_left))
6087 assert(is_type_pointer(type_left));
6088 return type_left->pointer.points_to;
6091 case EXPR_STRING_LITERAL: {
6092 size_t size = expression->string.value.size;
6093 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6096 case EXPR_WIDE_STRING_LITERAL: {
6097 size_t size = expression->wide_string.value.size;
6098 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6101 case EXPR_COMPOUND_LITERAL:
6102 return expression->compound_literal.type;
6107 return expression->base.type;
6110 static expression_t *parse_reference(void)
6112 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
6114 reference_expression_t *ref = &expression->reference;
6115 symbol_t *const symbol = token.v.symbol;
6117 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
6119 if (declaration == NULL) {
6120 if (!strict_mode && look_ahead(1)->type == '(') {
6121 /* an implicitly declared function */
6122 if (warning.implicit_function_declaration) {
6123 warningf(HERE, "implicit declaration of function '%Y'",
6127 declaration = create_implicit_function(symbol, HERE);
6129 errorf(HERE, "unknown symbol '%Y' found.", symbol);
6130 declaration = create_error_declaration(symbol, STORAGE_CLASS_NONE);
6134 type_t *orig_type = declaration->type;
6136 /* we always do the auto-type conversions; the & and sizeof parser contains
6137 * code to revert this! */
6138 type_t *type = automatic_type_conversion(orig_type);
6140 ref->declaration = declaration;
6141 ref->base.type = type;
6143 /* this declaration is used */
6144 declaration->used = true;
6146 if (declaration->parent_scope != file_scope &&
6147 declaration->parent_scope->depth < current_function->scope.depth &&
6148 is_type_valid(orig_type) && !is_type_function(orig_type)) {
6149 /* access of a variable from an outer function */
6150 declaration->address_taken = true;
6151 ref->is_outer_ref = true;
6152 current_function->need_closure = true;
6155 /* check for deprecated functions */
6156 if (warning.deprecated_declarations &&
6157 declaration->modifiers & DM_DEPRECATED) {
6158 char const *const prefix = is_type_function(declaration->type) ?
6159 "function" : "variable";
6161 if (declaration->deprecated_string != NULL) {
6162 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
6163 prefix, declaration->symbol, &declaration->source_position,
6164 declaration->deprecated_string);
6166 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
6167 declaration->symbol, &declaration->source_position);
6170 if (warning.init_self && declaration == current_init_decl && !in_type_prop) {
6171 current_init_decl = NULL;
6172 warningf(HERE, "variable '%#T' is initialized by itself",
6173 declaration->type, declaration->symbol);
6180 static bool semantic_cast(expression_t *cast)
6182 expression_t *expression = cast->unary.value;
6183 type_t *orig_dest_type = cast->base.type;
6184 type_t *orig_type_right = expression->base.type;
6185 type_t const *dst_type = skip_typeref(orig_dest_type);
6186 type_t const *src_type = skip_typeref(orig_type_right);
6187 source_position_t const *pos = &cast->base.source_position;
6189 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6190 if (dst_type == type_void)
6193 /* only integer and pointer can be casted to pointer */
6194 if (is_type_pointer(dst_type) &&
6195 !is_type_pointer(src_type) &&
6196 !is_type_integer(src_type) &&
6197 is_type_valid(src_type)) {
6198 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6202 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6203 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6207 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6208 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6212 if (warning.cast_qual &&
6213 is_type_pointer(src_type) &&
6214 is_type_pointer(dst_type)) {
6215 type_t *src = skip_typeref(src_type->pointer.points_to);
6216 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6217 unsigned missing_qualifiers =
6218 src->base.qualifiers & ~dst->base.qualifiers;
6219 if (missing_qualifiers != 0) {
6221 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6222 missing_qualifiers, orig_type_right);
6228 static expression_t *parse_compound_literal(type_t *type)
6230 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6232 parse_initializer_env_t env;
6234 env.declaration = NULL;
6235 env.must_be_constant = false;
6236 initializer_t *initializer = parse_initializer(&env);
6239 expression->compound_literal.initializer = initializer;
6240 expression->compound_literal.type = type;
6241 expression->base.type = automatic_type_conversion(type);
6247 * Parse a cast expression.
6249 static expression_t *parse_cast(void)
6251 add_anchor_token(')');
6253 source_position_t source_position = token.source_position;
6255 type_t *type = parse_typename();
6257 rem_anchor_token(')');
6260 if (token.type == '{') {
6261 return parse_compound_literal(type);
6264 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6265 cast->base.source_position = source_position;
6267 expression_t *value = parse_sub_expression(20);
6268 cast->base.type = type;
6269 cast->unary.value = value;
6271 if (! semantic_cast(cast)) {
6272 /* TODO: record the error in the AST. else it is impossible to detect it */
6277 return create_invalid_expression();
6281 * Parse a statement expression.
6283 static expression_t *parse_statement_expression(void)
6285 add_anchor_token(')');
6287 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6289 statement_t *statement = parse_compound_statement(true);
6290 expression->statement.statement = statement;
6291 expression->base.source_position = statement->base.source_position;
6293 /* find last statement and use its type */
6294 type_t *type = type_void;
6295 const statement_t *stmt = statement->compound.statements;
6297 while (stmt->base.next != NULL)
6298 stmt = stmt->base.next;
6300 if (stmt->kind == STATEMENT_EXPRESSION) {
6301 type = stmt->expression.expression->base.type;
6304 warningf(&expression->base.source_position, "empty statement expression ({})");
6306 expression->base.type = type;
6308 rem_anchor_token(')');
6316 * Parse a parenthesized expression.
6318 static expression_t *parse_parenthesized_expression(void)
6322 switch(token.type) {
6324 /* gcc extension: a statement expression */
6325 return parse_statement_expression();
6329 return parse_cast();
6331 if (is_typedef_symbol(token.v.symbol)) {
6332 return parse_cast();
6336 add_anchor_token(')');
6337 expression_t *result = parse_expression();
6338 rem_anchor_token(')');
6345 static expression_t *parse_function_keyword(void)
6350 if (current_function == NULL) {
6351 errorf(HERE, "'__func__' used outside of a function");
6354 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6355 expression->base.type = type_char_ptr;
6356 expression->funcname.kind = FUNCNAME_FUNCTION;
6361 static expression_t *parse_pretty_function_keyword(void)
6363 eat(T___PRETTY_FUNCTION__);
6365 if (current_function == NULL) {
6366 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6369 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6370 expression->base.type = type_char_ptr;
6371 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6376 static expression_t *parse_funcsig_keyword(void)
6380 if (current_function == NULL) {
6381 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6384 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6385 expression->base.type = type_char_ptr;
6386 expression->funcname.kind = FUNCNAME_FUNCSIG;
6391 static expression_t *parse_funcdname_keyword(void)
6393 eat(T___FUNCDNAME__);
6395 if (current_function == NULL) {
6396 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6399 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6400 expression->base.type = type_char_ptr;
6401 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6406 static designator_t *parse_designator(void)
6408 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6409 result->source_position = *HERE;
6411 if (token.type != T_IDENTIFIER) {
6412 parse_error_expected("while parsing member designator",
6413 T_IDENTIFIER, NULL);
6416 result->symbol = token.v.symbol;
6419 designator_t *last_designator = result;
6421 if (token.type == '.') {
6423 if (token.type != T_IDENTIFIER) {
6424 parse_error_expected("while parsing member designator",
6425 T_IDENTIFIER, NULL);
6428 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6429 designator->source_position = *HERE;
6430 designator->symbol = token.v.symbol;
6433 last_designator->next = designator;
6434 last_designator = designator;
6437 if (token.type == '[') {
6439 add_anchor_token(']');
6440 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6441 designator->source_position = *HERE;
6442 designator->array_index = parse_expression();
6443 rem_anchor_token(']');
6445 if (designator->array_index == NULL) {
6449 last_designator->next = designator;
6450 last_designator = designator;
6462 * Parse the __builtin_offsetof() expression.
6464 static expression_t *parse_offsetof(void)
6466 eat(T___builtin_offsetof);
6468 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6469 expression->base.type = type_size_t;
6472 add_anchor_token(',');
6473 type_t *type = parse_typename();
6474 rem_anchor_token(',');
6476 add_anchor_token(')');
6477 designator_t *designator = parse_designator();
6478 rem_anchor_token(')');
6481 expression->offsetofe.type = type;
6482 expression->offsetofe.designator = designator;
6485 memset(&path, 0, sizeof(path));
6486 path.top_type = type;
6487 path.path = NEW_ARR_F(type_path_entry_t, 0);
6489 descend_into_subtype(&path);
6491 if (!walk_designator(&path, designator, true)) {
6492 return create_invalid_expression();
6495 DEL_ARR_F(path.path);
6499 return create_invalid_expression();
6503 * Parses a _builtin_va_start() expression.
6505 static expression_t *parse_va_start(void)
6507 eat(T___builtin_va_start);
6509 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6512 add_anchor_token(',');
6513 expression->va_starte.ap = parse_assignment_expression();
6514 rem_anchor_token(',');
6516 expression_t *const expr = parse_assignment_expression();
6517 if (expr->kind == EXPR_REFERENCE) {
6518 declaration_t *const decl = expr->reference.declaration;
6519 if (decl->parent_scope != ¤t_function->scope || decl->next != NULL) {
6520 errorf(&expr->base.source_position,
6521 "second argument of 'va_start' must be last parameter of the current function");
6523 expression->va_starte.parameter = decl;
6529 return create_invalid_expression();
6533 * Parses a _builtin_va_arg() expression.
6535 static expression_t *parse_va_arg(void)
6537 eat(T___builtin_va_arg);
6539 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6542 expression->va_arge.ap = parse_assignment_expression();
6544 expression->base.type = parse_typename();
6549 return create_invalid_expression();
6552 static expression_t *parse_builtin_symbol(void)
6554 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
6556 symbol_t *symbol = token.v.symbol;
6558 expression->builtin_symbol.symbol = symbol;
6561 type_t *type = get_builtin_symbol_type(symbol);
6562 type = automatic_type_conversion(type);
6564 expression->base.type = type;
6569 * Parses a __builtin_constant() expression.
6571 static expression_t *parse_builtin_constant(void)
6573 eat(T___builtin_constant_p);
6575 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6578 add_anchor_token(')');
6579 expression->builtin_constant.value = parse_assignment_expression();
6580 rem_anchor_token(')');
6582 expression->base.type = type_int;
6586 return create_invalid_expression();
6590 * Parses a __builtin_prefetch() expression.
6592 static expression_t *parse_builtin_prefetch(void)
6594 eat(T___builtin_prefetch);
6596 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
6599 add_anchor_token(')');
6600 expression->builtin_prefetch.adr = parse_assignment_expression();
6601 if (token.type == ',') {
6603 expression->builtin_prefetch.rw = parse_assignment_expression();
6605 if (token.type == ',') {
6607 expression->builtin_prefetch.locality = parse_assignment_expression();
6609 rem_anchor_token(')');
6611 expression->base.type = type_void;
6615 return create_invalid_expression();
6619 * Parses a __builtin_is_*() compare expression.
6621 static expression_t *parse_compare_builtin(void)
6623 expression_t *expression;
6625 switch(token.type) {
6626 case T___builtin_isgreater:
6627 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6629 case T___builtin_isgreaterequal:
6630 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6632 case T___builtin_isless:
6633 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6635 case T___builtin_islessequal:
6636 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6638 case T___builtin_islessgreater:
6639 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6641 case T___builtin_isunordered:
6642 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6645 internal_errorf(HERE, "invalid compare builtin found");
6647 expression->base.source_position = *HERE;
6651 expression->binary.left = parse_assignment_expression();
6653 expression->binary.right = parse_assignment_expression();
6656 type_t *const orig_type_left = expression->binary.left->base.type;
6657 type_t *const orig_type_right = expression->binary.right->base.type;
6659 type_t *const type_left = skip_typeref(orig_type_left);
6660 type_t *const type_right = skip_typeref(orig_type_right);
6661 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6662 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6663 type_error_incompatible("invalid operands in comparison",
6664 &expression->base.source_position, orig_type_left, orig_type_right);
6667 semantic_comparison(&expression->binary);
6672 return create_invalid_expression();
6677 * Parses a __builtin_expect() expression.
6679 static expression_t *parse_builtin_expect(void)
6681 eat(T___builtin_expect);
6683 expression_t *expression
6684 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
6687 expression->binary.left = parse_assignment_expression();
6689 expression->binary.right = parse_constant_expression();
6692 expression->base.type = expression->binary.left->base.type;
6696 return create_invalid_expression();
6701 * Parses a MS assume() expression.
6703 static expression_t *parse_assume(void)
6707 expression_t *expression
6708 = allocate_expression_zero(EXPR_UNARY_ASSUME);
6711 add_anchor_token(')');
6712 expression->unary.value = parse_assignment_expression();
6713 rem_anchor_token(')');
6716 expression->base.type = type_void;
6719 return create_invalid_expression();
6723 * Return the declaration for a given label symbol or create a new one.
6725 * @param symbol the symbol of the label
6727 static declaration_t *get_label(symbol_t *symbol)
6729 declaration_t *candidate;
6730 assert(current_function != NULL);
6732 candidate = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
6733 /* if we found a local label, we already created the declaration */
6734 if (candidate != NULL) {
6735 if (candidate->parent_scope != scope) {
6736 assert(candidate->parent_scope->depth < scope->depth);
6737 current_function->goto_to_outer = true;
6742 candidate = get_declaration(symbol, NAMESPACE_LABEL);
6743 /* if we found a label in the same function, then we already created the
6745 if (candidate != NULL
6746 && candidate->parent_scope == ¤t_function->scope) {
6750 /* otherwise we need to create a new one */
6751 declaration_t *const declaration = allocate_declaration_zero();
6752 declaration->namespc = NAMESPACE_LABEL;
6753 declaration->symbol = symbol;
6755 label_push(declaration);
6761 * Parses a GNU && label address expression.
6763 static expression_t *parse_label_address(void)
6765 source_position_t source_position = token.source_position;
6767 if (token.type != T_IDENTIFIER) {
6768 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6771 symbol_t *symbol = token.v.symbol;
6774 declaration_t *label = get_label(symbol);
6777 label->address_taken = true;
6779 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6780 expression->base.source_position = source_position;
6782 /* label address is threaten as a void pointer */
6783 expression->base.type = type_void_ptr;
6784 expression->label_address.declaration = label;
6787 return create_invalid_expression();
6791 * Parse a microsoft __noop expression.
6793 static expression_t *parse_noop_expression(void)
6795 source_position_t source_position = *HERE;
6798 if (token.type == '(') {
6799 /* parse arguments */
6801 add_anchor_token(')');
6802 add_anchor_token(',');
6804 if (token.type != ')') {
6806 (void)parse_assignment_expression();
6807 if (token.type != ',')
6813 rem_anchor_token(',');
6814 rem_anchor_token(')');
6817 /* the result is a (int)0 */
6818 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6819 cnst->base.source_position = source_position;
6820 cnst->base.type = type_int;
6821 cnst->conste.v.int_value = 0;
6822 cnst->conste.is_ms_noop = true;
6827 return create_invalid_expression();
6831 * Parses a primary expression.
6833 static expression_t *parse_primary_expression(void)
6835 switch (token.type) {
6836 case T_INTEGER: return parse_int_const();
6837 case T_CHARACTER_CONSTANT: return parse_character_constant();
6838 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6839 case T_FLOATINGPOINT: return parse_float_const();
6840 case T_STRING_LITERAL:
6841 case T_WIDE_STRING_LITERAL: return parse_string_const();
6842 case T_IDENTIFIER: return parse_reference();
6843 case T___FUNCTION__:
6844 case T___func__: return parse_function_keyword();
6845 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6846 case T___FUNCSIG__: return parse_funcsig_keyword();
6847 case T___FUNCDNAME__: return parse_funcdname_keyword();
6848 case T___builtin_offsetof: return parse_offsetof();
6849 case T___builtin_va_start: return parse_va_start();
6850 case T___builtin_va_arg: return parse_va_arg();
6851 case T___builtin_expect:
6852 case T___builtin_alloca:
6853 case T___builtin_inf:
6854 case T___builtin_inff:
6855 case T___builtin_infl:
6856 case T___builtin_nan:
6857 case T___builtin_nanf:
6858 case T___builtin_nanl:
6859 case T___builtin_huge_val:
6860 case T___builtin_va_end: return parse_builtin_symbol();
6861 case T___builtin_isgreater:
6862 case T___builtin_isgreaterequal:
6863 case T___builtin_isless:
6864 case T___builtin_islessequal:
6865 case T___builtin_islessgreater:
6866 case T___builtin_isunordered: return parse_compare_builtin();
6867 case T___builtin_constant_p: return parse_builtin_constant();
6868 case T___builtin_prefetch: return parse_builtin_prefetch();
6869 case T__assume: return parse_assume();
6872 return parse_label_address();
6875 case '(': return parse_parenthesized_expression();
6876 case T___noop: return parse_noop_expression();
6879 errorf(HERE, "unexpected token %K, expected an expression", &token);
6880 return create_invalid_expression();
6884 * Check if the expression has the character type and issue a warning then.
6886 static void check_for_char_index_type(const expression_t *expression)
6888 type_t *const type = expression->base.type;
6889 const type_t *const base_type = skip_typeref(type);
6891 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
6892 warning.char_subscripts) {
6893 warningf(&expression->base.source_position,
6894 "array subscript has type '%T'", type);
6898 static expression_t *parse_array_expression(unsigned precedence,
6904 add_anchor_token(']');
6906 expression_t *inside = parse_expression();
6908 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6910 array_access_expression_t *array_access = &expression->array_access;
6912 type_t *const orig_type_left = left->base.type;
6913 type_t *const orig_type_inside = inside->base.type;
6915 type_t *const type_left = skip_typeref(orig_type_left);
6916 type_t *const type_inside = skip_typeref(orig_type_inside);
6918 type_t *return_type;
6919 if (is_type_pointer(type_left)) {
6920 return_type = type_left->pointer.points_to;
6921 array_access->array_ref = left;
6922 array_access->index = inside;
6923 check_for_char_index_type(inside);
6924 } else if (is_type_pointer(type_inside)) {
6925 return_type = type_inside->pointer.points_to;
6926 array_access->array_ref = inside;
6927 array_access->index = left;
6928 array_access->flipped = true;
6929 check_for_char_index_type(left);
6931 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6933 "array access on object with non-pointer types '%T', '%T'",
6934 orig_type_left, orig_type_inside);
6936 return_type = type_error_type;
6937 array_access->array_ref = left;
6938 array_access->index = inside;
6941 expression->base.type = automatic_type_conversion(return_type);
6943 rem_anchor_token(']');
6944 if (token.type == ']') {
6947 parse_error_expected("Problem while parsing array access", ']', NULL);
6952 static expression_t *parse_typeprop(expression_kind_t const kind,
6953 source_position_t const pos,
6954 unsigned const precedence)
6956 expression_t *tp_expression = allocate_expression_zero(kind);
6957 tp_expression->base.type = type_size_t;
6958 tp_expression->base.source_position = pos;
6960 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6962 /* we only refer to a type property, mark this case */
6963 bool old = in_type_prop;
6964 in_type_prop = true;
6965 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
6967 add_anchor_token(')');
6968 type_t* const orig_type = parse_typename();
6969 tp_expression->typeprop.type = orig_type;
6971 type_t const* const type = skip_typeref(orig_type);
6972 char const* const wrong_type =
6973 is_type_incomplete(type) ? "incomplete" :
6974 type->kind == TYPE_FUNCTION ? "function designator" :
6975 type->kind == TYPE_BITFIELD ? "bitfield" :
6977 if (wrong_type != NULL) {
6978 errorf(&pos, "operand of %s expression must not be %s type '%T'",
6979 what, wrong_type, type);
6982 rem_anchor_token(')');
6985 expression_t *expression = parse_sub_expression(precedence);
6987 type_t* const orig_type = revert_automatic_type_conversion(expression);
6988 expression->base.type = orig_type;
6990 type_t const* const type = skip_typeref(orig_type);
6991 char const* const wrong_type =
6992 is_type_incomplete(type) ? "incomplete" :
6993 type->kind == TYPE_FUNCTION ? "function designator" :
6994 type->kind == TYPE_BITFIELD ? "bitfield" :
6996 if (wrong_type != NULL) {
6997 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
7000 tp_expression->typeprop.type = expression->base.type;
7001 tp_expression->typeprop.tp_expression = expression;
7006 return tp_expression;
7009 static expression_t *parse_sizeof(unsigned precedence)
7011 source_position_t pos = *HERE;
7013 return parse_typeprop(EXPR_SIZEOF, pos, precedence);
7016 static expression_t *parse_alignof(unsigned precedence)
7018 source_position_t pos = *HERE;
7020 return parse_typeprop(EXPR_ALIGNOF, pos, precedence);
7023 static expression_t *parse_select_expression(unsigned precedence,
7024 expression_t *compound)
7027 assert(token.type == '.' || token.type == T_MINUSGREATER);
7029 bool is_pointer = (token.type == T_MINUSGREATER);
7032 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7033 select->select.compound = compound;
7035 if (token.type != T_IDENTIFIER) {
7036 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7039 symbol_t *symbol = token.v.symbol;
7042 type_t *const orig_type = compound->base.type;
7043 type_t *const type = skip_typeref(orig_type);
7046 bool saw_error = false;
7047 if (is_type_pointer(type)) {
7050 "request for member '%Y' in something not a struct or union, but '%T'",
7054 type_left = skip_typeref(type->pointer.points_to);
7056 if (is_pointer && is_type_valid(type)) {
7057 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7063 declaration_t *entry;
7064 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7065 type_left->kind == TYPE_COMPOUND_UNION) {
7066 declaration_t *const declaration = type_left->compound.declaration;
7068 if (!declaration->init.complete) {
7069 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7071 goto create_error_entry;
7074 entry = find_compound_entry(declaration, symbol);
7075 if (entry == NULL) {
7076 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7077 goto create_error_entry;
7080 if (is_type_valid(type_left) && !saw_error) {
7082 "request for member '%Y' in something not a struct or union, but '%T'",
7086 entry = allocate_declaration_zero();
7087 entry->symbol = symbol;
7090 select->select.compound_entry = entry;
7092 type_t *const res_type =
7093 get_qualified_type(entry->type, type_left->base.qualifiers);
7095 /* we always do the auto-type conversions; the & and sizeof parser contains
7096 * code to revert this! */
7097 select->base.type = automatic_type_conversion(res_type);
7099 type_t *skipped = skip_typeref(res_type);
7100 if (skipped->kind == TYPE_BITFIELD) {
7101 select->base.type = skipped->bitfield.base_type;
7107 static void check_call_argument(const function_parameter_t *parameter,
7108 call_argument_t *argument, unsigned pos)
7110 type_t *expected_type = parameter->type;
7111 type_t *expected_type_skip = skip_typeref(expected_type);
7112 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7113 expression_t *arg_expr = argument->expression;
7114 type_t *arg_type = skip_typeref(arg_expr->base.type);
7116 /* handle transparent union gnu extension */
7117 if (is_type_union(expected_type_skip)
7118 && (expected_type_skip->base.modifiers
7119 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
7120 declaration_t *union_decl = expected_type_skip->compound.declaration;
7122 declaration_t *declaration = union_decl->scope.declarations;
7123 type_t *best_type = NULL;
7124 for ( ; declaration != NULL; declaration = declaration->next) {
7125 type_t *decl_type = declaration->type;
7126 error = semantic_assign(decl_type, arg_expr);
7127 if (error == ASSIGN_ERROR_INCOMPATIBLE
7128 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7131 if (error == ASSIGN_SUCCESS) {
7132 best_type = decl_type;
7133 } else if (best_type == NULL) {
7134 best_type = decl_type;
7138 if (best_type != NULL) {
7139 expected_type = best_type;
7143 error = semantic_assign(expected_type, arg_expr);
7144 argument->expression = create_implicit_cast(argument->expression,
7147 if (error != ASSIGN_SUCCESS) {
7148 /* report exact scope in error messages (like "in argument 3") */
7150 snprintf(buf, sizeof(buf), "call argument %u", pos);
7151 report_assign_error(error, expected_type, arg_expr, buf,
7152 &arg_expr->base.source_position);
7153 } else if (warning.traditional || warning.conversion) {
7154 type_t *const promoted_type = get_default_promoted_type(arg_type);
7155 if (!types_compatible(expected_type_skip, promoted_type) &&
7156 !types_compatible(expected_type_skip, type_void_ptr) &&
7157 !types_compatible(type_void_ptr, promoted_type)) {
7158 /* Deliberately show the skipped types in this warning */
7159 warningf(&arg_expr->base.source_position,
7160 "passing call argument %u as '%T' rather than '%T' due to prototype",
7161 pos, expected_type_skip, promoted_type);
7167 * Parse a call expression, ie. expression '( ... )'.
7169 * @param expression the function address
7171 static expression_t *parse_call_expression(unsigned precedence,
7172 expression_t *expression)
7175 expression_t *result = allocate_expression_zero(EXPR_CALL);
7176 result->base.source_position = expression->base.source_position;
7178 call_expression_t *call = &result->call;
7179 call->function = expression;
7181 type_t *const orig_type = expression->base.type;
7182 type_t *const type = skip_typeref(orig_type);
7184 function_type_t *function_type = NULL;
7185 if (is_type_pointer(type)) {
7186 type_t *const to_type = skip_typeref(type->pointer.points_to);
7188 if (is_type_function(to_type)) {
7189 function_type = &to_type->function;
7190 call->base.type = function_type->return_type;
7194 if (function_type == NULL && is_type_valid(type)) {
7195 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
7198 /* parse arguments */
7200 add_anchor_token(')');
7201 add_anchor_token(',');
7203 if (token.type != ')') {
7204 call_argument_t *last_argument = NULL;
7207 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7209 argument->expression = parse_assignment_expression();
7210 if (last_argument == NULL) {
7211 call->arguments = argument;
7213 last_argument->next = argument;
7215 last_argument = argument;
7217 if (token.type != ',')
7222 rem_anchor_token(',');
7223 rem_anchor_token(')');
7226 if (function_type == NULL)
7229 function_parameter_t *parameter = function_type->parameters;
7230 call_argument_t *argument = call->arguments;
7231 if (!function_type->unspecified_parameters) {
7232 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7233 parameter = parameter->next, argument = argument->next) {
7234 check_call_argument(parameter, argument, ++pos);
7237 if (parameter != NULL) {
7238 errorf(HERE, "too few arguments to function '%E'", expression);
7239 } else if (argument != NULL && !function_type->variadic) {
7240 errorf(HERE, "too many arguments to function '%E'", expression);
7244 /* do default promotion */
7245 for( ; argument != NULL; argument = argument->next) {
7246 type_t *type = argument->expression->base.type;
7248 type = get_default_promoted_type(type);
7250 argument->expression
7251 = create_implicit_cast(argument->expression, type);
7254 check_format(&result->call);
7256 if (warning.aggregate_return &&
7257 is_type_compound(skip_typeref(function_type->return_type))) {
7258 warningf(&result->base.source_position,
7259 "function call has aggregate value");
7266 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7268 static bool same_compound_type(const type_t *type1, const type_t *type2)
7271 is_type_compound(type1) &&
7272 type1->kind == type2->kind &&
7273 type1->compound.declaration == type2->compound.declaration;
7277 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7279 * @param expression the conditional expression
7281 static expression_t *parse_conditional_expression(unsigned precedence,
7282 expression_t *expression)
7284 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7286 conditional_expression_t *conditional = &result->conditional;
7287 conditional->base.source_position = *HERE;
7288 conditional->condition = expression;
7291 add_anchor_token(':');
7294 type_t *const condition_type_orig = expression->base.type;
7295 type_t *const condition_type = skip_typeref(condition_type_orig);
7296 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
7297 type_error("expected a scalar type in conditional condition",
7298 &expression->base.source_position, condition_type_orig);
7301 expression_t *true_expression = expression;
7302 bool gnu_cond = false;
7303 if (GNU_MODE && token.type == ':') {
7306 true_expression = parse_expression();
7307 rem_anchor_token(':');
7309 expression_t *false_expression = parse_sub_expression(precedence);
7311 type_t *const orig_true_type = true_expression->base.type;
7312 type_t *const orig_false_type = false_expression->base.type;
7313 type_t *const true_type = skip_typeref(orig_true_type);
7314 type_t *const false_type = skip_typeref(orig_false_type);
7317 type_t *result_type;
7318 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7319 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7320 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID)
7321 || !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7322 warningf(&conditional->base.source_position,
7323 "ISO C forbids conditional expression with only one void side");
7325 result_type = type_void;
7326 } else if (is_type_arithmetic(true_type)
7327 && is_type_arithmetic(false_type)) {
7328 result_type = semantic_arithmetic(true_type, false_type);
7330 true_expression = create_implicit_cast(true_expression, result_type);
7331 false_expression = create_implicit_cast(false_expression, result_type);
7333 conditional->true_expression = true_expression;
7334 conditional->false_expression = false_expression;
7335 conditional->base.type = result_type;
7336 } else if (same_compound_type(true_type, false_type)) {
7337 /* just take 1 of the 2 types */
7338 result_type = true_type;
7339 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7340 type_t *pointer_type;
7342 expression_t *other_expression;
7343 if (is_type_pointer(true_type) &&
7344 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7345 pointer_type = true_type;
7346 other_type = false_type;
7347 other_expression = false_expression;
7349 pointer_type = false_type;
7350 other_type = true_type;
7351 other_expression = true_expression;
7354 if (is_null_pointer_constant(other_expression)) {
7355 result_type = pointer_type;
7356 } else if (is_type_pointer(other_type)) {
7357 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7358 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7361 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7362 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7364 } else if (types_compatible(get_unqualified_type(to1),
7365 get_unqualified_type(to2))) {
7368 warningf(&conditional->base.source_position,
7369 "pointer types '%T' and '%T' in conditional expression are incompatible",
7370 true_type, false_type);
7374 type_t *const type =
7375 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7376 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7377 } else if (is_type_integer(other_type)) {
7378 warningf(&conditional->base.source_position,
7379 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7380 result_type = pointer_type;
7382 type_error_incompatible("while parsing conditional",
7383 &expression->base.source_position, true_type, false_type);
7384 result_type = type_error_type;
7387 /* TODO: one pointer to void*, other some pointer */
7389 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7390 type_error_incompatible("while parsing conditional",
7391 &conditional->base.source_position, true_type,
7394 result_type = type_error_type;
7397 conditional->true_expression
7398 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7399 conditional->false_expression
7400 = create_implicit_cast(false_expression, result_type);
7401 conditional->base.type = result_type;
7404 return create_invalid_expression();
7408 * Parse an extension expression.
7410 static expression_t *parse_extension(unsigned precedence)
7412 eat(T___extension__);
7414 bool old_gcc_extension = in_gcc_extension;
7415 in_gcc_extension = true;
7416 expression_t *expression = parse_sub_expression(precedence);
7417 in_gcc_extension = old_gcc_extension;
7422 * Parse a __builtin_classify_type() expression.
7424 static expression_t *parse_builtin_classify_type(const unsigned precedence)
7426 eat(T___builtin_classify_type);
7428 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7429 result->base.type = type_int;
7432 add_anchor_token(')');
7433 expression_t *expression = parse_sub_expression(precedence);
7434 rem_anchor_token(')');
7436 result->classify_type.type_expression = expression;
7440 return create_invalid_expression();
7443 static bool check_pointer_arithmetic(const source_position_t *source_position,
7444 type_t *pointer_type,
7445 type_t *orig_pointer_type)
7447 type_t *points_to = pointer_type->pointer.points_to;
7448 points_to = skip_typeref(points_to);
7450 if (is_type_incomplete(points_to)) {
7451 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7452 errorf(source_position,
7453 "arithmetic with pointer to incomplete type '%T' not allowed",
7456 } else if (warning.pointer_arith) {
7457 warningf(source_position,
7458 "pointer of type '%T' used in arithmetic",
7461 } else if (is_type_function(points_to)) {
7463 errorf(source_position,
7464 "arithmetic with pointer to function type '%T' not allowed",
7467 } else if (warning.pointer_arith) {
7468 warningf(source_position,
7469 "pointer to a function '%T' used in arithmetic",
7476 static bool is_lvalue(const expression_t *expression)
7478 switch (expression->kind) {
7479 case EXPR_REFERENCE:
7480 case EXPR_ARRAY_ACCESS:
7482 case EXPR_UNARY_DEREFERENCE:
7486 /* Claim it is an lvalue, if the type is invalid. There was a parse
7487 * error before, which maybe prevented properly recognizing it as
7489 return !is_type_valid(skip_typeref(expression->base.type));
7493 static void semantic_incdec(unary_expression_t *expression)
7495 type_t *const orig_type = expression->value->base.type;
7496 type_t *const type = skip_typeref(orig_type);
7497 if (is_type_pointer(type)) {
7498 if (!check_pointer_arithmetic(&expression->base.source_position,
7502 } else if (!is_type_real(type) && is_type_valid(type)) {
7503 /* TODO: improve error message */
7504 errorf(&expression->base.source_position,
7505 "operation needs an arithmetic or pointer type");
7508 if (!is_lvalue(expression->value)) {
7509 /* TODO: improve error message */
7510 errorf(&expression->base.source_position, "lvalue required as operand");
7512 expression->base.type = orig_type;
7515 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7517 type_t *const orig_type = expression->value->base.type;
7518 type_t *const type = skip_typeref(orig_type);
7519 if (!is_type_arithmetic(type)) {
7520 if (is_type_valid(type)) {
7521 /* TODO: improve error message */
7522 errorf(&expression->base.source_position,
7523 "operation needs an arithmetic type");
7528 expression->base.type = orig_type;
7531 static void semantic_unexpr_plus(unary_expression_t *expression)
7533 semantic_unexpr_arithmetic(expression);
7534 if (warning.traditional)
7535 warningf(&expression->base.source_position,
7536 "traditional C rejects the unary plus operator");
7539 static expression_t const *get_reference_address(expression_t const *expr)
7541 bool regular_take_address = true;
7543 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7544 expr = expr->unary.value;
7546 regular_take_address = false;
7549 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7552 expr = expr->unary.value;
7555 if (expr->kind != EXPR_REFERENCE)
7558 if (!regular_take_address &&
7559 !is_type_function(skip_typeref(expr->reference.declaration->type))) {
7566 static void warn_function_address_as_bool(expression_t const* expr)
7568 if (!warning.address)
7571 expr = get_reference_address(expr);
7573 warningf(&expr->base.source_position,
7574 "the address of '%Y' will always evaluate as 'true'",
7575 expr->reference.declaration->symbol);
7579 static void semantic_not(unary_expression_t *expression)
7581 type_t *const orig_type = expression->value->base.type;
7582 type_t *const type = skip_typeref(orig_type);
7583 if (!is_type_scalar(type) && is_type_valid(type)) {
7584 errorf(&expression->base.source_position,
7585 "operand of ! must be of scalar type");
7588 warn_function_address_as_bool(expression->value);
7590 expression->base.type = type_int;
7593 static void semantic_unexpr_integer(unary_expression_t *expression)
7595 type_t *const orig_type = expression->value->base.type;
7596 type_t *const type = skip_typeref(orig_type);
7597 if (!is_type_integer(type)) {
7598 if (is_type_valid(type)) {
7599 errorf(&expression->base.source_position,
7600 "operand of ~ must be of integer type");
7605 expression->base.type = orig_type;
7608 static void semantic_dereference(unary_expression_t *expression)
7610 type_t *const orig_type = expression->value->base.type;
7611 type_t *const type = skip_typeref(orig_type);
7612 if (!is_type_pointer(type)) {
7613 if (is_type_valid(type)) {
7614 errorf(&expression->base.source_position,
7615 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7620 type_t *result_type = type->pointer.points_to;
7621 result_type = automatic_type_conversion(result_type);
7622 expression->base.type = result_type;
7626 * Record that an address is taken (expression represents an lvalue).
7628 * @param expression the expression
7629 * @param may_be_register if true, the expression might be an register
7631 static void set_address_taken(expression_t *expression, bool may_be_register)
7633 if (expression->kind != EXPR_REFERENCE)
7636 declaration_t *const declaration = expression->reference.declaration;
7637 /* happens for parse errors */
7638 if (declaration == NULL)
7641 if (declaration->storage_class == STORAGE_CLASS_REGISTER && !may_be_register) {
7642 errorf(&expression->base.source_position,
7643 "address of register variable '%Y' requested",
7644 declaration->symbol);
7646 declaration->address_taken = 1;
7651 * Check the semantic of the address taken expression.
7653 static void semantic_take_addr(unary_expression_t *expression)
7655 expression_t *value = expression->value;
7656 value->base.type = revert_automatic_type_conversion(value);
7658 type_t *orig_type = value->base.type;
7659 if (!is_type_valid(skip_typeref(orig_type)))
7662 set_address_taken(value, false);
7664 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7667 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
7668 static expression_t *parse_##unexpression_type(unsigned precedence) \
7670 expression_t *unary_expression \
7671 = allocate_expression_zero(unexpression_type); \
7672 unary_expression->base.source_position = *HERE; \
7674 unary_expression->unary.value = parse_sub_expression(precedence); \
7676 sfunc(&unary_expression->unary); \
7678 return unary_expression; \
7681 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7682 semantic_unexpr_arithmetic)
7683 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7684 semantic_unexpr_plus)
7685 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7687 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7688 semantic_dereference)
7689 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7691 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7692 semantic_unexpr_integer)
7693 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7695 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7698 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
7700 static expression_t *parse_##unexpression_type(unsigned precedence, \
7701 expression_t *left) \
7703 (void) precedence; \
7705 expression_t *unary_expression \
7706 = allocate_expression_zero(unexpression_type); \
7707 unary_expression->base.source_position = *HERE; \
7709 unary_expression->unary.value = left; \
7711 sfunc(&unary_expression->unary); \
7713 return unary_expression; \
7716 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7717 EXPR_UNARY_POSTFIX_INCREMENT,
7719 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7720 EXPR_UNARY_POSTFIX_DECREMENT,
7723 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7725 /* TODO: handle complex + imaginary types */
7727 type_left = get_unqualified_type(type_left);
7728 type_right = get_unqualified_type(type_right);
7730 /* § 6.3.1.8 Usual arithmetic conversions */
7731 if (type_left == type_long_double || type_right == type_long_double) {
7732 return type_long_double;
7733 } else if (type_left == type_double || type_right == type_double) {
7735 } else if (type_left == type_float || type_right == type_float) {
7739 type_left = promote_integer(type_left);
7740 type_right = promote_integer(type_right);
7742 if (type_left == type_right)
7745 bool const signed_left = is_type_signed(type_left);
7746 bool const signed_right = is_type_signed(type_right);
7747 int const rank_left = get_rank(type_left);
7748 int const rank_right = get_rank(type_right);
7750 if (signed_left == signed_right)
7751 return rank_left >= rank_right ? type_left : type_right;
7760 u_rank = rank_right;
7761 u_type = type_right;
7763 s_rank = rank_right;
7764 s_type = type_right;
7769 if (u_rank >= s_rank)
7772 /* casting rank to atomic_type_kind is a bit hacky, but makes things
7774 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
7775 > get_atomic_type_size((atomic_type_kind_t) u_rank))
7779 case ATOMIC_TYPE_INT: return type_unsigned_int;
7780 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7781 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7783 default: panic("invalid atomic type");
7788 * Check the semantic restrictions for a binary expression.
7790 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7792 expression_t *const left = expression->left;
7793 expression_t *const right = expression->right;
7794 type_t *const orig_type_left = left->base.type;
7795 type_t *const orig_type_right = right->base.type;
7796 type_t *const type_left = skip_typeref(orig_type_left);
7797 type_t *const type_right = skip_typeref(orig_type_right);
7799 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7800 /* TODO: improve error message */
7801 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7802 errorf(&expression->base.source_position,
7803 "operation needs arithmetic types");
7808 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7809 expression->left = create_implicit_cast(left, arithmetic_type);
7810 expression->right = create_implicit_cast(right, arithmetic_type);
7811 expression->base.type = arithmetic_type;
7814 static void warn_div_by_zero(binary_expression_t const *const expression)
7816 if (!warning.div_by_zero ||
7817 !is_type_integer(expression->base.type))
7820 expression_t const *const right = expression->right;
7821 /* The type of the right operand can be different for /= */
7822 if (is_type_integer(right->base.type) &&
7823 is_constant_expression(right) &&
7824 fold_constant(right) == 0) {
7825 warningf(&expression->base.source_position, "division by zero");
7830 * Check the semantic restrictions for a div/mod expression.
7832 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
7833 semantic_binexpr_arithmetic(expression);
7834 warn_div_by_zero(expression);
7837 static void semantic_shift_op(binary_expression_t *expression)
7839 expression_t *const left = expression->left;
7840 expression_t *const right = expression->right;
7841 type_t *const orig_type_left = left->base.type;
7842 type_t *const orig_type_right = right->base.type;
7843 type_t * type_left = skip_typeref(orig_type_left);
7844 type_t * type_right = skip_typeref(orig_type_right);
7846 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7847 /* TODO: improve error message */
7848 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7849 errorf(&expression->base.source_position,
7850 "operands of shift operation must have integer types");
7855 type_left = promote_integer(type_left);
7856 type_right = promote_integer(type_right);
7858 expression->left = create_implicit_cast(left, type_left);
7859 expression->right = create_implicit_cast(right, type_right);
7860 expression->base.type = type_left;
7863 static void semantic_add(binary_expression_t *expression)
7865 expression_t *const left = expression->left;
7866 expression_t *const right = expression->right;
7867 type_t *const orig_type_left = left->base.type;
7868 type_t *const orig_type_right = right->base.type;
7869 type_t *const type_left = skip_typeref(orig_type_left);
7870 type_t *const type_right = skip_typeref(orig_type_right);
7873 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7874 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7875 expression->left = create_implicit_cast(left, arithmetic_type);
7876 expression->right = create_implicit_cast(right, arithmetic_type);
7877 expression->base.type = arithmetic_type;
7879 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7880 check_pointer_arithmetic(&expression->base.source_position,
7881 type_left, orig_type_left);
7882 expression->base.type = type_left;
7883 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7884 check_pointer_arithmetic(&expression->base.source_position,
7885 type_right, orig_type_right);
7886 expression->base.type = type_right;
7887 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7888 errorf(&expression->base.source_position,
7889 "invalid operands to binary + ('%T', '%T')",
7890 orig_type_left, orig_type_right);
7894 static void semantic_sub(binary_expression_t *expression)
7896 expression_t *const left = expression->left;
7897 expression_t *const right = expression->right;
7898 type_t *const orig_type_left = left->base.type;
7899 type_t *const orig_type_right = right->base.type;
7900 type_t *const type_left = skip_typeref(orig_type_left);
7901 type_t *const type_right = skip_typeref(orig_type_right);
7902 source_position_t const *const pos = &expression->base.source_position;
7905 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7906 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7907 expression->left = create_implicit_cast(left, arithmetic_type);
7908 expression->right = create_implicit_cast(right, arithmetic_type);
7909 expression->base.type = arithmetic_type;
7911 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7912 check_pointer_arithmetic(&expression->base.source_position,
7913 type_left, orig_type_left);
7914 expression->base.type = type_left;
7915 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7916 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7917 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7918 if (!types_compatible(unqual_left, unqual_right)) {
7920 "subtracting pointers to incompatible types '%T' and '%T'",
7921 orig_type_left, orig_type_right);
7922 } else if (!is_type_object(unqual_left)) {
7923 if (is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
7924 warningf(pos, "subtracting pointers to void");
7926 errorf(pos, "subtracting pointers to non-object types '%T'",
7930 expression->base.type = type_ptrdiff_t;
7931 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7932 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7933 orig_type_left, orig_type_right);
7937 static void warn_string_literal_address(expression_t const* expr)
7939 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7940 expr = expr->unary.value;
7941 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7943 expr = expr->unary.value;
7946 if (expr->kind == EXPR_STRING_LITERAL ||
7947 expr->kind == EXPR_WIDE_STRING_LITERAL) {
7948 warningf(&expr->base.source_position,
7949 "comparison with string literal results in unspecified behaviour");
7954 * Check the semantics of comparison expressions.
7956 * @param expression The expression to check.
7958 static void semantic_comparison(binary_expression_t *expression)
7960 expression_t *left = expression->left;
7961 expression_t *right = expression->right;
7963 if (warning.address) {
7964 warn_string_literal_address(left);
7965 warn_string_literal_address(right);
7967 expression_t const* const func_left = get_reference_address(left);
7968 if (func_left != NULL && is_null_pointer_constant(right)) {
7969 warningf(&expression->base.source_position,
7970 "the address of '%Y' will never be NULL",
7971 func_left->reference.declaration->symbol);
7974 expression_t const* const func_right = get_reference_address(right);
7975 if (func_right != NULL && is_null_pointer_constant(right)) {
7976 warningf(&expression->base.source_position,
7977 "the address of '%Y' will never be NULL",
7978 func_right->reference.declaration->symbol);
7982 type_t *orig_type_left = left->base.type;
7983 type_t *orig_type_right = right->base.type;
7984 type_t *type_left = skip_typeref(orig_type_left);
7985 type_t *type_right = skip_typeref(orig_type_right);
7987 /* TODO non-arithmetic types */
7988 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7989 /* test for signed vs unsigned compares */
7990 if (warning.sign_compare &&
7991 (expression->base.kind != EXPR_BINARY_EQUAL &&
7992 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
7993 (is_type_signed(type_left) != is_type_signed(type_right))) {
7995 /* check if 1 of the operands is a constant, in this case we just
7996 * check wether we can safely represent the resulting constant in
7997 * the type of the other operand. */
7998 expression_t *const_expr = NULL;
7999 expression_t *other_expr = NULL;
8001 if (is_constant_expression(left)) {
8004 } else if (is_constant_expression(right)) {
8009 if (const_expr != NULL) {
8010 type_t *other_type = skip_typeref(other_expr->base.type);
8011 long val = fold_constant(const_expr);
8012 /* TODO: check if val can be represented by other_type */
8016 warningf(&expression->base.source_position,
8017 "comparison between signed and unsigned");
8019 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8020 expression->left = create_implicit_cast(left, arithmetic_type);
8021 expression->right = create_implicit_cast(right, arithmetic_type);
8022 expression->base.type = arithmetic_type;
8023 if (warning.float_equal &&
8024 (expression->base.kind == EXPR_BINARY_EQUAL ||
8025 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8026 is_type_float(arithmetic_type)) {
8027 warningf(&expression->base.source_position,
8028 "comparing floating point with == or != is unsafe");
8030 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8031 /* TODO check compatibility */
8032 } else if (is_type_pointer(type_left)) {
8033 expression->right = create_implicit_cast(right, type_left);
8034 } else if (is_type_pointer(type_right)) {
8035 expression->left = create_implicit_cast(left, type_right);
8036 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8037 type_error_incompatible("invalid operands in comparison",
8038 &expression->base.source_position,
8039 type_left, type_right);
8041 expression->base.type = type_int;
8045 * Checks if a compound type has constant fields.
8047 static bool has_const_fields(const compound_type_t *type)
8049 const scope_t *scope = &type->declaration->scope;
8050 const declaration_t *declaration = scope->declarations;
8052 for (; declaration != NULL; declaration = declaration->next) {
8053 if (declaration->namespc != NAMESPACE_NORMAL)
8056 const type_t *decl_type = skip_typeref(declaration->type);
8057 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8064 static bool is_valid_assignment_lhs(expression_t const* const left)
8066 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8067 type_t *const type_left = skip_typeref(orig_type_left);
8069 if (!is_lvalue(left)) {
8070 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8075 if (is_type_array(type_left)) {
8076 errorf(HERE, "cannot assign to arrays ('%E')", left);
8079 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8080 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8084 if (is_type_incomplete(type_left)) {
8085 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8086 left, orig_type_left);
8089 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8090 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8091 left, orig_type_left);
8098 static void semantic_arithmetic_assign(binary_expression_t *expression)
8100 expression_t *left = expression->left;
8101 expression_t *right = expression->right;
8102 type_t *orig_type_left = left->base.type;
8103 type_t *orig_type_right = right->base.type;
8105 if (!is_valid_assignment_lhs(left))
8108 type_t *type_left = skip_typeref(orig_type_left);
8109 type_t *type_right = skip_typeref(orig_type_right);
8111 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8112 /* TODO: improve error message */
8113 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8114 errorf(&expression->base.source_position,
8115 "operation needs arithmetic types");
8120 /* combined instructions are tricky. We can't create an implicit cast on
8121 * the left side, because we need the uncasted form for the store.
8122 * The ast2firm pass has to know that left_type must be right_type
8123 * for the arithmetic operation and create a cast by itself */
8124 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8125 expression->right = create_implicit_cast(right, arithmetic_type);
8126 expression->base.type = type_left;
8129 static void semantic_divmod_assign(binary_expression_t *expression)
8131 semantic_arithmetic_assign(expression);
8132 warn_div_by_zero(expression);
8135 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8137 expression_t *const left = expression->left;
8138 expression_t *const right = expression->right;
8139 type_t *const orig_type_left = left->base.type;
8140 type_t *const orig_type_right = right->base.type;
8141 type_t *const type_left = skip_typeref(orig_type_left);
8142 type_t *const type_right = skip_typeref(orig_type_right);
8144 if (!is_valid_assignment_lhs(left))
8147 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8148 /* combined instructions are tricky. We can't create an implicit cast on
8149 * the left side, because we need the uncasted form for the store.
8150 * The ast2firm pass has to know that left_type must be right_type
8151 * for the arithmetic operation and create a cast by itself */
8152 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8153 expression->right = create_implicit_cast(right, arithmetic_type);
8154 expression->base.type = type_left;
8155 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8156 check_pointer_arithmetic(&expression->base.source_position,
8157 type_left, orig_type_left);
8158 expression->base.type = type_left;
8159 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8160 errorf(&expression->base.source_position,
8161 "incompatible types '%T' and '%T' in assignment",
8162 orig_type_left, orig_type_right);
8167 * Check the semantic restrictions of a logical expression.
8169 static void semantic_logical_op(binary_expression_t *expression)
8171 expression_t *const left = expression->left;
8172 expression_t *const right = expression->right;
8173 type_t *const orig_type_left = left->base.type;
8174 type_t *const orig_type_right = right->base.type;
8175 type_t *const type_left = skip_typeref(orig_type_left);
8176 type_t *const type_right = skip_typeref(orig_type_right);
8178 warn_function_address_as_bool(left);
8179 warn_function_address_as_bool(right);
8181 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
8182 /* TODO: improve error message */
8183 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8184 errorf(&expression->base.source_position,
8185 "operation needs scalar types");
8190 expression->base.type = type_int;
8194 * Check the semantic restrictions of a binary assign expression.
8196 static void semantic_binexpr_assign(binary_expression_t *expression)
8198 expression_t *left = expression->left;
8199 type_t *orig_type_left = left->base.type;
8201 if (!is_valid_assignment_lhs(left))
8204 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8205 report_assign_error(error, orig_type_left, expression->right,
8206 "assignment", &left->base.source_position);
8207 expression->right = create_implicit_cast(expression->right, orig_type_left);
8208 expression->base.type = orig_type_left;
8212 * Determine if the outermost operation (or parts thereof) of the given
8213 * expression has no effect in order to generate a warning about this fact.
8214 * Therefore in some cases this only examines some of the operands of the
8215 * expression (see comments in the function and examples below).
8217 * f() + 23; // warning, because + has no effect
8218 * x || f(); // no warning, because x controls execution of f()
8219 * x ? y : f(); // warning, because y has no effect
8220 * (void)x; // no warning to be able to suppress the warning
8221 * This function can NOT be used for an "expression has definitely no effect"-
8223 static bool expression_has_effect(const expression_t *const expr)
8225 switch (expr->kind) {
8226 case EXPR_UNKNOWN: break;
8227 case EXPR_INVALID: return true; /* do NOT warn */
8228 case EXPR_REFERENCE: return false;
8229 /* suppress the warning for microsoft __noop operations */
8230 case EXPR_CONST: return expr->conste.is_ms_noop;
8231 case EXPR_CHARACTER_CONSTANT: return false;
8232 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8233 case EXPR_STRING_LITERAL: return false;
8234 case EXPR_WIDE_STRING_LITERAL: return false;
8235 case EXPR_LABEL_ADDRESS: return false;
8238 const call_expression_t *const call = &expr->call;
8239 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
8242 switch (call->function->builtin_symbol.symbol->ID) {
8243 case T___builtin_va_end: return true;
8244 default: return false;
8248 /* Generate the warning if either the left or right hand side of a
8249 * conditional expression has no effect */
8250 case EXPR_CONDITIONAL: {
8251 const conditional_expression_t *const cond = &expr->conditional;
8253 expression_has_effect(cond->true_expression) &&
8254 expression_has_effect(cond->false_expression);
8257 case EXPR_SELECT: return false;
8258 case EXPR_ARRAY_ACCESS: return false;
8259 case EXPR_SIZEOF: return false;
8260 case EXPR_CLASSIFY_TYPE: return false;
8261 case EXPR_ALIGNOF: return false;
8263 case EXPR_FUNCNAME: return false;
8264 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
8265 case EXPR_BUILTIN_CONSTANT_P: return false;
8266 case EXPR_BUILTIN_PREFETCH: return true;
8267 case EXPR_OFFSETOF: return false;
8268 case EXPR_VA_START: return true;
8269 case EXPR_VA_ARG: return true;
8270 case EXPR_STATEMENT: return true; // TODO
8271 case EXPR_COMPOUND_LITERAL: return false;
8273 case EXPR_UNARY_NEGATE: return false;
8274 case EXPR_UNARY_PLUS: return false;
8275 case EXPR_UNARY_BITWISE_NEGATE: return false;
8276 case EXPR_UNARY_NOT: return false;
8277 case EXPR_UNARY_DEREFERENCE: return false;
8278 case EXPR_UNARY_TAKE_ADDRESS: return false;
8279 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8280 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8281 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8282 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8284 /* Treat void casts as if they have an effect in order to being able to
8285 * suppress the warning */
8286 case EXPR_UNARY_CAST: {
8287 type_t *const type = skip_typeref(expr->base.type);
8288 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8291 case EXPR_UNARY_CAST_IMPLICIT: return true;
8292 case EXPR_UNARY_ASSUME: return true;
8294 case EXPR_BINARY_ADD: return false;
8295 case EXPR_BINARY_SUB: return false;
8296 case EXPR_BINARY_MUL: return false;
8297 case EXPR_BINARY_DIV: return false;
8298 case EXPR_BINARY_MOD: return false;
8299 case EXPR_BINARY_EQUAL: return false;
8300 case EXPR_BINARY_NOTEQUAL: return false;
8301 case EXPR_BINARY_LESS: return false;
8302 case EXPR_BINARY_LESSEQUAL: return false;
8303 case EXPR_BINARY_GREATER: return false;
8304 case EXPR_BINARY_GREATEREQUAL: return false;
8305 case EXPR_BINARY_BITWISE_AND: return false;
8306 case EXPR_BINARY_BITWISE_OR: return false;
8307 case EXPR_BINARY_BITWISE_XOR: return false;
8308 case EXPR_BINARY_SHIFTLEFT: return false;
8309 case EXPR_BINARY_SHIFTRIGHT: return false;
8310 case EXPR_BINARY_ASSIGN: return true;
8311 case EXPR_BINARY_MUL_ASSIGN: return true;
8312 case EXPR_BINARY_DIV_ASSIGN: return true;
8313 case EXPR_BINARY_MOD_ASSIGN: return true;
8314 case EXPR_BINARY_ADD_ASSIGN: return true;
8315 case EXPR_BINARY_SUB_ASSIGN: return true;
8316 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8317 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8318 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8319 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8320 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8322 /* Only examine the right hand side of && and ||, because the left hand
8323 * side already has the effect of controlling the execution of the right
8325 case EXPR_BINARY_LOGICAL_AND:
8326 case EXPR_BINARY_LOGICAL_OR:
8327 /* Only examine the right hand side of a comma expression, because the left
8328 * hand side has a separate warning */
8329 case EXPR_BINARY_COMMA:
8330 return expression_has_effect(expr->binary.right);
8332 case EXPR_BINARY_BUILTIN_EXPECT: return true;
8333 case EXPR_BINARY_ISGREATER: return false;
8334 case EXPR_BINARY_ISGREATEREQUAL: return false;
8335 case EXPR_BINARY_ISLESS: return false;
8336 case EXPR_BINARY_ISLESSEQUAL: return false;
8337 case EXPR_BINARY_ISLESSGREATER: return false;
8338 case EXPR_BINARY_ISUNORDERED: return false;
8341 internal_errorf(HERE, "unexpected expression");
8344 static void semantic_comma(binary_expression_t *expression)
8346 if (warning.unused_value) {
8347 const expression_t *const left = expression->left;
8348 if (!expression_has_effect(left)) {
8349 warningf(&left->base.source_position,
8350 "left-hand operand of comma expression has no effect");
8353 expression->base.type = expression->right->base.type;
8356 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
8357 static expression_t *parse_##binexpression_type(unsigned precedence, \
8358 expression_t *left) \
8360 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8361 binexpr->base.source_position = *HERE; \
8362 binexpr->binary.left = left; \
8365 expression_t *right = parse_sub_expression(precedence + lr); \
8367 binexpr->binary.right = right; \
8368 sfunc(&binexpr->binary); \
8373 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
8374 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
8375 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_divmod_arithmetic, 1)
8376 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_divmod_arithmetic, 1)
8377 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
8378 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
8379 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
8380 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
8381 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
8383 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
8384 semantic_comparison, 1)
8385 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
8386 semantic_comparison, 1)
8387 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
8388 semantic_comparison, 1)
8389 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
8390 semantic_comparison, 1)
8392 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
8393 semantic_binexpr_arithmetic, 1)
8394 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
8395 semantic_binexpr_arithmetic, 1)
8396 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
8397 semantic_binexpr_arithmetic, 1)
8398 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
8399 semantic_logical_op, 1)
8400 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
8401 semantic_logical_op, 1)
8402 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
8403 semantic_shift_op, 1)
8404 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
8405 semantic_shift_op, 1)
8406 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
8407 semantic_arithmetic_addsubb_assign, 0)
8408 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
8409 semantic_arithmetic_addsubb_assign, 0)
8410 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
8411 semantic_arithmetic_assign, 0)
8412 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
8413 semantic_divmod_assign, 0)
8414 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
8415 semantic_divmod_assign, 0)
8416 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
8417 semantic_arithmetic_assign, 0)
8418 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8419 semantic_arithmetic_assign, 0)
8420 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
8421 semantic_arithmetic_assign, 0)
8422 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
8423 semantic_arithmetic_assign, 0)
8424 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
8425 semantic_arithmetic_assign, 0)
8427 static expression_t *parse_sub_expression(unsigned precedence)
8429 if (token.type < 0) {
8430 return expected_expression_error();
8433 expression_parser_function_t *parser
8434 = &expression_parsers[token.type];
8435 source_position_t source_position = token.source_position;
8438 if (parser->parser != NULL) {
8439 left = parser->parser(parser->precedence);
8441 left = parse_primary_expression();
8443 assert(left != NULL);
8444 left->base.source_position = source_position;
8447 if (token.type < 0) {
8448 return expected_expression_error();
8451 parser = &expression_parsers[token.type];
8452 if (parser->infix_parser == NULL)
8454 if (parser->infix_precedence < precedence)
8457 left = parser->infix_parser(parser->infix_precedence, left);
8459 assert(left != NULL);
8460 assert(left->kind != EXPR_UNKNOWN);
8461 left->base.source_position = source_position;
8468 * Parse an expression.
8470 static expression_t *parse_expression(void)
8472 return parse_sub_expression(1);
8476 * Register a parser for a prefix-like operator with given precedence.
8478 * @param parser the parser function
8479 * @param token_type the token type of the prefix token
8480 * @param precedence the precedence of the operator
8482 static void register_expression_parser(parse_expression_function parser,
8483 int token_type, unsigned precedence)
8485 expression_parser_function_t *entry = &expression_parsers[token_type];
8487 if (entry->parser != NULL) {
8488 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8489 panic("trying to register multiple expression parsers for a token");
8491 entry->parser = parser;
8492 entry->precedence = precedence;
8496 * Register a parser for an infix operator with given precedence.
8498 * @param parser the parser function
8499 * @param token_type the token type of the infix operator
8500 * @param precedence the precedence of the operator
8502 static void register_infix_parser(parse_expression_infix_function parser,
8503 int token_type, unsigned precedence)
8505 expression_parser_function_t *entry = &expression_parsers[token_type];
8507 if (entry->infix_parser != NULL) {
8508 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8509 panic("trying to register multiple infix expression parsers for a "
8512 entry->infix_parser = parser;
8513 entry->infix_precedence = precedence;
8517 * Initialize the expression parsers.
8519 static void init_expression_parsers(void)
8521 memset(&expression_parsers, 0, sizeof(expression_parsers));
8523 register_infix_parser(parse_array_expression, '[', 30);
8524 register_infix_parser(parse_call_expression, '(', 30);
8525 register_infix_parser(parse_select_expression, '.', 30);
8526 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
8527 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
8529 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
8532 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 17);
8533 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 17);
8534 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 17);
8535 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 16);
8536 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 16);
8537 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 15);
8538 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 15);
8539 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
8540 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
8541 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
8542 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
8543 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
8544 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
8545 T_EXCLAMATIONMARKEQUAL, 13);
8546 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
8547 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
8548 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
8549 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
8550 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
8551 register_infix_parser(parse_conditional_expression, '?', 7);
8552 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
8553 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
8554 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
8555 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
8556 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
8557 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
8558 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
8559 T_LESSLESSEQUAL, 2);
8560 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8561 T_GREATERGREATEREQUAL, 2);
8562 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
8564 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
8566 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
8569 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
8571 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
8572 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
8573 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
8574 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
8575 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
8576 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
8577 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
8579 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
8581 register_expression_parser(parse_sizeof, T_sizeof, 25);
8582 register_expression_parser(parse_alignof, T___alignof__, 25);
8583 register_expression_parser(parse_extension, T___extension__, 25);
8584 register_expression_parser(parse_builtin_classify_type,
8585 T___builtin_classify_type, 25);
8589 * Parse a asm statement arguments specification.
8591 static asm_argument_t *parse_asm_arguments(bool is_out)
8593 asm_argument_t *result = NULL;
8594 asm_argument_t *last = NULL;
8596 while (token.type == T_STRING_LITERAL || token.type == '[') {
8597 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8598 memset(argument, 0, sizeof(argument[0]));
8600 if (token.type == '[') {
8602 if (token.type != T_IDENTIFIER) {
8603 parse_error_expected("while parsing asm argument",
8604 T_IDENTIFIER, NULL);
8607 argument->symbol = token.v.symbol;
8612 argument->constraints = parse_string_literals();
8614 add_anchor_token(')');
8615 expression_t *expression = parse_expression();
8616 rem_anchor_token(')');
8618 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8619 * change size or type representation (e.g. int -> long is ok, but
8620 * int -> float is not) */
8621 if (expression->kind == EXPR_UNARY_CAST) {
8622 type_t *const type = expression->base.type;
8623 type_kind_t const kind = type->kind;
8624 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8627 if (kind == TYPE_ATOMIC) {
8628 atomic_type_kind_t const akind = type->atomic.akind;
8629 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8630 size = get_atomic_type_size(akind);
8632 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8633 size = get_atomic_type_size(get_intptr_kind());
8637 expression_t *const value = expression->unary.value;
8638 type_t *const value_type = value->base.type;
8639 type_kind_t const value_kind = value_type->kind;
8641 unsigned value_flags;
8642 unsigned value_size;
8643 if (value_kind == TYPE_ATOMIC) {
8644 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8645 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8646 value_size = get_atomic_type_size(value_akind);
8647 } else if (value_kind == TYPE_POINTER) {
8648 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8649 value_size = get_atomic_type_size(get_intptr_kind());
8654 if (value_flags != flags || value_size != size)
8658 } while (expression->kind == EXPR_UNARY_CAST);
8662 if (!is_lvalue(expression)) {
8663 errorf(&expression->base.source_position,
8664 "asm output argument is not an lvalue");
8667 argument->expression = expression;
8670 set_address_taken(expression, true);
8673 last->next = argument;
8679 if (token.type != ',')
8690 * Parse a asm statement clobber specification.
8692 static asm_clobber_t *parse_asm_clobbers(void)
8694 asm_clobber_t *result = NULL;
8695 asm_clobber_t *last = NULL;
8697 while(token.type == T_STRING_LITERAL) {
8698 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8699 clobber->clobber = parse_string_literals();
8702 last->next = clobber;
8708 if (token.type != ',')
8717 * Parse an asm statement.
8719 static statement_t *parse_asm_statement(void)
8721 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8722 asm_statement_t *asm_statement = &statement->asms;
8726 if (token.type == T_volatile) {
8728 asm_statement->is_volatile = true;
8732 add_anchor_token(')');
8733 add_anchor_token(':');
8734 asm_statement->asm_text = parse_string_literals();
8736 if (token.type != ':') {
8737 rem_anchor_token(':');
8742 asm_statement->outputs = parse_asm_arguments(true);
8743 if (token.type != ':') {
8744 rem_anchor_token(':');
8749 asm_statement->inputs = parse_asm_arguments(false);
8750 if (token.type != ':') {
8751 rem_anchor_token(':');
8754 rem_anchor_token(':');
8757 asm_statement->clobbers = parse_asm_clobbers();
8760 rem_anchor_token(')');
8764 if (asm_statement->outputs == NULL) {
8765 /* GCC: An 'asm' instruction without any output operands will be treated
8766 * identically to a volatile 'asm' instruction. */
8767 asm_statement->is_volatile = true;
8772 return create_invalid_statement();
8776 * Parse a case statement.
8778 static statement_t *parse_case_statement(void)
8780 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8781 source_position_t *const pos = &statement->base.source_position;
8785 expression_t *const expression = parse_expression();
8786 statement->case_label.expression = expression;
8787 if (!is_constant_expression(expression)) {
8788 /* This check does not prevent the error message in all cases of an
8789 * prior error while parsing the expression. At least it catches the
8790 * common case of a mistyped enum entry. */
8791 if (is_type_valid(skip_typeref(expression->base.type))) {
8792 errorf(pos, "case label does not reduce to an integer constant");
8794 statement->case_label.is_bad = true;
8796 long const val = fold_constant(expression);
8797 statement->case_label.first_case = val;
8798 statement->case_label.last_case = val;
8802 if (token.type == T_DOTDOTDOT) {
8804 expression_t *const end_range = parse_expression();
8805 statement->case_label.end_range = end_range;
8806 if (!is_constant_expression(end_range)) {
8807 /* This check does not prevent the error message in all cases of an
8808 * prior error while parsing the expression. At least it catches the
8809 * common case of a mistyped enum entry. */
8810 if (is_type_valid(skip_typeref(end_range->base.type))) {
8811 errorf(pos, "case range does not reduce to an integer constant");
8813 statement->case_label.is_bad = true;
8815 long const val = fold_constant(end_range);
8816 statement->case_label.last_case = val;
8818 if (val < statement->case_label.first_case) {
8819 statement->case_label.is_empty_range = true;
8820 warningf(pos, "empty range specified");
8826 PUSH_PARENT(statement);
8830 if (current_switch != NULL) {
8831 if (! statement->case_label.is_bad) {
8832 /* Check for duplicate case values */
8833 case_label_statement_t *c = &statement->case_label;
8834 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8835 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8838 if (c->last_case < l->first_case || c->first_case > l->last_case)
8841 errorf(pos, "duplicate case value (previously used %P)",
8842 &l->base.source_position);
8846 /* link all cases into the switch statement */
8847 if (current_switch->last_case == NULL) {
8848 current_switch->first_case = &statement->case_label;
8850 current_switch->last_case->next = &statement->case_label;
8852 current_switch->last_case = &statement->case_label;
8854 errorf(pos, "case label not within a switch statement");
8857 statement_t *const inner_stmt = parse_statement();
8858 statement->case_label.statement = inner_stmt;
8859 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8860 errorf(&inner_stmt->base.source_position, "declaration after case label");
8867 return create_invalid_statement();
8871 * Parse a default statement.
8873 static statement_t *parse_default_statement(void)
8875 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8879 PUSH_PARENT(statement);
8882 if (current_switch != NULL) {
8883 const case_label_statement_t *def_label = current_switch->default_label;
8884 if (def_label != NULL) {
8885 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
8886 &def_label->base.source_position);
8888 current_switch->default_label = &statement->case_label;
8890 /* link all cases into the switch statement */
8891 if (current_switch->last_case == NULL) {
8892 current_switch->first_case = &statement->case_label;
8894 current_switch->last_case->next = &statement->case_label;
8896 current_switch->last_case = &statement->case_label;
8899 errorf(&statement->base.source_position,
8900 "'default' label not within a switch statement");
8903 statement_t *const inner_stmt = parse_statement();
8904 statement->case_label.statement = inner_stmt;
8905 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8906 errorf(&inner_stmt->base.source_position, "declaration after default label");
8913 return create_invalid_statement();
8917 * Parse a label statement.
8919 static statement_t *parse_label_statement(void)
8921 assert(token.type == T_IDENTIFIER);
8922 symbol_t *symbol = token.v.symbol;
8923 declaration_t *label = get_label(symbol);
8925 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8926 statement->label.label = label;
8930 PUSH_PARENT(statement);
8932 /* if statement is already set then the label is defined twice,
8933 * otherwise it was just mentioned in a goto/local label declaration so far */
8934 if (label->init.statement != NULL) {
8935 errorf(HERE, "duplicate label '%Y' (declared %P)",
8936 symbol, &label->source_position);
8938 label->source_position = token.source_position;
8939 label->init.statement = statement;
8944 if (token.type == '}') {
8945 /* TODO only warn? */
8947 warningf(HERE, "label at end of compound statement");
8948 statement->label.statement = create_empty_statement();
8950 errorf(HERE, "label at end of compound statement");
8951 statement->label.statement = create_invalid_statement();
8953 } else if (token.type == ';') {
8954 /* Eat an empty statement here, to avoid the warning about an empty
8955 * statement after a label. label:; is commonly used to have a label
8956 * before a closing brace. */
8957 statement->label.statement = create_empty_statement();
8960 statement_t *const inner_stmt = parse_statement();
8961 statement->label.statement = inner_stmt;
8962 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8963 errorf(&inner_stmt->base.source_position, "declaration after label");
8967 /* remember the labels in a list for later checking */
8968 if (label_last == NULL) {
8969 label_first = &statement->label;
8971 label_last->next = &statement->label;
8973 label_last = &statement->label;
8980 * Parse an if statement.
8982 static statement_t *parse_if(void)
8984 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
8988 PUSH_PARENT(statement);
8990 add_anchor_token('{');
8993 add_anchor_token(')');
8994 statement->ifs.condition = parse_expression();
8995 rem_anchor_token(')');
8999 rem_anchor_token('{');
9001 add_anchor_token(T_else);
9002 statement->ifs.true_statement = parse_statement();
9003 rem_anchor_token(T_else);
9005 if (token.type == T_else) {
9007 statement->ifs.false_statement = parse_statement();
9015 * Check that all enums are handled in a switch.
9017 * @param statement the switch statement to check
9019 static void check_enum_cases(const switch_statement_t *statement) {
9020 const type_t *type = skip_typeref(statement->expression->base.type);
9021 if (! is_type_enum(type))
9023 const enum_type_t *enumt = &type->enumt;
9025 /* if we have a default, no warnings */
9026 if (statement->default_label != NULL)
9029 /* FIXME: calculation of value should be done while parsing */
9030 const declaration_t *declaration;
9031 long last_value = -1;
9032 for (declaration = enumt->declaration->next;
9033 declaration != NULL && declaration->storage_class == STORAGE_CLASS_ENUM_ENTRY;
9034 declaration = declaration->next) {
9035 const expression_t *expression = declaration->init.enum_value;
9036 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
9038 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9039 if (l->expression == NULL)
9041 if (l->first_case <= value && value <= l->last_case) {
9047 warningf(&statement->base.source_position,
9048 "enumeration value '%Y' not handled in switch", declaration->symbol);
9055 * Parse a switch statement.
9057 static statement_t *parse_switch(void)
9059 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9063 PUSH_PARENT(statement);
9066 add_anchor_token(')');
9067 expression_t *const expr = parse_expression();
9068 type_t * type = skip_typeref(expr->base.type);
9069 if (is_type_integer(type)) {
9070 type = promote_integer(type);
9071 if (warning.traditional) {
9072 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9073 warningf(&expr->base.source_position,
9074 "'%T' switch expression not converted to '%T' in ISO C",
9078 } else if (is_type_valid(type)) {
9079 errorf(&expr->base.source_position,
9080 "switch quantity is not an integer, but '%T'", type);
9081 type = type_error_type;
9083 statement->switchs.expression = create_implicit_cast(expr, type);
9085 rem_anchor_token(')');
9087 switch_statement_t *rem = current_switch;
9088 current_switch = &statement->switchs;
9089 statement->switchs.body = parse_statement();
9090 current_switch = rem;
9092 if (warning.switch_default &&
9093 statement->switchs.default_label == NULL) {
9094 warningf(&statement->base.source_position, "switch has no default case");
9096 if (warning.switch_enum)
9097 check_enum_cases(&statement->switchs);
9103 return create_invalid_statement();
9106 static statement_t *parse_loop_body(statement_t *const loop)
9108 statement_t *const rem = current_loop;
9109 current_loop = loop;
9111 statement_t *const body = parse_statement();
9118 * Parse a while statement.
9120 static statement_t *parse_while(void)
9122 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9126 PUSH_PARENT(statement);
9129 add_anchor_token(')');
9130 statement->whiles.condition = parse_expression();
9131 rem_anchor_token(')');
9134 statement->whiles.body = parse_loop_body(statement);
9140 return create_invalid_statement();
9144 * Parse a do statement.
9146 static statement_t *parse_do(void)
9148 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9152 PUSH_PARENT(statement)
9154 add_anchor_token(T_while);
9155 statement->do_while.body = parse_loop_body(statement);
9156 rem_anchor_token(T_while);
9160 add_anchor_token(')');
9161 statement->do_while.condition = parse_expression();
9162 rem_anchor_token(')');
9170 return create_invalid_statement();
9174 * Parse a for statement.
9176 static statement_t *parse_for(void)
9178 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9182 PUSH_PARENT(statement);
9184 size_t const top = environment_top();
9185 scope_push(&statement->fors.scope);
9188 add_anchor_token(')');
9190 if (token.type != ';') {
9191 if (is_declaration_specifier(&token, false)) {
9192 parse_declaration(record_declaration);
9194 add_anchor_token(';');
9195 expression_t *const init = parse_expression();
9196 statement->fors.initialisation = init;
9197 if (warning.unused_value && !expression_has_effect(init)) {
9198 warningf(&init->base.source_position,
9199 "initialisation of 'for'-statement has no effect");
9201 rem_anchor_token(';');
9208 if (token.type != ';') {
9209 add_anchor_token(';');
9210 statement->fors.condition = parse_expression();
9211 rem_anchor_token(';');
9214 if (token.type != ')') {
9215 expression_t *const step = parse_expression();
9216 statement->fors.step = step;
9217 if (warning.unused_value && !expression_has_effect(step)) {
9218 warningf(&step->base.source_position,
9219 "step of 'for'-statement has no effect");
9222 rem_anchor_token(')');
9224 statement->fors.body = parse_loop_body(statement);
9226 assert(scope == &statement->fors.scope);
9228 environment_pop_to(top);
9235 rem_anchor_token(')');
9236 assert(scope == &statement->fors.scope);
9238 environment_pop_to(top);
9240 return create_invalid_statement();
9244 * Parse a goto statement.
9246 static statement_t *parse_goto(void)
9248 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9251 if (GNU_MODE && token.type == '*') {
9253 expression_t *expression = parse_expression();
9255 /* Argh: although documentation say the expression must be of type void *,
9256 * gcc excepts anything that can be casted into void * without error */
9257 type_t *type = expression->base.type;
9259 if (type != type_error_type) {
9260 if (!is_type_pointer(type) && !is_type_integer(type)) {
9261 errorf(&expression->base.source_position,
9262 "cannot convert to a pointer type");
9263 } else if (type != type_void_ptr) {
9264 warningf(&expression->base.source_position,
9265 "type of computed goto expression should be 'void*' not '%T'", type);
9267 expression = create_implicit_cast(expression, type_void_ptr);
9270 statement->gotos.expression = expression;
9272 if (token.type != T_IDENTIFIER) {
9274 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9276 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9280 symbol_t *symbol = token.v.symbol;
9283 statement->gotos.label = get_label(symbol);
9285 if (statement->gotos.label->parent_scope->depth < current_function->scope.depth) {
9286 statement->gotos.outer_fkt_jmp = true;
9290 /* remember the goto's in a list for later checking */
9291 if (goto_last == NULL) {
9292 goto_first = &statement->gotos;
9294 goto_last->next = &statement->gotos;
9296 goto_last = &statement->gotos;
9302 return create_invalid_statement();
9306 * Parse a continue statement.
9308 static statement_t *parse_continue(void)
9310 if (current_loop == NULL) {
9311 errorf(HERE, "continue statement not within loop");
9314 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9324 * Parse a break statement.
9326 static statement_t *parse_break(void)
9328 if (current_switch == NULL && current_loop == NULL) {
9329 errorf(HERE, "break statement not within loop or switch");
9332 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9342 * Parse a __leave statement.
9344 static statement_t *parse_leave_statement(void)
9346 if (current_try == NULL) {
9347 errorf(HERE, "__leave statement not within __try");
9350 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9360 * Check if a given declaration represents a local variable.
9362 static bool is_local_var_declaration(const declaration_t *declaration)
9364 switch ((storage_class_tag_t) declaration->storage_class) {
9365 case STORAGE_CLASS_AUTO:
9366 case STORAGE_CLASS_REGISTER: {
9367 const type_t *type = skip_typeref(declaration->type);
9368 if (is_type_function(type)) {
9380 * Check if a given declaration represents a variable.
9382 static bool is_var_declaration(const declaration_t *declaration)
9384 if (declaration->storage_class == STORAGE_CLASS_TYPEDEF)
9387 const type_t *type = skip_typeref(declaration->type);
9388 return !is_type_function(type);
9392 * Check if a given expression represents a local variable.
9394 static bool is_local_variable(const expression_t *expression)
9396 if (expression->base.kind != EXPR_REFERENCE) {
9399 const declaration_t *declaration = expression->reference.declaration;
9400 return is_local_var_declaration(declaration);
9404 * Check if a given expression represents a local variable and
9405 * return its declaration then, else return NULL.
9407 declaration_t *expr_is_variable(const expression_t *expression)
9409 if (expression->base.kind != EXPR_REFERENCE) {
9412 declaration_t *declaration = expression->reference.declaration;
9413 if (is_var_declaration(declaration))
9419 * Parse a return statement.
9421 static statement_t *parse_return(void)
9425 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9427 expression_t *return_value = NULL;
9428 if (token.type != ';') {
9429 return_value = parse_expression();
9432 const type_t *const func_type = current_function->type;
9433 assert(is_type_function(func_type));
9434 type_t *const return_type = skip_typeref(func_type->function.return_type);
9436 if (return_value != NULL) {
9437 type_t *return_value_type = skip_typeref(return_value->base.type);
9439 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)
9440 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9441 warningf(&statement->base.source_position,
9442 "'return' with a value, in function returning void");
9443 return_value = NULL;
9445 assign_error_t error = semantic_assign(return_type, return_value);
9446 report_assign_error(error, return_type, return_value, "'return'",
9447 &statement->base.source_position);
9448 return_value = create_implicit_cast(return_value, return_type);
9450 /* check for returning address of a local var */
9451 if (return_value != NULL &&
9452 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9453 const expression_t *expression = return_value->unary.value;
9454 if (is_local_variable(expression)) {
9455 warningf(&statement->base.source_position,
9456 "function returns address of local variable");
9460 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9461 warningf(&statement->base.source_position,
9462 "'return' without value, in function returning non-void");
9465 statement->returns.value = return_value;
9474 * Parse a declaration statement.
9476 static statement_t *parse_declaration_statement(void)
9478 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9480 declaration_t *before = last_declaration;
9482 parse_external_declaration();
9484 parse_declaration(record_declaration);
9486 if (before == NULL) {
9487 statement->declaration.declarations_begin = scope->declarations;
9489 statement->declaration.declarations_begin = before->next;
9491 statement->declaration.declarations_end = last_declaration;
9497 * Parse an expression statement, ie. expr ';'.
9499 static statement_t *parse_expression_statement(void)
9501 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9503 expression_t *const expr = parse_expression();
9504 statement->expression.expression = expr;
9513 * Parse a microsoft __try { } __finally { } or
9514 * __try{ } __except() { }
9516 static statement_t *parse_ms_try_statment(void)
9518 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9521 PUSH_PARENT(statement);
9523 ms_try_statement_t *rem = current_try;
9524 current_try = &statement->ms_try;
9525 statement->ms_try.try_statement = parse_compound_statement(false);
9530 if (token.type == T___except) {
9533 add_anchor_token(')');
9534 expression_t *const expr = parse_expression();
9535 type_t * type = skip_typeref(expr->base.type);
9536 if (is_type_integer(type)) {
9537 type = promote_integer(type);
9538 } else if (is_type_valid(type)) {
9539 errorf(&expr->base.source_position,
9540 "__expect expression is not an integer, but '%T'", type);
9541 type = type_error_type;
9543 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9544 rem_anchor_token(')');
9546 statement->ms_try.final_statement = parse_compound_statement(false);
9547 } else if (token.type == T__finally) {
9549 statement->ms_try.final_statement = parse_compound_statement(false);
9551 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9552 return create_invalid_statement();
9556 return create_invalid_statement();
9559 static statement_t *parse_empty_statement(void)
9561 if (warning.empty_statement) {
9562 warningf(HERE, "statement is empty");
9564 statement_t *const statement = create_empty_statement();
9569 static statement_t *parse_local_label_declaration(void) {
9570 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9574 declaration_t *begin = NULL, *end = NULL;
9577 if (token.type != T_IDENTIFIER) {
9578 parse_error_expected("while parsing local label declaration",
9579 T_IDENTIFIER, NULL);
9582 symbol_t *symbol = token.v.symbol;
9583 declaration_t *declaration = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
9584 if (declaration != NULL) {
9585 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition at %P)",
9586 symbol, &declaration->source_position);
9588 declaration = allocate_declaration_zero();
9589 declaration->namespc = NAMESPACE_LOCAL_LABEL;
9590 declaration->source_position = token.source_position;
9591 declaration->symbol = symbol;
9592 declaration->parent_scope = scope;
9593 declaration->init.statement = NULL;
9596 end->next = declaration;
9599 begin = declaration;
9601 local_label_push(declaration);
9605 if (token.type != ',')
9611 statement->declaration.declarations_begin = begin;
9612 statement->declaration.declarations_end = end;
9617 * Parse a statement.
9618 * There's also parse_statement() which additionally checks for
9619 * "statement has no effect" warnings
9621 static statement_t *intern_parse_statement(void)
9623 statement_t *statement = NULL;
9625 /* declaration or statement */
9626 add_anchor_token(';');
9627 switch (token.type) {
9628 case T_IDENTIFIER: {
9629 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
9630 if (la1_type == ':') {
9631 statement = parse_label_statement();
9632 } else if (is_typedef_symbol(token.v.symbol)) {
9633 statement = parse_declaration_statement();
9634 } else switch (la1_type) {
9636 if (get_declaration(token.v.symbol, NAMESPACE_NORMAL) != NULL)
9637 goto expression_statment;
9642 statement = parse_declaration_statement();
9646 expression_statment:
9647 statement = parse_expression_statement();
9653 case T___extension__:
9654 /* This can be a prefix to a declaration or an expression statement.
9655 * We simply eat it now and parse the rest with tail recursion. */
9658 } while (token.type == T___extension__);
9659 bool old_gcc_extension = in_gcc_extension;
9660 in_gcc_extension = true;
9661 statement = parse_statement();
9662 in_gcc_extension = old_gcc_extension;
9666 statement = parse_declaration_statement();
9670 statement = parse_local_label_declaration();
9673 case ';': statement = parse_empty_statement(); break;
9674 case '{': statement = parse_compound_statement(false); break;
9675 case T___leave: statement = parse_leave_statement(); break;
9676 case T___try: statement = parse_ms_try_statment(); break;
9677 case T_asm: statement = parse_asm_statement(); break;
9678 case T_break: statement = parse_break(); break;
9679 case T_case: statement = parse_case_statement(); break;
9680 case T_continue: statement = parse_continue(); break;
9681 case T_default: statement = parse_default_statement(); break;
9682 case T_do: statement = parse_do(); break;
9683 case T_for: statement = parse_for(); break;
9684 case T_goto: statement = parse_goto(); break;
9685 case T_if: statement = parse_if (); break;
9686 case T_return: statement = parse_return(); break;
9687 case T_switch: statement = parse_switch(); break;
9688 case T_while: statement = parse_while(); break;
9698 case T_CHARACTER_CONSTANT:
9699 case T_FLOATINGPOINT:
9703 case T_STRING_LITERAL:
9704 case T_WIDE_CHARACTER_CONSTANT:
9705 case T_WIDE_STRING_LITERAL:
9706 case T___FUNCDNAME__:
9708 case T___FUNCTION__:
9709 case T___PRETTY_FUNCTION__:
9710 case T___builtin_alloca:
9711 case T___builtin_classify_type:
9712 case T___builtin_constant_p:
9713 case T___builtin_expect:
9714 case T___builtin_huge_val:
9715 case T___builtin_isgreater:
9716 case T___builtin_isgreaterequal:
9717 case T___builtin_isless:
9718 case T___builtin_islessequal:
9719 case T___builtin_islessgreater:
9720 case T___builtin_isunordered:
9721 case T___builtin_inf:
9722 case T___builtin_inff:
9723 case T___builtin_infl:
9724 case T___builtin_nan:
9725 case T___builtin_nanf:
9726 case T___builtin_nanl:
9727 case T___builtin_offsetof:
9728 case T___builtin_prefetch:
9729 case T___builtin_va_arg:
9730 case T___builtin_va_end:
9731 case T___builtin_va_start:
9735 statement = parse_expression_statement();
9739 errorf(HERE, "unexpected token %K while parsing statement", &token);
9740 statement = create_invalid_statement();
9745 rem_anchor_token(';');
9747 assert(statement != NULL
9748 && statement->base.source_position.input_name != NULL);
9754 * parse a statement and emits "statement has no effect" warning if needed
9755 * (This is really a wrapper around intern_parse_statement with check for 1
9756 * single warning. It is needed, because for statement expressions we have
9757 * to avoid the warning on the last statement)
9759 static statement_t *parse_statement(void)
9761 statement_t *statement = intern_parse_statement();
9763 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
9764 expression_t *expression = statement->expression.expression;
9765 if (!expression_has_effect(expression)) {
9766 warningf(&expression->base.source_position,
9767 "statement has no effect");
9775 * Parse a compound statement.
9777 static statement_t *parse_compound_statement(bool inside_expression_statement)
9779 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9781 PUSH_PARENT(statement);
9784 add_anchor_token('}');
9786 size_t const top = environment_top();
9787 size_t const top_local = local_label_top();
9788 scope_push(&statement->compound.scope);
9790 statement_t **anchor = &statement->compound.statements;
9791 bool only_decls_so_far = true;
9792 while (token.type != '}') {
9793 if (token.type == T_EOF) {
9794 errorf(&statement->base.source_position,
9795 "EOF while parsing compound statement");
9798 statement_t *sub_statement = intern_parse_statement();
9799 if (is_invalid_statement(sub_statement)) {
9800 /* an error occurred. if we are at an anchor, return */
9806 if (warning.declaration_after_statement) {
9807 if (sub_statement->kind != STATEMENT_DECLARATION) {
9808 only_decls_so_far = false;
9809 } else if (!only_decls_so_far) {
9810 warningf(&sub_statement->base.source_position,
9811 "ISO C90 forbids mixed declarations and code");
9815 *anchor = sub_statement;
9817 while (sub_statement->base.next != NULL)
9818 sub_statement = sub_statement->base.next;
9820 anchor = &sub_statement->base.next;
9824 /* look over all statements again to produce no effect warnings */
9825 if (warning.unused_value) {
9826 statement_t *sub_statement = statement->compound.statements;
9827 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9828 if (sub_statement->kind != STATEMENT_EXPRESSION)
9830 /* don't emit a warning for the last expression in an expression
9831 * statement as it has always an effect */
9832 if (inside_expression_statement && sub_statement->base.next == NULL)
9835 expression_t *expression = sub_statement->expression.expression;
9836 if (!expression_has_effect(expression)) {
9837 warningf(&expression->base.source_position,
9838 "statement has no effect");
9844 rem_anchor_token('}');
9845 assert(scope == &statement->compound.scope);
9847 environment_pop_to(top);
9848 local_label_pop_to(top_local);
9855 * Initialize builtin types.
9857 static void initialize_builtin_types(void)
9859 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
9860 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
9861 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
9862 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
9863 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
9864 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
9865 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
9866 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
9868 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
9869 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
9870 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
9871 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
9873 /* const version of wchar_t */
9874 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
9875 type_const_wchar_t->typedeft.declaration = type_wchar_t->typedeft.declaration;
9876 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
9878 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
9882 * Check for unused global static functions and variables
9884 static void check_unused_globals(void)
9886 if (!warning.unused_function && !warning.unused_variable)
9889 for (const declaration_t *decl = file_scope->declarations; decl != NULL; decl = decl->next) {
9891 decl->modifiers & DM_UNUSED ||
9892 decl->modifiers & DM_USED ||
9893 decl->storage_class != STORAGE_CLASS_STATIC)
9896 type_t *const type = decl->type;
9898 if (is_type_function(skip_typeref(type))) {
9899 if (!warning.unused_function || decl->is_inline)
9902 s = (decl->init.statement != NULL ? "defined" : "declared");
9904 if (!warning.unused_variable)
9910 warningf(&decl->source_position, "'%#T' %s but not used",
9911 type, decl->symbol, s);
9915 static void parse_global_asm(void)
9917 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9922 statement->asms.asm_text = parse_string_literals();
9923 statement->base.next = unit->global_asm;
9924 unit->global_asm = statement;
9933 * Parse a translation unit.
9935 static void parse_translation_unit(void)
9937 add_anchor_token(T_EOF);
9940 unsigned char token_anchor_copy[T_LAST_TOKEN];
9941 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
9945 bool anchor_leak = false;
9946 for (int i = 0; i != T_LAST_TOKEN; ++i) {
9947 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
9949 errorf(HERE, "Leaked anchor token %k %d times", i, count);
9953 if (in_gcc_extension) {
9954 errorf(HERE, "Leaked __extension__");
9962 switch (token.type) {
9965 case T___extension__:
9966 parse_external_declaration();
9974 rem_anchor_token(T_EOF);
9979 warningf(HERE, "stray ';' outside of function");
9986 errorf(HERE, "stray %K outside of function", &token);
9987 if (token.type == '(' || token.type == '{' || token.type == '[')
9988 eat_until_matching_token(token.type);
9998 * @return the translation unit or NULL if errors occurred.
10000 void start_parsing(void)
10002 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10003 label_stack = NEW_ARR_F(stack_entry_t, 0);
10004 local_label_stack = NEW_ARR_F(stack_entry_t, 0);
10005 diagnostic_count = 0;
10009 type_set_output(stderr);
10010 ast_set_output(stderr);
10012 assert(unit == NULL);
10013 unit = allocate_ast_zero(sizeof(unit[0]));
10015 assert(file_scope == NULL);
10016 file_scope = &unit->scope;
10018 assert(scope == NULL);
10019 scope_push(&unit->scope);
10021 initialize_builtin_types();
10024 translation_unit_t *finish_parsing(void)
10026 /* do NOT use scope_pop() here, this will crash, will it by hand */
10027 assert(scope == &unit->scope);
10029 last_declaration = NULL;
10031 assert(file_scope == &unit->scope);
10032 check_unused_globals();
10035 DEL_ARR_F(environment_stack);
10036 DEL_ARR_F(label_stack);
10037 DEL_ARR_F(local_label_stack);
10039 translation_unit_t *result = unit;
10046 lookahead_bufpos = 0;
10047 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10050 parse_translation_unit();
10054 * Initialize the parser.
10056 void init_parser(void)
10058 sym_anonymous = symbol_table_insert("<anonymous>");
10060 if (c_mode & _MS) {
10061 /* add predefined symbols for extended-decl-modifier */
10062 sym_align = symbol_table_insert("align");
10063 sym_allocate = symbol_table_insert("allocate");
10064 sym_dllimport = symbol_table_insert("dllimport");
10065 sym_dllexport = symbol_table_insert("dllexport");
10066 sym_naked = symbol_table_insert("naked");
10067 sym_noinline = symbol_table_insert("noinline");
10068 sym_noreturn = symbol_table_insert("noreturn");
10069 sym_nothrow = symbol_table_insert("nothrow");
10070 sym_novtable = symbol_table_insert("novtable");
10071 sym_property = symbol_table_insert("property");
10072 sym_get = symbol_table_insert("get");
10073 sym_put = symbol_table_insert("put");
10074 sym_selectany = symbol_table_insert("selectany");
10075 sym_thread = symbol_table_insert("thread");
10076 sym_uuid = symbol_table_insert("uuid");
10077 sym_deprecated = symbol_table_insert("deprecated");
10078 sym_restrict = symbol_table_insert("restrict");
10079 sym_noalias = symbol_table_insert("noalias");
10081 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10083 init_expression_parsers();
10084 obstack_init(&temp_obst);
10086 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10087 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10091 * Terminate the parser.
10093 void exit_parser(void)
10095 obstack_free(&temp_obst, NULL);