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 static scope_t *global_scope = NULL;
118 static scope_t *scope = NULL;
119 static declaration_t *last_declaration = NULL;
120 static declaration_t *current_function = NULL;
121 static declaration_t *current_init_decl = NULL;
122 static switch_statement_t *current_switch = NULL;
123 static statement_t *current_loop = NULL;
124 static statement_t *current_parent = NULL;
125 static ms_try_statement_t *current_try = NULL;
126 static goto_statement_t *goto_first = NULL;
127 static goto_statement_t *goto_last = NULL;
128 static label_statement_t *label_first = NULL;
129 static label_statement_t *label_last = NULL;
130 /** current translation unit. */
131 static translation_unit_t *unit = NULL;
132 /** true if we are in a type property context (evaluation only for type. */
133 static bool in_type_prop = false;
134 /** true in we are in a __extension__ context. */
135 static bool in_gcc_extension = false;
136 static struct obstack temp_obst;
139 #define PUSH_PARENT(stmt) \
140 statement_t *const prev_parent = current_parent; \
141 current_parent = (stmt);
142 #define POP_PARENT ((void)(current_parent = prev_parent))
144 static source_position_t null_position = { NULL, 0 };
146 /** special symbol used for anonymous entities. */
147 static const symbol_t *sym_anonymous = NULL;
149 /* symbols for Microsoft extended-decl-modifier */
150 static const symbol_t *sym_align = NULL;
151 static const symbol_t *sym_allocate = NULL;
152 static const symbol_t *sym_dllimport = NULL;
153 static const symbol_t *sym_dllexport = NULL;
154 static const symbol_t *sym_naked = NULL;
155 static const symbol_t *sym_noinline = NULL;
156 static const symbol_t *sym_noreturn = NULL;
157 static const symbol_t *sym_nothrow = NULL;
158 static const symbol_t *sym_novtable = NULL;
159 static const symbol_t *sym_property = NULL;
160 static const symbol_t *sym_get = NULL;
161 static const symbol_t *sym_put = NULL;
162 static const symbol_t *sym_selectany = NULL;
163 static const symbol_t *sym_thread = NULL;
164 static const symbol_t *sym_uuid = NULL;
165 static const symbol_t *sym_deprecated = NULL;
166 static const symbol_t *sym_restrict = NULL;
167 static const symbol_t *sym_noalias = NULL;
169 /** The token anchor set */
170 static unsigned char token_anchor_set[T_LAST_TOKEN];
172 /** The current source position. */
173 #define HERE (&token.source_position)
175 /** true if we are in GCC mode. */
176 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
178 static type_t *type_valist;
180 static statement_t *parse_compound_statement(bool inside_expression_statement);
181 static statement_t *parse_statement(void);
183 static expression_t *parse_sub_expression(unsigned precedence);
184 static expression_t *parse_expression(void);
185 static type_t *parse_typename(void);
187 static void parse_compound_type_entries(declaration_t *compound_declaration);
188 static declaration_t *parse_declarator(
189 const declaration_specifiers_t *specifiers, bool may_be_abstract);
190 static declaration_t *record_declaration(declaration_t *declaration, bool is_definition);
192 static void semantic_comparison(binary_expression_t *expression);
194 #define STORAGE_CLASSES \
202 #define TYPE_QUALIFIERS \
207 case T__forceinline: \
208 case T___attribute__:
210 #ifdef PROVIDE_COMPLEX
211 #define COMPLEX_SPECIFIERS \
213 #define IMAGINARY_SPECIFIERS \
216 #define COMPLEX_SPECIFIERS
217 #define IMAGINARY_SPECIFIERS
220 #define TYPE_SPECIFIERS \
235 case T___builtin_va_list: \
240 #define DECLARATION_START \
245 #define TYPENAME_START \
250 * Allocate an AST node with given size and
251 * initialize all fields with zero.
253 static void *allocate_ast_zero(size_t size)
255 void *res = allocate_ast(size);
256 memset(res, 0, size);
260 static declaration_t *allocate_declaration_zero(void)
262 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
263 declaration->type = type_error_type;
264 declaration->alignment = 0;
269 * Returns the size of a statement node.
271 * @param kind the statement kind
273 static size_t get_statement_struct_size(statement_kind_t kind)
275 static const size_t sizes[] = {
276 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
277 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
278 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
279 [STATEMENT_RETURN] = sizeof(return_statement_t),
280 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
281 [STATEMENT_IF] = sizeof(if_statement_t),
282 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
283 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
284 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
285 [STATEMENT_BREAK] = sizeof(statement_base_t),
286 [STATEMENT_GOTO] = sizeof(goto_statement_t),
287 [STATEMENT_LABEL] = sizeof(label_statement_t),
288 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
289 [STATEMENT_WHILE] = sizeof(while_statement_t),
290 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
291 [STATEMENT_FOR] = sizeof(for_statement_t),
292 [STATEMENT_ASM] = sizeof(asm_statement_t),
293 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
294 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
296 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
297 assert(sizes[kind] != 0);
302 * Returns the size of an expression node.
304 * @param kind the expression kind
306 static size_t get_expression_struct_size(expression_kind_t kind)
308 static const size_t sizes[] = {
309 [EXPR_INVALID] = sizeof(expression_base_t),
310 [EXPR_REFERENCE] = sizeof(reference_expression_t),
311 [EXPR_CONST] = sizeof(const_expression_t),
312 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
313 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
314 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
315 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
316 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
317 [EXPR_CALL] = sizeof(call_expression_t),
318 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
319 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
320 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
321 [EXPR_SELECT] = sizeof(select_expression_t),
322 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
323 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
324 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
325 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
326 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
327 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
328 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
329 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
330 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
331 [EXPR_VA_START] = sizeof(va_start_expression_t),
332 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
333 [EXPR_STATEMENT] = sizeof(statement_expression_t),
334 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
336 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
337 return sizes[EXPR_UNARY_FIRST];
339 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
340 return sizes[EXPR_BINARY_FIRST];
342 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
343 assert(sizes[kind] != 0);
348 * Allocate a statement node of given kind and initialize all
351 static statement_t *allocate_statement_zero(statement_kind_t kind)
353 size_t size = get_statement_struct_size(kind);
354 statement_t *res = allocate_ast_zero(size);
356 res->base.kind = kind;
357 res->base.parent = current_parent;
362 * Allocate an expression node of given kind and initialize all
365 static expression_t *allocate_expression_zero(expression_kind_t kind)
367 size_t size = get_expression_struct_size(kind);
368 expression_t *res = allocate_ast_zero(size);
370 res->base.kind = kind;
371 res->base.type = type_error_type;
376 * Creates a new invalid expression.
378 static expression_t *create_invalid_expression(void)
380 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
381 expression->base.source_position = token.source_position;
386 * Creates a new invalid statement.
388 static statement_t *create_invalid_statement(void)
390 statement_t *statement = allocate_statement_zero(STATEMENT_INVALID);
391 statement->base.source_position = token.source_position;
396 * Allocate a new empty statement.
398 static statement_t *create_empty_statement(void)
400 statement_t *statement = allocate_statement_zero(STATEMENT_EMPTY);
401 statement->base.source_position = token.source_position;
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 if (token.type == T_EOF)
642 while (token_anchor_set[token.type] == 0) {
643 if (token.type == '(' || token.type == '{' || token.type == '[')
644 eat_until_matching_token(token.type);
645 if (token.type == T_EOF)
651 static void eat_block(void)
653 eat_until_matching_token('{');
654 if (token.type == '}')
658 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while (0)
661 * Report a parse error because an expected token was not found.
664 #if defined __GNUC__ && __GNUC__ >= 4
665 __attribute__((sentinel))
667 void parse_error_expected(const char *message, ...)
669 if (message != NULL) {
670 errorf(HERE, "%s", message);
673 va_start(ap, message);
674 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
679 * Report a type error.
681 static void type_error(const char *msg, const source_position_t *source_position,
684 errorf(source_position, "%s, but found type '%T'", msg, type);
688 * Report an incompatible type.
690 static void type_error_incompatible(const char *msg,
691 const source_position_t *source_position, type_t *type1, type_t *type2)
693 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
698 * Expect the the current token is the expected token.
699 * If not, generate an error, eat the current statement,
700 * and goto the end_error label.
702 #define expect(expected) \
704 if (UNLIKELY(token.type != (expected))) { \
705 parse_error_expected(NULL, (expected), NULL); \
706 add_anchor_token(expected); \
707 eat_until_anchor(); \
708 if (token.type == expected) \
710 rem_anchor_token(expected); \
716 static void set_scope(scope_t *new_scope)
719 scope->last_declaration = last_declaration;
723 last_declaration = new_scope->last_declaration;
727 * Search a symbol in a given namespace and returns its declaration or
728 * NULL if this symbol was not found.
730 static declaration_t *get_declaration(const symbol_t *const symbol,
731 const namespace_t namespc)
733 declaration_t *declaration = symbol->declaration;
734 for( ; declaration != NULL; declaration = declaration->symbol_next) {
735 if (declaration->namespc == namespc)
743 * pushs an environment_entry on the environment stack and links the
744 * corresponding symbol to the new entry
746 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
748 symbol_t *symbol = declaration->symbol;
749 namespace_t namespc = (namespace_t) declaration->namespc;
751 /* replace/add declaration into declaration list of the symbol */
752 declaration_t *iter = symbol->declaration;
754 symbol->declaration = declaration;
756 declaration_t *iter_last = NULL;
757 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
758 /* replace an entry? */
759 if (iter->namespc == namespc) {
760 if (iter_last == NULL) {
761 symbol->declaration = declaration;
763 iter_last->symbol_next = declaration;
765 declaration->symbol_next = iter->symbol_next;
770 assert(iter_last->symbol_next == NULL);
771 iter_last->symbol_next = declaration;
775 /* remember old declaration */
777 entry.symbol = symbol;
778 entry.old_declaration = iter;
779 entry.namespc = (unsigned short) namespc;
780 ARR_APP1(stack_entry_t, *stack_ptr, entry);
784 * Push a declaration on the environment stack.
786 * @param declaration the declaration
788 static void environment_push(declaration_t *declaration)
790 assert(declaration->source_position.input_name != NULL);
791 assert(declaration->parent_scope != NULL);
792 stack_push(&environment_stack, declaration);
796 * Push a declaration on the global label stack.
798 * @param declaration the declaration
800 static void label_push(declaration_t *declaration)
802 declaration->parent_scope = ¤t_function->scope;
803 stack_push(&label_stack, declaration);
807 * Push a declaration of the local label stack.
809 * @param declaration the declaration
811 static void local_label_push(declaration_t *declaration)
813 assert(declaration->parent_scope != NULL);
814 stack_push(&local_label_stack, declaration);
818 * pops symbols from the environment stack until @p new_top is the top element
820 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
822 stack_entry_t *stack = *stack_ptr;
823 size_t top = ARR_LEN(stack);
826 assert(new_top <= top);
830 for(i = top; i > new_top; --i) {
831 stack_entry_t *entry = &stack[i - 1];
833 declaration_t *old_declaration = entry->old_declaration;
834 symbol_t *symbol = entry->symbol;
835 namespace_t namespc = (namespace_t)entry->namespc;
837 /* replace/remove declaration */
838 declaration_t *declaration = symbol->declaration;
839 assert(declaration != NULL);
840 if (declaration->namespc == namespc) {
841 if (old_declaration == NULL) {
842 symbol->declaration = declaration->symbol_next;
844 symbol->declaration = old_declaration;
847 declaration_t *iter_last = declaration;
848 declaration_t *iter = declaration->symbol_next;
849 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
850 /* replace an entry? */
851 if (iter->namespc == namespc) {
852 assert(iter_last != NULL);
853 iter_last->symbol_next = old_declaration;
854 if (old_declaration != NULL) {
855 old_declaration->symbol_next = iter->symbol_next;
860 assert(iter != NULL);
864 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
868 * Pop all entries from the environment stack until the new_top
871 * @param new_top the new stack top
873 static void environment_pop_to(size_t new_top)
875 stack_pop_to(&environment_stack, new_top);
879 * Pop all entries from the global label stack until the new_top
882 * @param new_top the new stack top
884 static void label_pop_to(size_t new_top)
886 stack_pop_to(&label_stack, new_top);
890 * Pop all entries from the local label stack until the new_top
893 * @param new_top the new stack top
895 static void local_label_pop_to(size_t new_top)
897 stack_pop_to(&local_label_stack, new_top);
901 static int get_akind_rank(atomic_type_kind_t akind)
906 static int get_rank(const type_t *type)
908 assert(!is_typeref(type));
909 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
910 * and esp. footnote 108). However we can't fold constants (yet), so we
911 * can't decide whether unsigned int is possible, while int always works.
912 * (unsigned int would be preferable when possible... for stuff like
913 * struct { enum { ... } bla : 4; } ) */
914 if (type->kind == TYPE_ENUM)
915 return get_akind_rank(ATOMIC_TYPE_INT);
917 assert(type->kind == TYPE_ATOMIC);
918 return get_akind_rank(type->atomic.akind);
921 static type_t *promote_integer(type_t *type)
923 if (type->kind == TYPE_BITFIELD)
924 type = type->bitfield.base_type;
926 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
933 * Create a cast expression.
935 * @param expression the expression to cast
936 * @param dest_type the destination type
938 static expression_t *create_cast_expression(expression_t *expression,
941 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
943 cast->unary.value = expression;
944 cast->base.type = dest_type;
950 * Check if a given expression represents the 0 pointer constant.
952 static bool is_null_pointer_constant(const expression_t *expression)
954 /* skip void* cast */
955 if (expression->kind == EXPR_UNARY_CAST
956 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
957 expression = expression->unary.value;
960 /* TODO: not correct yet, should be any constant integer expression
961 * which evaluates to 0 */
962 if (expression->kind != EXPR_CONST)
965 type_t *const type = skip_typeref(expression->base.type);
966 if (!is_type_integer(type))
969 return expression->conste.v.int_value == 0;
973 * Create an implicit cast expression.
975 * @param expression the expression to cast
976 * @param dest_type the destination type
978 static expression_t *create_implicit_cast(expression_t *expression,
981 type_t *const source_type = expression->base.type;
983 if (source_type == dest_type)
986 return create_cast_expression(expression, dest_type);
989 typedef enum assign_error_t {
991 ASSIGN_ERROR_INCOMPATIBLE,
992 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
993 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
994 ASSIGN_WARNING_POINTER_FROM_INT,
995 ASSIGN_WARNING_INT_FROM_POINTER
998 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
999 const expression_t *const right,
1000 const char *context,
1001 const source_position_t *source_position)
1003 type_t *const orig_type_right = right->base.type;
1004 type_t *const type_left = skip_typeref(orig_type_left);
1005 type_t *const type_right = skip_typeref(orig_type_right);
1008 case ASSIGN_SUCCESS:
1010 case ASSIGN_ERROR_INCOMPATIBLE:
1011 errorf(source_position,
1012 "destination type '%T' in %s is incompatible with type '%T'",
1013 orig_type_left, context, orig_type_right);
1016 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1017 type_t *points_to_left
1018 = skip_typeref(type_left->pointer.points_to);
1019 type_t *points_to_right
1020 = skip_typeref(type_right->pointer.points_to);
1022 /* the left type has all qualifiers from the right type */
1023 unsigned missing_qualifiers
1024 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1025 warningf(source_position,
1026 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1027 orig_type_left, context, orig_type_right, missing_qualifiers);
1031 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1032 warningf(source_position,
1033 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1034 orig_type_left, context, right, orig_type_right);
1037 case ASSIGN_WARNING_POINTER_FROM_INT:
1038 warningf(source_position,
1039 "%s makes pointer '%T' from integer '%T' without a cast",
1040 context, orig_type_left, orig_type_right);
1043 case ASSIGN_WARNING_INT_FROM_POINTER:
1044 warningf(source_position,
1045 "%s makes integer '%T' from pointer '%T' without a cast",
1046 context, orig_type_left, orig_type_right);
1050 panic("invalid error value");
1054 /** Implements the rules from § 6.5.16.1 */
1055 static assign_error_t semantic_assign(type_t *orig_type_left,
1056 const expression_t *const right)
1058 type_t *const orig_type_right = right->base.type;
1059 type_t *const type_left = skip_typeref(orig_type_left);
1060 type_t *const type_right = skip_typeref(orig_type_right);
1062 if (is_type_pointer(type_left)) {
1063 if (is_null_pointer_constant(right)) {
1064 return ASSIGN_SUCCESS;
1065 } else if (is_type_pointer(type_right)) {
1066 type_t *points_to_left
1067 = skip_typeref(type_left->pointer.points_to);
1068 type_t *points_to_right
1069 = skip_typeref(type_right->pointer.points_to);
1070 assign_error_t res = ASSIGN_SUCCESS;
1072 /* the left type has all qualifiers from the right type */
1073 unsigned missing_qualifiers
1074 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1075 if (missing_qualifiers != 0) {
1076 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1079 points_to_left = get_unqualified_type(points_to_left);
1080 points_to_right = get_unqualified_type(points_to_right);
1082 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
1083 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1087 if (!types_compatible(points_to_left, points_to_right)) {
1088 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1092 } else if (is_type_integer(type_right)) {
1093 return ASSIGN_WARNING_POINTER_FROM_INT;
1095 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1096 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1097 && is_type_pointer(type_right))) {
1098 return ASSIGN_SUCCESS;
1099 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1100 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1101 type_t *const unqual_type_left = get_unqualified_type(type_left);
1102 type_t *const unqual_type_right = get_unqualified_type(type_right);
1103 if (types_compatible(unqual_type_left, unqual_type_right)) {
1104 return ASSIGN_SUCCESS;
1106 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1107 return ASSIGN_WARNING_INT_FROM_POINTER;
1110 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1111 return ASSIGN_SUCCESS;
1113 return ASSIGN_ERROR_INCOMPATIBLE;
1116 static expression_t *parse_constant_expression(void)
1118 /* start parsing at precedence 7 (conditional expression) */
1119 expression_t *result = parse_sub_expression(7);
1121 if (!is_constant_expression(result)) {
1122 errorf(&result->base.source_position,
1123 "expression '%E' is not constant\n", result);
1129 static expression_t *parse_assignment_expression(void)
1131 /* start parsing at precedence 2 (assignment expression) */
1132 return parse_sub_expression(2);
1135 static type_t *make_global_typedef(const char *name, type_t *type)
1137 symbol_t *const symbol = symbol_table_insert(name);
1139 declaration_t *const declaration = allocate_declaration_zero();
1140 declaration->namespc = NAMESPACE_NORMAL;
1141 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
1142 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
1143 declaration->type = type;
1144 declaration->symbol = symbol;
1145 declaration->source_position = builtin_source_position;
1146 declaration->implicit = true;
1148 record_declaration(declaration, false);
1150 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
1151 typedef_type->typedeft.declaration = declaration;
1153 return typedef_type;
1156 static string_t parse_string_literals(void)
1158 assert(token.type == T_STRING_LITERAL);
1159 string_t result = token.v.string;
1163 while (token.type == T_STRING_LITERAL) {
1164 result = concat_strings(&result, &token.v.string);
1171 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1172 [GNU_AK_CONST] = "const",
1173 [GNU_AK_VOLATILE] = "volatile",
1174 [GNU_AK_CDECL] = "cdecl",
1175 [GNU_AK_STDCALL] = "stdcall",
1176 [GNU_AK_FASTCALL] = "fastcall",
1177 [GNU_AK_DEPRECATED] = "deprecated",
1178 [GNU_AK_NOINLINE] = "noinline",
1179 [GNU_AK_NORETURN] = "noreturn",
1180 [GNU_AK_NAKED] = "naked",
1181 [GNU_AK_PURE] = "pure",
1182 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1183 [GNU_AK_MALLOC] = "malloc",
1184 [GNU_AK_WEAK] = "weak",
1185 [GNU_AK_CONSTRUCTOR] = "constructor",
1186 [GNU_AK_DESTRUCTOR] = "destructor",
1187 [GNU_AK_NOTHROW] = "nothrow",
1188 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1189 [GNU_AK_COMMON] = "common",
1190 [GNU_AK_NOCOMMON] = "nocommon",
1191 [GNU_AK_PACKED] = "packed",
1192 [GNU_AK_SHARED] = "shared",
1193 [GNU_AK_NOTSHARED] = "notshared",
1194 [GNU_AK_USED] = "used",
1195 [GNU_AK_UNUSED] = "unused",
1196 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1197 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1198 [GNU_AK_LONGCALL] = "longcall",
1199 [GNU_AK_SHORTCALL] = "shortcall",
1200 [GNU_AK_LONG_CALL] = "long_call",
1201 [GNU_AK_SHORT_CALL] = "short_call",
1202 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1203 [GNU_AK_INTERRUPT] = "interrupt",
1204 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1205 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1206 [GNU_AK_NESTING] = "nesting",
1207 [GNU_AK_NEAR] = "near",
1208 [GNU_AK_FAR] = "far",
1209 [GNU_AK_SIGNAL] = "signal",
1210 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1211 [GNU_AK_TINY_DATA] = "tiny_data",
1212 [GNU_AK_SAVEALL] = "saveall",
1213 [GNU_AK_FLATTEN] = "flatten",
1214 [GNU_AK_SSEREGPARM] = "sseregparm",
1215 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1216 [GNU_AK_RETURN_TWICE] = "return_twice",
1217 [GNU_AK_MAY_ALIAS] = "may_alias",
1218 [GNU_AK_MS_STRUCT] = "ms_struct",
1219 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1220 [GNU_AK_DLLIMPORT] = "dllimport",
1221 [GNU_AK_DLLEXPORT] = "dllexport",
1222 [GNU_AK_ALIGNED] = "aligned",
1223 [GNU_AK_ALIAS] = "alias",
1224 [GNU_AK_SECTION] = "section",
1225 [GNU_AK_FORMAT] = "format",
1226 [GNU_AK_FORMAT_ARG] = "format_arg",
1227 [GNU_AK_WEAKREF] = "weakref",
1228 [GNU_AK_NONNULL] = "nonnull",
1229 [GNU_AK_TLS_MODEL] = "tls_model",
1230 [GNU_AK_VISIBILITY] = "visibility",
1231 [GNU_AK_REGPARM] = "regparm",
1232 [GNU_AK_MODE] = "mode",
1233 [GNU_AK_MODEL] = "model",
1234 [GNU_AK_TRAP_EXIT] = "trap_exit",
1235 [GNU_AK_SP_SWITCH] = "sp_switch",
1236 [GNU_AK_SENTINEL] = "sentinel"
1240 * compare two string, ignoring double underscores on the second.
1242 static int strcmp_underscore(const char *s1, const char *s2)
1244 if (s2[0] == '_' && s2[1] == '_') {
1245 size_t len2 = strlen(s2);
1246 size_t len1 = strlen(s1);
1247 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1248 return strncmp(s1, s2+2, len2-4);
1252 return strcmp(s1, s2);
1256 * Allocate a new gnu temporal attribute.
1258 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1260 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1261 attribute->kind = kind;
1262 attribute->next = NULL;
1263 attribute->invalid = false;
1264 attribute->have_arguments = false;
1270 * parse one constant expression argument.
1272 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1274 expression_t *expression;
1275 add_anchor_token(')');
1276 expression = parse_constant_expression();
1277 rem_anchor_token(')');
1279 attribute->u.argument = fold_constant(expression);
1282 attribute->invalid = true;
1286 * parse a list of constant expressions arguments.
1288 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1290 argument_list_t **list = &attribute->u.arguments;
1291 argument_list_t *entry;
1292 expression_t *expression;
1293 add_anchor_token(')');
1294 add_anchor_token(',');
1296 expression = parse_constant_expression();
1297 entry = obstack_alloc(&temp_obst, sizeof(entry));
1298 entry->argument = fold_constant(expression);
1301 list = &entry->next;
1302 if (token.type != ',')
1306 rem_anchor_token(',');
1307 rem_anchor_token(')');
1311 attribute->invalid = true;
1315 * parse one string literal argument.
1317 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1320 add_anchor_token('(');
1321 if (token.type != T_STRING_LITERAL) {
1322 parse_error_expected("while parsing attribute directive",
1323 T_STRING_LITERAL, NULL);
1326 *string = parse_string_literals();
1327 rem_anchor_token('(');
1331 attribute->invalid = true;
1335 * parse one tls model.
1337 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1339 static const char *const tls_models[] = {
1345 string_t string = { NULL, 0 };
1346 parse_gnu_attribute_string_arg(attribute, &string);
1347 if (string.begin != NULL) {
1348 for(size_t i = 0; i < 4; ++i) {
1349 if (strcmp(tls_models[i], string.begin) == 0) {
1350 attribute->u.value = i;
1354 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1356 attribute->invalid = true;
1360 * parse one tls model.
1362 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1364 static const char *const visibilities[] = {
1370 string_t string = { NULL, 0 };
1371 parse_gnu_attribute_string_arg(attribute, &string);
1372 if (string.begin != NULL) {
1373 for(size_t i = 0; i < 4; ++i) {
1374 if (strcmp(visibilities[i], string.begin) == 0) {
1375 attribute->u.value = i;
1379 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1381 attribute->invalid = true;
1385 * parse one (code) model.
1387 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1389 static const char *const visibilities[] = {
1394 string_t string = { NULL, 0 };
1395 parse_gnu_attribute_string_arg(attribute, &string);
1396 if (string.begin != NULL) {
1397 for(int i = 0; i < 3; ++i) {
1398 if (strcmp(visibilities[i], string.begin) == 0) {
1399 attribute->u.value = i;
1403 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1405 attribute->invalid = true;
1408 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1410 /* TODO: find out what is allowed here... */
1412 /* at least: byte, word, pointer, list of machine modes
1413 * __XXX___ is interpreted as XXX */
1414 add_anchor_token(')');
1416 if (token.type != T_IDENTIFIER) {
1417 expect(T_IDENTIFIER);
1420 /* This isn't really correct, the backend should provide a list of machine
1421 * specific modes (according to gcc philosophy that is...) */
1422 const char *symbol_str = token.v.symbol->string;
1423 if (strcmp_underscore("QI", symbol_str) == 0 ||
1424 strcmp_underscore("byte", symbol_str) == 0) {
1425 attribute->u.akind = ATOMIC_TYPE_CHAR;
1426 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1427 attribute->u.akind = ATOMIC_TYPE_SHORT;
1428 } else if (strcmp_underscore("SI", symbol_str) == 0
1429 || strcmp_underscore("word", symbol_str) == 0
1430 || strcmp_underscore("pointer", symbol_str) == 0) {
1431 attribute->u.akind = ATOMIC_TYPE_INT;
1432 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1433 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1435 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1436 attribute->invalid = true;
1440 rem_anchor_token(')');
1444 attribute->invalid = true;
1448 * parse one interrupt argument.
1450 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1452 static const char *const interrupts[] = {
1459 string_t string = { NULL, 0 };
1460 parse_gnu_attribute_string_arg(attribute, &string);
1461 if (string.begin != NULL) {
1462 for(size_t i = 0; i < 5; ++i) {
1463 if (strcmp(interrupts[i], string.begin) == 0) {
1464 attribute->u.value = i;
1468 errorf(HERE, "'%s' is not an interrupt", string.begin);
1470 attribute->invalid = true;
1474 * parse ( identifier, const expression, const expression )
1476 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1478 static const char *const format_names[] = {
1486 if (token.type != T_IDENTIFIER) {
1487 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1490 const char *name = token.v.symbol->string;
1491 for(i = 0; i < 4; ++i) {
1492 if (strcmp_underscore(format_names[i], name) == 0)
1496 if (warning.attribute)
1497 warningf(HERE, "'%s' is an unrecognized format function type", name);
1502 add_anchor_token(')');
1503 add_anchor_token(',');
1504 parse_constant_expression();
1505 rem_anchor_token(',');
1506 rem_anchor_token(')');
1509 add_anchor_token(')');
1510 parse_constant_expression();
1511 rem_anchor_token(')');
1515 attribute->u.value = true;
1518 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1520 if (!attribute->have_arguments)
1523 /* should have no arguments */
1524 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1525 eat_until_matching_token('(');
1526 /* we have already consumed '(', so we stop before ')', eat it */
1528 attribute->invalid = true;
1532 * Parse one GNU attribute.
1534 * Note that attribute names can be specified WITH or WITHOUT
1535 * double underscores, ie const or __const__.
1537 * The following attributes are parsed without arguments
1562 * no_instrument_function
1563 * warn_unused_result
1580 * externally_visible
1588 * The following attributes are parsed with arguments
1589 * aligned( const expression )
1590 * alias( string literal )
1591 * section( string literal )
1592 * format( identifier, const expression, const expression )
1593 * format_arg( const expression )
1594 * tls_model( string literal )
1595 * visibility( string literal )
1596 * regparm( const expression )
1597 * model( string leteral )
1598 * trap_exit( const expression )
1599 * sp_switch( string literal )
1601 * The following attributes might have arguments
1602 * weak_ref( string literal )
1603 * non_null( const expression // ',' )
1604 * interrupt( string literal )
1605 * sentinel( constant expression )
1607 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1609 gnu_attribute_t *head = *attributes;
1610 gnu_attribute_t *last = *attributes;
1611 decl_modifiers_t modifiers = 0;
1612 gnu_attribute_t *attribute;
1614 eat(T___attribute__);
1618 if (token.type != ')') {
1619 /* find the end of the list */
1621 while (last->next != NULL)
1625 /* non-empty attribute list */
1628 if (token.type == T_const) {
1630 } else if (token.type == T_volatile) {
1632 } else if (token.type == T_cdecl) {
1633 /* __attribute__((cdecl)), WITH ms mode */
1635 } else if (token.type == T_IDENTIFIER) {
1636 const symbol_t *sym = token.v.symbol;
1639 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1646 for(i = 0; i < GNU_AK_LAST; ++i) {
1647 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1650 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1653 if (kind == GNU_AK_LAST) {
1654 if (warning.attribute)
1655 warningf(HERE, "'%s' attribute directive ignored", name);
1657 /* skip possible arguments */
1658 if (token.type == '(') {
1659 eat_until_matching_token(')');
1662 /* check for arguments */
1663 attribute = allocate_gnu_attribute(kind);
1664 if (token.type == '(') {
1666 if (token.type == ')') {
1667 /* empty args are allowed */
1670 attribute->have_arguments = true;
1675 case GNU_AK_VOLATILE:
1680 case GNU_AK_NOCOMMON:
1682 case GNU_AK_NOTSHARED:
1683 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1684 case GNU_AK_WARN_UNUSED_RESULT:
1685 case GNU_AK_LONGCALL:
1686 case GNU_AK_SHORTCALL:
1687 case GNU_AK_LONG_CALL:
1688 case GNU_AK_SHORT_CALL:
1689 case GNU_AK_FUNCTION_VECTOR:
1690 case GNU_AK_INTERRUPT_HANDLER:
1691 case GNU_AK_NMI_HANDLER:
1692 case GNU_AK_NESTING:
1696 case GNU_AK_EIGTHBIT_DATA:
1697 case GNU_AK_TINY_DATA:
1698 case GNU_AK_SAVEALL:
1699 case GNU_AK_FLATTEN:
1700 case GNU_AK_SSEREGPARM:
1701 case GNU_AK_EXTERNALLY_VISIBLE:
1702 case GNU_AK_RETURN_TWICE:
1703 case GNU_AK_MAY_ALIAS:
1704 case GNU_AK_MS_STRUCT:
1705 case GNU_AK_GCC_STRUCT:
1708 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1709 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1710 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1711 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1712 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1713 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1714 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1715 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1716 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1717 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1718 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1719 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1720 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1721 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1722 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1723 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1724 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1726 case GNU_AK_ALIGNED:
1727 /* __align__ may be used without an argument */
1728 if (attribute->have_arguments) {
1729 parse_gnu_attribute_const_arg(attribute);
1733 case GNU_AK_FORMAT_ARG:
1734 case GNU_AK_REGPARM:
1735 case GNU_AK_TRAP_EXIT:
1736 if (!attribute->have_arguments) {
1737 /* should have arguments */
1738 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1739 attribute->invalid = true;
1741 parse_gnu_attribute_const_arg(attribute);
1744 case GNU_AK_SECTION:
1745 case GNU_AK_SP_SWITCH:
1746 if (!attribute->have_arguments) {
1747 /* should have arguments */
1748 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1749 attribute->invalid = true;
1751 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1754 if (!attribute->have_arguments) {
1755 /* should have arguments */
1756 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1757 attribute->invalid = true;
1759 parse_gnu_attribute_format_args(attribute);
1761 case GNU_AK_WEAKREF:
1762 /* may have one string argument */
1763 if (attribute->have_arguments)
1764 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1766 case GNU_AK_NONNULL:
1767 if (attribute->have_arguments)
1768 parse_gnu_attribute_const_arg_list(attribute);
1770 case GNU_AK_TLS_MODEL:
1771 if (!attribute->have_arguments) {
1772 /* should have arguments */
1773 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1775 parse_gnu_attribute_tls_model_arg(attribute);
1777 case GNU_AK_VISIBILITY:
1778 if (!attribute->have_arguments) {
1779 /* should have arguments */
1780 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1782 parse_gnu_attribute_visibility_arg(attribute);
1785 if (!attribute->have_arguments) {
1786 /* should have arguments */
1787 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1789 parse_gnu_attribute_model_arg(attribute);
1793 if (!attribute->have_arguments) {
1794 /* should have arguments */
1795 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1797 parse_gnu_attribute_mode_arg(attribute);
1800 case GNU_AK_INTERRUPT:
1801 /* may have one string argument */
1802 if (attribute->have_arguments)
1803 parse_gnu_attribute_interrupt_arg(attribute);
1805 case GNU_AK_SENTINEL:
1806 /* may have one string argument */
1807 if (attribute->have_arguments)
1808 parse_gnu_attribute_const_arg(attribute);
1811 /* already handled */
1815 check_no_argument(attribute, name);
1818 if (attribute != NULL) {
1820 last->next = attribute;
1823 head = last = attribute;
1827 if (token.type != ',')
1841 * Parse GNU attributes.
1843 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1845 decl_modifiers_t modifiers = 0;
1848 switch(token.type) {
1849 case T___attribute__:
1850 modifiers |= parse_gnu_attribute(attributes);
1856 if (token.type != T_STRING_LITERAL) {
1857 parse_error_expected("while parsing assembler attribute",
1858 T_STRING_LITERAL, NULL);
1859 eat_until_matching_token('(');
1862 parse_string_literals();
1867 case T_cdecl: modifiers |= DM_CDECL; break;
1868 case T__fastcall: modifiers |= DM_FASTCALL; break;
1869 case T__stdcall: modifiers |= DM_STDCALL; break;
1872 /* TODO record modifier */
1873 warningf(HERE, "Ignoring declaration modifier %K", &token);
1877 default: return modifiers;
1884 static designator_t *parse_designation(void)
1886 designator_t *result = NULL;
1887 designator_t *last = NULL;
1890 designator_t *designator;
1891 switch(token.type) {
1893 designator = allocate_ast_zero(sizeof(designator[0]));
1894 designator->source_position = token.source_position;
1896 add_anchor_token(']');
1897 designator->array_index = parse_constant_expression();
1898 rem_anchor_token(']');
1902 designator = allocate_ast_zero(sizeof(designator[0]));
1903 designator->source_position = token.source_position;
1905 if (token.type != T_IDENTIFIER) {
1906 parse_error_expected("while parsing designator",
1907 T_IDENTIFIER, NULL);
1910 designator->symbol = token.v.symbol;
1918 assert(designator != NULL);
1920 last->next = designator;
1922 result = designator;
1930 static initializer_t *initializer_from_string(array_type_t *type,
1931 const string_t *const string)
1933 /* TODO: check len vs. size of array type */
1936 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1937 initializer->string.string = *string;
1942 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1943 wide_string_t *const string)
1945 /* TODO: check len vs. size of array type */
1948 initializer_t *const initializer =
1949 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1950 initializer->wide_string.string = *string;
1956 * Build an initializer from a given expression.
1958 static initializer_t *initializer_from_expression(type_t *orig_type,
1959 expression_t *expression)
1961 /* TODO check that expression is a constant expression */
1963 /* § 6.7.8.14/15 char array may be initialized by string literals */
1964 type_t *type = skip_typeref(orig_type);
1965 type_t *expr_type_orig = expression->base.type;
1966 type_t *expr_type = skip_typeref(expr_type_orig);
1967 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1968 array_type_t *const array_type = &type->array;
1969 type_t *const element_type = skip_typeref(array_type->element_type);
1971 if (element_type->kind == TYPE_ATOMIC) {
1972 atomic_type_kind_t akind = element_type->atomic.akind;
1973 switch (expression->kind) {
1974 case EXPR_STRING_LITERAL:
1975 if (akind == ATOMIC_TYPE_CHAR
1976 || akind == ATOMIC_TYPE_SCHAR
1977 || akind == ATOMIC_TYPE_UCHAR) {
1978 return initializer_from_string(array_type,
1979 &expression->string.value);
1982 case EXPR_WIDE_STRING_LITERAL: {
1983 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1984 if (get_unqualified_type(element_type) == bare_wchar_type) {
1985 return initializer_from_wide_string(array_type,
1986 &expression->wide_string.value);
1996 assign_error_t error = semantic_assign(type, expression);
1997 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1999 report_assign_error(error, type, expression, "initializer",
2000 &expression->base.source_position);
2002 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
2003 result->value.value = create_implicit_cast(expression, type);
2009 * Checks if a given expression can be used as an constant initializer.
2011 static bool is_initializer_constant(const expression_t *expression)
2013 return is_constant_expression(expression)
2014 || is_address_constant(expression);
2018 * Parses an scalar initializer.
2020 * § 6.7.8.11; eat {} without warning
2022 static initializer_t *parse_scalar_initializer(type_t *type,
2023 bool must_be_constant)
2025 /* there might be extra {} hierarchies */
2027 if (token.type == '{') {
2028 warningf(HERE, "extra curly braces around scalar initializer");
2032 } while (token.type == '{');
2035 expression_t *expression = parse_assignment_expression();
2036 if (must_be_constant && !is_initializer_constant(expression)) {
2037 errorf(&expression->base.source_position,
2038 "Initialisation expression '%E' is not constant\n",
2042 initializer_t *initializer = initializer_from_expression(type, expression);
2044 if (initializer == NULL) {
2045 errorf(&expression->base.source_position,
2046 "expression '%E' (type '%T') doesn't match expected type '%T'",
2047 expression, expression->base.type, type);
2052 bool additional_warning_displayed = false;
2053 while (braces > 0) {
2054 if (token.type == ',') {
2057 if (token.type != '}') {
2058 if (!additional_warning_displayed) {
2059 warningf(HERE, "additional elements in scalar initializer");
2060 additional_warning_displayed = true;
2071 * An entry in the type path.
2073 typedef struct type_path_entry_t type_path_entry_t;
2074 struct type_path_entry_t {
2075 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2077 size_t index; /**< For array types: the current index. */
2078 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2083 * A type path expression a position inside compound or array types.
2085 typedef struct type_path_t type_path_t;
2086 struct type_path_t {
2087 type_path_entry_t *path; /**< An flexible array containing the current path. */
2088 type_t *top_type; /**< type of the element the path points */
2089 size_t max_index; /**< largest index in outermost array */
2093 * Prints a type path for debugging.
2095 static __attribute__((unused)) void debug_print_type_path(
2096 const type_path_t *path)
2098 size_t len = ARR_LEN(path->path);
2100 for(size_t i = 0; i < len; ++i) {
2101 const type_path_entry_t *entry = & path->path[i];
2103 type_t *type = skip_typeref(entry->type);
2104 if (is_type_compound(type)) {
2105 /* in gcc mode structs can have no members */
2106 if (entry->v.compound_entry == NULL) {
2110 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
2111 } else if (is_type_array(type)) {
2112 fprintf(stderr, "[%zu]", entry->v.index);
2114 fprintf(stderr, "-INVALID-");
2117 if (path->top_type != NULL) {
2118 fprintf(stderr, " (");
2119 print_type(path->top_type);
2120 fprintf(stderr, ")");
2125 * Return the top type path entry, ie. in a path
2126 * (type).a.b returns the b.
2128 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2130 size_t len = ARR_LEN(path->path);
2132 return &path->path[len-1];
2136 * Enlarge the type path by an (empty) element.
2138 static type_path_entry_t *append_to_type_path(type_path_t *path)
2140 size_t len = ARR_LEN(path->path);
2141 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2143 type_path_entry_t *result = & path->path[len];
2144 memset(result, 0, sizeof(result[0]));
2149 * Descending into a sub-type. Enter the scope of the current
2152 static void descend_into_subtype(type_path_t *path)
2154 type_t *orig_top_type = path->top_type;
2155 type_t *top_type = skip_typeref(orig_top_type);
2157 type_path_entry_t *top = append_to_type_path(path);
2158 top->type = top_type;
2160 if (is_type_compound(top_type)) {
2161 declaration_t *declaration = top_type->compound.declaration;
2162 declaration_t *entry = declaration->scope.declarations;
2163 top->v.compound_entry = entry;
2165 if (entry != NULL) {
2166 path->top_type = entry->type;
2168 path->top_type = NULL;
2170 } else if (is_type_array(top_type)) {
2172 path->top_type = top_type->array.element_type;
2174 assert(!is_type_valid(top_type));
2179 * Pop an entry from the given type path, ie. returning from
2180 * (type).a.b to (type).a
2182 static void ascend_from_subtype(type_path_t *path)
2184 type_path_entry_t *top = get_type_path_top(path);
2186 path->top_type = top->type;
2188 size_t len = ARR_LEN(path->path);
2189 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2193 * Pop entries from the given type path until the given
2194 * path level is reached.
2196 static void ascend_to(type_path_t *path, size_t top_path_level)
2198 size_t len = ARR_LEN(path->path);
2200 while (len > top_path_level) {
2201 ascend_from_subtype(path);
2202 len = ARR_LEN(path->path);
2206 static bool walk_designator(type_path_t *path, const designator_t *designator,
2207 bool used_in_offsetof)
2209 for( ; designator != NULL; designator = designator->next) {
2210 type_path_entry_t *top = get_type_path_top(path);
2211 type_t *orig_type = top->type;
2213 type_t *type = skip_typeref(orig_type);
2215 if (designator->symbol != NULL) {
2216 symbol_t *symbol = designator->symbol;
2217 if (!is_type_compound(type)) {
2218 if (is_type_valid(type)) {
2219 errorf(&designator->source_position,
2220 "'.%Y' designator used for non-compound type '%T'",
2226 declaration_t *declaration = type->compound.declaration;
2227 declaration_t *iter = declaration->scope.declarations;
2228 for( ; iter != NULL; iter = iter->next) {
2229 if (iter->symbol == symbol) {
2234 errorf(&designator->source_position,
2235 "'%T' has no member named '%Y'", orig_type, symbol);
2238 if (used_in_offsetof) {
2239 type_t *real_type = skip_typeref(iter->type);
2240 if (real_type->kind == TYPE_BITFIELD) {
2241 errorf(&designator->source_position,
2242 "offsetof designator '%Y' may not specify bitfield",
2248 top->type = orig_type;
2249 top->v.compound_entry = iter;
2250 orig_type = iter->type;
2252 expression_t *array_index = designator->array_index;
2253 assert(designator->array_index != NULL);
2255 if (!is_type_array(type)) {
2256 if (is_type_valid(type)) {
2257 errorf(&designator->source_position,
2258 "[%E] designator used for non-array type '%T'",
2259 array_index, orig_type);
2263 if (!is_type_valid(array_index->base.type)) {
2267 long index = fold_constant(array_index);
2268 if (!used_in_offsetof) {
2270 errorf(&designator->source_position,
2271 "array index [%E] must be positive", array_index);
2274 if (type->array.size_constant == true) {
2275 long array_size = type->array.size;
2276 if (index >= array_size) {
2277 errorf(&designator->source_position,
2278 "designator [%E] (%d) exceeds array size %d",
2279 array_index, index, array_size);
2285 top->type = orig_type;
2286 top->v.index = (size_t) index;
2287 orig_type = type->array.element_type;
2289 path->top_type = orig_type;
2291 if (designator->next != NULL) {
2292 descend_into_subtype(path);
2301 static void advance_current_object(type_path_t *path, size_t top_path_level)
2303 type_path_entry_t *top = get_type_path_top(path);
2305 type_t *type = skip_typeref(top->type);
2306 if (is_type_union(type)) {
2307 /* in unions only the first element is initialized */
2308 top->v.compound_entry = NULL;
2309 } else if (is_type_struct(type)) {
2310 declaration_t *entry = top->v.compound_entry;
2312 entry = entry->next;
2313 top->v.compound_entry = entry;
2314 if (entry != NULL) {
2315 path->top_type = entry->type;
2319 assert(is_type_array(type));
2323 if (!type->array.size_constant || top->v.index < type->array.size) {
2328 /* we're past the last member of the current sub-aggregate, try if we
2329 * can ascend in the type hierarchy and continue with another subobject */
2330 size_t len = ARR_LEN(path->path);
2332 if (len > top_path_level) {
2333 ascend_from_subtype(path);
2334 advance_current_object(path, top_path_level);
2336 path->top_type = NULL;
2341 * skip until token is found.
2343 static void skip_until(int type)
2345 while (token.type != type) {
2346 if (token.type == T_EOF)
2353 * skip any {...} blocks until a closing bracket is reached.
2355 static void skip_initializers(void)
2357 if (token.type == '{')
2360 while (token.type != '}') {
2361 if (token.type == T_EOF)
2363 if (token.type == '{') {
2371 static initializer_t *create_empty_initializer(void)
2373 static initializer_t empty_initializer
2374 = { .list = { { INITIALIZER_LIST }, 0 } };
2375 return &empty_initializer;
2379 * Parse a part of an initialiser for a struct or union,
2381 static initializer_t *parse_sub_initializer(type_path_t *path,
2382 type_t *outer_type, size_t top_path_level,
2383 parse_initializer_env_t *env)
2385 if (token.type == '}') {
2386 /* empty initializer */
2387 return create_empty_initializer();
2390 type_t *orig_type = path->top_type;
2391 type_t *type = NULL;
2393 if (orig_type == NULL) {
2394 /* We are initializing an empty compound. */
2396 type = skip_typeref(orig_type);
2398 /* we can't do usefull stuff if we didn't even parse the type. Skip the
2399 * initializers in this case. */
2400 if (!is_type_valid(type)) {
2401 skip_initializers();
2402 return create_empty_initializer();
2406 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2409 designator_t *designator = NULL;
2410 if (token.type == '.' || token.type == '[') {
2411 designator = parse_designation();
2412 goto finish_designator;
2413 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2414 /* GNU-style designator ("identifier: value") */
2415 designator = allocate_ast_zero(sizeof(designator[0]));
2416 designator->source_position = token.source_position;
2417 designator->symbol = token.v.symbol;
2422 /* reset path to toplevel, evaluate designator from there */
2423 ascend_to(path, top_path_level);
2424 if (!walk_designator(path, designator, false)) {
2425 /* can't continue after designation error */
2429 initializer_t *designator_initializer
2430 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2431 designator_initializer->designator.designator = designator;
2432 ARR_APP1(initializer_t*, initializers, designator_initializer);
2434 orig_type = path->top_type;
2435 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2440 if (token.type == '{') {
2441 if (type != NULL && is_type_scalar(type)) {
2442 sub = parse_scalar_initializer(type, env->must_be_constant);
2446 if (env->declaration != NULL) {
2447 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2448 env->declaration->symbol);
2450 errorf(HERE, "extra brace group at end of initializer");
2453 descend_into_subtype(path);
2455 add_anchor_token('}');
2456 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2458 rem_anchor_token('}');
2461 ascend_from_subtype(path);
2465 goto error_parse_next;
2469 /* must be an expression */
2470 expression_t *expression = parse_assignment_expression();
2472 if (env->must_be_constant && !is_initializer_constant(expression)) {
2473 errorf(&expression->base.source_position,
2474 "Initialisation expression '%E' is not constant\n",
2479 /* we are already outside, ... */
2480 if (is_type_compound(outer_type) &&
2481 !outer_type->compound.declaration->init.complete) {
2482 goto error_parse_next;
2487 /* handle { "string" } special case */
2488 if ((expression->kind == EXPR_STRING_LITERAL
2489 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2490 && outer_type != NULL) {
2491 sub = initializer_from_expression(outer_type, expression);
2493 if (token.type == ',') {
2496 if (token.type != '}') {
2497 warningf(HERE, "excessive elements in initializer for type '%T'",
2500 /* TODO: eat , ... */
2505 /* descend into subtypes until expression matches type */
2507 orig_type = path->top_type;
2508 type = skip_typeref(orig_type);
2510 sub = initializer_from_expression(orig_type, expression);
2514 if (!is_type_valid(type)) {
2517 if (is_type_scalar(type)) {
2518 errorf(&expression->base.source_position,
2519 "expression '%E' doesn't match expected type '%T'",
2520 expression, orig_type);
2524 descend_into_subtype(path);
2528 /* update largest index of top array */
2529 const type_path_entry_t *first = &path->path[0];
2530 type_t *first_type = first->type;
2531 first_type = skip_typeref(first_type);
2532 if (is_type_array(first_type)) {
2533 size_t index = first->v.index;
2534 if (index > path->max_index)
2535 path->max_index = index;
2539 /* append to initializers list */
2540 ARR_APP1(initializer_t*, initializers, sub);
2543 if (env->declaration != NULL)
2544 warningf(HERE, "excess elements in struct initializer for '%Y'",
2545 env->declaration->symbol);
2547 warningf(HERE, "excess elements in struct initializer");
2551 if (token.type == '}') {
2555 if (token.type == '}') {
2560 /* advance to the next declaration if we are not at the end */
2561 advance_current_object(path, top_path_level);
2562 orig_type = path->top_type;
2563 if (orig_type != NULL)
2564 type = skip_typeref(orig_type);
2570 size_t len = ARR_LEN(initializers);
2571 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2572 initializer_t *result = allocate_ast_zero(size);
2573 result->kind = INITIALIZER_LIST;
2574 result->list.len = len;
2575 memcpy(&result->list.initializers, initializers,
2576 len * sizeof(initializers[0]));
2578 DEL_ARR_F(initializers);
2579 ascend_to(path, top_path_level+1);
2584 skip_initializers();
2585 DEL_ARR_F(initializers);
2586 ascend_to(path, top_path_level+1);
2591 * Parses an initializer. Parsers either a compound literal
2592 * (env->declaration == NULL) or an initializer of a declaration.
2594 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2596 type_t *type = skip_typeref(env->type);
2597 initializer_t *result = NULL;
2600 if (is_type_scalar(type)) {
2601 result = parse_scalar_initializer(type, env->must_be_constant);
2602 } else if (token.type == '{') {
2606 memset(&path, 0, sizeof(path));
2607 path.top_type = env->type;
2608 path.path = NEW_ARR_F(type_path_entry_t, 0);
2610 descend_into_subtype(&path);
2612 add_anchor_token('}');
2613 result = parse_sub_initializer(&path, env->type, 1, env);
2614 rem_anchor_token('}');
2616 max_index = path.max_index;
2617 DEL_ARR_F(path.path);
2621 /* parse_scalar_initializer() also works in this case: we simply
2622 * have an expression without {} around it */
2623 result = parse_scalar_initializer(type, env->must_be_constant);
2626 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2627 * the array type size */
2628 if (is_type_array(type) && type->array.size_expression == NULL
2629 && result != NULL) {
2631 switch (result->kind) {
2632 case INITIALIZER_LIST:
2633 size = max_index + 1;
2636 case INITIALIZER_STRING:
2637 size = result->string.string.size;
2640 case INITIALIZER_WIDE_STRING:
2641 size = result->wide_string.string.size;
2644 case INITIALIZER_DESIGNATOR:
2645 case INITIALIZER_VALUE:
2646 /* can happen for parse errors */
2651 internal_errorf(HERE, "invalid initializer type");
2654 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2655 cnst->base.type = type_size_t;
2656 cnst->conste.v.int_value = size;
2658 type_t *new_type = duplicate_type(type);
2660 new_type->array.size_expression = cnst;
2661 new_type->array.size_constant = true;
2662 new_type->array.size = size;
2663 env->type = new_type;
2671 static declaration_t *append_declaration(declaration_t *declaration);
2673 static declaration_t *parse_compound_type_specifier(bool is_struct)
2675 gnu_attribute_t *attributes = NULL;
2676 decl_modifiers_t modifiers = 0;
2683 symbol_t *symbol = NULL;
2684 declaration_t *declaration = NULL;
2686 if (token.type == T___attribute__) {
2687 modifiers |= parse_attributes(&attributes);
2690 if (token.type == T_IDENTIFIER) {
2691 symbol = token.v.symbol;
2694 namespace_t const namespc =
2695 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2696 declaration = get_declaration(symbol, namespc);
2697 if (declaration != NULL) {
2698 if (declaration->parent_scope != scope &&
2699 (token.type == '{' || token.type == ';')) {
2701 } else if (declaration->init.complete &&
2702 token.type == '{') {
2703 assert(symbol != NULL);
2704 errorf(HERE, "multiple definitions of '%s %Y' (previous definition at %P)",
2705 is_struct ? "struct" : "union", symbol,
2706 &declaration->source_position);
2707 declaration->scope.declarations = NULL;
2710 } else if (token.type != '{') {
2712 parse_error_expected("while parsing struct type specifier",
2713 T_IDENTIFIER, '{', NULL);
2715 parse_error_expected("while parsing union type specifier",
2716 T_IDENTIFIER, '{', NULL);
2722 if (declaration == NULL) {
2723 declaration = allocate_declaration_zero();
2724 declaration->namespc =
2725 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2726 declaration->source_position = token.source_position;
2727 declaration->symbol = symbol;
2728 declaration->parent_scope = scope;
2729 if (symbol != NULL) {
2730 environment_push(declaration);
2732 append_declaration(declaration);
2735 if (token.type == '{') {
2736 declaration->init.complete = true;
2738 parse_compound_type_entries(declaration);
2739 modifiers |= parse_attributes(&attributes);
2742 declaration->modifiers |= modifiers;
2746 static void parse_enum_entries(type_t *const enum_type)
2750 if (token.type == '}') {
2752 errorf(HERE, "empty enum not allowed");
2756 add_anchor_token('}');
2758 if (token.type != T_IDENTIFIER) {
2759 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2761 rem_anchor_token('}');
2765 declaration_t *const entry = allocate_declaration_zero();
2766 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
2767 entry->type = enum_type;
2768 entry->symbol = token.v.symbol;
2769 entry->source_position = token.source_position;
2772 if (token.type == '=') {
2774 expression_t *value = parse_constant_expression();
2776 value = create_implicit_cast(value, enum_type);
2777 entry->init.enum_value = value;
2782 record_declaration(entry, false);
2784 if (token.type != ',')
2787 } while (token.type != '}');
2788 rem_anchor_token('}');
2796 static type_t *parse_enum_specifier(void)
2798 gnu_attribute_t *attributes = NULL;
2799 declaration_t *declaration;
2803 if (token.type == T_IDENTIFIER) {
2804 symbol = token.v.symbol;
2807 declaration = get_declaration(symbol, NAMESPACE_ENUM);
2808 } else if (token.type != '{') {
2809 parse_error_expected("while parsing enum type specifier",
2810 T_IDENTIFIER, '{', NULL);
2817 if (declaration == NULL) {
2818 declaration = allocate_declaration_zero();
2819 declaration->namespc = NAMESPACE_ENUM;
2820 declaration->source_position = token.source_position;
2821 declaration->symbol = symbol;
2822 declaration->parent_scope = scope;
2825 type_t *const type = allocate_type_zero(TYPE_ENUM, &declaration->source_position);
2826 type->enumt.declaration = declaration;
2828 if (token.type == '{') {
2829 if (declaration->init.complete) {
2830 errorf(HERE, "multiple definitions of enum %Y", symbol);
2832 if (symbol != NULL) {
2833 environment_push(declaration);
2835 append_declaration(declaration);
2836 declaration->init.complete = true;
2838 parse_enum_entries(type);
2839 parse_attributes(&attributes);
2846 * if a symbol is a typedef to another type, return true
2848 static bool is_typedef_symbol(symbol_t *symbol)
2850 const declaration_t *const declaration =
2851 get_declaration(symbol, NAMESPACE_NORMAL);
2853 declaration != NULL &&
2854 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
2857 static type_t *parse_typeof(void)
2864 add_anchor_token(')');
2866 expression_t *expression = NULL;
2868 bool old_type_prop = in_type_prop;
2869 bool old_gcc_extension = in_gcc_extension;
2870 in_type_prop = true;
2872 while (token.type == T___extension__) {
2873 /* This can be a prefix to a typename or an expression. */
2875 in_gcc_extension = true;
2877 switch (token.type) {
2879 if (is_typedef_symbol(token.v.symbol)) {
2880 type = parse_typename();
2882 expression = parse_expression();
2883 type = expression->base.type;
2888 type = parse_typename();
2892 expression = parse_expression();
2893 type = expression->base.type;
2896 in_type_prop = old_type_prop;
2897 in_gcc_extension = old_gcc_extension;
2899 rem_anchor_token(')');
2902 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, &expression->base.source_position);
2903 typeof_type->typeoft.expression = expression;
2904 typeof_type->typeoft.typeof_type = type;
2911 typedef enum specifiers_t {
2912 SPECIFIER_SIGNED = 1 << 0,
2913 SPECIFIER_UNSIGNED = 1 << 1,
2914 SPECIFIER_LONG = 1 << 2,
2915 SPECIFIER_INT = 1 << 3,
2916 SPECIFIER_DOUBLE = 1 << 4,
2917 SPECIFIER_CHAR = 1 << 5,
2918 SPECIFIER_SHORT = 1 << 6,
2919 SPECIFIER_LONG_LONG = 1 << 7,
2920 SPECIFIER_FLOAT = 1 << 8,
2921 SPECIFIER_BOOL = 1 << 9,
2922 SPECIFIER_VOID = 1 << 10,
2923 SPECIFIER_INT8 = 1 << 11,
2924 SPECIFIER_INT16 = 1 << 12,
2925 SPECIFIER_INT32 = 1 << 13,
2926 SPECIFIER_INT64 = 1 << 14,
2927 SPECIFIER_INT128 = 1 << 15,
2928 SPECIFIER_COMPLEX = 1 << 16,
2929 SPECIFIER_IMAGINARY = 1 << 17,
2932 static type_t *create_builtin_type(symbol_t *const symbol,
2933 type_t *const real_type)
2935 type_t *type = allocate_type_zero(TYPE_BUILTIN, &builtin_source_position);
2936 type->builtin.symbol = symbol;
2937 type->builtin.real_type = real_type;
2939 type_t *result = typehash_insert(type);
2940 if (type != result) {
2947 static type_t *get_typedef_type(symbol_t *symbol)
2949 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
2950 if (declaration == NULL ||
2951 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
2954 type_t *type = allocate_type_zero(TYPE_TYPEDEF, &declaration->source_position);
2955 type->typedeft.declaration = declaration;
2961 * check for the allowed MS alignment values.
2963 static bool check_alignment_value(long long intvalue)
2965 if (intvalue < 1 || intvalue > 8192) {
2966 errorf(HERE, "illegal alignment value");
2969 unsigned v = (unsigned)intvalue;
2970 for (unsigned i = 1; i <= 8192; i += i) {
2974 errorf(HERE, "alignment must be power of two");
2978 #define DET_MOD(name, tag) do { \
2979 if (*modifiers & tag) warningf(HERE, #name " used more than once"); \
2980 *modifiers |= tag; \
2983 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
2985 decl_modifiers_t *modifiers = &specifiers->modifiers;
2988 if (token.type == T_restrict) {
2990 DET_MOD(restrict, DM_RESTRICT);
2992 } else if (token.type != T_IDENTIFIER)
2994 symbol_t *symbol = token.v.symbol;
2995 if (symbol == sym_align) {
2998 if (token.type != T_INTEGER)
3000 if (check_alignment_value(token.v.intvalue)) {
3001 if (specifiers->alignment != 0)
3002 warningf(HERE, "align used more than once");
3003 specifiers->alignment = (unsigned char)token.v.intvalue;
3007 } else if (symbol == sym_allocate) {
3010 if (token.type != T_IDENTIFIER)
3012 (void)token.v.symbol;
3014 } else if (symbol == sym_dllimport) {
3016 DET_MOD(dllimport, DM_DLLIMPORT);
3017 } else if (symbol == sym_dllexport) {
3019 DET_MOD(dllexport, DM_DLLEXPORT);
3020 } else if (symbol == sym_thread) {
3022 DET_MOD(thread, DM_THREAD);
3023 } else if (symbol == sym_naked) {
3025 DET_MOD(naked, DM_NAKED);
3026 } else if (symbol == sym_noinline) {
3028 DET_MOD(noinline, DM_NOINLINE);
3029 } else if (symbol == sym_noreturn) {
3031 DET_MOD(noreturn, DM_NORETURN);
3032 } else if (symbol == sym_nothrow) {
3034 DET_MOD(nothrow, DM_NOTHROW);
3035 } else if (symbol == sym_novtable) {
3037 DET_MOD(novtable, DM_NOVTABLE);
3038 } else if (symbol == sym_property) {
3042 bool is_get = false;
3043 if (token.type != T_IDENTIFIER)
3045 if (token.v.symbol == sym_get) {
3047 } else if (token.v.symbol == sym_put) {
3049 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3054 if (token.type != T_IDENTIFIER)
3057 if (specifiers->get_property_sym != NULL) {
3058 errorf(HERE, "get property name already specified");
3060 specifiers->get_property_sym = token.v.symbol;
3063 if (specifiers->put_property_sym != NULL) {
3064 errorf(HERE, "put property name already specified");
3066 specifiers->put_property_sym = token.v.symbol;
3070 if (token.type == ',') {
3077 } else if (symbol == sym_selectany) {
3079 DET_MOD(selectany, DM_SELECTANY);
3080 } else if (symbol == sym_uuid) {
3083 if (token.type != T_STRING_LITERAL)
3087 } else if (symbol == sym_deprecated) {
3089 if (specifiers->deprecated != 0)
3090 warningf(HERE, "deprecated used more than once");
3091 specifiers->deprecated = 1;
3092 if (token.type == '(') {
3094 if (token.type == T_STRING_LITERAL) {
3095 specifiers->deprecated_string = token.v.string.begin;
3098 errorf(HERE, "string literal expected");
3102 } else if (symbol == sym_noalias) {
3104 DET_MOD(noalias, DM_NOALIAS);
3106 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
3108 if (token.type == '(')
3112 if (token.type == ',')
3119 static declaration_t *create_error_declaration(symbol_t *symbol, storage_class_tag_t storage_class)
3121 declaration_t *const decl = allocate_declaration_zero();
3122 decl->source_position = *HERE;
3123 decl->declared_storage_class = storage_class;
3124 decl->storage_class =
3125 storage_class != STORAGE_CLASS_NONE || scope == global_scope ?
3126 storage_class : STORAGE_CLASS_AUTO;
3127 decl->symbol = symbol;
3128 decl->implicit = true;
3129 record_declaration(decl, false);
3134 * Finish the construction of a struct type by calculating
3135 * its size, offsets, alignment.
3137 static void finish_struct_type(compound_type_t *type) {
3138 if (type->declaration == NULL)
3140 declaration_t *struct_decl = type->declaration;
3141 if (! struct_decl->init.complete)
3146 il_alignment_t alignment = 1;
3147 bool need_pad = false;
3149 declaration_t *entry = struct_decl->scope.declarations;
3150 for (; entry != NULL; entry = entry->next) {
3151 if (entry->namespc != NAMESPACE_NORMAL)
3154 type_t *m_type = skip_typeref(entry->type);
3155 if (! is_type_valid(m_type)) {
3156 /* simply ignore errors here */
3159 il_alignment_t m_alignment = m_type->base.alignment;
3160 if (m_alignment > alignment)
3161 alignment = m_alignment;
3163 offset = (size + m_alignment - 1) & -m_alignment;
3167 entry->offset = offset;
3168 size = offset + m_type->base.size;
3170 if (type->base.alignment != 0) {
3171 alignment = type->base.alignment;
3174 offset = (size + alignment - 1) & -alignment;
3178 if (warning.padded && need_pad) {
3179 warningf(&struct_decl->source_position,
3180 "'%#T' needs padding", type, struct_decl->symbol);
3182 if (warning.packed && !need_pad) {
3183 warningf(&struct_decl->source_position,
3184 "superfluous packed attribute on '%#T'",
3185 type, struct_decl->symbol);
3188 type->base.size = offset;
3189 type->base.alignment = alignment;
3193 * Finish the construction of an union type by calculating
3194 * its size and alignment.
3196 static void finish_union_type(compound_type_t *type) {
3197 if (type->declaration == NULL)
3199 declaration_t *union_decl = type->declaration;
3200 if (! union_decl->init.complete)
3204 il_alignment_t alignment = 1;
3206 declaration_t *entry = union_decl->scope.declarations;
3207 for (; entry != NULL; entry = entry->next) {
3208 if (entry->namespc != NAMESPACE_NORMAL)
3211 type_t *m_type = skip_typeref(entry->type);
3212 if (! is_type_valid(m_type))
3216 if (m_type->base.size > size)
3217 size = m_type->base.size;
3218 if (m_type->base.alignment > alignment)
3219 alignment = m_type->base.alignment;
3221 if (type->base.alignment != 0) {
3222 alignment = type->base.alignment;
3224 size = (size + alignment - 1) & -alignment;
3225 type->base.size = size;
3226 type->base.alignment = alignment;
3229 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3231 type_t *type = NULL;
3232 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3233 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3234 unsigned type_specifiers = 0;
3235 bool newtype = false;
3236 bool saw_error = false;
3237 bool old_gcc_extension = in_gcc_extension;
3239 specifiers->source_position = token.source_position;
3242 specifiers->modifiers
3243 |= parse_attributes(&specifiers->gnu_attributes);
3244 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3245 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3247 switch (token.type) {
3250 #define MATCH_STORAGE_CLASS(token, class) \
3252 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
3253 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3255 specifiers->declared_storage_class = class; \
3259 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3260 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3261 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3262 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3263 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3268 add_anchor_token(')');
3269 parse_microsoft_extended_decl_modifier(specifiers);
3270 rem_anchor_token(')');
3275 switch (specifiers->declared_storage_class) {
3276 case STORAGE_CLASS_NONE:
3277 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
3280 case STORAGE_CLASS_EXTERN:
3281 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
3284 case STORAGE_CLASS_STATIC:
3285 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
3289 errorf(HERE, "multiple storage classes in declaration specifiers");
3295 /* type qualifiers */
3296 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3298 qualifiers |= qualifier; \
3302 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3303 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3304 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3305 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3306 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3307 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3308 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3309 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3311 case T___extension__:
3313 in_gcc_extension = true;
3316 /* type specifiers */
3317 #define MATCH_SPECIFIER(token, specifier, name) \
3320 if (type_specifiers & specifier) { \
3321 errorf(HERE, "multiple " name " type specifiers given"); \
3323 type_specifiers |= specifier; \
3327 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3328 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3329 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3330 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3331 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3332 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3333 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3334 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3335 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3336 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3337 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3338 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3339 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3340 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3341 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3342 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3344 case T__forceinline:
3345 /* only in microsoft mode */
3346 specifiers->modifiers |= DM_FORCEINLINE;
3351 specifiers->is_inline = true;
3356 if (type_specifiers & SPECIFIER_LONG_LONG) {
3357 errorf(HERE, "multiple type specifiers given");
3358 } else if (type_specifiers & SPECIFIER_LONG) {
3359 type_specifiers |= SPECIFIER_LONG_LONG;
3361 type_specifiers |= SPECIFIER_LONG;
3366 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
3368 type->compound.declaration = parse_compound_type_specifier(true);
3369 finish_struct_type(&type->compound);
3373 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
3374 type->compound.declaration = parse_compound_type_specifier(false);
3375 if (type->compound.declaration->modifiers & DM_TRANSPARENT_UNION)
3376 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3378 finish_union_type(&type->compound);
3381 type = parse_enum_specifier();
3384 type = parse_typeof();
3386 case T___builtin_va_list:
3387 type = duplicate_type(type_valist);
3391 case T_IDENTIFIER: {
3392 /* only parse identifier if we haven't found a type yet */
3393 if (type != NULL || type_specifiers != 0) {
3394 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3395 * declaration, so it doesn't generate errors about expecting '(' or
3397 switch (look_ahead(1)->type) {
3404 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3407 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3412 goto finish_specifiers;
3416 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3417 if (typedef_type == NULL) {
3418 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3419 * declaration, so it doesn't generate 'implicit int' followed by more
3420 * errors later on. */
3421 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3426 errorf(HERE, "%K does not name a type", &token);
3428 declaration_t *const decl =
3429 create_error_declaration(token.v.symbol, STORAGE_CLASS_TYPEDEF);
3431 type = allocate_type_zero(TYPE_TYPEDEF, HERE);
3432 type->typedeft.declaration = decl;
3436 if (la1_type == '*')
3437 goto finish_specifiers;
3442 goto finish_specifiers;
3447 type = typedef_type;
3451 /* function specifier */
3453 goto finish_specifiers;
3458 in_gcc_extension = old_gcc_extension;
3460 if (type == NULL || (saw_error && type_specifiers != 0)) {
3461 atomic_type_kind_t atomic_type;
3463 /* match valid basic types */
3464 switch(type_specifiers) {
3465 case SPECIFIER_VOID:
3466 atomic_type = ATOMIC_TYPE_VOID;
3468 case SPECIFIER_CHAR:
3469 atomic_type = ATOMIC_TYPE_CHAR;
3471 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3472 atomic_type = ATOMIC_TYPE_SCHAR;
3474 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3475 atomic_type = ATOMIC_TYPE_UCHAR;
3477 case SPECIFIER_SHORT:
3478 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3479 case SPECIFIER_SHORT | SPECIFIER_INT:
3480 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3481 atomic_type = ATOMIC_TYPE_SHORT;
3483 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3484 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3485 atomic_type = ATOMIC_TYPE_USHORT;
3488 case SPECIFIER_SIGNED:
3489 case SPECIFIER_SIGNED | SPECIFIER_INT:
3490 atomic_type = ATOMIC_TYPE_INT;
3492 case SPECIFIER_UNSIGNED:
3493 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3494 atomic_type = ATOMIC_TYPE_UINT;
3496 case SPECIFIER_LONG:
3497 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3498 case SPECIFIER_LONG | SPECIFIER_INT:
3499 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3500 atomic_type = ATOMIC_TYPE_LONG;
3502 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3503 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3504 atomic_type = ATOMIC_TYPE_ULONG;
3507 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3508 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3509 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3510 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3512 atomic_type = ATOMIC_TYPE_LONGLONG;
3513 goto warn_about_long_long;
3515 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3516 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3518 atomic_type = ATOMIC_TYPE_ULONGLONG;
3519 warn_about_long_long:
3520 if (warning.long_long) {
3521 warningf(&specifiers->source_position,
3522 "ISO C90 does not support 'long long'");
3526 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3527 atomic_type = unsigned_int8_type_kind;
3530 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3531 atomic_type = unsigned_int16_type_kind;
3534 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3535 atomic_type = unsigned_int32_type_kind;
3538 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3539 atomic_type = unsigned_int64_type_kind;
3542 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3543 atomic_type = unsigned_int128_type_kind;
3546 case SPECIFIER_INT8:
3547 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3548 atomic_type = int8_type_kind;
3551 case SPECIFIER_INT16:
3552 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3553 atomic_type = int16_type_kind;
3556 case SPECIFIER_INT32:
3557 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3558 atomic_type = int32_type_kind;
3561 case SPECIFIER_INT64:
3562 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3563 atomic_type = int64_type_kind;
3566 case SPECIFIER_INT128:
3567 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3568 atomic_type = int128_type_kind;
3571 case SPECIFIER_FLOAT:
3572 atomic_type = ATOMIC_TYPE_FLOAT;
3574 case SPECIFIER_DOUBLE:
3575 atomic_type = ATOMIC_TYPE_DOUBLE;
3577 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3578 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3580 case SPECIFIER_BOOL:
3581 atomic_type = ATOMIC_TYPE_BOOL;
3583 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3584 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3585 atomic_type = ATOMIC_TYPE_FLOAT;
3587 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3588 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3589 atomic_type = ATOMIC_TYPE_DOUBLE;
3591 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3592 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3593 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3596 /* invalid specifier combination, give an error message */
3597 if (type_specifiers == 0) {
3602 if (warning.implicit_int) {
3603 warningf(HERE, "no type specifiers in declaration, using 'int'");
3605 atomic_type = ATOMIC_TYPE_INT;
3608 errorf(HERE, "no type specifiers given in declaration");
3610 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3611 (type_specifiers & SPECIFIER_UNSIGNED)) {
3612 errorf(HERE, "signed and unsigned specifiers given");
3613 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3614 errorf(HERE, "only integer types can be signed or unsigned");
3616 errorf(HERE, "multiple datatypes in declaration");
3621 if (type_specifiers & SPECIFIER_COMPLEX) {
3622 type = allocate_type_zero(TYPE_COMPLEX, &builtin_source_position);
3623 type->complex.akind = atomic_type;
3624 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3625 type = allocate_type_zero(TYPE_IMAGINARY, &builtin_source_position);
3626 type->imaginary.akind = atomic_type;
3628 type = allocate_type_zero(TYPE_ATOMIC, &builtin_source_position);
3629 type->atomic.akind = atomic_type;
3632 } else if (type_specifiers != 0) {
3633 errorf(HERE, "multiple datatypes in declaration");
3636 /* FIXME: check type qualifiers here */
3638 type->base.qualifiers = qualifiers;
3639 type->base.modifiers = modifiers;
3641 type_t *result = typehash_insert(type);
3642 if (newtype && result != type) {
3646 specifiers->type = result;
3650 specifiers->type = type_error_type;
3654 static type_qualifiers_t parse_type_qualifiers(void)
3656 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3659 switch(token.type) {
3660 /* type qualifiers */
3661 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3662 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3663 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3664 /* microsoft extended type modifiers */
3665 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3666 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3667 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3668 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3669 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3677 static declaration_t *parse_identifier_list(void)
3679 declaration_t *declarations = NULL;
3680 declaration_t *last_declaration = NULL;
3682 declaration_t *const declaration = allocate_declaration_zero();
3683 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3684 declaration->source_position = token.source_position;
3685 declaration->symbol = token.v.symbol;
3688 if (last_declaration != NULL) {
3689 last_declaration->next = declaration;
3691 declarations = declaration;
3693 last_declaration = declaration;
3695 if (token.type != ',') {
3699 } while (token.type == T_IDENTIFIER);
3701 return declarations;
3704 static type_t *automatic_type_conversion(type_t *orig_type);
3706 static void semantic_parameter(declaration_t *declaration)
3708 /* TODO: improve error messages */
3709 source_position_t const* const pos = &declaration->source_position;
3711 switch (declaration->declared_storage_class) {
3712 case STORAGE_CLASS_TYPEDEF:
3713 errorf(pos, "typedef not allowed in parameter list");
3716 /* Allowed storage classes */
3717 case STORAGE_CLASS_NONE:
3718 case STORAGE_CLASS_REGISTER:
3722 errorf(pos, "parameter may only have none or register storage class");
3726 type_t *const orig_type = declaration->type;
3727 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
3728 * sugar. Turn it into a pointer.
3729 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
3730 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
3732 type_t *const type = automatic_type_conversion(orig_type);
3733 declaration->type = type;
3735 if (is_type_incomplete(skip_typeref(type))) {
3736 errorf(pos, "parameter '%#T' is of incomplete type",
3737 orig_type, declaration->symbol);
3741 static declaration_t *parse_parameter(void)
3743 declaration_specifiers_t specifiers;
3744 memset(&specifiers, 0, sizeof(specifiers));
3746 parse_declaration_specifiers(&specifiers);
3748 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
3753 static declaration_t *parse_parameters(function_type_t *type)
3755 declaration_t *declarations = NULL;
3758 add_anchor_token(')');
3759 int saved_comma_state = save_and_reset_anchor_state(',');
3761 if (token.type == T_IDENTIFIER &&
3762 !is_typedef_symbol(token.v.symbol)) {
3763 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3764 if (la1_type == ',' || la1_type == ')') {
3765 type->kr_style_parameters = true;
3766 declarations = parse_identifier_list();
3767 goto parameters_finished;
3771 if (token.type == ')') {
3772 type->unspecified_parameters = 1;
3773 goto parameters_finished;
3776 declaration_t *declaration;
3777 declaration_t *last_declaration = NULL;
3778 function_parameter_t *parameter;
3779 function_parameter_t *last_parameter = NULL;
3782 switch(token.type) {
3786 goto parameters_finished;
3789 case T___extension__:
3791 declaration = parse_parameter();
3793 /* func(void) is not a parameter */
3794 if (last_parameter == NULL
3795 && token.type == ')'
3796 && declaration->symbol == NULL
3797 && skip_typeref(declaration->type) == type_void) {
3798 goto parameters_finished;
3800 semantic_parameter(declaration);
3802 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
3803 memset(parameter, 0, sizeof(parameter[0]));
3804 parameter->type = declaration->type;
3806 if (last_parameter != NULL) {
3807 last_declaration->next = declaration;
3808 last_parameter->next = parameter;
3810 type->parameters = parameter;
3811 declarations = declaration;
3813 last_parameter = parameter;
3814 last_declaration = declaration;
3818 goto parameters_finished;
3820 if (token.type != ',') {
3821 goto parameters_finished;
3827 parameters_finished:
3828 rem_anchor_token(')');
3831 restore_anchor_state(',', saved_comma_state);
3832 return declarations;
3835 restore_anchor_state(',', saved_comma_state);
3839 typedef enum construct_type_kind_t {
3844 } construct_type_kind_t;
3846 typedef struct construct_type_t construct_type_t;
3847 struct construct_type_t {
3848 construct_type_kind_t kind;
3849 construct_type_t *next;
3852 typedef struct parsed_pointer_t parsed_pointer_t;
3853 struct parsed_pointer_t {
3854 construct_type_t construct_type;
3855 type_qualifiers_t type_qualifiers;
3858 typedef struct construct_function_type_t construct_function_type_t;
3859 struct construct_function_type_t {
3860 construct_type_t construct_type;
3861 type_t *function_type;
3864 typedef struct parsed_array_t parsed_array_t;
3865 struct parsed_array_t {
3866 construct_type_t construct_type;
3867 type_qualifiers_t type_qualifiers;
3873 typedef struct construct_base_type_t construct_base_type_t;
3874 struct construct_base_type_t {
3875 construct_type_t construct_type;
3879 static construct_type_t *parse_pointer_declarator(void)
3883 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3884 memset(pointer, 0, sizeof(pointer[0]));
3885 pointer->construct_type.kind = CONSTRUCT_POINTER;
3886 pointer->type_qualifiers = parse_type_qualifiers();
3888 return (construct_type_t*) pointer;
3891 static construct_type_t *parse_array_declarator(void)
3894 add_anchor_token(']');
3896 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
3897 memset(array, 0, sizeof(array[0]));
3898 array->construct_type.kind = CONSTRUCT_ARRAY;
3900 if (token.type == T_static) {
3901 array->is_static = true;
3905 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3906 if (type_qualifiers != 0) {
3907 if (token.type == T_static) {
3908 array->is_static = true;
3912 array->type_qualifiers = type_qualifiers;
3914 if (token.type == '*' && look_ahead(1)->type == ']') {
3915 array->is_variable = true;
3917 } else if (token.type != ']') {
3918 array->size = parse_assignment_expression();
3921 rem_anchor_token(']');
3925 return (construct_type_t*) array;
3928 static construct_type_t *parse_function_declarator(declaration_t *declaration)
3931 if (declaration != NULL) {
3932 type = allocate_type_zero(TYPE_FUNCTION, &declaration->source_position);
3934 unsigned mask = declaration->modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
3936 if (mask & (mask-1)) {
3937 const char *first = NULL, *second = NULL;
3939 /* more than one calling convention set */
3940 if (declaration->modifiers & DM_CDECL) {
3941 if (first == NULL) first = "cdecl";
3942 else if (second == NULL) second = "cdecl";
3944 if (declaration->modifiers & DM_STDCALL) {
3945 if (first == NULL) first = "stdcall";
3946 else if (second == NULL) second = "stdcall";
3948 if (declaration->modifiers & DM_FASTCALL) {
3949 if (first == NULL) first = "fastcall";
3950 else if (second == NULL) second = "fastcall";
3952 if (declaration->modifiers & DM_THISCALL) {
3953 if (first == NULL) first = "thiscall";
3954 else if (second == NULL) second = "thiscall";
3956 errorf(&declaration->source_position, "%s and %s attributes are not compatible", first, second);
3959 if (declaration->modifiers & DM_CDECL)
3960 type->function.calling_convention = CC_CDECL;
3961 else if (declaration->modifiers & DM_STDCALL)
3962 type->function.calling_convention = CC_STDCALL;
3963 else if (declaration->modifiers & DM_FASTCALL)
3964 type->function.calling_convention = CC_FASTCALL;
3965 else if (declaration->modifiers & DM_THISCALL)
3966 type->function.calling_convention = CC_THISCALL;
3968 type = allocate_type_zero(TYPE_FUNCTION, HERE);
3971 declaration_t *parameters = parse_parameters(&type->function);
3972 if (declaration != NULL) {
3973 declaration->scope.declarations = parameters;
3976 construct_function_type_t *construct_function_type =
3977 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
3978 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
3979 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
3980 construct_function_type->function_type = type;
3982 return &construct_function_type->construct_type;
3985 static void fix_declaration_type(declaration_t *declaration)
3987 decl_modifiers_t declaration_modifiers = declaration->modifiers;
3988 type_modifiers_t type_modifiers = declaration->type->base.modifiers;
3990 if (declaration_modifiers & DM_TRANSPARENT_UNION)
3991 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3993 if (declaration->type->base.modifiers == type_modifiers)
3996 type_t *copy = duplicate_type(declaration->type);
3997 copy->base.modifiers = type_modifiers;
3999 type_t *result = typehash_insert(copy);
4000 if (result != copy) {
4001 obstack_free(type_obst, copy);
4004 declaration->type = result;
4007 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
4008 bool may_be_abstract)
4010 /* construct a single linked list of construct_type_t's which describe
4011 * how to construct the final declarator type */
4012 construct_type_t *first = NULL;
4013 construct_type_t *last = NULL;
4014 gnu_attribute_t *attributes = NULL;
4016 decl_modifiers_t modifiers = parse_attributes(&attributes);
4019 while (token.type == '*') {
4020 construct_type_t *type = parse_pointer_declarator();
4030 /* TODO: find out if this is correct */
4031 modifiers |= parse_attributes(&attributes);
4034 if (declaration != NULL)
4035 declaration->modifiers |= modifiers;
4037 construct_type_t *inner_types = NULL;
4039 switch(token.type) {
4041 if (declaration == NULL) {
4042 errorf(HERE, "no identifier expected in typename");
4044 declaration->symbol = token.v.symbol;
4045 declaration->source_position = token.source_position;
4051 add_anchor_token(')');
4052 inner_types = parse_inner_declarator(declaration, may_be_abstract);
4053 if (inner_types != NULL) {
4054 /* All later declarators only modify the return type, not declaration */
4057 rem_anchor_token(')');
4061 if (may_be_abstract)
4063 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4068 construct_type_t *p = last;
4071 construct_type_t *type;
4072 switch(token.type) {
4074 type = parse_function_declarator(declaration);
4077 type = parse_array_declarator();
4080 goto declarator_finished;
4083 /* insert in the middle of the list (behind p) */
4085 type->next = p->next;
4096 declarator_finished:
4097 /* append inner_types at the end of the list, we don't to set last anymore
4098 * as it's not needed anymore */
4100 assert(first == NULL);
4101 first = inner_types;
4103 last->next = inner_types;
4111 static void parse_declaration_attributes(declaration_t *declaration)
4113 gnu_attribute_t *attributes = NULL;
4114 decl_modifiers_t modifiers = parse_attributes(&attributes);
4116 if (declaration == NULL)
4119 declaration->modifiers |= modifiers;
4120 /* check if we have these stupid mode attributes... */
4121 type_t *old_type = declaration->type;
4122 if (old_type == NULL)
4125 gnu_attribute_t *attribute = attributes;
4126 for ( ; attribute != NULL; attribute = attribute->next) {
4127 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
4130 atomic_type_kind_t akind = attribute->u.akind;
4131 if (!is_type_signed(old_type)) {
4133 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
4134 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
4135 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
4136 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
4138 panic("invalid akind in mode attribute");
4142 = make_atomic_type(akind, old_type->base.qualifiers);
4146 static type_t *construct_declarator_type(construct_type_t *construct_list,
4149 construct_type_t *iter = construct_list;
4150 for( ; iter != NULL; iter = iter->next) {
4151 switch(iter->kind) {
4152 case CONSTRUCT_INVALID:
4153 internal_errorf(HERE, "invalid type construction found");
4154 case CONSTRUCT_FUNCTION: {
4155 construct_function_type_t *construct_function_type
4156 = (construct_function_type_t*) iter;
4158 type_t *function_type = construct_function_type->function_type;
4160 function_type->function.return_type = type;
4162 type_t *skipped_return_type = skip_typeref(type);
4164 if (is_type_function(skipped_return_type)) {
4165 errorf(HERE, "function returning function is not allowed");
4166 } else if (is_type_array(skipped_return_type)) {
4167 errorf(HERE, "function returning array is not allowed");
4169 if (skipped_return_type->base.qualifiers != 0) {
4171 "type qualifiers in return type of function type are meaningless");
4175 type = function_type;
4179 case CONSTRUCT_POINTER: {
4180 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4181 type_t *pointer_type = allocate_type_zero(TYPE_POINTER, &null_position);
4182 pointer_type->pointer.points_to = type;
4183 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
4185 type = pointer_type;
4189 case CONSTRUCT_ARRAY: {
4190 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4191 type_t *array_type = allocate_type_zero(TYPE_ARRAY, &null_position);
4193 expression_t *size_expression = parsed_array->size;
4194 if (size_expression != NULL) {
4196 = create_implicit_cast(size_expression, type_size_t);
4199 array_type->base.qualifiers = parsed_array->type_qualifiers;
4200 array_type->array.element_type = type;
4201 array_type->array.is_static = parsed_array->is_static;
4202 array_type->array.is_variable = parsed_array->is_variable;
4203 array_type->array.size_expression = size_expression;
4205 if (size_expression != NULL) {
4206 if (is_constant_expression(size_expression)) {
4207 array_type->array.size_constant = true;
4208 array_type->array.size
4209 = fold_constant(size_expression);
4211 array_type->array.is_vla = true;
4215 type_t *skipped_type = skip_typeref(type);
4217 if (is_type_incomplete(skipped_type)) {
4218 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4219 } else if (is_type_function(skipped_type)) {
4220 errorf(HERE, "array of functions is not allowed");
4227 type_t *hashed_type = typehash_insert(type);
4228 if (hashed_type != type) {
4229 /* the function type was constructed earlier freeing it here will
4230 * destroy other types... */
4231 if (iter->kind != CONSTRUCT_FUNCTION) {
4241 static declaration_t *parse_declarator(
4242 const declaration_specifiers_t *specifiers, bool may_be_abstract)
4244 declaration_t *const declaration = allocate_declaration_zero();
4245 declaration->source_position = specifiers->source_position;
4246 declaration->declared_storage_class = specifiers->declared_storage_class;
4247 declaration->modifiers = specifiers->modifiers;
4248 declaration->deprecated_string = specifiers->deprecated_string;
4249 declaration->get_property_sym = specifiers->get_property_sym;
4250 declaration->put_property_sym = specifiers->put_property_sym;
4251 declaration->is_inline = specifiers->is_inline;
4253 declaration->storage_class = specifiers->declared_storage_class;
4254 if (declaration->storage_class == STORAGE_CLASS_NONE
4255 && scope != global_scope) {
4256 declaration->storage_class = STORAGE_CLASS_AUTO;
4259 if (specifiers->alignment != 0) {
4260 /* TODO: add checks here */
4261 declaration->alignment = specifiers->alignment;
4264 construct_type_t *construct_type
4265 = parse_inner_declarator(declaration, may_be_abstract);
4266 type_t *const type = specifiers->type;
4267 declaration->type = construct_declarator_type(construct_type, type);
4269 parse_declaration_attributes(declaration);
4271 fix_declaration_type(declaration);
4273 if (construct_type != NULL) {
4274 obstack_free(&temp_obst, construct_type);
4280 static type_t *parse_abstract_declarator(type_t *base_type)
4282 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4284 type_t *result = construct_declarator_type(construct_type, base_type);
4285 if (construct_type != NULL) {
4286 obstack_free(&temp_obst, construct_type);
4292 static declaration_t *append_declaration(declaration_t* const declaration)
4294 if (last_declaration != NULL) {
4295 last_declaration->next = declaration;
4297 scope->declarations = declaration;
4299 last_declaration = declaration;
4304 * Check if the declaration of main is suspicious. main should be a
4305 * function with external linkage, returning int, taking either zero
4306 * arguments, two, or three arguments of appropriate types, ie.
4308 * int main([ int argc, char **argv [, char **env ] ]).
4310 * @param decl the declaration to check
4311 * @param type the function type of the declaration
4313 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
4315 if (decl->storage_class == STORAGE_CLASS_STATIC) {
4316 warningf(&decl->source_position,
4317 "'main' is normally a non-static function");
4319 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4320 warningf(&decl->source_position,
4321 "return type of 'main' should be 'int', but is '%T'",
4322 func_type->return_type);
4324 const function_parameter_t *parm = func_type->parameters;
4326 type_t *const first_type = parm->type;
4327 if (!types_compatible(skip_typeref(first_type), type_int)) {
4328 warningf(&decl->source_position,
4329 "first argument of 'main' should be 'int', but is '%T'", first_type);
4333 type_t *const second_type = parm->type;
4334 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4335 warningf(&decl->source_position,
4336 "second argument of 'main' should be 'char**', but is '%T'", second_type);
4340 type_t *const third_type = parm->type;
4341 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4342 warningf(&decl->source_position,
4343 "third argument of 'main' should be 'char**', but is '%T'", third_type);
4347 goto warn_arg_count;
4351 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
4357 * Check if a symbol is the equal to "main".
4359 static bool is_sym_main(const symbol_t *const sym)
4361 return strcmp(sym->string, "main") == 0;
4364 static declaration_t *record_declaration(
4365 declaration_t *const declaration,
4366 const bool is_definition)
4368 const symbol_t *const symbol = declaration->symbol;
4369 const namespace_t namespc = (namespace_t)declaration->namespc;
4371 assert(symbol != NULL);
4372 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4374 type_t *const orig_type = declaration->type;
4375 type_t *const type = skip_typeref(orig_type);
4376 if (is_type_function(type) &&
4377 type->function.unspecified_parameters &&
4378 warning.strict_prototypes &&
4379 previous_declaration == NULL) {
4380 warningf(&declaration->source_position,
4381 "function declaration '%#T' is not a prototype",
4385 if (warning.main && is_type_function(type) && is_sym_main(symbol)) {
4386 check_type_of_main(declaration, &type->function);
4389 if (warning.nested_externs &&
4390 declaration->storage_class == STORAGE_CLASS_EXTERN &&
4391 scope != global_scope) {
4392 warningf(&declaration->source_position,
4393 "nested extern declaration of '%#T'", declaration->type, symbol);
4396 assert(declaration != previous_declaration);
4397 if (previous_declaration != NULL
4398 && previous_declaration->parent_scope == scope) {
4399 /* can happen for K&R style declarations */
4400 if (previous_declaration->type == NULL) {
4401 previous_declaration->type = declaration->type;
4404 const type_t *prev_type = skip_typeref(previous_declaration->type);
4405 if (!types_compatible(type, prev_type)) {
4406 errorf(&declaration->source_position,
4407 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4408 orig_type, symbol, previous_declaration->type, symbol,
4409 &previous_declaration->source_position);
4411 unsigned old_storage_class = previous_declaration->storage_class;
4412 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
4413 errorf(&declaration->source_position,
4414 "redeclaration of enum entry '%Y' (declared %P)",
4415 symbol, &previous_declaration->source_position);
4416 return previous_declaration;
4419 if (warning.redundant_decls &&
4421 previous_declaration->storage_class == STORAGE_CLASS_STATIC &&
4422 !(previous_declaration->modifiers & DM_USED) &&
4423 !previous_declaration->used) {
4424 warningf(&previous_declaration->source_position,
4425 "unnecessary static forward declaration for '%#T'",
4426 previous_declaration->type, symbol);
4429 unsigned new_storage_class = declaration->storage_class;
4431 if (is_type_incomplete(prev_type)) {
4432 previous_declaration->type = type;
4436 /* pretend no storage class means extern for function
4437 * declarations (except if the previous declaration is neither
4438 * none nor extern) */
4439 if (is_type_function(type)) {
4440 if (prev_type->function.unspecified_parameters) {
4441 previous_declaration->type = type;
4445 switch (old_storage_class) {
4446 case STORAGE_CLASS_NONE:
4447 old_storage_class = STORAGE_CLASS_EXTERN;
4450 case STORAGE_CLASS_EXTERN:
4451 if (is_definition) {
4452 if (warning.missing_prototypes &&
4453 prev_type->function.unspecified_parameters &&
4454 !is_sym_main(symbol)) {
4455 warningf(&declaration->source_position,
4456 "no previous prototype for '%#T'",
4459 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4460 new_storage_class = STORAGE_CLASS_EXTERN;
4469 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4470 new_storage_class == STORAGE_CLASS_EXTERN) {
4471 warn_redundant_declaration:
4472 if (!is_definition &&
4473 warning.redundant_decls &&
4474 is_type_valid(prev_type) &&
4475 strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
4476 warningf(&declaration->source_position,
4477 "redundant declaration for '%Y' (declared %P)",
4478 symbol, &previous_declaration->source_position);
4480 } else if (current_function == NULL) {
4481 if (old_storage_class != STORAGE_CLASS_STATIC &&
4482 new_storage_class == STORAGE_CLASS_STATIC) {
4483 errorf(&declaration->source_position,
4484 "static declaration of '%Y' follows non-static declaration (declared %P)",
4485 symbol, &previous_declaration->source_position);
4486 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4487 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4488 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4490 goto warn_redundant_declaration;
4492 } else if (is_type_valid(prev_type)) {
4493 if (old_storage_class == new_storage_class) {
4494 errorf(&declaration->source_position,
4495 "redeclaration of '%Y' (declared %P)",
4496 symbol, &previous_declaration->source_position);
4498 errorf(&declaration->source_position,
4499 "redeclaration of '%Y' with different linkage (declared %P)",
4500 symbol, &previous_declaration->source_position);
4505 previous_declaration->modifiers |= declaration->modifiers;
4506 previous_declaration->is_inline |= declaration->is_inline;
4507 return previous_declaration;
4508 } else if (is_type_function(type)) {
4509 if (is_definition &&
4510 declaration->storage_class != STORAGE_CLASS_STATIC) {
4511 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4512 warningf(&declaration->source_position,
4513 "no previous prototype for '%#T'", orig_type, symbol);
4514 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4515 warningf(&declaration->source_position,
4516 "no previous declaration for '%#T'", orig_type,
4521 if (warning.missing_declarations &&
4522 scope == global_scope && (
4523 declaration->storage_class == STORAGE_CLASS_NONE ||
4524 declaration->storage_class == STORAGE_CLASS_THREAD
4526 warningf(&declaration->source_position,
4527 "no previous declaration for '%#T'", orig_type, symbol);
4531 assert(declaration->parent_scope == NULL);
4532 assert(scope != NULL);
4534 declaration->parent_scope = scope;
4536 environment_push(declaration);
4537 return append_declaration(declaration);
4540 static void parser_error_multiple_definition(declaration_t *declaration,
4541 const source_position_t *source_position)
4543 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4544 declaration->symbol, &declaration->source_position);
4547 static bool is_declaration_specifier(const token_t *token,
4548 bool only_specifiers_qualifiers)
4550 switch (token->type) {
4555 return is_typedef_symbol(token->v.symbol);
4557 case T___extension__:
4559 return !only_specifiers_qualifiers;
4566 static void parse_init_declarator_rest(declaration_t *declaration)
4570 type_t *orig_type = declaration->type;
4571 type_t *type = skip_typeref(orig_type);
4573 if (declaration->init.initializer != NULL) {
4574 parser_error_multiple_definition(declaration, HERE);
4577 bool must_be_constant = false;
4578 if (declaration->storage_class == STORAGE_CLASS_STATIC
4579 || declaration->storage_class == STORAGE_CLASS_THREAD_STATIC
4580 || declaration->parent_scope == global_scope) {
4581 must_be_constant = true;
4584 if (is_type_function(type)) {
4585 errorf(&declaration->source_position,
4586 "function '%#T' is initialized like a variable",
4587 orig_type, declaration->symbol);
4588 orig_type = type_error_type;
4591 parse_initializer_env_t env;
4592 env.type = orig_type;
4593 env.must_be_constant = must_be_constant;
4594 env.declaration = current_init_decl = declaration;
4596 initializer_t *initializer = parse_initializer(&env);
4597 current_init_decl = NULL;
4599 if (!is_type_function(type)) {
4600 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
4601 * the array type size */
4602 declaration->type = env.type;
4603 declaration->init.initializer = initializer;
4607 /* parse rest of a declaration without any declarator */
4608 static void parse_anonymous_declaration_rest(
4609 const declaration_specifiers_t *specifiers)
4613 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) {
4614 warningf(&specifiers->source_position,
4615 "useless storage class in empty declaration");
4618 type_t *type = specifiers->type;
4619 switch (type->kind) {
4620 case TYPE_COMPOUND_STRUCT:
4621 case TYPE_COMPOUND_UNION: {
4622 if (type->compound.declaration->symbol == NULL) {
4623 warningf(&specifiers->source_position,
4624 "unnamed struct/union that defines no instances");
4633 warningf(&specifiers->source_position, "empty declaration");
4637 #ifdef RECORD_EMPTY_DECLARATIONS
4638 declaration_t *const declaration = allocate_declaration_zero();
4639 declaration->type = specifiers->type;
4640 declaration->declared_storage_class = specifiers->declared_storage_class;
4641 declaration->source_position = specifiers->source_position;
4642 declaration->modifiers = specifiers->modifiers;
4643 declaration->storage_class = STORAGE_CLASS_NONE;
4645 append_declaration(declaration);
4649 static void parse_declaration_rest(declaration_t *ndeclaration,
4650 const declaration_specifiers_t *specifiers,
4651 parsed_declaration_func finished_declaration)
4653 add_anchor_token(';');
4654 add_anchor_token(',');
4656 declaration_t *declaration =
4657 finished_declaration(ndeclaration, token.type == '=');
4659 type_t *orig_type = declaration->type;
4660 type_t *type = skip_typeref(orig_type);
4662 if (type->kind != TYPE_FUNCTION &&
4663 declaration->is_inline &&
4664 is_type_valid(type)) {
4665 warningf(&declaration->source_position,
4666 "variable '%Y' declared 'inline'\n", declaration->symbol);
4669 if (token.type == '=') {
4670 parse_init_declarator_rest(declaration);
4673 if (token.type != ',')
4677 add_anchor_token('=');
4678 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4679 rem_anchor_token('=');
4684 rem_anchor_token(';');
4685 rem_anchor_token(',');
4688 static declaration_t *finished_kr_declaration(declaration_t *declaration, bool is_definition)
4690 symbol_t *symbol = declaration->symbol;
4691 if (symbol == NULL) {
4692 errorf(HERE, "anonymous declaration not valid as function parameter");
4695 namespace_t namespc = (namespace_t) declaration->namespc;
4696 if (namespc != NAMESPACE_NORMAL) {
4697 return record_declaration(declaration, false);
4700 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4701 if (previous_declaration == NULL ||
4702 previous_declaration->parent_scope != scope) {
4703 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4708 if (is_definition) {
4709 errorf(HERE, "parameter %Y is initialised", declaration->symbol);
4712 if (previous_declaration->type == NULL) {
4713 previous_declaration->type = declaration->type;
4714 previous_declaration->declared_storage_class = declaration->declared_storage_class;
4715 previous_declaration->storage_class = declaration->storage_class;
4716 previous_declaration->parent_scope = scope;
4717 return previous_declaration;
4719 return record_declaration(declaration, false);
4723 static void parse_declaration(parsed_declaration_func finished_declaration)
4725 declaration_specifiers_t specifiers;
4726 memset(&specifiers, 0, sizeof(specifiers));
4728 add_anchor_token(';');
4729 parse_declaration_specifiers(&specifiers);
4730 rem_anchor_token(';');
4732 if (token.type == ';') {
4733 parse_anonymous_declaration_rest(&specifiers);
4735 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4736 parse_declaration_rest(declaration, &specifiers, finished_declaration);
4740 static type_t *get_default_promoted_type(type_t *orig_type)
4742 type_t *result = orig_type;
4744 type_t *type = skip_typeref(orig_type);
4745 if (is_type_integer(type)) {
4746 result = promote_integer(type);
4747 } else if (type == type_float) {
4748 result = type_double;
4754 static void parse_kr_declaration_list(declaration_t *declaration)
4756 type_t *type = skip_typeref(declaration->type);
4757 if (!is_type_function(type))
4760 if (!type->function.kr_style_parameters)
4763 add_anchor_token('{');
4765 /* push function parameters */
4766 int top = environment_top();
4767 scope_t *last_scope = scope;
4768 set_scope(&declaration->scope);
4770 declaration_t *parameter = declaration->scope.declarations;
4771 for ( ; parameter != NULL; parameter = parameter->next) {
4772 assert(parameter->parent_scope == NULL);
4773 parameter->parent_scope = scope;
4774 environment_push(parameter);
4777 /* parse declaration list */
4778 while (is_declaration_specifier(&token, false)) {
4779 parse_declaration(finished_kr_declaration);
4782 /* pop function parameters */
4783 assert(scope == &declaration->scope);
4784 set_scope(last_scope);
4785 environment_pop_to(top);
4787 /* update function type */
4788 type_t *new_type = duplicate_type(type);
4790 function_parameter_t *parameters = NULL;
4791 function_parameter_t *last_parameter = NULL;
4793 declaration_t *parameter_declaration = declaration->scope.declarations;
4794 for( ; parameter_declaration != NULL;
4795 parameter_declaration = parameter_declaration->next) {
4796 type_t *parameter_type = parameter_declaration->type;
4797 if (parameter_type == NULL) {
4799 errorf(HERE, "no type specified for function parameter '%Y'",
4800 parameter_declaration->symbol);
4802 if (warning.implicit_int) {
4803 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4804 parameter_declaration->symbol);
4806 parameter_type = type_int;
4807 parameter_declaration->type = parameter_type;
4811 semantic_parameter(parameter_declaration);
4812 parameter_type = parameter_declaration->type;
4815 * we need the default promoted types for the function type
4817 parameter_type = get_default_promoted_type(parameter_type);
4819 function_parameter_t *function_parameter
4820 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
4821 memset(function_parameter, 0, sizeof(function_parameter[0]));
4823 function_parameter->type = parameter_type;
4824 if (last_parameter != NULL) {
4825 last_parameter->next = function_parameter;
4827 parameters = function_parameter;
4829 last_parameter = function_parameter;
4832 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
4834 new_type->function.parameters = parameters;
4835 new_type->function.unspecified_parameters = true;
4837 type = typehash_insert(new_type);
4838 if (type != new_type) {
4839 obstack_free(type_obst, new_type);
4842 declaration->type = type;
4844 rem_anchor_token('{');
4847 static bool first_err = true;
4850 * When called with first_err set, prints the name of the current function,
4853 static void print_in_function(void)
4857 diagnosticf("%s: In function '%Y':\n",
4858 current_function->source_position.input_name,
4859 current_function->symbol);
4864 * Check if all labels are defined in the current function.
4865 * Check if all labels are used in the current function.
4867 static void check_labels(void)
4869 for (const goto_statement_t *goto_statement = goto_first;
4870 goto_statement != NULL;
4871 goto_statement = goto_statement->next) {
4872 /* skip computed gotos */
4873 if (goto_statement->expression != NULL)
4876 declaration_t *label = goto_statement->label;
4879 if (label->source_position.input_name == NULL) {
4880 print_in_function();
4881 errorf(&goto_statement->base.source_position,
4882 "label '%Y' used but not defined", label->symbol);
4885 goto_first = goto_last = NULL;
4887 if (warning.unused_label) {
4888 for (const label_statement_t *label_statement = label_first;
4889 label_statement != NULL;
4890 label_statement = label_statement->next) {
4891 const declaration_t *label = label_statement->label;
4893 if (! label->used) {
4894 print_in_function();
4895 warningf(&label_statement->base.source_position,
4896 "label '%Y' defined but not used", label->symbol);
4900 label_first = label_last = NULL;
4904 * Check declarations of current_function for unused entities.
4906 static void check_declarations(void)
4908 if (warning.unused_parameter) {
4909 const scope_t *scope = ¤t_function->scope;
4911 if (is_sym_main(current_function->symbol)) {
4912 /* do not issue unused warnings for main */
4915 const declaration_t *parameter = scope->declarations;
4916 for (; parameter != NULL; parameter = parameter->next) {
4917 if (! parameter->used) {
4918 print_in_function();
4919 warningf(¶meter->source_position,
4920 "unused parameter '%Y'", parameter->symbol);
4924 if (warning.unused_variable) {
4928 static int determine_truth(expression_t const* const cond)
4931 !is_constant_expression(cond) ? 0 :
4932 fold_constant(cond) != 0 ? 1 :
4936 static bool noreturn_candidate;
4938 static void check_reachable(statement_t *const stmt)
4940 if (stmt->base.reachable)
4942 if (stmt->kind != STATEMENT_DO_WHILE)
4943 stmt->base.reachable = true;
4945 statement_t *last = stmt;
4947 switch (stmt->kind) {
4948 case STATEMENT_INVALID:
4949 case STATEMENT_EMPTY:
4950 case STATEMENT_DECLARATION:
4952 next = stmt->base.next;
4955 case STATEMENT_COMPOUND:
4956 next = stmt->compound.statements;
4959 case STATEMENT_RETURN:
4960 noreturn_candidate = false;
4963 case STATEMENT_IF: {
4964 if_statement_t const* const ifs = &stmt->ifs;
4965 int const val = determine_truth(ifs->condition);
4968 check_reachable(ifs->true_statement);
4973 if (ifs->false_statement != NULL) {
4974 check_reachable(ifs->false_statement);
4978 next = stmt->base.next;
4982 case STATEMENT_SWITCH: {
4983 switch_statement_t const *const switchs = &stmt->switchs;
4984 expression_t const *const expr = switchs->expression;
4986 if (is_constant_expression(expr)) {
4987 long const val = fold_constant(expr);
4988 case_label_statement_t * defaults = NULL;
4989 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4990 if (i->expression == NULL) {
4995 if (i->first_case <= val && val <= i->last_case) {
4996 check_reachable((statement_t*)i);
5001 if (defaults != NULL) {
5002 check_reachable((statement_t*)defaults);
5006 bool has_default = false;
5007 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5008 if (i->expression == NULL)
5011 check_reachable((statement_t*)i);
5018 next = stmt->base.next;
5022 case STATEMENT_EXPRESSION: {
5023 /* Check for noreturn function call */
5024 expression_t const *const expr = stmt->expression.expression;
5025 if (expr->kind == EXPR_CALL) {
5026 expression_t const *const func = expr->call.function;
5027 if (func->kind == EXPR_REFERENCE) {
5028 declaration_t const *const decl = func->reference.declaration;
5029 if (decl != NULL && decl->modifiers & DM_NORETURN) {
5035 next = stmt->base.next;
5039 case STATEMENT_CONTINUE: {
5040 statement_t *parent = stmt;
5042 parent = parent->base.parent;
5043 if (parent == NULL) /* continue not within loop */
5047 switch (parent->kind) {
5048 case STATEMENT_WHILE: goto continue_while;
5049 case STATEMENT_DO_WHILE: goto continue_do_while;
5050 case STATEMENT_FOR: goto continue_for;
5057 case STATEMENT_BREAK: {
5058 statement_t *parent = stmt;
5060 parent = parent->base.parent;
5061 if (parent == NULL) /* break not within loop/switch */
5064 switch (parent->kind) {
5065 case STATEMENT_SWITCH:
5066 case STATEMENT_WHILE:
5067 case STATEMENT_DO_WHILE:
5070 next = parent->base.next;
5071 goto found_break_parent;
5080 case STATEMENT_GOTO:
5081 if (stmt->gotos.expression) {
5082 statement_t *parent = stmt->base.parent;
5083 if (parent == NULL) /* top level goto */
5087 next = stmt->gotos.label->init.statement;
5088 if (next == NULL) /* missing label */
5093 case STATEMENT_LABEL:
5094 next = stmt->label.statement;
5097 case STATEMENT_CASE_LABEL:
5098 next = stmt->case_label.statement;
5101 case STATEMENT_WHILE: {
5102 while_statement_t const *const whiles = &stmt->whiles;
5103 int const val = determine_truth(whiles->condition);
5106 check_reachable(whiles->body);
5111 next = stmt->base.next;
5115 case STATEMENT_DO_WHILE:
5116 next = stmt->do_while.body;
5119 case STATEMENT_FOR: {
5120 for_statement_t *const fors = &stmt->fors;
5122 if (fors->condition_reachable)
5124 fors->condition_reachable = true;
5126 expression_t const *const cond = fors->condition;
5128 cond == NULL ? 1 : determine_truth(cond);
5131 check_reachable(fors->body);
5136 next = stmt->base.next;
5140 case STATEMENT_MS_TRY: {
5141 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5142 check_reachable(ms_try->try_statement);
5143 next = ms_try->final_statement;
5147 case STATEMENT_LEAVE: {
5148 statement_t *parent = stmt;
5150 parent = parent->base.parent;
5151 if (parent == NULL) /* __leave not within __try */
5154 if (parent->kind == STATEMENT_MS_TRY) {
5156 next = parent->ms_try.final_statement;
5164 while (next == NULL) {
5165 next = last->base.parent;
5167 noreturn_candidate = false;
5169 type_t *const type = current_function->type;
5170 assert(is_type_function(type));
5171 type_t *const ret = skip_typeref(type->function.return_type);
5172 if (warning.return_type &&
5173 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5174 is_type_valid(ret) &&
5175 !is_sym_main(current_function->symbol)) {
5176 warningf(&stmt->base.source_position,
5177 "control reaches end of non-void function");
5182 switch (next->kind) {
5183 case STATEMENT_INVALID:
5184 case STATEMENT_EMPTY:
5185 case STATEMENT_DECLARATION:
5186 case STATEMENT_EXPRESSION:
5188 case STATEMENT_RETURN:
5189 case STATEMENT_CONTINUE:
5190 case STATEMENT_BREAK:
5191 case STATEMENT_GOTO:
5192 case STATEMENT_LEAVE:
5193 panic("invalid control flow in function");
5195 case STATEMENT_COMPOUND:
5197 case STATEMENT_SWITCH:
5198 case STATEMENT_LABEL:
5199 case STATEMENT_CASE_LABEL:
5201 next = next->base.next;
5204 case STATEMENT_WHILE: {
5206 if (next->base.reachable)
5208 next->base.reachable = true;
5210 while_statement_t const *const whiles = &next->whiles;
5211 int const val = determine_truth(whiles->condition);
5214 check_reachable(whiles->body);
5220 next = next->base.next;
5224 case STATEMENT_DO_WHILE: {
5226 if (next->base.reachable)
5228 next->base.reachable = true;
5230 do_while_statement_t const *const dw = &next->do_while;
5231 int const val = determine_truth(dw->condition);
5234 check_reachable(dw->body);
5240 next = next->base.next;
5244 case STATEMENT_FOR: {
5246 for_statement_t *const fors = &next->fors;
5248 fors->step_reachable = true;
5250 if (fors->condition_reachable)
5252 fors->condition_reachable = true;
5254 expression_t const *const cond = fors->condition;
5256 cond == NULL ? 1 : determine_truth(cond);
5259 check_reachable(fors->body);
5265 next = next->base.next;
5269 case STATEMENT_MS_TRY:
5271 next = next->ms_try.final_statement;
5277 next = stmt->base.parent;
5279 warningf(&stmt->base.source_position,
5280 "control reaches end of non-void function");
5284 check_reachable(next);
5287 static void check_unreachable(statement_t const* const stmt)
5289 if (!stmt->base.reachable &&
5290 stmt->kind != STATEMENT_DO_WHILE &&
5291 stmt->kind != STATEMENT_FOR &&
5292 (stmt->kind != STATEMENT_COMPOUND || stmt->compound.statements == NULL)) {
5293 warningf(&stmt->base.source_position, "statement is unreachable");
5296 switch (stmt->kind) {
5297 case STATEMENT_INVALID:
5298 case STATEMENT_EMPTY:
5299 case STATEMENT_RETURN:
5300 case STATEMENT_DECLARATION:
5301 case STATEMENT_EXPRESSION:
5302 case STATEMENT_CONTINUE:
5303 case STATEMENT_BREAK:
5304 case STATEMENT_GOTO:
5306 case STATEMENT_LEAVE:
5309 case STATEMENT_COMPOUND:
5310 if (stmt->compound.statements)
5311 check_unreachable(stmt->compound.statements);
5315 check_unreachable(stmt->ifs.true_statement);
5316 if (stmt->ifs.false_statement != NULL)
5317 check_unreachable(stmt->ifs.false_statement);
5320 case STATEMENT_SWITCH:
5321 check_unreachable(stmt->switchs.body);
5324 case STATEMENT_LABEL:
5325 check_unreachable(stmt->label.statement);
5328 case STATEMENT_CASE_LABEL:
5329 check_unreachable(stmt->case_label.statement);
5332 case STATEMENT_WHILE:
5333 check_unreachable(stmt->whiles.body);
5336 case STATEMENT_DO_WHILE:
5337 check_unreachable(stmt->do_while.body);
5338 if (!stmt->base.reachable) {
5339 expression_t const *const cond = stmt->do_while.condition;
5340 if (determine_truth(cond) >= 0) {
5341 warningf(&cond->base.source_position,
5342 "condition of do-while-loop is unreachable");
5347 case STATEMENT_FOR: {
5348 for_statement_t const* const fors = &stmt->fors;
5350 // if init and step are unreachable, cond is unreachable, too
5351 if (!stmt->base.reachable && !fors->step_reachable) {
5352 warningf(&stmt->base.source_position, "statement is unreachable");
5354 if (!stmt->base.reachable && fors->initialisation != NULL) {
5355 warningf(&fors->initialisation->base.source_position,
5356 "initialisation of for-statement is unreachable");
5359 if (!fors->condition_reachable && fors->condition != NULL) {
5360 warningf(&fors->condition->base.source_position,
5361 "condition of for-statement is unreachable");
5364 if (!fors->step_reachable && fors->step != NULL) {
5365 warningf(&fors->step->base.source_position,
5366 "step of for-statement is unreachable");
5370 check_unreachable(fors->body);
5374 case STATEMENT_MS_TRY: {
5375 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5376 check_unreachable(ms_try->try_statement);
5377 check_unreachable(ms_try->final_statement);
5381 if (stmt->base.next)
5382 check_unreachable(stmt->base.next);
5385 static void parse_external_declaration(void)
5387 /* function-definitions and declarations both start with declaration
5389 declaration_specifiers_t specifiers;
5390 memset(&specifiers, 0, sizeof(specifiers));
5392 add_anchor_token(';');
5393 parse_declaration_specifiers(&specifiers);
5394 rem_anchor_token(';');
5396 /* must be a declaration */
5397 if (token.type == ';') {
5398 parse_anonymous_declaration_rest(&specifiers);
5402 add_anchor_token(',');
5403 add_anchor_token('=');
5404 add_anchor_token(';');
5405 add_anchor_token('{');
5407 /* declarator is common to both function-definitions and declarations */
5408 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5410 rem_anchor_token('{');
5411 rem_anchor_token(';');
5412 rem_anchor_token('=');
5413 rem_anchor_token(',');
5415 /* must be a declaration */
5416 switch (token.type) {
5420 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
5424 /* must be a function definition */
5425 parse_kr_declaration_list(ndeclaration);
5427 if (token.type != '{') {
5428 parse_error_expected("while parsing function definition", '{', NULL);
5429 eat_until_matching_token(';');
5433 type_t *type = ndeclaration->type;
5435 /* note that we don't skip typerefs: the standard doesn't allow them here
5436 * (so we can't use is_type_function here) */
5437 if (type->kind != TYPE_FUNCTION) {
5438 if (is_type_valid(type)) {
5439 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5440 type, ndeclaration->symbol);
5446 if (warning.aggregate_return &&
5447 is_type_compound(skip_typeref(type->function.return_type))) {
5448 warningf(HERE, "function '%Y' returns an aggregate",
5449 ndeclaration->symbol);
5451 if (warning.traditional && !type->function.unspecified_parameters) {
5452 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5453 ndeclaration->symbol);
5455 if (warning.old_style_definition && type->function.unspecified_parameters) {
5456 warningf(HERE, "old-style function definition '%Y'",
5457 ndeclaration->symbol);
5460 /* § 6.7.5.3 (14) a function definition with () means no
5461 * parameters (and not unspecified parameters) */
5462 if (type->function.unspecified_parameters
5463 && type->function.parameters == NULL
5464 && !type->function.kr_style_parameters) {
5465 type_t *duplicate = duplicate_type(type);
5466 duplicate->function.unspecified_parameters = false;
5468 type = typehash_insert(duplicate);
5469 if (type != duplicate) {
5470 obstack_free(type_obst, duplicate);
5472 ndeclaration->type = type;
5475 declaration_t *const declaration = record_declaration(ndeclaration, true);
5476 if (ndeclaration != declaration) {
5477 declaration->scope = ndeclaration->scope;
5479 type = skip_typeref(declaration->type);
5481 /* push function parameters and switch scope */
5482 int top = environment_top();
5483 scope_t *last_scope = scope;
5484 set_scope(&declaration->scope);
5486 declaration_t *parameter = declaration->scope.declarations;
5487 for( ; parameter != NULL; parameter = parameter->next) {
5488 if (parameter->parent_scope == &ndeclaration->scope) {
5489 parameter->parent_scope = scope;
5491 assert(parameter->parent_scope == NULL
5492 || parameter->parent_scope == scope);
5493 parameter->parent_scope = scope;
5494 if (parameter->symbol == NULL) {
5495 errorf(¶meter->source_position, "parameter name omitted");
5498 environment_push(parameter);
5501 if (declaration->init.statement != NULL) {
5502 parser_error_multiple_definition(declaration, HERE);
5505 /* parse function body */
5506 int label_stack_top = label_top();
5507 declaration_t *old_current_function = current_function;
5508 current_function = declaration;
5509 current_parent = NULL;
5511 statement_t *const body = parse_compound_statement(false);
5512 declaration->init.statement = body;
5515 check_declarations();
5516 if (warning.return_type ||
5517 warning.unreachable_code ||
5518 (warning.missing_noreturn && !(declaration->modifiers & DM_NORETURN))) {
5519 noreturn_candidate = true;
5520 check_reachable(body);
5521 if (warning.unreachable_code)
5522 check_unreachable(body);
5523 if (warning.missing_noreturn &&
5524 noreturn_candidate &&
5525 !(declaration->modifiers & DM_NORETURN)) {
5526 warningf(&body->base.source_position,
5527 "function '%#T' is candidate for attribute 'noreturn'",
5528 type, declaration->symbol);
5532 assert(current_parent == NULL);
5533 assert(current_function == declaration);
5534 current_function = old_current_function;
5535 label_pop_to(label_stack_top);
5538 assert(scope == &declaration->scope);
5539 set_scope(last_scope);
5540 environment_pop_to(top);
5543 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5544 source_position_t *source_position,
5545 const symbol_t *symbol)
5547 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
5549 type->bitfield.base_type = base_type;
5550 type->bitfield.size_expression = size;
5553 type_t *skipped_type = skip_typeref(base_type);
5554 if (!is_type_integer(skipped_type)) {
5555 errorf(HERE, "bitfield base type '%T' is not an integer type",
5559 bit_size = skipped_type->base.size * 8;
5562 if (is_constant_expression(size)) {
5563 long v = fold_constant(size);
5566 errorf(source_position, "negative width in bit-field '%Y'",
5568 } else if (v == 0) {
5569 errorf(source_position, "zero width for bit-field '%Y'",
5571 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5572 errorf(source_position, "width of '%Y' exceeds its type",
5575 type->bitfield.bit_size = v;
5582 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
5585 declaration_t *iter = compound_declaration->scope.declarations;
5586 for( ; iter != NULL; iter = iter->next) {
5587 if (iter->namespc != NAMESPACE_NORMAL)
5590 if (iter->symbol == NULL) {
5591 type_t *type = skip_typeref(iter->type);
5592 if (is_type_compound(type)) {
5593 declaration_t *result
5594 = find_compound_entry(type->compound.declaration, symbol);
5601 if (iter->symbol == symbol) {
5609 static void parse_compound_declarators(declaration_t *struct_declaration,
5610 const declaration_specifiers_t *specifiers)
5612 declaration_t *last_declaration = struct_declaration->scope.declarations;
5613 if (last_declaration != NULL) {
5614 while (last_declaration->next != NULL) {
5615 last_declaration = last_declaration->next;
5620 declaration_t *declaration;
5622 if (token.type == ':') {
5623 source_position_t source_position = *HERE;
5626 type_t *base_type = specifiers->type;
5627 expression_t *size = parse_constant_expression();
5629 type_t *type = make_bitfield_type(base_type, size,
5630 &source_position, sym_anonymous);
5632 declaration = allocate_declaration_zero();
5633 declaration->namespc = NAMESPACE_NORMAL;
5634 declaration->declared_storage_class = STORAGE_CLASS_NONE;
5635 declaration->storage_class = STORAGE_CLASS_NONE;
5636 declaration->source_position = source_position;
5637 declaration->modifiers = specifiers->modifiers;
5638 declaration->type = type;
5640 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
5642 type_t *orig_type = declaration->type;
5643 type_t *type = skip_typeref(orig_type);
5645 if (token.type == ':') {
5646 source_position_t source_position = *HERE;
5648 expression_t *size = parse_constant_expression();
5650 type_t *bitfield_type = make_bitfield_type(orig_type, size,
5651 &source_position, declaration->symbol);
5652 declaration->type = bitfield_type;
5654 /* TODO we ignore arrays for now... what is missing is a check
5655 * that they're at the end of the struct */
5656 if (is_type_incomplete(type) && !is_type_array(type)) {
5658 "compound member '%Y' has incomplete type '%T'",
5659 declaration->symbol, orig_type);
5660 } else if (is_type_function(type)) {
5661 errorf(HERE, "compound member '%Y' must not have function type '%T'",
5662 declaration->symbol, orig_type);
5667 /* make sure we don't define a symbol multiple times */
5668 symbol_t *symbol = declaration->symbol;
5669 if (symbol != NULL) {
5670 declaration_t *prev_decl
5671 = find_compound_entry(struct_declaration, symbol);
5673 if (prev_decl != NULL) {
5674 assert(prev_decl->symbol == symbol);
5675 errorf(&declaration->source_position,
5676 "multiple declarations of symbol '%Y' (declared %P)",
5677 symbol, &prev_decl->source_position);
5681 /* append declaration */
5682 if (last_declaration != NULL) {
5683 last_declaration->next = declaration;
5685 struct_declaration->scope.declarations = declaration;
5687 last_declaration = declaration;
5689 if (token.type != ',')
5699 static void parse_compound_type_entries(declaration_t *compound_declaration)
5702 add_anchor_token('}');
5704 while (token.type != '}' && token.type != T_EOF) {
5705 declaration_specifiers_t specifiers;
5706 memset(&specifiers, 0, sizeof(specifiers));
5707 parse_declaration_specifiers(&specifiers);
5709 parse_compound_declarators(compound_declaration, &specifiers);
5711 rem_anchor_token('}');
5713 if (token.type == T_EOF) {
5714 errorf(HERE, "EOF while parsing struct");
5719 static type_t *parse_typename(void)
5721 declaration_specifiers_t specifiers;
5722 memset(&specifiers, 0, sizeof(specifiers));
5723 parse_declaration_specifiers(&specifiers);
5724 if (specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
5725 /* TODO: improve error message, user does probably not know what a
5726 * storage class is...
5728 errorf(HERE, "typename may not have a storage class");
5731 type_t *result = parse_abstract_declarator(specifiers.type);
5739 typedef expression_t* (*parse_expression_function) (unsigned precedence);
5740 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
5741 expression_t *left);
5743 typedef struct expression_parser_function_t expression_parser_function_t;
5744 struct expression_parser_function_t {
5745 unsigned precedence;
5746 parse_expression_function parser;
5747 unsigned infix_precedence;
5748 parse_expression_infix_function infix_parser;
5751 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5754 * Prints an error message if an expression was expected but not read
5756 static expression_t *expected_expression_error(void)
5758 /* skip the error message if the error token was read */
5759 if (token.type != T_ERROR) {
5760 errorf(HERE, "expected expression, got token '%K'", &token);
5764 return create_invalid_expression();
5768 * Parse a string constant.
5770 static expression_t *parse_string_const(void)
5773 if (token.type == T_STRING_LITERAL) {
5774 string_t res = token.v.string;
5776 while (token.type == T_STRING_LITERAL) {
5777 res = concat_strings(&res, &token.v.string);
5780 if (token.type != T_WIDE_STRING_LITERAL) {
5781 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
5782 /* note: that we use type_char_ptr here, which is already the
5783 * automatic converted type. revert_automatic_type_conversion
5784 * will construct the array type */
5785 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
5786 cnst->string.value = res;
5790 wres = concat_string_wide_string(&res, &token.v.wide_string);
5792 wres = token.v.wide_string;
5797 switch (token.type) {
5798 case T_WIDE_STRING_LITERAL:
5799 wres = concat_wide_strings(&wres, &token.v.wide_string);
5802 case T_STRING_LITERAL:
5803 wres = concat_wide_string_string(&wres, &token.v.string);
5807 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5808 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5809 cnst->wide_string.value = wres;
5818 * Parse an integer constant.
5820 static expression_t *parse_int_const(void)
5822 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5823 cnst->base.source_position = *HERE;
5824 cnst->base.type = token.datatype;
5825 cnst->conste.v.int_value = token.v.intvalue;
5833 * Parse a character constant.
5835 static expression_t *parse_character_constant(void)
5837 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
5839 cnst->base.source_position = *HERE;
5840 cnst->base.type = token.datatype;
5841 cnst->conste.v.character = token.v.string;
5843 if (cnst->conste.v.character.size != 1) {
5844 if (warning.multichar && GNU_MODE) {
5845 warningf(HERE, "multi-character character constant");
5847 errorf(HERE, "more than 1 characters in character constant");
5856 * Parse a wide character constant.
5858 static expression_t *parse_wide_character_constant(void)
5860 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
5862 cnst->base.source_position = *HERE;
5863 cnst->base.type = token.datatype;
5864 cnst->conste.v.wide_character = token.v.wide_string;
5866 if (cnst->conste.v.wide_character.size != 1) {
5867 if (warning.multichar && GNU_MODE) {
5868 warningf(HERE, "multi-character character constant");
5870 errorf(HERE, "more than 1 characters in character constant");
5879 * Parse a float constant.
5881 static expression_t *parse_float_const(void)
5883 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5884 cnst->base.type = token.datatype;
5885 cnst->conste.v.float_value = token.v.floatvalue;
5892 static declaration_t *create_implicit_function(symbol_t *symbol,
5893 const source_position_t *source_position)
5895 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
5896 ntype->function.return_type = type_int;
5897 ntype->function.unspecified_parameters = true;
5899 type_t *type = typehash_insert(ntype);
5900 if (type != ntype) {
5904 declaration_t *const declaration = allocate_declaration_zero();
5905 declaration->storage_class = STORAGE_CLASS_EXTERN;
5906 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
5907 declaration->type = type;
5908 declaration->symbol = symbol;
5909 declaration->source_position = *source_position;
5910 declaration->implicit = true;
5912 bool strict_prototypes_old = warning.strict_prototypes;
5913 warning.strict_prototypes = false;
5914 record_declaration(declaration, false);
5915 warning.strict_prototypes = strict_prototypes_old;
5921 * Creates a return_type (func)(argument_type) function type if not
5924 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
5925 type_t *argument_type2)
5927 function_parameter_t *parameter2
5928 = obstack_alloc(type_obst, sizeof(parameter2[0]));
5929 memset(parameter2, 0, sizeof(parameter2[0]));
5930 parameter2->type = argument_type2;
5932 function_parameter_t *parameter1
5933 = obstack_alloc(type_obst, sizeof(parameter1[0]));
5934 memset(parameter1, 0, sizeof(parameter1[0]));
5935 parameter1->type = argument_type1;
5936 parameter1->next = parameter2;
5938 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5939 type->function.return_type = return_type;
5940 type->function.parameters = parameter1;
5942 type_t *result = typehash_insert(type);
5943 if (result != type) {
5951 * Creates a return_type (func)(argument_type) function type if not
5954 * @param return_type the return type
5955 * @param argument_type the argument type
5957 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
5959 function_parameter_t *parameter
5960 = obstack_alloc(type_obst, sizeof(parameter[0]));
5961 memset(parameter, 0, sizeof(parameter[0]));
5962 parameter->type = argument_type;
5964 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5965 type->function.return_type = return_type;
5966 type->function.parameters = parameter;
5968 type_t *result = typehash_insert(type);
5969 if (result != type) {
5976 static type_t *make_function_0_type(type_t *return_type)
5978 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5979 type->function.return_type = return_type;
5980 type->function.parameters = NULL;
5982 type_t *result = typehash_insert(type);
5983 if (result != type) {
5991 * Creates a function type for some function like builtins.
5993 * @param symbol the symbol describing the builtin
5995 static type_t *get_builtin_symbol_type(symbol_t *symbol)
5997 switch(symbol->ID) {
5998 case T___builtin_alloca:
5999 return make_function_1_type(type_void_ptr, type_size_t);
6000 case T___builtin_huge_val:
6001 return make_function_0_type(type_double);
6002 case T___builtin_nan:
6003 return make_function_1_type(type_double, type_char_ptr);
6004 case T___builtin_nanf:
6005 return make_function_1_type(type_float, type_char_ptr);
6006 case T___builtin_nand:
6007 return make_function_1_type(type_long_double, type_char_ptr);
6008 case T___builtin_va_end:
6009 return make_function_1_type(type_void, type_valist);
6010 case T___builtin_expect:
6011 return make_function_2_type(type_long, type_long, type_long);
6013 internal_errorf(HERE, "not implemented builtin symbol found");
6018 * Performs automatic type cast as described in § 6.3.2.1.
6020 * @param orig_type the original type
6022 static type_t *automatic_type_conversion(type_t *orig_type)
6024 type_t *type = skip_typeref(orig_type);
6025 if (is_type_array(type)) {
6026 array_type_t *array_type = &type->array;
6027 type_t *element_type = array_type->element_type;
6028 unsigned qualifiers = array_type->base.qualifiers;
6030 return make_pointer_type(element_type, qualifiers);
6033 if (is_type_function(type)) {
6034 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6041 * reverts the automatic casts of array to pointer types and function
6042 * to function-pointer types as defined § 6.3.2.1
6044 type_t *revert_automatic_type_conversion(const expression_t *expression)
6046 switch (expression->kind) {
6047 case EXPR_REFERENCE: return expression->reference.declaration->type;
6050 return get_qualified_type(expression->select.compound_entry->type,
6051 expression->base.type->base.qualifiers);
6053 case EXPR_UNARY_DEREFERENCE: {
6054 const expression_t *const value = expression->unary.value;
6055 type_t *const type = skip_typeref(value->base.type);
6056 assert(is_type_pointer(type));
6057 return type->pointer.points_to;
6060 case EXPR_BUILTIN_SYMBOL:
6061 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
6063 case EXPR_ARRAY_ACCESS: {
6064 const expression_t *array_ref = expression->array_access.array_ref;
6065 type_t *type_left = skip_typeref(array_ref->base.type);
6066 if (!is_type_valid(type_left))
6068 assert(is_type_pointer(type_left));
6069 return type_left->pointer.points_to;
6072 case EXPR_STRING_LITERAL: {
6073 size_t size = expression->string.value.size;
6074 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6077 case EXPR_WIDE_STRING_LITERAL: {
6078 size_t size = expression->wide_string.value.size;
6079 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6082 case EXPR_COMPOUND_LITERAL:
6083 return expression->compound_literal.type;
6088 return expression->base.type;
6091 static expression_t *parse_reference(void)
6093 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
6095 reference_expression_t *ref = &expression->reference;
6096 symbol_t *const symbol = token.v.symbol;
6098 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
6100 if (declaration == NULL) {
6101 if (!strict_mode && look_ahead(1)->type == '(') {
6102 /* an implicitly declared function */
6103 if (warning.implicit_function_declaration) {
6104 warningf(HERE, "implicit declaration of function '%Y'",
6108 declaration = create_implicit_function(symbol, HERE);
6110 errorf(HERE, "unknown symbol '%Y' found.", symbol);
6111 declaration = create_error_declaration(symbol, STORAGE_CLASS_NONE);
6115 type_t *type = declaration->type;
6117 /* we always do the auto-type conversions; the & and sizeof parser contains
6118 * code to revert this! */
6119 type = automatic_type_conversion(type);
6121 ref->declaration = declaration;
6122 ref->base.type = type;
6124 /* this declaration is used */
6125 declaration->used = true;
6127 /* check for deprecated functions */
6128 if (warning.deprecated_declarations &&
6129 declaration->modifiers & DM_DEPRECATED) {
6130 char const *const prefix = is_type_function(declaration->type) ?
6131 "function" : "variable";
6133 if (declaration->deprecated_string != NULL) {
6134 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
6135 prefix, declaration->symbol, &declaration->source_position,
6136 declaration->deprecated_string);
6138 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
6139 declaration->symbol, &declaration->source_position);
6142 if (warning.init_self && declaration == current_init_decl && !in_type_prop) {
6143 current_init_decl = NULL;
6144 warningf(HERE, "variable '%#T' is initialized by itself",
6145 declaration->type, declaration->symbol);
6152 static bool semantic_cast(expression_t *cast)
6154 expression_t *expression = cast->unary.value;
6155 type_t *orig_dest_type = cast->base.type;
6156 type_t *orig_type_right = expression->base.type;
6157 type_t const *dst_type = skip_typeref(orig_dest_type);
6158 type_t const *src_type = skip_typeref(orig_type_right);
6159 source_position_t const *pos = &cast->base.source_position;
6161 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6162 if (dst_type == type_void)
6165 /* only integer and pointer can be casted to pointer */
6166 if (is_type_pointer(dst_type) &&
6167 !is_type_pointer(src_type) &&
6168 !is_type_integer(src_type) &&
6169 is_type_valid(src_type)) {
6170 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6174 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6175 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6179 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6180 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6184 if (warning.cast_qual &&
6185 is_type_pointer(src_type) &&
6186 is_type_pointer(dst_type)) {
6187 type_t *src = skip_typeref(src_type->pointer.points_to);
6188 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6189 unsigned missing_qualifiers =
6190 src->base.qualifiers & ~dst->base.qualifiers;
6191 if (missing_qualifiers != 0) {
6193 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6194 missing_qualifiers, orig_type_right);
6200 static expression_t *parse_compound_literal(type_t *type)
6202 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6204 parse_initializer_env_t env;
6206 env.declaration = NULL;
6207 env.must_be_constant = false;
6208 initializer_t *initializer = parse_initializer(&env);
6211 expression->compound_literal.initializer = initializer;
6212 expression->compound_literal.type = type;
6213 expression->base.type = automatic_type_conversion(type);
6219 * Parse a cast expression.
6221 static expression_t *parse_cast(void)
6223 add_anchor_token(')');
6225 source_position_t source_position = token.source_position;
6227 type_t *type = parse_typename();
6229 rem_anchor_token(')');
6232 if (token.type == '{') {
6233 return parse_compound_literal(type);
6236 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6237 cast->base.source_position = source_position;
6239 expression_t *value = parse_sub_expression(20);
6240 cast->base.type = type;
6241 cast->unary.value = value;
6243 if (! semantic_cast(cast)) {
6244 /* TODO: record the error in the AST. else it is impossible to detect it */
6249 return create_invalid_expression();
6253 * Parse a statement expression.
6255 static expression_t *parse_statement_expression(void)
6257 add_anchor_token(')');
6259 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6261 statement_t *statement = parse_compound_statement(true);
6262 expression->statement.statement = statement;
6263 expression->base.source_position = statement->base.source_position;
6265 /* find last statement and use its type */
6266 type_t *type = type_void;
6267 const statement_t *stmt = statement->compound.statements;
6269 while (stmt->base.next != NULL)
6270 stmt = stmt->base.next;
6272 if (stmt->kind == STATEMENT_EXPRESSION) {
6273 type = stmt->expression.expression->base.type;
6276 warningf(&expression->base.source_position, "empty statement expression ({})");
6278 expression->base.type = type;
6280 rem_anchor_token(')');
6288 * Parse a parenthesized expression.
6290 static expression_t *parse_parenthesized_expression(void)
6294 switch(token.type) {
6296 /* gcc extension: a statement expression */
6297 return parse_statement_expression();
6301 return parse_cast();
6303 if (is_typedef_symbol(token.v.symbol)) {
6304 return parse_cast();
6308 add_anchor_token(')');
6309 expression_t *result = parse_expression();
6310 rem_anchor_token(')');
6317 static expression_t *parse_function_keyword(void)
6322 if (current_function == NULL) {
6323 errorf(HERE, "'__func__' used outside of a function");
6326 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6327 expression->base.type = type_char_ptr;
6328 expression->funcname.kind = FUNCNAME_FUNCTION;
6333 static expression_t *parse_pretty_function_keyword(void)
6335 eat(T___PRETTY_FUNCTION__);
6337 if (current_function == NULL) {
6338 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6341 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6342 expression->base.type = type_char_ptr;
6343 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6348 static expression_t *parse_funcsig_keyword(void)
6352 if (current_function == NULL) {
6353 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6356 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6357 expression->base.type = type_char_ptr;
6358 expression->funcname.kind = FUNCNAME_FUNCSIG;
6363 static expression_t *parse_funcdname_keyword(void)
6365 eat(T___FUNCDNAME__);
6367 if (current_function == NULL) {
6368 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6371 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6372 expression->base.type = type_char_ptr;
6373 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6378 static designator_t *parse_designator(void)
6380 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6381 result->source_position = *HERE;
6383 if (token.type != T_IDENTIFIER) {
6384 parse_error_expected("while parsing member designator",
6385 T_IDENTIFIER, NULL);
6388 result->symbol = token.v.symbol;
6391 designator_t *last_designator = result;
6393 if (token.type == '.') {
6395 if (token.type != T_IDENTIFIER) {
6396 parse_error_expected("while parsing member designator",
6397 T_IDENTIFIER, NULL);
6400 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6401 designator->source_position = *HERE;
6402 designator->symbol = token.v.symbol;
6405 last_designator->next = designator;
6406 last_designator = designator;
6409 if (token.type == '[') {
6411 add_anchor_token(']');
6412 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6413 designator->source_position = *HERE;
6414 designator->array_index = parse_expression();
6415 rem_anchor_token(']');
6417 if (designator->array_index == NULL) {
6421 last_designator->next = designator;
6422 last_designator = designator;
6434 * Parse the __builtin_offsetof() expression.
6436 static expression_t *parse_offsetof(void)
6438 eat(T___builtin_offsetof);
6440 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6441 expression->base.type = type_size_t;
6444 add_anchor_token(',');
6445 type_t *type = parse_typename();
6446 rem_anchor_token(',');
6448 add_anchor_token(')');
6449 designator_t *designator = parse_designator();
6450 rem_anchor_token(')');
6453 expression->offsetofe.type = type;
6454 expression->offsetofe.designator = designator;
6457 memset(&path, 0, sizeof(path));
6458 path.top_type = type;
6459 path.path = NEW_ARR_F(type_path_entry_t, 0);
6461 descend_into_subtype(&path);
6463 if (!walk_designator(&path, designator, true)) {
6464 return create_invalid_expression();
6467 DEL_ARR_F(path.path);
6471 return create_invalid_expression();
6475 * Parses a _builtin_va_start() expression.
6477 static expression_t *parse_va_start(void)
6479 eat(T___builtin_va_start);
6481 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6484 add_anchor_token(',');
6485 expression->va_starte.ap = parse_assignment_expression();
6486 rem_anchor_token(',');
6488 expression_t *const expr = parse_assignment_expression();
6489 if (expr->kind == EXPR_REFERENCE) {
6490 declaration_t *const decl = expr->reference.declaration;
6491 if (decl->parent_scope != ¤t_function->scope || decl->next != NULL) {
6492 errorf(&expr->base.source_position,
6493 "second argument of 'va_start' must be last parameter of the current function");
6495 expression->va_starte.parameter = decl;
6501 return create_invalid_expression();
6505 * Parses a _builtin_va_arg() expression.
6507 static expression_t *parse_va_arg(void)
6509 eat(T___builtin_va_arg);
6511 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6514 expression->va_arge.ap = parse_assignment_expression();
6516 expression->base.type = parse_typename();
6521 return create_invalid_expression();
6524 static expression_t *parse_builtin_symbol(void)
6526 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
6528 symbol_t *symbol = token.v.symbol;
6530 expression->builtin_symbol.symbol = symbol;
6533 type_t *type = get_builtin_symbol_type(symbol);
6534 type = automatic_type_conversion(type);
6536 expression->base.type = type;
6541 * Parses a __builtin_constant() expression.
6543 static expression_t *parse_builtin_constant(void)
6545 eat(T___builtin_constant_p);
6547 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6550 add_anchor_token(')');
6551 expression->builtin_constant.value = parse_assignment_expression();
6552 rem_anchor_token(')');
6554 expression->base.type = type_int;
6558 return create_invalid_expression();
6562 * Parses a __builtin_prefetch() expression.
6564 static expression_t *parse_builtin_prefetch(void)
6566 eat(T___builtin_prefetch);
6568 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
6571 add_anchor_token(')');
6572 expression->builtin_prefetch.adr = parse_assignment_expression();
6573 if (token.type == ',') {
6575 expression->builtin_prefetch.rw = parse_assignment_expression();
6577 if (token.type == ',') {
6579 expression->builtin_prefetch.locality = parse_assignment_expression();
6581 rem_anchor_token(')');
6583 expression->base.type = type_void;
6587 return create_invalid_expression();
6591 * Parses a __builtin_is_*() compare expression.
6593 static expression_t *parse_compare_builtin(void)
6595 expression_t *expression;
6597 switch(token.type) {
6598 case T___builtin_isgreater:
6599 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6601 case T___builtin_isgreaterequal:
6602 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6604 case T___builtin_isless:
6605 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6607 case T___builtin_islessequal:
6608 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6610 case T___builtin_islessgreater:
6611 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6613 case T___builtin_isunordered:
6614 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6617 internal_errorf(HERE, "invalid compare builtin found");
6620 expression->base.source_position = *HERE;
6624 expression->binary.left = parse_assignment_expression();
6626 expression->binary.right = parse_assignment_expression();
6629 type_t *const orig_type_left = expression->binary.left->base.type;
6630 type_t *const orig_type_right = expression->binary.right->base.type;
6632 type_t *const type_left = skip_typeref(orig_type_left);
6633 type_t *const type_right = skip_typeref(orig_type_right);
6634 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6635 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6636 type_error_incompatible("invalid operands in comparison",
6637 &expression->base.source_position, orig_type_left, orig_type_right);
6640 semantic_comparison(&expression->binary);
6645 return create_invalid_expression();
6650 * Parses a __builtin_expect() expression.
6652 static expression_t *parse_builtin_expect(void)
6654 eat(T___builtin_expect);
6656 expression_t *expression
6657 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
6660 expression->binary.left = parse_assignment_expression();
6662 expression->binary.right = parse_constant_expression();
6665 expression->base.type = expression->binary.left->base.type;
6669 return create_invalid_expression();
6674 * Parses a MS assume() expression.
6676 static expression_t *parse_assume(void)
6680 expression_t *expression
6681 = allocate_expression_zero(EXPR_UNARY_ASSUME);
6684 add_anchor_token(')');
6685 expression->unary.value = parse_assignment_expression();
6686 rem_anchor_token(')');
6689 expression->base.type = type_void;
6692 return create_invalid_expression();
6696 * Return the declaration for a given label symbol or create a new one.
6698 * @param symbol the symbol of the label
6700 static declaration_t *get_label(symbol_t *symbol)
6702 declaration_t *candidate;
6703 assert(current_function != NULL);
6705 candidate = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
6706 /* if we found a local label, we already created the declaration */
6707 if (candidate != NULL) {
6708 assert(candidate->parent_scope == scope);
6712 candidate = get_declaration(symbol, NAMESPACE_LABEL);
6713 /* if we found a label in the same function, then we already created the
6715 if (candidate != NULL
6716 && candidate->parent_scope == ¤t_function->scope) {
6720 /* otherwise we need to create a new one */
6721 declaration_t *const declaration = allocate_declaration_zero();
6722 declaration->namespc = NAMESPACE_LABEL;
6723 declaration->symbol = symbol;
6725 label_push(declaration);
6731 * Parses a GNU && label address expression.
6733 static expression_t *parse_label_address(void)
6735 source_position_t source_position = token.source_position;
6737 if (token.type != T_IDENTIFIER) {
6738 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6741 symbol_t *symbol = token.v.symbol;
6744 declaration_t *label = get_label(symbol);
6747 label->address_taken = true;
6749 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6750 expression->base.source_position = source_position;
6752 /* label address is threaten as a void pointer */
6753 expression->base.type = type_void_ptr;
6754 expression->label_address.declaration = label;
6757 return create_invalid_expression();
6761 * Parse a microsoft __noop expression.
6763 static expression_t *parse_noop_expression(void)
6765 source_position_t source_position = *HERE;
6768 if (token.type == '(') {
6769 /* parse arguments */
6771 add_anchor_token(')');
6772 add_anchor_token(',');
6774 if (token.type != ')') {
6776 (void)parse_assignment_expression();
6777 if (token.type != ',')
6783 rem_anchor_token(',');
6784 rem_anchor_token(')');
6787 /* the result is a (int)0 */
6788 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6789 cnst->base.source_position = source_position;
6790 cnst->base.type = type_int;
6791 cnst->conste.v.int_value = 0;
6792 cnst->conste.is_ms_noop = true;
6797 return create_invalid_expression();
6801 * Parses a primary expression.
6803 static expression_t *parse_primary_expression(void)
6805 switch (token.type) {
6806 case T_INTEGER: return parse_int_const();
6807 case T_CHARACTER_CONSTANT: return parse_character_constant();
6808 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6809 case T_FLOATINGPOINT: return parse_float_const();
6810 case T_STRING_LITERAL:
6811 case T_WIDE_STRING_LITERAL: return parse_string_const();
6812 case T_IDENTIFIER: return parse_reference();
6813 case T___FUNCTION__:
6814 case T___func__: return parse_function_keyword();
6815 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6816 case T___FUNCSIG__: return parse_funcsig_keyword();
6817 case T___FUNCDNAME__: return parse_funcdname_keyword();
6818 case T___builtin_offsetof: return parse_offsetof();
6819 case T___builtin_va_start: return parse_va_start();
6820 case T___builtin_va_arg: return parse_va_arg();
6821 case T___builtin_expect:
6822 case T___builtin_alloca:
6823 case T___builtin_nan:
6824 case T___builtin_nand:
6825 case T___builtin_nanf:
6826 case T___builtin_huge_val:
6827 case T___builtin_va_end: return parse_builtin_symbol();
6828 case T___builtin_isgreater:
6829 case T___builtin_isgreaterequal:
6830 case T___builtin_isless:
6831 case T___builtin_islessequal:
6832 case T___builtin_islessgreater:
6833 case T___builtin_isunordered: return parse_compare_builtin();
6834 case T___builtin_constant_p: return parse_builtin_constant();
6835 case T___builtin_prefetch: return parse_builtin_prefetch();
6836 case T__assume: return parse_assume();
6839 return parse_label_address();
6842 case '(': return parse_parenthesized_expression();
6843 case T___noop: return parse_noop_expression();
6846 errorf(HERE, "unexpected token %K, expected an expression", &token);
6847 return create_invalid_expression();
6851 * Check if the expression has the character type and issue a warning then.
6853 static void check_for_char_index_type(const expression_t *expression)
6855 type_t *const type = expression->base.type;
6856 const type_t *const base_type = skip_typeref(type);
6858 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
6859 warning.char_subscripts) {
6860 warningf(&expression->base.source_position,
6861 "array subscript has type '%T'", type);
6865 static expression_t *parse_array_expression(unsigned precedence,
6871 add_anchor_token(']');
6873 expression_t *inside = parse_expression();
6875 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6877 array_access_expression_t *array_access = &expression->array_access;
6879 type_t *const orig_type_left = left->base.type;
6880 type_t *const orig_type_inside = inside->base.type;
6882 type_t *const type_left = skip_typeref(orig_type_left);
6883 type_t *const type_inside = skip_typeref(orig_type_inside);
6885 type_t *return_type;
6886 if (is_type_pointer(type_left)) {
6887 return_type = type_left->pointer.points_to;
6888 array_access->array_ref = left;
6889 array_access->index = inside;
6890 check_for_char_index_type(inside);
6891 } else if (is_type_pointer(type_inside)) {
6892 return_type = type_inside->pointer.points_to;
6893 array_access->array_ref = inside;
6894 array_access->index = left;
6895 array_access->flipped = true;
6896 check_for_char_index_type(left);
6898 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6900 "array access on object with non-pointer types '%T', '%T'",
6901 orig_type_left, orig_type_inside);
6903 return_type = type_error_type;
6904 array_access->array_ref = left;
6905 array_access->index = inside;
6908 expression->base.type = automatic_type_conversion(return_type);
6910 rem_anchor_token(']');
6911 if (token.type == ']') {
6914 parse_error_expected("Problem while parsing array access", ']', NULL);
6919 static expression_t *parse_typeprop(expression_kind_t const kind,
6920 source_position_t const pos,
6921 unsigned const precedence)
6923 expression_t *tp_expression = allocate_expression_zero(kind);
6924 tp_expression->base.type = type_size_t;
6925 tp_expression->base.source_position = pos;
6927 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6929 /* we only refer to a type property, mark this case */
6930 bool old = in_type_prop;
6931 in_type_prop = true;
6932 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
6934 add_anchor_token(')');
6935 type_t* const orig_type = parse_typename();
6936 tp_expression->typeprop.type = orig_type;
6938 type_t const* const type = skip_typeref(orig_type);
6939 char const* const wrong_type =
6940 is_type_incomplete(type) ? "incomplete" :
6941 type->kind == TYPE_FUNCTION ? "function designator" :
6942 type->kind == TYPE_BITFIELD ? "bitfield" :
6944 if (wrong_type != NULL) {
6945 errorf(&pos, "operand of %s expression must not be %s type '%T'",
6946 what, wrong_type, type);
6949 rem_anchor_token(')');
6952 expression_t *expression = parse_sub_expression(precedence);
6954 type_t* const orig_type = revert_automatic_type_conversion(expression);
6955 expression->base.type = orig_type;
6957 type_t const* const type = skip_typeref(orig_type);
6958 char const* const wrong_type =
6959 is_type_incomplete(type) ? "incomplete" :
6960 type->kind == TYPE_FUNCTION ? "function designator" :
6961 type->kind == TYPE_BITFIELD ? "bitfield" :
6963 if (wrong_type != NULL) {
6964 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
6967 tp_expression->typeprop.type = expression->base.type;
6968 tp_expression->typeprop.tp_expression = expression;
6973 return tp_expression;
6976 static expression_t *parse_sizeof(unsigned precedence)
6978 source_position_t pos = *HERE;
6980 return parse_typeprop(EXPR_SIZEOF, pos, precedence);
6983 static expression_t *parse_alignof(unsigned precedence)
6985 source_position_t pos = *HERE;
6987 return parse_typeprop(EXPR_ALIGNOF, pos, precedence);
6990 static expression_t *parse_select_expression(unsigned precedence,
6991 expression_t *compound)
6994 assert(token.type == '.' || token.type == T_MINUSGREATER);
6996 bool is_pointer = (token.type == T_MINUSGREATER);
6999 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7000 select->select.compound = compound;
7002 if (token.type != T_IDENTIFIER) {
7003 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7006 symbol_t *symbol = token.v.symbol;
7009 type_t *const orig_type = compound->base.type;
7010 type_t *const type = skip_typeref(orig_type);
7013 bool saw_error = false;
7014 if (is_type_pointer(type)) {
7017 "request for member '%Y' in something not a struct or union, but '%T'",
7021 type_left = skip_typeref(type->pointer.points_to);
7023 if (is_pointer && is_type_valid(type)) {
7024 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7030 declaration_t *entry;
7031 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7032 type_left->kind == TYPE_COMPOUND_UNION) {
7033 declaration_t *const declaration = type_left->compound.declaration;
7035 if (!declaration->init.complete) {
7036 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7038 goto create_error_entry;
7041 entry = find_compound_entry(declaration, symbol);
7042 if (entry == NULL) {
7043 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7044 goto create_error_entry;
7047 if (is_type_valid(type_left) && !saw_error) {
7049 "request for member '%Y' in something not a struct or union, but '%T'",
7053 entry = allocate_declaration_zero();
7054 entry->symbol = symbol;
7057 select->select.compound_entry = entry;
7059 type_t *const res_type =
7060 get_qualified_type(entry->type, type_left->base.qualifiers);
7062 /* we always do the auto-type conversions; the & and sizeof parser contains
7063 * code to revert this! */
7064 select->base.type = automatic_type_conversion(res_type);
7066 type_t *skipped = skip_typeref(res_type);
7067 if (skipped->kind == TYPE_BITFIELD) {
7068 select->base.type = skipped->bitfield.base_type;
7074 static void check_call_argument(const function_parameter_t *parameter,
7075 call_argument_t *argument, unsigned pos)
7077 type_t *expected_type = parameter->type;
7078 type_t *expected_type_skip = skip_typeref(expected_type);
7079 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7080 expression_t *arg_expr = argument->expression;
7081 type_t *arg_type = skip_typeref(arg_expr->base.type);
7083 /* handle transparent union gnu extension */
7084 if (is_type_union(expected_type_skip)
7085 && (expected_type_skip->base.modifiers
7086 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
7087 declaration_t *union_decl = expected_type_skip->compound.declaration;
7089 declaration_t *declaration = union_decl->scope.declarations;
7090 type_t *best_type = NULL;
7091 for ( ; declaration != NULL; declaration = declaration->next) {
7092 type_t *decl_type = declaration->type;
7093 error = semantic_assign(decl_type, arg_expr);
7094 if (error == ASSIGN_ERROR_INCOMPATIBLE
7095 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7098 if (error == ASSIGN_SUCCESS) {
7099 best_type = decl_type;
7100 } else if (best_type == NULL) {
7101 best_type = decl_type;
7105 if (best_type != NULL) {
7106 expected_type = best_type;
7110 error = semantic_assign(expected_type, arg_expr);
7111 argument->expression = create_implicit_cast(argument->expression,
7114 if (error != ASSIGN_SUCCESS) {
7115 /* report exact scope in error messages (like "in argument 3") */
7117 snprintf(buf, sizeof(buf), "call argument %u", pos);
7118 report_assign_error(error, expected_type, arg_expr, buf,
7119 &arg_expr->base.source_position);
7120 } else if (warning.traditional || warning.conversion) {
7121 type_t *const promoted_type = get_default_promoted_type(arg_type);
7122 if (!types_compatible(expected_type_skip, promoted_type) &&
7123 !types_compatible(expected_type_skip, type_void_ptr) &&
7124 !types_compatible(type_void_ptr, promoted_type)) {
7125 /* Deliberately show the skipped types in this warning */
7126 warningf(&arg_expr->base.source_position,
7127 "passing call argument %u as '%T' rather than '%T' due to prototype",
7128 pos, expected_type_skip, promoted_type);
7134 * Parse a call expression, ie. expression '( ... )'.
7136 * @param expression the function address
7138 static expression_t *parse_call_expression(unsigned precedence,
7139 expression_t *expression)
7142 expression_t *result = allocate_expression_zero(EXPR_CALL);
7143 result->base.source_position = expression->base.source_position;
7145 call_expression_t *call = &result->call;
7146 call->function = expression;
7148 type_t *const orig_type = expression->base.type;
7149 type_t *const type = skip_typeref(orig_type);
7151 function_type_t *function_type = NULL;
7152 if (is_type_pointer(type)) {
7153 type_t *const to_type = skip_typeref(type->pointer.points_to);
7155 if (is_type_function(to_type)) {
7156 function_type = &to_type->function;
7157 call->base.type = function_type->return_type;
7161 if (function_type == NULL && is_type_valid(type)) {
7162 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
7165 /* parse arguments */
7167 add_anchor_token(')');
7168 add_anchor_token(',');
7170 if (token.type != ')') {
7171 call_argument_t *last_argument = NULL;
7174 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7176 argument->expression = parse_assignment_expression();
7177 if (last_argument == NULL) {
7178 call->arguments = argument;
7180 last_argument->next = argument;
7182 last_argument = argument;
7184 if (token.type != ',')
7189 rem_anchor_token(',');
7190 rem_anchor_token(')');
7193 if (function_type == NULL)
7196 function_parameter_t *parameter = function_type->parameters;
7197 call_argument_t *argument = call->arguments;
7198 if (!function_type->unspecified_parameters) {
7199 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7200 parameter = parameter->next, argument = argument->next) {
7201 check_call_argument(parameter, argument, ++pos);
7204 if (parameter != NULL) {
7205 errorf(HERE, "too few arguments to function '%E'", expression);
7206 } else if (argument != NULL && !function_type->variadic) {
7207 errorf(HERE, "too many arguments to function '%E'", expression);
7211 /* do default promotion */
7212 for( ; argument != NULL; argument = argument->next) {
7213 type_t *type = argument->expression->base.type;
7215 type = get_default_promoted_type(type);
7217 argument->expression
7218 = create_implicit_cast(argument->expression, type);
7221 check_format(&result->call);
7223 if (warning.aggregate_return &&
7224 is_type_compound(skip_typeref(function_type->return_type))) {
7225 warningf(&result->base.source_position,
7226 "function call has aggregate value");
7233 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7235 static bool same_compound_type(const type_t *type1, const type_t *type2)
7238 is_type_compound(type1) &&
7239 type1->kind == type2->kind &&
7240 type1->compound.declaration == type2->compound.declaration;
7244 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7246 * @param expression the conditional expression
7248 static expression_t *parse_conditional_expression(unsigned precedence,
7249 expression_t *expression)
7251 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7253 conditional_expression_t *conditional = &result->conditional;
7254 conditional->base.source_position = *HERE;
7255 conditional->condition = expression;
7258 add_anchor_token(':');
7261 type_t *const condition_type_orig = expression->base.type;
7262 type_t *const condition_type = skip_typeref(condition_type_orig);
7263 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
7264 type_error("expected a scalar type in conditional condition",
7265 &expression->base.source_position, condition_type_orig);
7268 expression_t *true_expression = expression;
7269 bool gnu_cond = false;
7270 if (GNU_MODE && token.type == ':') {
7273 true_expression = parse_expression();
7274 rem_anchor_token(':');
7276 expression_t *false_expression = parse_sub_expression(precedence);
7278 type_t *const orig_true_type = true_expression->base.type;
7279 type_t *const orig_false_type = false_expression->base.type;
7280 type_t *const true_type = skip_typeref(orig_true_type);
7281 type_t *const false_type = skip_typeref(orig_false_type);
7284 type_t *result_type;
7285 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7286 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7287 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID)
7288 || !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7289 warningf(&conditional->base.source_position,
7290 "ISO C forbids conditional expression with only one void side");
7292 result_type = type_void;
7293 } else if (is_type_arithmetic(true_type)
7294 && is_type_arithmetic(false_type)) {
7295 result_type = semantic_arithmetic(true_type, false_type);
7297 true_expression = create_implicit_cast(true_expression, result_type);
7298 false_expression = create_implicit_cast(false_expression, result_type);
7300 conditional->true_expression = true_expression;
7301 conditional->false_expression = false_expression;
7302 conditional->base.type = result_type;
7303 } else if (same_compound_type(true_type, false_type)) {
7304 /* just take 1 of the 2 types */
7305 result_type = true_type;
7306 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7307 type_t *pointer_type;
7309 expression_t *other_expression;
7310 if (is_type_pointer(true_type) &&
7311 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7312 pointer_type = true_type;
7313 other_type = false_type;
7314 other_expression = false_expression;
7316 pointer_type = false_type;
7317 other_type = true_type;
7318 other_expression = true_expression;
7321 if (is_null_pointer_constant(other_expression)) {
7322 result_type = pointer_type;
7323 } else if (is_type_pointer(other_type)) {
7324 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7325 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7328 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7329 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7331 } else if (types_compatible(get_unqualified_type(to1),
7332 get_unqualified_type(to2))) {
7335 warningf(&conditional->base.source_position,
7336 "pointer types '%T' and '%T' in conditional expression are incompatible",
7337 true_type, false_type);
7341 type_t *const type =
7342 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7343 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7344 } else if (is_type_integer(other_type)) {
7345 warningf(&conditional->base.source_position,
7346 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7347 result_type = pointer_type;
7349 type_error_incompatible("while parsing conditional",
7350 &expression->base.source_position, true_type, false_type);
7351 result_type = type_error_type;
7354 /* TODO: one pointer to void*, other some pointer */
7356 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7357 type_error_incompatible("while parsing conditional",
7358 &conditional->base.source_position, true_type,
7361 result_type = type_error_type;
7364 conditional->true_expression
7365 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7366 conditional->false_expression
7367 = create_implicit_cast(false_expression, result_type);
7368 conditional->base.type = result_type;
7371 return create_invalid_expression();
7375 * Parse an extension expression.
7377 static expression_t *parse_extension(unsigned precedence)
7379 eat(T___extension__);
7381 bool old_gcc_extension = in_gcc_extension;
7382 in_gcc_extension = true;
7383 expression_t *expression = parse_sub_expression(precedence);
7384 in_gcc_extension = old_gcc_extension;
7389 * Parse a __builtin_classify_type() expression.
7391 static expression_t *parse_builtin_classify_type(const unsigned precedence)
7393 eat(T___builtin_classify_type);
7395 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7396 result->base.type = type_int;
7399 add_anchor_token(')');
7400 expression_t *expression = parse_sub_expression(precedence);
7401 rem_anchor_token(')');
7403 result->classify_type.type_expression = expression;
7407 return create_invalid_expression();
7410 static bool check_pointer_arithmetic(const source_position_t *source_position,
7411 type_t *pointer_type,
7412 type_t *orig_pointer_type)
7414 type_t *points_to = pointer_type->pointer.points_to;
7415 points_to = skip_typeref(points_to);
7417 if (is_type_incomplete(points_to)) {
7418 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7419 errorf(source_position,
7420 "arithmetic with pointer to incomplete type '%T' not allowed",
7423 } else if (warning.pointer_arith) {
7424 warningf(source_position,
7425 "pointer of type '%T' used in arithmetic",
7428 } else if (is_type_function(points_to)) {
7430 errorf(source_position,
7431 "arithmetic with pointer to function type '%T' not allowed",
7434 } else if (warning.pointer_arith) {
7435 warningf(source_position,
7436 "pointer to a function '%T' used in arithmetic",
7443 static bool is_lvalue(const expression_t *expression)
7445 switch (expression->kind) {
7446 case EXPR_REFERENCE:
7447 case EXPR_ARRAY_ACCESS:
7449 case EXPR_UNARY_DEREFERENCE:
7457 static void semantic_incdec(unary_expression_t *expression)
7459 type_t *const orig_type = expression->value->base.type;
7460 type_t *const type = skip_typeref(orig_type);
7461 if (is_type_pointer(type)) {
7462 if (!check_pointer_arithmetic(&expression->base.source_position,
7466 } else if (!is_type_real(type) && is_type_valid(type)) {
7467 /* TODO: improve error message */
7468 errorf(&expression->base.source_position,
7469 "operation needs an arithmetic or pointer type");
7472 if (!is_lvalue(expression->value)) {
7473 /* TODO: improve error message */
7474 errorf(&expression->base.source_position, "lvalue required as operand");
7476 expression->base.type = orig_type;
7479 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7481 type_t *const orig_type = expression->value->base.type;
7482 type_t *const type = skip_typeref(orig_type);
7483 if (!is_type_arithmetic(type)) {
7484 if (is_type_valid(type)) {
7485 /* TODO: improve error message */
7486 errorf(&expression->base.source_position,
7487 "operation needs an arithmetic type");
7492 expression->base.type = orig_type;
7495 static void semantic_unexpr_plus(unary_expression_t *expression)
7497 semantic_unexpr_arithmetic(expression);
7498 if (warning.traditional)
7499 warningf(&expression->base.source_position,
7500 "traditional C rejects the unary plus operator");
7503 static expression_t const *get_reference_address(expression_t const *expr)
7505 bool regular_take_address = true;
7507 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7508 expr = expr->unary.value;
7510 regular_take_address = false;
7513 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7516 expr = expr->unary.value;
7519 if (expr->kind != EXPR_REFERENCE)
7522 if (!regular_take_address &&
7523 !is_type_function(skip_typeref(expr->reference.declaration->type))) {
7530 static void warn_function_address_as_bool(expression_t const* expr)
7532 if (!warning.address)
7535 expr = get_reference_address(expr);
7537 warningf(&expr->base.source_position,
7538 "the address of '%Y' will always evaluate as 'true'",
7539 expr->reference.declaration->symbol);
7543 static void semantic_not(unary_expression_t *expression)
7545 type_t *const orig_type = expression->value->base.type;
7546 type_t *const type = skip_typeref(orig_type);
7547 if (!is_type_scalar(type) && is_type_valid(type)) {
7548 errorf(&expression->base.source_position,
7549 "operand of ! must be of scalar type");
7552 warn_function_address_as_bool(expression->value);
7554 expression->base.type = type_int;
7557 static void semantic_unexpr_integer(unary_expression_t *expression)
7559 type_t *const orig_type = expression->value->base.type;
7560 type_t *const type = skip_typeref(orig_type);
7561 if (!is_type_integer(type)) {
7562 if (is_type_valid(type)) {
7563 errorf(&expression->base.source_position,
7564 "operand of ~ must be of integer type");
7569 expression->base.type = orig_type;
7572 static void semantic_dereference(unary_expression_t *expression)
7574 type_t *const orig_type = expression->value->base.type;
7575 type_t *const type = skip_typeref(orig_type);
7576 if (!is_type_pointer(type)) {
7577 if (is_type_valid(type)) {
7578 errorf(&expression->base.source_position,
7579 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7584 type_t *result_type = type->pointer.points_to;
7585 result_type = automatic_type_conversion(result_type);
7586 expression->base.type = result_type;
7590 * Record that an address is taken (expression represents an lvalue).
7592 * @param expression the expression
7593 * @param may_be_register if true, the expression might be an register
7595 static void set_address_taken(expression_t *expression, bool may_be_register)
7597 if (expression->kind != EXPR_REFERENCE)
7600 declaration_t *const declaration = expression->reference.declaration;
7601 /* happens for parse errors */
7602 if (declaration == NULL)
7605 if (declaration->storage_class == STORAGE_CLASS_REGISTER && !may_be_register) {
7606 errorf(&expression->base.source_position,
7607 "address of register variable '%Y' requested",
7608 declaration->symbol);
7610 declaration->address_taken = 1;
7615 * Check the semantic of the address taken expression.
7617 static void semantic_take_addr(unary_expression_t *expression)
7619 expression_t *value = expression->value;
7620 value->base.type = revert_automatic_type_conversion(value);
7622 type_t *orig_type = value->base.type;
7623 if (!is_type_valid(orig_type))
7626 set_address_taken(value, false);
7628 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7631 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
7632 static expression_t *parse_##unexpression_type(unsigned precedence) \
7634 expression_t *unary_expression \
7635 = allocate_expression_zero(unexpression_type); \
7636 unary_expression->base.source_position = *HERE; \
7638 unary_expression->unary.value = parse_sub_expression(precedence); \
7640 sfunc(&unary_expression->unary); \
7642 return unary_expression; \
7645 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7646 semantic_unexpr_arithmetic)
7647 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7648 semantic_unexpr_plus)
7649 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7651 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7652 semantic_dereference)
7653 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7655 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7656 semantic_unexpr_integer)
7657 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7659 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7662 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
7664 static expression_t *parse_##unexpression_type(unsigned precedence, \
7665 expression_t *left) \
7667 (void) precedence; \
7669 expression_t *unary_expression \
7670 = allocate_expression_zero(unexpression_type); \
7671 unary_expression->base.source_position = *HERE; \
7673 unary_expression->unary.value = left; \
7675 sfunc(&unary_expression->unary); \
7677 return unary_expression; \
7680 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7681 EXPR_UNARY_POSTFIX_INCREMENT,
7683 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7684 EXPR_UNARY_POSTFIX_DECREMENT,
7687 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7689 /* TODO: handle complex + imaginary types */
7691 type_left = get_unqualified_type(type_left);
7692 type_right = get_unqualified_type(type_right);
7694 /* § 6.3.1.8 Usual arithmetic conversions */
7695 if (type_left == type_long_double || type_right == type_long_double) {
7696 return type_long_double;
7697 } else if (type_left == type_double || type_right == type_double) {
7699 } else if (type_left == type_float || type_right == type_float) {
7703 type_left = promote_integer(type_left);
7704 type_right = promote_integer(type_right);
7706 if (type_left == type_right)
7709 bool const signed_left = is_type_signed(type_left);
7710 bool const signed_right = is_type_signed(type_right);
7711 int const rank_left = get_rank(type_left);
7712 int const rank_right = get_rank(type_right);
7714 if (signed_left == signed_right)
7715 return rank_left >= rank_right ? type_left : type_right;
7724 u_rank = rank_right;
7725 u_type = type_right;
7727 s_rank = rank_right;
7728 s_type = type_right;
7733 if (u_rank >= s_rank)
7736 /* casting rank to atomic_type_kind is a bit hacky, but makes things
7738 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
7739 > get_atomic_type_size((atomic_type_kind_t) u_rank))
7743 case ATOMIC_TYPE_INT: return type_unsigned_int;
7744 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7745 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7747 default: panic("invalid atomic type");
7752 * Check the semantic restrictions for a binary expression.
7754 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7756 expression_t *const left = expression->left;
7757 expression_t *const right = expression->right;
7758 type_t *const orig_type_left = left->base.type;
7759 type_t *const orig_type_right = right->base.type;
7760 type_t *const type_left = skip_typeref(orig_type_left);
7761 type_t *const type_right = skip_typeref(orig_type_right);
7763 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7764 /* TODO: improve error message */
7765 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7766 errorf(&expression->base.source_position,
7767 "operation needs arithmetic types");
7772 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7773 expression->left = create_implicit_cast(left, arithmetic_type);
7774 expression->right = create_implicit_cast(right, arithmetic_type);
7775 expression->base.type = arithmetic_type;
7778 static void warn_div_by_zero(binary_expression_t const *const expression)
7780 if (!warning.div_by_zero ||
7781 !is_type_integer(expression->base.type))
7784 expression_t const *const right = expression->right;
7785 /* The type of the right operand can be different for /= */
7786 if (is_type_integer(right->base.type) &&
7787 is_constant_expression(right) &&
7788 fold_constant(right) == 0) {
7789 warningf(&expression->base.source_position, "division by zero");
7794 * Check the semantic restrictions for a div/mod expression.
7796 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
7797 semantic_binexpr_arithmetic(expression);
7798 warn_div_by_zero(expression);
7801 static void semantic_shift_op(binary_expression_t *expression)
7803 expression_t *const left = expression->left;
7804 expression_t *const right = expression->right;
7805 type_t *const orig_type_left = left->base.type;
7806 type_t *const orig_type_right = right->base.type;
7807 type_t * type_left = skip_typeref(orig_type_left);
7808 type_t * type_right = skip_typeref(orig_type_right);
7810 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7811 /* TODO: improve error message */
7812 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7813 errorf(&expression->base.source_position,
7814 "operands of shift operation must have integer types");
7819 type_left = promote_integer(type_left);
7820 type_right = promote_integer(type_right);
7822 expression->left = create_implicit_cast(left, type_left);
7823 expression->right = create_implicit_cast(right, type_right);
7824 expression->base.type = type_left;
7827 static void semantic_add(binary_expression_t *expression)
7829 expression_t *const left = expression->left;
7830 expression_t *const right = expression->right;
7831 type_t *const orig_type_left = left->base.type;
7832 type_t *const orig_type_right = right->base.type;
7833 type_t *const type_left = skip_typeref(orig_type_left);
7834 type_t *const type_right = skip_typeref(orig_type_right);
7837 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7838 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7839 expression->left = create_implicit_cast(left, arithmetic_type);
7840 expression->right = create_implicit_cast(right, arithmetic_type);
7841 expression->base.type = arithmetic_type;
7843 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7844 check_pointer_arithmetic(&expression->base.source_position,
7845 type_left, orig_type_left);
7846 expression->base.type = type_left;
7847 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7848 check_pointer_arithmetic(&expression->base.source_position,
7849 type_right, orig_type_right);
7850 expression->base.type = type_right;
7851 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7852 errorf(&expression->base.source_position,
7853 "invalid operands to binary + ('%T', '%T')",
7854 orig_type_left, orig_type_right);
7858 static void semantic_sub(binary_expression_t *expression)
7860 expression_t *const left = expression->left;
7861 expression_t *const right = expression->right;
7862 type_t *const orig_type_left = left->base.type;
7863 type_t *const orig_type_right = right->base.type;
7864 type_t *const type_left = skip_typeref(orig_type_left);
7865 type_t *const type_right = skip_typeref(orig_type_right);
7866 source_position_t const *const pos = &expression->base.source_position;
7869 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7870 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7871 expression->left = create_implicit_cast(left, arithmetic_type);
7872 expression->right = create_implicit_cast(right, arithmetic_type);
7873 expression->base.type = arithmetic_type;
7875 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7876 check_pointer_arithmetic(&expression->base.source_position,
7877 type_left, orig_type_left);
7878 expression->base.type = type_left;
7879 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7880 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7881 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7882 if (!types_compatible(unqual_left, unqual_right)) {
7884 "subtracting pointers to incompatible types '%T' and '%T'",
7885 orig_type_left, orig_type_right);
7886 } else if (!is_type_object(unqual_left)) {
7887 if (is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
7888 warningf(pos, "subtracting pointers to void");
7890 errorf(pos, "subtracting pointers to non-object types '%T'",
7894 expression->base.type = type_ptrdiff_t;
7895 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7896 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7897 orig_type_left, orig_type_right);
7901 static void warn_string_literal_address(expression_t const* expr)
7903 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7904 expr = expr->unary.value;
7905 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7907 expr = expr->unary.value;
7910 if (expr->kind == EXPR_STRING_LITERAL ||
7911 expr->kind == EXPR_WIDE_STRING_LITERAL) {
7912 warningf(&expr->base.source_position,
7913 "comparison with string literal results in unspecified behaviour");
7918 * Check the semantics of comparison expressions.
7920 * @param expression The expression to check.
7922 static void semantic_comparison(binary_expression_t *expression)
7924 expression_t *left = expression->left;
7925 expression_t *right = expression->right;
7927 if (warning.address) {
7928 warn_string_literal_address(left);
7929 warn_string_literal_address(right);
7931 expression_t const* const func_left = get_reference_address(left);
7932 if (func_left != NULL && is_null_pointer_constant(right)) {
7933 warningf(&expression->base.source_position,
7934 "the address of '%Y' will never be NULL",
7935 func_left->reference.declaration->symbol);
7938 expression_t const* const func_right = get_reference_address(right);
7939 if (func_right != NULL && is_null_pointer_constant(right)) {
7940 warningf(&expression->base.source_position,
7941 "the address of '%Y' will never be NULL",
7942 func_right->reference.declaration->symbol);
7946 type_t *orig_type_left = left->base.type;
7947 type_t *orig_type_right = right->base.type;
7948 type_t *type_left = skip_typeref(orig_type_left);
7949 type_t *type_right = skip_typeref(orig_type_right);
7951 /* TODO non-arithmetic types */
7952 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7953 /* test for signed vs unsigned compares */
7954 if (warning.sign_compare &&
7955 (expression->base.kind != EXPR_BINARY_EQUAL &&
7956 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
7957 (is_type_signed(type_left) != is_type_signed(type_right))) {
7959 /* check if 1 of the operands is a constant, in this case we just
7960 * check wether we can safely represent the resulting constant in
7961 * the type of the other operand. */
7962 expression_t *const_expr = NULL;
7963 expression_t *other_expr = NULL;
7965 if (is_constant_expression(left)) {
7968 } else if (is_constant_expression(right)) {
7973 if (const_expr != NULL) {
7974 type_t *other_type = skip_typeref(other_expr->base.type);
7975 long val = fold_constant(const_expr);
7976 /* TODO: check if val can be represented by other_type */
7980 warningf(&expression->base.source_position,
7981 "comparison between signed and unsigned");
7983 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7984 expression->left = create_implicit_cast(left, arithmetic_type);
7985 expression->right = create_implicit_cast(right, arithmetic_type);
7986 expression->base.type = arithmetic_type;
7987 if (warning.float_equal &&
7988 (expression->base.kind == EXPR_BINARY_EQUAL ||
7989 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
7990 is_type_float(arithmetic_type)) {
7991 warningf(&expression->base.source_position,
7992 "comparing floating point with == or != is unsafe");
7994 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7995 /* TODO check compatibility */
7996 } else if (is_type_pointer(type_left)) {
7997 expression->right = create_implicit_cast(right, type_left);
7998 } else if (is_type_pointer(type_right)) {
7999 expression->left = create_implicit_cast(left, type_right);
8000 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8001 type_error_incompatible("invalid operands in comparison",
8002 &expression->base.source_position,
8003 type_left, type_right);
8005 expression->base.type = type_int;
8009 * Checks if a compound type has constant fields.
8011 static bool has_const_fields(const compound_type_t *type)
8013 const scope_t *scope = &type->declaration->scope;
8014 const declaration_t *declaration = scope->declarations;
8016 for (; declaration != NULL; declaration = declaration->next) {
8017 if (declaration->namespc != NAMESPACE_NORMAL)
8020 const type_t *decl_type = skip_typeref(declaration->type);
8021 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8028 static bool is_valid_assignment_lhs(expression_t const* const left)
8030 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8031 type_t *const type_left = skip_typeref(orig_type_left);
8033 if (!is_lvalue(left)) {
8034 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8039 if (is_type_array(type_left)) {
8040 errorf(HERE, "cannot assign to arrays ('%E')", left);
8043 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8044 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8048 if (is_type_incomplete(type_left)) {
8049 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8050 left, orig_type_left);
8053 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8054 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8055 left, orig_type_left);
8062 static void semantic_arithmetic_assign(binary_expression_t *expression)
8064 expression_t *left = expression->left;
8065 expression_t *right = expression->right;
8066 type_t *orig_type_left = left->base.type;
8067 type_t *orig_type_right = right->base.type;
8069 if (!is_valid_assignment_lhs(left))
8072 type_t *type_left = skip_typeref(orig_type_left);
8073 type_t *type_right = skip_typeref(orig_type_right);
8075 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8076 /* TODO: improve error message */
8077 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8078 errorf(&expression->base.source_position,
8079 "operation needs arithmetic types");
8084 /* combined instructions are tricky. We can't create an implicit cast on
8085 * the left side, because we need the uncasted form for the store.
8086 * The ast2firm pass has to know that left_type must be right_type
8087 * for the arithmetic operation and create a cast by itself */
8088 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8089 expression->right = create_implicit_cast(right, arithmetic_type);
8090 expression->base.type = type_left;
8093 static void semantic_divmod_assign(binary_expression_t *expression)
8095 semantic_arithmetic_assign(expression);
8096 warn_div_by_zero(expression);
8099 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8101 expression_t *const left = expression->left;
8102 expression_t *const right = expression->right;
8103 type_t *const orig_type_left = left->base.type;
8104 type_t *const orig_type_right = right->base.type;
8105 type_t *const type_left = skip_typeref(orig_type_left);
8106 type_t *const type_right = skip_typeref(orig_type_right);
8108 if (!is_valid_assignment_lhs(left))
8111 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8112 /* combined instructions are tricky. We can't create an implicit cast on
8113 * the left side, because we need the uncasted form for the store.
8114 * The ast2firm pass has to know that left_type must be right_type
8115 * for the arithmetic operation and create a cast by itself */
8116 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8117 expression->right = create_implicit_cast(right, arithmetic_type);
8118 expression->base.type = type_left;
8119 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8120 check_pointer_arithmetic(&expression->base.source_position,
8121 type_left, orig_type_left);
8122 expression->base.type = type_left;
8123 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8124 errorf(&expression->base.source_position,
8125 "incompatible types '%T' and '%T' in assignment",
8126 orig_type_left, orig_type_right);
8131 * Check the semantic restrictions of a logical expression.
8133 static void semantic_logical_op(binary_expression_t *expression)
8135 expression_t *const left = expression->left;
8136 expression_t *const right = expression->right;
8137 type_t *const orig_type_left = left->base.type;
8138 type_t *const orig_type_right = right->base.type;
8139 type_t *const type_left = skip_typeref(orig_type_left);
8140 type_t *const type_right = skip_typeref(orig_type_right);
8142 warn_function_address_as_bool(left);
8143 warn_function_address_as_bool(right);
8145 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
8146 /* TODO: improve error message */
8147 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8148 errorf(&expression->base.source_position,
8149 "operation needs scalar types");
8154 expression->base.type = type_int;
8158 * Check the semantic restrictions of a binary assign expression.
8160 static void semantic_binexpr_assign(binary_expression_t *expression)
8162 expression_t *left = expression->left;
8163 type_t *orig_type_left = left->base.type;
8165 if (!is_valid_assignment_lhs(left))
8168 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8169 report_assign_error(error, orig_type_left, expression->right,
8170 "assignment", &left->base.source_position);
8171 expression->right = create_implicit_cast(expression->right, orig_type_left);
8172 expression->base.type = orig_type_left;
8176 * Determine if the outermost operation (or parts thereof) of the given
8177 * expression has no effect in order to generate a warning about this fact.
8178 * Therefore in some cases this only examines some of the operands of the
8179 * expression (see comments in the function and examples below).
8181 * f() + 23; // warning, because + has no effect
8182 * x || f(); // no warning, because x controls execution of f()
8183 * x ? y : f(); // warning, because y has no effect
8184 * (void)x; // no warning to be able to suppress the warning
8185 * This function can NOT be used for an "expression has definitely no effect"-
8187 static bool expression_has_effect(const expression_t *const expr)
8189 switch (expr->kind) {
8190 case EXPR_UNKNOWN: break;
8191 case EXPR_INVALID: return true; /* do NOT warn */
8192 case EXPR_REFERENCE: return false;
8193 /* suppress the warning for microsoft __noop operations */
8194 case EXPR_CONST: return expr->conste.is_ms_noop;
8195 case EXPR_CHARACTER_CONSTANT: return false;
8196 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8197 case EXPR_STRING_LITERAL: return false;
8198 case EXPR_WIDE_STRING_LITERAL: return false;
8199 case EXPR_LABEL_ADDRESS: return false;
8202 const call_expression_t *const call = &expr->call;
8203 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
8206 switch (call->function->builtin_symbol.symbol->ID) {
8207 case T___builtin_va_end: return true;
8208 default: return false;
8212 /* Generate the warning if either the left or right hand side of a
8213 * conditional expression has no effect */
8214 case EXPR_CONDITIONAL: {
8215 const conditional_expression_t *const cond = &expr->conditional;
8217 expression_has_effect(cond->true_expression) &&
8218 expression_has_effect(cond->false_expression);
8221 case EXPR_SELECT: return false;
8222 case EXPR_ARRAY_ACCESS: return false;
8223 case EXPR_SIZEOF: return false;
8224 case EXPR_CLASSIFY_TYPE: return false;
8225 case EXPR_ALIGNOF: return false;
8227 case EXPR_FUNCNAME: return false;
8228 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
8229 case EXPR_BUILTIN_CONSTANT_P: return false;
8230 case EXPR_BUILTIN_PREFETCH: return true;
8231 case EXPR_OFFSETOF: return false;
8232 case EXPR_VA_START: return true;
8233 case EXPR_VA_ARG: return true;
8234 case EXPR_STATEMENT: return true; // TODO
8235 case EXPR_COMPOUND_LITERAL: return false;
8237 case EXPR_UNARY_NEGATE: return false;
8238 case EXPR_UNARY_PLUS: return false;
8239 case EXPR_UNARY_BITWISE_NEGATE: return false;
8240 case EXPR_UNARY_NOT: return false;
8241 case EXPR_UNARY_DEREFERENCE: return false;
8242 case EXPR_UNARY_TAKE_ADDRESS: return false;
8243 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8244 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8245 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8246 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8248 /* Treat void casts as if they have an effect in order to being able to
8249 * suppress the warning */
8250 case EXPR_UNARY_CAST: {
8251 type_t *const type = skip_typeref(expr->base.type);
8252 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8255 case EXPR_UNARY_CAST_IMPLICIT: return true;
8256 case EXPR_UNARY_ASSUME: return true;
8258 case EXPR_BINARY_ADD: return false;
8259 case EXPR_BINARY_SUB: return false;
8260 case EXPR_BINARY_MUL: return false;
8261 case EXPR_BINARY_DIV: return false;
8262 case EXPR_BINARY_MOD: return false;
8263 case EXPR_BINARY_EQUAL: return false;
8264 case EXPR_BINARY_NOTEQUAL: return false;
8265 case EXPR_BINARY_LESS: return false;
8266 case EXPR_BINARY_LESSEQUAL: return false;
8267 case EXPR_BINARY_GREATER: return false;
8268 case EXPR_BINARY_GREATEREQUAL: return false;
8269 case EXPR_BINARY_BITWISE_AND: return false;
8270 case EXPR_BINARY_BITWISE_OR: return false;
8271 case EXPR_BINARY_BITWISE_XOR: return false;
8272 case EXPR_BINARY_SHIFTLEFT: return false;
8273 case EXPR_BINARY_SHIFTRIGHT: return false;
8274 case EXPR_BINARY_ASSIGN: return true;
8275 case EXPR_BINARY_MUL_ASSIGN: return true;
8276 case EXPR_BINARY_DIV_ASSIGN: return true;
8277 case EXPR_BINARY_MOD_ASSIGN: return true;
8278 case EXPR_BINARY_ADD_ASSIGN: return true;
8279 case EXPR_BINARY_SUB_ASSIGN: return true;
8280 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8281 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8282 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8283 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8284 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8286 /* Only examine the right hand side of && and ||, because the left hand
8287 * side already has the effect of controlling the execution of the right
8289 case EXPR_BINARY_LOGICAL_AND:
8290 case EXPR_BINARY_LOGICAL_OR:
8291 /* Only examine the right hand side of a comma expression, because the left
8292 * hand side has a separate warning */
8293 case EXPR_BINARY_COMMA:
8294 return expression_has_effect(expr->binary.right);
8296 case EXPR_BINARY_BUILTIN_EXPECT: return true;
8297 case EXPR_BINARY_ISGREATER: return false;
8298 case EXPR_BINARY_ISGREATEREQUAL: return false;
8299 case EXPR_BINARY_ISLESS: return false;
8300 case EXPR_BINARY_ISLESSEQUAL: return false;
8301 case EXPR_BINARY_ISLESSGREATER: return false;
8302 case EXPR_BINARY_ISUNORDERED: return false;
8305 internal_errorf(HERE, "unexpected expression");
8308 static void semantic_comma(binary_expression_t *expression)
8310 if (warning.unused_value) {
8311 const expression_t *const left = expression->left;
8312 if (!expression_has_effect(left)) {
8313 warningf(&left->base.source_position,
8314 "left-hand operand of comma expression has no effect");
8317 expression->base.type = expression->right->base.type;
8320 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
8321 static expression_t *parse_##binexpression_type(unsigned precedence, \
8322 expression_t *left) \
8324 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8325 binexpr->base.source_position = *HERE; \
8326 binexpr->binary.left = left; \
8329 expression_t *right = parse_sub_expression(precedence + lr); \
8331 binexpr->binary.right = right; \
8332 sfunc(&binexpr->binary); \
8337 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
8338 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
8339 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_divmod_arithmetic, 1)
8340 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_divmod_arithmetic, 1)
8341 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
8342 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
8343 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
8344 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
8345 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
8347 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
8348 semantic_comparison, 1)
8349 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
8350 semantic_comparison, 1)
8351 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
8352 semantic_comparison, 1)
8353 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
8354 semantic_comparison, 1)
8356 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
8357 semantic_binexpr_arithmetic, 1)
8358 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
8359 semantic_binexpr_arithmetic, 1)
8360 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
8361 semantic_binexpr_arithmetic, 1)
8362 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
8363 semantic_logical_op, 1)
8364 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
8365 semantic_logical_op, 1)
8366 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
8367 semantic_shift_op, 1)
8368 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
8369 semantic_shift_op, 1)
8370 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
8371 semantic_arithmetic_addsubb_assign, 0)
8372 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
8373 semantic_arithmetic_addsubb_assign, 0)
8374 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
8375 semantic_arithmetic_assign, 0)
8376 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
8377 semantic_divmod_assign, 0)
8378 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
8379 semantic_divmod_assign, 0)
8380 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
8381 semantic_arithmetic_assign, 0)
8382 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8383 semantic_arithmetic_assign, 0)
8384 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
8385 semantic_arithmetic_assign, 0)
8386 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
8387 semantic_arithmetic_assign, 0)
8388 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
8389 semantic_arithmetic_assign, 0)
8391 static expression_t *parse_sub_expression(unsigned precedence)
8393 if (token.type < 0) {
8394 return expected_expression_error();
8397 expression_parser_function_t *parser
8398 = &expression_parsers[token.type];
8399 source_position_t source_position = token.source_position;
8402 if (parser->parser != NULL) {
8403 left = parser->parser(parser->precedence);
8405 left = parse_primary_expression();
8407 assert(left != NULL);
8408 left->base.source_position = source_position;
8411 if (token.type < 0) {
8412 return expected_expression_error();
8415 parser = &expression_parsers[token.type];
8416 if (parser->infix_parser == NULL)
8418 if (parser->infix_precedence < precedence)
8421 left = parser->infix_parser(parser->infix_precedence, left);
8423 assert(left != NULL);
8424 assert(left->kind != EXPR_UNKNOWN);
8425 left->base.source_position = source_position;
8432 * Parse an expression.
8434 static expression_t *parse_expression(void)
8436 return parse_sub_expression(1);
8440 * Register a parser for a prefix-like operator with given precedence.
8442 * @param parser the parser function
8443 * @param token_type the token type of the prefix token
8444 * @param precedence the precedence of the operator
8446 static void register_expression_parser(parse_expression_function parser,
8447 int token_type, unsigned precedence)
8449 expression_parser_function_t *entry = &expression_parsers[token_type];
8451 if (entry->parser != NULL) {
8452 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8453 panic("trying to register multiple expression parsers for a token");
8455 entry->parser = parser;
8456 entry->precedence = precedence;
8460 * Register a parser for an infix operator with given precedence.
8462 * @param parser the parser function
8463 * @param token_type the token type of the infix operator
8464 * @param precedence the precedence of the operator
8466 static void register_infix_parser(parse_expression_infix_function parser,
8467 int token_type, unsigned precedence)
8469 expression_parser_function_t *entry = &expression_parsers[token_type];
8471 if (entry->infix_parser != NULL) {
8472 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8473 panic("trying to register multiple infix expression parsers for a "
8476 entry->infix_parser = parser;
8477 entry->infix_precedence = precedence;
8481 * Initialize the expression parsers.
8483 static void init_expression_parsers(void)
8485 memset(&expression_parsers, 0, sizeof(expression_parsers));
8487 register_infix_parser(parse_array_expression, '[', 30);
8488 register_infix_parser(parse_call_expression, '(', 30);
8489 register_infix_parser(parse_select_expression, '.', 30);
8490 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
8491 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
8493 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
8496 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 17);
8497 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 17);
8498 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 17);
8499 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 16);
8500 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 16);
8501 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 15);
8502 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 15);
8503 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
8504 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
8505 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
8506 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
8507 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
8508 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
8509 T_EXCLAMATIONMARKEQUAL, 13);
8510 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
8511 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
8512 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
8513 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
8514 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
8515 register_infix_parser(parse_conditional_expression, '?', 7);
8516 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
8517 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
8518 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
8519 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
8520 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
8521 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
8522 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
8523 T_LESSLESSEQUAL, 2);
8524 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8525 T_GREATERGREATEREQUAL, 2);
8526 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
8528 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
8530 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
8533 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
8535 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
8536 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
8537 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
8538 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
8539 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
8540 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
8541 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
8543 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
8545 register_expression_parser(parse_sizeof, T_sizeof, 25);
8546 register_expression_parser(parse_alignof, T___alignof__, 25);
8547 register_expression_parser(parse_extension, T___extension__, 25);
8548 register_expression_parser(parse_builtin_classify_type,
8549 T___builtin_classify_type, 25);
8553 * Parse a asm statement arguments specification.
8555 static asm_argument_t *parse_asm_arguments(bool is_out)
8557 asm_argument_t *result = NULL;
8558 asm_argument_t *last = NULL;
8560 while (token.type == T_STRING_LITERAL || token.type == '[') {
8561 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8562 memset(argument, 0, sizeof(argument[0]));
8564 if (token.type == '[') {
8566 if (token.type != T_IDENTIFIER) {
8567 parse_error_expected("while parsing asm argument",
8568 T_IDENTIFIER, NULL);
8571 argument->symbol = token.v.symbol;
8576 argument->constraints = parse_string_literals();
8578 add_anchor_token(')');
8579 expression_t *expression = parse_expression();
8580 rem_anchor_token(')');
8582 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8583 * change size or type representation (e.g. int -> long is ok, but
8584 * int -> float is not) */
8585 if (expression->kind == EXPR_UNARY_CAST) {
8586 type_t *const type = expression->base.type;
8587 type_kind_t const kind = type->kind;
8588 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8591 if (kind == TYPE_ATOMIC) {
8592 atomic_type_kind_t const akind = type->atomic.akind;
8593 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8594 size = get_atomic_type_size(akind);
8596 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8597 size = get_atomic_type_size(get_intptr_kind());
8601 expression_t *const value = expression->unary.value;
8602 type_t *const value_type = value->base.type;
8603 type_kind_t const value_kind = value_type->kind;
8605 unsigned value_flags;
8606 unsigned value_size;
8607 if (value_kind == TYPE_ATOMIC) {
8608 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8609 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8610 value_size = get_atomic_type_size(value_akind);
8611 } else if (value_kind == TYPE_POINTER) {
8612 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8613 value_size = get_atomic_type_size(get_intptr_kind());
8618 if (value_flags != flags || value_size != size)
8622 } while (expression->kind == EXPR_UNARY_CAST);
8626 if (!is_lvalue(expression)) {
8627 errorf(&expression->base.source_position,
8628 "asm output argument is not an lvalue");
8631 argument->expression = expression;
8634 set_address_taken(expression, true);
8637 last->next = argument;
8643 if (token.type != ',')
8654 * Parse a asm statement clobber specification.
8656 static asm_clobber_t *parse_asm_clobbers(void)
8658 asm_clobber_t *result = NULL;
8659 asm_clobber_t *last = NULL;
8661 while(token.type == T_STRING_LITERAL) {
8662 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8663 clobber->clobber = parse_string_literals();
8666 last->next = clobber;
8672 if (token.type != ',')
8681 * Parse an asm statement.
8683 static statement_t *parse_asm_statement(void)
8687 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8688 statement->base.source_position = token.source_position;
8690 asm_statement_t *asm_statement = &statement->asms;
8692 if (token.type == T_volatile) {
8694 asm_statement->is_volatile = true;
8698 add_anchor_token(')');
8699 add_anchor_token(':');
8700 asm_statement->asm_text = parse_string_literals();
8702 if (token.type != ':') {
8703 rem_anchor_token(':');
8708 asm_statement->outputs = parse_asm_arguments(true);
8709 if (token.type != ':') {
8710 rem_anchor_token(':');
8715 asm_statement->inputs = parse_asm_arguments(false);
8716 if (token.type != ':') {
8717 rem_anchor_token(':');
8720 rem_anchor_token(':');
8723 asm_statement->clobbers = parse_asm_clobbers();
8726 rem_anchor_token(')');
8730 if (asm_statement->outputs == NULL) {
8731 /* GCC: An 'asm' instruction without any output operands will be treated
8732 * identically to a volatile 'asm' instruction. */
8733 asm_statement->is_volatile = true;
8738 return create_invalid_statement();
8742 * Parse a case statement.
8744 static statement_t *parse_case_statement(void)
8748 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8749 source_position_t *const pos = &statement->base.source_position;
8751 *pos = token.source_position;
8752 expression_t *const expression = parse_expression();
8753 statement->case_label.expression = expression;
8754 if (!is_constant_expression(expression)) {
8755 /* This check does not prevent the error message in all cases of an
8756 * prior error while parsing the expression. At least it catches the
8757 * common case of a mistyped enum entry. */
8758 if (is_type_valid(expression->base.type)) {
8759 errorf(pos, "case label does not reduce to an integer constant");
8761 statement->case_label.is_bad = true;
8763 long const val = fold_constant(expression);
8764 statement->case_label.first_case = val;
8765 statement->case_label.last_case = val;
8769 if (token.type == T_DOTDOTDOT) {
8771 expression_t *const end_range = parse_expression();
8772 statement->case_label.end_range = end_range;
8773 if (!is_constant_expression(end_range)) {
8774 /* This check does not prevent the error message in all cases of an
8775 * prior error while parsing the expression. At least it catches the
8776 * common case of a mistyped enum entry. */
8777 if (is_type_valid(end_range->base.type)) {
8778 errorf(pos, "case range does not reduce to an integer constant");
8780 statement->case_label.is_bad = true;
8782 long const val = fold_constant(end_range);
8783 statement->case_label.last_case = val;
8785 if (val < statement->case_label.first_case) {
8786 statement->case_label.is_empty_range = true;
8787 warningf(pos, "empty range specified");
8793 PUSH_PARENT(statement);
8797 if (current_switch != NULL) {
8798 if (! statement->case_label.is_bad) {
8799 /* Check for duplicate case values */
8800 case_label_statement_t *c = &statement->case_label;
8801 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8802 if (l->is_bad || l->is_empty_range || l->expression == NULL)
8805 if (c->last_case < l->first_case || c->first_case > l->last_case)
8808 errorf(pos, "duplicate case value (previously used %P)",
8809 &l->base.source_position);
8813 /* link all cases into the switch statement */
8814 if (current_switch->last_case == NULL) {
8815 current_switch->first_case = &statement->case_label;
8817 current_switch->last_case->next = &statement->case_label;
8819 current_switch->last_case = &statement->case_label;
8821 errorf(pos, "case label not within a switch statement");
8824 statement_t *const inner_stmt = parse_statement();
8825 statement->case_label.statement = inner_stmt;
8826 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8827 errorf(&inner_stmt->base.source_position, "declaration after case label");
8834 return create_invalid_statement();
8838 * Parse a default statement.
8840 static statement_t *parse_default_statement(void)
8844 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8845 statement->base.source_position = token.source_position;
8847 PUSH_PARENT(statement);
8850 if (current_switch != NULL) {
8851 const case_label_statement_t *def_label = current_switch->default_label;
8852 if (def_label != NULL) {
8853 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
8854 &def_label->base.source_position);
8856 current_switch->default_label = &statement->case_label;
8858 /* link all cases into the switch statement */
8859 if (current_switch->last_case == NULL) {
8860 current_switch->first_case = &statement->case_label;
8862 current_switch->last_case->next = &statement->case_label;
8864 current_switch->last_case = &statement->case_label;
8867 errorf(&statement->base.source_position,
8868 "'default' label not within a switch statement");
8871 statement_t *const inner_stmt = parse_statement();
8872 statement->case_label.statement = inner_stmt;
8873 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8874 errorf(&inner_stmt->base.source_position, "declaration after default label");
8881 return create_invalid_statement();
8885 * Parse a label statement.
8887 static statement_t *parse_label_statement(void)
8889 assert(token.type == T_IDENTIFIER);
8890 symbol_t *symbol = token.v.symbol;
8893 declaration_t *label = get_label(symbol);
8895 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8896 statement->base.source_position = token.source_position;
8897 statement->label.label = label;
8899 PUSH_PARENT(statement);
8901 /* if statement is already set then the label is defined twice,
8902 * otherwise it was just mentioned in a goto/local label declaration so far */
8903 if (label->init.statement != NULL) {
8904 errorf(HERE, "duplicate label '%Y' (declared %P)",
8905 symbol, &label->source_position);
8907 label->source_position = token.source_position;
8908 label->init.statement = statement;
8913 if (token.type == '}') {
8914 /* TODO only warn? */
8916 warningf(HERE, "label at end of compound statement");
8917 statement->label.statement = create_empty_statement();
8919 errorf(HERE, "label at end of compound statement");
8920 statement->label.statement = create_invalid_statement();
8922 } else if (token.type == ';') {
8923 /* Eat an empty statement here, to avoid the warning about an empty
8924 * statement after a label. label:; is commonly used to have a label
8925 * before a closing brace. */
8926 statement->label.statement = create_empty_statement();
8929 statement_t *const inner_stmt = parse_statement();
8930 statement->label.statement = inner_stmt;
8931 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8932 errorf(&inner_stmt->base.source_position, "declaration after label");
8936 /* remember the labels in a list for later checking */
8937 if (label_last == NULL) {
8938 label_first = &statement->label;
8940 label_last->next = &statement->label;
8942 label_last = &statement->label;
8949 * Parse an if statement.
8951 static statement_t *parse_if(void)
8955 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
8956 statement->base.source_position = token.source_position;
8958 PUSH_PARENT(statement);
8961 add_anchor_token(')');
8962 statement->ifs.condition = parse_expression();
8963 rem_anchor_token(')');
8966 add_anchor_token(T_else);
8967 statement->ifs.true_statement = parse_statement();
8968 rem_anchor_token(T_else);
8970 if (token.type == T_else) {
8972 statement->ifs.false_statement = parse_statement();
8979 return create_invalid_statement();
8983 * Check that all enums are handled in a switch.
8985 * @param statement the switch statement to check
8987 static void check_enum_cases(const switch_statement_t *statement) {
8988 const type_t *type = skip_typeref(statement->expression->base.type);
8989 if (! is_type_enum(type))
8991 const enum_type_t *enumt = &type->enumt;
8993 /* if we have a default, no warnings */
8994 if (statement->default_label != NULL)
8997 /* FIXME: calculation of value should be done while parsing */
8998 const declaration_t *declaration;
8999 long last_value = -1;
9000 for (declaration = enumt->declaration->next;
9001 declaration != NULL && declaration->storage_class == STORAGE_CLASS_ENUM_ENTRY;
9002 declaration = declaration->next) {
9003 const expression_t *expression = declaration->init.enum_value;
9004 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
9006 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9007 if (l->expression == NULL)
9009 if (l->first_case <= value && value <= l->last_case) {
9015 warningf(&statement->base.source_position,
9016 "enumeration value '%Y' not handled in switch", declaration->symbol);
9023 * Parse a switch statement.
9025 static statement_t *parse_switch(void)
9029 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9030 statement->base.source_position = token.source_position;
9032 PUSH_PARENT(statement);
9035 add_anchor_token(')');
9036 expression_t *const expr = parse_expression();
9037 type_t * type = skip_typeref(expr->base.type);
9038 if (is_type_integer(type)) {
9039 type = promote_integer(type);
9040 if (warning.traditional) {
9041 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9042 warningf(&expr->base.source_position,
9043 "'%T' switch expression not converted to '%T' in ISO C",
9047 } else if (is_type_valid(type)) {
9048 errorf(&expr->base.source_position,
9049 "switch quantity is not an integer, but '%T'", type);
9050 type = type_error_type;
9052 statement->switchs.expression = create_implicit_cast(expr, type);
9054 rem_anchor_token(')');
9056 switch_statement_t *rem = current_switch;
9057 current_switch = &statement->switchs;
9058 statement->switchs.body = parse_statement();
9059 current_switch = rem;
9061 if (warning.switch_default &&
9062 statement->switchs.default_label == NULL) {
9063 warningf(&statement->base.source_position, "switch has no default case");
9065 if (warning.switch_enum)
9066 check_enum_cases(&statement->switchs);
9072 return create_invalid_statement();
9075 static statement_t *parse_loop_body(statement_t *const loop)
9077 statement_t *const rem = current_loop;
9078 current_loop = loop;
9080 statement_t *const body = parse_statement();
9087 * Parse a while statement.
9089 static statement_t *parse_while(void)
9093 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9094 statement->base.source_position = token.source_position;
9096 PUSH_PARENT(statement);
9099 add_anchor_token(')');
9100 statement->whiles.condition = parse_expression();
9101 rem_anchor_token(')');
9104 statement->whiles.body = parse_loop_body(statement);
9110 return create_invalid_statement();
9114 * Parse a do statement.
9116 static statement_t *parse_do(void)
9120 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9121 statement->base.source_position = token.source_position;
9123 PUSH_PARENT(statement)
9125 add_anchor_token(T_while);
9126 statement->do_while.body = parse_loop_body(statement);
9127 rem_anchor_token(T_while);
9131 add_anchor_token(')');
9132 statement->do_while.condition = parse_expression();
9133 rem_anchor_token(')');
9141 return create_invalid_statement();
9145 * Parse a for statement.
9147 static statement_t *parse_for(void)
9151 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9152 statement->base.source_position = token.source_position;
9154 PUSH_PARENT(statement);
9156 int top = environment_top();
9157 scope_t *last_scope = scope;
9158 set_scope(&statement->fors.scope);
9161 add_anchor_token(')');
9163 if (token.type != ';') {
9164 if (is_declaration_specifier(&token, false)) {
9165 parse_declaration(record_declaration);
9167 add_anchor_token(';');
9168 expression_t *const init = parse_expression();
9169 statement->fors.initialisation = init;
9170 if (warning.unused_value && !expression_has_effect(init)) {
9171 warningf(&init->base.source_position,
9172 "initialisation of 'for'-statement has no effect");
9174 rem_anchor_token(';');
9181 if (token.type != ';') {
9182 add_anchor_token(';');
9183 statement->fors.condition = parse_expression();
9184 rem_anchor_token(';');
9187 if (token.type != ')') {
9188 expression_t *const step = parse_expression();
9189 statement->fors.step = step;
9190 if (warning.unused_value && !expression_has_effect(step)) {
9191 warningf(&step->base.source_position,
9192 "step of 'for'-statement has no effect");
9195 rem_anchor_token(')');
9197 statement->fors.body = parse_loop_body(statement);
9199 assert(scope == &statement->fors.scope);
9200 set_scope(last_scope);
9201 environment_pop_to(top);
9208 rem_anchor_token(')');
9209 assert(scope == &statement->fors.scope);
9210 set_scope(last_scope);
9211 environment_pop_to(top);
9213 return create_invalid_statement();
9217 * Parse a goto statement.
9219 static statement_t *parse_goto(void)
9221 source_position_t source_position = token.source_position;
9224 statement_t *statement;
9225 if (GNU_MODE && token.type == '*') {
9227 expression_t *expression = parse_expression();
9229 /* Argh: although documentation say the expression must be of type void *,
9230 * gcc excepts anything that can be casted into void * without error */
9231 type_t *type = expression->base.type;
9233 if (type != type_error_type) {
9234 if (!is_type_pointer(type) && !is_type_integer(type)) {
9235 errorf(&source_position, "cannot convert to a pointer type");
9236 } else if (type != type_void_ptr) {
9237 warningf(&source_position,
9238 "type of computed goto expression should be 'void*' not '%T'", type);
9240 expression = create_implicit_cast(expression, type_void_ptr);
9243 statement = allocate_statement_zero(STATEMENT_GOTO);
9244 statement->base.source_position = source_position;
9245 statement->gotos.expression = expression;
9247 if (token.type != T_IDENTIFIER) {
9249 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9251 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9255 symbol_t *symbol = token.v.symbol;
9258 statement = allocate_statement_zero(STATEMENT_GOTO);
9259 statement->base.source_position = source_position;
9260 statement->gotos.label = get_label(symbol);
9263 /* remember the goto's in a list for later checking */
9264 if (goto_last == NULL) {
9265 goto_first = &statement->gotos;
9267 goto_last->next = &statement->gotos;
9269 goto_last = &statement->gotos;
9275 return create_invalid_statement();
9279 * Parse a continue statement.
9281 static statement_t *parse_continue(void)
9283 if (current_loop == NULL) {
9284 errorf(HERE, "continue statement not within loop");
9287 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9288 statement->base.source_position = token.source_position;
9298 * Parse a break statement.
9300 static statement_t *parse_break(void)
9302 if (current_switch == NULL && current_loop == NULL) {
9303 errorf(HERE, "break statement not within loop or switch");
9306 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9307 statement->base.source_position = token.source_position;
9317 * Parse a __leave statement.
9319 static statement_t *parse_leave_statement(void)
9321 if (current_try == NULL) {
9322 errorf(HERE, "__leave statement not within __try");
9325 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9326 statement->base.source_position = token.source_position;
9336 * Check if a given declaration represents a local variable.
9338 static bool is_local_var_declaration(const declaration_t *declaration)
9340 switch ((storage_class_tag_t) declaration->storage_class) {
9341 case STORAGE_CLASS_AUTO:
9342 case STORAGE_CLASS_REGISTER: {
9343 const type_t *type = skip_typeref(declaration->type);
9344 if (is_type_function(type)) {
9356 * Check if a given declaration represents a variable.
9358 static bool is_var_declaration(const declaration_t *declaration)
9360 if (declaration->storage_class == STORAGE_CLASS_TYPEDEF)
9363 const type_t *type = skip_typeref(declaration->type);
9364 return !is_type_function(type);
9368 * Check if a given expression represents a local variable.
9370 static bool is_local_variable(const expression_t *expression)
9372 if (expression->base.kind != EXPR_REFERENCE) {
9375 const declaration_t *declaration = expression->reference.declaration;
9376 return is_local_var_declaration(declaration);
9380 * Check if a given expression represents a local variable and
9381 * return its declaration then, else return NULL.
9383 declaration_t *expr_is_variable(const expression_t *expression)
9385 if (expression->base.kind != EXPR_REFERENCE) {
9388 declaration_t *declaration = expression->reference.declaration;
9389 if (is_var_declaration(declaration))
9395 * Parse a return statement.
9397 static statement_t *parse_return(void)
9399 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9400 statement->base.source_position = token.source_position;
9404 expression_t *return_value = NULL;
9405 if (token.type != ';') {
9406 return_value = parse_expression();
9409 const type_t *const func_type = current_function->type;
9410 assert(is_type_function(func_type));
9411 type_t *const return_type = skip_typeref(func_type->function.return_type);
9413 if (return_value != NULL) {
9414 type_t *return_value_type = skip_typeref(return_value->base.type);
9416 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)
9417 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9418 warningf(&statement->base.source_position,
9419 "'return' with a value, in function returning void");
9420 return_value = NULL;
9422 assign_error_t error = semantic_assign(return_type, return_value);
9423 report_assign_error(error, return_type, return_value, "'return'",
9424 &statement->base.source_position);
9425 return_value = create_implicit_cast(return_value, return_type);
9427 /* check for returning address of a local var */
9428 if (return_value != NULL &&
9429 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9430 const expression_t *expression = return_value->unary.value;
9431 if (is_local_variable(expression)) {
9432 warningf(&statement->base.source_position,
9433 "function returns address of local variable");
9437 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9438 warningf(&statement->base.source_position,
9439 "'return' without value, in function returning non-void");
9442 statement->returns.value = return_value;
9451 * Parse a declaration statement.
9453 static statement_t *parse_declaration_statement(void)
9455 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9457 statement->base.source_position = token.source_position;
9459 declaration_t *before = last_declaration;
9461 parse_external_declaration();
9463 parse_declaration(record_declaration);
9465 if (before == NULL) {
9466 statement->declaration.declarations_begin = scope->declarations;
9468 statement->declaration.declarations_begin = before->next;
9470 statement->declaration.declarations_end = last_declaration;
9476 * Parse an expression statement, ie. expr ';'.
9478 static statement_t *parse_expression_statement(void)
9480 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9482 statement->base.source_position = token.source_position;
9483 expression_t *const expr = parse_expression();
9484 statement->expression.expression = expr;
9493 * Parse a microsoft __try { } __finally { } or
9494 * __try{ } __except() { }
9496 static statement_t *parse_ms_try_statment(void)
9498 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9499 statement->base.source_position = token.source_position;
9502 PUSH_PARENT(statement);
9504 ms_try_statement_t *rem = current_try;
9505 current_try = &statement->ms_try;
9506 statement->ms_try.try_statement = parse_compound_statement(false);
9511 if (token.type == T___except) {
9514 add_anchor_token(')');
9515 expression_t *const expr = parse_expression();
9516 type_t * type = skip_typeref(expr->base.type);
9517 if (is_type_integer(type)) {
9518 type = promote_integer(type);
9519 } else if (is_type_valid(type)) {
9520 errorf(&expr->base.source_position,
9521 "__expect expression is not an integer, but '%T'", type);
9522 type = type_error_type;
9524 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9525 rem_anchor_token(')');
9527 statement->ms_try.final_statement = parse_compound_statement(false);
9528 } else if (token.type == T__finally) {
9530 statement->ms_try.final_statement = parse_compound_statement(false);
9532 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9533 return create_invalid_statement();
9537 return create_invalid_statement();
9540 static statement_t *parse_empty_statement(void)
9542 if (warning.empty_statement) {
9543 warningf(HERE, "statement is empty");
9545 statement_t *const statement = create_empty_statement();
9550 static statement_t *parse_local_label_declaration(void) {
9551 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9552 statement->base.source_position = token.source_position;
9556 declaration_t *begin = NULL, *end = NULL;
9559 if (token.type != T_IDENTIFIER) {
9560 parse_error_expected("while parsing local label declaration",
9561 T_IDENTIFIER, NULL);
9564 symbol_t *symbol = token.v.symbol;
9565 declaration_t *declaration = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
9566 if (declaration != NULL) {
9567 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition at %P)",
9568 symbol, &declaration->source_position);
9570 declaration = allocate_declaration_zero();
9571 declaration->namespc = NAMESPACE_LOCAL_LABEL;
9572 declaration->source_position = token.source_position;
9573 declaration->symbol = symbol;
9574 declaration->parent_scope = scope;
9575 declaration->init.statement = NULL;
9578 end->next = declaration;
9581 begin = declaration;
9583 local_label_push(declaration);
9587 if (token.type != ',')
9593 statement->declaration.declarations_begin = begin;
9594 statement->declaration.declarations_end = end;
9599 * Parse a statement.
9600 * There's also parse_statement() which additionally checks for
9601 * "statement has no effect" warnings
9603 static statement_t *intern_parse_statement(void)
9605 statement_t *statement = NULL;
9607 /* declaration or statement */
9608 add_anchor_token(';');
9609 switch (token.type) {
9610 case T_IDENTIFIER: {
9611 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
9612 if (la1_type == ':') {
9613 statement = parse_label_statement();
9614 } else if (is_typedef_symbol(token.v.symbol)) {
9615 statement = parse_declaration_statement();
9616 } else switch (la1_type) {
9618 if (get_declaration(token.v.symbol, NAMESPACE_NORMAL) != NULL)
9619 goto expression_statment;
9624 statement = parse_declaration_statement();
9628 expression_statment:
9629 statement = parse_expression_statement();
9635 case T___extension__:
9636 /* This can be a prefix to a declaration or an expression statement.
9637 * We simply eat it now and parse the rest with tail recursion. */
9640 } while (token.type == T___extension__);
9641 bool old_gcc_extension = in_gcc_extension;
9642 in_gcc_extension = true;
9643 statement = parse_statement();
9644 in_gcc_extension = old_gcc_extension;
9648 statement = parse_declaration_statement();
9652 statement = parse_local_label_declaration();
9655 case ';': statement = parse_empty_statement(); break;
9656 case '{': statement = parse_compound_statement(false); break;
9657 case T___leave: statement = parse_leave_statement(); break;
9658 case T___try: statement = parse_ms_try_statment(); break;
9659 case T_asm: statement = parse_asm_statement(); break;
9660 case T_break: statement = parse_break(); break;
9661 case T_case: statement = parse_case_statement(); break;
9662 case T_continue: statement = parse_continue(); break;
9663 case T_default: statement = parse_default_statement(); break;
9664 case T_do: statement = parse_do(); break;
9665 case T_for: statement = parse_for(); break;
9666 case T_goto: statement = parse_goto(); break;
9667 case T_if: statement = parse_if (); break;
9668 case T_return: statement = parse_return(); break;
9669 case T_switch: statement = parse_switch(); break;
9670 case T_while: statement = parse_while(); break;
9680 case T_CHARACTER_CONSTANT:
9681 case T_FLOATINGPOINT:
9685 case T_STRING_LITERAL:
9686 case T_WIDE_CHARACTER_CONSTANT:
9687 case T_WIDE_STRING_LITERAL:
9688 case T___FUNCDNAME__:
9690 case T___FUNCTION__:
9691 case T___PRETTY_FUNCTION__:
9692 case T___builtin_alloca:
9693 case T___builtin_classify_type:
9694 case T___builtin_constant_p:
9695 case T___builtin_expect:
9696 case T___builtin_huge_val:
9697 case T___builtin_isgreater:
9698 case T___builtin_isgreaterequal:
9699 case T___builtin_isless:
9700 case T___builtin_islessequal:
9701 case T___builtin_islessgreater:
9702 case T___builtin_isunordered:
9703 case T___builtin_nan:
9704 case T___builtin_nand:
9705 case T___builtin_nanf:
9706 case T___builtin_offsetof:
9707 case T___builtin_prefetch:
9708 case T___builtin_va_arg:
9709 case T___builtin_va_end:
9710 case T___builtin_va_start:
9714 statement = parse_expression_statement();
9718 errorf(HERE, "unexpected token %K while parsing statement", &token);
9719 statement = create_invalid_statement();
9724 rem_anchor_token(';');
9726 assert(statement != NULL
9727 && statement->base.source_position.input_name != NULL);
9733 * parse a statement and emits "statement has no effect" warning if needed
9734 * (This is really a wrapper around intern_parse_statement with check for 1
9735 * single warning. It is needed, because for statement expressions we have
9736 * to avoid the warning on the last statement)
9738 static statement_t *parse_statement(void)
9740 statement_t *statement = intern_parse_statement();
9742 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
9743 expression_t *expression = statement->expression.expression;
9744 if (!expression_has_effect(expression)) {
9745 warningf(&expression->base.source_position,
9746 "statement has no effect");
9754 * Parse a compound statement.
9756 static statement_t *parse_compound_statement(bool inside_expression_statement)
9758 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9759 statement->base.source_position = token.source_position;
9761 PUSH_PARENT(statement);
9764 add_anchor_token('}');
9766 int top = environment_top();
9767 int top_local = local_label_top();
9768 scope_t *last_scope = scope;
9769 set_scope(&statement->compound.scope);
9771 statement_t **anchor = &statement->compound.statements;
9772 bool only_decls_so_far = true;
9773 while (token.type != '}' && token.type != T_EOF) {
9774 statement_t *sub_statement = intern_parse_statement();
9775 if (is_invalid_statement(sub_statement)) {
9776 /* an error occurred. if we are at an anchor, return */
9782 if (warning.declaration_after_statement) {
9783 if (sub_statement->kind != STATEMENT_DECLARATION) {
9784 only_decls_so_far = false;
9785 } else if (!only_decls_so_far) {
9786 warningf(&sub_statement->base.source_position,
9787 "ISO C90 forbids mixed declarations and code");
9791 *anchor = sub_statement;
9793 while (sub_statement->base.next != NULL)
9794 sub_statement = sub_statement->base.next;
9796 anchor = &sub_statement->base.next;
9799 if (token.type == '}') {
9802 errorf(&statement->base.source_position,
9803 "end of file while looking for closing '}'");
9806 /* look over all statements again to produce no effect warnings */
9807 if (warning.unused_value) {
9808 statement_t *sub_statement = statement->compound.statements;
9809 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9810 if (sub_statement->kind != STATEMENT_EXPRESSION)
9812 /* don't emit a warning for the last expression in an expression
9813 * statement as it has always an effect */
9814 if (inside_expression_statement && sub_statement->base.next == NULL)
9817 expression_t *expression = sub_statement->expression.expression;
9818 if (!expression_has_effect(expression)) {
9819 warningf(&expression->base.source_position,
9820 "statement has no effect");
9826 rem_anchor_token('}');
9827 assert(scope == &statement->compound.scope);
9828 set_scope(last_scope);
9829 environment_pop_to(top);
9830 local_label_pop_to(top_local);
9837 * Initialize builtin types.
9839 static void initialize_builtin_types(void)
9841 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
9842 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
9843 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
9844 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
9845 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
9846 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
9847 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
9848 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
9850 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
9851 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
9852 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
9853 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
9855 /* const version of wchar_t */
9856 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
9857 type_const_wchar_t->typedeft.declaration = type_wchar_t->typedeft.declaration;
9858 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
9860 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
9864 * Check for unused global static functions and variables
9866 static void check_unused_globals(void)
9868 if (!warning.unused_function && !warning.unused_variable)
9871 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
9873 decl->modifiers & DM_UNUSED ||
9874 decl->modifiers & DM_USED ||
9875 decl->storage_class != STORAGE_CLASS_STATIC)
9878 type_t *const type = decl->type;
9880 if (is_type_function(skip_typeref(type))) {
9881 if (!warning.unused_function || decl->is_inline)
9884 s = (decl->init.statement != NULL ? "defined" : "declared");
9886 if (!warning.unused_variable)
9892 warningf(&decl->source_position, "'%#T' %s but not used",
9893 type, decl->symbol, s);
9897 static void parse_global_asm(void)
9902 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9903 statement->base.source_position = token.source_position;
9904 statement->asms.asm_text = parse_string_literals();
9905 statement->base.next = unit->global_asm;
9906 unit->global_asm = statement;
9915 * Parse a translation unit.
9917 static void parse_translation_unit(void)
9921 bool anchor_leak = false;
9922 for (int i = 0; i != T_LAST_TOKEN; ++i) {
9923 unsigned char count = token_anchor_set[i];
9925 errorf(HERE, "Leaked anchor token %k %d times", i, count);
9929 if (in_gcc_extension) {
9930 errorf(HERE, "Leaked __extension__");
9938 switch (token.type) {
9941 case T___extension__:
9942 parse_external_declaration();
9953 /* TODO error in strict mode */
9954 warningf(HERE, "stray ';' outside of function");
9959 errorf(HERE, "stray %K outside of function", &token);
9960 if (token.type == '(' || token.type == '{' || token.type == '[')
9961 eat_until_matching_token(token.type);
9971 * @return the translation unit or NULL if errors occurred.
9973 void start_parsing(void)
9975 environment_stack = NEW_ARR_F(stack_entry_t, 0);
9976 label_stack = NEW_ARR_F(stack_entry_t, 0);
9977 local_label_stack = NEW_ARR_F(stack_entry_t, 0);
9978 diagnostic_count = 0;
9982 type_set_output(stderr);
9983 ast_set_output(stderr);
9985 assert(unit == NULL);
9986 unit = allocate_ast_zero(sizeof(unit[0]));
9988 assert(global_scope == NULL);
9989 global_scope = &unit->scope;
9991 assert(scope == NULL);
9992 set_scope(&unit->scope);
9994 initialize_builtin_types();
9997 translation_unit_t *finish_parsing(void)
9999 assert(scope == &unit->scope);
10001 last_declaration = NULL;
10003 assert(global_scope == &unit->scope);
10004 check_unused_globals();
10005 global_scope = NULL;
10007 DEL_ARR_F(environment_stack);
10008 DEL_ARR_F(label_stack);
10009 DEL_ARR_F(local_label_stack);
10011 translation_unit_t *result = unit;
10018 lookahead_bufpos = 0;
10019 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10022 parse_translation_unit();
10026 * Initialize the parser.
10028 void init_parser(void)
10030 sym_anonymous = symbol_table_insert("<anonymous>");
10032 if (c_mode & _MS) {
10033 /* add predefined symbols for extended-decl-modifier */
10034 sym_align = symbol_table_insert("align");
10035 sym_allocate = symbol_table_insert("allocate");
10036 sym_dllimport = symbol_table_insert("dllimport");
10037 sym_dllexport = symbol_table_insert("dllexport");
10038 sym_naked = symbol_table_insert("naked");
10039 sym_noinline = symbol_table_insert("noinline");
10040 sym_noreturn = symbol_table_insert("noreturn");
10041 sym_nothrow = symbol_table_insert("nothrow");
10042 sym_novtable = symbol_table_insert("novtable");
10043 sym_property = symbol_table_insert("property");
10044 sym_get = symbol_table_insert("get");
10045 sym_put = symbol_table_insert("put");
10046 sym_selectany = symbol_table_insert("selectany");
10047 sym_thread = symbol_table_insert("thread");
10048 sym_uuid = symbol_table_insert("uuid");
10049 sym_deprecated = symbol_table_insert("deprecated");
10050 sym_restrict = symbol_table_insert("restrict");
10051 sym_noalias = symbol_table_insert("noalias");
10053 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10055 init_expression_parsers();
10056 obstack_init(&temp_obst);
10058 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10059 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10063 * Terminate the parser.
10065 void exit_parser(void)
10067 obstack_free(&temp_obst, NULL);