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 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
4049 if (!(c_mode & _CXX))
4050 type->unspecified_parameters = 1;
4051 goto parameters_finished;
4054 declaration_t *declaration;
4055 declaration_t *last_declaration = NULL;
4056 function_parameter_t *parameter;
4057 function_parameter_t *last_parameter = NULL;
4060 switch(token.type) {
4064 goto parameters_finished;
4067 case T___extension__:
4069 declaration = parse_parameter();
4071 /* func(void) is not a parameter */
4072 if (last_parameter == NULL
4073 && token.type == ')'
4074 && declaration->symbol == NULL
4075 && skip_typeref(declaration->type) == type_void) {
4076 goto parameters_finished;
4078 semantic_parameter(declaration);
4080 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
4081 memset(parameter, 0, sizeof(parameter[0]));
4082 parameter->type = declaration->type;
4084 if (last_parameter != NULL) {
4085 last_declaration->next = declaration;
4086 last_parameter->next = parameter;
4088 type->parameters = parameter;
4089 declarations = declaration;
4091 last_parameter = parameter;
4092 last_declaration = declaration;
4096 goto parameters_finished;
4098 if (token.type != ',') {
4099 goto parameters_finished;
4105 parameters_finished:
4106 rem_anchor_token(')');
4109 restore_anchor_state(',', saved_comma_state);
4110 *last = last_declaration;
4111 return declarations;
4114 restore_anchor_state(',', saved_comma_state);
4119 typedef enum construct_type_kind_t {
4124 } construct_type_kind_t;
4126 typedef struct construct_type_t construct_type_t;
4127 struct construct_type_t {
4128 construct_type_kind_t kind;
4129 construct_type_t *next;
4132 typedef struct parsed_pointer_t parsed_pointer_t;
4133 struct parsed_pointer_t {
4134 construct_type_t construct_type;
4135 type_qualifiers_t type_qualifiers;
4138 typedef struct construct_function_type_t construct_function_type_t;
4139 struct construct_function_type_t {
4140 construct_type_t construct_type;
4141 type_t *function_type;
4144 typedef struct parsed_array_t parsed_array_t;
4145 struct parsed_array_t {
4146 construct_type_t construct_type;
4147 type_qualifiers_t type_qualifiers;
4153 typedef struct construct_base_type_t construct_base_type_t;
4154 struct construct_base_type_t {
4155 construct_type_t construct_type;
4159 static construct_type_t *parse_pointer_declarator(void)
4163 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
4164 memset(pointer, 0, sizeof(pointer[0]));
4165 pointer->construct_type.kind = CONSTRUCT_POINTER;
4166 pointer->type_qualifiers = parse_type_qualifiers();
4168 return (construct_type_t*) pointer;
4171 static construct_type_t *parse_array_declarator(void)
4174 add_anchor_token(']');
4176 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
4177 memset(array, 0, sizeof(array[0]));
4178 array->construct_type.kind = CONSTRUCT_ARRAY;
4180 if (token.type == T_static) {
4181 array->is_static = true;
4185 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4186 if (type_qualifiers != 0) {
4187 if (token.type == T_static) {
4188 array->is_static = true;
4192 array->type_qualifiers = type_qualifiers;
4194 if (token.type == '*' && look_ahead(1)->type == ']') {
4195 array->is_variable = true;
4197 } else if (token.type != ']') {
4198 array->size = parse_assignment_expression();
4201 rem_anchor_token(']');
4205 return (construct_type_t*) array;
4208 static construct_type_t *parse_function_declarator(declaration_t *declaration)
4211 if (declaration != NULL) {
4212 type = allocate_type_zero(TYPE_FUNCTION);
4214 unsigned mask = declaration->modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
4216 if (mask & (mask-1)) {
4217 const char *first = NULL, *second = NULL;
4219 /* more than one calling convention set */
4220 if (declaration->modifiers & DM_CDECL) {
4221 if (first == NULL) first = "cdecl";
4222 else if (second == NULL) second = "cdecl";
4224 if (declaration->modifiers & DM_STDCALL) {
4225 if (first == NULL) first = "stdcall";
4226 else if (second == NULL) second = "stdcall";
4228 if (declaration->modifiers & DM_FASTCALL) {
4229 if (first == NULL) first = "fastcall";
4230 else if (second == NULL) second = "fastcall";
4232 if (declaration->modifiers & DM_THISCALL) {
4233 if (first == NULL) first = "thiscall";
4234 else if (second == NULL) second = "thiscall";
4236 errorf(&declaration->source_position, "%s and %s attributes are not compatible", first, second);
4239 if (declaration->modifiers & DM_CDECL)
4240 type->function.calling_convention = CC_CDECL;
4241 else if (declaration->modifiers & DM_STDCALL)
4242 type->function.calling_convention = CC_STDCALL;
4243 else if (declaration->modifiers & DM_FASTCALL)
4244 type->function.calling_convention = CC_FASTCALL;
4245 else if (declaration->modifiers & DM_THISCALL)
4246 type->function.calling_convention = CC_THISCALL;
4248 type = allocate_type_zero(TYPE_FUNCTION);
4251 declaration_t *last;
4252 declaration_t *parameters = parse_parameters(&type->function, &last);
4253 if (declaration != NULL) {
4254 declaration->scope.declarations = parameters;
4255 declaration->scope.last_declaration = last;
4258 construct_function_type_t *construct_function_type =
4259 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
4260 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
4261 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
4262 construct_function_type->function_type = type;
4264 return &construct_function_type->construct_type;
4267 static void fix_declaration_type(declaration_t *declaration)
4269 decl_modifiers_t declaration_modifiers = declaration->modifiers;
4270 type_modifiers_t type_modifiers = declaration->type->base.modifiers;
4272 if (declaration_modifiers & DM_TRANSPARENT_UNION)
4273 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4275 if (declaration->type->base.modifiers == type_modifiers)
4278 type_t *copy = duplicate_type(declaration->type);
4279 copy->base.modifiers = type_modifiers;
4281 type_t *result = typehash_insert(copy);
4282 if (result != copy) {
4283 obstack_free(type_obst, copy);
4286 declaration->type = result;
4289 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
4290 bool may_be_abstract)
4292 /* construct a single linked list of construct_type_t's which describe
4293 * how to construct the final declarator type */
4294 construct_type_t *first = NULL;
4295 construct_type_t *last = NULL;
4296 gnu_attribute_t *attributes = NULL;
4298 decl_modifiers_t modifiers = parse_attributes(&attributes);
4301 while (token.type == '*') {
4302 construct_type_t *type = parse_pointer_declarator();
4312 /* TODO: find out if this is correct */
4313 modifiers |= parse_attributes(&attributes);
4316 if (declaration != NULL)
4317 declaration->modifiers |= modifiers;
4319 construct_type_t *inner_types = NULL;
4321 switch(token.type) {
4323 if (declaration == NULL) {
4324 errorf(HERE, "no identifier expected in typename");
4326 declaration->symbol = token.v.symbol;
4327 declaration->source_position = token.source_position;
4333 add_anchor_token(')');
4334 inner_types = parse_inner_declarator(declaration, may_be_abstract);
4335 if (inner_types != NULL) {
4336 /* All later declarators only modify the return type, not declaration */
4339 rem_anchor_token(')');
4343 if (may_be_abstract)
4345 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4350 construct_type_t *p = last;
4353 construct_type_t *type;
4354 switch(token.type) {
4356 type = parse_function_declarator(declaration);
4359 type = parse_array_declarator();
4362 goto declarator_finished;
4365 /* insert in the middle of the list (behind p) */
4367 type->next = p->next;
4378 declarator_finished:
4379 /* append inner_types at the end of the list, we don't to set last anymore
4380 * as it's not needed anymore */
4382 assert(first == NULL);
4383 first = inner_types;
4385 last->next = inner_types;
4393 static void parse_declaration_attributes(declaration_t *declaration)
4395 gnu_attribute_t *attributes = NULL;
4396 decl_modifiers_t modifiers = parse_attributes(&attributes);
4398 if (declaration == NULL)
4401 declaration->modifiers |= modifiers;
4402 /* check if we have these stupid mode attributes... */
4403 type_t *old_type = declaration->type;
4404 if (old_type == NULL)
4407 gnu_attribute_t *attribute = attributes;
4408 for ( ; attribute != NULL; attribute = attribute->next) {
4409 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
4412 atomic_type_kind_t akind = attribute->u.akind;
4413 if (!is_type_signed(old_type)) {
4415 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
4416 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
4417 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
4418 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
4420 panic("invalid akind in mode attribute");
4424 = make_atomic_type(akind, old_type->base.qualifiers);
4428 static type_t *construct_declarator_type(construct_type_t *construct_list,
4431 construct_type_t *iter = construct_list;
4432 for( ; iter != NULL; iter = iter->next) {
4433 switch(iter->kind) {
4434 case CONSTRUCT_INVALID:
4435 internal_errorf(HERE, "invalid type construction found");
4436 case CONSTRUCT_FUNCTION: {
4437 construct_function_type_t *construct_function_type
4438 = (construct_function_type_t*) iter;
4440 type_t *function_type = construct_function_type->function_type;
4442 function_type->function.return_type = type;
4444 type_t *skipped_return_type = skip_typeref(type);
4446 if (is_type_function(skipped_return_type)) {
4447 errorf(HERE, "function returning function is not allowed");
4448 } else if (is_type_array(skipped_return_type)) {
4449 errorf(HERE, "function returning array is not allowed");
4451 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4453 "type qualifiers in return type of function type are meaningless");
4457 type = function_type;
4461 case CONSTRUCT_POINTER: {
4462 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4463 type = make_pointer_type(type, parsed_pointer->type_qualifiers);
4467 case CONSTRUCT_ARRAY: {
4468 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4469 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4471 expression_t *size_expression = parsed_array->size;
4472 if (size_expression != NULL) {
4474 = create_implicit_cast(size_expression, type_size_t);
4477 array_type->base.qualifiers = parsed_array->type_qualifiers;
4478 array_type->array.element_type = type;
4479 array_type->array.is_static = parsed_array->is_static;
4480 array_type->array.is_variable = parsed_array->is_variable;
4481 array_type->array.size_expression = size_expression;
4483 if (size_expression != NULL) {
4484 if (is_constant_expression(size_expression)) {
4485 array_type->array.size_constant = true;
4486 array_type->array.size
4487 = fold_constant(size_expression);
4489 array_type->array.is_vla = true;
4493 type_t *skipped_type = skip_typeref(type);
4495 if (is_type_incomplete(skipped_type)) {
4496 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4497 } else if (is_type_function(skipped_type)) {
4498 errorf(HERE, "array of functions is not allowed");
4505 type_t *hashed_type = typehash_insert(type);
4506 if (hashed_type != type) {
4507 /* the function type was constructed earlier freeing it here will
4508 * destroy other types... */
4509 if (iter->kind != CONSTRUCT_FUNCTION) {
4519 static declaration_t *parse_declarator(
4520 const declaration_specifiers_t *specifiers, bool may_be_abstract)
4522 declaration_t *const declaration = allocate_declaration_zero();
4523 declaration->source_position = specifiers->source_position;
4524 declaration->declared_storage_class = specifiers->declared_storage_class;
4525 declaration->modifiers = specifiers->modifiers;
4526 declaration->deprecated_string = specifiers->deprecated_string;
4527 declaration->get_property_sym = specifiers->get_property_sym;
4528 declaration->put_property_sym = specifiers->put_property_sym;
4529 declaration->is_inline = specifiers->is_inline;
4531 declaration->storage_class = specifiers->declared_storage_class;
4532 if (declaration->storage_class == STORAGE_CLASS_NONE &&
4533 scope != file_scope) {
4534 declaration->storage_class = STORAGE_CLASS_AUTO;
4537 if (specifiers->alignment != 0) {
4538 /* TODO: add checks here */
4539 declaration->alignment = specifiers->alignment;
4542 construct_type_t *construct_type
4543 = parse_inner_declarator(declaration, may_be_abstract);
4544 type_t *const type = specifiers->type;
4545 declaration->type = construct_declarator_type(construct_type, type);
4547 parse_declaration_attributes(declaration);
4549 fix_declaration_type(declaration);
4551 if (construct_type != NULL) {
4552 obstack_free(&temp_obst, construct_type);
4558 static type_t *parse_abstract_declarator(type_t *base_type)
4560 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4562 type_t *result = construct_declarator_type(construct_type, base_type);
4563 if (construct_type != NULL) {
4564 obstack_free(&temp_obst, construct_type);
4570 static declaration_t *append_declaration(declaration_t* const declaration)
4572 if (last_declaration != NULL) {
4573 last_declaration->next = declaration;
4575 scope->declarations = declaration;
4577 last_declaration = declaration;
4582 * Check if the declaration of main is suspicious. main should be a
4583 * function with external linkage, returning int, taking either zero
4584 * arguments, two, or three arguments of appropriate types, ie.
4586 * int main([ int argc, char **argv [, char **env ] ]).
4588 * @param decl the declaration to check
4589 * @param type the function type of the declaration
4591 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
4593 if (decl->storage_class == STORAGE_CLASS_STATIC) {
4594 warningf(&decl->source_position,
4595 "'main' is normally a non-static function");
4597 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4598 warningf(&decl->source_position,
4599 "return type of 'main' should be 'int', but is '%T'",
4600 func_type->return_type);
4602 const function_parameter_t *parm = func_type->parameters;
4604 type_t *const first_type = parm->type;
4605 if (!types_compatible(skip_typeref(first_type), type_int)) {
4606 warningf(&decl->source_position,
4607 "first argument of 'main' should be 'int', but is '%T'", first_type);
4611 type_t *const second_type = parm->type;
4612 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4613 warningf(&decl->source_position,
4614 "second argument of 'main' should be 'char**', but is '%T'", second_type);
4618 type_t *const third_type = parm->type;
4619 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4620 warningf(&decl->source_position,
4621 "third argument of 'main' should be 'char**', but is '%T'", third_type);
4625 goto warn_arg_count;
4629 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
4635 * Check if a symbol is the equal to "main".
4637 static bool is_sym_main(const symbol_t *const sym)
4639 return strcmp(sym->string, "main") == 0;
4642 static declaration_t *record_declaration(
4643 declaration_t *const declaration,
4644 const bool is_definition)
4646 const symbol_t *const symbol = declaration->symbol;
4647 const namespace_t namespc = (namespace_t)declaration->namespc;
4649 assert(symbol != NULL);
4650 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4652 type_t *const orig_type = declaration->type;
4653 type_t *const type = skip_typeref(orig_type);
4654 if (is_type_function(type) &&
4655 type->function.unspecified_parameters &&
4656 warning.strict_prototypes &&
4657 previous_declaration == NULL) {
4658 warningf(&declaration->source_position,
4659 "function declaration '%#T' is not a prototype",
4663 if (warning.main && is_type_function(type) && is_sym_main(symbol)) {
4664 check_type_of_main(declaration, &type->function);
4667 if (warning.nested_externs &&
4668 declaration->storage_class == STORAGE_CLASS_EXTERN &&
4669 scope != file_scope) {
4670 warningf(&declaration->source_position,
4671 "nested extern declaration of '%#T'", declaration->type, symbol);
4674 assert(declaration != previous_declaration);
4675 if (previous_declaration != NULL &&
4676 previous_declaration->parent_scope == ¤t_function->scope &&
4677 scope->depth == previous_declaration->parent_scope->depth + 1) {
4678 errorf(&declaration->source_position,
4679 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4680 orig_type, symbol, previous_declaration->type, symbol,
4681 &previous_declaration->source_position);
4684 if (previous_declaration != NULL &&
4685 previous_declaration->parent_scope == scope) {
4686 /* can happen for K&R style declarations */
4687 if (previous_declaration->type == NULL) {
4688 previous_declaration->type = declaration->type;
4691 const type_t *prev_type = skip_typeref(previous_declaration->type);
4692 if (!types_compatible(type, prev_type)) {
4693 errorf(&declaration->source_position,
4694 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4695 orig_type, symbol, previous_declaration->type, symbol,
4696 &previous_declaration->source_position);
4698 unsigned old_storage_class = previous_declaration->storage_class;
4699 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
4700 errorf(&declaration->source_position,
4701 "redeclaration of enum entry '%Y' (declared %P)",
4702 symbol, &previous_declaration->source_position);
4703 return previous_declaration;
4706 if (warning.redundant_decls &&
4708 previous_declaration->storage_class == STORAGE_CLASS_STATIC &&
4709 !(previous_declaration->modifiers & DM_USED) &&
4710 !previous_declaration->used) {
4711 warningf(&previous_declaration->source_position,
4712 "unnecessary static forward declaration for '%#T'",
4713 previous_declaration->type, symbol);
4716 unsigned new_storage_class = declaration->storage_class;
4718 if (is_type_incomplete(prev_type)) {
4719 previous_declaration->type = type;
4723 /* pretend no storage class means extern for function
4724 * declarations (except if the previous declaration is neither
4725 * none nor extern) */
4726 if (is_type_function(type)) {
4727 if (prev_type->function.unspecified_parameters) {
4728 previous_declaration->type = type;
4732 switch (old_storage_class) {
4733 case STORAGE_CLASS_NONE:
4734 old_storage_class = STORAGE_CLASS_EXTERN;
4737 case STORAGE_CLASS_EXTERN:
4738 if (is_definition) {
4739 if (warning.missing_prototypes &&
4740 prev_type->function.unspecified_parameters &&
4741 !is_sym_main(symbol)) {
4742 warningf(&declaration->source_position,
4743 "no previous prototype for '%#T'",
4746 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4747 new_storage_class = STORAGE_CLASS_EXTERN;
4756 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4757 new_storage_class == STORAGE_CLASS_EXTERN) {
4758 warn_redundant_declaration:
4759 if (!is_definition &&
4760 warning.redundant_decls &&
4761 is_type_valid(prev_type) &&
4762 strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
4763 warningf(&declaration->source_position,
4764 "redundant declaration for '%Y' (declared %P)",
4765 symbol, &previous_declaration->source_position);
4767 } else if (current_function == NULL) {
4768 if (old_storage_class != STORAGE_CLASS_STATIC &&
4769 new_storage_class == STORAGE_CLASS_STATIC) {
4770 errorf(&declaration->source_position,
4771 "static declaration of '%Y' follows non-static declaration (declared %P)",
4772 symbol, &previous_declaration->source_position);
4773 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4774 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4775 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4777 goto warn_redundant_declaration;
4779 } else if (is_type_valid(prev_type)) {
4780 if (old_storage_class == new_storage_class) {
4781 errorf(&declaration->source_position,
4782 "redeclaration of '%Y' (declared %P)",
4783 symbol, &previous_declaration->source_position);
4785 errorf(&declaration->source_position,
4786 "redeclaration of '%Y' with different linkage (declared %P)",
4787 symbol, &previous_declaration->source_position);
4792 previous_declaration->modifiers |= declaration->modifiers;
4793 previous_declaration->is_inline |= declaration->is_inline;
4794 return previous_declaration;
4795 } else if (is_type_function(type)) {
4796 if (is_definition &&
4797 declaration->storage_class != STORAGE_CLASS_STATIC) {
4798 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4799 warningf(&declaration->source_position,
4800 "no previous prototype for '%#T'", orig_type, symbol);
4801 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4802 warningf(&declaration->source_position,
4803 "no previous declaration for '%#T'", orig_type,
4808 if (warning.missing_declarations &&
4809 scope == file_scope && (
4810 declaration->storage_class == STORAGE_CLASS_NONE ||
4811 declaration->storage_class == STORAGE_CLASS_THREAD
4813 warningf(&declaration->source_position,
4814 "no previous declaration for '%#T'", orig_type, symbol);
4818 assert(declaration->parent_scope == NULL);
4819 assert(scope != NULL);
4821 declaration->parent_scope = scope;
4823 environment_push(declaration);
4824 return append_declaration(declaration);
4827 static void parser_error_multiple_definition(declaration_t *declaration,
4828 const source_position_t *source_position)
4830 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4831 declaration->symbol, &declaration->source_position);
4834 static bool is_declaration_specifier(const token_t *token,
4835 bool only_specifiers_qualifiers)
4837 switch (token->type) {
4842 return is_typedef_symbol(token->v.symbol);
4844 case T___extension__:
4846 return !only_specifiers_qualifiers;
4853 static void parse_init_declarator_rest(declaration_t *declaration)
4857 type_t *orig_type = declaration->type;
4858 type_t *type = skip_typeref(orig_type);
4860 if (declaration->init.initializer != NULL) {
4861 parser_error_multiple_definition(declaration, HERE);
4864 bool must_be_constant = false;
4865 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4866 declaration->storage_class == STORAGE_CLASS_THREAD_STATIC ||
4867 declaration->parent_scope == file_scope) {
4868 must_be_constant = true;
4871 if (is_type_function(type)) {
4872 errorf(&declaration->source_position,
4873 "function '%#T' is initialized like a variable",
4874 orig_type, declaration->symbol);
4875 orig_type = type_error_type;
4878 parse_initializer_env_t env;
4879 env.type = orig_type;
4880 env.must_be_constant = must_be_constant;
4881 env.declaration = current_init_decl = declaration;
4883 initializer_t *initializer = parse_initializer(&env);
4884 current_init_decl = NULL;
4886 if (!is_type_function(type)) {
4887 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
4888 * the array type size */
4889 declaration->type = env.type;
4890 declaration->init.initializer = initializer;
4894 /* parse rest of a declaration without any declarator */
4895 static void parse_anonymous_declaration_rest(
4896 const declaration_specifiers_t *specifiers)
4900 if (warning.other) {
4901 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) {
4902 warningf(&specifiers->source_position,
4903 "useless storage class in empty declaration");
4906 type_t *type = specifiers->type;
4907 switch (type->kind) {
4908 case TYPE_COMPOUND_STRUCT:
4909 case TYPE_COMPOUND_UNION: {
4910 if (type->compound.declaration->symbol == NULL) {
4911 warningf(&specifiers->source_position,
4912 "unnamed struct/union that defines no instances");
4921 warningf(&specifiers->source_position, "empty declaration");
4926 #ifdef RECORD_EMPTY_DECLARATIONS
4927 declaration_t *const declaration = allocate_declaration_zero();
4928 declaration->type = specifiers->type;
4929 declaration->declared_storage_class = specifiers->declared_storage_class;
4930 declaration->source_position = specifiers->source_position;
4931 declaration->modifiers = specifiers->modifiers;
4932 declaration->storage_class = STORAGE_CLASS_NONE;
4934 append_declaration(declaration);
4938 static void parse_declaration_rest(declaration_t *ndeclaration,
4939 const declaration_specifiers_t *specifiers,
4940 parsed_declaration_func finished_declaration)
4942 add_anchor_token(';');
4943 add_anchor_token(',');
4945 declaration_t *declaration =
4946 finished_declaration(ndeclaration, token.type == '=');
4948 type_t *orig_type = declaration->type;
4949 type_t *type = skip_typeref(orig_type);
4951 if (warning.other &&
4952 type->kind != TYPE_FUNCTION &&
4953 declaration->is_inline &&
4954 is_type_valid(type)) {
4955 warningf(&declaration->source_position,
4956 "variable '%Y' declared 'inline'\n", declaration->symbol);
4959 if (token.type == '=') {
4960 parse_init_declarator_rest(declaration);
4963 if (token.type != ',')
4967 add_anchor_token('=');
4968 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4969 rem_anchor_token('=');
4974 rem_anchor_token(';');
4975 rem_anchor_token(',');
4978 static declaration_t *finished_kr_declaration(declaration_t *declaration, bool is_definition)
4980 symbol_t *symbol = declaration->symbol;
4981 if (symbol == NULL) {
4982 errorf(HERE, "anonymous declaration not valid as function parameter");
4985 namespace_t namespc = (namespace_t) declaration->namespc;
4986 if (namespc != NAMESPACE_NORMAL) {
4987 return record_declaration(declaration, false);
4990 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4991 if (previous_declaration == NULL ||
4992 previous_declaration->parent_scope != scope) {
4993 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4998 if (is_definition) {
4999 errorf(HERE, "parameter %Y is initialised", declaration->symbol);
5002 if (previous_declaration->type == NULL) {
5003 previous_declaration->type = declaration->type;
5004 previous_declaration->declared_storage_class = declaration->declared_storage_class;
5005 previous_declaration->storage_class = declaration->storage_class;
5006 previous_declaration->parent_scope = scope;
5007 return previous_declaration;
5009 return record_declaration(declaration, false);
5013 static void parse_declaration(parsed_declaration_func finished_declaration)
5015 declaration_specifiers_t specifiers;
5016 memset(&specifiers, 0, sizeof(specifiers));
5018 add_anchor_token(';');
5019 parse_declaration_specifiers(&specifiers);
5020 rem_anchor_token(';');
5022 if (token.type == ';') {
5023 parse_anonymous_declaration_rest(&specifiers);
5025 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5026 parse_declaration_rest(declaration, &specifiers, finished_declaration);
5030 static type_t *get_default_promoted_type(type_t *orig_type)
5032 type_t *result = orig_type;
5034 type_t *type = skip_typeref(orig_type);
5035 if (is_type_integer(type)) {
5036 result = promote_integer(type);
5037 } else if (type == type_float) {
5038 result = type_double;
5044 static void parse_kr_declaration_list(declaration_t *declaration)
5046 type_t *type = skip_typeref(declaration->type);
5047 if (!is_type_function(type))
5050 if (!type->function.kr_style_parameters)
5053 add_anchor_token('{');
5055 /* push function parameters */
5056 size_t const top = environment_top();
5057 scope_push(&declaration->scope);
5059 declaration_t *parameter = declaration->scope.declarations;
5060 for ( ; parameter != NULL; parameter = parameter->next) {
5061 assert(parameter->parent_scope == NULL);
5062 parameter->parent_scope = scope;
5063 environment_push(parameter);
5066 /* parse declaration list */
5067 while (is_declaration_specifier(&token, false)) {
5068 parse_declaration(finished_kr_declaration);
5071 /* pop function parameters */
5072 assert(scope == &declaration->scope);
5074 environment_pop_to(top);
5076 /* update function type */
5077 type_t *new_type = duplicate_type(type);
5079 function_parameter_t *parameters = NULL;
5080 function_parameter_t *last_parameter = NULL;
5082 declaration_t *parameter_declaration = declaration->scope.declarations;
5083 for( ; parameter_declaration != NULL;
5084 parameter_declaration = parameter_declaration->next) {
5085 type_t *parameter_type = parameter_declaration->type;
5086 if (parameter_type == NULL) {
5088 errorf(HERE, "no type specified for function parameter '%Y'",
5089 parameter_declaration->symbol);
5091 if (warning.implicit_int) {
5092 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5093 parameter_declaration->symbol);
5095 parameter_type = type_int;
5096 parameter_declaration->type = parameter_type;
5100 semantic_parameter(parameter_declaration);
5101 parameter_type = parameter_declaration->type;
5104 * we need the default promoted types for the function type
5106 parameter_type = get_default_promoted_type(parameter_type);
5108 function_parameter_t *function_parameter
5109 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
5110 memset(function_parameter, 0, sizeof(function_parameter[0]));
5112 function_parameter->type = parameter_type;
5113 if (last_parameter != NULL) {
5114 last_parameter->next = function_parameter;
5116 parameters = function_parameter;
5118 last_parameter = function_parameter;
5121 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
5123 new_type->function.parameters = parameters;
5124 new_type->function.unspecified_parameters = true;
5126 type = typehash_insert(new_type);
5127 if (type != new_type) {
5128 obstack_free(type_obst, new_type);
5131 declaration->type = type;
5133 rem_anchor_token('{');
5136 static bool first_err = true;
5139 * When called with first_err set, prints the name of the current function,
5142 static void print_in_function(void)
5146 diagnosticf("%s: In function '%Y':\n",
5147 current_function->source_position.input_name,
5148 current_function->symbol);
5153 * Check if all labels are defined in the current function.
5154 * Check if all labels are used in the current function.
5156 static void check_labels(void)
5158 for (const goto_statement_t *goto_statement = goto_first;
5159 goto_statement != NULL;
5160 goto_statement = goto_statement->next) {
5161 /* skip computed gotos */
5162 if (goto_statement->expression != NULL)
5165 declaration_t *label = goto_statement->label;
5168 if (label->source_position.input_name == NULL) {
5169 print_in_function();
5170 errorf(&goto_statement->base.source_position,
5171 "label '%Y' used but not defined", label->symbol);
5174 goto_first = goto_last = NULL;
5176 if (warning.unused_label) {
5177 for (const label_statement_t *label_statement = label_first;
5178 label_statement != NULL;
5179 label_statement = label_statement->next) {
5180 const declaration_t *label = label_statement->label;
5182 if (! label->used) {
5183 print_in_function();
5184 warningf(&label_statement->base.source_position,
5185 "label '%Y' defined but not used", label->symbol);
5189 label_first = label_last = NULL;
5192 static void warn_unused_decl(declaration_t *decl, declaration_t *end, char const *const what)
5194 for (; decl != NULL; decl = decl->next) {
5199 print_in_function();
5200 warningf(&decl->source_position, "%s '%Y' is unused", what, decl->symbol);
5201 } else if (!decl->read) {
5202 print_in_function();
5203 warningf(&decl->source_position, "%s '%Y' is never read", what, decl->symbol);
5211 static void check_unused_variables(statement_t *const stmt, void *const env)
5215 switch (stmt->kind) {
5216 case STATEMENT_DECLARATION: {
5217 declaration_statement_t const *const decls = &stmt->declaration;
5218 warn_unused_decl(decls->declarations_begin, decls->declarations_end, "variable");
5223 warn_unused_decl(stmt->fors.scope.declarations, NULL, "variable");
5232 * Check declarations of current_function for unused entities.
5234 static void check_declarations(void)
5236 if (warning.unused_parameter) {
5237 const scope_t *scope = ¤t_function->scope;
5239 /* do not issue unused warnings for main */
5240 if (!is_sym_main(current_function->symbol)) {
5241 warn_unused_decl(scope->declarations, NULL, "parameter");
5244 if (warning.unused_variable) {
5245 walk_statements(current_function->init.statement, check_unused_variables, NULL);
5249 static int determine_truth(expression_t const* const cond)
5252 !is_constant_expression(cond) ? 0 :
5253 fold_constant(cond) != 0 ? 1 :
5257 static bool expression_returns(expression_t const *const expr)
5259 switch (expr->kind) {
5261 expression_t const *const func = expr->call.function;
5262 if (func->kind == EXPR_REFERENCE) {
5263 declaration_t const *const decl = func->reference.declaration;
5264 if (decl != NULL && decl->modifiers & DM_NORETURN)
5268 if (!expression_returns(func))
5271 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5272 if (!expression_returns(arg->expression))
5279 case EXPR_REFERENCE:
5281 case EXPR_CHARACTER_CONSTANT:
5282 case EXPR_WIDE_CHARACTER_CONSTANT:
5283 case EXPR_STRING_LITERAL:
5284 case EXPR_WIDE_STRING_LITERAL:
5285 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5286 case EXPR_LABEL_ADDRESS:
5287 case EXPR_CLASSIFY_TYPE:
5288 case EXPR_SIZEOF: // TODO handle obscure VLA case
5291 case EXPR_BUILTIN_SYMBOL:
5292 case EXPR_BUILTIN_CONSTANT_P:
5293 case EXPR_BUILTIN_PREFETCH:
5295 case EXPR_STATEMENT: // TODO implement
5298 case EXPR_CONDITIONAL:
5299 // TODO handle constant expression
5301 expression_returns(expr->conditional.condition) && (
5302 expression_returns(expr->conditional.true_expression) ||
5303 expression_returns(expr->conditional.false_expression)
5307 return expression_returns(expr->select.compound);
5309 case EXPR_ARRAY_ACCESS:
5311 expression_returns(expr->array_access.array_ref) &&
5312 expression_returns(expr->array_access.index);
5315 return expression_returns(expr->va_starte.ap);
5318 return expression_returns(expr->va_arge.ap);
5320 EXPR_UNARY_CASES_MANDATORY
5321 return expression_returns(expr->unary.value);
5323 case EXPR_UNARY_THROW:
5327 // TODO handle constant lhs of && and ||
5329 expression_returns(expr->binary.left) &&
5330 expression_returns(expr->binary.right);
5337 panic("unhandled expression");
5340 static bool noreturn_candidate;
5342 static void check_reachable(statement_t *const stmt)
5344 if (stmt->base.reachable)
5346 if (stmt->kind != STATEMENT_DO_WHILE)
5347 stmt->base.reachable = true;
5349 statement_t *last = stmt;
5351 switch (stmt->kind) {
5352 case STATEMENT_INVALID:
5353 case STATEMENT_EMPTY:
5354 case STATEMENT_DECLARATION:
5356 next = stmt->base.next;
5359 case STATEMENT_COMPOUND:
5360 next = stmt->compound.statements;
5363 case STATEMENT_RETURN:
5364 noreturn_candidate = false;
5367 case STATEMENT_IF: {
5368 if_statement_t const* const ifs = &stmt->ifs;
5369 int const val = determine_truth(ifs->condition);
5372 check_reachable(ifs->true_statement);
5377 if (ifs->false_statement != NULL) {
5378 check_reachable(ifs->false_statement);
5382 next = stmt->base.next;
5386 case STATEMENT_SWITCH: {
5387 switch_statement_t const *const switchs = &stmt->switchs;
5388 expression_t const *const expr = switchs->expression;
5390 if (is_constant_expression(expr)) {
5391 long const val = fold_constant(expr);
5392 case_label_statement_t * defaults = NULL;
5393 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5394 if (i->expression == NULL) {
5399 if (i->first_case <= val && val <= i->last_case) {
5400 check_reachable((statement_t*)i);
5405 if (defaults != NULL) {
5406 check_reachable((statement_t*)defaults);
5410 bool has_default = false;
5411 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5412 if (i->expression == NULL)
5415 check_reachable((statement_t*)i);
5422 next = stmt->base.next;
5426 case STATEMENT_EXPRESSION: {
5427 /* Check for noreturn function call */
5428 expression_t const *const expr = stmt->expression.expression;
5429 if (!expression_returns(expr))
5432 next = stmt->base.next;
5436 case STATEMENT_CONTINUE: {
5437 statement_t *parent = stmt;
5439 parent = parent->base.parent;
5440 if (parent == NULL) /* continue not within loop */
5444 switch (parent->kind) {
5445 case STATEMENT_WHILE: goto continue_while;
5446 case STATEMENT_DO_WHILE: goto continue_do_while;
5447 case STATEMENT_FOR: goto continue_for;
5454 case STATEMENT_BREAK: {
5455 statement_t *parent = stmt;
5457 parent = parent->base.parent;
5458 if (parent == NULL) /* break not within loop/switch */
5461 switch (parent->kind) {
5462 case STATEMENT_SWITCH:
5463 case STATEMENT_WHILE:
5464 case STATEMENT_DO_WHILE:
5467 next = parent->base.next;
5468 goto found_break_parent;
5477 case STATEMENT_GOTO:
5478 if (stmt->gotos.expression) {
5479 statement_t *parent = stmt->base.parent;
5480 if (parent == NULL) /* top level goto */
5484 next = stmt->gotos.label->init.statement;
5485 if (next == NULL) /* missing label */
5490 case STATEMENT_LABEL:
5491 next = stmt->label.statement;
5494 case STATEMENT_CASE_LABEL:
5495 next = stmt->case_label.statement;
5498 case STATEMENT_WHILE: {
5499 while_statement_t const *const whiles = &stmt->whiles;
5500 int const val = determine_truth(whiles->condition);
5503 check_reachable(whiles->body);
5508 next = stmt->base.next;
5512 case STATEMENT_DO_WHILE:
5513 next = stmt->do_while.body;
5516 case STATEMENT_FOR: {
5517 for_statement_t *const fors = &stmt->fors;
5519 if (fors->condition_reachable)
5521 fors->condition_reachable = true;
5523 expression_t const *const cond = fors->condition;
5525 cond == NULL ? 1 : determine_truth(cond);
5528 check_reachable(fors->body);
5533 next = stmt->base.next;
5537 case STATEMENT_MS_TRY: {
5538 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5539 check_reachable(ms_try->try_statement);
5540 next = ms_try->final_statement;
5544 case STATEMENT_LEAVE: {
5545 statement_t *parent = stmt;
5547 parent = parent->base.parent;
5548 if (parent == NULL) /* __leave not within __try */
5551 if (parent->kind == STATEMENT_MS_TRY) {
5553 next = parent->ms_try.final_statement;
5561 while (next == NULL) {
5562 next = last->base.parent;
5564 noreturn_candidate = false;
5566 type_t *const type = current_function->type;
5567 assert(is_type_function(type));
5568 type_t *const ret = skip_typeref(type->function.return_type);
5569 if (warning.return_type &&
5570 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5571 is_type_valid(ret) &&
5572 !is_sym_main(current_function->symbol)) {
5573 warningf(&stmt->base.source_position,
5574 "control reaches end of non-void function");
5579 switch (next->kind) {
5580 case STATEMENT_INVALID:
5581 case STATEMENT_EMPTY:
5582 case STATEMENT_DECLARATION:
5583 case STATEMENT_EXPRESSION:
5585 case STATEMENT_RETURN:
5586 case STATEMENT_CONTINUE:
5587 case STATEMENT_BREAK:
5588 case STATEMENT_GOTO:
5589 case STATEMENT_LEAVE:
5590 panic("invalid control flow in function");
5592 case STATEMENT_COMPOUND:
5594 case STATEMENT_SWITCH:
5595 case STATEMENT_LABEL:
5596 case STATEMENT_CASE_LABEL:
5598 next = next->base.next;
5601 case STATEMENT_WHILE: {
5603 if (next->base.reachable)
5605 next->base.reachable = true;
5607 while_statement_t const *const whiles = &next->whiles;
5608 int const val = determine_truth(whiles->condition);
5611 check_reachable(whiles->body);
5617 next = next->base.next;
5621 case STATEMENT_DO_WHILE: {
5623 if (next->base.reachable)
5625 next->base.reachable = true;
5627 do_while_statement_t const *const dw = &next->do_while;
5628 int const val = determine_truth(dw->condition);
5631 check_reachable(dw->body);
5637 next = next->base.next;
5641 case STATEMENT_FOR: {
5643 for_statement_t *const fors = &next->fors;
5645 fors->step_reachable = true;
5647 if (fors->condition_reachable)
5649 fors->condition_reachable = true;
5651 expression_t const *const cond = fors->condition;
5653 cond == NULL ? 1 : determine_truth(cond);
5656 check_reachable(fors->body);
5662 next = next->base.next;
5666 case STATEMENT_MS_TRY:
5668 next = next->ms_try.final_statement;
5673 check_reachable(next);
5676 static void check_unreachable(statement_t* const stmt, void *const env)
5680 switch (stmt->kind) {
5681 case STATEMENT_DO_WHILE:
5682 if (!stmt->base.reachable) {
5683 expression_t const *const cond = stmt->do_while.condition;
5684 if (determine_truth(cond) >= 0) {
5685 warningf(&cond->base.source_position,
5686 "condition of do-while-loop is unreachable");
5691 case STATEMENT_FOR: {
5692 for_statement_t const* const fors = &stmt->fors;
5694 // if init and step are unreachable, cond is unreachable, too
5695 if (!stmt->base.reachable && !fors->step_reachable) {
5696 warningf(&stmt->base.source_position, "statement is unreachable");
5698 if (!stmt->base.reachable && fors->initialisation != NULL) {
5699 warningf(&fors->initialisation->base.source_position,
5700 "initialisation of for-statement is unreachable");
5703 if (!fors->condition_reachable && fors->condition != NULL) {
5704 warningf(&fors->condition->base.source_position,
5705 "condition of for-statement is unreachable");
5708 if (!fors->step_reachable && fors->step != NULL) {
5709 warningf(&fors->step->base.source_position,
5710 "step of for-statement is unreachable");
5716 case STATEMENT_COMPOUND:
5717 if (stmt->compound.statements != NULL)
5722 if (!stmt->base.reachable)
5723 warningf(&stmt->base.source_position, "statement is unreachable");
5728 static void parse_external_declaration(void)
5730 /* function-definitions and declarations both start with declaration
5732 declaration_specifiers_t specifiers;
5733 memset(&specifiers, 0, sizeof(specifiers));
5735 add_anchor_token(';');
5736 parse_declaration_specifiers(&specifiers);
5737 rem_anchor_token(';');
5739 /* must be a declaration */
5740 if (token.type == ';') {
5741 parse_anonymous_declaration_rest(&specifiers);
5745 add_anchor_token(',');
5746 add_anchor_token('=');
5747 add_anchor_token(';');
5748 add_anchor_token('{');
5750 /* declarator is common to both function-definitions and declarations */
5751 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5753 rem_anchor_token('{');
5754 rem_anchor_token(';');
5755 rem_anchor_token('=');
5756 rem_anchor_token(',');
5758 /* must be a declaration */
5759 switch (token.type) {
5763 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
5767 /* must be a function definition */
5768 parse_kr_declaration_list(ndeclaration);
5770 if (token.type != '{') {
5771 parse_error_expected("while parsing function definition", '{', NULL);
5772 eat_until_matching_token(';');
5776 type_t *type = ndeclaration->type;
5778 /* note that we don't skip typerefs: the standard doesn't allow them here
5779 * (so we can't use is_type_function here) */
5780 if (type->kind != TYPE_FUNCTION) {
5781 if (is_type_valid(type)) {
5782 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5783 type, ndeclaration->symbol);
5789 if (warning.aggregate_return &&
5790 is_type_compound(skip_typeref(type->function.return_type))) {
5791 warningf(HERE, "function '%Y' returns an aggregate",
5792 ndeclaration->symbol);
5794 if (warning.traditional && !type->function.unspecified_parameters) {
5795 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5796 ndeclaration->symbol);
5798 if (warning.old_style_definition && type->function.unspecified_parameters) {
5799 warningf(HERE, "old-style function definition '%Y'",
5800 ndeclaration->symbol);
5803 /* § 6.7.5.3 (14) a function definition with () means no
5804 * parameters (and not unspecified parameters) */
5805 if (type->function.unspecified_parameters
5806 && type->function.parameters == NULL
5807 && !type->function.kr_style_parameters) {
5808 type_t *duplicate = duplicate_type(type);
5809 duplicate->function.unspecified_parameters = false;
5811 type = typehash_insert(duplicate);
5812 if (type != duplicate) {
5813 obstack_free(type_obst, duplicate);
5815 ndeclaration->type = type;
5818 declaration_t *const declaration = record_declaration(ndeclaration, true);
5819 if (ndeclaration != declaration) {
5820 declaration->scope = ndeclaration->scope;
5822 type = skip_typeref(declaration->type);
5824 /* push function parameters and switch scope */
5825 size_t const top = environment_top();
5826 scope_push(&declaration->scope);
5828 declaration_t *parameter = declaration->scope.declarations;
5829 for( ; parameter != NULL; parameter = parameter->next) {
5830 if (parameter->parent_scope == &ndeclaration->scope) {
5831 parameter->parent_scope = scope;
5833 assert(parameter->parent_scope == NULL
5834 || parameter->parent_scope == scope);
5835 parameter->parent_scope = scope;
5836 if (parameter->symbol == NULL) {
5837 errorf(¶meter->source_position, "parameter name omitted");
5840 environment_push(parameter);
5843 if (declaration->init.statement != NULL) {
5844 parser_error_multiple_definition(declaration, HERE);
5847 /* parse function body */
5848 int label_stack_top = label_top();
5849 declaration_t *old_current_function = current_function;
5850 current_function = declaration;
5851 current_parent = NULL;
5853 statement_t *const body = parse_compound_statement(false);
5854 declaration->init.statement = body;
5857 check_declarations();
5858 if (warning.return_type ||
5859 warning.unreachable_code ||
5860 (warning.missing_noreturn && !(declaration->modifiers & DM_NORETURN))) {
5861 noreturn_candidate = true;
5862 check_reachable(body);
5863 if (warning.unreachable_code)
5864 walk_statements(body, check_unreachable, NULL);
5865 if (warning.missing_noreturn &&
5866 noreturn_candidate &&
5867 !(declaration->modifiers & DM_NORETURN)) {
5868 warningf(&body->base.source_position,
5869 "function '%#T' is candidate for attribute 'noreturn'",
5870 type, declaration->symbol);
5874 assert(current_parent == NULL);
5875 assert(current_function == declaration);
5876 current_function = old_current_function;
5877 label_pop_to(label_stack_top);
5880 assert(scope == &declaration->scope);
5882 environment_pop_to(top);
5885 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5886 source_position_t *source_position,
5887 const symbol_t *symbol)
5889 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5891 type->bitfield.base_type = base_type;
5892 type->bitfield.size_expression = size;
5895 type_t *skipped_type = skip_typeref(base_type);
5896 if (!is_type_integer(skipped_type)) {
5897 errorf(HERE, "bitfield base type '%T' is not an integer type",
5901 bit_size = skipped_type->base.size * 8;
5904 if (is_constant_expression(size)) {
5905 long v = fold_constant(size);
5908 errorf(source_position, "negative width in bit-field '%Y'",
5910 } else if (v == 0) {
5911 errorf(source_position, "zero width for bit-field '%Y'",
5913 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5914 errorf(source_position, "width of '%Y' exceeds its type",
5917 type->bitfield.bit_size = v;
5924 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
5927 declaration_t *iter = compound_declaration->scope.declarations;
5928 for( ; iter != NULL; iter = iter->next) {
5929 if (iter->namespc != NAMESPACE_NORMAL)
5932 if (iter->symbol == NULL) {
5933 type_t *type = skip_typeref(iter->type);
5934 if (is_type_compound(type)) {
5935 declaration_t *result
5936 = find_compound_entry(type->compound.declaration, symbol);
5943 if (iter->symbol == symbol) {
5951 static void parse_compound_declarators(declaration_t *struct_declaration,
5952 const declaration_specifiers_t *specifiers)
5954 declaration_t *last_declaration = struct_declaration->scope.declarations;
5955 if (last_declaration != NULL) {
5956 while (last_declaration->next != NULL) {
5957 last_declaration = last_declaration->next;
5962 declaration_t *declaration;
5964 if (token.type == ':') {
5965 source_position_t source_position = *HERE;
5968 type_t *base_type = specifiers->type;
5969 expression_t *size = parse_constant_expression();
5971 type_t *type = make_bitfield_type(base_type, size,
5972 &source_position, sym_anonymous);
5974 declaration = allocate_declaration_zero();
5975 declaration->namespc = NAMESPACE_NORMAL;
5976 declaration->declared_storage_class = STORAGE_CLASS_NONE;
5977 declaration->storage_class = STORAGE_CLASS_NONE;
5978 declaration->source_position = source_position;
5979 declaration->modifiers = specifiers->modifiers;
5980 declaration->type = type;
5982 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
5984 type_t *orig_type = declaration->type;
5985 type_t *type = skip_typeref(orig_type);
5987 if (token.type == ':') {
5988 source_position_t source_position = *HERE;
5990 expression_t *size = parse_constant_expression();
5992 type_t *bitfield_type = make_bitfield_type(orig_type, size,
5993 &source_position, declaration->symbol);
5994 declaration->type = bitfield_type;
5996 /* TODO we ignore arrays for now... what is missing is a check
5997 * that they're at the end of the struct */
5998 if (is_type_incomplete(type) && !is_type_array(type)) {
6000 "compound member '%Y' has incomplete type '%T'",
6001 declaration->symbol, orig_type);
6002 } else if (is_type_function(type)) {
6003 errorf(HERE, "compound member '%Y' must not have function type '%T'",
6004 declaration->symbol, orig_type);
6009 /* make sure we don't define a symbol multiple times */
6010 symbol_t *symbol = declaration->symbol;
6011 if (symbol != NULL) {
6012 declaration_t *prev_decl
6013 = find_compound_entry(struct_declaration, symbol);
6015 if (prev_decl != NULL) {
6016 assert(prev_decl->symbol == symbol);
6017 errorf(&declaration->source_position,
6018 "multiple declarations of symbol '%Y' (declared %P)",
6019 symbol, &prev_decl->source_position);
6023 /* append declaration */
6024 if (last_declaration != NULL) {
6025 last_declaration->next = declaration;
6027 struct_declaration->scope.declarations = declaration;
6029 last_declaration = declaration;
6031 if (token.type != ',')
6041 static void parse_compound_type_entries(declaration_t *compound_declaration)
6044 add_anchor_token('}');
6046 while (token.type != '}') {
6047 if (token.type == T_EOF) {
6048 errorf(HERE, "EOF while parsing struct");
6051 declaration_specifiers_t specifiers;
6052 memset(&specifiers, 0, sizeof(specifiers));
6053 parse_declaration_specifiers(&specifiers);
6055 parse_compound_declarators(compound_declaration, &specifiers);
6057 rem_anchor_token('}');
6061 static type_t *parse_typename(void)
6063 declaration_specifiers_t specifiers;
6064 memset(&specifiers, 0, sizeof(specifiers));
6065 parse_declaration_specifiers(&specifiers);
6066 if (specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
6067 /* TODO: improve error message, user does probably not know what a
6068 * storage class is...
6070 errorf(HERE, "typename may not have a storage class");
6073 type_t *result = parse_abstract_declarator(specifiers.type);
6081 typedef expression_t* (*parse_expression_function)(void);
6082 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6084 typedef struct expression_parser_function_t expression_parser_function_t;
6085 struct expression_parser_function_t {
6086 parse_expression_function parser;
6087 unsigned infix_precedence;
6088 parse_expression_infix_function infix_parser;
6091 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6094 * Prints an error message if an expression was expected but not read
6096 static expression_t *expected_expression_error(void)
6098 /* skip the error message if the error token was read */
6099 if (token.type != T_ERROR) {
6100 errorf(HERE, "expected expression, got token '%K'", &token);
6104 return create_invalid_expression();
6108 * Parse a string constant.
6110 static expression_t *parse_string_const(void)
6113 if (token.type == T_STRING_LITERAL) {
6114 string_t res = token.v.string;
6116 while (token.type == T_STRING_LITERAL) {
6117 res = concat_strings(&res, &token.v.string);
6120 if (token.type != T_WIDE_STRING_LITERAL) {
6121 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6122 /* note: that we use type_char_ptr here, which is already the
6123 * automatic converted type. revert_automatic_type_conversion
6124 * will construct the array type */
6125 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6126 cnst->string.value = res;
6130 wres = concat_string_wide_string(&res, &token.v.wide_string);
6132 wres = token.v.wide_string;
6137 switch (token.type) {
6138 case T_WIDE_STRING_LITERAL:
6139 wres = concat_wide_strings(&wres, &token.v.wide_string);
6142 case T_STRING_LITERAL:
6143 wres = concat_wide_string_string(&wres, &token.v.string);
6147 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6148 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6149 cnst->wide_string.value = wres;
6158 * Parse an integer constant.
6160 static expression_t *parse_int_const(void)
6162 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6163 cnst->base.source_position = *HERE;
6164 cnst->base.type = token.datatype;
6165 cnst->conste.v.int_value = token.v.intvalue;
6173 * Parse a character constant.
6175 static expression_t *parse_character_constant(void)
6177 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6179 cnst->base.source_position = *HERE;
6180 cnst->base.type = token.datatype;
6181 cnst->conste.v.character = token.v.string;
6183 if (cnst->conste.v.character.size != 1) {
6184 if (warning.multichar && GNU_MODE) {
6185 warningf(HERE, "multi-character character constant");
6187 errorf(HERE, "more than 1 characters in character constant");
6196 * Parse a wide character constant.
6198 static expression_t *parse_wide_character_constant(void)
6200 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6202 cnst->base.source_position = *HERE;
6203 cnst->base.type = token.datatype;
6204 cnst->conste.v.wide_character = token.v.wide_string;
6206 if (cnst->conste.v.wide_character.size != 1) {
6207 if (warning.multichar && GNU_MODE) {
6208 warningf(HERE, "multi-character character constant");
6210 errorf(HERE, "more than 1 characters in character constant");
6219 * Parse a float constant.
6221 static expression_t *parse_float_const(void)
6223 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6224 cnst->base.type = token.datatype;
6225 cnst->conste.v.float_value = token.v.floatvalue;
6232 static declaration_t *create_implicit_function(symbol_t *symbol,
6233 const source_position_t *source_position)
6235 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6236 ntype->function.return_type = type_int;
6237 ntype->function.unspecified_parameters = true;
6239 type_t *type = typehash_insert(ntype);
6240 if (type != ntype) {
6244 declaration_t *const declaration = allocate_declaration_zero();
6245 declaration->storage_class = STORAGE_CLASS_EXTERN;
6246 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
6247 declaration->type = type;
6248 declaration->symbol = symbol;
6249 declaration->source_position = *source_position;
6250 declaration->implicit = true;
6252 bool strict_prototypes_old = warning.strict_prototypes;
6253 warning.strict_prototypes = false;
6254 record_declaration(declaration, false);
6255 warning.strict_prototypes = strict_prototypes_old;
6261 * Creates a return_type (func)(argument_type) function type if not
6264 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6265 type_t *argument_type2)
6267 function_parameter_t *parameter2
6268 = obstack_alloc(type_obst, sizeof(parameter2[0]));
6269 memset(parameter2, 0, sizeof(parameter2[0]));
6270 parameter2->type = argument_type2;
6272 function_parameter_t *parameter1
6273 = obstack_alloc(type_obst, sizeof(parameter1[0]));
6274 memset(parameter1, 0, sizeof(parameter1[0]));
6275 parameter1->type = argument_type1;
6276 parameter1->next = parameter2;
6278 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6279 type->function.return_type = return_type;
6280 type->function.parameters = parameter1;
6282 type_t *result = typehash_insert(type);
6283 if (result != type) {
6291 * Creates a return_type (func)(argument_type) function type if not
6294 * @param return_type the return type
6295 * @param argument_type the argument type
6297 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6299 function_parameter_t *parameter
6300 = obstack_alloc(type_obst, sizeof(parameter[0]));
6301 memset(parameter, 0, sizeof(parameter[0]));
6302 parameter->type = argument_type;
6304 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6305 type->function.return_type = return_type;
6306 type->function.parameters = parameter;
6308 type_t *result = typehash_insert(type);
6309 if (result != type) {
6316 static type_t *make_function_0_type(type_t *return_type)
6318 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6319 type->function.return_type = return_type;
6320 type->function.parameters = NULL;
6322 type_t *result = typehash_insert(type);
6323 if (result != type) {
6331 * Creates a function type for some function like builtins.
6333 * @param symbol the symbol describing the builtin
6335 static type_t *get_builtin_symbol_type(symbol_t *symbol)
6337 switch(symbol->ID) {
6338 case T___builtin_alloca:
6339 return make_function_1_type(type_void_ptr, type_size_t);
6340 case T___builtin_huge_val:
6341 return make_function_0_type(type_double);
6342 case T___builtin_inf:
6343 return make_function_0_type(type_double);
6344 case T___builtin_inff:
6345 return make_function_0_type(type_float);
6346 case T___builtin_infl:
6347 return make_function_0_type(type_long_double);
6348 case T___builtin_nan:
6349 return make_function_1_type(type_double, type_char_ptr);
6350 case T___builtin_nanf:
6351 return make_function_1_type(type_float, type_char_ptr);
6352 case T___builtin_nanl:
6353 return make_function_1_type(type_long_double, type_char_ptr);
6354 case T___builtin_va_end:
6355 return make_function_1_type(type_void, type_valist);
6356 case T___builtin_expect:
6357 return make_function_2_type(type_long, type_long, type_long);
6359 internal_errorf(HERE, "not implemented builtin symbol found");
6364 * Performs automatic type cast as described in § 6.3.2.1.
6366 * @param orig_type the original type
6368 static type_t *automatic_type_conversion(type_t *orig_type)
6370 type_t *type = skip_typeref(orig_type);
6371 if (is_type_array(type)) {
6372 array_type_t *array_type = &type->array;
6373 type_t *element_type = array_type->element_type;
6374 unsigned qualifiers = array_type->base.qualifiers;
6376 return make_pointer_type(element_type, qualifiers);
6379 if (is_type_function(type)) {
6380 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6387 * reverts the automatic casts of array to pointer types and function
6388 * to function-pointer types as defined § 6.3.2.1
6390 type_t *revert_automatic_type_conversion(const expression_t *expression)
6392 switch (expression->kind) {
6393 case EXPR_REFERENCE: return expression->reference.declaration->type;
6396 return get_qualified_type(expression->select.compound_entry->type,
6397 expression->base.type->base.qualifiers);
6399 case EXPR_UNARY_DEREFERENCE: {
6400 const expression_t *const value = expression->unary.value;
6401 type_t *const type = skip_typeref(value->base.type);
6402 assert(is_type_pointer(type));
6403 return type->pointer.points_to;
6406 case EXPR_BUILTIN_SYMBOL:
6407 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
6409 case EXPR_ARRAY_ACCESS: {
6410 const expression_t *array_ref = expression->array_access.array_ref;
6411 type_t *type_left = skip_typeref(array_ref->base.type);
6412 if (!is_type_valid(type_left))
6414 assert(is_type_pointer(type_left));
6415 return type_left->pointer.points_to;
6418 case EXPR_STRING_LITERAL: {
6419 size_t size = expression->string.value.size;
6420 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6423 case EXPR_WIDE_STRING_LITERAL: {
6424 size_t size = expression->wide_string.value.size;
6425 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6428 case EXPR_COMPOUND_LITERAL:
6429 return expression->compound_literal.type;
6434 return expression->base.type;
6437 static expression_t *parse_reference(void)
6439 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
6441 reference_expression_t *ref = &expression->reference;
6442 symbol_t *const symbol = token.v.symbol;
6444 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
6446 if (declaration == NULL) {
6447 if (!strict_mode && look_ahead(1)->type == '(') {
6448 /* an implicitly declared function */
6449 if (warning.implicit_function_declaration) {
6450 warningf(HERE, "implicit declaration of function '%Y'",
6454 declaration = create_implicit_function(symbol, HERE);
6456 errorf(HERE, "unknown symbol '%Y' found.", symbol);
6457 declaration = create_error_declaration(symbol, STORAGE_CLASS_NONE);
6461 type_t *orig_type = declaration->type;
6463 /* we always do the auto-type conversions; the & and sizeof parser contains
6464 * code to revert this! */
6465 type_t *type = automatic_type_conversion(orig_type);
6467 ref->declaration = declaration;
6468 ref->base.type = type;
6470 /* this declaration is used */
6471 declaration->used = true;
6473 if (declaration->parent_scope != file_scope &&
6474 declaration->parent_scope->depth < current_function->scope.depth &&
6475 is_type_valid(orig_type) && !is_type_function(orig_type)) {
6476 /* access of a variable from an outer function */
6477 declaration->address_taken = true;
6478 current_function->need_closure = true;
6481 /* check for deprecated functions */
6482 if (warning.deprecated_declarations &&
6483 declaration->modifiers & DM_DEPRECATED) {
6484 char const *const prefix = is_type_function(declaration->type) ?
6485 "function" : "variable";
6487 if (declaration->deprecated_string != NULL) {
6488 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
6489 prefix, declaration->symbol, &declaration->source_position,
6490 declaration->deprecated_string);
6492 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
6493 declaration->symbol, &declaration->source_position);
6496 if (warning.init_self && declaration == current_init_decl && !in_type_prop) {
6497 current_init_decl = NULL;
6498 warningf(HERE, "variable '%#T' is initialized by itself",
6499 declaration->type, declaration->symbol);
6506 static bool semantic_cast(expression_t *cast)
6508 expression_t *expression = cast->unary.value;
6509 type_t *orig_dest_type = cast->base.type;
6510 type_t *orig_type_right = expression->base.type;
6511 type_t const *dst_type = skip_typeref(orig_dest_type);
6512 type_t const *src_type = skip_typeref(orig_type_right);
6513 source_position_t const *pos = &cast->base.source_position;
6515 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6516 if (dst_type == type_void)
6519 /* only integer and pointer can be casted to pointer */
6520 if (is_type_pointer(dst_type) &&
6521 !is_type_pointer(src_type) &&
6522 !is_type_integer(src_type) &&
6523 is_type_valid(src_type)) {
6524 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6528 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6529 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6533 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6534 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6538 if (warning.cast_qual &&
6539 is_type_pointer(src_type) &&
6540 is_type_pointer(dst_type)) {
6541 type_t *src = skip_typeref(src_type->pointer.points_to);
6542 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6543 unsigned missing_qualifiers =
6544 src->base.qualifiers & ~dst->base.qualifiers;
6545 if (missing_qualifiers != 0) {
6547 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6548 missing_qualifiers, orig_type_right);
6554 static expression_t *parse_compound_literal(type_t *type)
6556 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6558 parse_initializer_env_t env;
6560 env.declaration = NULL;
6561 env.must_be_constant = false;
6562 initializer_t *initializer = parse_initializer(&env);
6565 expression->compound_literal.initializer = initializer;
6566 expression->compound_literal.type = type;
6567 expression->base.type = automatic_type_conversion(type);
6573 * Parse a cast expression.
6575 static expression_t *parse_cast(void)
6577 add_anchor_token(')');
6579 source_position_t source_position = token.source_position;
6581 type_t *type = parse_typename();
6583 rem_anchor_token(')');
6586 if (token.type == '{') {
6587 return parse_compound_literal(type);
6590 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6591 cast->base.source_position = source_position;
6593 expression_t *value = parse_sub_expression(PREC_CAST);
6594 cast->base.type = type;
6595 cast->unary.value = value;
6597 if (! semantic_cast(cast)) {
6598 /* TODO: record the error in the AST. else it is impossible to detect it */
6603 return create_invalid_expression();
6607 * Parse a statement expression.
6609 static expression_t *parse_statement_expression(void)
6611 add_anchor_token(')');
6613 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6615 statement_t *statement = parse_compound_statement(true);
6616 expression->statement.statement = statement;
6617 expression->base.source_position = statement->base.source_position;
6619 /* find last statement and use its type */
6620 type_t *type = type_void;
6621 const statement_t *stmt = statement->compound.statements;
6623 while (stmt->base.next != NULL)
6624 stmt = stmt->base.next;
6626 if (stmt->kind == STATEMENT_EXPRESSION) {
6627 type = stmt->expression.expression->base.type;
6629 } else if (warning.other) {
6630 warningf(&expression->base.source_position, "empty statement expression ({})");
6632 expression->base.type = type;
6634 rem_anchor_token(')');
6642 * Parse a parenthesized expression.
6644 static expression_t *parse_parenthesized_expression(void)
6648 switch(token.type) {
6650 /* gcc extension: a statement expression */
6651 return parse_statement_expression();
6655 return parse_cast();
6657 if (is_typedef_symbol(token.v.symbol)) {
6658 return parse_cast();
6662 add_anchor_token(')');
6663 expression_t *result = parse_expression();
6664 rem_anchor_token(')');
6671 static expression_t *parse_function_keyword(void)
6676 if (current_function == NULL) {
6677 errorf(HERE, "'__func__' used outside of a function");
6680 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6681 expression->base.type = type_char_ptr;
6682 expression->funcname.kind = FUNCNAME_FUNCTION;
6687 static expression_t *parse_pretty_function_keyword(void)
6689 eat(T___PRETTY_FUNCTION__);
6691 if (current_function == NULL) {
6692 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6695 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6696 expression->base.type = type_char_ptr;
6697 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6702 static expression_t *parse_funcsig_keyword(void)
6706 if (current_function == NULL) {
6707 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6710 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6711 expression->base.type = type_char_ptr;
6712 expression->funcname.kind = FUNCNAME_FUNCSIG;
6717 static expression_t *parse_funcdname_keyword(void)
6719 eat(T___FUNCDNAME__);
6721 if (current_function == NULL) {
6722 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6725 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6726 expression->base.type = type_char_ptr;
6727 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6732 static designator_t *parse_designator(void)
6734 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6735 result->source_position = *HERE;
6737 if (token.type != T_IDENTIFIER) {
6738 parse_error_expected("while parsing member designator",
6739 T_IDENTIFIER, NULL);
6742 result->symbol = token.v.symbol;
6745 designator_t *last_designator = result;
6747 if (token.type == '.') {
6749 if (token.type != T_IDENTIFIER) {
6750 parse_error_expected("while parsing member designator",
6751 T_IDENTIFIER, NULL);
6754 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6755 designator->source_position = *HERE;
6756 designator->symbol = token.v.symbol;
6759 last_designator->next = designator;
6760 last_designator = designator;
6763 if (token.type == '[') {
6765 add_anchor_token(']');
6766 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6767 designator->source_position = *HERE;
6768 designator->array_index = parse_expression();
6769 rem_anchor_token(']');
6771 if (designator->array_index == NULL) {
6775 last_designator->next = designator;
6776 last_designator = designator;
6788 * Parse the __builtin_offsetof() expression.
6790 static expression_t *parse_offsetof(void)
6792 eat(T___builtin_offsetof);
6794 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6795 expression->base.type = type_size_t;
6798 add_anchor_token(',');
6799 type_t *type = parse_typename();
6800 rem_anchor_token(',');
6802 add_anchor_token(')');
6803 designator_t *designator = parse_designator();
6804 rem_anchor_token(')');
6807 expression->offsetofe.type = type;
6808 expression->offsetofe.designator = designator;
6811 memset(&path, 0, sizeof(path));
6812 path.top_type = type;
6813 path.path = NEW_ARR_F(type_path_entry_t, 0);
6815 descend_into_subtype(&path);
6817 if (!walk_designator(&path, designator, true)) {
6818 return create_invalid_expression();
6821 DEL_ARR_F(path.path);
6825 return create_invalid_expression();
6829 * Parses a _builtin_va_start() expression.
6831 static expression_t *parse_va_start(void)
6833 eat(T___builtin_va_start);
6835 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6838 add_anchor_token(',');
6839 expression->va_starte.ap = parse_assignment_expression();
6840 rem_anchor_token(',');
6842 expression_t *const expr = parse_assignment_expression();
6843 if (expr->kind == EXPR_REFERENCE) {
6844 declaration_t *const decl = expr->reference.declaration;
6845 if (decl->parent_scope != ¤t_function->scope || decl->next != NULL) {
6846 errorf(&expr->base.source_position,
6847 "second argument of 'va_start' must be last parameter of the current function");
6849 expression->va_starte.parameter = decl;
6855 return create_invalid_expression();
6859 * Parses a _builtin_va_arg() expression.
6861 static expression_t *parse_va_arg(void)
6863 eat(T___builtin_va_arg);
6865 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6868 expression->va_arge.ap = parse_assignment_expression();
6870 expression->base.type = parse_typename();
6875 return create_invalid_expression();
6878 static expression_t *parse_builtin_symbol(void)
6880 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
6882 symbol_t *symbol = token.v.symbol;
6884 expression->builtin_symbol.symbol = symbol;
6887 type_t *type = get_builtin_symbol_type(symbol);
6888 type = automatic_type_conversion(type);
6890 expression->base.type = type;
6895 * Parses a __builtin_constant() expression.
6897 static expression_t *parse_builtin_constant(void)
6899 eat(T___builtin_constant_p);
6901 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6904 add_anchor_token(')');
6905 expression->builtin_constant.value = parse_assignment_expression();
6906 rem_anchor_token(')');
6908 expression->base.type = type_int;
6912 return create_invalid_expression();
6916 * Parses a __builtin_prefetch() expression.
6918 static expression_t *parse_builtin_prefetch(void)
6920 eat(T___builtin_prefetch);
6922 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
6925 add_anchor_token(')');
6926 expression->builtin_prefetch.adr = parse_assignment_expression();
6927 if (token.type == ',') {
6929 expression->builtin_prefetch.rw = parse_assignment_expression();
6931 if (token.type == ',') {
6933 expression->builtin_prefetch.locality = parse_assignment_expression();
6935 rem_anchor_token(')');
6937 expression->base.type = type_void;
6941 return create_invalid_expression();
6945 * Parses a __builtin_is_*() compare expression.
6947 static expression_t *parse_compare_builtin(void)
6949 expression_t *expression;
6951 switch(token.type) {
6952 case T___builtin_isgreater:
6953 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6955 case T___builtin_isgreaterequal:
6956 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6958 case T___builtin_isless:
6959 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6961 case T___builtin_islessequal:
6962 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6964 case T___builtin_islessgreater:
6965 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6967 case T___builtin_isunordered:
6968 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6971 internal_errorf(HERE, "invalid compare builtin found");
6973 expression->base.source_position = *HERE;
6977 expression->binary.left = parse_assignment_expression();
6979 expression->binary.right = parse_assignment_expression();
6982 type_t *const orig_type_left = expression->binary.left->base.type;
6983 type_t *const orig_type_right = expression->binary.right->base.type;
6985 type_t *const type_left = skip_typeref(orig_type_left);
6986 type_t *const type_right = skip_typeref(orig_type_right);
6987 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6988 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6989 type_error_incompatible("invalid operands in comparison",
6990 &expression->base.source_position, orig_type_left, orig_type_right);
6993 semantic_comparison(&expression->binary);
6998 return create_invalid_expression();
7003 * Parses a __builtin_expect() expression.
7005 static expression_t *parse_builtin_expect(void)
7007 eat(T___builtin_expect);
7009 expression_t *expression
7010 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7013 expression->binary.left = parse_assignment_expression();
7015 expression->binary.right = parse_constant_expression();
7018 expression->base.type = expression->binary.left->base.type;
7022 return create_invalid_expression();
7027 * Parses a MS assume() expression.
7029 static expression_t *parse_assume(void)
7033 expression_t *expression
7034 = allocate_expression_zero(EXPR_UNARY_ASSUME);
7037 add_anchor_token(')');
7038 expression->unary.value = parse_assignment_expression();
7039 rem_anchor_token(')');
7042 expression->base.type = type_void;
7045 return create_invalid_expression();
7049 * Return the declaration for a given label symbol or create a new one.
7051 * @param symbol the symbol of the label
7053 static declaration_t *get_label(symbol_t *symbol)
7055 declaration_t *candidate;
7056 assert(current_function != NULL);
7058 candidate = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
7059 /* if we found a local label, we already created the declaration */
7060 if (candidate != NULL) {
7061 if (candidate->parent_scope != scope) {
7062 assert(candidate->parent_scope->depth < scope->depth);
7063 current_function->goto_to_outer = true;
7068 candidate = get_declaration(symbol, NAMESPACE_LABEL);
7069 /* if we found a label in the same function, then we already created the
7071 if (candidate != NULL
7072 && candidate->parent_scope == ¤t_function->scope) {
7076 /* otherwise we need to create a new one */
7077 declaration_t *const declaration = allocate_declaration_zero();
7078 declaration->namespc = NAMESPACE_LABEL;
7079 declaration->symbol = symbol;
7081 label_push(declaration);
7087 * Parses a GNU && label address expression.
7089 static expression_t *parse_label_address(void)
7091 source_position_t source_position = token.source_position;
7093 if (token.type != T_IDENTIFIER) {
7094 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7097 symbol_t *symbol = token.v.symbol;
7100 declaration_t *label = get_label(symbol);
7103 label->address_taken = true;
7105 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7106 expression->base.source_position = source_position;
7108 /* label address is threaten as a void pointer */
7109 expression->base.type = type_void_ptr;
7110 expression->label_address.declaration = label;
7113 return create_invalid_expression();
7117 * Parse a microsoft __noop expression.
7119 static expression_t *parse_noop_expression(void)
7121 source_position_t source_position = *HERE;
7124 if (token.type == '(') {
7125 /* parse arguments */
7127 add_anchor_token(')');
7128 add_anchor_token(',');
7130 if (token.type != ')') {
7132 (void)parse_assignment_expression();
7133 if (token.type != ',')
7139 rem_anchor_token(',');
7140 rem_anchor_token(')');
7143 /* the result is a (int)0 */
7144 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7145 cnst->base.source_position = source_position;
7146 cnst->base.type = type_int;
7147 cnst->conste.v.int_value = 0;
7148 cnst->conste.is_ms_noop = true;
7153 return create_invalid_expression();
7157 * Parses a primary expression.
7159 static expression_t *parse_primary_expression(void)
7161 switch (token.type) {
7162 case T_INTEGER: return parse_int_const();
7163 case T_CHARACTER_CONSTANT: return parse_character_constant();
7164 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7165 case T_FLOATINGPOINT: return parse_float_const();
7166 case T_STRING_LITERAL:
7167 case T_WIDE_STRING_LITERAL: return parse_string_const();
7168 case T_IDENTIFIER: return parse_reference();
7169 case T___FUNCTION__:
7170 case T___func__: return parse_function_keyword();
7171 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7172 case T___FUNCSIG__: return parse_funcsig_keyword();
7173 case T___FUNCDNAME__: return parse_funcdname_keyword();
7174 case T___builtin_offsetof: return parse_offsetof();
7175 case T___builtin_va_start: return parse_va_start();
7176 case T___builtin_va_arg: return parse_va_arg();
7177 case T___builtin_expect:
7178 case T___builtin_alloca:
7179 case T___builtin_inf:
7180 case T___builtin_inff:
7181 case T___builtin_infl:
7182 case T___builtin_nan:
7183 case T___builtin_nanf:
7184 case T___builtin_nanl:
7185 case T___builtin_huge_val:
7186 case T___builtin_va_end: return parse_builtin_symbol();
7187 case T___builtin_isgreater:
7188 case T___builtin_isgreaterequal:
7189 case T___builtin_isless:
7190 case T___builtin_islessequal:
7191 case T___builtin_islessgreater:
7192 case T___builtin_isunordered: return parse_compare_builtin();
7193 case T___builtin_constant_p: return parse_builtin_constant();
7194 case T___builtin_prefetch: return parse_builtin_prefetch();
7195 case T__assume: return parse_assume();
7198 return parse_label_address();
7201 case '(': return parse_parenthesized_expression();
7202 case T___noop: return parse_noop_expression();
7205 errorf(HERE, "unexpected token %K, expected an expression", &token);
7206 return create_invalid_expression();
7210 * Check if the expression has the character type and issue a warning then.
7212 static void check_for_char_index_type(const expression_t *expression)
7214 type_t *const type = expression->base.type;
7215 const type_t *const base_type = skip_typeref(type);
7217 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7218 warning.char_subscripts) {
7219 warningf(&expression->base.source_position,
7220 "array subscript has type '%T'", type);
7224 static expression_t *parse_array_expression(expression_t *left)
7227 add_anchor_token(']');
7229 expression_t *inside = parse_expression();
7231 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7233 array_access_expression_t *array_access = &expression->array_access;
7235 type_t *const orig_type_left = left->base.type;
7236 type_t *const orig_type_inside = inside->base.type;
7238 type_t *const type_left = skip_typeref(orig_type_left);
7239 type_t *const type_inside = skip_typeref(orig_type_inside);
7241 type_t *return_type;
7242 if (is_type_pointer(type_left)) {
7243 return_type = type_left->pointer.points_to;
7244 array_access->array_ref = left;
7245 array_access->index = inside;
7246 check_for_char_index_type(inside);
7247 } else if (is_type_pointer(type_inside)) {
7248 return_type = type_inside->pointer.points_to;
7249 array_access->array_ref = inside;
7250 array_access->index = left;
7251 array_access->flipped = true;
7252 check_for_char_index_type(left);
7254 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7256 "array access on object with non-pointer types '%T', '%T'",
7257 orig_type_left, orig_type_inside);
7259 return_type = type_error_type;
7260 array_access->array_ref = left;
7261 array_access->index = inside;
7264 expression->base.type = automatic_type_conversion(return_type);
7266 rem_anchor_token(']');
7267 if (token.type == ']') {
7270 parse_error_expected("Problem while parsing array access", ']', NULL);
7275 static expression_t *parse_typeprop(expression_kind_t const kind,
7276 source_position_t const pos)
7278 expression_t *tp_expression = allocate_expression_zero(kind);
7279 tp_expression->base.type = type_size_t;
7280 tp_expression->base.source_position = pos;
7282 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7284 /* we only refer to a type property, mark this case */
7285 bool old = in_type_prop;
7286 in_type_prop = true;
7287 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7289 add_anchor_token(')');
7290 type_t* const orig_type = parse_typename();
7291 tp_expression->typeprop.type = orig_type;
7293 type_t const* const type = skip_typeref(orig_type);
7294 char const* const wrong_type =
7295 is_type_incomplete(type) ? "incomplete" :
7296 type->kind == TYPE_FUNCTION ? "function designator" :
7297 type->kind == TYPE_BITFIELD ? "bitfield" :
7299 if (wrong_type != NULL) {
7300 errorf(&pos, "operand of %s expression must not be %s type '%T'",
7301 what, wrong_type, type);
7304 rem_anchor_token(')');
7307 expression_t *expression = parse_sub_expression(PREC_UNARY);
7309 type_t* const orig_type = revert_automatic_type_conversion(expression);
7310 expression->base.type = orig_type;
7312 type_t const* const type = skip_typeref(orig_type);
7313 char const* const wrong_type =
7314 is_type_incomplete(type) ? "incomplete" :
7315 type->kind == TYPE_FUNCTION ? "function designator" :
7316 type->kind == TYPE_BITFIELD ? "bitfield" :
7318 if (wrong_type != NULL) {
7319 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
7322 tp_expression->typeprop.type = expression->base.type;
7323 tp_expression->typeprop.tp_expression = expression;
7328 return tp_expression;
7331 static expression_t *parse_sizeof(void)
7333 source_position_t pos = *HERE;
7335 return parse_typeprop(EXPR_SIZEOF, pos);
7338 static expression_t *parse_alignof(void)
7340 source_position_t pos = *HERE;
7342 return parse_typeprop(EXPR_ALIGNOF, pos);
7345 static expression_t *parse_select_expression(expression_t *compound)
7347 assert(token.type == '.' || token.type == T_MINUSGREATER);
7349 bool is_pointer = (token.type == T_MINUSGREATER);
7352 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7353 select->select.compound = compound;
7355 if (token.type != T_IDENTIFIER) {
7356 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7359 symbol_t *symbol = token.v.symbol;
7362 type_t *const orig_type = compound->base.type;
7363 type_t *const type = skip_typeref(orig_type);
7366 bool saw_error = false;
7367 if (is_type_pointer(type)) {
7370 "request for member '%Y' in something not a struct or union, but '%T'",
7374 type_left = skip_typeref(type->pointer.points_to);
7376 if (is_pointer && is_type_valid(type)) {
7377 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7383 declaration_t *entry;
7384 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7385 type_left->kind == TYPE_COMPOUND_UNION) {
7386 declaration_t *const declaration = type_left->compound.declaration;
7388 if (!declaration->init.complete) {
7389 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7391 goto create_error_entry;
7394 entry = find_compound_entry(declaration, symbol);
7395 if (entry == NULL) {
7396 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7397 goto create_error_entry;
7400 if (is_type_valid(type_left) && !saw_error) {
7402 "request for member '%Y' in something not a struct or union, but '%T'",
7406 entry = allocate_declaration_zero();
7407 entry->symbol = symbol;
7410 select->select.compound_entry = entry;
7412 type_t *const res_type =
7413 get_qualified_type(entry->type, type_left->base.qualifiers);
7415 /* we always do the auto-type conversions; the & and sizeof parser contains
7416 * code to revert this! */
7417 select->base.type = automatic_type_conversion(res_type);
7419 type_t *skipped = skip_typeref(res_type);
7420 if (skipped->kind == TYPE_BITFIELD) {
7421 select->base.type = skipped->bitfield.base_type;
7427 static void check_call_argument(const function_parameter_t *parameter,
7428 call_argument_t *argument, unsigned pos)
7430 type_t *expected_type = parameter->type;
7431 type_t *expected_type_skip = skip_typeref(expected_type);
7432 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7433 expression_t *arg_expr = argument->expression;
7434 type_t *arg_type = skip_typeref(arg_expr->base.type);
7436 /* handle transparent union gnu extension */
7437 if (is_type_union(expected_type_skip)
7438 && (expected_type_skip->base.modifiers
7439 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
7440 declaration_t *union_decl = expected_type_skip->compound.declaration;
7442 declaration_t *declaration = union_decl->scope.declarations;
7443 type_t *best_type = NULL;
7444 for ( ; declaration != NULL; declaration = declaration->next) {
7445 type_t *decl_type = declaration->type;
7446 error = semantic_assign(decl_type, arg_expr);
7447 if (error == ASSIGN_ERROR_INCOMPATIBLE
7448 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7451 if (error == ASSIGN_SUCCESS) {
7452 best_type = decl_type;
7453 } else if (best_type == NULL) {
7454 best_type = decl_type;
7458 if (best_type != NULL) {
7459 expected_type = best_type;
7463 error = semantic_assign(expected_type, arg_expr);
7464 argument->expression = create_implicit_cast(argument->expression,
7467 if (error != ASSIGN_SUCCESS) {
7468 /* report exact scope in error messages (like "in argument 3") */
7470 snprintf(buf, sizeof(buf), "call argument %u", pos);
7471 report_assign_error(error, expected_type, arg_expr, buf,
7472 &arg_expr->base.source_position);
7473 } else if (warning.traditional || warning.conversion) {
7474 type_t *const promoted_type = get_default_promoted_type(arg_type);
7475 if (!types_compatible(expected_type_skip, promoted_type) &&
7476 !types_compatible(expected_type_skip, type_void_ptr) &&
7477 !types_compatible(type_void_ptr, promoted_type)) {
7478 /* Deliberately show the skipped types in this warning */
7479 warningf(&arg_expr->base.source_position,
7480 "passing call argument %u as '%T' rather than '%T' due to prototype",
7481 pos, expected_type_skip, promoted_type);
7487 * Parse a call expression, ie. expression '( ... )'.
7489 * @param expression the function address
7491 static expression_t *parse_call_expression(expression_t *expression)
7493 expression_t *result = allocate_expression_zero(EXPR_CALL);
7494 result->base.source_position = expression->base.source_position;
7496 call_expression_t *call = &result->call;
7497 call->function = expression;
7499 type_t *const orig_type = expression->base.type;
7500 type_t *const type = skip_typeref(orig_type);
7502 function_type_t *function_type = NULL;
7503 if (is_type_pointer(type)) {
7504 type_t *const to_type = skip_typeref(type->pointer.points_to);
7506 if (is_type_function(to_type)) {
7507 function_type = &to_type->function;
7508 call->base.type = function_type->return_type;
7512 if (function_type == NULL && is_type_valid(type)) {
7513 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
7516 /* parse arguments */
7518 add_anchor_token(')');
7519 add_anchor_token(',');
7521 if (token.type != ')') {
7522 call_argument_t *last_argument = NULL;
7525 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7527 argument->expression = parse_assignment_expression();
7528 if (last_argument == NULL) {
7529 call->arguments = argument;
7531 last_argument->next = argument;
7533 last_argument = argument;
7535 if (token.type != ',')
7540 rem_anchor_token(',');
7541 rem_anchor_token(')');
7544 if (function_type == NULL)
7547 function_parameter_t *parameter = function_type->parameters;
7548 call_argument_t *argument = call->arguments;
7549 if (!function_type->unspecified_parameters) {
7550 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7551 parameter = parameter->next, argument = argument->next) {
7552 check_call_argument(parameter, argument, ++pos);
7555 if (parameter != NULL) {
7556 errorf(HERE, "too few arguments to function '%E'", expression);
7557 } else if (argument != NULL && !function_type->variadic) {
7558 errorf(HERE, "too many arguments to function '%E'", expression);
7562 /* do default promotion */
7563 for( ; argument != NULL; argument = argument->next) {
7564 type_t *type = argument->expression->base.type;
7566 type = get_default_promoted_type(type);
7568 argument->expression
7569 = create_implicit_cast(argument->expression, type);
7572 check_format(&result->call);
7574 if (warning.aggregate_return &&
7575 is_type_compound(skip_typeref(function_type->return_type))) {
7576 warningf(&result->base.source_position,
7577 "function call has aggregate value");
7584 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7586 static bool same_compound_type(const type_t *type1, const type_t *type2)
7589 is_type_compound(type1) &&
7590 type1->kind == type2->kind &&
7591 type1->compound.declaration == type2->compound.declaration;
7595 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7597 * @param expression the conditional expression
7599 static expression_t *parse_conditional_expression(expression_t *expression)
7601 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7603 conditional_expression_t *conditional = &result->conditional;
7604 conditional->base.source_position = *HERE;
7605 conditional->condition = expression;
7608 add_anchor_token(':');
7611 type_t *const condition_type_orig = expression->base.type;
7612 type_t *const condition_type = skip_typeref(condition_type_orig);
7613 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
7614 type_error("expected a scalar type in conditional condition",
7615 &expression->base.source_position, condition_type_orig);
7618 expression_t *true_expression = expression;
7619 bool gnu_cond = false;
7620 if (GNU_MODE && token.type == ':') {
7623 true_expression = parse_expression();
7624 rem_anchor_token(':');
7626 expression_t *false_expression =
7627 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7629 type_t *const orig_true_type = true_expression->base.type;
7630 type_t *const orig_false_type = false_expression->base.type;
7631 type_t *const true_type = skip_typeref(orig_true_type);
7632 type_t *const false_type = skip_typeref(orig_false_type);
7635 type_t *result_type;
7636 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7637 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7638 /* ISO/IEC 14882:1998(E) §5.16:2 */
7639 if (true_expression->kind == EXPR_UNARY_THROW) {
7640 result_type = false_type;
7641 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7642 result_type = true_type;
7644 if (warning.other && (
7645 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7646 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7648 warningf(&conditional->base.source_position,
7649 "ISO C forbids conditional expression with only one void side");
7651 result_type = type_void;
7653 } else if (is_type_arithmetic(true_type)
7654 && is_type_arithmetic(false_type)) {
7655 result_type = semantic_arithmetic(true_type, false_type);
7657 true_expression = create_implicit_cast(true_expression, result_type);
7658 false_expression = create_implicit_cast(false_expression, result_type);
7660 conditional->true_expression = true_expression;
7661 conditional->false_expression = false_expression;
7662 conditional->base.type = result_type;
7663 } else if (same_compound_type(true_type, false_type)) {
7664 /* just take 1 of the 2 types */
7665 result_type = true_type;
7666 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7667 type_t *pointer_type;
7669 expression_t *other_expression;
7670 if (is_type_pointer(true_type) &&
7671 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7672 pointer_type = true_type;
7673 other_type = false_type;
7674 other_expression = false_expression;
7676 pointer_type = false_type;
7677 other_type = true_type;
7678 other_expression = true_expression;
7681 if (is_null_pointer_constant(other_expression)) {
7682 result_type = pointer_type;
7683 } else if (is_type_pointer(other_type)) {
7684 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7685 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7688 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7689 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7691 } else if (types_compatible(get_unqualified_type(to1),
7692 get_unqualified_type(to2))) {
7695 if (warning.other) {
7696 warningf(&conditional->base.source_position,
7697 "pointer types '%T' and '%T' in conditional expression are incompatible",
7698 true_type, false_type);
7703 type_t *const type =
7704 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7705 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7706 } else if (is_type_integer(other_type)) {
7707 if (warning.other) {
7708 warningf(&conditional->base.source_position,
7709 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7711 result_type = pointer_type;
7713 if (is_type_valid(other_type)) {
7714 type_error_incompatible("while parsing conditional",
7715 &expression->base.source_position, true_type, false_type);
7717 result_type = type_error_type;
7720 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7721 type_error_incompatible("while parsing conditional",
7722 &conditional->base.source_position, true_type,
7725 result_type = type_error_type;
7728 conditional->true_expression
7729 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7730 conditional->false_expression
7731 = create_implicit_cast(false_expression, result_type);
7732 conditional->base.type = result_type;
7735 return create_invalid_expression();
7739 * Parse an extension expression.
7741 static expression_t *parse_extension(void)
7743 eat(T___extension__);
7745 bool old_gcc_extension = in_gcc_extension;
7746 in_gcc_extension = true;
7747 expression_t *expression = parse_sub_expression(PREC_UNARY);
7748 in_gcc_extension = old_gcc_extension;
7753 * Parse a __builtin_classify_type() expression.
7755 static expression_t *parse_builtin_classify_type(void)
7757 eat(T___builtin_classify_type);
7759 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7760 result->base.type = type_int;
7763 add_anchor_token(')');
7764 expression_t *expression = parse_expression();
7765 rem_anchor_token(')');
7767 result->classify_type.type_expression = expression;
7771 return create_invalid_expression();
7775 * Parse a throw expression
7776 * ISO/IEC 14882:1998(E) §15:1
7778 static expression_t *parse_throw(void)
7780 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7781 result->base.source_position = *HERE;
7782 result->base.type = type_void;
7786 expression_t *value = NULL;
7787 switch (token.type) {
7789 value = parse_assignment_expression();
7790 /* ISO/IEC 14882:1998(E) §15.1:3 */
7791 type_t *const orig_type = value->base.type;
7792 type_t *const type = skip_typeref(orig_type);
7793 if (is_type_incomplete(type)) {
7794 errorf(&value->base.source_position,
7795 "cannot throw object of incomplete type '%T'", orig_type);
7796 } else if (is_type_pointer(type)) {
7797 type_t *const points_to = skip_typeref(type->pointer.points_to);
7798 if (is_type_incomplete(points_to) &&
7799 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7800 errorf(&value->base.source_position,
7801 "cannot throw pointer to incomplete type '%T'", orig_type);
7809 result->unary.value = value;
7814 static bool check_pointer_arithmetic(const source_position_t *source_position,
7815 type_t *pointer_type,
7816 type_t *orig_pointer_type)
7818 type_t *points_to = pointer_type->pointer.points_to;
7819 points_to = skip_typeref(points_to);
7821 if (is_type_incomplete(points_to)) {
7822 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7823 errorf(source_position,
7824 "arithmetic with pointer to incomplete type '%T' not allowed",
7827 } else if (warning.pointer_arith) {
7828 warningf(source_position,
7829 "pointer of type '%T' used in arithmetic",
7832 } else if (is_type_function(points_to)) {
7834 errorf(source_position,
7835 "arithmetic with pointer to function type '%T' not allowed",
7838 } else if (warning.pointer_arith) {
7839 warningf(source_position,
7840 "pointer to a function '%T' used in arithmetic",
7847 static bool is_lvalue(const expression_t *expression)
7849 switch (expression->kind) {
7850 case EXPR_REFERENCE:
7851 case EXPR_ARRAY_ACCESS:
7853 case EXPR_UNARY_DEREFERENCE:
7857 /* Claim it is an lvalue, if the type is invalid. There was a parse
7858 * error before, which maybe prevented properly recognizing it as
7860 return !is_type_valid(skip_typeref(expression->base.type));
7864 static void semantic_incdec(unary_expression_t *expression)
7866 type_t *const orig_type = expression->value->base.type;
7867 type_t *const type = skip_typeref(orig_type);
7868 if (is_type_pointer(type)) {
7869 if (!check_pointer_arithmetic(&expression->base.source_position,
7873 } else if (!is_type_real(type) && is_type_valid(type)) {
7874 /* TODO: improve error message */
7875 errorf(&expression->base.source_position,
7876 "operation needs an arithmetic or pointer type");
7879 if (!is_lvalue(expression->value)) {
7880 /* TODO: improve error message */
7881 errorf(&expression->base.source_position, "lvalue required as operand");
7883 expression->base.type = orig_type;
7886 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7888 type_t *const orig_type = expression->value->base.type;
7889 type_t *const type = skip_typeref(orig_type);
7890 if (!is_type_arithmetic(type)) {
7891 if (is_type_valid(type)) {
7892 /* TODO: improve error message */
7893 errorf(&expression->base.source_position,
7894 "operation needs an arithmetic type");
7899 expression->base.type = orig_type;
7902 static void semantic_unexpr_plus(unary_expression_t *expression)
7904 semantic_unexpr_arithmetic(expression);
7905 if (warning.traditional)
7906 warningf(&expression->base.source_position,
7907 "traditional C rejects the unary plus operator");
7910 static expression_t const *get_reference_address(expression_t const *expr)
7912 bool regular_take_address = true;
7914 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7915 expr = expr->unary.value;
7917 regular_take_address = false;
7920 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7923 expr = expr->unary.value;
7926 if (expr->kind != EXPR_REFERENCE)
7929 if (!regular_take_address &&
7930 !is_type_function(skip_typeref(expr->reference.declaration->type))) {
7937 static void warn_function_address_as_bool(expression_t const* expr)
7939 if (!warning.address)
7942 expr = get_reference_address(expr);
7944 warningf(&expr->base.source_position,
7945 "the address of '%Y' will always evaluate as 'true'",
7946 expr->reference.declaration->symbol);
7950 static void semantic_not(unary_expression_t *expression)
7952 type_t *const orig_type = expression->value->base.type;
7953 type_t *const type = skip_typeref(orig_type);
7954 if (!is_type_scalar(type) && is_type_valid(type)) {
7955 errorf(&expression->base.source_position,
7956 "operand of ! must be of scalar type");
7959 warn_function_address_as_bool(expression->value);
7961 expression->base.type = type_int;
7964 static void semantic_unexpr_integer(unary_expression_t *expression)
7966 type_t *const orig_type = expression->value->base.type;
7967 type_t *const type = skip_typeref(orig_type);
7968 if (!is_type_integer(type)) {
7969 if (is_type_valid(type)) {
7970 errorf(&expression->base.source_position,
7971 "operand of ~ must be of integer type");
7976 expression->base.type = orig_type;
7979 static void semantic_dereference(unary_expression_t *expression)
7981 type_t *const orig_type = expression->value->base.type;
7982 type_t *const type = skip_typeref(orig_type);
7983 if (!is_type_pointer(type)) {
7984 if (is_type_valid(type)) {
7985 errorf(&expression->base.source_position,
7986 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7991 type_t *result_type = type->pointer.points_to;
7992 result_type = automatic_type_conversion(result_type);
7993 expression->base.type = result_type;
7997 * Record that an address is taken (expression represents an lvalue).
7999 * @param expression the expression
8000 * @param may_be_register if true, the expression might be an register
8002 static void set_address_taken(expression_t *expression, bool may_be_register)
8004 if (expression->kind != EXPR_REFERENCE)
8007 declaration_t *const declaration = expression->reference.declaration;
8008 /* happens for parse errors */
8009 if (declaration == NULL)
8012 if (declaration->storage_class == STORAGE_CLASS_REGISTER && !may_be_register) {
8013 errorf(&expression->base.source_position,
8014 "address of register variable '%Y' requested",
8015 declaration->symbol);
8017 declaration->address_taken = 1;
8022 * Check the semantic of the address taken expression.
8024 static void semantic_take_addr(unary_expression_t *expression)
8026 expression_t *value = expression->value;
8027 value->base.type = revert_automatic_type_conversion(value);
8029 type_t *orig_type = value->base.type;
8030 if (!is_type_valid(skip_typeref(orig_type)))
8033 set_address_taken(value, false);
8035 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8038 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8039 static expression_t *parse_##unexpression_type(void) \
8041 expression_t *unary_expression \
8042 = allocate_expression_zero(unexpression_type); \
8043 unary_expression->base.source_position = *HERE; \
8045 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8047 sfunc(&unary_expression->unary); \
8049 return unary_expression; \
8052 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8053 semantic_unexpr_arithmetic)
8054 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8055 semantic_unexpr_plus)
8056 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8058 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8059 semantic_dereference)
8060 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8062 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8063 semantic_unexpr_integer)
8064 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8066 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8069 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8071 static expression_t *parse_##unexpression_type(expression_t *left) \
8073 expression_t *unary_expression \
8074 = allocate_expression_zero(unexpression_type); \
8075 unary_expression->base.source_position = *HERE; \
8077 unary_expression->unary.value = left; \
8079 sfunc(&unary_expression->unary); \
8081 return unary_expression; \
8084 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8085 EXPR_UNARY_POSTFIX_INCREMENT,
8087 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8088 EXPR_UNARY_POSTFIX_DECREMENT,
8091 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8093 /* TODO: handle complex + imaginary types */
8095 type_left = get_unqualified_type(type_left);
8096 type_right = get_unqualified_type(type_right);
8098 /* § 6.3.1.8 Usual arithmetic conversions */
8099 if (type_left == type_long_double || type_right == type_long_double) {
8100 return type_long_double;
8101 } else if (type_left == type_double || type_right == type_double) {
8103 } else if (type_left == type_float || type_right == type_float) {
8107 type_left = promote_integer(type_left);
8108 type_right = promote_integer(type_right);
8110 if (type_left == type_right)
8113 bool const signed_left = is_type_signed(type_left);
8114 bool const signed_right = is_type_signed(type_right);
8115 int const rank_left = get_rank(type_left);
8116 int const rank_right = get_rank(type_right);
8118 if (signed_left == signed_right)
8119 return rank_left >= rank_right ? type_left : type_right;
8128 u_rank = rank_right;
8129 u_type = type_right;
8131 s_rank = rank_right;
8132 s_type = type_right;
8137 if (u_rank >= s_rank)
8140 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8142 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8143 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8147 case ATOMIC_TYPE_INT: return type_unsigned_int;
8148 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8149 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8151 default: panic("invalid atomic type");
8156 * Check the semantic restrictions for a binary expression.
8158 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8160 expression_t *const left = expression->left;
8161 expression_t *const right = expression->right;
8162 type_t *const orig_type_left = left->base.type;
8163 type_t *const orig_type_right = right->base.type;
8164 type_t *const type_left = skip_typeref(orig_type_left);
8165 type_t *const type_right = skip_typeref(orig_type_right);
8167 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8168 /* TODO: improve error message */
8169 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8170 errorf(&expression->base.source_position,
8171 "operation needs arithmetic types");
8176 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8177 expression->left = create_implicit_cast(left, arithmetic_type);
8178 expression->right = create_implicit_cast(right, arithmetic_type);
8179 expression->base.type = arithmetic_type;
8182 static void warn_div_by_zero(binary_expression_t const *const expression)
8184 if (!warning.div_by_zero ||
8185 !is_type_integer(expression->base.type))
8188 expression_t const *const right = expression->right;
8189 /* The type of the right operand can be different for /= */
8190 if (is_type_integer(right->base.type) &&
8191 is_constant_expression(right) &&
8192 fold_constant(right) == 0) {
8193 warningf(&expression->base.source_position, "division by zero");
8198 * Check the semantic restrictions for a div/mod expression.
8200 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
8201 semantic_binexpr_arithmetic(expression);
8202 warn_div_by_zero(expression);
8205 static void semantic_shift_op(binary_expression_t *expression)
8207 expression_t *const left = expression->left;
8208 expression_t *const right = expression->right;
8209 type_t *const orig_type_left = left->base.type;
8210 type_t *const orig_type_right = right->base.type;
8211 type_t * type_left = skip_typeref(orig_type_left);
8212 type_t * type_right = skip_typeref(orig_type_right);
8214 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8215 /* TODO: improve error message */
8216 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8217 errorf(&expression->base.source_position,
8218 "operands of shift operation must have integer types");
8223 type_left = promote_integer(type_left);
8224 type_right = promote_integer(type_right);
8226 expression->left = create_implicit_cast(left, type_left);
8227 expression->right = create_implicit_cast(right, type_right);
8228 expression->base.type = type_left;
8231 static void semantic_add(binary_expression_t *expression)
8233 expression_t *const left = expression->left;
8234 expression_t *const right = expression->right;
8235 type_t *const orig_type_left = left->base.type;
8236 type_t *const orig_type_right = right->base.type;
8237 type_t *const type_left = skip_typeref(orig_type_left);
8238 type_t *const type_right = skip_typeref(orig_type_right);
8241 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8242 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8243 expression->left = create_implicit_cast(left, arithmetic_type);
8244 expression->right = create_implicit_cast(right, arithmetic_type);
8245 expression->base.type = arithmetic_type;
8247 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8248 check_pointer_arithmetic(&expression->base.source_position,
8249 type_left, orig_type_left);
8250 expression->base.type = type_left;
8251 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8252 check_pointer_arithmetic(&expression->base.source_position,
8253 type_right, orig_type_right);
8254 expression->base.type = type_right;
8255 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8256 errorf(&expression->base.source_position,
8257 "invalid operands to binary + ('%T', '%T')",
8258 orig_type_left, orig_type_right);
8262 static void semantic_sub(binary_expression_t *expression)
8264 expression_t *const left = expression->left;
8265 expression_t *const right = expression->right;
8266 type_t *const orig_type_left = left->base.type;
8267 type_t *const orig_type_right = right->base.type;
8268 type_t *const type_left = skip_typeref(orig_type_left);
8269 type_t *const type_right = skip_typeref(orig_type_right);
8270 source_position_t const *const pos = &expression->base.source_position;
8273 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8274 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8275 expression->left = create_implicit_cast(left, arithmetic_type);
8276 expression->right = create_implicit_cast(right, arithmetic_type);
8277 expression->base.type = arithmetic_type;
8279 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8280 check_pointer_arithmetic(&expression->base.source_position,
8281 type_left, orig_type_left);
8282 expression->base.type = type_left;
8283 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8284 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8285 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8286 if (!types_compatible(unqual_left, unqual_right)) {
8288 "subtracting pointers to incompatible types '%T' and '%T'",
8289 orig_type_left, orig_type_right);
8290 } else if (!is_type_object(unqual_left)) {
8291 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8292 errorf(pos, "subtracting pointers to non-object types '%T'",
8294 } else if (warning.other) {
8295 warningf(pos, "subtracting pointers to void");
8298 expression->base.type = type_ptrdiff_t;
8299 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8300 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8301 orig_type_left, orig_type_right);
8305 static void warn_string_literal_address(expression_t const* expr)
8307 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8308 expr = expr->unary.value;
8309 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8311 expr = expr->unary.value;
8314 if (expr->kind == EXPR_STRING_LITERAL ||
8315 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8316 warningf(&expr->base.source_position,
8317 "comparison with string literal results in unspecified behaviour");
8322 * Check the semantics of comparison expressions.
8324 * @param expression The expression to check.
8326 static void semantic_comparison(binary_expression_t *expression)
8328 expression_t *left = expression->left;
8329 expression_t *right = expression->right;
8331 if (warning.address) {
8332 warn_string_literal_address(left);
8333 warn_string_literal_address(right);
8335 expression_t const* const func_left = get_reference_address(left);
8336 if (func_left != NULL && is_null_pointer_constant(right)) {
8337 warningf(&expression->base.source_position,
8338 "the address of '%Y' will never be NULL",
8339 func_left->reference.declaration->symbol);
8342 expression_t const* const func_right = get_reference_address(right);
8343 if (func_right != NULL && is_null_pointer_constant(right)) {
8344 warningf(&expression->base.source_position,
8345 "the address of '%Y' will never be NULL",
8346 func_right->reference.declaration->symbol);
8350 type_t *orig_type_left = left->base.type;
8351 type_t *orig_type_right = right->base.type;
8352 type_t *type_left = skip_typeref(orig_type_left);
8353 type_t *type_right = skip_typeref(orig_type_right);
8355 /* TODO non-arithmetic types */
8356 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8357 /* test for signed vs unsigned compares */
8358 if (warning.sign_compare &&
8359 (expression->base.kind != EXPR_BINARY_EQUAL &&
8360 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
8361 (is_type_signed(type_left) != is_type_signed(type_right))) {
8363 /* check if 1 of the operands is a constant, in this case we just
8364 * check wether we can safely represent the resulting constant in
8365 * the type of the other operand. */
8366 expression_t *const_expr = NULL;
8367 expression_t *other_expr = NULL;
8369 if (is_constant_expression(left)) {
8372 } else if (is_constant_expression(right)) {
8377 if (const_expr != NULL) {
8378 type_t *other_type = skip_typeref(other_expr->base.type);
8379 long val = fold_constant(const_expr);
8380 /* TODO: check if val can be represented by other_type */
8384 warningf(&expression->base.source_position,
8385 "comparison between signed and unsigned");
8387 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8388 expression->left = create_implicit_cast(left, arithmetic_type);
8389 expression->right = create_implicit_cast(right, arithmetic_type);
8390 expression->base.type = arithmetic_type;
8391 if (warning.float_equal &&
8392 (expression->base.kind == EXPR_BINARY_EQUAL ||
8393 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8394 is_type_float(arithmetic_type)) {
8395 warningf(&expression->base.source_position,
8396 "comparing floating point with == or != is unsafe");
8398 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8399 /* TODO check compatibility */
8400 } else if (is_type_pointer(type_left)) {
8401 expression->right = create_implicit_cast(right, type_left);
8402 } else if (is_type_pointer(type_right)) {
8403 expression->left = create_implicit_cast(left, type_right);
8404 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8405 type_error_incompatible("invalid operands in comparison",
8406 &expression->base.source_position,
8407 type_left, type_right);
8409 expression->base.type = type_int;
8413 * Checks if a compound type has constant fields.
8415 static bool has_const_fields(const compound_type_t *type)
8417 const scope_t *scope = &type->declaration->scope;
8418 const declaration_t *declaration = scope->declarations;
8420 for (; declaration != NULL; declaration = declaration->next) {
8421 if (declaration->namespc != NAMESPACE_NORMAL)
8424 const type_t *decl_type = skip_typeref(declaration->type);
8425 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8432 static bool is_valid_assignment_lhs(expression_t const* const left)
8434 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8435 type_t *const type_left = skip_typeref(orig_type_left);
8437 if (!is_lvalue(left)) {
8438 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8443 if (is_type_array(type_left)) {
8444 errorf(HERE, "cannot assign to arrays ('%E')", left);
8447 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8448 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8452 if (is_type_incomplete(type_left)) {
8453 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8454 left, orig_type_left);
8457 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8458 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8459 left, orig_type_left);
8466 static void semantic_arithmetic_assign(binary_expression_t *expression)
8468 expression_t *left = expression->left;
8469 expression_t *right = expression->right;
8470 type_t *orig_type_left = left->base.type;
8471 type_t *orig_type_right = right->base.type;
8473 if (!is_valid_assignment_lhs(left))
8476 type_t *type_left = skip_typeref(orig_type_left);
8477 type_t *type_right = skip_typeref(orig_type_right);
8479 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8480 /* TODO: improve error message */
8481 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8482 errorf(&expression->base.source_position,
8483 "operation needs arithmetic types");
8488 /* combined instructions are tricky. We can't create an implicit cast on
8489 * the left side, because we need the uncasted form for the store.
8490 * The ast2firm pass has to know that left_type must be right_type
8491 * for the arithmetic operation and create a cast by itself */
8492 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8493 expression->right = create_implicit_cast(right, arithmetic_type);
8494 expression->base.type = type_left;
8497 static void semantic_divmod_assign(binary_expression_t *expression)
8499 semantic_arithmetic_assign(expression);
8500 warn_div_by_zero(expression);
8503 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8505 expression_t *const left = expression->left;
8506 expression_t *const right = expression->right;
8507 type_t *const orig_type_left = left->base.type;
8508 type_t *const orig_type_right = right->base.type;
8509 type_t *const type_left = skip_typeref(orig_type_left);
8510 type_t *const type_right = skip_typeref(orig_type_right);
8512 if (!is_valid_assignment_lhs(left))
8515 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8516 /* combined instructions are tricky. We can't create an implicit cast on
8517 * the left side, because we need the uncasted form for the store.
8518 * The ast2firm pass has to know that left_type must be right_type
8519 * for the arithmetic operation and create a cast by itself */
8520 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8521 expression->right = create_implicit_cast(right, arithmetic_type);
8522 expression->base.type = type_left;
8523 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8524 check_pointer_arithmetic(&expression->base.source_position,
8525 type_left, orig_type_left);
8526 expression->base.type = type_left;
8527 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8528 errorf(&expression->base.source_position,
8529 "incompatible types '%T' and '%T' in assignment",
8530 orig_type_left, orig_type_right);
8535 * Check the semantic restrictions of a logical expression.
8537 static void semantic_logical_op(binary_expression_t *expression)
8539 expression_t *const left = expression->left;
8540 expression_t *const right = expression->right;
8541 type_t *const orig_type_left = left->base.type;
8542 type_t *const orig_type_right = right->base.type;
8543 type_t *const type_left = skip_typeref(orig_type_left);
8544 type_t *const type_right = skip_typeref(orig_type_right);
8546 warn_function_address_as_bool(left);
8547 warn_function_address_as_bool(right);
8549 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
8550 /* TODO: improve error message */
8551 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8552 errorf(&expression->base.source_position,
8553 "operation needs scalar types");
8558 expression->base.type = type_int;
8562 * Check the semantic restrictions of a binary assign expression.
8564 static void semantic_binexpr_assign(binary_expression_t *expression)
8566 expression_t *left = expression->left;
8567 type_t *orig_type_left = left->base.type;
8569 if (!is_valid_assignment_lhs(left))
8572 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8573 report_assign_error(error, orig_type_left, expression->right,
8574 "assignment", &left->base.source_position);
8575 expression->right = create_implicit_cast(expression->right, orig_type_left);
8576 expression->base.type = orig_type_left;
8580 * Determine if the outermost operation (or parts thereof) of the given
8581 * expression has no effect in order to generate a warning about this fact.
8582 * Therefore in some cases this only examines some of the operands of the
8583 * expression (see comments in the function and examples below).
8585 * f() + 23; // warning, because + has no effect
8586 * x || f(); // no warning, because x controls execution of f()
8587 * x ? y : f(); // warning, because y has no effect
8588 * (void)x; // no warning to be able to suppress the warning
8589 * This function can NOT be used for an "expression has definitely no effect"-
8591 static bool expression_has_effect(const expression_t *const expr)
8593 switch (expr->kind) {
8594 case EXPR_UNKNOWN: break;
8595 case EXPR_INVALID: return true; /* do NOT warn */
8596 case EXPR_REFERENCE: return false;
8597 /* suppress the warning for microsoft __noop operations */
8598 case EXPR_CONST: return expr->conste.is_ms_noop;
8599 case EXPR_CHARACTER_CONSTANT: return false;
8600 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8601 case EXPR_STRING_LITERAL: return false;
8602 case EXPR_WIDE_STRING_LITERAL: return false;
8603 case EXPR_LABEL_ADDRESS: return false;
8606 const call_expression_t *const call = &expr->call;
8607 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
8610 switch (call->function->builtin_symbol.symbol->ID) {
8611 case T___builtin_va_end: return true;
8612 default: return false;
8616 /* Generate the warning if either the left or right hand side of a
8617 * conditional expression has no effect */
8618 case EXPR_CONDITIONAL: {
8619 const conditional_expression_t *const cond = &expr->conditional;
8621 expression_has_effect(cond->true_expression) &&
8622 expression_has_effect(cond->false_expression);
8625 case EXPR_SELECT: return false;
8626 case EXPR_ARRAY_ACCESS: return false;
8627 case EXPR_SIZEOF: return false;
8628 case EXPR_CLASSIFY_TYPE: return false;
8629 case EXPR_ALIGNOF: return false;
8631 case EXPR_FUNCNAME: return false;
8632 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
8633 case EXPR_BUILTIN_CONSTANT_P: return false;
8634 case EXPR_BUILTIN_PREFETCH: return true;
8635 case EXPR_OFFSETOF: return false;
8636 case EXPR_VA_START: return true;
8637 case EXPR_VA_ARG: return true;
8638 case EXPR_STATEMENT: return true; // TODO
8639 case EXPR_COMPOUND_LITERAL: return false;
8641 case EXPR_UNARY_NEGATE: return false;
8642 case EXPR_UNARY_PLUS: return false;
8643 case EXPR_UNARY_BITWISE_NEGATE: return false;
8644 case EXPR_UNARY_NOT: return false;
8645 case EXPR_UNARY_DEREFERENCE: return false;
8646 case EXPR_UNARY_TAKE_ADDRESS: return false;
8647 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8648 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8649 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8650 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8652 /* Treat void casts as if they have an effect in order to being able to
8653 * suppress the warning */
8654 case EXPR_UNARY_CAST: {
8655 type_t *const type = skip_typeref(expr->base.type);
8656 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8659 case EXPR_UNARY_CAST_IMPLICIT: return true;
8660 case EXPR_UNARY_ASSUME: return true;
8661 case EXPR_UNARY_THROW: return true;
8663 case EXPR_BINARY_ADD: return false;
8664 case EXPR_BINARY_SUB: return false;
8665 case EXPR_BINARY_MUL: return false;
8666 case EXPR_BINARY_DIV: return false;
8667 case EXPR_BINARY_MOD: return false;
8668 case EXPR_BINARY_EQUAL: return false;
8669 case EXPR_BINARY_NOTEQUAL: return false;
8670 case EXPR_BINARY_LESS: return false;
8671 case EXPR_BINARY_LESSEQUAL: return false;
8672 case EXPR_BINARY_GREATER: return false;
8673 case EXPR_BINARY_GREATEREQUAL: return false;
8674 case EXPR_BINARY_BITWISE_AND: return false;
8675 case EXPR_BINARY_BITWISE_OR: return false;
8676 case EXPR_BINARY_BITWISE_XOR: return false;
8677 case EXPR_BINARY_SHIFTLEFT: return false;
8678 case EXPR_BINARY_SHIFTRIGHT: return false;
8679 case EXPR_BINARY_ASSIGN: return true;
8680 case EXPR_BINARY_MUL_ASSIGN: return true;
8681 case EXPR_BINARY_DIV_ASSIGN: return true;
8682 case EXPR_BINARY_MOD_ASSIGN: return true;
8683 case EXPR_BINARY_ADD_ASSIGN: return true;
8684 case EXPR_BINARY_SUB_ASSIGN: return true;
8685 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8686 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8687 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8688 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8689 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8691 /* Only examine the right hand side of && and ||, because the left hand
8692 * side already has the effect of controlling the execution of the right
8694 case EXPR_BINARY_LOGICAL_AND:
8695 case EXPR_BINARY_LOGICAL_OR:
8696 /* Only examine the right hand side of a comma expression, because the left
8697 * hand side has a separate warning */
8698 case EXPR_BINARY_COMMA:
8699 return expression_has_effect(expr->binary.right);
8701 case EXPR_BINARY_BUILTIN_EXPECT: return true;
8702 case EXPR_BINARY_ISGREATER: return false;
8703 case EXPR_BINARY_ISGREATEREQUAL: return false;
8704 case EXPR_BINARY_ISLESS: return false;
8705 case EXPR_BINARY_ISLESSEQUAL: return false;
8706 case EXPR_BINARY_ISLESSGREATER: return false;
8707 case EXPR_BINARY_ISUNORDERED: return false;
8710 internal_errorf(HERE, "unexpected expression");
8713 static void semantic_comma(binary_expression_t *expression)
8715 if (warning.unused_value) {
8716 const expression_t *const left = expression->left;
8717 if (!expression_has_effect(left)) {
8718 warningf(&left->base.source_position,
8719 "left-hand operand of comma expression has no effect");
8722 expression->base.type = expression->right->base.type;
8726 * @param prec_r precedence of the right operand
8728 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8729 static expression_t *parse_##binexpression_type(expression_t *left) \
8731 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8732 binexpr->base.source_position = *HERE; \
8733 binexpr->binary.left = left; \
8736 expression_t *right = parse_sub_expression(prec_r); \
8738 binexpr->binary.right = right; \
8739 sfunc(&binexpr->binary); \
8744 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8745 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8746 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8747 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8748 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8749 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8750 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8751 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8752 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8753 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8754 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8755 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8756 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8757 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8758 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8759 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8760 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8761 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8762 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8763 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8764 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8765 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8766 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8767 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8768 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8769 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8770 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8771 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8772 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8773 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8776 static expression_t *parse_sub_expression(precedence_t precedence)
8778 if (token.type < 0) {
8779 return expected_expression_error();
8782 expression_parser_function_t *parser
8783 = &expression_parsers[token.type];
8784 source_position_t source_position = token.source_position;
8787 if (parser->parser != NULL) {
8788 left = parser->parser();
8790 left = parse_primary_expression();
8792 assert(left != NULL);
8793 left->base.source_position = source_position;
8796 if (token.type < 0) {
8797 return expected_expression_error();
8800 parser = &expression_parsers[token.type];
8801 if (parser->infix_parser == NULL)
8803 if (parser->infix_precedence < precedence)
8806 left = parser->infix_parser(left);
8808 assert(left != NULL);
8809 assert(left->kind != EXPR_UNKNOWN);
8810 left->base.source_position = source_position;
8817 * Parse an expression.
8819 static expression_t *parse_expression(void)
8821 return parse_sub_expression(PREC_EXPRESSION);
8825 * Register a parser for a prefix-like operator.
8827 * @param parser the parser function
8828 * @param token_type the token type of the prefix token
8830 static void register_expression_parser(parse_expression_function parser,
8833 expression_parser_function_t *entry = &expression_parsers[token_type];
8835 if (entry->parser != NULL) {
8836 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8837 panic("trying to register multiple expression parsers for a token");
8839 entry->parser = parser;
8843 * Register a parser for an infix operator with given precedence.
8845 * @param parser the parser function
8846 * @param token_type the token type of the infix operator
8847 * @param precedence the precedence of the operator
8849 static void register_infix_parser(parse_expression_infix_function parser,
8850 int token_type, unsigned precedence)
8852 expression_parser_function_t *entry = &expression_parsers[token_type];
8854 if (entry->infix_parser != NULL) {
8855 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8856 panic("trying to register multiple infix expression parsers for a "
8859 entry->infix_parser = parser;
8860 entry->infix_precedence = precedence;
8864 * Initialize the expression parsers.
8866 static void init_expression_parsers(void)
8868 memset(&expression_parsers, 0, sizeof(expression_parsers));
8870 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
8871 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
8872 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
8873 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
8874 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
8875 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
8876 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
8877 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
8878 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
8879 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
8880 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
8881 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
8882 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
8883 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
8884 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
8885 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
8886 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
8887 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
8888 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8889 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
8890 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
8891 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
8892 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
8893 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
8894 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
8895 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
8896 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
8897 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
8898 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
8899 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
8900 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
8901 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
8902 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
8903 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
8904 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
8905 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
8906 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
8908 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
8909 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
8910 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
8911 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
8912 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
8913 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
8914 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8915 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8916 register_expression_parser(parse_sizeof, T_sizeof);
8917 register_expression_parser(parse_alignof, T___alignof__);
8918 register_expression_parser(parse_extension, T___extension__);
8919 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
8920 register_expression_parser(parse_throw, T_throw);
8924 * Parse a asm statement arguments specification.
8926 static asm_argument_t *parse_asm_arguments(bool is_out)
8928 asm_argument_t *result = NULL;
8929 asm_argument_t *last = NULL;
8931 while (token.type == T_STRING_LITERAL || token.type == '[') {
8932 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8933 memset(argument, 0, sizeof(argument[0]));
8935 if (token.type == '[') {
8937 if (token.type != T_IDENTIFIER) {
8938 parse_error_expected("while parsing asm argument",
8939 T_IDENTIFIER, NULL);
8942 argument->symbol = token.v.symbol;
8947 argument->constraints = parse_string_literals();
8949 add_anchor_token(')');
8950 expression_t *expression = parse_expression();
8951 rem_anchor_token(')');
8953 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8954 * change size or type representation (e.g. int -> long is ok, but
8955 * int -> float is not) */
8956 if (expression->kind == EXPR_UNARY_CAST) {
8957 type_t *const type = expression->base.type;
8958 type_kind_t const kind = type->kind;
8959 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8962 if (kind == TYPE_ATOMIC) {
8963 atomic_type_kind_t const akind = type->atomic.akind;
8964 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8965 size = get_atomic_type_size(akind);
8967 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8968 size = get_atomic_type_size(get_intptr_kind());
8972 expression_t *const value = expression->unary.value;
8973 type_t *const value_type = value->base.type;
8974 type_kind_t const value_kind = value_type->kind;
8976 unsigned value_flags;
8977 unsigned value_size;
8978 if (value_kind == TYPE_ATOMIC) {
8979 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8980 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8981 value_size = get_atomic_type_size(value_akind);
8982 } else if (value_kind == TYPE_POINTER) {
8983 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8984 value_size = get_atomic_type_size(get_intptr_kind());
8989 if (value_flags != flags || value_size != size)
8993 } while (expression->kind == EXPR_UNARY_CAST);
8997 if (!is_lvalue(expression)) {
8998 errorf(&expression->base.source_position,
8999 "asm output argument is not an lvalue");
9002 if (argument->constraints.begin[0] == '+')
9003 mark_decls_read(expression, NULL);
9005 mark_decls_read(expression, NULL);
9007 argument->expression = expression;
9010 set_address_taken(expression, true);
9013 last->next = argument;
9019 if (token.type != ',')
9030 * Parse a asm statement clobber specification.
9032 static asm_clobber_t *parse_asm_clobbers(void)
9034 asm_clobber_t *result = NULL;
9035 asm_clobber_t *last = NULL;
9037 while(token.type == T_STRING_LITERAL) {
9038 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9039 clobber->clobber = parse_string_literals();
9042 last->next = clobber;
9048 if (token.type != ',')
9057 * Parse an asm statement.
9059 static statement_t *parse_asm_statement(void)
9061 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9062 asm_statement_t *asm_statement = &statement->asms;
9066 if (token.type == T_volatile) {
9068 asm_statement->is_volatile = true;
9072 add_anchor_token(')');
9073 add_anchor_token(':');
9074 asm_statement->asm_text = parse_string_literals();
9076 if (token.type != ':') {
9077 rem_anchor_token(':');
9082 asm_statement->outputs = parse_asm_arguments(true);
9083 if (token.type != ':') {
9084 rem_anchor_token(':');
9089 asm_statement->inputs = parse_asm_arguments(false);
9090 if (token.type != ':') {
9091 rem_anchor_token(':');
9094 rem_anchor_token(':');
9097 asm_statement->clobbers = parse_asm_clobbers();
9100 rem_anchor_token(')');
9104 if (asm_statement->outputs == NULL) {
9105 /* GCC: An 'asm' instruction without any output operands will be treated
9106 * identically to a volatile 'asm' instruction. */
9107 asm_statement->is_volatile = true;
9112 return create_invalid_statement();
9116 * Parse a case statement.
9118 static statement_t *parse_case_statement(void)
9120 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9121 source_position_t *const pos = &statement->base.source_position;
9125 expression_t *const expression = parse_expression();
9126 statement->case_label.expression = expression;
9127 if (!is_constant_expression(expression)) {
9128 /* This check does not prevent the error message in all cases of an
9129 * prior error while parsing the expression. At least it catches the
9130 * common case of a mistyped enum entry. */
9131 if (is_type_valid(skip_typeref(expression->base.type))) {
9132 errorf(pos, "case label does not reduce to an integer constant");
9134 statement->case_label.is_bad = true;
9136 long const val = fold_constant(expression);
9137 statement->case_label.first_case = val;
9138 statement->case_label.last_case = val;
9142 if (token.type == T_DOTDOTDOT) {
9144 expression_t *const end_range = parse_expression();
9145 statement->case_label.end_range = end_range;
9146 if (!is_constant_expression(end_range)) {
9147 /* This check does not prevent the error message in all cases of an
9148 * prior error while parsing the expression. At least it catches the
9149 * common case of a mistyped enum entry. */
9150 if (is_type_valid(skip_typeref(end_range->base.type))) {
9151 errorf(pos, "case range does not reduce to an integer constant");
9153 statement->case_label.is_bad = true;
9155 long const val = fold_constant(end_range);
9156 statement->case_label.last_case = val;
9158 if (warning.other && val < statement->case_label.first_case) {
9159 statement->case_label.is_empty_range = true;
9160 warningf(pos, "empty range specified");
9166 PUSH_PARENT(statement);
9170 if (current_switch != NULL) {
9171 if (! statement->case_label.is_bad) {
9172 /* Check for duplicate case values */
9173 case_label_statement_t *c = &statement->case_label;
9174 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9175 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9178 if (c->last_case < l->first_case || c->first_case > l->last_case)
9181 errorf(pos, "duplicate case value (previously used %P)",
9182 &l->base.source_position);
9186 /* link all cases into the switch statement */
9187 if (current_switch->last_case == NULL) {
9188 current_switch->first_case = &statement->case_label;
9190 current_switch->last_case->next = &statement->case_label;
9192 current_switch->last_case = &statement->case_label;
9194 errorf(pos, "case label not within a switch statement");
9197 statement_t *const inner_stmt = parse_statement();
9198 statement->case_label.statement = inner_stmt;
9199 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9200 errorf(&inner_stmt->base.source_position, "declaration after case label");
9207 return create_invalid_statement();
9211 * Parse a default statement.
9213 static statement_t *parse_default_statement(void)
9215 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9219 PUSH_PARENT(statement);
9222 if (current_switch != NULL) {
9223 const case_label_statement_t *def_label = current_switch->default_label;
9224 if (def_label != NULL) {
9225 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9226 &def_label->base.source_position);
9228 current_switch->default_label = &statement->case_label;
9230 /* link all cases into the switch statement */
9231 if (current_switch->last_case == NULL) {
9232 current_switch->first_case = &statement->case_label;
9234 current_switch->last_case->next = &statement->case_label;
9236 current_switch->last_case = &statement->case_label;
9239 errorf(&statement->base.source_position,
9240 "'default' label not within a switch statement");
9243 statement_t *const inner_stmt = parse_statement();
9244 statement->case_label.statement = inner_stmt;
9245 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9246 errorf(&inner_stmt->base.source_position, "declaration after default label");
9253 return create_invalid_statement();
9257 * Parse a label statement.
9259 static statement_t *parse_label_statement(void)
9261 assert(token.type == T_IDENTIFIER);
9262 symbol_t *symbol = token.v.symbol;
9263 declaration_t *label = get_label(symbol);
9265 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9266 statement->label.label = label;
9270 PUSH_PARENT(statement);
9272 /* if statement is already set then the label is defined twice,
9273 * otherwise it was just mentioned in a goto/local label declaration so far */
9274 if (label->init.statement != NULL) {
9275 errorf(HERE, "duplicate label '%Y' (declared %P)",
9276 symbol, &label->source_position);
9278 label->source_position = token.source_position;
9279 label->init.statement = statement;
9284 if (token.type == '}') {
9285 /* TODO only warn? */
9286 if (warning.other && false) {
9287 warningf(HERE, "label at end of compound statement");
9288 statement->label.statement = create_empty_statement();
9290 errorf(HERE, "label at end of compound statement");
9291 statement->label.statement = create_invalid_statement();
9293 } else if (token.type == ';') {
9294 /* Eat an empty statement here, to avoid the warning about an empty
9295 * statement after a label. label:; is commonly used to have a label
9296 * before a closing brace. */
9297 statement->label.statement = create_empty_statement();
9300 statement_t *const inner_stmt = parse_statement();
9301 statement->label.statement = inner_stmt;
9302 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9303 errorf(&inner_stmt->base.source_position, "declaration after label");
9307 /* remember the labels in a list for later checking */
9308 if (label_last == NULL) {
9309 label_first = &statement->label;
9311 label_last->next = &statement->label;
9313 label_last = &statement->label;
9320 * Parse an if statement.
9322 static statement_t *parse_if(void)
9324 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9328 PUSH_PARENT(statement);
9330 add_anchor_token('{');
9333 add_anchor_token(')');
9334 expression_t *const expr = parse_expression();
9335 statement->ifs.condition = expr;
9336 mark_decls_read(expr, NULL);
9337 rem_anchor_token(')');
9341 rem_anchor_token('{');
9343 add_anchor_token(T_else);
9344 statement->ifs.true_statement = parse_statement();
9345 rem_anchor_token(T_else);
9347 if (token.type == T_else) {
9349 statement->ifs.false_statement = parse_statement();
9357 * Check that all enums are handled in a switch.
9359 * @param statement the switch statement to check
9361 static void check_enum_cases(const switch_statement_t *statement) {
9362 const type_t *type = skip_typeref(statement->expression->base.type);
9363 if (! is_type_enum(type))
9365 const enum_type_t *enumt = &type->enumt;
9367 /* if we have a default, no warnings */
9368 if (statement->default_label != NULL)
9371 /* FIXME: calculation of value should be done while parsing */
9372 const declaration_t *declaration;
9373 long last_value = -1;
9374 for (declaration = enumt->declaration->next;
9375 declaration != NULL && declaration->storage_class == STORAGE_CLASS_ENUM_ENTRY;
9376 declaration = declaration->next) {
9377 const expression_t *expression = declaration->init.enum_value;
9378 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
9380 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9381 if (l->expression == NULL)
9383 if (l->first_case <= value && value <= l->last_case) {
9389 warningf(&statement->base.source_position,
9390 "enumeration value '%Y' not handled in switch", declaration->symbol);
9397 * Parse a switch statement.
9399 static statement_t *parse_switch(void)
9401 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9405 PUSH_PARENT(statement);
9408 add_anchor_token(')');
9409 expression_t *const expr = parse_expression();
9410 mark_decls_read(expr, NULL);
9411 type_t * type = skip_typeref(expr->base.type);
9412 if (is_type_integer(type)) {
9413 type = promote_integer(type);
9414 if (warning.traditional) {
9415 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9416 warningf(&expr->base.source_position,
9417 "'%T' switch expression not converted to '%T' in ISO C",
9421 } else if (is_type_valid(type)) {
9422 errorf(&expr->base.source_position,
9423 "switch quantity is not an integer, but '%T'", type);
9424 type = type_error_type;
9426 statement->switchs.expression = create_implicit_cast(expr, type);
9428 rem_anchor_token(')');
9430 switch_statement_t *rem = current_switch;
9431 current_switch = &statement->switchs;
9432 statement->switchs.body = parse_statement();
9433 current_switch = rem;
9435 if (warning.switch_default &&
9436 statement->switchs.default_label == NULL) {
9437 warningf(&statement->base.source_position, "switch has no default case");
9439 if (warning.switch_enum)
9440 check_enum_cases(&statement->switchs);
9446 return create_invalid_statement();
9449 static statement_t *parse_loop_body(statement_t *const loop)
9451 statement_t *const rem = current_loop;
9452 current_loop = loop;
9454 statement_t *const body = parse_statement();
9461 * Parse a while statement.
9463 static statement_t *parse_while(void)
9465 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9469 PUSH_PARENT(statement);
9472 add_anchor_token(')');
9473 expression_t *const cond = parse_expression();
9474 statement->whiles.condition = cond;
9475 mark_decls_read(cond, NULL);
9476 rem_anchor_token(')');
9479 statement->whiles.body = parse_loop_body(statement);
9485 return create_invalid_statement();
9489 * Parse a do statement.
9491 static statement_t *parse_do(void)
9493 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9497 PUSH_PARENT(statement);
9499 add_anchor_token(T_while);
9500 statement->do_while.body = parse_loop_body(statement);
9501 rem_anchor_token(T_while);
9505 add_anchor_token(')');
9506 expression_t *const cond = parse_expression();
9507 statement->do_while.condition = cond;
9508 mark_decls_read(cond, NULL);
9509 rem_anchor_token(')');
9517 return create_invalid_statement();
9521 * Parse a for statement.
9523 static statement_t *parse_for(void)
9525 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9529 PUSH_PARENT(statement);
9531 size_t const top = environment_top();
9532 scope_push(&statement->fors.scope);
9535 add_anchor_token(')');
9537 if (token.type != ';') {
9538 if (is_declaration_specifier(&token, false)) {
9539 parse_declaration(record_declaration);
9541 add_anchor_token(';');
9542 expression_t *const init = parse_expression();
9543 statement->fors.initialisation = init;
9544 mark_decls_read(init, DECL_ANY);
9545 if (warning.unused_value && !expression_has_effect(init)) {
9546 warningf(&init->base.source_position,
9547 "initialisation of 'for'-statement has no effect");
9549 rem_anchor_token(';');
9556 if (token.type != ';') {
9557 add_anchor_token(';');
9558 expression_t *const cond = parse_expression();
9559 statement->fors.condition = cond;
9560 mark_decls_read(cond, NULL);
9561 rem_anchor_token(';');
9564 if (token.type != ')') {
9565 expression_t *const step = parse_expression();
9566 statement->fors.step = step;
9567 mark_decls_read(step, DECL_ANY);
9568 if (warning.unused_value && !expression_has_effect(step)) {
9569 warningf(&step->base.source_position,
9570 "step of 'for'-statement has no effect");
9573 rem_anchor_token(')');
9575 statement->fors.body = parse_loop_body(statement);
9577 assert(scope == &statement->fors.scope);
9579 environment_pop_to(top);
9586 rem_anchor_token(')');
9587 assert(scope == &statement->fors.scope);
9589 environment_pop_to(top);
9591 return create_invalid_statement();
9595 * Parse a goto statement.
9597 static statement_t *parse_goto(void)
9599 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9602 if (GNU_MODE && token.type == '*') {
9604 expression_t *expression = parse_expression();
9605 mark_decls_read(expression, NULL);
9607 /* Argh: although documentation say the expression must be of type void *,
9608 * gcc excepts anything that can be casted into void * without error */
9609 type_t *type = expression->base.type;
9611 if (type != type_error_type) {
9612 if (!is_type_pointer(type) && !is_type_integer(type)) {
9613 errorf(&expression->base.source_position,
9614 "cannot convert to a pointer type");
9615 } else if (warning.other && type != type_void_ptr) {
9616 warningf(&expression->base.source_position,
9617 "type of computed goto expression should be 'void*' not '%T'", type);
9619 expression = create_implicit_cast(expression, type_void_ptr);
9622 statement->gotos.expression = expression;
9624 if (token.type != T_IDENTIFIER) {
9626 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9628 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9632 symbol_t *symbol = token.v.symbol;
9635 statement->gotos.label = get_label(symbol);
9638 /* remember the goto's in a list for later checking */
9639 if (goto_last == NULL) {
9640 goto_first = &statement->gotos;
9642 goto_last->next = &statement->gotos;
9644 goto_last = &statement->gotos;
9650 return create_invalid_statement();
9654 * Parse a continue statement.
9656 static statement_t *parse_continue(void)
9658 if (current_loop == NULL) {
9659 errorf(HERE, "continue statement not within loop");
9662 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9672 * Parse a break statement.
9674 static statement_t *parse_break(void)
9676 if (current_switch == NULL && current_loop == NULL) {
9677 errorf(HERE, "break statement not within loop or switch");
9680 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9690 * Parse a __leave statement.
9692 static statement_t *parse_leave_statement(void)
9694 if (current_try == NULL) {
9695 errorf(HERE, "__leave statement not within __try");
9698 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9708 * Check if a given declaration represents a local variable.
9710 static bool is_local_var_declaration(const declaration_t *declaration)
9712 switch ((storage_class_tag_t) declaration->storage_class) {
9713 case STORAGE_CLASS_AUTO:
9714 case STORAGE_CLASS_REGISTER: {
9715 const type_t *type = skip_typeref(declaration->type);
9716 if (is_type_function(type)) {
9728 * Check if a given declaration represents a variable.
9730 static bool is_var_declaration(const declaration_t *declaration)
9732 if (declaration->storage_class == STORAGE_CLASS_TYPEDEF)
9735 const type_t *type = skip_typeref(declaration->type);
9736 return !is_type_function(type);
9740 * Check if a given expression represents a local variable.
9742 static bool is_local_variable(const expression_t *expression)
9744 if (expression->base.kind != EXPR_REFERENCE) {
9747 const declaration_t *declaration = expression->reference.declaration;
9748 return is_local_var_declaration(declaration);
9752 * Check if a given expression represents a local variable and
9753 * return its declaration then, else return NULL.
9755 declaration_t *expr_is_variable(const expression_t *expression)
9757 if (expression->base.kind != EXPR_REFERENCE) {
9760 declaration_t *declaration = expression->reference.declaration;
9761 if (is_var_declaration(declaration))
9767 * Parse a return statement.
9769 static statement_t *parse_return(void)
9773 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9775 expression_t *return_value = NULL;
9776 if (token.type != ';') {
9777 return_value = parse_expression();
9778 mark_decls_read(return_value, NULL);
9781 const type_t *const func_type = current_function->type;
9782 assert(is_type_function(func_type));
9783 type_t *const return_type = skip_typeref(func_type->function.return_type);
9785 if (return_value != NULL) {
9786 type_t *return_value_type = skip_typeref(return_value->base.type);
9788 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID) &&
9789 !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9790 if (warning.other) {
9791 warningf(&statement->base.source_position,
9792 "'return' with a value, in function returning void");
9794 return_value = NULL;
9796 assign_error_t error = semantic_assign(return_type, return_value);
9797 report_assign_error(error, return_type, return_value, "'return'",
9798 &statement->base.source_position);
9799 return_value = create_implicit_cast(return_value, return_type);
9801 /* check for returning address of a local var */
9802 if (warning.other &&
9803 return_value != NULL &&
9804 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9805 const expression_t *expression = return_value->unary.value;
9806 if (is_local_variable(expression)) {
9807 warningf(&statement->base.source_position,
9808 "function returns address of local variable");
9811 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9812 warningf(&statement->base.source_position,
9813 "'return' without value, in function returning non-void");
9815 statement->returns.value = return_value;
9824 * Parse a declaration statement.
9826 static statement_t *parse_declaration_statement(void)
9828 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9830 declaration_t *before = last_declaration;
9832 parse_external_declaration();
9834 parse_declaration(record_declaration);
9836 if (before == NULL) {
9837 statement->declaration.declarations_begin = scope->declarations;
9839 statement->declaration.declarations_begin = before->next;
9841 statement->declaration.declarations_end = last_declaration;
9847 * Parse an expression statement, ie. expr ';'.
9849 static statement_t *parse_expression_statement(void)
9851 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9853 expression_t *const expr = parse_expression();
9854 statement->expression.expression = expr;
9855 mark_decls_read(expr, DECL_ANY);
9864 * Parse a microsoft __try { } __finally { } or
9865 * __try{ } __except() { }
9867 static statement_t *parse_ms_try_statment(void)
9869 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9872 PUSH_PARENT(statement);
9874 ms_try_statement_t *rem = current_try;
9875 current_try = &statement->ms_try;
9876 statement->ms_try.try_statement = parse_compound_statement(false);
9881 if (token.type == T___except) {
9884 add_anchor_token(')');
9885 expression_t *const expr = parse_expression();
9886 mark_decls_read(expr, NULL);
9887 type_t * type = skip_typeref(expr->base.type);
9888 if (is_type_integer(type)) {
9889 type = promote_integer(type);
9890 } else if (is_type_valid(type)) {
9891 errorf(&expr->base.source_position,
9892 "__expect expression is not an integer, but '%T'", type);
9893 type = type_error_type;
9895 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9896 rem_anchor_token(')');
9898 statement->ms_try.final_statement = parse_compound_statement(false);
9899 } else if (token.type == T__finally) {
9901 statement->ms_try.final_statement = parse_compound_statement(false);
9903 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9904 return create_invalid_statement();
9908 return create_invalid_statement();
9911 static statement_t *parse_empty_statement(void)
9913 if (warning.empty_statement) {
9914 warningf(HERE, "statement is empty");
9916 statement_t *const statement = create_empty_statement();
9921 static statement_t *parse_local_label_declaration(void) {
9922 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9926 declaration_t *begin = NULL, *end = NULL;
9929 if (token.type != T_IDENTIFIER) {
9930 parse_error_expected("while parsing local label declaration",
9931 T_IDENTIFIER, NULL);
9934 symbol_t *symbol = token.v.symbol;
9935 declaration_t *declaration = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
9936 if (declaration != NULL) {
9937 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition at %P)",
9938 symbol, &declaration->source_position);
9940 declaration = allocate_declaration_zero();
9941 declaration->namespc = NAMESPACE_LOCAL_LABEL;
9942 declaration->source_position = token.source_position;
9943 declaration->symbol = symbol;
9944 declaration->parent_scope = scope;
9945 declaration->init.statement = NULL;
9948 end->next = declaration;
9951 begin = declaration;
9953 local_label_push(declaration);
9957 if (token.type != ',')
9963 statement->declaration.declarations_begin = begin;
9964 statement->declaration.declarations_end = end;
9969 * Parse a statement.
9970 * There's also parse_statement() which additionally checks for
9971 * "statement has no effect" warnings
9973 static statement_t *intern_parse_statement(void)
9975 statement_t *statement = NULL;
9977 /* declaration or statement */
9978 add_anchor_token(';');
9979 switch (token.type) {
9980 case T_IDENTIFIER: {
9981 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
9982 if (la1_type == ':') {
9983 statement = parse_label_statement();
9984 } else if (is_typedef_symbol(token.v.symbol)) {
9985 statement = parse_declaration_statement();
9986 } else switch (la1_type) {
9988 if (get_declaration(token.v.symbol, NAMESPACE_NORMAL) != NULL)
9989 goto expression_statment;
9994 statement = parse_declaration_statement();
9998 expression_statment:
9999 statement = parse_expression_statement();
10005 case T___extension__:
10006 /* This can be a prefix to a declaration or an expression statement.
10007 * We simply eat it now and parse the rest with tail recursion. */
10010 } while (token.type == T___extension__);
10011 bool old_gcc_extension = in_gcc_extension;
10012 in_gcc_extension = true;
10013 statement = parse_statement();
10014 in_gcc_extension = old_gcc_extension;
10018 statement = parse_declaration_statement();
10022 statement = parse_local_label_declaration();
10025 case ';': statement = parse_empty_statement(); break;
10026 case '{': statement = parse_compound_statement(false); break;
10027 case T___leave: statement = parse_leave_statement(); break;
10028 case T___try: statement = parse_ms_try_statment(); break;
10029 case T_asm: statement = parse_asm_statement(); break;
10030 case T_break: statement = parse_break(); break;
10031 case T_case: statement = parse_case_statement(); break;
10032 case T_continue: statement = parse_continue(); break;
10033 case T_default: statement = parse_default_statement(); break;
10034 case T_do: statement = parse_do(); break;
10035 case T_for: statement = parse_for(); break;
10036 case T_goto: statement = parse_goto(); break;
10037 case T_if: statement = parse_if(); break;
10038 case T_return: statement = parse_return(); break;
10039 case T_switch: statement = parse_switch(); break;
10040 case T_while: statement = parse_while(); break;
10043 statement = parse_expression_statement();
10047 errorf(HERE, "unexpected token %K while parsing statement", &token);
10048 statement = create_invalid_statement();
10053 rem_anchor_token(';');
10055 assert(statement != NULL
10056 && statement->base.source_position.input_name != NULL);
10062 * parse a statement and emits "statement has no effect" warning if needed
10063 * (This is really a wrapper around intern_parse_statement with check for 1
10064 * single warning. It is needed, because for statement expressions we have
10065 * to avoid the warning on the last statement)
10067 static statement_t *parse_statement(void)
10069 statement_t *statement = intern_parse_statement();
10071 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10072 expression_t *expression = statement->expression.expression;
10073 if (!expression_has_effect(expression)) {
10074 warningf(&expression->base.source_position,
10075 "statement has no effect");
10083 * Parse a compound statement.
10085 static statement_t *parse_compound_statement(bool inside_expression_statement)
10087 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10089 PUSH_PARENT(statement);
10092 add_anchor_token('}');
10094 size_t const top = environment_top();
10095 size_t const top_local = local_label_top();
10096 scope_push(&statement->compound.scope);
10098 statement_t **anchor = &statement->compound.statements;
10099 bool only_decls_so_far = true;
10100 while (token.type != '}') {
10101 if (token.type == T_EOF) {
10102 errorf(&statement->base.source_position,
10103 "EOF while parsing compound statement");
10106 statement_t *sub_statement = intern_parse_statement();
10107 if (is_invalid_statement(sub_statement)) {
10108 /* an error occurred. if we are at an anchor, return */
10114 if (warning.declaration_after_statement) {
10115 if (sub_statement->kind != STATEMENT_DECLARATION) {
10116 only_decls_so_far = false;
10117 } else if (!only_decls_so_far) {
10118 warningf(&sub_statement->base.source_position,
10119 "ISO C90 forbids mixed declarations and code");
10123 *anchor = sub_statement;
10125 while (sub_statement->base.next != NULL)
10126 sub_statement = sub_statement->base.next;
10128 anchor = &sub_statement->base.next;
10132 /* look over all statements again to produce no effect warnings */
10133 if (warning.unused_value) {
10134 statement_t *sub_statement = statement->compound.statements;
10135 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10136 if (sub_statement->kind != STATEMENT_EXPRESSION)
10138 /* don't emit a warning for the last expression in an expression
10139 * statement as it has always an effect */
10140 if (inside_expression_statement && sub_statement->base.next == NULL)
10143 expression_t *expression = sub_statement->expression.expression;
10144 if (!expression_has_effect(expression)) {
10145 warningf(&expression->base.source_position,
10146 "statement has no effect");
10152 rem_anchor_token('}');
10153 assert(scope == &statement->compound.scope);
10155 environment_pop_to(top);
10156 local_label_pop_to(top_local);
10163 * Initialize builtin types.
10165 static void initialize_builtin_types(void)
10167 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
10168 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
10169 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
10170 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
10171 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
10172 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
10173 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
10174 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
10176 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
10177 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
10178 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
10179 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
10181 /* const version of wchar_t */
10182 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF);
10183 type_const_wchar_t->typedeft.declaration = type_wchar_t->typedeft.declaration;
10184 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
10186 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
10190 * Check for unused global static functions and variables
10192 static void check_unused_globals(void)
10194 if (!warning.unused_function && !warning.unused_variable)
10197 for (const declaration_t *decl = file_scope->declarations; decl != NULL; decl = decl->next) {
10199 decl->modifiers & DM_UNUSED ||
10200 decl->modifiers & DM_USED ||
10201 decl->storage_class != STORAGE_CLASS_STATIC)
10204 type_t *const type = decl->type;
10206 if (is_type_function(skip_typeref(type))) {
10207 if (!warning.unused_function || decl->is_inline)
10210 s = (decl->init.statement != NULL ? "defined" : "declared");
10212 if (!warning.unused_variable)
10218 warningf(&decl->source_position, "'%#T' %s but not used",
10219 type, decl->symbol, s);
10223 static void parse_global_asm(void)
10225 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10230 statement->asms.asm_text = parse_string_literals();
10231 statement->base.next = unit->global_asm;
10232 unit->global_asm = statement;
10241 * Parse a translation unit.
10243 static void parse_translation_unit(void)
10245 add_anchor_token(T_EOF);
10248 unsigned char token_anchor_copy[T_LAST_TOKEN];
10249 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10253 bool anchor_leak = false;
10254 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10255 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10257 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10258 anchor_leak = true;
10261 if (in_gcc_extension) {
10262 errorf(HERE, "Leaked __extension__");
10263 anchor_leak = true;
10270 switch (token.type) {
10273 case T___extension__:
10274 parse_external_declaration();
10278 parse_global_asm();
10282 rem_anchor_token(T_EOF);
10286 if (!strict_mode) {
10288 warningf(HERE, "stray ';' outside of function");
10295 errorf(HERE, "stray %K outside of function", &token);
10296 if (token.type == '(' || token.type == '{' || token.type == '[')
10297 eat_until_matching_token(token.type);
10307 * @return the translation unit or NULL if errors occurred.
10309 void start_parsing(void)
10311 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10312 label_stack = NEW_ARR_F(stack_entry_t, 0);
10313 local_label_stack = NEW_ARR_F(stack_entry_t, 0);
10314 diagnostic_count = 0;
10318 type_set_output(stderr);
10319 ast_set_output(stderr);
10321 assert(unit == NULL);
10322 unit = allocate_ast_zero(sizeof(unit[0]));
10324 assert(file_scope == NULL);
10325 file_scope = &unit->scope;
10327 assert(scope == NULL);
10328 scope_push(&unit->scope);
10330 initialize_builtin_types();
10333 translation_unit_t *finish_parsing(void)
10335 /* do NOT use scope_pop() here, this will crash, will it by hand */
10336 assert(scope == &unit->scope);
10338 last_declaration = NULL;
10340 assert(file_scope == &unit->scope);
10341 check_unused_globals();
10344 DEL_ARR_F(environment_stack);
10345 DEL_ARR_F(label_stack);
10346 DEL_ARR_F(local_label_stack);
10348 translation_unit_t *result = unit;
10355 lookahead_bufpos = 0;
10356 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10359 parse_translation_unit();
10363 * Initialize the parser.
10365 void init_parser(void)
10367 sym_anonymous = symbol_table_insert("<anonymous>");
10369 if (c_mode & _MS) {
10370 /* add predefined symbols for extended-decl-modifier */
10371 sym_align = symbol_table_insert("align");
10372 sym_allocate = symbol_table_insert("allocate");
10373 sym_dllimport = symbol_table_insert("dllimport");
10374 sym_dllexport = symbol_table_insert("dllexport");
10375 sym_naked = symbol_table_insert("naked");
10376 sym_noinline = symbol_table_insert("noinline");
10377 sym_noreturn = symbol_table_insert("noreturn");
10378 sym_nothrow = symbol_table_insert("nothrow");
10379 sym_novtable = symbol_table_insert("novtable");
10380 sym_property = symbol_table_insert("property");
10381 sym_get = symbol_table_insert("get");
10382 sym_put = symbol_table_insert("put");
10383 sym_selectany = symbol_table_insert("selectany");
10384 sym_thread = symbol_table_insert("thread");
10385 sym_uuid = symbol_table_insert("uuid");
10386 sym_deprecated = symbol_table_insert("deprecated");
10387 sym_restrict = symbol_table_insert("restrict");
10388 sym_noalias = symbol_table_insert("noalias");
10390 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10392 init_expression_parsers();
10393 obstack_init(&temp_obst);
10395 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10396 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10400 * Terminate the parser.
10402 void exit_parser(void)
10404 obstack_free(&temp_obst, NULL);