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"
37 #include "walk_statements.h"
39 #include "adt/bitfiddle.h"
40 #include "adt/error.h"
41 #include "adt/array.h"
43 /** if wchar_t is equal to unsigned short. */
44 bool opt_short_wchar_t =
51 //#define PRINT_TOKENS
52 #define MAX_LOOKAHEAD 2
55 declaration_t *old_declaration;
57 unsigned short namespc;
60 typedef struct argument_list_t argument_list_t;
61 struct argument_list_t {
63 argument_list_t *next;
66 typedef struct gnu_attribute_t gnu_attribute_t;
67 struct gnu_attribute_t {
68 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
69 gnu_attribute_t *next;
70 bool invalid; /**< Set if this attribute had argument errors, */
71 bool have_arguments; /**< True, if this attribute has arguments. */
75 atomic_type_kind_t akind;
76 long argument; /**< Single argument. */
77 argument_list_t *arguments; /**< List of argument expressions. */
81 typedef struct declaration_specifiers_t declaration_specifiers_t;
82 struct declaration_specifiers_t {
83 source_position_t source_position;
84 unsigned char declared_storage_class;
85 unsigned char alignment; /**< Alignment, 0 if not set. */
86 unsigned int is_inline : 1;
87 unsigned int deprecated : 1;
88 decl_modifiers_t modifiers; /**< declaration modifiers */
89 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
90 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
91 symbol_t *get_property_sym; /**< the name of the get property if set. */
92 symbol_t *put_property_sym; /**< the name of the put property if set. */
97 * An environment for parsing initializers (and compound literals).
99 typedef struct parse_initializer_env_t {
100 type_t *type; /**< the type of the initializer. In case of an
101 array type with unspecified size this gets
102 adjusted to the actual size. */
103 declaration_t *declaration; /**< the declaration that is initialized if any */
104 bool must_be_constant;
105 } parse_initializer_env_t;
107 typedef declaration_t* (*parsed_declaration_func) (declaration_t *declaration, bool is_definition);
109 /** The current token. */
110 static token_t token;
111 /** The lookahead ring-buffer. */
112 static token_t lookahead_buffer[MAX_LOOKAHEAD];
113 /** Position of the next token in the lookahead buffer. */
114 static int lookahead_bufpos;
115 static stack_entry_t *environment_stack = NULL;
116 static stack_entry_t *label_stack = NULL;
117 static stack_entry_t *local_label_stack = NULL;
118 /** The global file scope. */
119 static scope_t *file_scope = NULL;
120 /** The current scope. */
121 static scope_t *scope = NULL;
122 static declaration_t *last_declaration = NULL;
123 /** Point to the current function declaration if inside a function. */
124 static declaration_t *current_function = NULL;
125 static declaration_t *current_init_decl = NULL;
126 static switch_statement_t *current_switch = NULL;
127 static statement_t *current_loop = NULL;
128 static statement_t *current_parent = NULL;
129 static ms_try_statement_t *current_try = NULL;
130 static goto_statement_t *goto_first = NULL;
131 static goto_statement_t *goto_last = NULL;
132 static label_statement_t *label_first = NULL;
133 static label_statement_t *label_last = NULL;
134 /** current translation unit. */
135 static translation_unit_t *unit = NULL;
136 /** true if we are in a type property context (evaluation only for type. */
137 static bool in_type_prop = false;
138 /** true in we are in a __extension__ context. */
139 static bool in_gcc_extension = false;
140 static struct obstack temp_obst;
143 #define PUSH_PARENT(stmt) \
144 statement_t *const prev_parent = current_parent; \
145 ((void)(current_parent = (stmt)))
146 #define POP_PARENT ((void)(current_parent = prev_parent))
148 /** special symbol used for anonymous entities. */
149 static const symbol_t *sym_anonymous = NULL;
151 /* symbols for Microsoft extended-decl-modifier */
152 static const symbol_t *sym_align = NULL;
153 static const symbol_t *sym_allocate = NULL;
154 static const symbol_t *sym_dllimport = NULL;
155 static const symbol_t *sym_dllexport = NULL;
156 static const symbol_t *sym_naked = NULL;
157 static const symbol_t *sym_noinline = NULL;
158 static const symbol_t *sym_noreturn = NULL;
159 static const symbol_t *sym_nothrow = NULL;
160 static const symbol_t *sym_novtable = NULL;
161 static const symbol_t *sym_property = NULL;
162 static const symbol_t *sym_get = NULL;
163 static const symbol_t *sym_put = NULL;
164 static const symbol_t *sym_selectany = NULL;
165 static const symbol_t *sym_thread = NULL;
166 static const symbol_t *sym_uuid = NULL;
167 static const symbol_t *sym_deprecated = NULL;
168 static const symbol_t *sym_restrict = NULL;
169 static const symbol_t *sym_noalias = NULL;
171 /** The token anchor set */
172 static unsigned char token_anchor_set[T_LAST_TOKEN];
174 /** The current source position. */
175 #define HERE (&token.source_position)
177 /** true if we are in GCC mode. */
178 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
180 static type_t *type_valist;
182 static statement_t *parse_compound_statement(bool inside_expression_statement);
183 static statement_t *parse_statement(void);
185 static expression_t *parse_sub_expression(precedence_t);
186 static expression_t *parse_expression(void);
187 static type_t *parse_typename(void);
189 static void parse_compound_type_entries(declaration_t *compound_declaration);
190 static declaration_t *parse_declarator(
191 const declaration_specifiers_t *specifiers, bool may_be_abstract);
192 static declaration_t *record_declaration(declaration_t *declaration, bool is_definition);
194 static void semantic_comparison(binary_expression_t *expression);
196 #define STORAGE_CLASSES \
204 #define TYPE_QUALIFIERS \
209 case T__forceinline: \
210 case T___attribute__:
212 #ifdef PROVIDE_COMPLEX
213 #define COMPLEX_SPECIFIERS \
215 #define IMAGINARY_SPECIFIERS \
218 #define COMPLEX_SPECIFIERS
219 #define IMAGINARY_SPECIFIERS
222 #define TYPE_SPECIFIERS \
237 case T___builtin_va_list: \
242 #define DECLARATION_START \
247 #define TYPENAME_START \
251 #define EXPRESSION_START \
260 case T_CHARACTER_CONSTANT: \
261 case T_FLOATINGPOINT: \
265 case T_STRING_LITERAL: \
266 case T_WIDE_CHARACTER_CONSTANT: \
267 case T_WIDE_STRING_LITERAL: \
268 case T___FUNCDNAME__: \
269 case T___FUNCSIG__: \
270 case T___FUNCTION__: \
271 case T___PRETTY_FUNCTION__: \
272 case T___alignof__: \
273 case T___builtin_alloca: \
274 case T___builtin_classify_type: \
275 case T___builtin_constant_p: \
276 case T___builtin_expect: \
277 case T___builtin_huge_val: \
278 case T___builtin_inf: \
279 case T___builtin_inff: \
280 case T___builtin_infl: \
281 case T___builtin_isgreater: \
282 case T___builtin_isgreaterequal: \
283 case T___builtin_isless: \
284 case T___builtin_islessequal: \
285 case T___builtin_islessgreater: \
286 case T___builtin_isunordered: \
287 case T___builtin_nan: \
288 case T___builtin_nanf: \
289 case T___builtin_nanl: \
290 case T___builtin_offsetof: \
291 case T___builtin_prefetch: \
292 case T___builtin_va_arg: \
293 case T___builtin_va_end: \
294 case T___builtin_va_start: \
302 * Allocate an AST node with given size and
303 * initialize all fields with zero.
305 static void *allocate_ast_zero(size_t size)
307 void *res = allocate_ast(size);
308 memset(res, 0, size);
312 static declaration_t *allocate_declaration_zero(void)
314 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
315 declaration->type = type_error_type;
316 declaration->alignment = 0;
321 * Returns the size of a statement node.
323 * @param kind the statement kind
325 static size_t get_statement_struct_size(statement_kind_t kind)
327 static const size_t sizes[] = {
328 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
329 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
330 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
331 [STATEMENT_RETURN] = sizeof(return_statement_t),
332 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
333 [STATEMENT_IF] = sizeof(if_statement_t),
334 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
335 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
336 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
337 [STATEMENT_BREAK] = sizeof(statement_base_t),
338 [STATEMENT_GOTO] = sizeof(goto_statement_t),
339 [STATEMENT_LABEL] = sizeof(label_statement_t),
340 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
341 [STATEMENT_WHILE] = sizeof(while_statement_t),
342 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
343 [STATEMENT_FOR] = sizeof(for_statement_t),
344 [STATEMENT_ASM] = sizeof(asm_statement_t),
345 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
346 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
348 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
349 assert(sizes[kind] != 0);
354 * Returns the size of an expression node.
356 * @param kind the expression kind
358 static size_t get_expression_struct_size(expression_kind_t kind)
360 static const size_t sizes[] = {
361 [EXPR_INVALID] = sizeof(expression_base_t),
362 [EXPR_REFERENCE] = sizeof(reference_expression_t),
363 [EXPR_CONST] = sizeof(const_expression_t),
364 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
365 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
366 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
367 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
368 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
369 [EXPR_CALL] = sizeof(call_expression_t),
370 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
371 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
372 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
373 [EXPR_SELECT] = sizeof(select_expression_t),
374 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
375 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
376 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
377 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
378 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
379 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
380 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
381 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
382 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
383 [EXPR_VA_START] = sizeof(va_start_expression_t),
384 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
385 [EXPR_STATEMENT] = sizeof(statement_expression_t),
386 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
388 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
389 return sizes[EXPR_UNARY_FIRST];
391 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
392 return sizes[EXPR_BINARY_FIRST];
394 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
395 assert(sizes[kind] != 0);
400 * Allocate a statement node of given kind and initialize all
403 static statement_t *allocate_statement_zero(statement_kind_t kind)
405 size_t size = get_statement_struct_size(kind);
406 statement_t *res = allocate_ast_zero(size);
408 res->base.kind = kind;
409 res->base.parent = current_parent;
410 res->base.source_position = token.source_position;
415 * Allocate an expression node of given kind and initialize all
418 static expression_t *allocate_expression_zero(expression_kind_t kind)
420 size_t size = get_expression_struct_size(kind);
421 expression_t *res = allocate_ast_zero(size);
423 res->base.kind = kind;
424 res->base.type = type_error_type;
429 * Creates a new invalid expression.
431 static expression_t *create_invalid_expression(void)
433 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
434 expression->base.source_position = token.source_position;
439 * Creates a new invalid statement.
441 static statement_t *create_invalid_statement(void)
443 return allocate_statement_zero(STATEMENT_INVALID);
447 * Allocate a new empty statement.
449 static statement_t *create_empty_statement(void)
451 return allocate_statement_zero(STATEMENT_EMPTY);
455 * Returns the size of a type node.
457 * @param kind the type kind
459 static size_t get_type_struct_size(type_kind_t kind)
461 static const size_t sizes[] = {
462 [TYPE_ATOMIC] = sizeof(atomic_type_t),
463 [TYPE_COMPLEX] = sizeof(complex_type_t),
464 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
465 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
466 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
467 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
468 [TYPE_ENUM] = sizeof(enum_type_t),
469 [TYPE_FUNCTION] = sizeof(function_type_t),
470 [TYPE_POINTER] = sizeof(pointer_type_t),
471 [TYPE_ARRAY] = sizeof(array_type_t),
472 [TYPE_BUILTIN] = sizeof(builtin_type_t),
473 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
474 [TYPE_TYPEOF] = sizeof(typeof_type_t),
476 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
477 assert(kind <= TYPE_TYPEOF);
478 assert(sizes[kind] != 0);
483 * Allocate a type node of given kind and initialize all
486 * @param kind type kind to allocate
488 static type_t *allocate_type_zero(type_kind_t kind)
490 size_t size = get_type_struct_size(kind);
491 type_t *res = obstack_alloc(type_obst, size);
492 memset(res, 0, size);
493 res->base.kind = kind;
499 * Returns the size of an initializer node.
501 * @param kind the initializer kind
503 static size_t get_initializer_size(initializer_kind_t kind)
505 static const size_t sizes[] = {
506 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
507 [INITIALIZER_STRING] = sizeof(initializer_string_t),
508 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
509 [INITIALIZER_LIST] = sizeof(initializer_list_t),
510 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
512 assert(kind < sizeof(sizes) / sizeof(*sizes));
513 assert(sizes[kind] != 0);
518 * Allocate an initializer node of given kind and initialize all
521 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
523 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
530 * Free a type from the type obstack.
532 static void free_type(void *type)
534 obstack_free(type_obst, type);
538 * Returns the index of the top element of the environment stack.
540 static size_t environment_top(void)
542 return ARR_LEN(environment_stack);
546 * Returns the index of the top element of the global label stack.
548 static size_t label_top(void)
550 return ARR_LEN(label_stack);
554 * Returns the index of the top element of the local label stack.
556 static size_t local_label_top(void)
558 return ARR_LEN(local_label_stack);
562 * Return the next token.
564 static inline void next_token(void)
566 token = lookahead_buffer[lookahead_bufpos];
567 lookahead_buffer[lookahead_bufpos] = lexer_token;
570 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
573 print_token(stderr, &token);
574 fprintf(stderr, "\n");
579 * Return the next token with a given lookahead.
581 static inline const token_t *look_ahead(int num)
583 assert(num > 0 && num <= MAX_LOOKAHEAD);
584 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
585 return &lookahead_buffer[pos];
589 * Adds a token to the token anchor set (a multi-set).
591 static void add_anchor_token(int token_type)
593 assert(0 <= token_type && token_type < T_LAST_TOKEN);
594 ++token_anchor_set[token_type];
597 static int save_and_reset_anchor_state(int token_type)
599 assert(0 <= token_type && token_type < T_LAST_TOKEN);
600 int count = token_anchor_set[token_type];
601 token_anchor_set[token_type] = 0;
605 static void restore_anchor_state(int token_type, int count)
607 assert(0 <= token_type && token_type < T_LAST_TOKEN);
608 token_anchor_set[token_type] = count;
612 * Remove a token from the token anchor set (a multi-set).
614 static void rem_anchor_token(int token_type)
616 assert(0 <= token_type && token_type < T_LAST_TOKEN);
617 assert(token_anchor_set[token_type] != 0);
618 --token_anchor_set[token_type];
621 static bool at_anchor(void)
625 return token_anchor_set[token.type];
629 * Eat tokens until a matching token is found.
631 static void eat_until_matching_token(int type)
635 case '(': end_token = ')'; break;
636 case '{': end_token = '}'; break;
637 case '[': end_token = ']'; break;
638 default: end_token = type; break;
641 unsigned parenthesis_count = 0;
642 unsigned brace_count = 0;
643 unsigned bracket_count = 0;
644 while (token.type != end_token ||
645 parenthesis_count != 0 ||
647 bracket_count != 0) {
648 switch (token.type) {
650 case '(': ++parenthesis_count; break;
651 case '{': ++brace_count; break;
652 case '[': ++bracket_count; break;
655 if (parenthesis_count > 0)
665 if (bracket_count > 0)
668 if (token.type == end_token &&
669 parenthesis_count == 0 &&
683 * Eat input tokens until an anchor is found.
685 static void eat_until_anchor(void)
687 while (token_anchor_set[token.type] == 0) {
688 if (token.type == '(' || token.type == '{' || token.type == '[')
689 eat_until_matching_token(token.type);
694 static void eat_block(void)
696 eat_until_matching_token('{');
697 if (token.type == '}')
701 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while (0)
704 * Report a parse error because an expected token was not found.
707 #if defined __GNUC__ && __GNUC__ >= 4
708 __attribute__((sentinel))
710 void parse_error_expected(const char *message, ...)
712 if (message != NULL) {
713 errorf(HERE, "%s", message);
716 va_start(ap, message);
717 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
722 * Report a type error.
724 static void type_error(const char *msg, const source_position_t *source_position,
727 errorf(source_position, "%s, but found type '%T'", msg, type);
731 * Report an incompatible type.
733 static void type_error_incompatible(const char *msg,
734 const source_position_t *source_position, type_t *type1, type_t *type2)
736 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
741 * Expect the the current token is the expected token.
742 * If not, generate an error, eat the current statement,
743 * and goto the end_error label.
745 #define expect(expected) \
747 if (UNLIKELY(token.type != (expected))) { \
748 parse_error_expected(NULL, (expected), NULL); \
749 add_anchor_token(expected); \
750 eat_until_anchor(); \
751 if (token.type == expected) \
753 rem_anchor_token(expected); \
759 static void scope_push(scope_t *new_scope)
762 scope->last_declaration = last_declaration;
763 new_scope->depth = scope->depth + 1;
765 new_scope->parent = scope;
768 last_declaration = new_scope->last_declaration;
771 static void scope_pop(void)
773 scope->last_declaration = last_declaration;
774 scope = scope->parent;
775 last_declaration = scope->last_declaration;
779 * Search a symbol in a given namespace and returns its declaration or
780 * NULL if this symbol was not found.
782 static declaration_t *get_declaration(const symbol_t *const symbol,
783 const namespace_t namespc)
785 declaration_t *declaration = symbol->declaration;
786 for( ; declaration != NULL; declaration = declaration->symbol_next) {
787 if (declaration->namespc == namespc)
795 * pushs an environment_entry on the environment stack and links the
796 * corresponding symbol to the new entry
798 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
800 symbol_t *symbol = declaration->symbol;
801 namespace_t namespc = (namespace_t) declaration->namespc;
803 /* replace/add declaration into declaration list of the symbol */
804 declaration_t **anchor;
806 for (anchor = &symbol->declaration;; anchor = &iter->symbol_next) {
811 /* replace an entry? */
812 if (iter->namespc == namespc) {
813 declaration->symbol_next = iter->symbol_next;
817 *anchor = declaration;
819 /* remember old declaration */
821 entry.symbol = symbol;
822 entry.old_declaration = iter;
823 entry.namespc = (unsigned short) namespc;
824 ARR_APP1(stack_entry_t, *stack_ptr, entry);
828 * Push a declaration on the environment stack.
830 * @param declaration the declaration
832 static void environment_push(declaration_t *declaration)
834 assert(declaration->source_position.input_name != NULL);
835 assert(declaration->parent_scope != NULL);
836 stack_push(&environment_stack, declaration);
840 * Push a declaration on the global label stack.
842 * @param declaration the declaration
844 static void label_push(declaration_t *declaration)
846 declaration->parent_scope = ¤t_function->scope;
847 stack_push(&label_stack, declaration);
851 * Push a declaration of the local label stack.
853 * @param declaration the declaration
855 static void local_label_push(declaration_t *declaration)
857 assert(declaration->parent_scope != NULL);
858 stack_push(&local_label_stack, declaration);
862 * pops symbols from the environment stack until @p new_top is the top element
864 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
866 stack_entry_t *stack = *stack_ptr;
867 size_t top = ARR_LEN(stack);
870 assert(new_top <= top);
874 for(i = top; i > new_top; --i) {
875 stack_entry_t *entry = &stack[i - 1];
877 declaration_t *old_declaration = entry->old_declaration;
878 symbol_t *symbol = entry->symbol;
879 namespace_t namespc = (namespace_t)entry->namespc;
881 /* replace/remove declaration */
882 declaration_t **anchor;
884 for (anchor = &symbol->declaration;; anchor = &iter->symbol_next) {
886 assert(iter != NULL);
887 /* replace an entry? */
888 if (iter->namespc == namespc)
892 /* Not all declarations adhere scopes (e.g. jump labels), so this
893 * correction is necessary */
894 if (old_declaration != NULL) {
895 old_declaration->symbol_next = iter->symbol_next;
896 *anchor = old_declaration;
898 *anchor = iter->symbol_next;
902 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
906 * Pop all entries from the environment stack until the new_top
909 * @param new_top the new stack top
911 static void environment_pop_to(size_t new_top)
913 stack_pop_to(&environment_stack, new_top);
917 * Pop all entries from the global label stack until the new_top
920 * @param new_top the new stack top
922 static void label_pop_to(size_t new_top)
924 stack_pop_to(&label_stack, new_top);
928 * Pop all entries from the local label stack until the new_top
931 * @param new_top the new stack top
933 static void local_label_pop_to(size_t new_top)
935 stack_pop_to(&local_label_stack, new_top);
939 static int get_akind_rank(atomic_type_kind_t akind)
944 static int get_rank(const type_t *type)
946 assert(!is_typeref(type));
947 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
948 * and esp. footnote 108). However we can't fold constants (yet), so we
949 * can't decide whether unsigned int is possible, while int always works.
950 * (unsigned int would be preferable when possible... for stuff like
951 * struct { enum { ... } bla : 4; } ) */
952 if (type->kind == TYPE_ENUM)
953 return get_akind_rank(ATOMIC_TYPE_INT);
955 assert(type->kind == TYPE_ATOMIC);
956 return get_akind_rank(type->atomic.akind);
959 static type_t *promote_integer(type_t *type)
961 if (type->kind == TYPE_BITFIELD)
962 type = type->bitfield.base_type;
964 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
971 * Create a cast expression.
973 * @param expression the expression to cast
974 * @param dest_type the destination type
976 static expression_t *create_cast_expression(expression_t *expression,
979 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
981 cast->unary.value = expression;
982 cast->base.type = dest_type;
988 * Check if a given expression represents the 0 pointer constant.
990 static bool is_null_pointer_constant(const expression_t *expression)
992 /* skip void* cast */
993 if (expression->kind == EXPR_UNARY_CAST
994 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
995 expression = expression->unary.value;
998 /* TODO: not correct yet, should be any constant integer expression
999 * which evaluates to 0 */
1000 if (expression->kind != EXPR_CONST)
1003 type_t *const type = skip_typeref(expression->base.type);
1004 if (!is_type_integer(type))
1007 return expression->conste.v.int_value == 0;
1011 * Create an implicit cast expression.
1013 * @param expression the expression to cast
1014 * @param dest_type the destination type
1016 static expression_t *create_implicit_cast(expression_t *expression,
1019 type_t *const source_type = expression->base.type;
1021 if (source_type == dest_type)
1024 return create_cast_expression(expression, dest_type);
1027 typedef enum assign_error_t {
1029 ASSIGN_ERROR_INCOMPATIBLE,
1030 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
1031 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
1032 ASSIGN_WARNING_POINTER_FROM_INT,
1033 ASSIGN_WARNING_INT_FROM_POINTER
1036 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
1037 const expression_t *const right,
1038 const char *context,
1039 const source_position_t *source_position)
1041 type_t *const orig_type_right = right->base.type;
1042 type_t *const type_left = skip_typeref(orig_type_left);
1043 type_t *const type_right = skip_typeref(orig_type_right);
1046 case ASSIGN_SUCCESS:
1048 case ASSIGN_ERROR_INCOMPATIBLE:
1049 errorf(source_position,
1050 "destination type '%T' in %s is incompatible with type '%T'",
1051 orig_type_left, context, orig_type_right);
1054 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1055 if (warning.other) {
1056 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
1057 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
1059 /* the left type has all qualifiers from the right type */
1060 unsigned missing_qualifiers
1061 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1062 warningf(source_position,
1063 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1064 orig_type_left, context, orig_type_right, missing_qualifiers);
1069 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1070 if (warning.other) {
1071 warningf(source_position,
1072 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1073 orig_type_left, context, right, orig_type_right);
1077 case ASSIGN_WARNING_POINTER_FROM_INT:
1078 if (warning.other) {
1079 warningf(source_position,
1080 "%s makes pointer '%T' from integer '%T' without a cast",
1081 context, orig_type_left, orig_type_right);
1085 case ASSIGN_WARNING_INT_FROM_POINTER:
1086 if (warning.other) {
1087 warningf(source_position,
1088 "%s makes integer '%T' from pointer '%T' without a cast",
1089 context, orig_type_left, orig_type_right);
1094 panic("invalid error value");
1098 /** Implements the rules from § 6.5.16.1 */
1099 static assign_error_t semantic_assign(type_t *orig_type_left,
1100 const expression_t *const right)
1102 type_t *const orig_type_right = right->base.type;
1103 type_t *const type_left = skip_typeref(orig_type_left);
1104 type_t *const type_right = skip_typeref(orig_type_right);
1106 if (is_type_pointer(type_left)) {
1107 if (is_null_pointer_constant(right)) {
1108 return ASSIGN_SUCCESS;
1109 } else if (is_type_pointer(type_right)) {
1110 type_t *points_to_left
1111 = skip_typeref(type_left->pointer.points_to);
1112 type_t *points_to_right
1113 = skip_typeref(type_right->pointer.points_to);
1114 assign_error_t res = ASSIGN_SUCCESS;
1116 /* the left type has all qualifiers from the right type */
1117 unsigned missing_qualifiers
1118 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1119 if (missing_qualifiers != 0) {
1120 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1123 points_to_left = get_unqualified_type(points_to_left);
1124 points_to_right = get_unqualified_type(points_to_right);
1126 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
1127 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1131 if (!types_compatible(points_to_left, points_to_right)) {
1132 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1136 } else if (is_type_integer(type_right)) {
1137 return ASSIGN_WARNING_POINTER_FROM_INT;
1139 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1140 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1141 && is_type_pointer(type_right))) {
1142 return ASSIGN_SUCCESS;
1143 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1144 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1145 type_t *const unqual_type_left = get_unqualified_type(type_left);
1146 type_t *const unqual_type_right = get_unqualified_type(type_right);
1147 if (types_compatible(unqual_type_left, unqual_type_right)) {
1148 return ASSIGN_SUCCESS;
1150 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1151 return ASSIGN_WARNING_INT_FROM_POINTER;
1154 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1155 return ASSIGN_SUCCESS;
1157 return ASSIGN_ERROR_INCOMPATIBLE;
1160 static expression_t *parse_constant_expression(void)
1162 expression_t *result = parse_sub_expression(PREC_CONDITIONAL);
1164 if (!is_constant_expression(result)) {
1165 errorf(&result->base.source_position,
1166 "expression '%E' is not constant\n", result);
1172 static expression_t *parse_assignment_expression(void)
1174 return parse_sub_expression(PREC_ASSIGNMENT);
1177 static type_t *make_global_typedef(const char *name, type_t *type)
1179 symbol_t *const symbol = symbol_table_insert(name);
1181 declaration_t *const declaration = allocate_declaration_zero();
1182 declaration->namespc = NAMESPACE_NORMAL;
1183 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
1184 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
1185 declaration->type = type;
1186 declaration->symbol = symbol;
1187 declaration->source_position = builtin_source_position;
1188 declaration->implicit = true;
1190 record_declaration(declaration, false);
1192 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF);
1193 typedef_type->typedeft.declaration = declaration;
1195 return typedef_type;
1198 static string_t parse_string_literals(void)
1200 assert(token.type == T_STRING_LITERAL);
1201 string_t result = token.v.string;
1205 while (token.type == T_STRING_LITERAL) {
1206 result = concat_strings(&result, &token.v.string);
1213 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1214 [GNU_AK_CONST] = "const",
1215 [GNU_AK_VOLATILE] = "volatile",
1216 [GNU_AK_CDECL] = "cdecl",
1217 [GNU_AK_STDCALL] = "stdcall",
1218 [GNU_AK_FASTCALL] = "fastcall",
1219 [GNU_AK_DEPRECATED] = "deprecated",
1220 [GNU_AK_NOINLINE] = "noinline",
1221 [GNU_AK_NORETURN] = "noreturn",
1222 [GNU_AK_NAKED] = "naked",
1223 [GNU_AK_PURE] = "pure",
1224 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1225 [GNU_AK_MALLOC] = "malloc",
1226 [GNU_AK_WEAK] = "weak",
1227 [GNU_AK_CONSTRUCTOR] = "constructor",
1228 [GNU_AK_DESTRUCTOR] = "destructor",
1229 [GNU_AK_NOTHROW] = "nothrow",
1230 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1231 [GNU_AK_COMMON] = "common",
1232 [GNU_AK_NOCOMMON] = "nocommon",
1233 [GNU_AK_PACKED] = "packed",
1234 [GNU_AK_SHARED] = "shared",
1235 [GNU_AK_NOTSHARED] = "notshared",
1236 [GNU_AK_USED] = "used",
1237 [GNU_AK_UNUSED] = "unused",
1238 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1239 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1240 [GNU_AK_LONGCALL] = "longcall",
1241 [GNU_AK_SHORTCALL] = "shortcall",
1242 [GNU_AK_LONG_CALL] = "long_call",
1243 [GNU_AK_SHORT_CALL] = "short_call",
1244 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1245 [GNU_AK_INTERRUPT] = "interrupt",
1246 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1247 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1248 [GNU_AK_NESTING] = "nesting",
1249 [GNU_AK_NEAR] = "near",
1250 [GNU_AK_FAR] = "far",
1251 [GNU_AK_SIGNAL] = "signal",
1252 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1253 [GNU_AK_TINY_DATA] = "tiny_data",
1254 [GNU_AK_SAVEALL] = "saveall",
1255 [GNU_AK_FLATTEN] = "flatten",
1256 [GNU_AK_SSEREGPARM] = "sseregparm",
1257 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1258 [GNU_AK_RETURN_TWICE] = "return_twice",
1259 [GNU_AK_MAY_ALIAS] = "may_alias",
1260 [GNU_AK_MS_STRUCT] = "ms_struct",
1261 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1262 [GNU_AK_DLLIMPORT] = "dllimport",
1263 [GNU_AK_DLLEXPORT] = "dllexport",
1264 [GNU_AK_ALIGNED] = "aligned",
1265 [GNU_AK_ALIAS] = "alias",
1266 [GNU_AK_SECTION] = "section",
1267 [GNU_AK_FORMAT] = "format",
1268 [GNU_AK_FORMAT_ARG] = "format_arg",
1269 [GNU_AK_WEAKREF] = "weakref",
1270 [GNU_AK_NONNULL] = "nonnull",
1271 [GNU_AK_TLS_MODEL] = "tls_model",
1272 [GNU_AK_VISIBILITY] = "visibility",
1273 [GNU_AK_REGPARM] = "regparm",
1274 [GNU_AK_MODE] = "mode",
1275 [GNU_AK_MODEL] = "model",
1276 [GNU_AK_TRAP_EXIT] = "trap_exit",
1277 [GNU_AK_SP_SWITCH] = "sp_switch",
1278 [GNU_AK_SENTINEL] = "sentinel"
1282 * compare two string, ignoring double underscores on the second.
1284 static int strcmp_underscore(const char *s1, const char *s2)
1286 if (s2[0] == '_' && s2[1] == '_') {
1287 size_t len2 = strlen(s2);
1288 size_t len1 = strlen(s1);
1289 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1290 return strncmp(s1, s2+2, len2-4);
1294 return strcmp(s1, s2);
1298 * Allocate a new gnu temporal attribute.
1300 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1302 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1303 attribute->kind = kind;
1304 attribute->next = NULL;
1305 attribute->invalid = false;
1306 attribute->have_arguments = false;
1312 * parse one constant expression argument.
1314 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1316 expression_t *expression;
1317 add_anchor_token(')');
1318 expression = parse_constant_expression();
1319 rem_anchor_token(')');
1321 attribute->u.argument = fold_constant(expression);
1324 attribute->invalid = true;
1328 * parse a list of constant expressions arguments.
1330 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1332 argument_list_t **list = &attribute->u.arguments;
1333 argument_list_t *entry;
1334 expression_t *expression;
1335 add_anchor_token(')');
1336 add_anchor_token(',');
1338 expression = parse_constant_expression();
1339 entry = obstack_alloc(&temp_obst, sizeof(entry));
1340 entry->argument = fold_constant(expression);
1343 list = &entry->next;
1344 if (token.type != ',')
1348 rem_anchor_token(',');
1349 rem_anchor_token(')');
1353 attribute->invalid = true;
1357 * parse one string literal argument.
1359 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1362 add_anchor_token('(');
1363 if (token.type != T_STRING_LITERAL) {
1364 parse_error_expected("while parsing attribute directive",
1365 T_STRING_LITERAL, NULL);
1368 *string = parse_string_literals();
1369 rem_anchor_token('(');
1373 attribute->invalid = true;
1377 * parse one tls model.
1379 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1381 static const char *const tls_models[] = {
1387 string_t string = { NULL, 0 };
1388 parse_gnu_attribute_string_arg(attribute, &string);
1389 if (string.begin != NULL) {
1390 for(size_t i = 0; i < 4; ++i) {
1391 if (strcmp(tls_models[i], string.begin) == 0) {
1392 attribute->u.value = i;
1396 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1398 attribute->invalid = true;
1402 * parse one tls model.
1404 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1406 static const char *const visibilities[] = {
1412 string_t string = { NULL, 0 };
1413 parse_gnu_attribute_string_arg(attribute, &string);
1414 if (string.begin != NULL) {
1415 for(size_t i = 0; i < 4; ++i) {
1416 if (strcmp(visibilities[i], string.begin) == 0) {
1417 attribute->u.value = i;
1421 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1423 attribute->invalid = true;
1427 * parse one (code) model.
1429 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1431 static const char *const visibilities[] = {
1436 string_t string = { NULL, 0 };
1437 parse_gnu_attribute_string_arg(attribute, &string);
1438 if (string.begin != NULL) {
1439 for(int i = 0; i < 3; ++i) {
1440 if (strcmp(visibilities[i], string.begin) == 0) {
1441 attribute->u.value = i;
1445 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1447 attribute->invalid = true;
1450 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1452 /* TODO: find out what is allowed here... */
1454 /* at least: byte, word, pointer, list of machine modes
1455 * __XXX___ is interpreted as XXX */
1456 add_anchor_token(')');
1458 if (token.type != T_IDENTIFIER) {
1459 expect(T_IDENTIFIER);
1462 /* This isn't really correct, the backend should provide a list of machine
1463 * specific modes (according to gcc philosophy that is...) */
1464 const char *symbol_str = token.v.symbol->string;
1465 if (strcmp_underscore("QI", symbol_str) == 0 ||
1466 strcmp_underscore("byte", symbol_str) == 0) {
1467 attribute->u.akind = ATOMIC_TYPE_CHAR;
1468 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1469 attribute->u.akind = ATOMIC_TYPE_SHORT;
1470 } else if (strcmp_underscore("SI", symbol_str) == 0
1471 || strcmp_underscore("word", symbol_str) == 0
1472 || strcmp_underscore("pointer", symbol_str) == 0) {
1473 attribute->u.akind = ATOMIC_TYPE_INT;
1474 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1475 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1478 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1479 attribute->invalid = true;
1483 rem_anchor_token(')');
1487 attribute->invalid = true;
1491 * parse one interrupt argument.
1493 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1495 static const char *const interrupts[] = {
1502 string_t string = { NULL, 0 };
1503 parse_gnu_attribute_string_arg(attribute, &string);
1504 if (string.begin != NULL) {
1505 for(size_t i = 0; i < 5; ++i) {
1506 if (strcmp(interrupts[i], string.begin) == 0) {
1507 attribute->u.value = i;
1511 errorf(HERE, "'%s' is not an interrupt", string.begin);
1513 attribute->invalid = true;
1517 * parse ( identifier, const expression, const expression )
1519 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1521 static const char *const format_names[] = {
1529 if (token.type != T_IDENTIFIER) {
1530 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1533 const char *name = token.v.symbol->string;
1534 for(i = 0; i < 4; ++i) {
1535 if (strcmp_underscore(format_names[i], name) == 0)
1539 if (warning.attribute)
1540 warningf(HERE, "'%s' is an unrecognized format function type", name);
1545 add_anchor_token(')');
1546 add_anchor_token(',');
1547 parse_constant_expression();
1548 rem_anchor_token(',');
1549 rem_anchor_token(')');
1552 add_anchor_token(')');
1553 parse_constant_expression();
1554 rem_anchor_token(')');
1558 attribute->u.value = true;
1561 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1563 if (!attribute->have_arguments)
1566 /* should have no arguments */
1567 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1568 eat_until_matching_token('(');
1569 /* we have already consumed '(', so we stop before ')', eat it */
1571 attribute->invalid = true;
1575 * Parse one GNU attribute.
1577 * Note that attribute names can be specified WITH or WITHOUT
1578 * double underscores, ie const or __const__.
1580 * The following attributes are parsed without arguments
1605 * no_instrument_function
1606 * warn_unused_result
1623 * externally_visible
1631 * The following attributes are parsed with arguments
1632 * aligned( const expression )
1633 * alias( string literal )
1634 * section( string literal )
1635 * format( identifier, const expression, const expression )
1636 * format_arg( const expression )
1637 * tls_model( string literal )
1638 * visibility( string literal )
1639 * regparm( const expression )
1640 * model( string leteral )
1641 * trap_exit( const expression )
1642 * sp_switch( string literal )
1644 * The following attributes might have arguments
1645 * weak_ref( string literal )
1646 * non_null( const expression // ',' )
1647 * interrupt( string literal )
1648 * sentinel( constant expression )
1650 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1652 gnu_attribute_t *head = *attributes;
1653 gnu_attribute_t *last = *attributes;
1654 decl_modifiers_t modifiers = 0;
1655 gnu_attribute_t *attribute;
1657 eat(T___attribute__);
1661 if (token.type != ')') {
1662 /* find the end of the list */
1664 while (last->next != NULL)
1668 /* non-empty attribute list */
1671 if (token.type == T_const) {
1673 } else if (token.type == T_volatile) {
1675 } else if (token.type == T_cdecl) {
1676 /* __attribute__((cdecl)), WITH ms mode */
1678 } else if (token.type == T_IDENTIFIER) {
1679 const symbol_t *sym = token.v.symbol;
1682 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1689 for(i = 0; i < GNU_AK_LAST; ++i) {
1690 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1693 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1696 if (kind == GNU_AK_LAST) {
1697 if (warning.attribute)
1698 warningf(HERE, "'%s' attribute directive ignored", name);
1700 /* skip possible arguments */
1701 if (token.type == '(') {
1702 eat_until_matching_token(')');
1705 /* check for arguments */
1706 attribute = allocate_gnu_attribute(kind);
1707 if (token.type == '(') {
1709 if (token.type == ')') {
1710 /* empty args are allowed */
1713 attribute->have_arguments = true;
1717 case GNU_AK_VOLATILE:
1722 case GNU_AK_NOCOMMON:
1724 case GNU_AK_NOTSHARED:
1725 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1726 case GNU_AK_WARN_UNUSED_RESULT:
1727 case GNU_AK_LONGCALL:
1728 case GNU_AK_SHORTCALL:
1729 case GNU_AK_LONG_CALL:
1730 case GNU_AK_SHORT_CALL:
1731 case GNU_AK_FUNCTION_VECTOR:
1732 case GNU_AK_INTERRUPT_HANDLER:
1733 case GNU_AK_NMI_HANDLER:
1734 case GNU_AK_NESTING:
1738 case GNU_AK_EIGTHBIT_DATA:
1739 case GNU_AK_TINY_DATA:
1740 case GNU_AK_SAVEALL:
1741 case GNU_AK_FLATTEN:
1742 case GNU_AK_SSEREGPARM:
1743 case GNU_AK_EXTERNALLY_VISIBLE:
1744 case GNU_AK_RETURN_TWICE:
1745 case GNU_AK_MAY_ALIAS:
1746 case GNU_AK_MS_STRUCT:
1747 case GNU_AK_GCC_STRUCT:
1750 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1751 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1752 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1753 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1754 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1755 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1756 case GNU_AK_CONST: modifiers |= DM_CONST; goto no_arg;
1757 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1758 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1759 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1760 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1761 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1762 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1763 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1764 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1765 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1766 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1767 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1769 case GNU_AK_ALIGNED:
1770 /* __align__ may be used without an argument */
1771 if (attribute->have_arguments) {
1772 parse_gnu_attribute_const_arg(attribute);
1776 case GNU_AK_FORMAT_ARG:
1777 case GNU_AK_REGPARM:
1778 case GNU_AK_TRAP_EXIT:
1779 if (!attribute->have_arguments) {
1780 /* should have arguments */
1781 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1782 attribute->invalid = true;
1784 parse_gnu_attribute_const_arg(attribute);
1787 case GNU_AK_SECTION:
1788 case GNU_AK_SP_SWITCH:
1789 if (!attribute->have_arguments) {
1790 /* should have arguments */
1791 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1792 attribute->invalid = true;
1794 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1797 if (!attribute->have_arguments) {
1798 /* should have arguments */
1799 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1800 attribute->invalid = true;
1802 parse_gnu_attribute_format_args(attribute);
1804 case GNU_AK_WEAKREF:
1805 /* may have one string argument */
1806 if (attribute->have_arguments)
1807 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1809 case GNU_AK_NONNULL:
1810 if (attribute->have_arguments)
1811 parse_gnu_attribute_const_arg_list(attribute);
1813 case GNU_AK_TLS_MODEL:
1814 if (!attribute->have_arguments) {
1815 /* should have arguments */
1816 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1818 parse_gnu_attribute_tls_model_arg(attribute);
1820 case GNU_AK_VISIBILITY:
1821 if (!attribute->have_arguments) {
1822 /* should have arguments */
1823 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1825 parse_gnu_attribute_visibility_arg(attribute);
1828 if (!attribute->have_arguments) {
1829 /* should have arguments */
1830 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1832 parse_gnu_attribute_model_arg(attribute);
1836 if (!attribute->have_arguments) {
1837 /* should have arguments */
1838 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1840 parse_gnu_attribute_mode_arg(attribute);
1843 case GNU_AK_INTERRUPT:
1844 /* may have one string argument */
1845 if (attribute->have_arguments)
1846 parse_gnu_attribute_interrupt_arg(attribute);
1848 case GNU_AK_SENTINEL:
1849 /* may have one string argument */
1850 if (attribute->have_arguments)
1851 parse_gnu_attribute_const_arg(attribute);
1854 /* already handled */
1858 check_no_argument(attribute, name);
1861 if (attribute != NULL) {
1863 last->next = attribute;
1866 head = last = attribute;
1870 if (token.type != ',')
1884 * Parse GNU attributes.
1886 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1888 decl_modifiers_t modifiers = 0;
1891 switch(token.type) {
1892 case T___attribute__:
1893 modifiers |= parse_gnu_attribute(attributes);
1899 if (token.type != T_STRING_LITERAL) {
1900 parse_error_expected("while parsing assembler attribute",
1901 T_STRING_LITERAL, NULL);
1902 eat_until_matching_token('(');
1905 parse_string_literals();
1910 case T_cdecl: modifiers |= DM_CDECL; break;
1911 case T__fastcall: modifiers |= DM_FASTCALL; break;
1912 case T__stdcall: modifiers |= DM_STDCALL; break;
1915 /* TODO record modifier */
1917 warningf(HERE, "Ignoring declaration modifier %K", &token);
1921 default: return modifiers;
1928 static void mark_decls_read(expression_t *expr, declaration_t *lhs_decl);
1930 static declaration_t *determine_lhs_decl(expression_t *const expr, declaration_t *lhs_decl)
1932 switch (expr->kind) {
1933 case EXPR_REFERENCE: {
1934 declaration_t *const decl = expr->reference.declaration;
1938 case EXPR_ARRAY_ACCESS: {
1939 expression_t *const ref = expr->array_access.array_ref;
1940 declaration_t * decl = NULL;
1941 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1942 decl = determine_lhs_decl(ref, lhs_decl);
1945 mark_decls_read(expr->select.compound, lhs_decl);
1947 mark_decls_read(expr->array_access.index, lhs_decl);
1952 if (is_type_compound(skip_typeref(expr->base.type))) {
1953 return determine_lhs_decl(expr->select.compound, lhs_decl);
1955 mark_decls_read(expr->select.compound, lhs_decl);
1960 case EXPR_UNARY_DEREFERENCE: {
1961 expression_t *const val = expr->unary.value;
1962 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1964 return determine_lhs_decl(val->unary.value, lhs_decl);
1966 mark_decls_read(val, NULL);
1972 mark_decls_read(expr, NULL);
1977 #define DECL_ANY ((declaration_t*)-1)
1980 * Mark declarations, which are read. This is used to deted variables, which
1984 * x is not marked as "read", because it is only read to calculate its own new
1988 * x and y are not detected as "not read", because multiple variables are
1991 static void mark_decls_read(expression_t *const expr, declaration_t *lhs_decl)
1993 switch (expr->kind) {
1994 case EXPR_REFERENCE: {
1995 declaration_t *const decl = expr->reference.declaration;
1996 if (lhs_decl != decl && lhs_decl != DECL_ANY)
2002 // TODO respect pure/const
2003 mark_decls_read(expr->call.function, NULL);
2004 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
2005 mark_decls_read(arg->expression, NULL);
2009 case EXPR_CONDITIONAL:
2010 // TODO lhs_decl should depend on whether true/false have an effect
2011 mark_decls_read(expr->conditional.condition, NULL);
2012 if (expr->conditional.true_expression != NULL)
2013 mark_decls_read(expr->conditional.true_expression, lhs_decl);
2014 mark_decls_read(expr->conditional.false_expression, lhs_decl);
2018 if (lhs_decl == DECL_ANY && !is_type_compound(skip_typeref(expr->base.type)))
2020 mark_decls_read(expr->select.compound, lhs_decl);
2023 case EXPR_ARRAY_ACCESS: {
2024 expression_t *const ref = expr->array_access.array_ref;
2025 mark_decls_read(ref, lhs_decl);
2026 lhs_decl = determine_lhs_decl(ref, lhs_decl);
2027 mark_decls_read(expr->array_access.index, lhs_decl);
2032 mark_decls_read(expr->va_arge.ap, lhs_decl);
2035 case EXPR_UNARY_CAST:
2036 /* Special case: Use void cast to mark a variable as "read" */
2037 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
2041 case EXPR_UNARY_DEREFERENCE:
2042 if (lhs_decl == DECL_ANY)
2046 case EXPR_UNARY_THROW:
2047 if (expr->unary.value == NULL)
2051 case EXPR_UNARY_NEGATE:
2052 case EXPR_UNARY_PLUS:
2053 case EXPR_UNARY_BITWISE_NEGATE:
2054 case EXPR_UNARY_NOT:
2055 case EXPR_UNARY_TAKE_ADDRESS:
2056 case EXPR_UNARY_POSTFIX_INCREMENT:
2057 case EXPR_UNARY_POSTFIX_DECREMENT:
2058 case EXPR_UNARY_PREFIX_INCREMENT:
2059 case EXPR_UNARY_PREFIX_DECREMENT:
2060 case EXPR_UNARY_CAST_IMPLICIT:
2061 case EXPR_UNARY_ASSUME:
2063 mark_decls_read(expr->unary.value, lhs_decl);
2066 case EXPR_BINARY_ADD:
2067 case EXPR_BINARY_SUB:
2068 case EXPR_BINARY_MUL:
2069 case EXPR_BINARY_DIV:
2070 case EXPR_BINARY_MOD:
2071 case EXPR_BINARY_EQUAL:
2072 case EXPR_BINARY_NOTEQUAL:
2073 case EXPR_BINARY_LESS:
2074 case EXPR_BINARY_LESSEQUAL:
2075 case EXPR_BINARY_GREATER:
2076 case EXPR_BINARY_GREATEREQUAL:
2077 case EXPR_BINARY_BITWISE_AND:
2078 case EXPR_BINARY_BITWISE_OR:
2079 case EXPR_BINARY_BITWISE_XOR:
2080 case EXPR_BINARY_LOGICAL_AND:
2081 case EXPR_BINARY_LOGICAL_OR:
2082 case EXPR_BINARY_SHIFTLEFT:
2083 case EXPR_BINARY_SHIFTRIGHT:
2084 case EXPR_BINARY_COMMA:
2085 case EXPR_BINARY_ISGREATER:
2086 case EXPR_BINARY_ISGREATEREQUAL:
2087 case EXPR_BINARY_ISLESS:
2088 case EXPR_BINARY_ISLESSEQUAL:
2089 case EXPR_BINARY_ISLESSGREATER:
2090 case EXPR_BINARY_ISUNORDERED:
2091 mark_decls_read(expr->binary.left, lhs_decl);
2092 mark_decls_read(expr->binary.right, lhs_decl);
2095 case EXPR_BINARY_ASSIGN:
2096 case EXPR_BINARY_MUL_ASSIGN:
2097 case EXPR_BINARY_DIV_ASSIGN:
2098 case EXPR_BINARY_MOD_ASSIGN:
2099 case EXPR_BINARY_ADD_ASSIGN:
2100 case EXPR_BINARY_SUB_ASSIGN:
2101 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2102 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2103 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2104 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2105 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
2106 if (lhs_decl == DECL_ANY)
2108 lhs_decl = determine_lhs_decl(expr->binary.left, lhs_decl);
2109 mark_decls_read(expr->binary.right, lhs_decl);
2114 determine_lhs_decl(expr->va_starte.ap, lhs_decl);
2120 case EXPR_CHARACTER_CONSTANT:
2121 case EXPR_WIDE_CHARACTER_CONSTANT:
2122 case EXPR_STRING_LITERAL:
2123 case EXPR_WIDE_STRING_LITERAL:
2124 case EXPR_COMPOUND_LITERAL: // TODO init?
2126 case EXPR_CLASSIFY_TYPE:
2129 case EXPR_BUILTIN_SYMBOL:
2130 case EXPR_BUILTIN_CONSTANT_P:
2131 case EXPR_BUILTIN_PREFETCH:
2133 case EXPR_STATEMENT: // TODO
2134 case EXPR_LABEL_ADDRESS:
2135 case EXPR_BINARY_BUILTIN_EXPECT:
2139 panic("unhandled expression");
2142 static designator_t *parse_designation(void)
2144 designator_t *result = NULL;
2145 designator_t *last = NULL;
2148 designator_t *designator;
2149 switch(token.type) {
2151 designator = allocate_ast_zero(sizeof(designator[0]));
2152 designator->source_position = token.source_position;
2154 add_anchor_token(']');
2155 designator->array_index = parse_constant_expression();
2156 rem_anchor_token(']');
2160 designator = allocate_ast_zero(sizeof(designator[0]));
2161 designator->source_position = token.source_position;
2163 if (token.type != T_IDENTIFIER) {
2164 parse_error_expected("while parsing designator",
2165 T_IDENTIFIER, NULL);
2168 designator->symbol = token.v.symbol;
2176 assert(designator != NULL);
2178 last->next = designator;
2180 result = designator;
2188 static initializer_t *initializer_from_string(array_type_t *type,
2189 const string_t *const string)
2191 /* TODO: check len vs. size of array type */
2194 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
2195 initializer->string.string = *string;
2200 static initializer_t *initializer_from_wide_string(array_type_t *const type,
2201 wide_string_t *const string)
2203 /* TODO: check len vs. size of array type */
2206 initializer_t *const initializer =
2207 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
2208 initializer->wide_string.string = *string;
2214 * Build an initializer from a given expression.
2216 static initializer_t *initializer_from_expression(type_t *orig_type,
2217 expression_t *expression)
2219 /* TODO check that expression is a constant expression */
2221 /* § 6.7.8.14/15 char array may be initialized by string literals */
2222 type_t *type = skip_typeref(orig_type);
2223 type_t *expr_type_orig = expression->base.type;
2224 type_t *expr_type = skip_typeref(expr_type_orig);
2225 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
2226 array_type_t *const array_type = &type->array;
2227 type_t *const element_type = skip_typeref(array_type->element_type);
2229 if (element_type->kind == TYPE_ATOMIC) {
2230 atomic_type_kind_t akind = element_type->atomic.akind;
2231 switch (expression->kind) {
2232 case EXPR_STRING_LITERAL:
2233 if (akind == ATOMIC_TYPE_CHAR
2234 || akind == ATOMIC_TYPE_SCHAR
2235 || akind == ATOMIC_TYPE_UCHAR) {
2236 return initializer_from_string(array_type,
2237 &expression->string.value);
2240 case EXPR_WIDE_STRING_LITERAL: {
2241 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
2242 if (get_unqualified_type(element_type) == bare_wchar_type) {
2243 return initializer_from_wide_string(array_type,
2244 &expression->wide_string.value);
2254 assign_error_t error = semantic_assign(type, expression);
2255 if (error == ASSIGN_ERROR_INCOMPATIBLE)
2257 report_assign_error(error, type, expression, "initializer",
2258 &expression->base.source_position);
2260 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
2262 if (type->kind == TYPE_BITFIELD) {
2263 type = type->bitfield.base_type;
2266 result->value.value = create_implicit_cast(expression, type);
2272 * Checks if a given expression can be used as an constant initializer.
2274 static bool is_initializer_constant(const expression_t *expression)
2276 return is_constant_expression(expression)
2277 || is_address_constant(expression);
2281 * Parses an scalar initializer.
2283 * § 6.7.8.11; eat {} without warning
2285 static initializer_t *parse_scalar_initializer(type_t *type,
2286 bool must_be_constant)
2288 /* there might be extra {} hierarchies */
2290 if (token.type == '{') {
2292 warningf(HERE, "extra curly braces around scalar initializer");
2296 } while (token.type == '{');
2299 expression_t *expression = parse_assignment_expression();
2300 mark_decls_read(expression, NULL);
2301 if (must_be_constant && !is_initializer_constant(expression)) {
2302 errorf(&expression->base.source_position,
2303 "Initialisation expression '%E' is not constant\n",
2307 initializer_t *initializer = initializer_from_expression(type, expression);
2309 if (initializer == NULL) {
2310 errorf(&expression->base.source_position,
2311 "expression '%E' (type '%T') doesn't match expected type '%T'",
2312 expression, expression->base.type, type);
2317 bool additional_warning_displayed = false;
2318 while (braces > 0) {
2319 if (token.type == ',') {
2322 if (token.type != '}') {
2323 if (!additional_warning_displayed && warning.other) {
2324 warningf(HERE, "additional elements in scalar initializer");
2325 additional_warning_displayed = true;
2336 * An entry in the type path.
2338 typedef struct type_path_entry_t type_path_entry_t;
2339 struct type_path_entry_t {
2340 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2342 size_t index; /**< For array types: the current index. */
2343 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2348 * A type path expression a position inside compound or array types.
2350 typedef struct type_path_t type_path_t;
2351 struct type_path_t {
2352 type_path_entry_t *path; /**< An flexible array containing the current path. */
2353 type_t *top_type; /**< type of the element the path points */
2354 size_t max_index; /**< largest index in outermost array */
2358 * Prints a type path for debugging.
2360 static __attribute__((unused)) void debug_print_type_path(
2361 const type_path_t *path)
2363 size_t len = ARR_LEN(path->path);
2365 for(size_t i = 0; i < len; ++i) {
2366 const type_path_entry_t *entry = & path->path[i];
2368 type_t *type = skip_typeref(entry->type);
2369 if (is_type_compound(type)) {
2370 /* in gcc mode structs can have no members */
2371 if (entry->v.compound_entry == NULL) {
2375 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
2376 } else if (is_type_array(type)) {
2377 fprintf(stderr, "[%zu]", entry->v.index);
2379 fprintf(stderr, "-INVALID-");
2382 if (path->top_type != NULL) {
2383 fprintf(stderr, " (");
2384 print_type(path->top_type);
2385 fprintf(stderr, ")");
2390 * Return the top type path entry, ie. in a path
2391 * (type).a.b returns the b.
2393 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2395 size_t len = ARR_LEN(path->path);
2397 return &path->path[len-1];
2401 * Enlarge the type path by an (empty) element.
2403 static type_path_entry_t *append_to_type_path(type_path_t *path)
2405 size_t len = ARR_LEN(path->path);
2406 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2408 type_path_entry_t *result = & path->path[len];
2409 memset(result, 0, sizeof(result[0]));
2414 * Descending into a sub-type. Enter the scope of the current
2417 static void descend_into_subtype(type_path_t *path)
2419 type_t *orig_top_type = path->top_type;
2420 type_t *top_type = skip_typeref(orig_top_type);
2422 type_path_entry_t *top = append_to_type_path(path);
2423 top->type = top_type;
2425 if (is_type_compound(top_type)) {
2426 declaration_t *declaration = top_type->compound.declaration;
2427 declaration_t *entry = declaration->scope.declarations;
2428 top->v.compound_entry = entry;
2430 if (entry != NULL) {
2431 path->top_type = entry->type;
2433 path->top_type = NULL;
2435 } else if (is_type_array(top_type)) {
2437 path->top_type = top_type->array.element_type;
2439 assert(!is_type_valid(top_type));
2444 * Pop an entry from the given type path, ie. returning from
2445 * (type).a.b to (type).a
2447 static void ascend_from_subtype(type_path_t *path)
2449 type_path_entry_t *top = get_type_path_top(path);
2451 path->top_type = top->type;
2453 size_t len = ARR_LEN(path->path);
2454 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2458 * Pop entries from the given type path until the given
2459 * path level is reached.
2461 static void ascend_to(type_path_t *path, size_t top_path_level)
2463 size_t len = ARR_LEN(path->path);
2465 while (len > top_path_level) {
2466 ascend_from_subtype(path);
2467 len = ARR_LEN(path->path);
2471 static bool walk_designator(type_path_t *path, const designator_t *designator,
2472 bool used_in_offsetof)
2474 for( ; designator != NULL; designator = designator->next) {
2475 type_path_entry_t *top = get_type_path_top(path);
2476 type_t *orig_type = top->type;
2478 type_t *type = skip_typeref(orig_type);
2480 if (designator->symbol != NULL) {
2481 symbol_t *symbol = designator->symbol;
2482 if (!is_type_compound(type)) {
2483 if (is_type_valid(type)) {
2484 errorf(&designator->source_position,
2485 "'.%Y' designator used for non-compound type '%T'",
2489 top->type = type_error_type;
2490 top->v.compound_entry = NULL;
2491 orig_type = type_error_type;
2493 declaration_t *declaration = type->compound.declaration;
2494 declaration_t *iter = declaration->scope.declarations;
2495 for( ; iter != NULL; iter = iter->next) {
2496 if (iter->symbol == symbol) {
2501 errorf(&designator->source_position,
2502 "'%T' has no member named '%Y'", orig_type, symbol);
2505 if (used_in_offsetof) {
2506 type_t *real_type = skip_typeref(iter->type);
2507 if (real_type->kind == TYPE_BITFIELD) {
2508 errorf(&designator->source_position,
2509 "offsetof designator '%Y' may not specify bitfield",
2515 top->type = orig_type;
2516 top->v.compound_entry = iter;
2517 orig_type = iter->type;
2520 expression_t *array_index = designator->array_index;
2521 assert(designator->array_index != NULL);
2523 if (!is_type_array(type)) {
2524 if (is_type_valid(type)) {
2525 errorf(&designator->source_position,
2526 "[%E] designator used for non-array type '%T'",
2527 array_index, orig_type);
2532 long index = fold_constant(array_index);
2533 if (!used_in_offsetof) {
2535 errorf(&designator->source_position,
2536 "array index [%E] must be positive", array_index);
2537 } else if (type->array.size_constant) {
2538 long array_size = type->array.size;
2539 if (index >= array_size) {
2540 errorf(&designator->source_position,
2541 "designator [%E] (%d) exceeds array size %d",
2542 array_index, index, array_size);
2547 top->type = orig_type;
2548 top->v.index = (size_t) index;
2549 orig_type = type->array.element_type;
2551 path->top_type = orig_type;
2553 if (designator->next != NULL) {
2554 descend_into_subtype(path);
2563 static void advance_current_object(type_path_t *path, size_t top_path_level)
2565 type_path_entry_t *top = get_type_path_top(path);
2567 type_t *type = skip_typeref(top->type);
2568 if (is_type_union(type)) {
2569 /* in unions only the first element is initialized */
2570 top->v.compound_entry = NULL;
2571 } else if (is_type_struct(type)) {
2572 declaration_t *entry = top->v.compound_entry;
2574 entry = entry->next;
2575 top->v.compound_entry = entry;
2576 if (entry != NULL) {
2577 path->top_type = entry->type;
2580 } else if (is_type_array(type)) {
2581 assert(is_type_array(type));
2585 if (!type->array.size_constant || top->v.index < type->array.size) {
2589 assert(!is_type_valid(type));
2593 /* we're past the last member of the current sub-aggregate, try if we
2594 * can ascend in the type hierarchy and continue with another subobject */
2595 size_t len = ARR_LEN(path->path);
2597 if (len > top_path_level) {
2598 ascend_from_subtype(path);
2599 advance_current_object(path, top_path_level);
2601 path->top_type = NULL;
2606 * skip until token is found.
2608 static void skip_until(int type)
2610 while (token.type != type) {
2611 if (token.type == T_EOF)
2618 * skip any {...} blocks until a closing bracket is reached.
2620 static void skip_initializers(void)
2622 if (token.type == '{')
2625 while (token.type != '}') {
2626 if (token.type == T_EOF)
2628 if (token.type == '{') {
2636 static initializer_t *create_empty_initializer(void)
2638 static initializer_t empty_initializer
2639 = { .list = { { INITIALIZER_LIST }, 0 } };
2640 return &empty_initializer;
2644 * Parse a part of an initialiser for a struct or union,
2646 static initializer_t *parse_sub_initializer(type_path_t *path,
2647 type_t *outer_type, size_t top_path_level,
2648 parse_initializer_env_t *env)
2650 if (token.type == '}') {
2651 /* empty initializer */
2652 return create_empty_initializer();
2655 type_t *orig_type = path->top_type;
2656 type_t *type = NULL;
2658 if (orig_type == NULL) {
2659 /* We are initializing an empty compound. */
2661 type = skip_typeref(orig_type);
2664 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2667 designator_t *designator = NULL;
2668 if (token.type == '.' || token.type == '[') {
2669 designator = parse_designation();
2670 goto finish_designator;
2671 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2672 /* GNU-style designator ("identifier: value") */
2673 designator = allocate_ast_zero(sizeof(designator[0]));
2674 designator->source_position = token.source_position;
2675 designator->symbol = token.v.symbol;
2680 /* reset path to toplevel, evaluate designator from there */
2681 ascend_to(path, top_path_level);
2682 if (!walk_designator(path, designator, false)) {
2683 /* can't continue after designation error */
2687 initializer_t *designator_initializer
2688 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2689 designator_initializer->designator.designator = designator;
2690 ARR_APP1(initializer_t*, initializers, designator_initializer);
2692 orig_type = path->top_type;
2693 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2698 if (token.type == '{') {
2699 if (type != NULL && is_type_scalar(type)) {
2700 sub = parse_scalar_initializer(type, env->must_be_constant);
2704 if (env->declaration != NULL) {
2705 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2706 env->declaration->symbol);
2708 errorf(HERE, "extra brace group at end of initializer");
2711 descend_into_subtype(path);
2713 add_anchor_token('}');
2714 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2716 rem_anchor_token('}');
2719 ascend_from_subtype(path);
2723 goto error_parse_next;
2727 /* must be an expression */
2728 expression_t *expression = parse_assignment_expression();
2730 if (env->must_be_constant && !is_initializer_constant(expression)) {
2731 errorf(&expression->base.source_position,
2732 "Initialisation expression '%E' is not constant\n",
2737 /* we are already outside, ... */
2738 type_t *const outer_type_skip = skip_typeref(outer_type);
2739 if (is_type_compound(outer_type_skip) &&
2740 !outer_type_skip->compound.declaration->init.complete) {
2741 goto error_parse_next;
2746 /* handle { "string" } special case */
2747 if ((expression->kind == EXPR_STRING_LITERAL
2748 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2749 && outer_type != NULL) {
2750 sub = initializer_from_expression(outer_type, expression);
2752 if (token.type == ',') {
2755 if (token.type != '}' && warning.other) {
2756 warningf(HERE, "excessive elements in initializer for type '%T'",
2759 /* TODO: eat , ... */
2764 /* descend into subtypes until expression matches type */
2766 orig_type = path->top_type;
2767 type = skip_typeref(orig_type);
2769 sub = initializer_from_expression(orig_type, expression);
2773 if (!is_type_valid(type)) {
2776 if (is_type_scalar(type)) {
2777 errorf(&expression->base.source_position,
2778 "expression '%E' doesn't match expected type '%T'",
2779 expression, orig_type);
2783 descend_into_subtype(path);
2787 /* update largest index of top array */
2788 const type_path_entry_t *first = &path->path[0];
2789 type_t *first_type = first->type;
2790 first_type = skip_typeref(first_type);
2791 if (is_type_array(first_type)) {
2792 size_t index = first->v.index;
2793 if (index > path->max_index)
2794 path->max_index = index;
2798 /* append to initializers list */
2799 ARR_APP1(initializer_t*, initializers, sub);
2802 if (warning.other) {
2803 if (env->declaration != NULL) {
2804 warningf(HERE, "excess elements in struct initializer for '%Y'",
2805 env->declaration->symbol);
2807 warningf(HERE, "excess elements in struct initializer");
2813 if (token.type == '}') {
2817 if (token.type == '}') {
2822 /* advance to the next declaration if we are not at the end */
2823 advance_current_object(path, top_path_level);
2824 orig_type = path->top_type;
2825 if (orig_type != NULL)
2826 type = skip_typeref(orig_type);
2832 size_t len = ARR_LEN(initializers);
2833 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2834 initializer_t *result = allocate_ast_zero(size);
2835 result->kind = INITIALIZER_LIST;
2836 result->list.len = len;
2837 memcpy(&result->list.initializers, initializers,
2838 len * sizeof(initializers[0]));
2840 DEL_ARR_F(initializers);
2841 ascend_to(path, top_path_level+1);
2846 skip_initializers();
2847 DEL_ARR_F(initializers);
2848 ascend_to(path, top_path_level+1);
2853 * Parses an initializer. Parsers either a compound literal
2854 * (env->declaration == NULL) or an initializer of a declaration.
2856 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2858 type_t *type = skip_typeref(env->type);
2859 initializer_t *result = NULL;
2862 if (is_type_scalar(type)) {
2863 result = parse_scalar_initializer(type, env->must_be_constant);
2864 } else if (token.type == '{') {
2868 memset(&path, 0, sizeof(path));
2869 path.top_type = env->type;
2870 path.path = NEW_ARR_F(type_path_entry_t, 0);
2872 descend_into_subtype(&path);
2874 add_anchor_token('}');
2875 result = parse_sub_initializer(&path, env->type, 1, env);
2876 rem_anchor_token('}');
2878 max_index = path.max_index;
2879 DEL_ARR_F(path.path);
2883 /* parse_scalar_initializer() also works in this case: we simply
2884 * have an expression without {} around it */
2885 result = parse_scalar_initializer(type, env->must_be_constant);
2888 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2889 * the array type size */
2890 if (is_type_array(type) && type->array.size_expression == NULL
2891 && result != NULL) {
2893 switch (result->kind) {
2894 case INITIALIZER_LIST:
2895 size = max_index + 1;
2898 case INITIALIZER_STRING:
2899 size = result->string.string.size;
2902 case INITIALIZER_WIDE_STRING:
2903 size = result->wide_string.string.size;
2906 case INITIALIZER_DESIGNATOR:
2907 case INITIALIZER_VALUE:
2908 /* can happen for parse errors */
2913 internal_errorf(HERE, "invalid initializer type");
2916 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2917 cnst->base.type = type_size_t;
2918 cnst->conste.v.int_value = size;
2920 type_t *new_type = duplicate_type(type);
2922 new_type->array.size_expression = cnst;
2923 new_type->array.size_constant = true;
2924 new_type->array.size = size;
2925 env->type = new_type;
2933 static declaration_t *append_declaration(declaration_t *declaration);
2935 static declaration_t *parse_compound_type_specifier(bool is_struct)
2937 gnu_attribute_t *attributes = NULL;
2938 decl_modifiers_t modifiers = 0;
2945 symbol_t *symbol = NULL;
2946 declaration_t *declaration = NULL;
2948 if (token.type == T___attribute__) {
2949 modifiers |= parse_attributes(&attributes);
2952 if (token.type == T_IDENTIFIER) {
2953 symbol = token.v.symbol;
2956 namespace_t const namespc =
2957 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2958 declaration = get_declaration(symbol, namespc);
2959 if (declaration != NULL) {
2960 if (declaration->parent_scope != scope &&
2961 (token.type == '{' || token.type == ';')) {
2963 } else if (declaration->init.complete &&
2964 token.type == '{') {
2965 assert(symbol != NULL);
2966 errorf(HERE, "multiple definitions of '%s %Y' (previous definition at %P)",
2967 is_struct ? "struct" : "union", symbol,
2968 &declaration->source_position);
2969 declaration->scope.declarations = NULL;
2972 } else if (token.type != '{') {
2974 parse_error_expected("while parsing struct type specifier",
2975 T_IDENTIFIER, '{', NULL);
2977 parse_error_expected("while parsing union type specifier",
2978 T_IDENTIFIER, '{', NULL);
2984 if (declaration == NULL) {
2985 declaration = allocate_declaration_zero();
2986 declaration->namespc =
2987 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2988 declaration->source_position = token.source_position;
2989 declaration->symbol = symbol;
2990 declaration->parent_scope = scope;
2991 if (symbol != NULL) {
2992 environment_push(declaration);
2994 append_declaration(declaration);
2997 if (token.type == '{') {
2998 declaration->init.complete = true;
3000 parse_compound_type_entries(declaration);
3001 modifiers |= parse_attributes(&attributes);
3004 declaration->modifiers |= modifiers;
3008 static void parse_enum_entries(type_t *const enum_type)
3012 if (token.type == '}') {
3014 errorf(HERE, "empty enum not allowed");
3018 add_anchor_token('}');
3020 if (token.type != T_IDENTIFIER) {
3021 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
3023 rem_anchor_token('}');
3027 declaration_t *const entry = allocate_declaration_zero();
3028 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
3029 entry->type = enum_type;
3030 entry->symbol = token.v.symbol;
3031 entry->source_position = token.source_position;
3034 if (token.type == '=') {
3036 expression_t *value = parse_constant_expression();
3038 value = create_implicit_cast(value, enum_type);
3039 entry->init.enum_value = value;
3044 record_declaration(entry, false);
3046 if (token.type != ',')
3049 } while (token.type != '}');
3050 rem_anchor_token('}');
3058 static type_t *parse_enum_specifier(void)
3060 gnu_attribute_t *attributes = NULL;
3061 declaration_t *declaration;
3065 if (token.type == T_IDENTIFIER) {
3066 symbol = token.v.symbol;
3069 declaration = get_declaration(symbol, NAMESPACE_ENUM);
3070 } else if (token.type != '{') {
3071 parse_error_expected("while parsing enum type specifier",
3072 T_IDENTIFIER, '{', NULL);
3079 if (declaration == NULL) {
3080 declaration = allocate_declaration_zero();
3081 declaration->namespc = NAMESPACE_ENUM;
3082 declaration->source_position = token.source_position;
3083 declaration->symbol = symbol;
3084 declaration->parent_scope = scope;
3087 type_t *const type = allocate_type_zero(TYPE_ENUM);
3088 type->enumt.declaration = declaration;
3090 if (token.type == '{') {
3091 if (declaration->init.complete) {
3092 errorf(HERE, "multiple definitions of enum %Y", symbol);
3094 if (symbol != NULL) {
3095 environment_push(declaration);
3097 append_declaration(declaration);
3098 declaration->init.complete = true;
3100 parse_enum_entries(type);
3101 parse_attributes(&attributes);
3108 * if a symbol is a typedef to another type, return true
3110 static bool is_typedef_symbol(symbol_t *symbol)
3112 const declaration_t *const declaration =
3113 get_declaration(symbol, NAMESPACE_NORMAL);
3115 declaration != NULL &&
3116 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
3119 static type_t *parse_typeof(void)
3126 add_anchor_token(')');
3128 expression_t *expression = NULL;
3130 bool old_type_prop = in_type_prop;
3131 bool old_gcc_extension = in_gcc_extension;
3132 in_type_prop = true;
3134 while (token.type == T___extension__) {
3135 /* This can be a prefix to a typename or an expression. */
3137 in_gcc_extension = true;
3139 switch (token.type) {
3141 if (is_typedef_symbol(token.v.symbol)) {
3142 type = parse_typename();
3144 expression = parse_expression();
3145 type = expression->base.type;
3150 type = parse_typename();
3154 expression = parse_expression();
3155 type = expression->base.type;
3158 in_type_prop = old_type_prop;
3159 in_gcc_extension = old_gcc_extension;
3161 rem_anchor_token(')');
3164 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
3165 typeof_type->typeoft.expression = expression;
3166 typeof_type->typeoft.typeof_type = type;
3173 typedef enum specifiers_t {
3174 SPECIFIER_SIGNED = 1 << 0,
3175 SPECIFIER_UNSIGNED = 1 << 1,
3176 SPECIFIER_LONG = 1 << 2,
3177 SPECIFIER_INT = 1 << 3,
3178 SPECIFIER_DOUBLE = 1 << 4,
3179 SPECIFIER_CHAR = 1 << 5,
3180 SPECIFIER_SHORT = 1 << 6,
3181 SPECIFIER_LONG_LONG = 1 << 7,
3182 SPECIFIER_FLOAT = 1 << 8,
3183 SPECIFIER_BOOL = 1 << 9,
3184 SPECIFIER_VOID = 1 << 10,
3185 SPECIFIER_INT8 = 1 << 11,
3186 SPECIFIER_INT16 = 1 << 12,
3187 SPECIFIER_INT32 = 1 << 13,
3188 SPECIFIER_INT64 = 1 << 14,
3189 SPECIFIER_INT128 = 1 << 15,
3190 SPECIFIER_COMPLEX = 1 << 16,
3191 SPECIFIER_IMAGINARY = 1 << 17,
3194 static type_t *create_builtin_type(symbol_t *const symbol,
3195 type_t *const real_type)
3197 type_t *type = allocate_type_zero(TYPE_BUILTIN);
3198 type->builtin.symbol = symbol;
3199 type->builtin.real_type = real_type;
3201 type_t *result = typehash_insert(type);
3202 if (type != result) {
3209 static type_t *get_typedef_type(symbol_t *symbol)
3211 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
3212 if (declaration == NULL ||
3213 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
3216 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
3217 type->typedeft.declaration = declaration;
3223 * check for the allowed MS alignment values.
3225 static bool check_alignment_value(long long intvalue)
3227 if (intvalue < 1 || intvalue > 8192) {
3228 errorf(HERE, "illegal alignment value");
3231 unsigned v = (unsigned)intvalue;
3232 for (unsigned i = 1; i <= 8192; i += i) {
3236 errorf(HERE, "alignment must be power of two");
3240 #define DET_MOD(name, tag) do { \
3241 if (*modifiers & tag && warning.other) warningf(HERE, #name " used more than once"); \
3242 *modifiers |= tag; \
3245 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
3247 decl_modifiers_t *modifiers = &specifiers->modifiers;
3250 if (token.type == T_restrict) {
3252 DET_MOD(restrict, DM_RESTRICT);
3254 } else if (token.type != T_IDENTIFIER)
3256 symbol_t *symbol = token.v.symbol;
3257 if (symbol == sym_align) {
3260 if (token.type != T_INTEGER)
3262 if (check_alignment_value(token.v.intvalue)) {
3263 if (specifiers->alignment != 0 && warning.other)
3264 warningf(HERE, "align used more than once");
3265 specifiers->alignment = (unsigned char)token.v.intvalue;
3269 } else if (symbol == sym_allocate) {
3272 if (token.type != T_IDENTIFIER)
3274 (void)token.v.symbol;
3276 } else if (symbol == sym_dllimport) {
3278 DET_MOD(dllimport, DM_DLLIMPORT);
3279 } else if (symbol == sym_dllexport) {
3281 DET_MOD(dllexport, DM_DLLEXPORT);
3282 } else if (symbol == sym_thread) {
3284 DET_MOD(thread, DM_THREAD);
3285 } else if (symbol == sym_naked) {
3287 DET_MOD(naked, DM_NAKED);
3288 } else if (symbol == sym_noinline) {
3290 DET_MOD(noinline, DM_NOINLINE);
3291 } else if (symbol == sym_noreturn) {
3293 DET_MOD(noreturn, DM_NORETURN);
3294 } else if (symbol == sym_nothrow) {
3296 DET_MOD(nothrow, DM_NOTHROW);
3297 } else if (symbol == sym_novtable) {
3299 DET_MOD(novtable, DM_NOVTABLE);
3300 } else if (symbol == sym_property) {
3304 bool is_get = false;
3305 if (token.type != T_IDENTIFIER)
3307 if (token.v.symbol == sym_get) {
3309 } else if (token.v.symbol == sym_put) {
3311 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3316 if (token.type != T_IDENTIFIER)
3319 if (specifiers->get_property_sym != NULL) {
3320 errorf(HERE, "get property name already specified");
3322 specifiers->get_property_sym = token.v.symbol;
3325 if (specifiers->put_property_sym != NULL) {
3326 errorf(HERE, "put property name already specified");
3328 specifiers->put_property_sym = token.v.symbol;
3332 if (token.type == ',') {
3339 } else if (symbol == sym_selectany) {
3341 DET_MOD(selectany, DM_SELECTANY);
3342 } else if (symbol == sym_uuid) {
3345 if (token.type != T_STRING_LITERAL)
3349 } else if (symbol == sym_deprecated) {
3351 if (specifiers->deprecated != 0 && warning.other)
3352 warningf(HERE, "deprecated used more than once");
3353 specifiers->deprecated = 1;
3354 if (token.type == '(') {
3356 if (token.type == T_STRING_LITERAL) {
3357 specifiers->deprecated_string = token.v.string.begin;
3360 errorf(HERE, "string literal expected");
3364 } else if (symbol == sym_noalias) {
3366 DET_MOD(noalias, DM_NOALIAS);
3369 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
3371 if (token.type == '(')
3375 if (token.type == ',')
3382 static declaration_t *create_error_declaration(symbol_t *symbol, storage_class_tag_t storage_class)
3384 declaration_t *const decl = allocate_declaration_zero();
3385 decl->source_position = *HERE;
3386 decl->declared_storage_class = storage_class;
3387 decl->storage_class =
3388 storage_class != STORAGE_CLASS_NONE || scope == file_scope ?
3389 storage_class : STORAGE_CLASS_AUTO;
3390 decl->symbol = symbol;
3391 decl->implicit = true;
3392 record_declaration(decl, false);
3397 * Finish the construction of a struct type by calculating
3398 * its size, offsets, alignment.
3400 static void finish_struct_type(compound_type_t *type) {
3401 if (type->declaration == NULL)
3403 declaration_t *struct_decl = type->declaration;
3404 if (! struct_decl->init.complete)
3409 il_alignment_t alignment = 1;
3410 bool need_pad = false;
3412 declaration_t *entry = struct_decl->scope.declarations;
3413 for (; entry != NULL; entry = entry->next) {
3414 if (entry->namespc != NAMESPACE_NORMAL)
3417 type_t *m_type = skip_typeref(entry->type);
3418 if (! is_type_valid(m_type)) {
3419 /* simply ignore errors here */
3422 il_alignment_t m_alignment = m_type->base.alignment;
3423 if (m_alignment > alignment)
3424 alignment = m_alignment;
3426 offset = (size + m_alignment - 1) & -m_alignment;
3430 entry->offset = offset;
3431 size = offset + m_type->base.size;
3433 if (type->base.alignment != 0) {
3434 alignment = type->base.alignment;
3437 offset = (size + alignment - 1) & -alignment;
3441 if (warning.padded && need_pad) {
3442 warningf(&struct_decl->source_position,
3443 "'%#T' needs padding", type, struct_decl->symbol);
3445 if (warning.packed && !need_pad) {
3446 warningf(&struct_decl->source_position,
3447 "superfluous packed attribute on '%#T'",
3448 type, struct_decl->symbol);
3451 type->base.size = offset;
3452 type->base.alignment = alignment;
3456 * Finish the construction of an union type by calculating
3457 * its size and alignment.
3459 static void finish_union_type(compound_type_t *type) {
3460 if (type->declaration == NULL)
3462 declaration_t *union_decl = type->declaration;
3463 if (! union_decl->init.complete)
3467 il_alignment_t alignment = 1;
3469 declaration_t *entry = union_decl->scope.declarations;
3470 for (; entry != NULL; entry = entry->next) {
3471 if (entry->namespc != NAMESPACE_NORMAL)
3474 type_t *m_type = skip_typeref(entry->type);
3475 if (! is_type_valid(m_type))
3479 if (m_type->base.size > size)
3480 size = m_type->base.size;
3481 if (m_type->base.alignment > alignment)
3482 alignment = m_type->base.alignment;
3484 if (type->base.alignment != 0) {
3485 alignment = type->base.alignment;
3487 size = (size + alignment - 1) & -alignment;
3488 type->base.size = size;
3489 type->base.alignment = alignment;
3492 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3494 type_t *type = NULL;
3495 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3496 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3497 unsigned type_specifiers = 0;
3498 bool newtype = false;
3499 bool saw_error = false;
3500 bool old_gcc_extension = in_gcc_extension;
3502 specifiers->source_position = token.source_position;
3505 specifiers->modifiers
3506 |= parse_attributes(&specifiers->gnu_attributes);
3507 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3508 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3510 switch (token.type) {
3513 #define MATCH_STORAGE_CLASS(token, class) \
3515 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
3516 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3518 specifiers->declared_storage_class = class; \
3522 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3523 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3524 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3525 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3526 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3531 add_anchor_token(')');
3532 parse_microsoft_extended_decl_modifier(specifiers);
3533 rem_anchor_token(')');
3538 switch (specifiers->declared_storage_class) {
3539 case STORAGE_CLASS_NONE:
3540 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
3543 case STORAGE_CLASS_EXTERN:
3544 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
3547 case STORAGE_CLASS_STATIC:
3548 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
3552 errorf(HERE, "multiple storage classes in declaration specifiers");
3558 /* type qualifiers */
3559 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3561 qualifiers |= qualifier; \
3565 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3566 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3567 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3568 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3569 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3570 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3571 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3572 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3574 case T___extension__:
3576 in_gcc_extension = true;
3579 /* type specifiers */
3580 #define MATCH_SPECIFIER(token, specifier, name) \
3583 if (type_specifiers & specifier) { \
3584 errorf(HERE, "multiple " name " type specifiers given"); \
3586 type_specifiers |= specifier; \
3590 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3591 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3592 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3593 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3594 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3595 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3596 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3597 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3598 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3599 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3600 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3601 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3602 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3603 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3604 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3605 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3607 case T__forceinline:
3608 /* only in microsoft mode */
3609 specifiers->modifiers |= DM_FORCEINLINE;
3614 specifiers->is_inline = true;
3619 if (type_specifiers & SPECIFIER_LONG_LONG) {
3620 errorf(HERE, "multiple type specifiers given");
3621 } else if (type_specifiers & SPECIFIER_LONG) {
3622 type_specifiers |= SPECIFIER_LONG_LONG;
3624 type_specifiers |= SPECIFIER_LONG;
3629 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3631 type->compound.declaration = parse_compound_type_specifier(true);
3632 finish_struct_type(&type->compound);
3636 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3637 type->compound.declaration = parse_compound_type_specifier(false);
3638 if (type->compound.declaration->modifiers & DM_TRANSPARENT_UNION)
3639 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3640 finish_union_type(&type->compound);
3644 type = parse_enum_specifier();
3647 type = parse_typeof();
3649 case T___builtin_va_list:
3650 type = duplicate_type(type_valist);
3654 case T_IDENTIFIER: {
3655 /* only parse identifier if we haven't found a type yet */
3656 if (type != NULL || type_specifiers != 0) {
3657 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3658 * declaration, so it doesn't generate errors about expecting '(' or
3660 switch (look_ahead(1)->type) {
3667 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3670 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3675 goto finish_specifiers;
3679 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3680 if (typedef_type == NULL) {
3681 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3682 * declaration, so it doesn't generate 'implicit int' followed by more
3683 * errors later on. */
3684 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3689 errorf(HERE, "%K does not name a type", &token);
3691 declaration_t *const decl =
3692 create_error_declaration(token.v.symbol, STORAGE_CLASS_TYPEDEF);
3694 type = allocate_type_zero(TYPE_TYPEDEF);
3695 type->typedeft.declaration = decl;
3699 if (la1_type == '*')
3700 goto finish_specifiers;
3705 goto finish_specifiers;
3710 type = typedef_type;
3714 /* function specifier */
3716 goto finish_specifiers;
3721 in_gcc_extension = old_gcc_extension;
3723 if (type == NULL || (saw_error && type_specifiers != 0)) {
3724 atomic_type_kind_t atomic_type;
3726 /* match valid basic types */
3727 switch(type_specifiers) {
3728 case SPECIFIER_VOID:
3729 atomic_type = ATOMIC_TYPE_VOID;
3731 case SPECIFIER_CHAR:
3732 atomic_type = ATOMIC_TYPE_CHAR;
3734 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3735 atomic_type = ATOMIC_TYPE_SCHAR;
3737 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3738 atomic_type = ATOMIC_TYPE_UCHAR;
3740 case SPECIFIER_SHORT:
3741 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3742 case SPECIFIER_SHORT | SPECIFIER_INT:
3743 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3744 atomic_type = ATOMIC_TYPE_SHORT;
3746 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3747 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3748 atomic_type = ATOMIC_TYPE_USHORT;
3751 case SPECIFIER_SIGNED:
3752 case SPECIFIER_SIGNED | SPECIFIER_INT:
3753 atomic_type = ATOMIC_TYPE_INT;
3755 case SPECIFIER_UNSIGNED:
3756 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3757 atomic_type = ATOMIC_TYPE_UINT;
3759 case SPECIFIER_LONG:
3760 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3761 case SPECIFIER_LONG | SPECIFIER_INT:
3762 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3763 atomic_type = ATOMIC_TYPE_LONG;
3765 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3766 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3767 atomic_type = ATOMIC_TYPE_ULONG;
3770 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3771 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3772 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3773 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3775 atomic_type = ATOMIC_TYPE_LONGLONG;
3776 goto warn_about_long_long;
3778 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3779 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3781 atomic_type = ATOMIC_TYPE_ULONGLONG;
3782 warn_about_long_long:
3783 if (warning.long_long) {
3784 warningf(&specifiers->source_position,
3785 "ISO C90 does not support 'long long'");
3789 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3790 atomic_type = unsigned_int8_type_kind;
3793 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3794 atomic_type = unsigned_int16_type_kind;
3797 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3798 atomic_type = unsigned_int32_type_kind;
3801 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3802 atomic_type = unsigned_int64_type_kind;
3805 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3806 atomic_type = unsigned_int128_type_kind;
3809 case SPECIFIER_INT8:
3810 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3811 atomic_type = int8_type_kind;
3814 case SPECIFIER_INT16:
3815 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3816 atomic_type = int16_type_kind;
3819 case SPECIFIER_INT32:
3820 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3821 atomic_type = int32_type_kind;
3824 case SPECIFIER_INT64:
3825 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3826 atomic_type = int64_type_kind;
3829 case SPECIFIER_INT128:
3830 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3831 atomic_type = int128_type_kind;
3834 case SPECIFIER_FLOAT:
3835 atomic_type = ATOMIC_TYPE_FLOAT;
3837 case SPECIFIER_DOUBLE:
3838 atomic_type = ATOMIC_TYPE_DOUBLE;
3840 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3841 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3843 case SPECIFIER_BOOL:
3844 atomic_type = ATOMIC_TYPE_BOOL;
3846 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3847 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3848 atomic_type = ATOMIC_TYPE_FLOAT;
3850 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3851 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3852 atomic_type = ATOMIC_TYPE_DOUBLE;
3854 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3855 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3856 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3859 /* invalid specifier combination, give an error message */
3860 if (type_specifiers == 0) {
3865 if (warning.implicit_int) {
3866 warningf(HERE, "no type specifiers in declaration, using 'int'");
3868 atomic_type = ATOMIC_TYPE_INT;
3871 errorf(HERE, "no type specifiers given in declaration");
3873 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3874 (type_specifiers & SPECIFIER_UNSIGNED)) {
3875 errorf(HERE, "signed and unsigned specifiers given");
3876 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3877 errorf(HERE, "only integer types can be signed or unsigned");
3879 errorf(HERE, "multiple datatypes in declaration");
3884 if (type_specifiers & SPECIFIER_COMPLEX) {
3885 type = allocate_type_zero(TYPE_COMPLEX);
3886 type->complex.akind = atomic_type;
3887 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3888 type = allocate_type_zero(TYPE_IMAGINARY);
3889 type->imaginary.akind = atomic_type;
3891 type = allocate_type_zero(TYPE_ATOMIC);
3892 type->atomic.akind = atomic_type;
3895 } else if (type_specifiers != 0) {
3896 errorf(HERE, "multiple datatypes in declaration");
3899 /* FIXME: check type qualifiers here */
3901 type->base.qualifiers = qualifiers;
3902 type->base.modifiers = modifiers;
3904 type_t *result = typehash_insert(type);
3905 if (newtype && result != type) {
3909 specifiers->type = result;
3913 specifiers->type = type_error_type;
3917 static type_qualifiers_t parse_type_qualifiers(void)
3919 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3922 switch(token.type) {
3923 /* type qualifiers */
3924 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3925 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3926 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3927 /* microsoft extended type modifiers */
3928 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3929 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3930 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3931 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3932 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3941 * Parses an K&R identifier list and return a list of declarations.
3943 * @param last points to the last declaration in the list
3944 * @return the list of declarations
3946 static declaration_t *parse_identifier_list(declaration_t **last)
3948 declaration_t *declarations = NULL;
3949 declaration_t *last_declaration = NULL;
3951 declaration_t *const declaration = allocate_declaration_zero();
3952 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3953 declaration->source_position = token.source_position;
3954 declaration->symbol = token.v.symbol;
3957 if (last_declaration != NULL) {
3958 last_declaration->next = declaration;
3960 declarations = declaration;
3962 last_declaration = declaration;
3964 if (token.type != ',') {
3968 } while (token.type == T_IDENTIFIER);
3970 *last = last_declaration;
3971 return declarations;
3974 static type_t *automatic_type_conversion(type_t *orig_type);
3976 static void semantic_parameter(declaration_t *declaration)
3978 /* TODO: improve error messages */
3979 source_position_t const* const pos = &declaration->source_position;
3981 switch (declaration->declared_storage_class) {
3982 case STORAGE_CLASS_TYPEDEF:
3983 errorf(pos, "typedef not allowed in parameter list");
3986 /* Allowed storage classes */
3987 case STORAGE_CLASS_NONE:
3988 case STORAGE_CLASS_REGISTER:
3992 errorf(pos, "parameter may only have none or register storage class");
3996 type_t *const orig_type = declaration->type;
3997 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
3998 * sugar. Turn it into a pointer.
3999 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
4000 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
4002 type_t *const type = automatic_type_conversion(orig_type);
4003 declaration->type = type;
4005 if (is_type_incomplete(skip_typeref(type))) {
4006 errorf(pos, "parameter '%#T' is of incomplete type",
4007 orig_type, declaration->symbol);
4011 static declaration_t *parse_parameter(void)
4013 declaration_specifiers_t specifiers;
4014 memset(&specifiers, 0, sizeof(specifiers));
4016 parse_declaration_specifiers(&specifiers);
4018 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
4024 * Parses a function type parameter list and return a list of declarations.
4026 * @param last point to the last element of the list
4027 * @return the parameter list
4029 static declaration_t *parse_parameters(function_type_t *type, declaration_t **last)
4031 declaration_t *declarations = NULL;
4034 add_anchor_token(')');
4035 int saved_comma_state = save_and_reset_anchor_state(',');
4037 if (token.type == T_IDENTIFIER &&
4038 !is_typedef_symbol(token.v.symbol)) {
4039 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
4040 if (la1_type == ',' || la1_type == ')') {
4041 type->kr_style_parameters = true;
4042 declarations = parse_identifier_list(last);
4043 goto parameters_finished;
4047 if (token.type == ')') {
4048 type->unspecified_parameters = 1;
4049 goto parameters_finished;
4052 declaration_t *declaration;
4053 declaration_t *last_declaration = NULL;
4054 function_parameter_t *parameter;
4055 function_parameter_t *last_parameter = NULL;
4058 switch(token.type) {
4062 goto parameters_finished;
4065 case T___extension__:
4067 declaration = parse_parameter();
4069 /* func(void) is not a parameter */
4070 if (last_parameter == NULL
4071 && token.type == ')'
4072 && declaration->symbol == NULL
4073 && skip_typeref(declaration->type) == type_void) {
4074 goto parameters_finished;
4076 semantic_parameter(declaration);
4078 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
4079 memset(parameter, 0, sizeof(parameter[0]));
4080 parameter->type = declaration->type;
4082 if (last_parameter != NULL) {
4083 last_declaration->next = declaration;
4084 last_parameter->next = parameter;
4086 type->parameters = parameter;
4087 declarations = declaration;
4089 last_parameter = parameter;
4090 last_declaration = declaration;
4094 goto parameters_finished;
4096 if (token.type != ',') {
4097 goto parameters_finished;
4103 parameters_finished:
4104 rem_anchor_token(')');
4107 restore_anchor_state(',', saved_comma_state);
4108 *last = last_declaration;
4109 return declarations;
4112 restore_anchor_state(',', saved_comma_state);
4117 typedef enum construct_type_kind_t {
4122 } construct_type_kind_t;
4124 typedef struct construct_type_t construct_type_t;
4125 struct construct_type_t {
4126 construct_type_kind_t kind;
4127 construct_type_t *next;
4130 typedef struct parsed_pointer_t parsed_pointer_t;
4131 struct parsed_pointer_t {
4132 construct_type_t construct_type;
4133 type_qualifiers_t type_qualifiers;
4136 typedef struct construct_function_type_t construct_function_type_t;
4137 struct construct_function_type_t {
4138 construct_type_t construct_type;
4139 type_t *function_type;
4142 typedef struct parsed_array_t parsed_array_t;
4143 struct parsed_array_t {
4144 construct_type_t construct_type;
4145 type_qualifiers_t type_qualifiers;
4151 typedef struct construct_base_type_t construct_base_type_t;
4152 struct construct_base_type_t {
4153 construct_type_t construct_type;
4157 static construct_type_t *parse_pointer_declarator(void)
4161 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
4162 memset(pointer, 0, sizeof(pointer[0]));
4163 pointer->construct_type.kind = CONSTRUCT_POINTER;
4164 pointer->type_qualifiers = parse_type_qualifiers();
4166 return (construct_type_t*) pointer;
4169 static construct_type_t *parse_array_declarator(void)
4172 add_anchor_token(']');
4174 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
4175 memset(array, 0, sizeof(array[0]));
4176 array->construct_type.kind = CONSTRUCT_ARRAY;
4178 if (token.type == T_static) {
4179 array->is_static = true;
4183 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4184 if (type_qualifiers != 0) {
4185 if (token.type == T_static) {
4186 array->is_static = true;
4190 array->type_qualifiers = type_qualifiers;
4192 if (token.type == '*' && look_ahead(1)->type == ']') {
4193 array->is_variable = true;
4195 } else if (token.type != ']') {
4196 array->size = parse_assignment_expression();
4199 rem_anchor_token(']');
4203 return (construct_type_t*) array;
4206 static construct_type_t *parse_function_declarator(declaration_t *declaration)
4209 if (declaration != NULL) {
4210 type = allocate_type_zero(TYPE_FUNCTION);
4212 unsigned mask = declaration->modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
4214 if (mask & (mask-1)) {
4215 const char *first = NULL, *second = NULL;
4217 /* more than one calling convention set */
4218 if (declaration->modifiers & DM_CDECL) {
4219 if (first == NULL) first = "cdecl";
4220 else if (second == NULL) second = "cdecl";
4222 if (declaration->modifiers & DM_STDCALL) {
4223 if (first == NULL) first = "stdcall";
4224 else if (second == NULL) second = "stdcall";
4226 if (declaration->modifiers & DM_FASTCALL) {
4227 if (first == NULL) first = "fastcall";
4228 else if (second == NULL) second = "fastcall";
4230 if (declaration->modifiers & DM_THISCALL) {
4231 if (first == NULL) first = "thiscall";
4232 else if (second == NULL) second = "thiscall";
4234 errorf(&declaration->source_position, "%s and %s attributes are not compatible", first, second);
4237 if (declaration->modifiers & DM_CDECL)
4238 type->function.calling_convention = CC_CDECL;
4239 else if (declaration->modifiers & DM_STDCALL)
4240 type->function.calling_convention = CC_STDCALL;
4241 else if (declaration->modifiers & DM_FASTCALL)
4242 type->function.calling_convention = CC_FASTCALL;
4243 else if (declaration->modifiers & DM_THISCALL)
4244 type->function.calling_convention = CC_THISCALL;
4246 type = allocate_type_zero(TYPE_FUNCTION);
4249 declaration_t *last;
4250 declaration_t *parameters = parse_parameters(&type->function, &last);
4251 if (declaration != NULL) {
4252 declaration->scope.declarations = parameters;
4253 declaration->scope.last_declaration = last;
4256 construct_function_type_t *construct_function_type =
4257 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
4258 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
4259 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
4260 construct_function_type->function_type = type;
4262 return &construct_function_type->construct_type;
4265 static void fix_declaration_type(declaration_t *declaration)
4267 decl_modifiers_t declaration_modifiers = declaration->modifiers;
4268 type_modifiers_t type_modifiers = declaration->type->base.modifiers;
4270 if (declaration_modifiers & DM_TRANSPARENT_UNION)
4271 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4273 if (declaration->type->base.modifiers == type_modifiers)
4276 type_t *copy = duplicate_type(declaration->type);
4277 copy->base.modifiers = type_modifiers;
4279 type_t *result = typehash_insert(copy);
4280 if (result != copy) {
4281 obstack_free(type_obst, copy);
4284 declaration->type = result;
4287 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
4288 bool may_be_abstract)
4290 /* construct a single linked list of construct_type_t's which describe
4291 * how to construct the final declarator type */
4292 construct_type_t *first = NULL;
4293 construct_type_t *last = NULL;
4294 gnu_attribute_t *attributes = NULL;
4296 decl_modifiers_t modifiers = parse_attributes(&attributes);
4299 while (token.type == '*') {
4300 construct_type_t *type = parse_pointer_declarator();
4310 /* TODO: find out if this is correct */
4311 modifiers |= parse_attributes(&attributes);
4314 if (declaration != NULL)
4315 declaration->modifiers |= modifiers;
4317 construct_type_t *inner_types = NULL;
4319 switch(token.type) {
4321 if (declaration == NULL) {
4322 errorf(HERE, "no identifier expected in typename");
4324 declaration->symbol = token.v.symbol;
4325 declaration->source_position = token.source_position;
4331 add_anchor_token(')');
4332 inner_types = parse_inner_declarator(declaration, may_be_abstract);
4333 if (inner_types != NULL) {
4334 /* All later declarators only modify the return type, not declaration */
4337 rem_anchor_token(')');
4341 if (may_be_abstract)
4343 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4348 construct_type_t *p = last;
4351 construct_type_t *type;
4352 switch(token.type) {
4354 type = parse_function_declarator(declaration);
4357 type = parse_array_declarator();
4360 goto declarator_finished;
4363 /* insert in the middle of the list (behind p) */
4365 type->next = p->next;
4376 declarator_finished:
4377 /* append inner_types at the end of the list, we don't to set last anymore
4378 * as it's not needed anymore */
4380 assert(first == NULL);
4381 first = inner_types;
4383 last->next = inner_types;
4391 static void parse_declaration_attributes(declaration_t *declaration)
4393 gnu_attribute_t *attributes = NULL;
4394 decl_modifiers_t modifiers = parse_attributes(&attributes);
4396 if (declaration == NULL)
4399 declaration->modifiers |= modifiers;
4400 /* check if we have these stupid mode attributes... */
4401 type_t *old_type = declaration->type;
4402 if (old_type == NULL)
4405 gnu_attribute_t *attribute = attributes;
4406 for ( ; attribute != NULL; attribute = attribute->next) {
4407 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
4410 atomic_type_kind_t akind = attribute->u.akind;
4411 if (!is_type_signed(old_type)) {
4413 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
4414 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
4415 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
4416 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
4418 panic("invalid akind in mode attribute");
4422 = make_atomic_type(akind, old_type->base.qualifiers);
4426 static type_t *construct_declarator_type(construct_type_t *construct_list,
4429 construct_type_t *iter = construct_list;
4430 for( ; iter != NULL; iter = iter->next) {
4431 switch(iter->kind) {
4432 case CONSTRUCT_INVALID:
4433 internal_errorf(HERE, "invalid type construction found");
4434 case CONSTRUCT_FUNCTION: {
4435 construct_function_type_t *construct_function_type
4436 = (construct_function_type_t*) iter;
4438 type_t *function_type = construct_function_type->function_type;
4440 function_type->function.return_type = type;
4442 type_t *skipped_return_type = skip_typeref(type);
4444 if (is_type_function(skipped_return_type)) {
4445 errorf(HERE, "function returning function is not allowed");
4446 } else if (is_type_array(skipped_return_type)) {
4447 errorf(HERE, "function returning array is not allowed");
4449 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4451 "type qualifiers in return type of function type are meaningless");
4455 type = function_type;
4459 case CONSTRUCT_POINTER: {
4460 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4461 type = make_pointer_type(type, parsed_pointer->type_qualifiers);
4465 case CONSTRUCT_ARRAY: {
4466 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4467 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4469 expression_t *size_expression = parsed_array->size;
4470 if (size_expression != NULL) {
4472 = create_implicit_cast(size_expression, type_size_t);
4475 array_type->base.qualifiers = parsed_array->type_qualifiers;
4476 array_type->array.element_type = type;
4477 array_type->array.is_static = parsed_array->is_static;
4478 array_type->array.is_variable = parsed_array->is_variable;
4479 array_type->array.size_expression = size_expression;
4481 if (size_expression != NULL) {
4482 if (is_constant_expression(size_expression)) {
4483 array_type->array.size_constant = true;
4484 array_type->array.size
4485 = fold_constant(size_expression);
4487 array_type->array.is_vla = true;
4491 type_t *skipped_type = skip_typeref(type);
4493 if (is_type_incomplete(skipped_type)) {
4494 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4495 } else if (is_type_function(skipped_type)) {
4496 errorf(HERE, "array of functions is not allowed");
4503 type_t *hashed_type = typehash_insert(type);
4504 if (hashed_type != type) {
4505 /* the function type was constructed earlier freeing it here will
4506 * destroy other types... */
4507 if (iter->kind != CONSTRUCT_FUNCTION) {
4517 static declaration_t *parse_declarator(
4518 const declaration_specifiers_t *specifiers, bool may_be_abstract)
4520 declaration_t *const declaration = allocate_declaration_zero();
4521 declaration->source_position = specifiers->source_position;
4522 declaration->declared_storage_class = specifiers->declared_storage_class;
4523 declaration->modifiers = specifiers->modifiers;
4524 declaration->deprecated_string = specifiers->deprecated_string;
4525 declaration->get_property_sym = specifiers->get_property_sym;
4526 declaration->put_property_sym = specifiers->put_property_sym;
4527 declaration->is_inline = specifiers->is_inline;
4529 declaration->storage_class = specifiers->declared_storage_class;
4530 if (declaration->storage_class == STORAGE_CLASS_NONE &&
4531 scope != file_scope) {
4532 declaration->storage_class = STORAGE_CLASS_AUTO;
4535 if (specifiers->alignment != 0) {
4536 /* TODO: add checks here */
4537 declaration->alignment = specifiers->alignment;
4540 construct_type_t *construct_type
4541 = parse_inner_declarator(declaration, may_be_abstract);
4542 type_t *const type = specifiers->type;
4543 declaration->type = construct_declarator_type(construct_type, type);
4545 parse_declaration_attributes(declaration);
4547 fix_declaration_type(declaration);
4549 if (construct_type != NULL) {
4550 obstack_free(&temp_obst, construct_type);
4556 static type_t *parse_abstract_declarator(type_t *base_type)
4558 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4560 type_t *result = construct_declarator_type(construct_type, base_type);
4561 if (construct_type != NULL) {
4562 obstack_free(&temp_obst, construct_type);
4568 static declaration_t *append_declaration(declaration_t* const declaration)
4570 if (last_declaration != NULL) {
4571 last_declaration->next = declaration;
4573 scope->declarations = declaration;
4575 last_declaration = declaration;
4580 * Check if the declaration of main is suspicious. main should be a
4581 * function with external linkage, returning int, taking either zero
4582 * arguments, two, or three arguments of appropriate types, ie.
4584 * int main([ int argc, char **argv [, char **env ] ]).
4586 * @param decl the declaration to check
4587 * @param type the function type of the declaration
4589 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
4591 if (decl->storage_class == STORAGE_CLASS_STATIC) {
4592 warningf(&decl->source_position,
4593 "'main' is normally a non-static function");
4595 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4596 warningf(&decl->source_position,
4597 "return type of 'main' should be 'int', but is '%T'",
4598 func_type->return_type);
4600 const function_parameter_t *parm = func_type->parameters;
4602 type_t *const first_type = parm->type;
4603 if (!types_compatible(skip_typeref(first_type), type_int)) {
4604 warningf(&decl->source_position,
4605 "first argument of 'main' should be 'int', but is '%T'", first_type);
4609 type_t *const second_type = parm->type;
4610 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4611 warningf(&decl->source_position,
4612 "second argument of 'main' should be 'char**', but is '%T'", second_type);
4616 type_t *const third_type = parm->type;
4617 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4618 warningf(&decl->source_position,
4619 "third argument of 'main' should be 'char**', but is '%T'", third_type);
4623 goto warn_arg_count;
4627 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
4633 * Check if a symbol is the equal to "main".
4635 static bool is_sym_main(const symbol_t *const sym)
4637 return strcmp(sym->string, "main") == 0;
4640 static declaration_t *record_declaration(
4641 declaration_t *const declaration,
4642 const bool is_definition)
4644 const symbol_t *const symbol = declaration->symbol;
4645 const namespace_t namespc = (namespace_t)declaration->namespc;
4647 assert(symbol != NULL);
4648 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4650 type_t *const orig_type = declaration->type;
4651 type_t *const type = skip_typeref(orig_type);
4652 if (is_type_function(type) &&
4653 type->function.unspecified_parameters &&
4654 warning.strict_prototypes &&
4655 previous_declaration == NULL) {
4656 warningf(&declaration->source_position,
4657 "function declaration '%#T' is not a prototype",
4661 if (warning.main && is_type_function(type) && is_sym_main(symbol)) {
4662 check_type_of_main(declaration, &type->function);
4665 if (warning.nested_externs &&
4666 declaration->storage_class == STORAGE_CLASS_EXTERN &&
4667 scope != file_scope) {
4668 warningf(&declaration->source_position,
4669 "nested extern declaration of '%#T'", declaration->type, symbol);
4672 assert(declaration != previous_declaration);
4673 if (previous_declaration != NULL &&
4674 previous_declaration->parent_scope == ¤t_function->scope &&
4675 scope->depth == previous_declaration->parent_scope->depth + 1) {
4676 errorf(&declaration->source_position,
4677 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4678 orig_type, symbol, previous_declaration->type, symbol,
4679 &previous_declaration->source_position);
4682 if (previous_declaration != NULL &&
4683 previous_declaration->parent_scope == scope) {
4684 /* can happen for K&R style declarations */
4685 if (previous_declaration->type == NULL) {
4686 previous_declaration->type = declaration->type;
4689 const type_t *prev_type = skip_typeref(previous_declaration->type);
4690 if (!types_compatible(type, prev_type)) {
4691 errorf(&declaration->source_position,
4692 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4693 orig_type, symbol, previous_declaration->type, symbol,
4694 &previous_declaration->source_position);
4696 unsigned old_storage_class = previous_declaration->storage_class;
4697 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
4698 errorf(&declaration->source_position,
4699 "redeclaration of enum entry '%Y' (declared %P)",
4700 symbol, &previous_declaration->source_position);
4701 return previous_declaration;
4704 if (warning.redundant_decls &&
4706 previous_declaration->storage_class == STORAGE_CLASS_STATIC &&
4707 !(previous_declaration->modifiers & DM_USED) &&
4708 !previous_declaration->used) {
4709 warningf(&previous_declaration->source_position,
4710 "unnecessary static forward declaration for '%#T'",
4711 previous_declaration->type, symbol);
4714 unsigned new_storage_class = declaration->storage_class;
4716 if (is_type_incomplete(prev_type)) {
4717 previous_declaration->type = type;
4721 /* pretend no storage class means extern for function
4722 * declarations (except if the previous declaration is neither
4723 * none nor extern) */
4724 if (is_type_function(type)) {
4725 if (prev_type->function.unspecified_parameters) {
4726 previous_declaration->type = type;
4730 switch (old_storage_class) {
4731 case STORAGE_CLASS_NONE:
4732 old_storage_class = STORAGE_CLASS_EXTERN;
4735 case STORAGE_CLASS_EXTERN:
4736 if (is_definition) {
4737 if (warning.missing_prototypes &&
4738 prev_type->function.unspecified_parameters &&
4739 !is_sym_main(symbol)) {
4740 warningf(&declaration->source_position,
4741 "no previous prototype for '%#T'",
4744 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4745 new_storage_class = STORAGE_CLASS_EXTERN;
4754 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4755 new_storage_class == STORAGE_CLASS_EXTERN) {
4756 warn_redundant_declaration:
4757 if (!is_definition &&
4758 warning.redundant_decls &&
4759 is_type_valid(prev_type) &&
4760 strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
4761 warningf(&declaration->source_position,
4762 "redundant declaration for '%Y' (declared %P)",
4763 symbol, &previous_declaration->source_position);
4765 } else if (current_function == NULL) {
4766 if (old_storage_class != STORAGE_CLASS_STATIC &&
4767 new_storage_class == STORAGE_CLASS_STATIC) {
4768 errorf(&declaration->source_position,
4769 "static declaration of '%Y' follows non-static declaration (declared %P)",
4770 symbol, &previous_declaration->source_position);
4771 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4772 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4773 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4775 goto warn_redundant_declaration;
4777 } else if (is_type_valid(prev_type)) {
4778 if (old_storage_class == new_storage_class) {
4779 errorf(&declaration->source_position,
4780 "redeclaration of '%Y' (declared %P)",
4781 symbol, &previous_declaration->source_position);
4783 errorf(&declaration->source_position,
4784 "redeclaration of '%Y' with different linkage (declared %P)",
4785 symbol, &previous_declaration->source_position);
4790 previous_declaration->modifiers |= declaration->modifiers;
4791 previous_declaration->is_inline |= declaration->is_inline;
4792 return previous_declaration;
4793 } else if (is_type_function(type)) {
4794 if (is_definition &&
4795 declaration->storage_class != STORAGE_CLASS_STATIC) {
4796 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4797 warningf(&declaration->source_position,
4798 "no previous prototype for '%#T'", orig_type, symbol);
4799 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4800 warningf(&declaration->source_position,
4801 "no previous declaration for '%#T'", orig_type,
4806 if (warning.missing_declarations &&
4807 scope == file_scope && (
4808 declaration->storage_class == STORAGE_CLASS_NONE ||
4809 declaration->storage_class == STORAGE_CLASS_THREAD
4811 warningf(&declaration->source_position,
4812 "no previous declaration for '%#T'", orig_type, symbol);
4816 assert(declaration->parent_scope == NULL);
4817 assert(scope != NULL);
4819 declaration->parent_scope = scope;
4821 environment_push(declaration);
4822 return append_declaration(declaration);
4825 static void parser_error_multiple_definition(declaration_t *declaration,
4826 const source_position_t *source_position)
4828 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4829 declaration->symbol, &declaration->source_position);
4832 static bool is_declaration_specifier(const token_t *token,
4833 bool only_specifiers_qualifiers)
4835 switch (token->type) {
4840 return is_typedef_symbol(token->v.symbol);
4842 case T___extension__:
4844 return !only_specifiers_qualifiers;
4851 static void parse_init_declarator_rest(declaration_t *declaration)
4855 type_t *orig_type = declaration->type;
4856 type_t *type = skip_typeref(orig_type);
4858 if (declaration->init.initializer != NULL) {
4859 parser_error_multiple_definition(declaration, HERE);
4862 bool must_be_constant = false;
4863 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4864 declaration->storage_class == STORAGE_CLASS_THREAD_STATIC ||
4865 declaration->parent_scope == file_scope) {
4866 must_be_constant = true;
4869 if (is_type_function(type)) {
4870 errorf(&declaration->source_position,
4871 "function '%#T' is initialized like a variable",
4872 orig_type, declaration->symbol);
4873 orig_type = type_error_type;
4876 parse_initializer_env_t env;
4877 env.type = orig_type;
4878 env.must_be_constant = must_be_constant;
4879 env.declaration = current_init_decl = declaration;
4881 initializer_t *initializer = parse_initializer(&env);
4882 current_init_decl = NULL;
4884 if (!is_type_function(type)) {
4885 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
4886 * the array type size */
4887 declaration->type = env.type;
4888 declaration->init.initializer = initializer;
4892 /* parse rest of a declaration without any declarator */
4893 static void parse_anonymous_declaration_rest(
4894 const declaration_specifiers_t *specifiers)
4898 if (warning.other) {
4899 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) {
4900 warningf(&specifiers->source_position,
4901 "useless storage class in empty declaration");
4904 type_t *type = specifiers->type;
4905 switch (type->kind) {
4906 case TYPE_COMPOUND_STRUCT:
4907 case TYPE_COMPOUND_UNION: {
4908 if (type->compound.declaration->symbol == NULL) {
4909 warningf(&specifiers->source_position,
4910 "unnamed struct/union that defines no instances");
4919 warningf(&specifiers->source_position, "empty declaration");
4924 #ifdef RECORD_EMPTY_DECLARATIONS
4925 declaration_t *const declaration = allocate_declaration_zero();
4926 declaration->type = specifiers->type;
4927 declaration->declared_storage_class = specifiers->declared_storage_class;
4928 declaration->source_position = specifiers->source_position;
4929 declaration->modifiers = specifiers->modifiers;
4930 declaration->storage_class = STORAGE_CLASS_NONE;
4932 append_declaration(declaration);
4936 static void parse_declaration_rest(declaration_t *ndeclaration,
4937 const declaration_specifiers_t *specifiers,
4938 parsed_declaration_func finished_declaration)
4940 add_anchor_token(';');
4941 add_anchor_token(',');
4943 declaration_t *declaration =
4944 finished_declaration(ndeclaration, token.type == '=');
4946 type_t *orig_type = declaration->type;
4947 type_t *type = skip_typeref(orig_type);
4949 if (warning.other &&
4950 type->kind != TYPE_FUNCTION &&
4951 declaration->is_inline &&
4952 is_type_valid(type)) {
4953 warningf(&declaration->source_position,
4954 "variable '%Y' declared 'inline'\n", declaration->symbol);
4957 if (token.type == '=') {
4958 parse_init_declarator_rest(declaration);
4961 if (token.type != ',')
4965 add_anchor_token('=');
4966 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4967 rem_anchor_token('=');
4972 rem_anchor_token(';');
4973 rem_anchor_token(',');
4976 static declaration_t *finished_kr_declaration(declaration_t *declaration, bool is_definition)
4978 symbol_t *symbol = declaration->symbol;
4979 if (symbol == NULL) {
4980 errorf(HERE, "anonymous declaration not valid as function parameter");
4983 namespace_t namespc = (namespace_t) declaration->namespc;
4984 if (namespc != NAMESPACE_NORMAL) {
4985 return record_declaration(declaration, false);
4988 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4989 if (previous_declaration == NULL ||
4990 previous_declaration->parent_scope != scope) {
4991 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4996 if (is_definition) {
4997 errorf(HERE, "parameter %Y is initialised", declaration->symbol);
5000 if (previous_declaration->type == NULL) {
5001 previous_declaration->type = declaration->type;
5002 previous_declaration->declared_storage_class = declaration->declared_storage_class;
5003 previous_declaration->storage_class = declaration->storage_class;
5004 previous_declaration->parent_scope = scope;
5005 return previous_declaration;
5007 return record_declaration(declaration, false);
5011 static void parse_declaration(parsed_declaration_func finished_declaration)
5013 declaration_specifiers_t specifiers;
5014 memset(&specifiers, 0, sizeof(specifiers));
5016 add_anchor_token(';');
5017 parse_declaration_specifiers(&specifiers);
5018 rem_anchor_token(';');
5020 if (token.type == ';') {
5021 parse_anonymous_declaration_rest(&specifiers);
5023 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5024 parse_declaration_rest(declaration, &specifiers, finished_declaration);
5028 static type_t *get_default_promoted_type(type_t *orig_type)
5030 type_t *result = orig_type;
5032 type_t *type = skip_typeref(orig_type);
5033 if (is_type_integer(type)) {
5034 result = promote_integer(type);
5035 } else if (type == type_float) {
5036 result = type_double;
5042 static void parse_kr_declaration_list(declaration_t *declaration)
5044 type_t *type = skip_typeref(declaration->type);
5045 if (!is_type_function(type))
5048 if (!type->function.kr_style_parameters)
5051 add_anchor_token('{');
5053 /* push function parameters */
5054 size_t const top = environment_top();
5055 scope_push(&declaration->scope);
5057 declaration_t *parameter = declaration->scope.declarations;
5058 for ( ; parameter != NULL; parameter = parameter->next) {
5059 assert(parameter->parent_scope == NULL);
5060 parameter->parent_scope = scope;
5061 environment_push(parameter);
5064 /* parse declaration list */
5065 while (is_declaration_specifier(&token, false)) {
5066 parse_declaration(finished_kr_declaration);
5069 /* pop function parameters */
5070 assert(scope == &declaration->scope);
5072 environment_pop_to(top);
5074 /* update function type */
5075 type_t *new_type = duplicate_type(type);
5077 function_parameter_t *parameters = NULL;
5078 function_parameter_t *last_parameter = NULL;
5080 declaration_t *parameter_declaration = declaration->scope.declarations;
5081 for( ; parameter_declaration != NULL;
5082 parameter_declaration = parameter_declaration->next) {
5083 type_t *parameter_type = parameter_declaration->type;
5084 if (parameter_type == NULL) {
5086 errorf(HERE, "no type specified for function parameter '%Y'",
5087 parameter_declaration->symbol);
5089 if (warning.implicit_int) {
5090 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5091 parameter_declaration->symbol);
5093 parameter_type = type_int;
5094 parameter_declaration->type = parameter_type;
5098 semantic_parameter(parameter_declaration);
5099 parameter_type = parameter_declaration->type;
5102 * we need the default promoted types for the function type
5104 parameter_type = get_default_promoted_type(parameter_type);
5106 function_parameter_t *function_parameter
5107 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
5108 memset(function_parameter, 0, sizeof(function_parameter[0]));
5110 function_parameter->type = parameter_type;
5111 if (last_parameter != NULL) {
5112 last_parameter->next = function_parameter;
5114 parameters = function_parameter;
5116 last_parameter = function_parameter;
5119 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
5121 new_type->function.parameters = parameters;
5122 new_type->function.unspecified_parameters = true;
5124 type = typehash_insert(new_type);
5125 if (type != new_type) {
5126 obstack_free(type_obst, new_type);
5129 declaration->type = type;
5131 rem_anchor_token('{');
5134 static bool first_err = true;
5137 * When called with first_err set, prints the name of the current function,
5140 static void print_in_function(void)
5144 diagnosticf("%s: In function '%Y':\n",
5145 current_function->source_position.input_name,
5146 current_function->symbol);
5151 * Check if all labels are defined in the current function.
5152 * Check if all labels are used in the current function.
5154 static void check_labels(void)
5156 for (const goto_statement_t *goto_statement = goto_first;
5157 goto_statement != NULL;
5158 goto_statement = goto_statement->next) {
5159 /* skip computed gotos */
5160 if (goto_statement->expression != NULL)
5163 declaration_t *label = goto_statement->label;
5166 if (label->source_position.input_name == NULL) {
5167 print_in_function();
5168 errorf(&goto_statement->base.source_position,
5169 "label '%Y' used but not defined", label->symbol);
5172 goto_first = goto_last = NULL;
5174 if (warning.unused_label) {
5175 for (const label_statement_t *label_statement = label_first;
5176 label_statement != NULL;
5177 label_statement = label_statement->next) {
5178 const declaration_t *label = label_statement->label;
5180 if (! label->used) {
5181 print_in_function();
5182 warningf(&label_statement->base.source_position,
5183 "label '%Y' defined but not used", label->symbol);
5187 label_first = label_last = NULL;
5190 static void warn_unused_decl(declaration_t *decl, declaration_t *end, char const *const what)
5192 for (; decl != NULL; decl = decl->next) {
5197 print_in_function();
5198 warningf(&decl->source_position, "%s '%Y' is unused", what, decl->symbol);
5199 } else if (!decl->read) {
5200 print_in_function();
5201 warningf(&decl->source_position, "%s '%Y' is never read", what, decl->symbol);
5209 static void check_unused_variables(statement_t *const stmt, void *const env)
5213 switch (stmt->kind) {
5214 case STATEMENT_DECLARATION: {
5215 declaration_statement_t const *const decls = &stmt->declaration;
5216 warn_unused_decl(decls->declarations_begin, decls->declarations_end, "variable");
5221 warn_unused_decl(stmt->fors.scope.declarations, NULL, "variable");
5230 * Check declarations of current_function for unused entities.
5232 static void check_declarations(void)
5234 if (warning.unused_parameter) {
5235 const scope_t *scope = ¤t_function->scope;
5237 /* do not issue unused warnings for main */
5238 if (!is_sym_main(current_function->symbol)) {
5239 warn_unused_decl(scope->declarations, NULL, "parameter");
5242 if (warning.unused_variable) {
5243 walk_statements(current_function->init.statement, check_unused_variables, NULL);
5247 static int determine_truth(expression_t const* const cond)
5250 !is_constant_expression(cond) ? 0 :
5251 fold_constant(cond) != 0 ? 1 :
5255 static bool expression_returns(expression_t const *const expr)
5257 switch (expr->kind) {
5259 expression_t const *const func = expr->call.function;
5260 if (func->kind == EXPR_REFERENCE) {
5261 declaration_t const *const decl = func->reference.declaration;
5262 if (decl != NULL && decl->modifiers & DM_NORETURN)
5266 if (!expression_returns(func))
5269 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5270 if (!expression_returns(arg->expression))
5277 case EXPR_REFERENCE:
5279 case EXPR_CHARACTER_CONSTANT:
5280 case EXPR_WIDE_CHARACTER_CONSTANT:
5281 case EXPR_STRING_LITERAL:
5282 case EXPR_WIDE_STRING_LITERAL:
5283 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5284 case EXPR_LABEL_ADDRESS:
5285 case EXPR_CLASSIFY_TYPE:
5286 case EXPR_SIZEOF: // TODO handle obscure VLA case
5289 case EXPR_BUILTIN_SYMBOL:
5290 case EXPR_BUILTIN_CONSTANT_P:
5291 case EXPR_BUILTIN_PREFETCH:
5293 case EXPR_STATEMENT: // TODO implement
5296 case EXPR_CONDITIONAL:
5297 // TODO handle constant expression
5299 expression_returns(expr->conditional.condition) && (
5300 expression_returns(expr->conditional.true_expression) ||
5301 expression_returns(expr->conditional.false_expression)
5305 return expression_returns(expr->select.compound);
5307 case EXPR_ARRAY_ACCESS:
5309 expression_returns(expr->array_access.array_ref) &&
5310 expression_returns(expr->array_access.index);
5313 return expression_returns(expr->va_starte.ap);
5316 return expression_returns(expr->va_arge.ap);
5318 EXPR_UNARY_CASES_MANDATORY
5319 return expression_returns(expr->unary.value);
5321 case EXPR_UNARY_THROW:
5325 // TODO handle constant lhs of && and ||
5327 expression_returns(expr->binary.left) &&
5328 expression_returns(expr->binary.right);
5335 panic("unhandled expression");
5338 static bool noreturn_candidate;
5340 static void check_reachable(statement_t *const stmt)
5342 if (stmt->base.reachable)
5344 if (stmt->kind != STATEMENT_DO_WHILE)
5345 stmt->base.reachable = true;
5347 statement_t *last = stmt;
5349 switch (stmt->kind) {
5350 case STATEMENT_INVALID:
5351 case STATEMENT_EMPTY:
5352 case STATEMENT_DECLARATION:
5354 next = stmt->base.next;
5357 case STATEMENT_COMPOUND:
5358 next = stmt->compound.statements;
5361 case STATEMENT_RETURN:
5362 noreturn_candidate = false;
5365 case STATEMENT_IF: {
5366 if_statement_t const* const ifs = &stmt->ifs;
5367 int const val = determine_truth(ifs->condition);
5370 check_reachable(ifs->true_statement);
5375 if (ifs->false_statement != NULL) {
5376 check_reachable(ifs->false_statement);
5380 next = stmt->base.next;
5384 case STATEMENT_SWITCH: {
5385 switch_statement_t const *const switchs = &stmt->switchs;
5386 expression_t const *const expr = switchs->expression;
5388 if (is_constant_expression(expr)) {
5389 long const val = fold_constant(expr);
5390 case_label_statement_t * defaults = NULL;
5391 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5392 if (i->expression == NULL) {
5397 if (i->first_case <= val && val <= i->last_case) {
5398 check_reachable((statement_t*)i);
5403 if (defaults != NULL) {
5404 check_reachable((statement_t*)defaults);
5408 bool has_default = false;
5409 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5410 if (i->expression == NULL)
5413 check_reachable((statement_t*)i);
5420 next = stmt->base.next;
5424 case STATEMENT_EXPRESSION: {
5425 /* Check for noreturn function call */
5426 expression_t const *const expr = stmt->expression.expression;
5427 if (!expression_returns(expr))
5430 next = stmt->base.next;
5434 case STATEMENT_CONTINUE: {
5435 statement_t *parent = stmt;
5437 parent = parent->base.parent;
5438 if (parent == NULL) /* continue not within loop */
5442 switch (parent->kind) {
5443 case STATEMENT_WHILE: goto continue_while;
5444 case STATEMENT_DO_WHILE: goto continue_do_while;
5445 case STATEMENT_FOR: goto continue_for;
5452 case STATEMENT_BREAK: {
5453 statement_t *parent = stmt;
5455 parent = parent->base.parent;
5456 if (parent == NULL) /* break not within loop/switch */
5459 switch (parent->kind) {
5460 case STATEMENT_SWITCH:
5461 case STATEMENT_WHILE:
5462 case STATEMENT_DO_WHILE:
5465 next = parent->base.next;
5466 goto found_break_parent;
5475 case STATEMENT_GOTO:
5476 if (stmt->gotos.expression) {
5477 statement_t *parent = stmt->base.parent;
5478 if (parent == NULL) /* top level goto */
5482 next = stmt->gotos.label->init.statement;
5483 if (next == NULL) /* missing label */
5488 case STATEMENT_LABEL:
5489 next = stmt->label.statement;
5492 case STATEMENT_CASE_LABEL:
5493 next = stmt->case_label.statement;
5496 case STATEMENT_WHILE: {
5497 while_statement_t const *const whiles = &stmt->whiles;
5498 int const val = determine_truth(whiles->condition);
5501 check_reachable(whiles->body);
5506 next = stmt->base.next;
5510 case STATEMENT_DO_WHILE:
5511 next = stmt->do_while.body;
5514 case STATEMENT_FOR: {
5515 for_statement_t *const fors = &stmt->fors;
5517 if (fors->condition_reachable)
5519 fors->condition_reachable = true;
5521 expression_t const *const cond = fors->condition;
5523 cond == NULL ? 1 : determine_truth(cond);
5526 check_reachable(fors->body);
5531 next = stmt->base.next;
5535 case STATEMENT_MS_TRY: {
5536 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5537 check_reachable(ms_try->try_statement);
5538 next = ms_try->final_statement;
5542 case STATEMENT_LEAVE: {
5543 statement_t *parent = stmt;
5545 parent = parent->base.parent;
5546 if (parent == NULL) /* __leave not within __try */
5549 if (parent->kind == STATEMENT_MS_TRY) {
5551 next = parent->ms_try.final_statement;
5559 while (next == NULL) {
5560 next = last->base.parent;
5562 noreturn_candidate = false;
5564 type_t *const type = current_function->type;
5565 assert(is_type_function(type));
5566 type_t *const ret = skip_typeref(type->function.return_type);
5567 if (warning.return_type &&
5568 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5569 is_type_valid(ret) &&
5570 !is_sym_main(current_function->symbol)) {
5571 warningf(&stmt->base.source_position,
5572 "control reaches end of non-void function");
5577 switch (next->kind) {
5578 case STATEMENT_INVALID:
5579 case STATEMENT_EMPTY:
5580 case STATEMENT_DECLARATION:
5581 case STATEMENT_EXPRESSION:
5583 case STATEMENT_RETURN:
5584 case STATEMENT_CONTINUE:
5585 case STATEMENT_BREAK:
5586 case STATEMENT_GOTO:
5587 case STATEMENT_LEAVE:
5588 panic("invalid control flow in function");
5590 case STATEMENT_COMPOUND:
5592 case STATEMENT_SWITCH:
5593 case STATEMENT_LABEL:
5594 case STATEMENT_CASE_LABEL:
5596 next = next->base.next;
5599 case STATEMENT_WHILE: {
5601 if (next->base.reachable)
5603 next->base.reachable = true;
5605 while_statement_t const *const whiles = &next->whiles;
5606 int const val = determine_truth(whiles->condition);
5609 check_reachable(whiles->body);
5615 next = next->base.next;
5619 case STATEMENT_DO_WHILE: {
5621 if (next->base.reachable)
5623 next->base.reachable = true;
5625 do_while_statement_t const *const dw = &next->do_while;
5626 int const val = determine_truth(dw->condition);
5629 check_reachable(dw->body);
5635 next = next->base.next;
5639 case STATEMENT_FOR: {
5641 for_statement_t *const fors = &next->fors;
5643 fors->step_reachable = true;
5645 if (fors->condition_reachable)
5647 fors->condition_reachable = true;
5649 expression_t const *const cond = fors->condition;
5651 cond == NULL ? 1 : determine_truth(cond);
5654 check_reachable(fors->body);
5660 next = next->base.next;
5664 case STATEMENT_MS_TRY:
5666 next = next->ms_try.final_statement;
5671 check_reachable(next);
5674 static void check_unreachable(statement_t* const stmt, void *const env)
5678 switch (stmt->kind) {
5679 case STATEMENT_DO_WHILE:
5680 if (!stmt->base.reachable) {
5681 expression_t const *const cond = stmt->do_while.condition;
5682 if (determine_truth(cond) >= 0) {
5683 warningf(&cond->base.source_position,
5684 "condition of do-while-loop is unreachable");
5689 case STATEMENT_FOR: {
5690 for_statement_t const* const fors = &stmt->fors;
5692 // if init and step are unreachable, cond is unreachable, too
5693 if (!stmt->base.reachable && !fors->step_reachable) {
5694 warningf(&stmt->base.source_position, "statement is unreachable");
5696 if (!stmt->base.reachable && fors->initialisation != NULL) {
5697 warningf(&fors->initialisation->base.source_position,
5698 "initialisation of for-statement is unreachable");
5701 if (!fors->condition_reachable && fors->condition != NULL) {
5702 warningf(&fors->condition->base.source_position,
5703 "condition of for-statement is unreachable");
5706 if (!fors->step_reachable && fors->step != NULL) {
5707 warningf(&fors->step->base.source_position,
5708 "step of for-statement is unreachable");
5714 case STATEMENT_COMPOUND:
5715 if (stmt->compound.statements != NULL)
5720 if (!stmt->base.reachable)
5721 warningf(&stmt->base.source_position, "statement is unreachable");
5726 static void parse_external_declaration(void)
5728 /* function-definitions and declarations both start with declaration
5730 declaration_specifiers_t specifiers;
5731 memset(&specifiers, 0, sizeof(specifiers));
5733 add_anchor_token(';');
5734 parse_declaration_specifiers(&specifiers);
5735 rem_anchor_token(';');
5737 /* must be a declaration */
5738 if (token.type == ';') {
5739 parse_anonymous_declaration_rest(&specifiers);
5743 add_anchor_token(',');
5744 add_anchor_token('=');
5745 add_anchor_token(';');
5746 add_anchor_token('{');
5748 /* declarator is common to both function-definitions and declarations */
5749 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5751 rem_anchor_token('{');
5752 rem_anchor_token(';');
5753 rem_anchor_token('=');
5754 rem_anchor_token(',');
5756 /* must be a declaration */
5757 switch (token.type) {
5761 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
5765 /* must be a function definition */
5766 parse_kr_declaration_list(ndeclaration);
5768 if (token.type != '{') {
5769 parse_error_expected("while parsing function definition", '{', NULL);
5770 eat_until_matching_token(';');
5774 type_t *type = ndeclaration->type;
5776 /* note that we don't skip typerefs: the standard doesn't allow them here
5777 * (so we can't use is_type_function here) */
5778 if (type->kind != TYPE_FUNCTION) {
5779 if (is_type_valid(type)) {
5780 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5781 type, ndeclaration->symbol);
5787 if (warning.aggregate_return &&
5788 is_type_compound(skip_typeref(type->function.return_type))) {
5789 warningf(HERE, "function '%Y' returns an aggregate",
5790 ndeclaration->symbol);
5792 if (warning.traditional && !type->function.unspecified_parameters) {
5793 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5794 ndeclaration->symbol);
5796 if (warning.old_style_definition && type->function.unspecified_parameters) {
5797 warningf(HERE, "old-style function definition '%Y'",
5798 ndeclaration->symbol);
5801 /* § 6.7.5.3 (14) a function definition with () means no
5802 * parameters (and not unspecified parameters) */
5803 if (type->function.unspecified_parameters
5804 && type->function.parameters == NULL
5805 && !type->function.kr_style_parameters) {
5806 type_t *duplicate = duplicate_type(type);
5807 duplicate->function.unspecified_parameters = false;
5809 type = typehash_insert(duplicate);
5810 if (type != duplicate) {
5811 obstack_free(type_obst, duplicate);
5813 ndeclaration->type = type;
5816 declaration_t *const declaration = record_declaration(ndeclaration, true);
5817 if (ndeclaration != declaration) {
5818 declaration->scope = ndeclaration->scope;
5820 type = skip_typeref(declaration->type);
5822 /* push function parameters and switch scope */
5823 size_t const top = environment_top();
5824 scope_push(&declaration->scope);
5826 declaration_t *parameter = declaration->scope.declarations;
5827 for( ; parameter != NULL; parameter = parameter->next) {
5828 if (parameter->parent_scope == &ndeclaration->scope) {
5829 parameter->parent_scope = scope;
5831 assert(parameter->parent_scope == NULL
5832 || parameter->parent_scope == scope);
5833 parameter->parent_scope = scope;
5834 if (parameter->symbol == NULL) {
5835 errorf(¶meter->source_position, "parameter name omitted");
5838 environment_push(parameter);
5841 if (declaration->init.statement != NULL) {
5842 parser_error_multiple_definition(declaration, HERE);
5845 /* parse function body */
5846 int label_stack_top = label_top();
5847 declaration_t *old_current_function = current_function;
5848 current_function = declaration;
5849 current_parent = NULL;
5851 statement_t *const body = parse_compound_statement(false);
5852 declaration->init.statement = body;
5855 check_declarations();
5856 if (warning.return_type ||
5857 warning.unreachable_code ||
5858 (warning.missing_noreturn && !(declaration->modifiers & DM_NORETURN))) {
5859 noreturn_candidate = true;
5860 check_reachable(body);
5861 if (warning.unreachable_code)
5862 walk_statements(body, check_unreachable, NULL);
5863 if (warning.missing_noreturn &&
5864 noreturn_candidate &&
5865 !(declaration->modifiers & DM_NORETURN)) {
5866 warningf(&body->base.source_position,
5867 "function '%#T' is candidate for attribute 'noreturn'",
5868 type, declaration->symbol);
5872 assert(current_parent == NULL);
5873 assert(current_function == declaration);
5874 current_function = old_current_function;
5875 label_pop_to(label_stack_top);
5878 assert(scope == &declaration->scope);
5880 environment_pop_to(top);
5883 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5884 source_position_t *source_position,
5885 const symbol_t *symbol)
5887 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5889 type->bitfield.base_type = base_type;
5890 type->bitfield.size_expression = size;
5893 type_t *skipped_type = skip_typeref(base_type);
5894 if (!is_type_integer(skipped_type)) {
5895 errorf(HERE, "bitfield base type '%T' is not an integer type",
5899 bit_size = skipped_type->base.size * 8;
5902 if (is_constant_expression(size)) {
5903 long v = fold_constant(size);
5906 errorf(source_position, "negative width in bit-field '%Y'",
5908 } else if (v == 0) {
5909 errorf(source_position, "zero width for bit-field '%Y'",
5911 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5912 errorf(source_position, "width of '%Y' exceeds its type",
5915 type->bitfield.bit_size = v;
5922 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
5925 declaration_t *iter = compound_declaration->scope.declarations;
5926 for( ; iter != NULL; iter = iter->next) {
5927 if (iter->namespc != NAMESPACE_NORMAL)
5930 if (iter->symbol == NULL) {
5931 type_t *type = skip_typeref(iter->type);
5932 if (is_type_compound(type)) {
5933 declaration_t *result
5934 = find_compound_entry(type->compound.declaration, symbol);
5941 if (iter->symbol == symbol) {
5949 static void parse_compound_declarators(declaration_t *struct_declaration,
5950 const declaration_specifiers_t *specifiers)
5952 declaration_t *last_declaration = struct_declaration->scope.declarations;
5953 if (last_declaration != NULL) {
5954 while (last_declaration->next != NULL) {
5955 last_declaration = last_declaration->next;
5960 declaration_t *declaration;
5962 if (token.type == ':') {
5963 source_position_t source_position = *HERE;
5966 type_t *base_type = specifiers->type;
5967 expression_t *size = parse_constant_expression();
5969 type_t *type = make_bitfield_type(base_type, size,
5970 &source_position, sym_anonymous);
5972 declaration = allocate_declaration_zero();
5973 declaration->namespc = NAMESPACE_NORMAL;
5974 declaration->declared_storage_class = STORAGE_CLASS_NONE;
5975 declaration->storage_class = STORAGE_CLASS_NONE;
5976 declaration->source_position = source_position;
5977 declaration->modifiers = specifiers->modifiers;
5978 declaration->type = type;
5980 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
5982 type_t *orig_type = declaration->type;
5983 type_t *type = skip_typeref(orig_type);
5985 if (token.type == ':') {
5986 source_position_t source_position = *HERE;
5988 expression_t *size = parse_constant_expression();
5990 type_t *bitfield_type = make_bitfield_type(orig_type, size,
5991 &source_position, declaration->symbol);
5992 declaration->type = bitfield_type;
5994 /* TODO we ignore arrays for now... what is missing is a check
5995 * that they're at the end of the struct */
5996 if (is_type_incomplete(type) && !is_type_array(type)) {
5998 "compound member '%Y' has incomplete type '%T'",
5999 declaration->symbol, orig_type);
6000 } else if (is_type_function(type)) {
6001 errorf(HERE, "compound member '%Y' must not have function type '%T'",
6002 declaration->symbol, orig_type);
6007 /* make sure we don't define a symbol multiple times */
6008 symbol_t *symbol = declaration->symbol;
6009 if (symbol != NULL) {
6010 declaration_t *prev_decl
6011 = find_compound_entry(struct_declaration, symbol);
6013 if (prev_decl != NULL) {
6014 assert(prev_decl->symbol == symbol);
6015 errorf(&declaration->source_position,
6016 "multiple declarations of symbol '%Y' (declared %P)",
6017 symbol, &prev_decl->source_position);
6021 /* append declaration */
6022 if (last_declaration != NULL) {
6023 last_declaration->next = declaration;
6025 struct_declaration->scope.declarations = declaration;
6027 last_declaration = declaration;
6029 if (token.type != ',')
6039 static void parse_compound_type_entries(declaration_t *compound_declaration)
6042 add_anchor_token('}');
6044 while (token.type != '}') {
6045 if (token.type == T_EOF) {
6046 errorf(HERE, "EOF while parsing struct");
6049 declaration_specifiers_t specifiers;
6050 memset(&specifiers, 0, sizeof(specifiers));
6051 parse_declaration_specifiers(&specifiers);
6053 parse_compound_declarators(compound_declaration, &specifiers);
6055 rem_anchor_token('}');
6059 static type_t *parse_typename(void)
6061 declaration_specifiers_t specifiers;
6062 memset(&specifiers, 0, sizeof(specifiers));
6063 parse_declaration_specifiers(&specifiers);
6064 if (specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
6065 /* TODO: improve error message, user does probably not know what a
6066 * storage class is...
6068 errorf(HERE, "typename may not have a storage class");
6071 type_t *result = parse_abstract_declarator(specifiers.type);
6079 typedef expression_t* (*parse_expression_function)(void);
6080 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6082 typedef struct expression_parser_function_t expression_parser_function_t;
6083 struct expression_parser_function_t {
6084 parse_expression_function parser;
6085 unsigned infix_precedence;
6086 parse_expression_infix_function infix_parser;
6089 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6092 * Prints an error message if an expression was expected but not read
6094 static expression_t *expected_expression_error(void)
6096 /* skip the error message if the error token was read */
6097 if (token.type != T_ERROR) {
6098 errorf(HERE, "expected expression, got token '%K'", &token);
6102 return create_invalid_expression();
6106 * Parse a string constant.
6108 static expression_t *parse_string_const(void)
6111 if (token.type == T_STRING_LITERAL) {
6112 string_t res = token.v.string;
6114 while (token.type == T_STRING_LITERAL) {
6115 res = concat_strings(&res, &token.v.string);
6118 if (token.type != T_WIDE_STRING_LITERAL) {
6119 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6120 /* note: that we use type_char_ptr here, which is already the
6121 * automatic converted type. revert_automatic_type_conversion
6122 * will construct the array type */
6123 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6124 cnst->string.value = res;
6128 wres = concat_string_wide_string(&res, &token.v.wide_string);
6130 wres = token.v.wide_string;
6135 switch (token.type) {
6136 case T_WIDE_STRING_LITERAL:
6137 wres = concat_wide_strings(&wres, &token.v.wide_string);
6140 case T_STRING_LITERAL:
6141 wres = concat_wide_string_string(&wres, &token.v.string);
6145 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6146 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6147 cnst->wide_string.value = wres;
6156 * Parse an integer constant.
6158 static expression_t *parse_int_const(void)
6160 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6161 cnst->base.source_position = *HERE;
6162 cnst->base.type = token.datatype;
6163 cnst->conste.v.int_value = token.v.intvalue;
6171 * Parse a character constant.
6173 static expression_t *parse_character_constant(void)
6175 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6177 cnst->base.source_position = *HERE;
6178 cnst->base.type = token.datatype;
6179 cnst->conste.v.character = token.v.string;
6181 if (cnst->conste.v.character.size != 1) {
6182 if (warning.multichar && GNU_MODE) {
6183 warningf(HERE, "multi-character character constant");
6185 errorf(HERE, "more than 1 characters in character constant");
6194 * Parse a wide character constant.
6196 static expression_t *parse_wide_character_constant(void)
6198 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6200 cnst->base.source_position = *HERE;
6201 cnst->base.type = token.datatype;
6202 cnst->conste.v.wide_character = token.v.wide_string;
6204 if (cnst->conste.v.wide_character.size != 1) {
6205 if (warning.multichar && GNU_MODE) {
6206 warningf(HERE, "multi-character character constant");
6208 errorf(HERE, "more than 1 characters in character constant");
6217 * Parse a float constant.
6219 static expression_t *parse_float_const(void)
6221 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6222 cnst->base.type = token.datatype;
6223 cnst->conste.v.float_value = token.v.floatvalue;
6230 static declaration_t *create_implicit_function(symbol_t *symbol,
6231 const source_position_t *source_position)
6233 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6234 ntype->function.return_type = type_int;
6235 ntype->function.unspecified_parameters = true;
6237 type_t *type = typehash_insert(ntype);
6238 if (type != ntype) {
6242 declaration_t *const declaration = allocate_declaration_zero();
6243 declaration->storage_class = STORAGE_CLASS_EXTERN;
6244 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
6245 declaration->type = type;
6246 declaration->symbol = symbol;
6247 declaration->source_position = *source_position;
6248 declaration->implicit = true;
6250 bool strict_prototypes_old = warning.strict_prototypes;
6251 warning.strict_prototypes = false;
6252 record_declaration(declaration, false);
6253 warning.strict_prototypes = strict_prototypes_old;
6259 * Creates a return_type (func)(argument_type) function type if not
6262 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6263 type_t *argument_type2)
6265 function_parameter_t *parameter2
6266 = obstack_alloc(type_obst, sizeof(parameter2[0]));
6267 memset(parameter2, 0, sizeof(parameter2[0]));
6268 parameter2->type = argument_type2;
6270 function_parameter_t *parameter1
6271 = obstack_alloc(type_obst, sizeof(parameter1[0]));
6272 memset(parameter1, 0, sizeof(parameter1[0]));
6273 parameter1->type = argument_type1;
6274 parameter1->next = parameter2;
6276 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6277 type->function.return_type = return_type;
6278 type->function.parameters = parameter1;
6280 type_t *result = typehash_insert(type);
6281 if (result != type) {
6289 * Creates a return_type (func)(argument_type) function type if not
6292 * @param return_type the return type
6293 * @param argument_type the argument type
6295 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6297 function_parameter_t *parameter
6298 = obstack_alloc(type_obst, sizeof(parameter[0]));
6299 memset(parameter, 0, sizeof(parameter[0]));
6300 parameter->type = argument_type;
6302 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6303 type->function.return_type = return_type;
6304 type->function.parameters = parameter;
6306 type_t *result = typehash_insert(type);
6307 if (result != type) {
6314 static type_t *make_function_0_type(type_t *return_type)
6316 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6317 type->function.return_type = return_type;
6318 type->function.parameters = NULL;
6320 type_t *result = typehash_insert(type);
6321 if (result != type) {
6329 * Creates a function type for some function like builtins.
6331 * @param symbol the symbol describing the builtin
6333 static type_t *get_builtin_symbol_type(symbol_t *symbol)
6335 switch(symbol->ID) {
6336 case T___builtin_alloca:
6337 return make_function_1_type(type_void_ptr, type_size_t);
6338 case T___builtin_huge_val:
6339 return make_function_0_type(type_double);
6340 case T___builtin_inf:
6341 return make_function_0_type(type_double);
6342 case T___builtin_inff:
6343 return make_function_0_type(type_float);
6344 case T___builtin_infl:
6345 return make_function_0_type(type_long_double);
6346 case T___builtin_nan:
6347 return make_function_1_type(type_double, type_char_ptr);
6348 case T___builtin_nanf:
6349 return make_function_1_type(type_float, type_char_ptr);
6350 case T___builtin_nanl:
6351 return make_function_1_type(type_long_double, type_char_ptr);
6352 case T___builtin_va_end:
6353 return make_function_1_type(type_void, type_valist);
6354 case T___builtin_expect:
6355 return make_function_2_type(type_long, type_long, type_long);
6357 internal_errorf(HERE, "not implemented builtin symbol found");
6362 * Performs automatic type cast as described in § 6.3.2.1.
6364 * @param orig_type the original type
6366 static type_t *automatic_type_conversion(type_t *orig_type)
6368 type_t *type = skip_typeref(orig_type);
6369 if (is_type_array(type)) {
6370 array_type_t *array_type = &type->array;
6371 type_t *element_type = array_type->element_type;
6372 unsigned qualifiers = array_type->base.qualifiers;
6374 return make_pointer_type(element_type, qualifiers);
6377 if (is_type_function(type)) {
6378 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6385 * reverts the automatic casts of array to pointer types and function
6386 * to function-pointer types as defined § 6.3.2.1
6388 type_t *revert_automatic_type_conversion(const expression_t *expression)
6390 switch (expression->kind) {
6391 case EXPR_REFERENCE: return expression->reference.declaration->type;
6394 return get_qualified_type(expression->select.compound_entry->type,
6395 expression->base.type->base.qualifiers);
6397 case EXPR_UNARY_DEREFERENCE: {
6398 const expression_t *const value = expression->unary.value;
6399 type_t *const type = skip_typeref(value->base.type);
6400 assert(is_type_pointer(type));
6401 return type->pointer.points_to;
6404 case EXPR_BUILTIN_SYMBOL:
6405 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
6407 case EXPR_ARRAY_ACCESS: {
6408 const expression_t *array_ref = expression->array_access.array_ref;
6409 type_t *type_left = skip_typeref(array_ref->base.type);
6410 if (!is_type_valid(type_left))
6412 assert(is_type_pointer(type_left));
6413 return type_left->pointer.points_to;
6416 case EXPR_STRING_LITERAL: {
6417 size_t size = expression->string.value.size;
6418 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6421 case EXPR_WIDE_STRING_LITERAL: {
6422 size_t size = expression->wide_string.value.size;
6423 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6426 case EXPR_COMPOUND_LITERAL:
6427 return expression->compound_literal.type;
6432 return expression->base.type;
6435 static expression_t *parse_reference(void)
6437 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
6439 reference_expression_t *ref = &expression->reference;
6440 symbol_t *const symbol = token.v.symbol;
6442 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
6444 if (declaration == NULL) {
6445 if (!strict_mode && look_ahead(1)->type == '(') {
6446 /* an implicitly declared function */
6447 if (warning.implicit_function_declaration) {
6448 warningf(HERE, "implicit declaration of function '%Y'",
6452 declaration = create_implicit_function(symbol, HERE);
6454 errorf(HERE, "unknown symbol '%Y' found.", symbol);
6455 declaration = create_error_declaration(symbol, STORAGE_CLASS_NONE);
6459 type_t *orig_type = declaration->type;
6461 /* we always do the auto-type conversions; the & and sizeof parser contains
6462 * code to revert this! */
6463 type_t *type = automatic_type_conversion(orig_type);
6465 ref->declaration = declaration;
6466 ref->base.type = type;
6468 /* this declaration is used */
6469 declaration->used = true;
6471 if (declaration->parent_scope != file_scope &&
6472 declaration->parent_scope->depth < current_function->scope.depth &&
6473 is_type_valid(orig_type) && !is_type_function(orig_type)) {
6474 /* access of a variable from an outer function */
6475 declaration->address_taken = true;
6476 current_function->need_closure = true;
6479 /* check for deprecated functions */
6480 if (warning.deprecated_declarations &&
6481 declaration->modifiers & DM_DEPRECATED) {
6482 char const *const prefix = is_type_function(declaration->type) ?
6483 "function" : "variable";
6485 if (declaration->deprecated_string != NULL) {
6486 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
6487 prefix, declaration->symbol, &declaration->source_position,
6488 declaration->deprecated_string);
6490 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
6491 declaration->symbol, &declaration->source_position);
6494 if (warning.init_self && declaration == current_init_decl && !in_type_prop) {
6495 current_init_decl = NULL;
6496 warningf(HERE, "variable '%#T' is initialized by itself",
6497 declaration->type, declaration->symbol);
6504 static bool semantic_cast(expression_t *cast)
6506 expression_t *expression = cast->unary.value;
6507 type_t *orig_dest_type = cast->base.type;
6508 type_t *orig_type_right = expression->base.type;
6509 type_t const *dst_type = skip_typeref(orig_dest_type);
6510 type_t const *src_type = skip_typeref(orig_type_right);
6511 source_position_t const *pos = &cast->base.source_position;
6513 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6514 if (dst_type == type_void)
6517 /* only integer and pointer can be casted to pointer */
6518 if (is_type_pointer(dst_type) &&
6519 !is_type_pointer(src_type) &&
6520 !is_type_integer(src_type) &&
6521 is_type_valid(src_type)) {
6522 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6526 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6527 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6531 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6532 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6536 if (warning.cast_qual &&
6537 is_type_pointer(src_type) &&
6538 is_type_pointer(dst_type)) {
6539 type_t *src = skip_typeref(src_type->pointer.points_to);
6540 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6541 unsigned missing_qualifiers =
6542 src->base.qualifiers & ~dst->base.qualifiers;
6543 if (missing_qualifiers != 0) {
6545 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6546 missing_qualifiers, orig_type_right);
6552 static expression_t *parse_compound_literal(type_t *type)
6554 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6556 parse_initializer_env_t env;
6558 env.declaration = NULL;
6559 env.must_be_constant = false;
6560 initializer_t *initializer = parse_initializer(&env);
6563 expression->compound_literal.initializer = initializer;
6564 expression->compound_literal.type = type;
6565 expression->base.type = automatic_type_conversion(type);
6571 * Parse a cast expression.
6573 static expression_t *parse_cast(void)
6575 add_anchor_token(')');
6577 source_position_t source_position = token.source_position;
6579 type_t *type = parse_typename();
6581 rem_anchor_token(')');
6584 if (token.type == '{') {
6585 return parse_compound_literal(type);
6588 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6589 cast->base.source_position = source_position;
6591 expression_t *value = parse_sub_expression(PREC_CAST);
6592 cast->base.type = type;
6593 cast->unary.value = value;
6595 if (! semantic_cast(cast)) {
6596 /* TODO: record the error in the AST. else it is impossible to detect it */
6601 return create_invalid_expression();
6605 * Parse a statement expression.
6607 static expression_t *parse_statement_expression(void)
6609 add_anchor_token(')');
6611 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6613 statement_t *statement = parse_compound_statement(true);
6614 expression->statement.statement = statement;
6615 expression->base.source_position = statement->base.source_position;
6617 /* find last statement and use its type */
6618 type_t *type = type_void;
6619 const statement_t *stmt = statement->compound.statements;
6621 while (stmt->base.next != NULL)
6622 stmt = stmt->base.next;
6624 if (stmt->kind == STATEMENT_EXPRESSION) {
6625 type = stmt->expression.expression->base.type;
6627 } else if (warning.other) {
6628 warningf(&expression->base.source_position, "empty statement expression ({})");
6630 expression->base.type = type;
6632 rem_anchor_token(')');
6640 * Parse a parenthesized expression.
6642 static expression_t *parse_parenthesized_expression(void)
6646 switch(token.type) {
6648 /* gcc extension: a statement expression */
6649 return parse_statement_expression();
6653 return parse_cast();
6655 if (is_typedef_symbol(token.v.symbol)) {
6656 return parse_cast();
6660 add_anchor_token(')');
6661 expression_t *result = parse_expression();
6662 rem_anchor_token(')');
6669 static expression_t *parse_function_keyword(void)
6674 if (current_function == NULL) {
6675 errorf(HERE, "'__func__' used outside of a function");
6678 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6679 expression->base.type = type_char_ptr;
6680 expression->funcname.kind = FUNCNAME_FUNCTION;
6685 static expression_t *parse_pretty_function_keyword(void)
6687 eat(T___PRETTY_FUNCTION__);
6689 if (current_function == NULL) {
6690 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6693 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6694 expression->base.type = type_char_ptr;
6695 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6700 static expression_t *parse_funcsig_keyword(void)
6704 if (current_function == NULL) {
6705 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6708 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6709 expression->base.type = type_char_ptr;
6710 expression->funcname.kind = FUNCNAME_FUNCSIG;
6715 static expression_t *parse_funcdname_keyword(void)
6717 eat(T___FUNCDNAME__);
6719 if (current_function == NULL) {
6720 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6723 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6724 expression->base.type = type_char_ptr;
6725 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6730 static designator_t *parse_designator(void)
6732 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6733 result->source_position = *HERE;
6735 if (token.type != T_IDENTIFIER) {
6736 parse_error_expected("while parsing member designator",
6737 T_IDENTIFIER, NULL);
6740 result->symbol = token.v.symbol;
6743 designator_t *last_designator = result;
6745 if (token.type == '.') {
6747 if (token.type != T_IDENTIFIER) {
6748 parse_error_expected("while parsing member designator",
6749 T_IDENTIFIER, NULL);
6752 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6753 designator->source_position = *HERE;
6754 designator->symbol = token.v.symbol;
6757 last_designator->next = designator;
6758 last_designator = designator;
6761 if (token.type == '[') {
6763 add_anchor_token(']');
6764 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6765 designator->source_position = *HERE;
6766 designator->array_index = parse_expression();
6767 rem_anchor_token(']');
6769 if (designator->array_index == NULL) {
6773 last_designator->next = designator;
6774 last_designator = designator;
6786 * Parse the __builtin_offsetof() expression.
6788 static expression_t *parse_offsetof(void)
6790 eat(T___builtin_offsetof);
6792 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6793 expression->base.type = type_size_t;
6796 add_anchor_token(',');
6797 type_t *type = parse_typename();
6798 rem_anchor_token(',');
6800 add_anchor_token(')');
6801 designator_t *designator = parse_designator();
6802 rem_anchor_token(')');
6805 expression->offsetofe.type = type;
6806 expression->offsetofe.designator = designator;
6809 memset(&path, 0, sizeof(path));
6810 path.top_type = type;
6811 path.path = NEW_ARR_F(type_path_entry_t, 0);
6813 descend_into_subtype(&path);
6815 if (!walk_designator(&path, designator, true)) {
6816 return create_invalid_expression();
6819 DEL_ARR_F(path.path);
6823 return create_invalid_expression();
6827 * Parses a _builtin_va_start() expression.
6829 static expression_t *parse_va_start(void)
6831 eat(T___builtin_va_start);
6833 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6836 add_anchor_token(',');
6837 expression->va_starte.ap = parse_assignment_expression();
6838 rem_anchor_token(',');
6840 expression_t *const expr = parse_assignment_expression();
6841 if (expr->kind == EXPR_REFERENCE) {
6842 declaration_t *const decl = expr->reference.declaration;
6843 if (decl->parent_scope != ¤t_function->scope || decl->next != NULL) {
6844 errorf(&expr->base.source_position,
6845 "second argument of 'va_start' must be last parameter of the current function");
6847 expression->va_starte.parameter = decl;
6853 return create_invalid_expression();
6857 * Parses a _builtin_va_arg() expression.
6859 static expression_t *parse_va_arg(void)
6861 eat(T___builtin_va_arg);
6863 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6866 expression->va_arge.ap = parse_assignment_expression();
6868 expression->base.type = parse_typename();
6873 return create_invalid_expression();
6876 static expression_t *parse_builtin_symbol(void)
6878 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
6880 symbol_t *symbol = token.v.symbol;
6882 expression->builtin_symbol.symbol = symbol;
6885 type_t *type = get_builtin_symbol_type(symbol);
6886 type = automatic_type_conversion(type);
6888 expression->base.type = type;
6893 * Parses a __builtin_constant() expression.
6895 static expression_t *parse_builtin_constant(void)
6897 eat(T___builtin_constant_p);
6899 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6902 add_anchor_token(')');
6903 expression->builtin_constant.value = parse_assignment_expression();
6904 rem_anchor_token(')');
6906 expression->base.type = type_int;
6910 return create_invalid_expression();
6914 * Parses a __builtin_prefetch() expression.
6916 static expression_t *parse_builtin_prefetch(void)
6918 eat(T___builtin_prefetch);
6920 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
6923 add_anchor_token(')');
6924 expression->builtin_prefetch.adr = parse_assignment_expression();
6925 if (token.type == ',') {
6927 expression->builtin_prefetch.rw = parse_assignment_expression();
6929 if (token.type == ',') {
6931 expression->builtin_prefetch.locality = parse_assignment_expression();
6933 rem_anchor_token(')');
6935 expression->base.type = type_void;
6939 return create_invalid_expression();
6943 * Parses a __builtin_is_*() compare expression.
6945 static expression_t *parse_compare_builtin(void)
6947 expression_t *expression;
6949 switch(token.type) {
6950 case T___builtin_isgreater:
6951 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6953 case T___builtin_isgreaterequal:
6954 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6956 case T___builtin_isless:
6957 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6959 case T___builtin_islessequal:
6960 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6962 case T___builtin_islessgreater:
6963 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6965 case T___builtin_isunordered:
6966 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6969 internal_errorf(HERE, "invalid compare builtin found");
6971 expression->base.source_position = *HERE;
6975 expression->binary.left = parse_assignment_expression();
6977 expression->binary.right = parse_assignment_expression();
6980 type_t *const orig_type_left = expression->binary.left->base.type;
6981 type_t *const orig_type_right = expression->binary.right->base.type;
6983 type_t *const type_left = skip_typeref(orig_type_left);
6984 type_t *const type_right = skip_typeref(orig_type_right);
6985 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6986 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6987 type_error_incompatible("invalid operands in comparison",
6988 &expression->base.source_position, orig_type_left, orig_type_right);
6991 semantic_comparison(&expression->binary);
6996 return create_invalid_expression();
7001 * Parses a __builtin_expect() expression.
7003 static expression_t *parse_builtin_expect(void)
7005 eat(T___builtin_expect);
7007 expression_t *expression
7008 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7011 expression->binary.left = parse_assignment_expression();
7013 expression->binary.right = parse_constant_expression();
7016 expression->base.type = expression->binary.left->base.type;
7020 return create_invalid_expression();
7025 * Parses a MS assume() expression.
7027 static expression_t *parse_assume(void)
7031 expression_t *expression
7032 = allocate_expression_zero(EXPR_UNARY_ASSUME);
7035 add_anchor_token(')');
7036 expression->unary.value = parse_assignment_expression();
7037 rem_anchor_token(')');
7040 expression->base.type = type_void;
7043 return create_invalid_expression();
7047 * Return the declaration for a given label symbol or create a new one.
7049 * @param symbol the symbol of the label
7051 static declaration_t *get_label(symbol_t *symbol)
7053 declaration_t *candidate;
7054 assert(current_function != NULL);
7056 candidate = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
7057 /* if we found a local label, we already created the declaration */
7058 if (candidate != NULL) {
7059 if (candidate->parent_scope != scope) {
7060 assert(candidate->parent_scope->depth < scope->depth);
7061 current_function->goto_to_outer = true;
7066 candidate = get_declaration(symbol, NAMESPACE_LABEL);
7067 /* if we found a label in the same function, then we already created the
7069 if (candidate != NULL
7070 && candidate->parent_scope == ¤t_function->scope) {
7074 /* otherwise we need to create a new one */
7075 declaration_t *const declaration = allocate_declaration_zero();
7076 declaration->namespc = NAMESPACE_LABEL;
7077 declaration->symbol = symbol;
7079 label_push(declaration);
7085 * Parses a GNU && label address expression.
7087 static expression_t *parse_label_address(void)
7089 source_position_t source_position = token.source_position;
7091 if (token.type != T_IDENTIFIER) {
7092 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7095 symbol_t *symbol = token.v.symbol;
7098 declaration_t *label = get_label(symbol);
7101 label->address_taken = true;
7103 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7104 expression->base.source_position = source_position;
7106 /* label address is threaten as a void pointer */
7107 expression->base.type = type_void_ptr;
7108 expression->label_address.declaration = label;
7111 return create_invalid_expression();
7115 * Parse a microsoft __noop expression.
7117 static expression_t *parse_noop_expression(void)
7119 source_position_t source_position = *HERE;
7122 if (token.type == '(') {
7123 /* parse arguments */
7125 add_anchor_token(')');
7126 add_anchor_token(',');
7128 if (token.type != ')') {
7130 (void)parse_assignment_expression();
7131 if (token.type != ',')
7137 rem_anchor_token(',');
7138 rem_anchor_token(')');
7141 /* the result is a (int)0 */
7142 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7143 cnst->base.source_position = source_position;
7144 cnst->base.type = type_int;
7145 cnst->conste.v.int_value = 0;
7146 cnst->conste.is_ms_noop = true;
7151 return create_invalid_expression();
7155 * Parses a primary expression.
7157 static expression_t *parse_primary_expression(void)
7159 switch (token.type) {
7160 case T_INTEGER: return parse_int_const();
7161 case T_CHARACTER_CONSTANT: return parse_character_constant();
7162 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7163 case T_FLOATINGPOINT: return parse_float_const();
7164 case T_STRING_LITERAL:
7165 case T_WIDE_STRING_LITERAL: return parse_string_const();
7166 case T_IDENTIFIER: return parse_reference();
7167 case T___FUNCTION__:
7168 case T___func__: return parse_function_keyword();
7169 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7170 case T___FUNCSIG__: return parse_funcsig_keyword();
7171 case T___FUNCDNAME__: return parse_funcdname_keyword();
7172 case T___builtin_offsetof: return parse_offsetof();
7173 case T___builtin_va_start: return parse_va_start();
7174 case T___builtin_va_arg: return parse_va_arg();
7175 case T___builtin_expect:
7176 case T___builtin_alloca:
7177 case T___builtin_inf:
7178 case T___builtin_inff:
7179 case T___builtin_infl:
7180 case T___builtin_nan:
7181 case T___builtin_nanf:
7182 case T___builtin_nanl:
7183 case T___builtin_huge_val:
7184 case T___builtin_va_end: return parse_builtin_symbol();
7185 case T___builtin_isgreater:
7186 case T___builtin_isgreaterequal:
7187 case T___builtin_isless:
7188 case T___builtin_islessequal:
7189 case T___builtin_islessgreater:
7190 case T___builtin_isunordered: return parse_compare_builtin();
7191 case T___builtin_constant_p: return parse_builtin_constant();
7192 case T___builtin_prefetch: return parse_builtin_prefetch();
7193 case T__assume: return parse_assume();
7196 return parse_label_address();
7199 case '(': return parse_parenthesized_expression();
7200 case T___noop: return parse_noop_expression();
7203 errorf(HERE, "unexpected token %K, expected an expression", &token);
7204 return create_invalid_expression();
7208 * Check if the expression has the character type and issue a warning then.
7210 static void check_for_char_index_type(const expression_t *expression)
7212 type_t *const type = expression->base.type;
7213 const type_t *const base_type = skip_typeref(type);
7215 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7216 warning.char_subscripts) {
7217 warningf(&expression->base.source_position,
7218 "array subscript has type '%T'", type);
7222 static expression_t *parse_array_expression(expression_t *left)
7225 add_anchor_token(']');
7227 expression_t *inside = parse_expression();
7229 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7231 array_access_expression_t *array_access = &expression->array_access;
7233 type_t *const orig_type_left = left->base.type;
7234 type_t *const orig_type_inside = inside->base.type;
7236 type_t *const type_left = skip_typeref(orig_type_left);
7237 type_t *const type_inside = skip_typeref(orig_type_inside);
7239 type_t *return_type;
7240 if (is_type_pointer(type_left)) {
7241 return_type = type_left->pointer.points_to;
7242 array_access->array_ref = left;
7243 array_access->index = inside;
7244 check_for_char_index_type(inside);
7245 } else if (is_type_pointer(type_inside)) {
7246 return_type = type_inside->pointer.points_to;
7247 array_access->array_ref = inside;
7248 array_access->index = left;
7249 array_access->flipped = true;
7250 check_for_char_index_type(left);
7252 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7254 "array access on object with non-pointer types '%T', '%T'",
7255 orig_type_left, orig_type_inside);
7257 return_type = type_error_type;
7258 array_access->array_ref = left;
7259 array_access->index = inside;
7262 expression->base.type = automatic_type_conversion(return_type);
7264 rem_anchor_token(']');
7265 if (token.type == ']') {
7268 parse_error_expected("Problem while parsing array access", ']', NULL);
7273 static expression_t *parse_typeprop(expression_kind_t const kind,
7274 source_position_t const pos)
7276 expression_t *tp_expression = allocate_expression_zero(kind);
7277 tp_expression->base.type = type_size_t;
7278 tp_expression->base.source_position = pos;
7280 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7282 /* we only refer to a type property, mark this case */
7283 bool old = in_type_prop;
7284 in_type_prop = true;
7285 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7287 add_anchor_token(')');
7288 type_t* const orig_type = parse_typename();
7289 tp_expression->typeprop.type = orig_type;
7291 type_t const* const type = skip_typeref(orig_type);
7292 char const* const wrong_type =
7293 is_type_incomplete(type) ? "incomplete" :
7294 type->kind == TYPE_FUNCTION ? "function designator" :
7295 type->kind == TYPE_BITFIELD ? "bitfield" :
7297 if (wrong_type != NULL) {
7298 errorf(&pos, "operand of %s expression must not be %s type '%T'",
7299 what, wrong_type, type);
7302 rem_anchor_token(')');
7305 expression_t *expression = parse_sub_expression(PREC_UNARY);
7307 type_t* const orig_type = revert_automatic_type_conversion(expression);
7308 expression->base.type = orig_type;
7310 type_t const* const type = skip_typeref(orig_type);
7311 char const* const wrong_type =
7312 is_type_incomplete(type) ? "incomplete" :
7313 type->kind == TYPE_FUNCTION ? "function designator" :
7314 type->kind == TYPE_BITFIELD ? "bitfield" :
7316 if (wrong_type != NULL) {
7317 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
7320 tp_expression->typeprop.type = expression->base.type;
7321 tp_expression->typeprop.tp_expression = expression;
7326 return tp_expression;
7329 static expression_t *parse_sizeof(void)
7331 source_position_t pos = *HERE;
7333 return parse_typeprop(EXPR_SIZEOF, pos);
7336 static expression_t *parse_alignof(void)
7338 source_position_t pos = *HERE;
7340 return parse_typeprop(EXPR_ALIGNOF, pos);
7343 static expression_t *parse_select_expression(expression_t *compound)
7345 assert(token.type == '.' || token.type == T_MINUSGREATER);
7347 bool is_pointer = (token.type == T_MINUSGREATER);
7350 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7351 select->select.compound = compound;
7353 if (token.type != T_IDENTIFIER) {
7354 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7357 symbol_t *symbol = token.v.symbol;
7360 type_t *const orig_type = compound->base.type;
7361 type_t *const type = skip_typeref(orig_type);
7364 bool saw_error = false;
7365 if (is_type_pointer(type)) {
7368 "request for member '%Y' in something not a struct or union, but '%T'",
7372 type_left = skip_typeref(type->pointer.points_to);
7374 if (is_pointer && is_type_valid(type)) {
7375 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7381 declaration_t *entry;
7382 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7383 type_left->kind == TYPE_COMPOUND_UNION) {
7384 declaration_t *const declaration = type_left->compound.declaration;
7386 if (!declaration->init.complete) {
7387 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7389 goto create_error_entry;
7392 entry = find_compound_entry(declaration, symbol);
7393 if (entry == NULL) {
7394 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7395 goto create_error_entry;
7398 if (is_type_valid(type_left) && !saw_error) {
7400 "request for member '%Y' in something not a struct or union, but '%T'",
7404 entry = allocate_declaration_zero();
7405 entry->symbol = symbol;
7408 select->select.compound_entry = entry;
7410 type_t *const res_type =
7411 get_qualified_type(entry->type, type_left->base.qualifiers);
7413 /* we always do the auto-type conversions; the & and sizeof parser contains
7414 * code to revert this! */
7415 select->base.type = automatic_type_conversion(res_type);
7417 type_t *skipped = skip_typeref(res_type);
7418 if (skipped->kind == TYPE_BITFIELD) {
7419 select->base.type = skipped->bitfield.base_type;
7425 static void check_call_argument(const function_parameter_t *parameter,
7426 call_argument_t *argument, unsigned pos)
7428 type_t *expected_type = parameter->type;
7429 type_t *expected_type_skip = skip_typeref(expected_type);
7430 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7431 expression_t *arg_expr = argument->expression;
7432 type_t *arg_type = skip_typeref(arg_expr->base.type);
7434 /* handle transparent union gnu extension */
7435 if (is_type_union(expected_type_skip)
7436 && (expected_type_skip->base.modifiers
7437 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
7438 declaration_t *union_decl = expected_type_skip->compound.declaration;
7440 declaration_t *declaration = union_decl->scope.declarations;
7441 type_t *best_type = NULL;
7442 for ( ; declaration != NULL; declaration = declaration->next) {
7443 type_t *decl_type = declaration->type;
7444 error = semantic_assign(decl_type, arg_expr);
7445 if (error == ASSIGN_ERROR_INCOMPATIBLE
7446 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7449 if (error == ASSIGN_SUCCESS) {
7450 best_type = decl_type;
7451 } else if (best_type == NULL) {
7452 best_type = decl_type;
7456 if (best_type != NULL) {
7457 expected_type = best_type;
7461 error = semantic_assign(expected_type, arg_expr);
7462 argument->expression = create_implicit_cast(argument->expression,
7465 if (error != ASSIGN_SUCCESS) {
7466 /* report exact scope in error messages (like "in argument 3") */
7468 snprintf(buf, sizeof(buf), "call argument %u", pos);
7469 report_assign_error(error, expected_type, arg_expr, buf,
7470 &arg_expr->base.source_position);
7471 } else if (warning.traditional || warning.conversion) {
7472 type_t *const promoted_type = get_default_promoted_type(arg_type);
7473 if (!types_compatible(expected_type_skip, promoted_type) &&
7474 !types_compatible(expected_type_skip, type_void_ptr) &&
7475 !types_compatible(type_void_ptr, promoted_type)) {
7476 /* Deliberately show the skipped types in this warning */
7477 warningf(&arg_expr->base.source_position,
7478 "passing call argument %u as '%T' rather than '%T' due to prototype",
7479 pos, expected_type_skip, promoted_type);
7485 * Parse a call expression, ie. expression '( ... )'.
7487 * @param expression the function address
7489 static expression_t *parse_call_expression(expression_t *expression)
7491 expression_t *result = allocate_expression_zero(EXPR_CALL);
7492 result->base.source_position = expression->base.source_position;
7494 call_expression_t *call = &result->call;
7495 call->function = expression;
7497 type_t *const orig_type = expression->base.type;
7498 type_t *const type = skip_typeref(orig_type);
7500 function_type_t *function_type = NULL;
7501 if (is_type_pointer(type)) {
7502 type_t *const to_type = skip_typeref(type->pointer.points_to);
7504 if (is_type_function(to_type)) {
7505 function_type = &to_type->function;
7506 call->base.type = function_type->return_type;
7510 if (function_type == NULL && is_type_valid(type)) {
7511 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
7514 /* parse arguments */
7516 add_anchor_token(')');
7517 add_anchor_token(',');
7519 if (token.type != ')') {
7520 call_argument_t *last_argument = NULL;
7523 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7525 argument->expression = parse_assignment_expression();
7526 if (last_argument == NULL) {
7527 call->arguments = argument;
7529 last_argument->next = argument;
7531 last_argument = argument;
7533 if (token.type != ',')
7538 rem_anchor_token(',');
7539 rem_anchor_token(')');
7542 if (function_type == NULL)
7545 function_parameter_t *parameter = function_type->parameters;
7546 call_argument_t *argument = call->arguments;
7547 if (!function_type->unspecified_parameters) {
7548 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7549 parameter = parameter->next, argument = argument->next) {
7550 check_call_argument(parameter, argument, ++pos);
7553 if (parameter != NULL) {
7554 errorf(HERE, "too few arguments to function '%E'", expression);
7555 } else if (argument != NULL && !function_type->variadic) {
7556 errorf(HERE, "too many arguments to function '%E'", expression);
7560 /* do default promotion */
7561 for( ; argument != NULL; argument = argument->next) {
7562 type_t *type = argument->expression->base.type;
7564 type = get_default_promoted_type(type);
7566 argument->expression
7567 = create_implicit_cast(argument->expression, type);
7570 check_format(&result->call);
7572 if (warning.aggregate_return &&
7573 is_type_compound(skip_typeref(function_type->return_type))) {
7574 warningf(&result->base.source_position,
7575 "function call has aggregate value");
7582 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7584 static bool same_compound_type(const type_t *type1, const type_t *type2)
7587 is_type_compound(type1) &&
7588 type1->kind == type2->kind &&
7589 type1->compound.declaration == type2->compound.declaration;
7593 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7595 * @param expression the conditional expression
7597 static expression_t *parse_conditional_expression(expression_t *expression)
7599 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7601 conditional_expression_t *conditional = &result->conditional;
7602 conditional->base.source_position = *HERE;
7603 conditional->condition = expression;
7606 add_anchor_token(':');
7609 type_t *const condition_type_orig = expression->base.type;
7610 type_t *const condition_type = skip_typeref(condition_type_orig);
7611 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
7612 type_error("expected a scalar type in conditional condition",
7613 &expression->base.source_position, condition_type_orig);
7616 expression_t *true_expression = expression;
7617 bool gnu_cond = false;
7618 if (GNU_MODE && token.type == ':') {
7621 true_expression = parse_expression();
7622 rem_anchor_token(':');
7624 expression_t *false_expression =
7625 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7627 type_t *const orig_true_type = true_expression->base.type;
7628 type_t *const orig_false_type = false_expression->base.type;
7629 type_t *const true_type = skip_typeref(orig_true_type);
7630 type_t *const false_type = skip_typeref(orig_false_type);
7633 type_t *result_type;
7634 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7635 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7636 /* ISO/IEC 14882:1998(E) §5.16:2 */
7637 if (true_expression->kind == EXPR_UNARY_THROW) {
7638 result_type = false_type;
7639 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7640 result_type = true_type;
7642 if (warning.other && (
7643 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7644 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7646 warningf(&conditional->base.source_position,
7647 "ISO C forbids conditional expression with only one void side");
7649 result_type = type_void;
7651 } else if (is_type_arithmetic(true_type)
7652 && is_type_arithmetic(false_type)) {
7653 result_type = semantic_arithmetic(true_type, false_type);
7655 true_expression = create_implicit_cast(true_expression, result_type);
7656 false_expression = create_implicit_cast(false_expression, result_type);
7658 conditional->true_expression = true_expression;
7659 conditional->false_expression = false_expression;
7660 conditional->base.type = result_type;
7661 } else if (same_compound_type(true_type, false_type)) {
7662 /* just take 1 of the 2 types */
7663 result_type = true_type;
7664 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7665 type_t *pointer_type;
7667 expression_t *other_expression;
7668 if (is_type_pointer(true_type) &&
7669 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7670 pointer_type = true_type;
7671 other_type = false_type;
7672 other_expression = false_expression;
7674 pointer_type = false_type;
7675 other_type = true_type;
7676 other_expression = true_expression;
7679 if (is_null_pointer_constant(other_expression)) {
7680 result_type = pointer_type;
7681 } else if (is_type_pointer(other_type)) {
7682 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7683 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7686 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7687 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7689 } else if (types_compatible(get_unqualified_type(to1),
7690 get_unqualified_type(to2))) {
7693 if (warning.other) {
7694 warningf(&conditional->base.source_position,
7695 "pointer types '%T' and '%T' in conditional expression are incompatible",
7696 true_type, false_type);
7701 type_t *const type =
7702 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7703 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7704 } else if (is_type_integer(other_type)) {
7705 if (warning.other) {
7706 warningf(&conditional->base.source_position,
7707 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7709 result_type = pointer_type;
7711 if (is_type_valid(other_type)) {
7712 type_error_incompatible("while parsing conditional",
7713 &expression->base.source_position, true_type, false_type);
7715 result_type = type_error_type;
7718 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7719 type_error_incompatible("while parsing conditional",
7720 &conditional->base.source_position, true_type,
7723 result_type = type_error_type;
7726 conditional->true_expression
7727 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7728 conditional->false_expression
7729 = create_implicit_cast(false_expression, result_type);
7730 conditional->base.type = result_type;
7733 return create_invalid_expression();
7737 * Parse an extension expression.
7739 static expression_t *parse_extension(void)
7741 eat(T___extension__);
7743 bool old_gcc_extension = in_gcc_extension;
7744 in_gcc_extension = true;
7745 expression_t *expression = parse_sub_expression(PREC_UNARY);
7746 in_gcc_extension = old_gcc_extension;
7751 * Parse a __builtin_classify_type() expression.
7753 static expression_t *parse_builtin_classify_type(void)
7755 eat(T___builtin_classify_type);
7757 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7758 result->base.type = type_int;
7761 add_anchor_token(')');
7762 expression_t *expression = parse_expression();
7763 rem_anchor_token(')');
7765 result->classify_type.type_expression = expression;
7769 return create_invalid_expression();
7773 * Parse a throw expression
7774 * ISO/IEC 14882:1998(E) §15:1
7776 static expression_t *parse_throw(void)
7778 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7779 result->base.source_position = *HERE;
7780 result->base.type = type_void;
7784 expression_t *value = NULL;
7785 switch (token.type) {
7787 value = parse_assignment_expression();
7788 /* ISO/IEC 14882:1998(E) §15.1:3 */
7789 type_t *const orig_type = value->base.type;
7790 type_t *const type = skip_typeref(orig_type);
7791 if (is_type_incomplete(type)) {
7792 errorf(&value->base.source_position,
7793 "cannot throw object of incomplete type '%T'", orig_type);
7794 } else if (is_type_pointer(type)) {
7795 type_t *const points_to = skip_typeref(type->pointer.points_to);
7796 if (is_type_incomplete(points_to) &&
7797 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7798 errorf(&value->base.source_position,
7799 "cannot throw pointer to incomplete type '%T'", orig_type);
7807 result->unary.value = value;
7812 static bool check_pointer_arithmetic(const source_position_t *source_position,
7813 type_t *pointer_type,
7814 type_t *orig_pointer_type)
7816 type_t *points_to = pointer_type->pointer.points_to;
7817 points_to = skip_typeref(points_to);
7819 if (is_type_incomplete(points_to)) {
7820 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7821 errorf(source_position,
7822 "arithmetic with pointer to incomplete type '%T' not allowed",
7825 } else if (warning.pointer_arith) {
7826 warningf(source_position,
7827 "pointer of type '%T' used in arithmetic",
7830 } else if (is_type_function(points_to)) {
7832 errorf(source_position,
7833 "arithmetic with pointer to function type '%T' not allowed",
7836 } else if (warning.pointer_arith) {
7837 warningf(source_position,
7838 "pointer to a function '%T' used in arithmetic",
7845 static bool is_lvalue(const expression_t *expression)
7847 switch (expression->kind) {
7848 case EXPR_REFERENCE:
7849 case EXPR_ARRAY_ACCESS:
7851 case EXPR_UNARY_DEREFERENCE:
7855 /* Claim it is an lvalue, if the type is invalid. There was a parse
7856 * error before, which maybe prevented properly recognizing it as
7858 return !is_type_valid(skip_typeref(expression->base.type));
7862 static void semantic_incdec(unary_expression_t *expression)
7864 type_t *const orig_type = expression->value->base.type;
7865 type_t *const type = skip_typeref(orig_type);
7866 if (is_type_pointer(type)) {
7867 if (!check_pointer_arithmetic(&expression->base.source_position,
7871 } else if (!is_type_real(type) && is_type_valid(type)) {
7872 /* TODO: improve error message */
7873 errorf(&expression->base.source_position,
7874 "operation needs an arithmetic or pointer type");
7877 if (!is_lvalue(expression->value)) {
7878 /* TODO: improve error message */
7879 errorf(&expression->base.source_position, "lvalue required as operand");
7881 expression->base.type = orig_type;
7884 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7886 type_t *const orig_type = expression->value->base.type;
7887 type_t *const type = skip_typeref(orig_type);
7888 if (!is_type_arithmetic(type)) {
7889 if (is_type_valid(type)) {
7890 /* TODO: improve error message */
7891 errorf(&expression->base.source_position,
7892 "operation needs an arithmetic type");
7897 expression->base.type = orig_type;
7900 static void semantic_unexpr_plus(unary_expression_t *expression)
7902 semantic_unexpr_arithmetic(expression);
7903 if (warning.traditional)
7904 warningf(&expression->base.source_position,
7905 "traditional C rejects the unary plus operator");
7908 static expression_t const *get_reference_address(expression_t const *expr)
7910 bool regular_take_address = true;
7912 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7913 expr = expr->unary.value;
7915 regular_take_address = false;
7918 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7921 expr = expr->unary.value;
7924 if (expr->kind != EXPR_REFERENCE)
7927 if (!regular_take_address &&
7928 !is_type_function(skip_typeref(expr->reference.declaration->type))) {
7935 static void warn_function_address_as_bool(expression_t const* expr)
7937 if (!warning.address)
7940 expr = get_reference_address(expr);
7942 warningf(&expr->base.source_position,
7943 "the address of '%Y' will always evaluate as 'true'",
7944 expr->reference.declaration->symbol);
7948 static void semantic_not(unary_expression_t *expression)
7950 type_t *const orig_type = expression->value->base.type;
7951 type_t *const type = skip_typeref(orig_type);
7952 if (!is_type_scalar(type) && is_type_valid(type)) {
7953 errorf(&expression->base.source_position,
7954 "operand of ! must be of scalar type");
7957 warn_function_address_as_bool(expression->value);
7959 expression->base.type = type_int;
7962 static void semantic_unexpr_integer(unary_expression_t *expression)
7964 type_t *const orig_type = expression->value->base.type;
7965 type_t *const type = skip_typeref(orig_type);
7966 if (!is_type_integer(type)) {
7967 if (is_type_valid(type)) {
7968 errorf(&expression->base.source_position,
7969 "operand of ~ must be of integer type");
7974 expression->base.type = orig_type;
7977 static void semantic_dereference(unary_expression_t *expression)
7979 type_t *const orig_type = expression->value->base.type;
7980 type_t *const type = skip_typeref(orig_type);
7981 if (!is_type_pointer(type)) {
7982 if (is_type_valid(type)) {
7983 errorf(&expression->base.source_position,
7984 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7989 type_t *result_type = type->pointer.points_to;
7990 result_type = automatic_type_conversion(result_type);
7991 expression->base.type = result_type;
7995 * Record that an address is taken (expression represents an lvalue).
7997 * @param expression the expression
7998 * @param may_be_register if true, the expression might be an register
8000 static void set_address_taken(expression_t *expression, bool may_be_register)
8002 if (expression->kind != EXPR_REFERENCE)
8005 declaration_t *const declaration = expression->reference.declaration;
8006 /* happens for parse errors */
8007 if (declaration == NULL)
8010 if (declaration->storage_class == STORAGE_CLASS_REGISTER && !may_be_register) {
8011 errorf(&expression->base.source_position,
8012 "address of register variable '%Y' requested",
8013 declaration->symbol);
8015 declaration->address_taken = 1;
8020 * Check the semantic of the address taken expression.
8022 static void semantic_take_addr(unary_expression_t *expression)
8024 expression_t *value = expression->value;
8025 value->base.type = revert_automatic_type_conversion(value);
8027 type_t *orig_type = value->base.type;
8028 if (!is_type_valid(skip_typeref(orig_type)))
8031 set_address_taken(value, false);
8033 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8036 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8037 static expression_t *parse_##unexpression_type(void) \
8039 expression_t *unary_expression \
8040 = allocate_expression_zero(unexpression_type); \
8041 unary_expression->base.source_position = *HERE; \
8043 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8045 sfunc(&unary_expression->unary); \
8047 return unary_expression; \
8050 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8051 semantic_unexpr_arithmetic)
8052 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8053 semantic_unexpr_plus)
8054 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8056 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8057 semantic_dereference)
8058 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8060 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8061 semantic_unexpr_integer)
8062 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8064 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8067 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8069 static expression_t *parse_##unexpression_type(expression_t *left) \
8071 expression_t *unary_expression \
8072 = allocate_expression_zero(unexpression_type); \
8073 unary_expression->base.source_position = *HERE; \
8075 unary_expression->unary.value = left; \
8077 sfunc(&unary_expression->unary); \
8079 return unary_expression; \
8082 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8083 EXPR_UNARY_POSTFIX_INCREMENT,
8085 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8086 EXPR_UNARY_POSTFIX_DECREMENT,
8089 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8091 /* TODO: handle complex + imaginary types */
8093 type_left = get_unqualified_type(type_left);
8094 type_right = get_unqualified_type(type_right);
8096 /* § 6.3.1.8 Usual arithmetic conversions */
8097 if (type_left == type_long_double || type_right == type_long_double) {
8098 return type_long_double;
8099 } else if (type_left == type_double || type_right == type_double) {
8101 } else if (type_left == type_float || type_right == type_float) {
8105 type_left = promote_integer(type_left);
8106 type_right = promote_integer(type_right);
8108 if (type_left == type_right)
8111 bool const signed_left = is_type_signed(type_left);
8112 bool const signed_right = is_type_signed(type_right);
8113 int const rank_left = get_rank(type_left);
8114 int const rank_right = get_rank(type_right);
8116 if (signed_left == signed_right)
8117 return rank_left >= rank_right ? type_left : type_right;
8126 u_rank = rank_right;
8127 u_type = type_right;
8129 s_rank = rank_right;
8130 s_type = type_right;
8135 if (u_rank >= s_rank)
8138 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8140 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8141 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8145 case ATOMIC_TYPE_INT: return type_unsigned_int;
8146 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8147 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8149 default: panic("invalid atomic type");
8154 * Check the semantic restrictions for a binary expression.
8156 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8158 expression_t *const left = expression->left;
8159 expression_t *const right = expression->right;
8160 type_t *const orig_type_left = left->base.type;
8161 type_t *const orig_type_right = right->base.type;
8162 type_t *const type_left = skip_typeref(orig_type_left);
8163 type_t *const type_right = skip_typeref(orig_type_right);
8165 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8166 /* TODO: improve error message */
8167 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8168 errorf(&expression->base.source_position,
8169 "operation needs arithmetic types");
8174 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8175 expression->left = create_implicit_cast(left, arithmetic_type);
8176 expression->right = create_implicit_cast(right, arithmetic_type);
8177 expression->base.type = arithmetic_type;
8180 static void warn_div_by_zero(binary_expression_t const *const expression)
8182 if (!warning.div_by_zero ||
8183 !is_type_integer(expression->base.type))
8186 expression_t const *const right = expression->right;
8187 /* The type of the right operand can be different for /= */
8188 if (is_type_integer(right->base.type) &&
8189 is_constant_expression(right) &&
8190 fold_constant(right) == 0) {
8191 warningf(&expression->base.source_position, "division by zero");
8196 * Check the semantic restrictions for a div/mod expression.
8198 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
8199 semantic_binexpr_arithmetic(expression);
8200 warn_div_by_zero(expression);
8203 static void semantic_shift_op(binary_expression_t *expression)
8205 expression_t *const left = expression->left;
8206 expression_t *const right = expression->right;
8207 type_t *const orig_type_left = left->base.type;
8208 type_t *const orig_type_right = right->base.type;
8209 type_t * type_left = skip_typeref(orig_type_left);
8210 type_t * type_right = skip_typeref(orig_type_right);
8212 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8213 /* TODO: improve error message */
8214 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8215 errorf(&expression->base.source_position,
8216 "operands of shift operation must have integer types");
8221 type_left = promote_integer(type_left);
8222 type_right = promote_integer(type_right);
8224 expression->left = create_implicit_cast(left, type_left);
8225 expression->right = create_implicit_cast(right, type_right);
8226 expression->base.type = type_left;
8229 static void semantic_add(binary_expression_t *expression)
8231 expression_t *const left = expression->left;
8232 expression_t *const right = expression->right;
8233 type_t *const orig_type_left = left->base.type;
8234 type_t *const orig_type_right = right->base.type;
8235 type_t *const type_left = skip_typeref(orig_type_left);
8236 type_t *const type_right = skip_typeref(orig_type_right);
8239 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8240 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8241 expression->left = create_implicit_cast(left, arithmetic_type);
8242 expression->right = create_implicit_cast(right, arithmetic_type);
8243 expression->base.type = arithmetic_type;
8245 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8246 check_pointer_arithmetic(&expression->base.source_position,
8247 type_left, orig_type_left);
8248 expression->base.type = type_left;
8249 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8250 check_pointer_arithmetic(&expression->base.source_position,
8251 type_right, orig_type_right);
8252 expression->base.type = type_right;
8253 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8254 errorf(&expression->base.source_position,
8255 "invalid operands to binary + ('%T', '%T')",
8256 orig_type_left, orig_type_right);
8260 static void semantic_sub(binary_expression_t *expression)
8262 expression_t *const left = expression->left;
8263 expression_t *const right = expression->right;
8264 type_t *const orig_type_left = left->base.type;
8265 type_t *const orig_type_right = right->base.type;
8266 type_t *const type_left = skip_typeref(orig_type_left);
8267 type_t *const type_right = skip_typeref(orig_type_right);
8268 source_position_t const *const pos = &expression->base.source_position;
8271 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8272 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8273 expression->left = create_implicit_cast(left, arithmetic_type);
8274 expression->right = create_implicit_cast(right, arithmetic_type);
8275 expression->base.type = arithmetic_type;
8277 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8278 check_pointer_arithmetic(&expression->base.source_position,
8279 type_left, orig_type_left);
8280 expression->base.type = type_left;
8281 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8282 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8283 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8284 if (!types_compatible(unqual_left, unqual_right)) {
8286 "subtracting pointers to incompatible types '%T' and '%T'",
8287 orig_type_left, orig_type_right);
8288 } else if (!is_type_object(unqual_left)) {
8289 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8290 errorf(pos, "subtracting pointers to non-object types '%T'",
8292 } else if (warning.other) {
8293 warningf(pos, "subtracting pointers to void");
8296 expression->base.type = type_ptrdiff_t;
8297 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8298 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8299 orig_type_left, orig_type_right);
8303 static void warn_string_literal_address(expression_t const* expr)
8305 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8306 expr = expr->unary.value;
8307 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8309 expr = expr->unary.value;
8312 if (expr->kind == EXPR_STRING_LITERAL ||
8313 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8314 warningf(&expr->base.source_position,
8315 "comparison with string literal results in unspecified behaviour");
8320 * Check the semantics of comparison expressions.
8322 * @param expression The expression to check.
8324 static void semantic_comparison(binary_expression_t *expression)
8326 expression_t *left = expression->left;
8327 expression_t *right = expression->right;
8329 if (warning.address) {
8330 warn_string_literal_address(left);
8331 warn_string_literal_address(right);
8333 expression_t const* const func_left = get_reference_address(left);
8334 if (func_left != NULL && is_null_pointer_constant(right)) {
8335 warningf(&expression->base.source_position,
8336 "the address of '%Y' will never be NULL",
8337 func_left->reference.declaration->symbol);
8340 expression_t const* const func_right = get_reference_address(right);
8341 if (func_right != NULL && is_null_pointer_constant(right)) {
8342 warningf(&expression->base.source_position,
8343 "the address of '%Y' will never be NULL",
8344 func_right->reference.declaration->symbol);
8348 type_t *orig_type_left = left->base.type;
8349 type_t *orig_type_right = right->base.type;
8350 type_t *type_left = skip_typeref(orig_type_left);
8351 type_t *type_right = skip_typeref(orig_type_right);
8353 /* TODO non-arithmetic types */
8354 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8355 /* test for signed vs unsigned compares */
8356 if (warning.sign_compare &&
8357 (expression->base.kind != EXPR_BINARY_EQUAL &&
8358 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
8359 (is_type_signed(type_left) != is_type_signed(type_right))) {
8361 /* check if 1 of the operands is a constant, in this case we just
8362 * check wether we can safely represent the resulting constant in
8363 * the type of the other operand. */
8364 expression_t *const_expr = NULL;
8365 expression_t *other_expr = NULL;
8367 if (is_constant_expression(left)) {
8370 } else if (is_constant_expression(right)) {
8375 if (const_expr != NULL) {
8376 type_t *other_type = skip_typeref(other_expr->base.type);
8377 long val = fold_constant(const_expr);
8378 /* TODO: check if val can be represented by other_type */
8382 warningf(&expression->base.source_position,
8383 "comparison between signed and unsigned");
8385 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8386 expression->left = create_implicit_cast(left, arithmetic_type);
8387 expression->right = create_implicit_cast(right, arithmetic_type);
8388 expression->base.type = arithmetic_type;
8389 if (warning.float_equal &&
8390 (expression->base.kind == EXPR_BINARY_EQUAL ||
8391 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8392 is_type_float(arithmetic_type)) {
8393 warningf(&expression->base.source_position,
8394 "comparing floating point with == or != is unsafe");
8396 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8397 /* TODO check compatibility */
8398 } else if (is_type_pointer(type_left)) {
8399 expression->right = create_implicit_cast(right, type_left);
8400 } else if (is_type_pointer(type_right)) {
8401 expression->left = create_implicit_cast(left, type_right);
8402 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8403 type_error_incompatible("invalid operands in comparison",
8404 &expression->base.source_position,
8405 type_left, type_right);
8407 expression->base.type = type_int;
8411 * Checks if a compound type has constant fields.
8413 static bool has_const_fields(const compound_type_t *type)
8415 const scope_t *scope = &type->declaration->scope;
8416 const declaration_t *declaration = scope->declarations;
8418 for (; declaration != NULL; declaration = declaration->next) {
8419 if (declaration->namespc != NAMESPACE_NORMAL)
8422 const type_t *decl_type = skip_typeref(declaration->type);
8423 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8430 static bool is_valid_assignment_lhs(expression_t const* const left)
8432 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8433 type_t *const type_left = skip_typeref(orig_type_left);
8435 if (!is_lvalue(left)) {
8436 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8441 if (is_type_array(type_left)) {
8442 errorf(HERE, "cannot assign to arrays ('%E')", left);
8445 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8446 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8450 if (is_type_incomplete(type_left)) {
8451 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8452 left, orig_type_left);
8455 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8456 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8457 left, orig_type_left);
8464 static void semantic_arithmetic_assign(binary_expression_t *expression)
8466 expression_t *left = expression->left;
8467 expression_t *right = expression->right;
8468 type_t *orig_type_left = left->base.type;
8469 type_t *orig_type_right = right->base.type;
8471 if (!is_valid_assignment_lhs(left))
8474 type_t *type_left = skip_typeref(orig_type_left);
8475 type_t *type_right = skip_typeref(orig_type_right);
8477 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8478 /* TODO: improve error message */
8479 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8480 errorf(&expression->base.source_position,
8481 "operation needs arithmetic types");
8486 /* combined instructions are tricky. We can't create an implicit cast on
8487 * the left side, because we need the uncasted form for the store.
8488 * The ast2firm pass has to know that left_type must be right_type
8489 * for the arithmetic operation and create a cast by itself */
8490 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8491 expression->right = create_implicit_cast(right, arithmetic_type);
8492 expression->base.type = type_left;
8495 static void semantic_divmod_assign(binary_expression_t *expression)
8497 semantic_arithmetic_assign(expression);
8498 warn_div_by_zero(expression);
8501 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8503 expression_t *const left = expression->left;
8504 expression_t *const right = expression->right;
8505 type_t *const orig_type_left = left->base.type;
8506 type_t *const orig_type_right = right->base.type;
8507 type_t *const type_left = skip_typeref(orig_type_left);
8508 type_t *const type_right = skip_typeref(orig_type_right);
8510 if (!is_valid_assignment_lhs(left))
8513 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8514 /* combined instructions are tricky. We can't create an implicit cast on
8515 * the left side, because we need the uncasted form for the store.
8516 * The ast2firm pass has to know that left_type must be right_type
8517 * for the arithmetic operation and create a cast by itself */
8518 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8519 expression->right = create_implicit_cast(right, arithmetic_type);
8520 expression->base.type = type_left;
8521 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8522 check_pointer_arithmetic(&expression->base.source_position,
8523 type_left, orig_type_left);
8524 expression->base.type = type_left;
8525 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8526 errorf(&expression->base.source_position,
8527 "incompatible types '%T' and '%T' in assignment",
8528 orig_type_left, orig_type_right);
8533 * Check the semantic restrictions of a logical expression.
8535 static void semantic_logical_op(binary_expression_t *expression)
8537 expression_t *const left = expression->left;
8538 expression_t *const right = expression->right;
8539 type_t *const orig_type_left = left->base.type;
8540 type_t *const orig_type_right = right->base.type;
8541 type_t *const type_left = skip_typeref(orig_type_left);
8542 type_t *const type_right = skip_typeref(orig_type_right);
8544 warn_function_address_as_bool(left);
8545 warn_function_address_as_bool(right);
8547 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
8548 /* TODO: improve error message */
8549 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8550 errorf(&expression->base.source_position,
8551 "operation needs scalar types");
8556 expression->base.type = type_int;
8560 * Check the semantic restrictions of a binary assign expression.
8562 static void semantic_binexpr_assign(binary_expression_t *expression)
8564 expression_t *left = expression->left;
8565 type_t *orig_type_left = left->base.type;
8567 if (!is_valid_assignment_lhs(left))
8570 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8571 report_assign_error(error, orig_type_left, expression->right,
8572 "assignment", &left->base.source_position);
8573 expression->right = create_implicit_cast(expression->right, orig_type_left);
8574 expression->base.type = orig_type_left;
8578 * Determine if the outermost operation (or parts thereof) of the given
8579 * expression has no effect in order to generate a warning about this fact.
8580 * Therefore in some cases this only examines some of the operands of the
8581 * expression (see comments in the function and examples below).
8583 * f() + 23; // warning, because + has no effect
8584 * x || f(); // no warning, because x controls execution of f()
8585 * x ? y : f(); // warning, because y has no effect
8586 * (void)x; // no warning to be able to suppress the warning
8587 * This function can NOT be used for an "expression has definitely no effect"-
8589 static bool expression_has_effect(const expression_t *const expr)
8591 switch (expr->kind) {
8592 case EXPR_UNKNOWN: break;
8593 case EXPR_INVALID: return true; /* do NOT warn */
8594 case EXPR_REFERENCE: return false;
8595 /* suppress the warning for microsoft __noop operations */
8596 case EXPR_CONST: return expr->conste.is_ms_noop;
8597 case EXPR_CHARACTER_CONSTANT: return false;
8598 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8599 case EXPR_STRING_LITERAL: return false;
8600 case EXPR_WIDE_STRING_LITERAL: return false;
8601 case EXPR_LABEL_ADDRESS: return false;
8604 const call_expression_t *const call = &expr->call;
8605 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
8608 switch (call->function->builtin_symbol.symbol->ID) {
8609 case T___builtin_va_end: return true;
8610 default: return false;
8614 /* Generate the warning if either the left or right hand side of a
8615 * conditional expression has no effect */
8616 case EXPR_CONDITIONAL: {
8617 const conditional_expression_t *const cond = &expr->conditional;
8619 expression_has_effect(cond->true_expression) &&
8620 expression_has_effect(cond->false_expression);
8623 case EXPR_SELECT: return false;
8624 case EXPR_ARRAY_ACCESS: return false;
8625 case EXPR_SIZEOF: return false;
8626 case EXPR_CLASSIFY_TYPE: return false;
8627 case EXPR_ALIGNOF: return false;
8629 case EXPR_FUNCNAME: return false;
8630 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
8631 case EXPR_BUILTIN_CONSTANT_P: return false;
8632 case EXPR_BUILTIN_PREFETCH: return true;
8633 case EXPR_OFFSETOF: return false;
8634 case EXPR_VA_START: return true;
8635 case EXPR_VA_ARG: return true;
8636 case EXPR_STATEMENT: return true; // TODO
8637 case EXPR_COMPOUND_LITERAL: return false;
8639 case EXPR_UNARY_NEGATE: return false;
8640 case EXPR_UNARY_PLUS: return false;
8641 case EXPR_UNARY_BITWISE_NEGATE: return false;
8642 case EXPR_UNARY_NOT: return false;
8643 case EXPR_UNARY_DEREFERENCE: return false;
8644 case EXPR_UNARY_TAKE_ADDRESS: return false;
8645 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8646 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8647 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8648 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8650 /* Treat void casts as if they have an effect in order to being able to
8651 * suppress the warning */
8652 case EXPR_UNARY_CAST: {
8653 type_t *const type = skip_typeref(expr->base.type);
8654 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8657 case EXPR_UNARY_CAST_IMPLICIT: return true;
8658 case EXPR_UNARY_ASSUME: return true;
8659 case EXPR_UNARY_THROW: return true;
8661 case EXPR_BINARY_ADD: return false;
8662 case EXPR_BINARY_SUB: return false;
8663 case EXPR_BINARY_MUL: return false;
8664 case EXPR_BINARY_DIV: return false;
8665 case EXPR_BINARY_MOD: return false;
8666 case EXPR_BINARY_EQUAL: return false;
8667 case EXPR_BINARY_NOTEQUAL: return false;
8668 case EXPR_BINARY_LESS: return false;
8669 case EXPR_BINARY_LESSEQUAL: return false;
8670 case EXPR_BINARY_GREATER: return false;
8671 case EXPR_BINARY_GREATEREQUAL: return false;
8672 case EXPR_BINARY_BITWISE_AND: return false;
8673 case EXPR_BINARY_BITWISE_OR: return false;
8674 case EXPR_BINARY_BITWISE_XOR: return false;
8675 case EXPR_BINARY_SHIFTLEFT: return false;
8676 case EXPR_BINARY_SHIFTRIGHT: return false;
8677 case EXPR_BINARY_ASSIGN: return true;
8678 case EXPR_BINARY_MUL_ASSIGN: return true;
8679 case EXPR_BINARY_DIV_ASSIGN: return true;
8680 case EXPR_BINARY_MOD_ASSIGN: return true;
8681 case EXPR_BINARY_ADD_ASSIGN: return true;
8682 case EXPR_BINARY_SUB_ASSIGN: return true;
8683 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8684 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8685 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8686 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8687 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8689 /* Only examine the right hand side of && and ||, because the left hand
8690 * side already has the effect of controlling the execution of the right
8692 case EXPR_BINARY_LOGICAL_AND:
8693 case EXPR_BINARY_LOGICAL_OR:
8694 /* Only examine the right hand side of a comma expression, because the left
8695 * hand side has a separate warning */
8696 case EXPR_BINARY_COMMA:
8697 return expression_has_effect(expr->binary.right);
8699 case EXPR_BINARY_BUILTIN_EXPECT: return true;
8700 case EXPR_BINARY_ISGREATER: return false;
8701 case EXPR_BINARY_ISGREATEREQUAL: return false;
8702 case EXPR_BINARY_ISLESS: return false;
8703 case EXPR_BINARY_ISLESSEQUAL: return false;
8704 case EXPR_BINARY_ISLESSGREATER: return false;
8705 case EXPR_BINARY_ISUNORDERED: return false;
8708 internal_errorf(HERE, "unexpected expression");
8711 static void semantic_comma(binary_expression_t *expression)
8713 if (warning.unused_value) {
8714 const expression_t *const left = expression->left;
8715 if (!expression_has_effect(left)) {
8716 warningf(&left->base.source_position,
8717 "left-hand operand of comma expression has no effect");
8720 expression->base.type = expression->right->base.type;
8724 * @param prec_r precedence of the right operand
8726 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8727 static expression_t *parse_##binexpression_type(expression_t *left) \
8729 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8730 binexpr->base.source_position = *HERE; \
8731 binexpr->binary.left = left; \
8734 expression_t *right = parse_sub_expression(prec_r); \
8736 binexpr->binary.right = right; \
8737 sfunc(&binexpr->binary); \
8742 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8743 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8744 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8745 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8746 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8747 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8748 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8749 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8750 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8751 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8752 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8753 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8754 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8755 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8756 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8757 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8758 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8759 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8760 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8761 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8762 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8763 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8764 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8765 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8766 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8767 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8768 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8769 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8770 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8771 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8774 static expression_t *parse_sub_expression(precedence_t precedence)
8776 if (token.type < 0) {
8777 return expected_expression_error();
8780 expression_parser_function_t *parser
8781 = &expression_parsers[token.type];
8782 source_position_t source_position = token.source_position;
8785 if (parser->parser != NULL) {
8786 left = parser->parser();
8788 left = parse_primary_expression();
8790 assert(left != NULL);
8791 left->base.source_position = source_position;
8794 if (token.type < 0) {
8795 return expected_expression_error();
8798 parser = &expression_parsers[token.type];
8799 if (parser->infix_parser == NULL)
8801 if (parser->infix_precedence < precedence)
8804 left = parser->infix_parser(left);
8806 assert(left != NULL);
8807 assert(left->kind != EXPR_UNKNOWN);
8808 left->base.source_position = source_position;
8815 * Parse an expression.
8817 static expression_t *parse_expression(void)
8819 return parse_sub_expression(PREC_EXPRESSION);
8823 * Register a parser for a prefix-like operator.
8825 * @param parser the parser function
8826 * @param token_type the token type of the prefix token
8828 static void register_expression_parser(parse_expression_function parser,
8831 expression_parser_function_t *entry = &expression_parsers[token_type];
8833 if (entry->parser != NULL) {
8834 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8835 panic("trying to register multiple expression parsers for a token");
8837 entry->parser = parser;
8841 * Register a parser for an infix operator with given precedence.
8843 * @param parser the parser function
8844 * @param token_type the token type of the infix operator
8845 * @param precedence the precedence of the operator
8847 static void register_infix_parser(parse_expression_infix_function parser,
8848 int token_type, unsigned precedence)
8850 expression_parser_function_t *entry = &expression_parsers[token_type];
8852 if (entry->infix_parser != NULL) {
8853 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8854 panic("trying to register multiple infix expression parsers for a "
8857 entry->infix_parser = parser;
8858 entry->infix_precedence = precedence;
8862 * Initialize the expression parsers.
8864 static void init_expression_parsers(void)
8866 memset(&expression_parsers, 0, sizeof(expression_parsers));
8868 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8869 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8870 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8871 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8872 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8873 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8874 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8875 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8876 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8877 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8878 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8879 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8880 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8881 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8882 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8883 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8884 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8885 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8886 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8887 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8888 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8889 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8890 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8891 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8892 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8893 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8894 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8895 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8896 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8897 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8898 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8899 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8900 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8901 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8902 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8903 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8904 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8906 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8907 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8908 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8909 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8910 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8911 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8912 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8913 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8914 register_expression_parser(parse_sizeof, T_sizeof);
8915 register_expression_parser(parse_alignof, T___alignof__);
8916 register_expression_parser(parse_extension, T___extension__);
8917 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8918 register_expression_parser(parse_throw, T_throw);
8922 * Parse a asm statement arguments specification.
8924 static asm_argument_t *parse_asm_arguments(bool is_out)
8926 asm_argument_t *result = NULL;
8927 asm_argument_t *last = NULL;
8929 while (token.type == T_STRING_LITERAL || token.type == '[') {
8930 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8931 memset(argument, 0, sizeof(argument[0]));
8933 if (token.type == '[') {
8935 if (token.type != T_IDENTIFIER) {
8936 parse_error_expected("while parsing asm argument",
8937 T_IDENTIFIER, NULL);
8940 argument->symbol = token.v.symbol;
8945 argument->constraints = parse_string_literals();
8947 add_anchor_token(')');
8948 expression_t *expression = parse_expression();
8949 rem_anchor_token(')');
8951 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8952 * change size or type representation (e.g. int -> long is ok, but
8953 * int -> float is not) */
8954 if (expression->kind == EXPR_UNARY_CAST) {
8955 type_t *const type = expression->base.type;
8956 type_kind_t const kind = type->kind;
8957 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8960 if (kind == TYPE_ATOMIC) {
8961 atomic_type_kind_t const akind = type->atomic.akind;
8962 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8963 size = get_atomic_type_size(akind);
8965 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8966 size = get_atomic_type_size(get_intptr_kind());
8970 expression_t *const value = expression->unary.value;
8971 type_t *const value_type = value->base.type;
8972 type_kind_t const value_kind = value_type->kind;
8974 unsigned value_flags;
8975 unsigned value_size;
8976 if (value_kind == TYPE_ATOMIC) {
8977 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8978 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8979 value_size = get_atomic_type_size(value_akind);
8980 } else if (value_kind == TYPE_POINTER) {
8981 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8982 value_size = get_atomic_type_size(get_intptr_kind());
8987 if (value_flags != flags || value_size != size)
8991 } while (expression->kind == EXPR_UNARY_CAST);
8995 if (!is_lvalue(expression)) {
8996 errorf(&expression->base.source_position,
8997 "asm output argument is not an lvalue");
9000 if (argument->constraints.begin[0] == '+')
9001 mark_decls_read(expression, NULL);
9003 mark_decls_read(expression, NULL);
9005 argument->expression = expression;
9008 set_address_taken(expression, true);
9011 last->next = argument;
9017 if (token.type != ',')
9028 * Parse a asm statement clobber specification.
9030 static asm_clobber_t *parse_asm_clobbers(void)
9032 asm_clobber_t *result = NULL;
9033 asm_clobber_t *last = NULL;
9035 while(token.type == T_STRING_LITERAL) {
9036 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9037 clobber->clobber = parse_string_literals();
9040 last->next = clobber;
9046 if (token.type != ',')
9055 * Parse an asm statement.
9057 static statement_t *parse_asm_statement(void)
9059 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9060 asm_statement_t *asm_statement = &statement->asms;
9064 if (token.type == T_volatile) {
9066 asm_statement->is_volatile = true;
9070 add_anchor_token(')');
9071 add_anchor_token(':');
9072 asm_statement->asm_text = parse_string_literals();
9074 if (token.type != ':') {
9075 rem_anchor_token(':');
9080 asm_statement->outputs = parse_asm_arguments(true);
9081 if (token.type != ':') {
9082 rem_anchor_token(':');
9087 asm_statement->inputs = parse_asm_arguments(false);
9088 if (token.type != ':') {
9089 rem_anchor_token(':');
9092 rem_anchor_token(':');
9095 asm_statement->clobbers = parse_asm_clobbers();
9098 rem_anchor_token(')');
9102 if (asm_statement->outputs == NULL) {
9103 /* GCC: An 'asm' instruction without any output operands will be treated
9104 * identically to a volatile 'asm' instruction. */
9105 asm_statement->is_volatile = true;
9110 return create_invalid_statement();
9114 * Parse a case statement.
9116 static statement_t *parse_case_statement(void)
9118 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9119 source_position_t *const pos = &statement->base.source_position;
9123 expression_t *const expression = parse_expression();
9124 statement->case_label.expression = expression;
9125 if (!is_constant_expression(expression)) {
9126 /* This check does not prevent the error message in all cases of an
9127 * prior error while parsing the expression. At least it catches the
9128 * common case of a mistyped enum entry. */
9129 if (is_type_valid(skip_typeref(expression->base.type))) {
9130 errorf(pos, "case label does not reduce to an integer constant");
9132 statement->case_label.is_bad = true;
9134 long const val = fold_constant(expression);
9135 statement->case_label.first_case = val;
9136 statement->case_label.last_case = val;
9140 if (token.type == T_DOTDOTDOT) {
9142 expression_t *const end_range = parse_expression();
9143 statement->case_label.end_range = end_range;
9144 if (!is_constant_expression(end_range)) {
9145 /* This check does not prevent the error message in all cases of an
9146 * prior error while parsing the expression. At least it catches the
9147 * common case of a mistyped enum entry. */
9148 if (is_type_valid(skip_typeref(end_range->base.type))) {
9149 errorf(pos, "case range does not reduce to an integer constant");
9151 statement->case_label.is_bad = true;
9153 long const val = fold_constant(end_range);
9154 statement->case_label.last_case = val;
9156 if (warning.other && val < statement->case_label.first_case) {
9157 statement->case_label.is_empty_range = true;
9158 warningf(pos, "empty range specified");
9164 PUSH_PARENT(statement);
9168 if (current_switch != NULL) {
9169 if (! statement->case_label.is_bad) {
9170 /* Check for duplicate case values */
9171 case_label_statement_t *c = &statement->case_label;
9172 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9173 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9176 if (c->last_case < l->first_case || c->first_case > l->last_case)
9179 errorf(pos, "duplicate case value (previously used %P)",
9180 &l->base.source_position);
9184 /* link all cases into the switch statement */
9185 if (current_switch->last_case == NULL) {
9186 current_switch->first_case = &statement->case_label;
9188 current_switch->last_case->next = &statement->case_label;
9190 current_switch->last_case = &statement->case_label;
9192 errorf(pos, "case label not within a switch statement");
9195 statement_t *const inner_stmt = parse_statement();
9196 statement->case_label.statement = inner_stmt;
9197 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9198 errorf(&inner_stmt->base.source_position, "declaration after case label");
9205 return create_invalid_statement();
9209 * Parse a default statement.
9211 static statement_t *parse_default_statement(void)
9213 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9217 PUSH_PARENT(statement);
9220 if (current_switch != NULL) {
9221 const case_label_statement_t *def_label = current_switch->default_label;
9222 if (def_label != NULL) {
9223 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9224 &def_label->base.source_position);
9226 current_switch->default_label = &statement->case_label;
9228 /* link all cases into the switch statement */
9229 if (current_switch->last_case == NULL) {
9230 current_switch->first_case = &statement->case_label;
9232 current_switch->last_case->next = &statement->case_label;
9234 current_switch->last_case = &statement->case_label;
9237 errorf(&statement->base.source_position,
9238 "'default' label not within a switch statement");
9241 statement_t *const inner_stmt = parse_statement();
9242 statement->case_label.statement = inner_stmt;
9243 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9244 errorf(&inner_stmt->base.source_position, "declaration after default label");
9251 return create_invalid_statement();
9255 * Parse a label statement.
9257 static statement_t *parse_label_statement(void)
9259 assert(token.type == T_IDENTIFIER);
9260 symbol_t *symbol = token.v.symbol;
9261 declaration_t *label = get_label(symbol);
9263 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9264 statement->label.label = label;
9268 PUSH_PARENT(statement);
9270 /* if statement is already set then the label is defined twice,
9271 * otherwise it was just mentioned in a goto/local label declaration so far */
9272 if (label->init.statement != NULL) {
9273 errorf(HERE, "duplicate label '%Y' (declared %P)",
9274 symbol, &label->source_position);
9276 label->source_position = token.source_position;
9277 label->init.statement = statement;
9282 if (token.type == '}') {
9283 /* TODO only warn? */
9284 if (warning.other && false) {
9285 warningf(HERE, "label at end of compound statement");
9286 statement->label.statement = create_empty_statement();
9288 errorf(HERE, "label at end of compound statement");
9289 statement->label.statement = create_invalid_statement();
9291 } else if (token.type == ';') {
9292 /* Eat an empty statement here, to avoid the warning about an empty
9293 * statement after a label. label:; is commonly used to have a label
9294 * before a closing brace. */
9295 statement->label.statement = create_empty_statement();
9298 statement_t *const inner_stmt = parse_statement();
9299 statement->label.statement = inner_stmt;
9300 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9301 errorf(&inner_stmt->base.source_position, "declaration after label");
9305 /* remember the labels in a list for later checking */
9306 if (label_last == NULL) {
9307 label_first = &statement->label;
9309 label_last->next = &statement->label;
9311 label_last = &statement->label;
9318 * Parse an if statement.
9320 static statement_t *parse_if(void)
9322 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9326 PUSH_PARENT(statement);
9328 add_anchor_token('{');
9331 add_anchor_token(')');
9332 expression_t *const expr = parse_expression();
9333 statement->ifs.condition = expr;
9334 mark_decls_read(expr, NULL);
9335 rem_anchor_token(')');
9339 rem_anchor_token('{');
9341 add_anchor_token(T_else);
9342 statement->ifs.true_statement = parse_statement();
9343 rem_anchor_token(T_else);
9345 if (token.type == T_else) {
9347 statement->ifs.false_statement = parse_statement();
9355 * Check that all enums are handled in a switch.
9357 * @param statement the switch statement to check
9359 static void check_enum_cases(const switch_statement_t *statement) {
9360 const type_t *type = skip_typeref(statement->expression->base.type);
9361 if (! is_type_enum(type))
9363 const enum_type_t *enumt = &type->enumt;
9365 /* if we have a default, no warnings */
9366 if (statement->default_label != NULL)
9369 /* FIXME: calculation of value should be done while parsing */
9370 const declaration_t *declaration;
9371 long last_value = -1;
9372 for (declaration = enumt->declaration->next;
9373 declaration != NULL && declaration->storage_class == STORAGE_CLASS_ENUM_ENTRY;
9374 declaration = declaration->next) {
9375 const expression_t *expression = declaration->init.enum_value;
9376 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
9378 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9379 if (l->expression == NULL)
9381 if (l->first_case <= value && value <= l->last_case) {
9387 warningf(&statement->base.source_position,
9388 "enumeration value '%Y' not handled in switch", declaration->symbol);
9395 * Parse a switch statement.
9397 static statement_t *parse_switch(void)
9399 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9403 PUSH_PARENT(statement);
9406 add_anchor_token(')');
9407 expression_t *const expr = parse_expression();
9408 mark_decls_read(expr, NULL);
9409 type_t * type = skip_typeref(expr->base.type);
9410 if (is_type_integer(type)) {
9411 type = promote_integer(type);
9412 if (warning.traditional) {
9413 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9414 warningf(&expr->base.source_position,
9415 "'%T' switch expression not converted to '%T' in ISO C",
9419 } else if (is_type_valid(type)) {
9420 errorf(&expr->base.source_position,
9421 "switch quantity is not an integer, but '%T'", type);
9422 type = type_error_type;
9424 statement->switchs.expression = create_implicit_cast(expr, type);
9426 rem_anchor_token(')');
9428 switch_statement_t *rem = current_switch;
9429 current_switch = &statement->switchs;
9430 statement->switchs.body = parse_statement();
9431 current_switch = rem;
9433 if (warning.switch_default &&
9434 statement->switchs.default_label == NULL) {
9435 warningf(&statement->base.source_position, "switch has no default case");
9437 if (warning.switch_enum)
9438 check_enum_cases(&statement->switchs);
9444 return create_invalid_statement();
9447 static statement_t *parse_loop_body(statement_t *const loop)
9449 statement_t *const rem = current_loop;
9450 current_loop = loop;
9452 statement_t *const body = parse_statement();
9459 * Parse a while statement.
9461 static statement_t *parse_while(void)
9463 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9467 PUSH_PARENT(statement);
9470 add_anchor_token(')');
9471 expression_t *const cond = parse_expression();
9472 statement->whiles.condition = cond;
9473 mark_decls_read(cond, NULL);
9474 rem_anchor_token(')');
9477 statement->whiles.body = parse_loop_body(statement);
9483 return create_invalid_statement();
9487 * Parse a do statement.
9489 static statement_t *parse_do(void)
9491 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9495 PUSH_PARENT(statement);
9497 add_anchor_token(T_while);
9498 statement->do_while.body = parse_loop_body(statement);
9499 rem_anchor_token(T_while);
9503 add_anchor_token(')');
9504 expression_t *const cond = parse_expression();
9505 statement->do_while.condition = cond;
9506 mark_decls_read(cond, NULL);
9507 rem_anchor_token(')');
9515 return create_invalid_statement();
9519 * Parse a for statement.
9521 static statement_t *parse_for(void)
9523 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9527 PUSH_PARENT(statement);
9529 size_t const top = environment_top();
9530 scope_push(&statement->fors.scope);
9533 add_anchor_token(')');
9535 if (token.type != ';') {
9536 if (is_declaration_specifier(&token, false)) {
9537 parse_declaration(record_declaration);
9539 add_anchor_token(';');
9540 expression_t *const init = parse_expression();
9541 statement->fors.initialisation = init;
9542 mark_decls_read(init, DECL_ANY);
9543 if (warning.unused_value && !expression_has_effect(init)) {
9544 warningf(&init->base.source_position,
9545 "initialisation of 'for'-statement has no effect");
9547 rem_anchor_token(';');
9554 if (token.type != ';') {
9555 add_anchor_token(';');
9556 expression_t *const cond = parse_expression();
9557 statement->fors.condition = cond;
9558 mark_decls_read(cond, NULL);
9559 rem_anchor_token(';');
9562 if (token.type != ')') {
9563 expression_t *const step = parse_expression();
9564 statement->fors.step = step;
9565 mark_decls_read(step, DECL_ANY);
9566 if (warning.unused_value && !expression_has_effect(step)) {
9567 warningf(&step->base.source_position,
9568 "step of 'for'-statement has no effect");
9571 rem_anchor_token(')');
9573 statement->fors.body = parse_loop_body(statement);
9575 assert(scope == &statement->fors.scope);
9577 environment_pop_to(top);
9584 rem_anchor_token(')');
9585 assert(scope == &statement->fors.scope);
9587 environment_pop_to(top);
9589 return create_invalid_statement();
9593 * Parse a goto statement.
9595 static statement_t *parse_goto(void)
9597 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9600 if (GNU_MODE && token.type == '*') {
9602 expression_t *expression = parse_expression();
9603 mark_decls_read(expression, NULL);
9605 /* Argh: although documentation say the expression must be of type void *,
9606 * gcc excepts anything that can be casted into void * without error */
9607 type_t *type = expression->base.type;
9609 if (type != type_error_type) {
9610 if (!is_type_pointer(type) && !is_type_integer(type)) {
9611 errorf(&expression->base.source_position,
9612 "cannot convert to a pointer type");
9613 } else if (warning.other && type != type_void_ptr) {
9614 warningf(&expression->base.source_position,
9615 "type of computed goto expression should be 'void*' not '%T'", type);
9617 expression = create_implicit_cast(expression, type_void_ptr);
9620 statement->gotos.expression = expression;
9622 if (token.type != T_IDENTIFIER) {
9624 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9626 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9630 symbol_t *symbol = token.v.symbol;
9633 statement->gotos.label = get_label(symbol);
9636 /* remember the goto's in a list for later checking */
9637 if (goto_last == NULL) {
9638 goto_first = &statement->gotos;
9640 goto_last->next = &statement->gotos;
9642 goto_last = &statement->gotos;
9648 return create_invalid_statement();
9652 * Parse a continue statement.
9654 static statement_t *parse_continue(void)
9656 if (current_loop == NULL) {
9657 errorf(HERE, "continue statement not within loop");
9660 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9670 * Parse a break statement.
9672 static statement_t *parse_break(void)
9674 if (current_switch == NULL && current_loop == NULL) {
9675 errorf(HERE, "break statement not within loop or switch");
9678 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9688 * Parse a __leave statement.
9690 static statement_t *parse_leave_statement(void)
9692 if (current_try == NULL) {
9693 errorf(HERE, "__leave statement not within __try");
9696 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9706 * Check if a given declaration represents a local variable.
9708 static bool is_local_var_declaration(const declaration_t *declaration)
9710 switch ((storage_class_tag_t) declaration->storage_class) {
9711 case STORAGE_CLASS_AUTO:
9712 case STORAGE_CLASS_REGISTER: {
9713 const type_t *type = skip_typeref(declaration->type);
9714 if (is_type_function(type)) {
9726 * Check if a given declaration represents a variable.
9728 static bool is_var_declaration(const declaration_t *declaration)
9730 if (declaration->storage_class == STORAGE_CLASS_TYPEDEF)
9733 const type_t *type = skip_typeref(declaration->type);
9734 return !is_type_function(type);
9738 * Check if a given expression represents a local variable.
9740 static bool is_local_variable(const expression_t *expression)
9742 if (expression->base.kind != EXPR_REFERENCE) {
9745 const declaration_t *declaration = expression->reference.declaration;
9746 return is_local_var_declaration(declaration);
9750 * Check if a given expression represents a local variable and
9751 * return its declaration then, else return NULL.
9753 declaration_t *expr_is_variable(const expression_t *expression)
9755 if (expression->base.kind != EXPR_REFERENCE) {
9758 declaration_t *declaration = expression->reference.declaration;
9759 if (is_var_declaration(declaration))
9765 * Parse a return statement.
9767 static statement_t *parse_return(void)
9771 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9773 expression_t *return_value = NULL;
9774 if (token.type != ';') {
9775 return_value = parse_expression();
9776 mark_decls_read(return_value, NULL);
9779 const type_t *const func_type = current_function->type;
9780 assert(is_type_function(func_type));
9781 type_t *const return_type = skip_typeref(func_type->function.return_type);
9783 if (return_value != NULL) {
9784 type_t *return_value_type = skip_typeref(return_value->base.type);
9786 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID) &&
9787 !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9788 if (warning.other) {
9789 warningf(&statement->base.source_position,
9790 "'return' with a value, in function returning void");
9792 return_value = NULL;
9794 assign_error_t error = semantic_assign(return_type, return_value);
9795 report_assign_error(error, return_type, return_value, "'return'",
9796 &statement->base.source_position);
9797 return_value = create_implicit_cast(return_value, return_type);
9799 /* check for returning address of a local var */
9800 if (warning.other &&
9801 return_value != NULL &&
9802 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9803 const expression_t *expression = return_value->unary.value;
9804 if (is_local_variable(expression)) {
9805 warningf(&statement->base.source_position,
9806 "function returns address of local variable");
9809 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9810 warningf(&statement->base.source_position,
9811 "'return' without value, in function returning non-void");
9813 statement->returns.value = return_value;
9822 * Parse a declaration statement.
9824 static statement_t *parse_declaration_statement(void)
9826 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9828 declaration_t *before = last_declaration;
9830 parse_external_declaration();
9832 parse_declaration(record_declaration);
9834 if (before == NULL) {
9835 statement->declaration.declarations_begin = scope->declarations;
9837 statement->declaration.declarations_begin = before->next;
9839 statement->declaration.declarations_end = last_declaration;
9845 * Parse an expression statement, ie. expr ';'.
9847 static statement_t *parse_expression_statement(void)
9849 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9851 expression_t *const expr = parse_expression();
9852 statement->expression.expression = expr;
9853 mark_decls_read(expr, DECL_ANY);
9862 * Parse a microsoft __try { } __finally { } or
9863 * __try{ } __except() { }
9865 static statement_t *parse_ms_try_statment(void)
9867 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9870 PUSH_PARENT(statement);
9872 ms_try_statement_t *rem = current_try;
9873 current_try = &statement->ms_try;
9874 statement->ms_try.try_statement = parse_compound_statement(false);
9879 if (token.type == T___except) {
9882 add_anchor_token(')');
9883 expression_t *const expr = parse_expression();
9884 mark_decls_read(expr, NULL);
9885 type_t * type = skip_typeref(expr->base.type);
9886 if (is_type_integer(type)) {
9887 type = promote_integer(type);
9888 } else if (is_type_valid(type)) {
9889 errorf(&expr->base.source_position,
9890 "__expect expression is not an integer, but '%T'", type);
9891 type = type_error_type;
9893 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9894 rem_anchor_token(')');
9896 statement->ms_try.final_statement = parse_compound_statement(false);
9897 } else if (token.type == T__finally) {
9899 statement->ms_try.final_statement = parse_compound_statement(false);
9901 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9902 return create_invalid_statement();
9906 return create_invalid_statement();
9909 static statement_t *parse_empty_statement(void)
9911 if (warning.empty_statement) {
9912 warningf(HERE, "statement is empty");
9914 statement_t *const statement = create_empty_statement();
9919 static statement_t *parse_local_label_declaration(void) {
9920 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9924 declaration_t *begin = NULL, *end = NULL;
9927 if (token.type != T_IDENTIFIER) {
9928 parse_error_expected("while parsing local label declaration",
9929 T_IDENTIFIER, NULL);
9932 symbol_t *symbol = token.v.symbol;
9933 declaration_t *declaration = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
9934 if (declaration != NULL) {
9935 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition at %P)",
9936 symbol, &declaration->source_position);
9938 declaration = allocate_declaration_zero();
9939 declaration->namespc = NAMESPACE_LOCAL_LABEL;
9940 declaration->source_position = token.source_position;
9941 declaration->symbol = symbol;
9942 declaration->parent_scope = scope;
9943 declaration->init.statement = NULL;
9946 end->next = declaration;
9949 begin = declaration;
9951 local_label_push(declaration);
9955 if (token.type != ',')
9961 statement->declaration.declarations_begin = begin;
9962 statement->declaration.declarations_end = end;
9967 * Parse a statement.
9968 * There's also parse_statement() which additionally checks for
9969 * "statement has no effect" warnings
9971 static statement_t *intern_parse_statement(void)
9973 statement_t *statement = NULL;
9975 /* declaration or statement */
9976 add_anchor_token(';');
9977 switch (token.type) {
9978 case T_IDENTIFIER: {
9979 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
9980 if (la1_type == ':') {
9981 statement = parse_label_statement();
9982 } else if (is_typedef_symbol(token.v.symbol)) {
9983 statement = parse_declaration_statement();
9984 } else switch (la1_type) {
9986 if (get_declaration(token.v.symbol, NAMESPACE_NORMAL) != NULL)
9987 goto expression_statment;
9992 statement = parse_declaration_statement();
9996 expression_statment:
9997 statement = parse_expression_statement();
10003 case T___extension__:
10004 /* This can be a prefix to a declaration or an expression statement.
10005 * We simply eat it now and parse the rest with tail recursion. */
10008 } while (token.type == T___extension__);
10009 bool old_gcc_extension = in_gcc_extension;
10010 in_gcc_extension = true;
10011 statement = parse_statement();
10012 in_gcc_extension = old_gcc_extension;
10016 statement = parse_declaration_statement();
10020 statement = parse_local_label_declaration();
10023 case ';': statement = parse_empty_statement(); break;
10024 case '{': statement = parse_compound_statement(false); break;
10025 case T___leave: statement = parse_leave_statement(); break;
10026 case T___try: statement = parse_ms_try_statment(); break;
10027 case T_asm: statement = parse_asm_statement(); break;
10028 case T_break: statement = parse_break(); break;
10029 case T_case: statement = parse_case_statement(); break;
10030 case T_continue: statement = parse_continue(); break;
10031 case T_default: statement = parse_default_statement(); break;
10032 case T_do: statement = parse_do(); break;
10033 case T_for: statement = parse_for(); break;
10034 case T_goto: statement = parse_goto(); break;
10035 case T_if: statement = parse_if(); break;
10036 case T_return: statement = parse_return(); break;
10037 case T_switch: statement = parse_switch(); break;
10038 case T_while: statement = parse_while(); break;
10041 statement = parse_expression_statement();
10045 errorf(HERE, "unexpected token %K while parsing statement", &token);
10046 statement = create_invalid_statement();
10051 rem_anchor_token(';');
10053 assert(statement != NULL
10054 && statement->base.source_position.input_name != NULL);
10060 * parse a statement and emits "statement has no effect" warning if needed
10061 * (This is really a wrapper around intern_parse_statement with check for 1
10062 * single warning. It is needed, because for statement expressions we have
10063 * to avoid the warning on the last statement)
10065 static statement_t *parse_statement(void)
10067 statement_t *statement = intern_parse_statement();
10069 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10070 expression_t *expression = statement->expression.expression;
10071 if (!expression_has_effect(expression)) {
10072 warningf(&expression->base.source_position,
10073 "statement has no effect");
10081 * Parse a compound statement.
10083 static statement_t *parse_compound_statement(bool inside_expression_statement)
10085 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10087 PUSH_PARENT(statement);
10090 add_anchor_token('}');
10092 size_t const top = environment_top();
10093 size_t const top_local = local_label_top();
10094 scope_push(&statement->compound.scope);
10096 statement_t **anchor = &statement->compound.statements;
10097 bool only_decls_so_far = true;
10098 while (token.type != '}') {
10099 if (token.type == T_EOF) {
10100 errorf(&statement->base.source_position,
10101 "EOF while parsing compound statement");
10104 statement_t *sub_statement = intern_parse_statement();
10105 if (is_invalid_statement(sub_statement)) {
10106 /* an error occurred. if we are at an anchor, return */
10112 if (warning.declaration_after_statement) {
10113 if (sub_statement->kind != STATEMENT_DECLARATION) {
10114 only_decls_so_far = false;
10115 } else if (!only_decls_so_far) {
10116 warningf(&sub_statement->base.source_position,
10117 "ISO C90 forbids mixed declarations and code");
10121 *anchor = sub_statement;
10123 while (sub_statement->base.next != NULL)
10124 sub_statement = sub_statement->base.next;
10126 anchor = &sub_statement->base.next;
10130 /* look over all statements again to produce no effect warnings */
10131 if (warning.unused_value) {
10132 statement_t *sub_statement = statement->compound.statements;
10133 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10134 if (sub_statement->kind != STATEMENT_EXPRESSION)
10136 /* don't emit a warning for the last expression in an expression
10137 * statement as it has always an effect */
10138 if (inside_expression_statement && sub_statement->base.next == NULL)
10141 expression_t *expression = sub_statement->expression.expression;
10142 if (!expression_has_effect(expression)) {
10143 warningf(&expression->base.source_position,
10144 "statement has no effect");
10150 rem_anchor_token('}');
10151 assert(scope == &statement->compound.scope);
10153 environment_pop_to(top);
10154 local_label_pop_to(top_local);
10161 * Initialize builtin types.
10163 static void initialize_builtin_types(void)
10165 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
10166 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
10167 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
10168 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
10169 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
10170 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
10171 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
10172 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
10174 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
10175 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
10176 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
10177 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
10179 /* const version of wchar_t */
10180 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF);
10181 type_const_wchar_t->typedeft.declaration = type_wchar_t->typedeft.declaration;
10182 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
10184 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
10188 * Check for unused global static functions and variables
10190 static void check_unused_globals(void)
10192 if (!warning.unused_function && !warning.unused_variable)
10195 for (const declaration_t *decl = file_scope->declarations; decl != NULL; decl = decl->next) {
10197 decl->modifiers & DM_UNUSED ||
10198 decl->modifiers & DM_USED ||
10199 decl->storage_class != STORAGE_CLASS_STATIC)
10202 type_t *const type = decl->type;
10204 if (is_type_function(skip_typeref(type))) {
10205 if (!warning.unused_function || decl->is_inline)
10208 s = (decl->init.statement != NULL ? "defined" : "declared");
10210 if (!warning.unused_variable)
10216 warningf(&decl->source_position, "'%#T' %s but not used",
10217 type, decl->symbol, s);
10221 static void parse_global_asm(void)
10223 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10228 statement->asms.asm_text = parse_string_literals();
10229 statement->base.next = unit->global_asm;
10230 unit->global_asm = statement;
10239 * Parse a translation unit.
10241 static void parse_translation_unit(void)
10243 add_anchor_token(T_EOF);
10246 unsigned char token_anchor_copy[T_LAST_TOKEN];
10247 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10251 bool anchor_leak = false;
10252 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10253 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10255 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10256 anchor_leak = true;
10259 if (in_gcc_extension) {
10260 errorf(HERE, "Leaked __extension__");
10261 anchor_leak = true;
10268 switch (token.type) {
10271 case T___extension__:
10272 parse_external_declaration();
10276 parse_global_asm();
10280 rem_anchor_token(T_EOF);
10284 if (!strict_mode) {
10286 warningf(HERE, "stray ';' outside of function");
10293 errorf(HERE, "stray %K outside of function", &token);
10294 if (token.type == '(' || token.type == '{' || token.type == '[')
10295 eat_until_matching_token(token.type);
10305 * @return the translation unit or NULL if errors occurred.
10307 void start_parsing(void)
10309 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10310 label_stack = NEW_ARR_F(stack_entry_t, 0);
10311 local_label_stack = NEW_ARR_F(stack_entry_t, 0);
10312 diagnostic_count = 0;
10316 type_set_output(stderr);
10317 ast_set_output(stderr);
10319 assert(unit == NULL);
10320 unit = allocate_ast_zero(sizeof(unit[0]));
10322 assert(file_scope == NULL);
10323 file_scope = &unit->scope;
10325 assert(scope == NULL);
10326 scope_push(&unit->scope);
10328 initialize_builtin_types();
10331 translation_unit_t *finish_parsing(void)
10333 /* do NOT use scope_pop() here, this will crash, will it by hand */
10334 assert(scope == &unit->scope);
10336 last_declaration = NULL;
10338 assert(file_scope == &unit->scope);
10339 check_unused_globals();
10342 DEL_ARR_F(environment_stack);
10343 DEL_ARR_F(label_stack);
10344 DEL_ARR_F(local_label_stack);
10346 translation_unit_t *result = unit;
10353 lookahead_bufpos = 0;
10354 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10357 parse_translation_unit();
10361 * Initialize the parser.
10363 void init_parser(void)
10365 sym_anonymous = symbol_table_insert("<anonymous>");
10367 if (c_mode & _MS) {
10368 /* add predefined symbols for extended-decl-modifier */
10369 sym_align = symbol_table_insert("align");
10370 sym_allocate = symbol_table_insert("allocate");
10371 sym_dllimport = symbol_table_insert("dllimport");
10372 sym_dllexport = symbol_table_insert("dllexport");
10373 sym_naked = symbol_table_insert("naked");
10374 sym_noinline = symbol_table_insert("noinline");
10375 sym_noreturn = symbol_table_insert("noreturn");
10376 sym_nothrow = symbol_table_insert("nothrow");
10377 sym_novtable = symbol_table_insert("novtable");
10378 sym_property = symbol_table_insert("property");
10379 sym_get = symbol_table_insert("get");
10380 sym_put = symbol_table_insert("put");
10381 sym_selectany = symbol_table_insert("selectany");
10382 sym_thread = symbol_table_insert("thread");
10383 sym_uuid = symbol_table_insert("uuid");
10384 sym_deprecated = symbol_table_insert("deprecated");
10385 sym_restrict = symbol_table_insert("restrict");
10386 sym_noalias = symbol_table_insert("noalias");
10388 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10390 init_expression_parsers();
10391 obstack_init(&temp_obst);
10393 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10394 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10398 * Terminate the parser.
10400 void exit_parser(void)
10402 obstack_free(&temp_obst, NULL);