2 * This file is part of cparser.
3 * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
36 #include "lang_features.h"
38 #include "adt/bitfiddle.h"
39 #include "adt/error.h"
40 #include "adt/array.h"
42 /** if wchar_t is equal to unsigned short. */
43 bool opt_short_wchar_t =
50 //#define PRINT_TOKENS
51 #define MAX_LOOKAHEAD 2
54 declaration_t *old_declaration;
56 unsigned short namespc;
59 typedef struct argument_list_t argument_list_t;
60 struct argument_list_t {
62 argument_list_t *next;
65 typedef struct gnu_attribute_t gnu_attribute_t;
66 struct gnu_attribute_t {
67 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
68 gnu_attribute_t *next;
69 bool invalid; /**< Set if this attribute had argument errors, */
70 bool have_arguments; /**< True, if this attribute has arguments. */
74 atomic_type_kind_t akind;
75 long argument; /**< Single argument. */
76 argument_list_t *arguments; /**< List of argument expressions. */
80 typedef struct declaration_specifiers_t declaration_specifiers_t;
81 struct declaration_specifiers_t {
82 source_position_t source_position;
83 unsigned char declared_storage_class;
84 unsigned char alignment; /**< Alignment, 0 if not set. */
85 unsigned int is_inline : 1;
86 unsigned int deprecated : 1;
87 decl_modifiers_t modifiers; /**< declaration modifiers */
88 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
89 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
90 symbol_t *get_property_sym; /**< the name of the get property if set. */
91 symbol_t *put_property_sym; /**< the name of the put property if set. */
96 * An environment for parsing initializers (and compound literals).
98 typedef struct parse_initializer_env_t {
99 type_t *type; /**< the type of the initializer. In case of an
100 array type with unspecified size this gets
101 adjusted to the actual size. */
102 declaration_t *declaration; /**< the declaration that is initialized if any */
103 bool must_be_constant;
104 } parse_initializer_env_t;
106 typedef declaration_t* (*parsed_declaration_func) (declaration_t *declaration, bool is_definition);
108 static token_t token;
109 static token_t lookahead_buffer[MAX_LOOKAHEAD];
110 static int lookahead_bufpos;
111 static stack_entry_t *environment_stack = NULL;
112 static stack_entry_t *label_stack = NULL;
113 static scope_t *global_scope = NULL;
114 static scope_t *scope = NULL;
115 static declaration_t *last_declaration = NULL;
116 static declaration_t *current_function = NULL;
117 static declaration_t *current_init_decl = NULL;
118 static switch_statement_t *current_switch = NULL;
119 static statement_t *current_loop = NULL;
120 static statement_t *current_parent = NULL;
121 static ms_try_statement_t *current_try = NULL;
122 static goto_statement_t *goto_first = NULL;
123 static goto_statement_t *goto_last = NULL;
124 static label_statement_t *label_first = NULL;
125 static label_statement_t *label_last = NULL;
126 static translation_unit_t *unit = NULL;
127 static struct obstack temp_obst;
129 #define PUSH_PARENT(stmt) \
130 statement_t *const prev_parent = current_parent; \
131 current_parent = (stmt);
132 #define POP_PARENT ((void)(current_parent = prev_parent))
134 static source_position_t null_position = { NULL, 0 };
136 /* symbols for Microsoft extended-decl-modifier */
137 static const symbol_t *sym_align = NULL;
138 static const symbol_t *sym_allocate = NULL;
139 static const symbol_t *sym_dllimport = NULL;
140 static const symbol_t *sym_dllexport = NULL;
141 static const symbol_t *sym_naked = NULL;
142 static const symbol_t *sym_noinline = NULL;
143 static const symbol_t *sym_noreturn = NULL;
144 static const symbol_t *sym_nothrow = NULL;
145 static const symbol_t *sym_novtable = NULL;
146 static const symbol_t *sym_property = NULL;
147 static const symbol_t *sym_get = NULL;
148 static const symbol_t *sym_put = NULL;
149 static const symbol_t *sym_selectany = NULL;
150 static const symbol_t *sym_thread = NULL;
151 static const symbol_t *sym_uuid = NULL;
152 static const symbol_t *sym_deprecated = NULL;
153 static const symbol_t *sym_restrict = NULL;
154 static const symbol_t *sym_noalias = NULL;
156 /** The token anchor set */
157 static unsigned char token_anchor_set[T_LAST_TOKEN];
159 /** The current source position. */
160 #define HERE (&token.source_position)
162 static type_t *type_valist;
164 static statement_t *parse_compound_statement(bool inside_expression_statement);
165 static statement_t *parse_statement(void);
167 static expression_t *parse_sub_expression(unsigned precedence);
168 static expression_t *parse_expression(void);
169 static type_t *parse_typename(void);
171 static void parse_compound_type_entries(declaration_t *compound_declaration);
172 static declaration_t *parse_declarator(
173 const declaration_specifiers_t *specifiers, bool may_be_abstract);
174 static declaration_t *record_declaration(declaration_t *declaration, bool is_definition);
176 static void semantic_comparison(binary_expression_t *expression);
178 #define STORAGE_CLASSES \
186 #define TYPE_QUALIFIERS \
191 case T__forceinline: \
192 case T___attribute__:
194 #ifdef PROVIDE_COMPLEX
195 #define COMPLEX_SPECIFIERS \
197 #define IMAGINARY_SPECIFIERS \
200 #define COMPLEX_SPECIFIERS
201 #define IMAGINARY_SPECIFIERS
204 #define TYPE_SPECIFIERS \
219 case T___builtin_va_list: \
224 #define DECLARATION_START \
229 #define TYPENAME_START \
234 * Allocate an AST node with given size and
235 * initialize all fields with zero.
237 static void *allocate_ast_zero(size_t size)
239 void *res = allocate_ast(size);
240 memset(res, 0, size);
244 static declaration_t *allocate_declaration_zero(void)
246 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
247 declaration->type = type_error_type;
248 declaration->alignment = 0;
253 * Returns the size of a statement node.
255 * @param kind the statement kind
257 static size_t get_statement_struct_size(statement_kind_t kind)
259 static const size_t sizes[] = {
260 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
261 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
262 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
263 [STATEMENT_RETURN] = sizeof(return_statement_t),
264 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
265 [STATEMENT_IF] = sizeof(if_statement_t),
266 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
267 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
268 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
269 [STATEMENT_BREAK] = sizeof(statement_base_t),
270 [STATEMENT_GOTO] = sizeof(goto_statement_t),
271 [STATEMENT_LABEL] = sizeof(label_statement_t),
272 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
273 [STATEMENT_WHILE] = sizeof(while_statement_t),
274 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
275 [STATEMENT_FOR] = sizeof(for_statement_t),
276 [STATEMENT_ASM] = sizeof(asm_statement_t),
277 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
278 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
280 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
281 assert(sizes[kind] != 0);
286 * Returns the size of an expression node.
288 * @param kind the expression kind
290 static size_t get_expression_struct_size(expression_kind_t kind)
292 static const size_t sizes[] = {
293 [EXPR_INVALID] = sizeof(expression_base_t),
294 [EXPR_REFERENCE] = sizeof(reference_expression_t),
295 [EXPR_CONST] = sizeof(const_expression_t),
296 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
297 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
298 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
299 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
300 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
301 [EXPR_CALL] = sizeof(call_expression_t),
302 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
303 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
304 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
305 [EXPR_SELECT] = sizeof(select_expression_t),
306 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
307 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
308 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
309 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
310 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
311 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
312 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
313 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
314 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
315 [EXPR_VA_START] = sizeof(va_start_expression_t),
316 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
317 [EXPR_STATEMENT] = sizeof(statement_expression_t),
319 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
320 return sizes[EXPR_UNARY_FIRST];
322 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
323 return sizes[EXPR_BINARY_FIRST];
325 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
326 assert(sizes[kind] != 0);
331 * Allocate a statement node of given kind and initialize all
334 static statement_t *allocate_statement_zero(statement_kind_t kind)
336 size_t size = get_statement_struct_size(kind);
337 statement_t *res = allocate_ast_zero(size);
339 res->base.kind = kind;
340 res->base.parent = current_parent;
345 * Allocate an expression node of given kind and initialize all
348 static expression_t *allocate_expression_zero(expression_kind_t kind)
350 size_t size = get_expression_struct_size(kind);
351 expression_t *res = allocate_ast_zero(size);
353 res->base.kind = kind;
354 res->base.type = type_error_type;
359 * Creates a new invalid expression.
361 static expression_t *create_invalid_expression(void)
363 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
364 expression->base.source_position = token.source_position;
369 * Creates a new invalid statement.
371 static statement_t *create_invalid_statement(void)
373 statement_t *statement = allocate_statement_zero(STATEMENT_INVALID);
374 statement->base.source_position = token.source_position;
379 * Allocate a new empty statement.
381 static statement_t *create_empty_statement(void)
383 statement_t *statement = allocate_statement_zero(STATEMENT_EMPTY);
384 statement->base.source_position = token.source_position;
389 * Returns the size of a type node.
391 * @param kind the type kind
393 static size_t get_type_struct_size(type_kind_t kind)
395 static const size_t sizes[] = {
396 [TYPE_ATOMIC] = sizeof(atomic_type_t),
397 [TYPE_COMPLEX] = sizeof(complex_type_t),
398 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
399 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
400 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
401 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
402 [TYPE_ENUM] = sizeof(enum_type_t),
403 [TYPE_FUNCTION] = sizeof(function_type_t),
404 [TYPE_POINTER] = sizeof(pointer_type_t),
405 [TYPE_ARRAY] = sizeof(array_type_t),
406 [TYPE_BUILTIN] = sizeof(builtin_type_t),
407 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
408 [TYPE_TYPEOF] = sizeof(typeof_type_t),
410 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
411 assert(kind <= TYPE_TYPEOF);
412 assert(sizes[kind] != 0);
417 * Allocate a type node of given kind and initialize all
420 * @param kind type kind to allocate
421 * @param source_position the source position of the type definition
423 static type_t *allocate_type_zero(type_kind_t kind, const source_position_t *source_position)
425 size_t size = get_type_struct_size(kind);
426 type_t *res = obstack_alloc(type_obst, size);
427 memset(res, 0, size);
429 res->base.kind = kind;
430 res->base.source_position = *source_position;
435 * Returns the size of an initializer node.
437 * @param kind the initializer kind
439 static size_t get_initializer_size(initializer_kind_t kind)
441 static const size_t sizes[] = {
442 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
443 [INITIALIZER_STRING] = sizeof(initializer_string_t),
444 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
445 [INITIALIZER_LIST] = sizeof(initializer_list_t),
446 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
448 assert(kind < sizeof(sizes) / sizeof(*sizes));
449 assert(sizes[kind] != 0);
454 * Allocate an initializer node of given kind and initialize all
457 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
459 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
466 * Free a type from the type obstack.
468 static void free_type(void *type)
470 obstack_free(type_obst, type);
474 * Returns the index of the top element of the environment stack.
476 static size_t environment_top(void)
478 return ARR_LEN(environment_stack);
482 * Returns the index of the top element of the label stack.
484 static size_t label_top(void)
486 return ARR_LEN(label_stack);
490 * Return the next token.
492 static inline void next_token(void)
494 token = lookahead_buffer[lookahead_bufpos];
495 lookahead_buffer[lookahead_bufpos] = lexer_token;
498 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
501 print_token(stderr, &token);
502 fprintf(stderr, "\n");
507 * Return the next token with a given lookahead.
509 static inline const token_t *look_ahead(int num)
511 assert(num > 0 && num <= MAX_LOOKAHEAD);
512 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
513 return &lookahead_buffer[pos];
517 * Adds a token to the token anchor set (a multi-set).
519 static void add_anchor_token(int token_type)
521 assert(0 <= token_type && token_type < T_LAST_TOKEN);
522 ++token_anchor_set[token_type];
525 static int save_and_reset_anchor_state(int token_type)
527 assert(0 <= token_type && token_type < T_LAST_TOKEN);
528 int count = token_anchor_set[token_type];
529 token_anchor_set[token_type] = 0;
533 static void restore_anchor_state(int token_type, int count)
535 assert(0 <= token_type && token_type < T_LAST_TOKEN);
536 token_anchor_set[token_type] = count;
540 * Remove a token from the token anchor set (a multi-set).
542 static void rem_anchor_token(int token_type)
544 assert(0 <= token_type && token_type < T_LAST_TOKEN);
545 --token_anchor_set[token_type];
548 static bool at_anchor(void)
552 return token_anchor_set[token.type];
556 * Eat tokens until a matching token is found.
558 static void eat_until_matching_token(int type)
562 case '(': end_token = ')'; break;
563 case '{': end_token = '}'; break;
564 case '[': end_token = ']'; break;
565 default: end_token = type; break;
568 unsigned parenthesis_count = 0;
569 unsigned brace_count = 0;
570 unsigned bracket_count = 0;
571 while (token.type != end_token ||
572 parenthesis_count != 0 ||
574 bracket_count != 0) {
575 switch (token.type) {
577 case '(': ++parenthesis_count; break;
578 case '{': ++brace_count; break;
579 case '[': ++bracket_count; break;
582 if (parenthesis_count > 0)
592 if (bracket_count > 0)
595 if (token.type == end_token &&
596 parenthesis_count == 0 &&
610 * Eat input tokens until an anchor is found.
612 static void eat_until_anchor(void)
614 if (token.type == T_EOF)
616 while (token_anchor_set[token.type] == 0) {
617 if (token.type == '(' || token.type == '{' || token.type == '[')
618 eat_until_matching_token(token.type);
619 if (token.type == T_EOF)
625 static void eat_block(void)
627 eat_until_matching_token('{');
628 if (token.type == '}')
633 * eat all token until a ';' is reached or a stop token is found.
635 static void eat_statement(void)
637 eat_until_matching_token(';');
638 if (token.type == ';')
642 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while (0)
645 * Report a parse error because an expected token was not found.
648 #if defined __GNUC__ && __GNUC__ >= 4
649 __attribute__((sentinel))
651 void parse_error_expected(const char *message, ...)
653 if (message != NULL) {
654 errorf(HERE, "%s", message);
657 va_start(ap, message);
658 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
663 * Report a type error.
665 static void type_error(const char *msg, const source_position_t *source_position,
668 errorf(source_position, "%s, but found type '%T'", msg, type);
672 * Report an incompatible type.
674 static void type_error_incompatible(const char *msg,
675 const source_position_t *source_position, type_t *type1, type_t *type2)
677 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
682 * Expect the the current token is the expected token.
683 * If not, generate an error, eat the current statement,
684 * and goto the end_error label.
686 #define expect(expected) \
688 if (UNLIKELY(token.type != (expected))) { \
689 parse_error_expected(NULL, (expected), NULL); \
690 add_anchor_token(expected); \
691 eat_until_anchor(); \
692 if (token.type == expected) \
694 rem_anchor_token(expected); \
700 static void set_scope(scope_t *new_scope)
703 scope->last_declaration = last_declaration;
707 last_declaration = new_scope->last_declaration;
711 * Search a symbol in a given namespace and returns its declaration or
712 * NULL if this symbol was not found.
714 static declaration_t *get_declaration(const symbol_t *const symbol,
715 const namespace_t namespc)
717 declaration_t *declaration = symbol->declaration;
718 for( ; declaration != NULL; declaration = declaration->symbol_next) {
719 if (declaration->namespc == namespc)
727 * pushs an environment_entry on the environment stack and links the
728 * corresponding symbol to the new entry
730 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
732 symbol_t *symbol = declaration->symbol;
733 namespace_t namespc = (namespace_t) declaration->namespc;
735 /* replace/add declaration into declaration list of the symbol */
736 declaration_t *iter = symbol->declaration;
738 symbol->declaration = declaration;
740 declaration_t *iter_last = NULL;
741 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
742 /* replace an entry? */
743 if (iter->namespc == namespc) {
744 if (iter_last == NULL) {
745 symbol->declaration = declaration;
747 iter_last->symbol_next = declaration;
749 declaration->symbol_next = iter->symbol_next;
754 assert(iter_last->symbol_next == NULL);
755 iter_last->symbol_next = declaration;
759 /* remember old declaration */
761 entry.symbol = symbol;
762 entry.old_declaration = iter;
763 entry.namespc = (unsigned short) namespc;
764 ARR_APP1(stack_entry_t, *stack_ptr, entry);
767 static void environment_push(declaration_t *declaration)
769 assert(declaration->source_position.input_name != NULL);
770 assert(declaration->parent_scope != NULL);
771 stack_push(&environment_stack, declaration);
775 * Push a declaration of the label stack.
777 * @param declaration the declaration
779 static void label_push(declaration_t *declaration)
781 declaration->parent_scope = ¤t_function->scope;
782 stack_push(&label_stack, declaration);
786 * pops symbols from the environment stack until @p new_top is the top element
788 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
790 stack_entry_t *stack = *stack_ptr;
791 size_t top = ARR_LEN(stack);
794 assert(new_top <= top);
798 for(i = top; i > new_top; --i) {
799 stack_entry_t *entry = &stack[i - 1];
801 declaration_t *old_declaration = entry->old_declaration;
802 symbol_t *symbol = entry->symbol;
803 namespace_t namespc = (namespace_t)entry->namespc;
805 /* replace/remove declaration */
806 declaration_t *declaration = symbol->declaration;
807 assert(declaration != NULL);
808 if (declaration->namespc == namespc) {
809 if (old_declaration == NULL) {
810 symbol->declaration = declaration->symbol_next;
812 symbol->declaration = old_declaration;
815 declaration_t *iter_last = declaration;
816 declaration_t *iter = declaration->symbol_next;
817 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
818 /* replace an entry? */
819 if (iter->namespc == namespc) {
820 assert(iter_last != NULL);
821 iter_last->symbol_next = old_declaration;
822 if (old_declaration != NULL) {
823 old_declaration->symbol_next = iter->symbol_next;
828 assert(iter != NULL);
832 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
835 static void environment_pop_to(size_t new_top)
837 stack_pop_to(&environment_stack, new_top);
841 * Pop all entries on the label stack until the new_top
844 * @param new_top the new stack top
846 static void label_pop_to(size_t new_top)
848 stack_pop_to(&label_stack, new_top);
851 static int get_akind_rank(atomic_type_kind_t akind)
856 static int get_rank(const type_t *type)
858 assert(!is_typeref(type));
859 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
860 * and esp. footnote 108). However we can't fold constants (yet), so we
861 * can't decide whether unsigned int is possible, while int always works.
862 * (unsigned int would be preferable when possible... for stuff like
863 * struct { enum { ... } bla : 4; } ) */
864 if (type->kind == TYPE_ENUM)
865 return get_akind_rank(ATOMIC_TYPE_INT);
867 assert(type->kind == TYPE_ATOMIC);
868 return get_akind_rank(type->atomic.akind);
871 static type_t *promote_integer(type_t *type)
873 if (type->kind == TYPE_BITFIELD)
874 type = type->bitfield.base_type;
876 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
883 * Create a cast expression.
885 * @param expression the expression to cast
886 * @param dest_type the destination type
888 static expression_t *create_cast_expression(expression_t *expression,
891 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
893 cast->unary.value = expression;
894 cast->base.type = dest_type;
900 * Check if a given expression represents the 0 pointer constant.
902 static bool is_null_pointer_constant(const expression_t *expression)
904 /* skip void* cast */
905 if (expression->kind == EXPR_UNARY_CAST
906 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
907 expression = expression->unary.value;
910 /* TODO: not correct yet, should be any constant integer expression
911 * which evaluates to 0 */
912 if (expression->kind != EXPR_CONST)
915 type_t *const type = skip_typeref(expression->base.type);
916 if (!is_type_integer(type))
919 return expression->conste.v.int_value == 0;
923 * Create an implicit cast expression.
925 * @param expression the expression to cast
926 * @param dest_type the destination type
928 static expression_t *create_implicit_cast(expression_t *expression,
931 type_t *const source_type = expression->base.type;
933 if (source_type == dest_type)
936 return create_cast_expression(expression, dest_type);
939 typedef enum assign_error_t {
941 ASSIGN_ERROR_INCOMPATIBLE,
942 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
943 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
944 ASSIGN_WARNING_POINTER_FROM_INT,
945 ASSIGN_WARNING_INT_FROM_POINTER
948 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
949 const expression_t *const right,
951 const source_position_t *source_position)
953 type_t *const orig_type_right = right->base.type;
954 type_t *const type_left = skip_typeref(orig_type_left);
955 type_t *const type_right = skip_typeref(orig_type_right);
960 case ASSIGN_ERROR_INCOMPATIBLE:
961 errorf(source_position,
962 "destination type '%T' in %s is incompatible with type '%T'",
963 orig_type_left, context, orig_type_right);
966 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
967 type_t *points_to_left
968 = skip_typeref(type_left->pointer.points_to);
969 type_t *points_to_right
970 = skip_typeref(type_right->pointer.points_to);
972 /* the left type has all qualifiers from the right type */
973 unsigned missing_qualifiers
974 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
975 warningf(source_position,
976 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
977 orig_type_left, context, orig_type_right, missing_qualifiers);
981 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
982 warningf(source_position,
983 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
984 orig_type_left, context, right, orig_type_right);
987 case ASSIGN_WARNING_POINTER_FROM_INT:
988 warningf(source_position,
989 "%s makes integer '%T' from pointer '%T' without a cast",
990 context, orig_type_left, orig_type_right);
993 case ASSIGN_WARNING_INT_FROM_POINTER:
994 warningf(source_position,
995 "%s makes integer '%T' from pointer '%T' without a cast",
996 context, orig_type_left, orig_type_right);
1000 panic("invalid error value");
1004 /** Implements the rules from § 6.5.16.1 */
1005 static assign_error_t semantic_assign(type_t *orig_type_left,
1006 const expression_t *const right)
1008 type_t *const orig_type_right = right->base.type;
1009 type_t *const type_left = skip_typeref(orig_type_left);
1010 type_t *const type_right = skip_typeref(orig_type_right);
1012 if (is_type_pointer(type_left)) {
1013 if (is_null_pointer_constant(right)) {
1014 return ASSIGN_SUCCESS;
1015 } else if (is_type_pointer(type_right)) {
1016 type_t *points_to_left
1017 = skip_typeref(type_left->pointer.points_to);
1018 type_t *points_to_right
1019 = skip_typeref(type_right->pointer.points_to);
1020 assign_error_t res = ASSIGN_SUCCESS;
1022 /* the left type has all qualifiers from the right type */
1023 unsigned missing_qualifiers
1024 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1025 if (missing_qualifiers != 0) {
1026 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1029 points_to_left = get_unqualified_type(points_to_left);
1030 points_to_right = get_unqualified_type(points_to_right);
1032 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
1033 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1037 if (!types_compatible(points_to_left, points_to_right)) {
1038 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1042 } else if (is_type_integer(type_right)) {
1043 return ASSIGN_WARNING_POINTER_FROM_INT;
1045 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1046 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1047 && is_type_pointer(type_right))) {
1048 return ASSIGN_SUCCESS;
1049 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1050 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1051 type_t *const unqual_type_left = get_unqualified_type(type_left);
1052 type_t *const unqual_type_right = get_unqualified_type(type_right);
1053 if (types_compatible(unqual_type_left, unqual_type_right)) {
1054 return ASSIGN_SUCCESS;
1056 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1057 return ASSIGN_WARNING_INT_FROM_POINTER;
1060 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1061 return ASSIGN_SUCCESS;
1063 return ASSIGN_ERROR_INCOMPATIBLE;
1066 static expression_t *parse_constant_expression(void)
1068 /* start parsing at precedence 7 (conditional expression) */
1069 expression_t *result = parse_sub_expression(7);
1071 if (!is_constant_expression(result)) {
1072 errorf(&result->base.source_position,
1073 "expression '%E' is not constant\n", result);
1079 static expression_t *parse_assignment_expression(void)
1081 /* start parsing at precedence 2 (assignment expression) */
1082 return parse_sub_expression(2);
1085 static type_t *make_global_typedef(const char *name, type_t *type)
1087 symbol_t *const symbol = symbol_table_insert(name);
1089 declaration_t *const declaration = allocate_declaration_zero();
1090 declaration->namespc = NAMESPACE_NORMAL;
1091 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
1092 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
1093 declaration->type = type;
1094 declaration->symbol = symbol;
1095 declaration->source_position = builtin_source_position;
1096 declaration->implicit = true;
1098 record_declaration(declaration, false);
1100 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
1101 typedef_type->typedeft.declaration = declaration;
1103 return typedef_type;
1106 static string_t parse_string_literals(void)
1108 assert(token.type == T_STRING_LITERAL);
1109 string_t result = token.v.string;
1113 while (token.type == T_STRING_LITERAL) {
1114 result = concat_strings(&result, &token.v.string);
1121 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1122 [GNU_AK_CONST] = "const",
1123 [GNU_AK_VOLATILE] = "volatile",
1124 [GNU_AK_CDECL] = "cdecl",
1125 [GNU_AK_STDCALL] = "stdcall",
1126 [GNU_AK_FASTCALL] = "fastcall",
1127 [GNU_AK_DEPRECATED] = "deprecated",
1128 [GNU_AK_NOINLINE] = "noinline",
1129 [GNU_AK_NORETURN] = "noreturn",
1130 [GNU_AK_NAKED] = "naked",
1131 [GNU_AK_PURE] = "pure",
1132 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1133 [GNU_AK_MALLOC] = "malloc",
1134 [GNU_AK_WEAK] = "weak",
1135 [GNU_AK_CONSTRUCTOR] = "constructor",
1136 [GNU_AK_DESTRUCTOR] = "destructor",
1137 [GNU_AK_NOTHROW] = "nothrow",
1138 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1139 [GNU_AK_COMMON] = "common",
1140 [GNU_AK_NOCOMMON] = "nocommon",
1141 [GNU_AK_PACKED] = "packed",
1142 [GNU_AK_SHARED] = "shared",
1143 [GNU_AK_NOTSHARED] = "notshared",
1144 [GNU_AK_USED] = "used",
1145 [GNU_AK_UNUSED] = "unused",
1146 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1147 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1148 [GNU_AK_LONGCALL] = "longcall",
1149 [GNU_AK_SHORTCALL] = "shortcall",
1150 [GNU_AK_LONG_CALL] = "long_call",
1151 [GNU_AK_SHORT_CALL] = "short_call",
1152 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1153 [GNU_AK_INTERRUPT] = "interrupt",
1154 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1155 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1156 [GNU_AK_NESTING] = "nesting",
1157 [GNU_AK_NEAR] = "near",
1158 [GNU_AK_FAR] = "far",
1159 [GNU_AK_SIGNAL] = "signal",
1160 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1161 [GNU_AK_TINY_DATA] = "tiny_data",
1162 [GNU_AK_SAVEALL] = "saveall",
1163 [GNU_AK_FLATTEN] = "flatten",
1164 [GNU_AK_SSEREGPARM] = "sseregparm",
1165 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1166 [GNU_AK_RETURN_TWICE] = "return_twice",
1167 [GNU_AK_MAY_ALIAS] = "may_alias",
1168 [GNU_AK_MS_STRUCT] = "ms_struct",
1169 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1170 [GNU_AK_DLLIMPORT] = "dllimport",
1171 [GNU_AK_DLLEXPORT] = "dllexport",
1172 [GNU_AK_ALIGNED] = "aligned",
1173 [GNU_AK_ALIAS] = "alias",
1174 [GNU_AK_SECTION] = "section",
1175 [GNU_AK_FORMAT] = "format",
1176 [GNU_AK_FORMAT_ARG] = "format_arg",
1177 [GNU_AK_WEAKREF] = "weakref",
1178 [GNU_AK_NONNULL] = "nonnull",
1179 [GNU_AK_TLS_MODEL] = "tls_model",
1180 [GNU_AK_VISIBILITY] = "visibility",
1181 [GNU_AK_REGPARM] = "regparm",
1182 [GNU_AK_MODE] = "mode",
1183 [GNU_AK_MODEL] = "model",
1184 [GNU_AK_TRAP_EXIT] = "trap_exit",
1185 [GNU_AK_SP_SWITCH] = "sp_switch",
1186 [GNU_AK_SENTINEL] = "sentinel"
1190 * compare two string, ignoring double underscores on the second.
1192 static int strcmp_underscore(const char *s1, const char *s2)
1194 if (s2[0] == '_' && s2[1] == '_') {
1195 size_t len2 = strlen(s2);
1196 size_t len1 = strlen(s1);
1197 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1198 return strncmp(s1, s2+2, len2-4);
1202 return strcmp(s1, s2);
1206 * Allocate a new gnu temporal attribute.
1208 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1210 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1211 attribute->kind = kind;
1212 attribute->next = NULL;
1213 attribute->invalid = false;
1214 attribute->have_arguments = false;
1220 * parse one constant expression argument.
1222 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1224 expression_t *expression;
1225 add_anchor_token(')');
1226 expression = parse_constant_expression();
1227 rem_anchor_token(')');
1229 attribute->u.argument = fold_constant(expression);
1232 attribute->invalid = true;
1236 * parse a list of constant expressions arguments.
1238 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1240 argument_list_t **list = &attribute->u.arguments;
1241 argument_list_t *entry;
1242 expression_t *expression;
1243 add_anchor_token(')');
1244 add_anchor_token(',');
1246 expression = parse_constant_expression();
1247 entry = obstack_alloc(&temp_obst, sizeof(entry));
1248 entry->argument = fold_constant(expression);
1251 list = &entry->next;
1252 if (token.type != ',')
1256 rem_anchor_token(',');
1257 rem_anchor_token(')');
1261 attribute->invalid = true;
1265 * parse one string literal argument.
1267 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1270 add_anchor_token('(');
1271 if (token.type != T_STRING_LITERAL) {
1272 parse_error_expected("while parsing attribute directive",
1273 T_STRING_LITERAL, NULL);
1276 *string = parse_string_literals();
1277 rem_anchor_token('(');
1281 attribute->invalid = true;
1285 * parse one tls model.
1287 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1289 static const char *const tls_models[] = {
1295 string_t string = { NULL, 0 };
1296 parse_gnu_attribute_string_arg(attribute, &string);
1297 if (string.begin != NULL) {
1298 for(size_t i = 0; i < 4; ++i) {
1299 if (strcmp(tls_models[i], string.begin) == 0) {
1300 attribute->u.value = i;
1304 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1306 attribute->invalid = true;
1310 * parse one tls model.
1312 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1314 static const char *const visibilities[] = {
1320 string_t string = { NULL, 0 };
1321 parse_gnu_attribute_string_arg(attribute, &string);
1322 if (string.begin != NULL) {
1323 for(size_t i = 0; i < 4; ++i) {
1324 if (strcmp(visibilities[i], string.begin) == 0) {
1325 attribute->u.value = i;
1329 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1331 attribute->invalid = true;
1335 * parse one (code) model.
1337 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1339 static const char *const visibilities[] = {
1344 string_t string = { NULL, 0 };
1345 parse_gnu_attribute_string_arg(attribute, &string);
1346 if (string.begin != NULL) {
1347 for(int i = 0; i < 3; ++i) {
1348 if (strcmp(visibilities[i], string.begin) == 0) {
1349 attribute->u.value = i;
1353 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1355 attribute->invalid = true;
1358 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1360 /* TODO: find out what is allowed here... */
1362 /* at least: byte, word, pointer, list of machine modes
1363 * __XXX___ is interpreted as XXX */
1364 add_anchor_token(')');
1366 if (token.type != T_IDENTIFIER) {
1367 expect(T_IDENTIFIER);
1370 /* This isn't really correct, the backend should provide a list of machine
1371 * specific modes (according to gcc philosophy that is...) */
1372 const char *symbol_str = token.v.symbol->string;
1373 if (strcmp_underscore("QI", symbol_str) == 0 ||
1374 strcmp_underscore("byte", symbol_str) == 0) {
1375 attribute->u.akind = ATOMIC_TYPE_CHAR;
1376 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1377 attribute->u.akind = ATOMIC_TYPE_SHORT;
1378 } else if (strcmp_underscore("SI", symbol_str) == 0
1379 || strcmp_underscore("word", symbol_str) == 0
1380 || strcmp_underscore("pointer", symbol_str) == 0) {
1381 attribute->u.akind = ATOMIC_TYPE_INT;
1382 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1383 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1385 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1386 attribute->invalid = true;
1390 rem_anchor_token(')');
1394 attribute->invalid = true;
1398 * parse one interrupt argument.
1400 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1402 static const char *const interrupts[] = {
1409 string_t string = { NULL, 0 };
1410 parse_gnu_attribute_string_arg(attribute, &string);
1411 if (string.begin != NULL) {
1412 for(size_t i = 0; i < 5; ++i) {
1413 if (strcmp(interrupts[i], string.begin) == 0) {
1414 attribute->u.value = i;
1418 errorf(HERE, "'%s' is not an interrupt", string.begin);
1420 attribute->invalid = true;
1424 * parse ( identifier, const expression, const expression )
1426 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1428 static const char *const format_names[] = {
1436 if (token.type != T_IDENTIFIER) {
1437 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1440 const char *name = token.v.symbol->string;
1441 for(i = 0; i < 4; ++i) {
1442 if (strcmp_underscore(format_names[i], name) == 0)
1446 if (warning.attribute)
1447 warningf(HERE, "'%s' is an unrecognized format function type", name);
1452 add_anchor_token(')');
1453 add_anchor_token(',');
1454 parse_constant_expression();
1455 rem_anchor_token(',');
1456 rem_anchor_token('(');
1459 add_anchor_token(')');
1460 parse_constant_expression();
1461 rem_anchor_token('(');
1465 attribute->u.value = true;
1468 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1470 if (!attribute->have_arguments)
1473 /* should have no arguments */
1474 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1475 eat_until_matching_token('(');
1476 /* we have already consumed '(', so we stop before ')', eat it */
1478 attribute->invalid = true;
1482 * Parse one GNU attribute.
1484 * Note that attribute names can be specified WITH or WITHOUT
1485 * double underscores, ie const or __const__.
1487 * The following attributes are parsed without arguments
1512 * no_instrument_function
1513 * warn_unused_result
1530 * externally_visible
1538 * The following attributes are parsed with arguments
1539 * aligned( const expression )
1540 * alias( string literal )
1541 * section( string literal )
1542 * format( identifier, const expression, const expression )
1543 * format_arg( const expression )
1544 * tls_model( string literal )
1545 * visibility( string literal )
1546 * regparm( const expression )
1547 * model( string leteral )
1548 * trap_exit( const expression )
1549 * sp_switch( string literal )
1551 * The following attributes might have arguments
1552 * weak_ref( string literal )
1553 * non_null( const expression // ',' )
1554 * interrupt( string literal )
1555 * sentinel( constant expression )
1557 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1559 gnu_attribute_t *head = *attributes;
1560 gnu_attribute_t *last = *attributes;
1561 decl_modifiers_t modifiers = 0;
1562 gnu_attribute_t *attribute;
1564 eat(T___attribute__);
1568 if (token.type != ')') {
1569 /* find the end of the list */
1571 while (last->next != NULL)
1575 /* non-empty attribute list */
1578 if (token.type == T_const) {
1580 } else if (token.type == T_volatile) {
1582 } else if (token.type == T_cdecl) {
1583 /* __attribute__((cdecl)), WITH ms mode */
1585 } else if (token.type == T_IDENTIFIER) {
1586 const symbol_t *sym = token.v.symbol;
1589 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1596 for(i = 0; i < GNU_AK_LAST; ++i) {
1597 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1600 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1603 if (kind == GNU_AK_LAST) {
1604 if (warning.attribute)
1605 warningf(HERE, "'%s' attribute directive ignored", name);
1607 /* skip possible arguments */
1608 if (token.type == '(') {
1609 eat_until_matching_token(')');
1612 /* check for arguments */
1613 attribute = allocate_gnu_attribute(kind);
1614 if (token.type == '(') {
1616 if (token.type == ')') {
1617 /* empty args are allowed */
1620 attribute->have_arguments = true;
1625 case GNU_AK_VOLATILE:
1630 case GNU_AK_NOCOMMON:
1632 case GNU_AK_NOTSHARED:
1633 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1634 case GNU_AK_WARN_UNUSED_RESULT:
1635 case GNU_AK_LONGCALL:
1636 case GNU_AK_SHORTCALL:
1637 case GNU_AK_LONG_CALL:
1638 case GNU_AK_SHORT_CALL:
1639 case GNU_AK_FUNCTION_VECTOR:
1640 case GNU_AK_INTERRUPT_HANDLER:
1641 case GNU_AK_NMI_HANDLER:
1642 case GNU_AK_NESTING:
1646 case GNU_AK_EIGTHBIT_DATA:
1647 case GNU_AK_TINY_DATA:
1648 case GNU_AK_SAVEALL:
1649 case GNU_AK_FLATTEN:
1650 case GNU_AK_SSEREGPARM:
1651 case GNU_AK_EXTERNALLY_VISIBLE:
1652 case GNU_AK_RETURN_TWICE:
1653 case GNU_AK_MAY_ALIAS:
1654 case GNU_AK_MS_STRUCT:
1655 case GNU_AK_GCC_STRUCT:
1658 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1659 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1660 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1661 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1662 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1663 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1664 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1665 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1666 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1667 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1668 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1669 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1670 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1671 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1672 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1673 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1674 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1676 case GNU_AK_ALIGNED:
1677 /* __align__ may be used without an argument */
1678 if (attribute->have_arguments) {
1679 parse_gnu_attribute_const_arg(attribute);
1683 case GNU_AK_FORMAT_ARG:
1684 case GNU_AK_REGPARM:
1685 case GNU_AK_TRAP_EXIT:
1686 if (!attribute->have_arguments) {
1687 /* should have arguments */
1688 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1689 attribute->invalid = true;
1691 parse_gnu_attribute_const_arg(attribute);
1694 case GNU_AK_SECTION:
1695 case GNU_AK_SP_SWITCH:
1696 if (!attribute->have_arguments) {
1697 /* should have arguments */
1698 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1699 attribute->invalid = true;
1701 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1704 if (!attribute->have_arguments) {
1705 /* should have arguments */
1706 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1707 attribute->invalid = true;
1709 parse_gnu_attribute_format_args(attribute);
1711 case GNU_AK_WEAKREF:
1712 /* may have one string argument */
1713 if (attribute->have_arguments)
1714 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1716 case GNU_AK_NONNULL:
1717 if (attribute->have_arguments)
1718 parse_gnu_attribute_const_arg_list(attribute);
1720 case GNU_AK_TLS_MODEL:
1721 if (!attribute->have_arguments) {
1722 /* should have arguments */
1723 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1725 parse_gnu_attribute_tls_model_arg(attribute);
1727 case GNU_AK_VISIBILITY:
1728 if (!attribute->have_arguments) {
1729 /* should have arguments */
1730 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1732 parse_gnu_attribute_visibility_arg(attribute);
1735 if (!attribute->have_arguments) {
1736 /* should have arguments */
1737 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1739 parse_gnu_attribute_model_arg(attribute);
1743 if (!attribute->have_arguments) {
1744 /* should have arguments */
1745 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1747 parse_gnu_attribute_mode_arg(attribute);
1750 case GNU_AK_INTERRUPT:
1751 /* may have one string argument */
1752 if (attribute->have_arguments)
1753 parse_gnu_attribute_interrupt_arg(attribute);
1755 case GNU_AK_SENTINEL:
1756 /* may have one string argument */
1757 if (attribute->have_arguments)
1758 parse_gnu_attribute_const_arg(attribute);
1761 /* already handled */
1765 check_no_argument(attribute, name);
1768 if (attribute != NULL) {
1770 last->next = attribute;
1773 head = last = attribute;
1777 if (token.type != ',')
1791 * Parse GNU attributes.
1793 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1795 decl_modifiers_t modifiers = 0;
1798 switch(token.type) {
1799 case T___attribute__:
1800 modifiers |= parse_gnu_attribute(attributes);
1806 if (token.type != T_STRING_LITERAL) {
1807 parse_error_expected("while parsing assembler attribute",
1808 T_STRING_LITERAL, NULL);
1809 eat_until_matching_token('(');
1812 parse_string_literals();
1817 case T_cdecl: modifiers |= DM_CDECL; break;
1818 case T__fastcall: modifiers |= DM_FASTCALL; break;
1819 case T__stdcall: modifiers |= DM_STDCALL; break;
1822 /* TODO record modifier */
1823 warningf(HERE, "Ignoring declaration modifier %K", &token);
1827 default: return modifiers;
1834 static designator_t *parse_designation(void)
1836 designator_t *result = NULL;
1837 designator_t *last = NULL;
1840 designator_t *designator;
1841 switch(token.type) {
1843 designator = allocate_ast_zero(sizeof(designator[0]));
1844 designator->source_position = token.source_position;
1846 add_anchor_token(']');
1847 designator->array_index = parse_constant_expression();
1848 rem_anchor_token(']');
1852 designator = allocate_ast_zero(sizeof(designator[0]));
1853 designator->source_position = token.source_position;
1855 if (token.type != T_IDENTIFIER) {
1856 parse_error_expected("while parsing designator",
1857 T_IDENTIFIER, NULL);
1860 designator->symbol = token.v.symbol;
1868 assert(designator != NULL);
1870 last->next = designator;
1872 result = designator;
1880 static initializer_t *initializer_from_string(array_type_t *type,
1881 const string_t *const string)
1883 /* TODO: check len vs. size of array type */
1886 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1887 initializer->string.string = *string;
1892 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1893 wide_string_t *const string)
1895 /* TODO: check len vs. size of array type */
1898 initializer_t *const initializer =
1899 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1900 initializer->wide_string.string = *string;
1906 * Build an initializer from a given expression.
1908 static initializer_t *initializer_from_expression(type_t *orig_type,
1909 expression_t *expression)
1911 /* TODO check that expression is a constant expression */
1913 /* § 6.7.8.14/15 char array may be initialized by string literals */
1914 type_t *type = skip_typeref(orig_type);
1915 type_t *expr_type_orig = expression->base.type;
1916 type_t *expr_type = skip_typeref(expr_type_orig);
1917 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1918 array_type_t *const array_type = &type->array;
1919 type_t *const element_type = skip_typeref(array_type->element_type);
1921 if (element_type->kind == TYPE_ATOMIC) {
1922 atomic_type_kind_t akind = element_type->atomic.akind;
1923 switch (expression->kind) {
1924 case EXPR_STRING_LITERAL:
1925 if (akind == ATOMIC_TYPE_CHAR
1926 || akind == ATOMIC_TYPE_SCHAR
1927 || akind == ATOMIC_TYPE_UCHAR) {
1928 return initializer_from_string(array_type,
1929 &expression->string.value);
1932 case EXPR_WIDE_STRING_LITERAL: {
1933 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1934 if (get_unqualified_type(element_type) == bare_wchar_type) {
1935 return initializer_from_wide_string(array_type,
1936 &expression->wide_string.value);
1946 assign_error_t error = semantic_assign(type, expression);
1947 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1949 report_assign_error(error, type, expression, "initializer",
1950 &expression->base.source_position);
1952 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1953 result->value.value = create_implicit_cast(expression, type);
1959 * Checks if a given expression can be used as an constant initializer.
1961 static bool is_initializer_constant(const expression_t *expression)
1963 return is_constant_expression(expression)
1964 || is_address_constant(expression);
1968 * Parses an scalar initializer.
1970 * § 6.7.8.11; eat {} without warning
1972 static initializer_t *parse_scalar_initializer(type_t *type,
1973 bool must_be_constant)
1975 /* there might be extra {} hierarchies */
1977 if (token.type == '{') {
1978 warningf(HERE, "extra curly braces around scalar initializer");
1982 } while (token.type == '{');
1985 expression_t *expression = parse_assignment_expression();
1986 if (must_be_constant && !is_initializer_constant(expression)) {
1987 errorf(&expression->base.source_position,
1988 "Initialisation expression '%E' is not constant\n",
1992 initializer_t *initializer = initializer_from_expression(type, expression);
1994 if (initializer == NULL) {
1995 errorf(&expression->base.source_position,
1996 "expression '%E' (type '%T') doesn't match expected type '%T'",
1997 expression, expression->base.type, type);
2002 bool additional_warning_displayed = false;
2003 while (braces > 0) {
2004 if (token.type == ',') {
2007 if (token.type != '}') {
2008 if (!additional_warning_displayed) {
2009 warningf(HERE, "additional elements in scalar initializer");
2010 additional_warning_displayed = true;
2021 * An entry in the type path.
2023 typedef struct type_path_entry_t type_path_entry_t;
2024 struct type_path_entry_t {
2025 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2027 size_t index; /**< For array types: the current index. */
2028 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2033 * A type path expression a position inside compound or array types.
2035 typedef struct type_path_t type_path_t;
2036 struct type_path_t {
2037 type_path_entry_t *path; /**< An flexible array containing the current path. */
2038 type_t *top_type; /**< type of the element the path points */
2039 size_t max_index; /**< largest index in outermost array */
2043 * Prints a type path for debugging.
2045 static __attribute__((unused)) void debug_print_type_path(
2046 const type_path_t *path)
2048 size_t len = ARR_LEN(path->path);
2050 for(size_t i = 0; i < len; ++i) {
2051 const type_path_entry_t *entry = & path->path[i];
2053 type_t *type = skip_typeref(entry->type);
2054 if (is_type_compound(type)) {
2055 /* in gcc mode structs can have no members */
2056 if (entry->v.compound_entry == NULL) {
2060 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
2061 } else if (is_type_array(type)) {
2062 fprintf(stderr, "[%zu]", entry->v.index);
2064 fprintf(stderr, "-INVALID-");
2067 if (path->top_type != NULL) {
2068 fprintf(stderr, " (");
2069 print_type(path->top_type);
2070 fprintf(stderr, ")");
2075 * Return the top type path entry, ie. in a path
2076 * (type).a.b returns the b.
2078 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2080 size_t len = ARR_LEN(path->path);
2082 return &path->path[len-1];
2086 * Enlarge the type path by an (empty) element.
2088 static type_path_entry_t *append_to_type_path(type_path_t *path)
2090 size_t len = ARR_LEN(path->path);
2091 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2093 type_path_entry_t *result = & path->path[len];
2094 memset(result, 0, sizeof(result[0]));
2099 * Descending into a sub-type. Enter the scope of the current
2102 static void descend_into_subtype(type_path_t *path)
2104 type_t *orig_top_type = path->top_type;
2105 type_t *top_type = skip_typeref(orig_top_type);
2107 assert(is_type_compound(top_type) || is_type_array(top_type));
2109 type_path_entry_t *top = append_to_type_path(path);
2110 top->type = top_type;
2112 if (is_type_compound(top_type)) {
2113 declaration_t *declaration = top_type->compound.declaration;
2114 declaration_t *entry = declaration->scope.declarations;
2115 top->v.compound_entry = entry;
2117 if (entry != NULL) {
2118 path->top_type = entry->type;
2120 path->top_type = NULL;
2123 assert(is_type_array(top_type));
2126 path->top_type = top_type->array.element_type;
2131 * Pop an entry from the given type path, ie. returning from
2132 * (type).a.b to (type).a
2134 static void ascend_from_subtype(type_path_t *path)
2136 type_path_entry_t *top = get_type_path_top(path);
2138 path->top_type = top->type;
2140 size_t len = ARR_LEN(path->path);
2141 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2145 * Pop entries from the given type path until the given
2146 * path level is reached.
2148 static void ascend_to(type_path_t *path, size_t top_path_level)
2150 size_t len = ARR_LEN(path->path);
2152 while (len > top_path_level) {
2153 ascend_from_subtype(path);
2154 len = ARR_LEN(path->path);
2158 static bool walk_designator(type_path_t *path, const designator_t *designator,
2159 bool used_in_offsetof)
2161 for( ; designator != NULL; designator = designator->next) {
2162 type_path_entry_t *top = get_type_path_top(path);
2163 type_t *orig_type = top->type;
2165 type_t *type = skip_typeref(orig_type);
2167 if (designator->symbol != NULL) {
2168 symbol_t *symbol = designator->symbol;
2169 if (!is_type_compound(type)) {
2170 if (is_type_valid(type)) {
2171 errorf(&designator->source_position,
2172 "'.%Y' designator used for non-compound type '%T'",
2178 declaration_t *declaration = type->compound.declaration;
2179 declaration_t *iter = declaration->scope.declarations;
2180 for( ; iter != NULL; iter = iter->next) {
2181 if (iter->symbol == symbol) {
2186 errorf(&designator->source_position,
2187 "'%T' has no member named '%Y'", orig_type, symbol);
2190 if (used_in_offsetof) {
2191 type_t *real_type = skip_typeref(iter->type);
2192 if (real_type->kind == TYPE_BITFIELD) {
2193 errorf(&designator->source_position,
2194 "offsetof designator '%Y' may not specify bitfield",
2200 top->type = orig_type;
2201 top->v.compound_entry = iter;
2202 orig_type = iter->type;
2204 expression_t *array_index = designator->array_index;
2205 assert(designator->array_index != NULL);
2207 if (!is_type_array(type)) {
2208 if (is_type_valid(type)) {
2209 errorf(&designator->source_position,
2210 "[%E] designator used for non-array type '%T'",
2211 array_index, orig_type);
2215 if (!is_type_valid(array_index->base.type)) {
2219 long index = fold_constant(array_index);
2220 if (!used_in_offsetof) {
2222 errorf(&designator->source_position,
2223 "array index [%E] must be positive", array_index);
2226 if (type->array.size_constant == true) {
2227 long array_size = type->array.size;
2228 if (index >= array_size) {
2229 errorf(&designator->source_position,
2230 "designator [%E] (%d) exceeds array size %d",
2231 array_index, index, array_size);
2237 top->type = orig_type;
2238 top->v.index = (size_t) index;
2239 orig_type = type->array.element_type;
2241 path->top_type = orig_type;
2243 if (designator->next != NULL) {
2244 descend_into_subtype(path);
2253 static void advance_current_object(type_path_t *path, size_t top_path_level)
2255 type_path_entry_t *top = get_type_path_top(path);
2257 type_t *type = skip_typeref(top->type);
2258 if (is_type_union(type)) {
2259 /* in unions only the first element is initialized */
2260 top->v.compound_entry = NULL;
2261 } else if (is_type_struct(type)) {
2262 declaration_t *entry = top->v.compound_entry;
2264 entry = entry->next;
2265 top->v.compound_entry = entry;
2266 if (entry != NULL) {
2267 path->top_type = entry->type;
2271 assert(is_type_array(type));
2275 if (!type->array.size_constant || top->v.index < type->array.size) {
2280 /* we're past the last member of the current sub-aggregate, try if we
2281 * can ascend in the type hierarchy and continue with another subobject */
2282 size_t len = ARR_LEN(path->path);
2284 if (len > top_path_level) {
2285 ascend_from_subtype(path);
2286 advance_current_object(path, top_path_level);
2288 path->top_type = NULL;
2293 * skip until token is found.
2295 static void skip_until(int type)
2297 while (token.type != type) {
2298 if (token.type == T_EOF)
2305 * skip any {...} blocks until a closing bracket is reached.
2307 static void skip_initializers(void)
2309 if (token.type == '{')
2312 while (token.type != '}') {
2313 if (token.type == T_EOF)
2315 if (token.type == '{') {
2323 static initializer_t *create_empty_initializer(void)
2325 static initializer_t empty_initializer
2326 = { .list = { { INITIALIZER_LIST }, 0 } };
2327 return &empty_initializer;
2331 * Parse a part of an initialiser for a struct or union,
2333 static initializer_t *parse_sub_initializer(type_path_t *path,
2334 type_t *outer_type, size_t top_path_level,
2335 parse_initializer_env_t *env)
2337 if (token.type == '}') {
2338 /* empty initializer */
2339 return create_empty_initializer();
2342 type_t *orig_type = path->top_type;
2343 type_t *type = NULL;
2345 if (orig_type == NULL) {
2346 /* We are initializing an empty compound. */
2348 type = skip_typeref(orig_type);
2350 /* we can't do usefull stuff if we didn't even parse the type. Skip the
2351 * initializers in this case. */
2352 if (!is_type_valid(type)) {
2353 skip_initializers();
2354 return create_empty_initializer();
2358 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2361 designator_t *designator = NULL;
2362 if (token.type == '.' || token.type == '[') {
2363 designator = parse_designation();
2364 goto finish_designator;
2365 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2366 /* GNU-style designator ("identifier: value") */
2367 designator = allocate_ast_zero(sizeof(designator[0]));
2368 designator->source_position = token.source_position;
2369 designator->symbol = token.v.symbol;
2374 /* reset path to toplevel, evaluate designator from there */
2375 ascend_to(path, top_path_level);
2376 if (!walk_designator(path, designator, false)) {
2377 /* can't continue after designation error */
2381 initializer_t *designator_initializer
2382 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2383 designator_initializer->designator.designator = designator;
2384 ARR_APP1(initializer_t*, initializers, designator_initializer);
2386 orig_type = path->top_type;
2387 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2392 if (token.type == '{') {
2393 if (type != NULL && is_type_scalar(type)) {
2394 sub = parse_scalar_initializer(type, env->must_be_constant);
2398 if (env->declaration != NULL) {
2399 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2400 env->declaration->symbol);
2402 errorf(HERE, "extra brace group at end of initializer");
2405 descend_into_subtype(path);
2407 add_anchor_token('}');
2408 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2410 rem_anchor_token('}');
2413 ascend_from_subtype(path);
2417 goto error_parse_next;
2421 /* must be an expression */
2422 expression_t *expression = parse_assignment_expression();
2424 if (env->must_be_constant && !is_initializer_constant(expression)) {
2425 errorf(&expression->base.source_position,
2426 "Initialisation expression '%E' is not constant\n",
2431 /* we are already outside, ... */
2435 /* handle { "string" } special case */
2436 if ((expression->kind == EXPR_STRING_LITERAL
2437 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2438 && outer_type != NULL) {
2439 sub = initializer_from_expression(outer_type, expression);
2441 if (token.type == ',') {
2444 if (token.type != '}') {
2445 warningf(HERE, "excessive elements in initializer for type '%T'",
2448 /* TODO: eat , ... */
2453 /* descend into subtypes until expression matches type */
2455 orig_type = path->top_type;
2456 type = skip_typeref(orig_type);
2458 sub = initializer_from_expression(orig_type, expression);
2462 if (!is_type_valid(type)) {
2465 if (is_type_scalar(type)) {
2466 errorf(&expression->base.source_position,
2467 "expression '%E' doesn't match expected type '%T'",
2468 expression, orig_type);
2472 descend_into_subtype(path);
2476 /* update largest index of top array */
2477 const type_path_entry_t *first = &path->path[0];
2478 type_t *first_type = first->type;
2479 first_type = skip_typeref(first_type);
2480 if (is_type_array(first_type)) {
2481 size_t index = first->v.index;
2482 if (index > path->max_index)
2483 path->max_index = index;
2487 /* append to initializers list */
2488 ARR_APP1(initializer_t*, initializers, sub);
2491 if (env->declaration != NULL)
2492 warningf(HERE, "excess elements in struct initializer for '%Y'",
2493 env->declaration->symbol);
2495 warningf(HERE, "excess elements in struct initializer");
2499 if (token.type == '}') {
2503 if (token.type == '}') {
2508 /* advance to the next declaration if we are not at the end */
2509 advance_current_object(path, top_path_level);
2510 orig_type = path->top_type;
2511 if (orig_type != NULL)
2512 type = skip_typeref(orig_type);
2518 size_t len = ARR_LEN(initializers);
2519 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2520 initializer_t *result = allocate_ast_zero(size);
2521 result->kind = INITIALIZER_LIST;
2522 result->list.len = len;
2523 memcpy(&result->list.initializers, initializers,
2524 len * sizeof(initializers[0]));
2526 DEL_ARR_F(initializers);
2527 ascend_to(path, top_path_level+1);
2532 skip_initializers();
2533 DEL_ARR_F(initializers);
2534 ascend_to(path, top_path_level+1);
2539 * Parses an initializer. Parsers either a compound literal
2540 * (env->declaration == NULL) or an initializer of a declaration.
2542 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2544 type_t *type = skip_typeref(env->type);
2545 initializer_t *result = NULL;
2548 if (is_type_scalar(type)) {
2549 result = parse_scalar_initializer(type, env->must_be_constant);
2550 } else if (token.type == '{') {
2554 memset(&path, 0, sizeof(path));
2555 path.top_type = env->type;
2556 path.path = NEW_ARR_F(type_path_entry_t, 0);
2558 descend_into_subtype(&path);
2560 add_anchor_token('}');
2561 result = parse_sub_initializer(&path, env->type, 1, env);
2562 rem_anchor_token('}');
2564 max_index = path.max_index;
2565 DEL_ARR_F(path.path);
2569 /* parse_scalar_initializer() also works in this case: we simply
2570 * have an expression without {} around it */
2571 result = parse_scalar_initializer(type, env->must_be_constant);
2574 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2575 * the array type size */
2576 if (is_type_array(type) && type->array.size_expression == NULL
2577 && result != NULL) {
2579 switch (result->kind) {
2580 case INITIALIZER_LIST:
2581 size = max_index + 1;
2584 case INITIALIZER_STRING:
2585 size = result->string.string.size;
2588 case INITIALIZER_WIDE_STRING:
2589 size = result->wide_string.string.size;
2592 case INITIALIZER_DESIGNATOR:
2593 case INITIALIZER_VALUE:
2594 /* can happen for parse errors */
2599 internal_errorf(HERE, "invalid initializer type");
2602 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2603 cnst->base.type = type_size_t;
2604 cnst->conste.v.int_value = size;
2606 type_t *new_type = duplicate_type(type);
2608 new_type->array.size_expression = cnst;
2609 new_type->array.size_constant = true;
2610 new_type->array.size = size;
2611 env->type = new_type;
2619 static declaration_t *append_declaration(declaration_t *declaration);
2621 static declaration_t *parse_compound_type_specifier(bool is_struct)
2623 gnu_attribute_t *attributes = NULL;
2624 decl_modifiers_t modifiers = 0;
2631 symbol_t *symbol = NULL;
2632 declaration_t *declaration = NULL;
2634 if (token.type == T___attribute__) {
2635 modifiers |= parse_attributes(&attributes);
2638 if (token.type == T_IDENTIFIER) {
2639 symbol = token.v.symbol;
2642 namespace_t const namespc =
2643 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2644 declaration = get_declaration(symbol, namespc);
2645 if (declaration != NULL) {
2646 if (declaration->parent_scope != scope &&
2647 (token.type == '{' || token.type == ';')) {
2649 } else if (declaration->init.complete &&
2650 token.type == '{') {
2651 assert(symbol != NULL);
2652 errorf(HERE, "multiple definitions of '%s %Y' (previous definition at %P)",
2653 is_struct ? "struct" : "union", symbol,
2654 &declaration->source_position);
2655 declaration->scope.declarations = NULL;
2658 } else if (token.type != '{') {
2660 parse_error_expected("while parsing struct type specifier",
2661 T_IDENTIFIER, '{', NULL);
2663 parse_error_expected("while parsing union type specifier",
2664 T_IDENTIFIER, '{', NULL);
2670 if (declaration == NULL) {
2671 declaration = allocate_declaration_zero();
2672 declaration->namespc =
2673 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2674 declaration->source_position = token.source_position;
2675 declaration->symbol = symbol;
2676 declaration->parent_scope = scope;
2677 if (symbol != NULL) {
2678 environment_push(declaration);
2680 append_declaration(declaration);
2683 if (token.type == '{') {
2684 declaration->init.complete = true;
2686 parse_compound_type_entries(declaration);
2687 modifiers |= parse_attributes(&attributes);
2690 declaration->modifiers |= modifiers;
2694 static void parse_enum_entries(type_t *const enum_type)
2698 if (token.type == '}') {
2700 errorf(HERE, "empty enum not allowed");
2704 add_anchor_token('}');
2706 if (token.type != T_IDENTIFIER) {
2707 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2709 rem_anchor_token('}');
2713 declaration_t *const entry = allocate_declaration_zero();
2714 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
2715 entry->type = enum_type;
2716 entry->symbol = token.v.symbol;
2717 entry->source_position = token.source_position;
2720 if (token.type == '=') {
2722 expression_t *value = parse_constant_expression();
2724 value = create_implicit_cast(value, enum_type);
2725 entry->init.enum_value = value;
2730 record_declaration(entry, false);
2732 if (token.type != ',')
2735 } while (token.type != '}');
2736 rem_anchor_token('}');
2744 static type_t *parse_enum_specifier(void)
2746 gnu_attribute_t *attributes = NULL;
2747 declaration_t *declaration;
2751 if (token.type == T_IDENTIFIER) {
2752 symbol = token.v.symbol;
2755 declaration = get_declaration(symbol, NAMESPACE_ENUM);
2756 } else if (token.type != '{') {
2757 parse_error_expected("while parsing enum type specifier",
2758 T_IDENTIFIER, '{', NULL);
2765 if (declaration == NULL) {
2766 declaration = allocate_declaration_zero();
2767 declaration->namespc = NAMESPACE_ENUM;
2768 declaration->source_position = token.source_position;
2769 declaration->symbol = symbol;
2770 declaration->parent_scope = scope;
2773 type_t *const type = allocate_type_zero(TYPE_ENUM, &declaration->source_position);
2774 type->enumt.declaration = declaration;
2776 if (token.type == '{') {
2777 if (declaration->init.complete) {
2778 errorf(HERE, "multiple definitions of enum %Y", symbol);
2780 if (symbol != NULL) {
2781 environment_push(declaration);
2783 append_declaration(declaration);
2784 declaration->init.complete = true;
2786 parse_enum_entries(type);
2787 parse_attributes(&attributes);
2794 * if a symbol is a typedef to another type, return true
2796 static bool is_typedef_symbol(symbol_t *symbol)
2798 const declaration_t *const declaration =
2799 get_declaration(symbol, NAMESPACE_NORMAL);
2801 declaration != NULL &&
2802 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
2805 static type_t *parse_typeof(void)
2812 add_anchor_token(')');
2814 expression_t *expression = NULL;
2817 switch(token.type) {
2818 case T___extension__:
2819 /* This can be a prefix to a typename or an expression. We simply eat
2823 } while (token.type == T___extension__);
2827 if (is_typedef_symbol(token.v.symbol)) {
2828 type = parse_typename();
2830 expression = parse_expression();
2831 type = expression->base.type;
2836 type = parse_typename();
2840 expression = parse_expression();
2841 type = expression->base.type;
2845 rem_anchor_token(')');
2848 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, &expression->base.source_position);
2849 typeof_type->typeoft.expression = expression;
2850 typeof_type->typeoft.typeof_type = type;
2857 typedef enum specifiers_t {
2858 SPECIFIER_SIGNED = 1 << 0,
2859 SPECIFIER_UNSIGNED = 1 << 1,
2860 SPECIFIER_LONG = 1 << 2,
2861 SPECIFIER_INT = 1 << 3,
2862 SPECIFIER_DOUBLE = 1 << 4,
2863 SPECIFIER_CHAR = 1 << 5,
2864 SPECIFIER_SHORT = 1 << 6,
2865 SPECIFIER_LONG_LONG = 1 << 7,
2866 SPECIFIER_FLOAT = 1 << 8,
2867 SPECIFIER_BOOL = 1 << 9,
2868 SPECIFIER_VOID = 1 << 10,
2869 SPECIFIER_INT8 = 1 << 11,
2870 SPECIFIER_INT16 = 1 << 12,
2871 SPECIFIER_INT32 = 1 << 13,
2872 SPECIFIER_INT64 = 1 << 14,
2873 SPECIFIER_INT128 = 1 << 15,
2874 SPECIFIER_COMPLEX = 1 << 16,
2875 SPECIFIER_IMAGINARY = 1 << 17,
2878 static type_t *create_builtin_type(symbol_t *const symbol,
2879 type_t *const real_type)
2881 type_t *type = allocate_type_zero(TYPE_BUILTIN, &builtin_source_position);
2882 type->builtin.symbol = symbol;
2883 type->builtin.real_type = real_type;
2885 type_t *result = typehash_insert(type);
2886 if (type != result) {
2893 static type_t *get_typedef_type(symbol_t *symbol)
2895 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
2896 if (declaration == NULL ||
2897 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
2900 type_t *type = allocate_type_zero(TYPE_TYPEDEF, &declaration->source_position);
2901 type->typedeft.declaration = declaration;
2907 * check for the allowed MS alignment values.
2909 static bool check_alignment_value(long long intvalue)
2911 if (intvalue < 1 || intvalue > 8192) {
2912 errorf(HERE, "illegal alignment value");
2915 unsigned v = (unsigned)intvalue;
2916 for(unsigned i = 1; i <= 8192; i += i) {
2920 errorf(HERE, "alignment must be power of two");
2924 #define DET_MOD(name, tag) do { \
2925 if (*modifiers & tag) warningf(HERE, #name " used more than once"); \
2926 *modifiers |= tag; \
2929 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
2931 decl_modifiers_t *modifiers = &specifiers->modifiers;
2934 if (token.type == T_restrict) {
2936 DET_MOD(restrict, DM_RESTRICT);
2938 } else if (token.type != T_IDENTIFIER)
2940 symbol_t *symbol = token.v.symbol;
2941 if (symbol == sym_align) {
2944 if (token.type != T_INTEGER)
2946 if (check_alignment_value(token.v.intvalue)) {
2947 if (specifiers->alignment != 0)
2948 warningf(HERE, "align used more than once");
2949 specifiers->alignment = (unsigned char)token.v.intvalue;
2953 } else if (symbol == sym_allocate) {
2956 if (token.type != T_IDENTIFIER)
2958 (void)token.v.symbol;
2960 } else if (symbol == sym_dllimport) {
2962 DET_MOD(dllimport, DM_DLLIMPORT);
2963 } else if (symbol == sym_dllexport) {
2965 DET_MOD(dllexport, DM_DLLEXPORT);
2966 } else if (symbol == sym_thread) {
2968 DET_MOD(thread, DM_THREAD);
2969 } else if (symbol == sym_naked) {
2971 DET_MOD(naked, DM_NAKED);
2972 } else if (symbol == sym_noinline) {
2974 DET_MOD(noinline, DM_NOINLINE);
2975 } else if (symbol == sym_noreturn) {
2977 DET_MOD(noreturn, DM_NORETURN);
2978 } else if (symbol == sym_nothrow) {
2980 DET_MOD(nothrow, DM_NOTHROW);
2981 } else if (symbol == sym_novtable) {
2983 DET_MOD(novtable, DM_NOVTABLE);
2984 } else if (symbol == sym_property) {
2988 bool is_get = false;
2989 if (token.type != T_IDENTIFIER)
2991 if (token.v.symbol == sym_get) {
2993 } else if (token.v.symbol == sym_put) {
2995 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3000 if (token.type != T_IDENTIFIER)
3003 if (specifiers->get_property_sym != NULL) {
3004 errorf(HERE, "get property name already specified");
3006 specifiers->get_property_sym = token.v.symbol;
3009 if (specifiers->put_property_sym != NULL) {
3010 errorf(HERE, "put property name already specified");
3012 specifiers->put_property_sym = token.v.symbol;
3016 if (token.type == ',') {
3023 } else if (symbol == sym_selectany) {
3025 DET_MOD(selectany, DM_SELECTANY);
3026 } else if (symbol == sym_uuid) {
3029 if (token.type != T_STRING_LITERAL)
3033 } else if (symbol == sym_deprecated) {
3035 if (specifiers->deprecated != 0)
3036 warningf(HERE, "deprecated used more than once");
3037 specifiers->deprecated = 1;
3038 if (token.type == '(') {
3040 if (token.type == T_STRING_LITERAL) {
3041 specifiers->deprecated_string = token.v.string.begin;
3044 errorf(HERE, "string literal expected");
3048 } else if (symbol == sym_noalias) {
3050 DET_MOD(noalias, DM_NOALIAS);
3052 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
3054 if (token.type == '(')
3058 if (token.type == ',')
3065 static declaration_t *create_error_declaration(symbol_t *symbol, storage_class_tag_t storage_class)
3067 declaration_t *const decl = allocate_declaration_zero();
3068 decl->source_position = *HERE;
3069 decl->declared_storage_class = storage_class;
3070 decl->storage_class =
3071 storage_class != STORAGE_CLASS_NONE || scope == global_scope ?
3072 storage_class : STORAGE_CLASS_AUTO;
3073 decl->symbol = symbol;
3074 decl->implicit = true;
3075 record_declaration(decl, false);
3079 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3081 type_t *type = NULL;
3082 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3083 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3084 unsigned type_specifiers = 0;
3085 bool newtype = false;
3086 bool saw_error = false;
3088 specifiers->source_position = token.source_position;
3091 specifiers->modifiers
3092 |= parse_attributes(&specifiers->gnu_attributes);
3093 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3094 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3096 switch(token.type) {
3099 #define MATCH_STORAGE_CLASS(token, class) \
3101 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
3102 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3104 specifiers->declared_storage_class = class; \
3108 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3109 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3110 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3111 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3112 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3117 add_anchor_token(')');
3118 parse_microsoft_extended_decl_modifier(specifiers);
3119 rem_anchor_token(')');
3124 switch (specifiers->declared_storage_class) {
3125 case STORAGE_CLASS_NONE:
3126 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
3129 case STORAGE_CLASS_EXTERN:
3130 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
3133 case STORAGE_CLASS_STATIC:
3134 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
3138 errorf(HERE, "multiple storage classes in declaration specifiers");
3144 /* type qualifiers */
3145 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3147 qualifiers |= qualifier; \
3151 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3152 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3153 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3154 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3155 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3156 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3157 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3158 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3160 case T___extension__:
3165 /* type specifiers */
3166 #define MATCH_SPECIFIER(token, specifier, name) \
3169 if (type_specifiers & specifier) { \
3170 errorf(HERE, "multiple " name " type specifiers given"); \
3172 type_specifiers |= specifier; \
3176 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3177 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3178 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3179 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3180 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3181 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3182 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3183 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3184 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3185 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3186 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3187 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3188 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3189 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3190 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3191 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3193 case T__forceinline:
3194 /* only in microsoft mode */
3195 specifiers->modifiers |= DM_FORCEINLINE;
3200 specifiers->is_inline = true;
3205 if (type_specifiers & SPECIFIER_LONG_LONG) {
3206 errorf(HERE, "multiple type specifiers given");
3207 } else if (type_specifiers & SPECIFIER_LONG) {
3208 type_specifiers |= SPECIFIER_LONG_LONG;
3210 type_specifiers |= SPECIFIER_LONG;
3215 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
3217 type->compound.declaration = parse_compound_type_specifier(true);
3221 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
3222 type->compound.declaration = parse_compound_type_specifier(false);
3223 if (type->compound.declaration->modifiers & DM_TRANSPARENT_UNION)
3224 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3228 type = parse_enum_specifier();
3231 type = parse_typeof();
3233 case T___builtin_va_list:
3234 type = duplicate_type(type_valist);
3238 case T_IDENTIFIER: {
3239 /* only parse identifier if we haven't found a type yet */
3240 if (type != NULL || type_specifiers != 0) {
3241 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3242 * declaration, so it doesn't generate errors about expecting '(' or
3244 switch (look_ahead(1)->type) {
3251 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3254 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3259 goto finish_specifiers;
3263 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3264 if (typedef_type == NULL) {
3265 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3266 * declaration, so it doesn't generate 'implicit int' followed by more
3267 * errors later on. */
3268 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3273 errorf(HERE, "%K does not name a type", &token);
3275 declaration_t *const decl =
3276 create_error_declaration(token.v.symbol, STORAGE_CLASS_TYPEDEF);
3278 type = allocate_type_zero(TYPE_TYPEDEF, HERE);
3279 type->typedeft.declaration = decl;
3283 if (la1_type == '*')
3284 goto finish_specifiers;
3289 goto finish_specifiers;
3294 type = typedef_type;
3298 /* function specifier */
3300 goto finish_specifiers;
3305 if (type == NULL || (saw_error && type_specifiers != 0)) {
3306 atomic_type_kind_t atomic_type;
3308 /* match valid basic types */
3309 switch(type_specifiers) {
3310 case SPECIFIER_VOID:
3311 atomic_type = ATOMIC_TYPE_VOID;
3313 case SPECIFIER_CHAR:
3314 atomic_type = ATOMIC_TYPE_CHAR;
3316 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3317 atomic_type = ATOMIC_TYPE_SCHAR;
3319 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3320 atomic_type = ATOMIC_TYPE_UCHAR;
3322 case SPECIFIER_SHORT:
3323 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3324 case SPECIFIER_SHORT | SPECIFIER_INT:
3325 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3326 atomic_type = ATOMIC_TYPE_SHORT;
3328 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3329 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3330 atomic_type = ATOMIC_TYPE_USHORT;
3333 case SPECIFIER_SIGNED:
3334 case SPECIFIER_SIGNED | SPECIFIER_INT:
3335 atomic_type = ATOMIC_TYPE_INT;
3337 case SPECIFIER_UNSIGNED:
3338 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3339 atomic_type = ATOMIC_TYPE_UINT;
3341 case SPECIFIER_LONG:
3342 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3343 case SPECIFIER_LONG | SPECIFIER_INT:
3344 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3345 atomic_type = ATOMIC_TYPE_LONG;
3347 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3348 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3349 atomic_type = ATOMIC_TYPE_ULONG;
3352 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3353 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3354 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3355 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3357 atomic_type = ATOMIC_TYPE_LONGLONG;
3358 goto warn_about_long_long;
3360 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3361 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3363 atomic_type = ATOMIC_TYPE_ULONGLONG;
3364 warn_about_long_long:
3365 if (warning.long_long) {
3366 warningf(&specifiers->source_position,
3367 "ISO C90 does not support 'long long'");
3371 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3372 atomic_type = unsigned_int8_type_kind;
3375 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3376 atomic_type = unsigned_int16_type_kind;
3379 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3380 atomic_type = unsigned_int32_type_kind;
3383 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3384 atomic_type = unsigned_int64_type_kind;
3387 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3388 atomic_type = unsigned_int128_type_kind;
3391 case SPECIFIER_INT8:
3392 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3393 atomic_type = int8_type_kind;
3396 case SPECIFIER_INT16:
3397 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3398 atomic_type = int16_type_kind;
3401 case SPECIFIER_INT32:
3402 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3403 atomic_type = int32_type_kind;
3406 case SPECIFIER_INT64:
3407 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3408 atomic_type = int64_type_kind;
3411 case SPECIFIER_INT128:
3412 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3413 atomic_type = int128_type_kind;
3416 case SPECIFIER_FLOAT:
3417 atomic_type = ATOMIC_TYPE_FLOAT;
3419 case SPECIFIER_DOUBLE:
3420 atomic_type = ATOMIC_TYPE_DOUBLE;
3422 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3423 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3425 case SPECIFIER_BOOL:
3426 atomic_type = ATOMIC_TYPE_BOOL;
3428 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3429 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3430 atomic_type = ATOMIC_TYPE_FLOAT;
3432 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3433 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3434 atomic_type = ATOMIC_TYPE_DOUBLE;
3436 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3437 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3438 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3441 /* invalid specifier combination, give an error message */
3442 if (type_specifiers == 0) {
3444 specifiers->type = type_error_type;
3449 if (warning.implicit_int) {
3450 warningf(HERE, "no type specifiers in declaration, using 'int'");
3452 atomic_type = ATOMIC_TYPE_INT;
3455 errorf(HERE, "no type specifiers given in declaration");
3457 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3458 (type_specifiers & SPECIFIER_UNSIGNED)) {
3459 errorf(HERE, "signed and unsigned specifiers given");
3460 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3461 errorf(HERE, "only integer types can be signed or unsigned");
3463 errorf(HERE, "multiple datatypes in declaration");
3465 atomic_type = ATOMIC_TYPE_INVALID;
3468 if (type_specifiers & SPECIFIER_COMPLEX &&
3469 atomic_type != ATOMIC_TYPE_INVALID) {
3470 type = allocate_type_zero(TYPE_COMPLEX, &builtin_source_position);
3471 type->complex.akind = atomic_type;
3472 } else if (type_specifiers & SPECIFIER_IMAGINARY &&
3473 atomic_type != ATOMIC_TYPE_INVALID) {
3474 type = allocate_type_zero(TYPE_IMAGINARY, &builtin_source_position);
3475 type->imaginary.akind = atomic_type;
3477 type = allocate_type_zero(TYPE_ATOMIC, &builtin_source_position);
3478 type->atomic.akind = atomic_type;
3481 } else if (type_specifiers != 0) {
3482 errorf(HERE, "multiple datatypes in declaration");
3485 /* FIXME: check type qualifiers here */
3487 type->base.qualifiers = qualifiers;
3488 type->base.modifiers = modifiers;
3490 type_t *result = typehash_insert(type);
3491 if (newtype && result != type) {
3495 specifiers->type = result;
3500 static type_qualifiers_t parse_type_qualifiers(void)
3502 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3505 switch(token.type) {
3506 /* type qualifiers */
3507 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3508 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3509 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3510 /* microsoft extended type modifiers */
3511 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3512 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3513 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3514 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3515 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3523 static declaration_t *parse_identifier_list(void)
3525 declaration_t *declarations = NULL;
3526 declaration_t *last_declaration = NULL;
3528 declaration_t *const declaration = allocate_declaration_zero();
3529 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3530 declaration->source_position = token.source_position;
3531 declaration->symbol = token.v.symbol;
3534 if (last_declaration != NULL) {
3535 last_declaration->next = declaration;
3537 declarations = declaration;
3539 last_declaration = declaration;
3541 if (token.type != ',') {
3545 } while (token.type == T_IDENTIFIER);
3547 return declarations;
3550 static type_t *automatic_type_conversion(type_t *orig_type);
3552 static void semantic_parameter(declaration_t *declaration)
3554 /* TODO: improve error messages */
3555 source_position_t const* const pos = &declaration->source_position;
3557 switch (declaration->declared_storage_class) {
3558 case STORAGE_CLASS_TYPEDEF:
3559 errorf(pos, "typedef not allowed in parameter list");
3562 /* Allowed storage classes */
3563 case STORAGE_CLASS_NONE:
3564 case STORAGE_CLASS_REGISTER:
3568 errorf(pos, "parameter may only have none or register storage class");
3572 type_t *const orig_type = declaration->type;
3573 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
3574 * sugar. Turn it into a pointer.
3575 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
3576 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
3578 type_t *const type = automatic_type_conversion(orig_type);
3579 declaration->type = type;
3581 if (is_type_incomplete(skip_typeref(type))) {
3582 errorf(pos, "incomplete type '%T' not allowed for parameter '%Y'",
3583 orig_type, declaration->symbol);
3587 static declaration_t *parse_parameter(void)
3589 declaration_specifiers_t specifiers;
3590 memset(&specifiers, 0, sizeof(specifiers));
3592 parse_declaration_specifiers(&specifiers);
3594 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
3599 static declaration_t *parse_parameters(function_type_t *type)
3601 declaration_t *declarations = NULL;
3604 add_anchor_token(')');
3605 int saved_comma_state = save_and_reset_anchor_state(',');
3607 if (token.type == T_IDENTIFIER &&
3608 !is_typedef_symbol(token.v.symbol)) {
3609 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3610 if (la1_type == ',' || la1_type == ')') {
3611 type->kr_style_parameters = true;
3612 declarations = parse_identifier_list();
3613 goto parameters_finished;
3617 if (token.type == ')') {
3618 type->unspecified_parameters = 1;
3619 goto parameters_finished;
3622 declaration_t *declaration;
3623 declaration_t *last_declaration = NULL;
3624 function_parameter_t *parameter;
3625 function_parameter_t *last_parameter = NULL;
3628 switch(token.type) {
3632 goto parameters_finished;
3635 case T___extension__:
3637 declaration = parse_parameter();
3639 /* func(void) is not a parameter */
3640 if (last_parameter == NULL
3641 && token.type == ')'
3642 && declaration->symbol == NULL
3643 && skip_typeref(declaration->type) == type_void) {
3644 goto parameters_finished;
3646 semantic_parameter(declaration);
3648 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
3649 memset(parameter, 0, sizeof(parameter[0]));
3650 parameter->type = declaration->type;
3652 if (last_parameter != NULL) {
3653 last_declaration->next = declaration;
3654 last_parameter->next = parameter;
3656 type->parameters = parameter;
3657 declarations = declaration;
3659 last_parameter = parameter;
3660 last_declaration = declaration;
3664 goto parameters_finished;
3666 if (token.type != ',') {
3667 goto parameters_finished;
3673 parameters_finished:
3674 rem_anchor_token(')');
3677 restore_anchor_state(',', saved_comma_state);
3678 return declarations;
3681 restore_anchor_state(',', saved_comma_state);
3685 typedef enum construct_type_kind_t {
3690 } construct_type_kind_t;
3692 typedef struct construct_type_t construct_type_t;
3693 struct construct_type_t {
3694 construct_type_kind_t kind;
3695 construct_type_t *next;
3698 typedef struct parsed_pointer_t parsed_pointer_t;
3699 struct parsed_pointer_t {
3700 construct_type_t construct_type;
3701 type_qualifiers_t type_qualifiers;
3704 typedef struct construct_function_type_t construct_function_type_t;
3705 struct construct_function_type_t {
3706 construct_type_t construct_type;
3707 type_t *function_type;
3710 typedef struct parsed_array_t parsed_array_t;
3711 struct parsed_array_t {
3712 construct_type_t construct_type;
3713 type_qualifiers_t type_qualifiers;
3719 typedef struct construct_base_type_t construct_base_type_t;
3720 struct construct_base_type_t {
3721 construct_type_t construct_type;
3725 static construct_type_t *parse_pointer_declarator(void)
3729 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3730 memset(pointer, 0, sizeof(pointer[0]));
3731 pointer->construct_type.kind = CONSTRUCT_POINTER;
3732 pointer->type_qualifiers = parse_type_qualifiers();
3734 return (construct_type_t*) pointer;
3737 static construct_type_t *parse_array_declarator(void)
3740 add_anchor_token(']');
3742 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
3743 memset(array, 0, sizeof(array[0]));
3744 array->construct_type.kind = CONSTRUCT_ARRAY;
3746 if (token.type == T_static) {
3747 array->is_static = true;
3751 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3752 if (type_qualifiers != 0) {
3753 if (token.type == T_static) {
3754 array->is_static = true;
3758 array->type_qualifiers = type_qualifiers;
3760 if (token.type == '*' && look_ahead(1)->type == ']') {
3761 array->is_variable = true;
3763 } else if (token.type != ']') {
3764 array->size = parse_assignment_expression();
3767 rem_anchor_token(']');
3770 return (construct_type_t*) array;
3775 static construct_type_t *parse_function_declarator(declaration_t *declaration)
3778 if (declaration != NULL) {
3779 type = allocate_type_zero(TYPE_FUNCTION, &declaration->source_position);
3781 unsigned mask = declaration->modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
3783 if (mask & (mask-1)) {
3784 const char *first = NULL, *second = NULL;
3786 /* more than one calling convention set */
3787 if (declaration->modifiers & DM_CDECL) {
3788 if (first == NULL) first = "cdecl";
3789 else if (second == NULL) second = "cdecl";
3791 if (declaration->modifiers & DM_STDCALL) {
3792 if (first == NULL) first = "stdcall";
3793 else if (second == NULL) second = "stdcall";
3795 if (declaration->modifiers & DM_FASTCALL) {
3796 if (first == NULL) first = "fastcall";
3797 else if (second == NULL) second = "fastcall";
3799 if (declaration->modifiers & DM_THISCALL) {
3800 if (first == NULL) first = "thiscall";
3801 else if (second == NULL) second = "thiscall";
3803 errorf(&declaration->source_position, "%s and %s attributes are not compatible", first, second);
3806 if (declaration->modifiers & DM_CDECL)
3807 type->function.calling_convention = CC_CDECL;
3808 else if (declaration->modifiers & DM_STDCALL)
3809 type->function.calling_convention = CC_STDCALL;
3810 else if (declaration->modifiers & DM_FASTCALL)
3811 type->function.calling_convention = CC_FASTCALL;
3812 else if (declaration->modifiers & DM_THISCALL)
3813 type->function.calling_convention = CC_THISCALL;
3815 type = allocate_type_zero(TYPE_FUNCTION, HERE);
3818 declaration_t *parameters = parse_parameters(&type->function);
3819 if (declaration != NULL) {
3820 declaration->scope.declarations = parameters;
3823 construct_function_type_t *construct_function_type =
3824 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
3825 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
3826 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
3827 construct_function_type->function_type = type;
3829 return &construct_function_type->construct_type;
3832 static void fix_declaration_type(declaration_t *declaration)
3834 decl_modifiers_t declaration_modifiers = declaration->modifiers;
3835 type_modifiers_t type_modifiers = declaration->type->base.modifiers;
3837 if (declaration_modifiers & DM_TRANSPARENT_UNION)
3838 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3840 if (declaration->type->base.modifiers == type_modifiers)
3843 type_t *copy = duplicate_type(declaration->type);
3844 copy->base.modifiers = type_modifiers;
3846 type_t *result = typehash_insert(copy);
3847 if (result != copy) {
3848 obstack_free(type_obst, copy);
3851 declaration->type = result;
3854 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
3855 bool may_be_abstract)
3857 /* construct a single linked list of construct_type_t's which describe
3858 * how to construct the final declarator type */
3859 construct_type_t *first = NULL;
3860 construct_type_t *last = NULL;
3861 gnu_attribute_t *attributes = NULL;
3863 decl_modifiers_t modifiers = parse_attributes(&attributes);
3866 while (token.type == '*') {
3867 construct_type_t *type = parse_pointer_declarator();
3877 /* TODO: find out if this is correct */
3878 modifiers |= parse_attributes(&attributes);
3881 if (declaration != NULL)
3882 declaration->modifiers |= modifiers;
3884 construct_type_t *inner_types = NULL;
3886 switch(token.type) {
3888 if (declaration == NULL) {
3889 errorf(HERE, "no identifier expected in typename");
3891 declaration->symbol = token.v.symbol;
3892 declaration->source_position = token.source_position;
3898 add_anchor_token(')');
3899 inner_types = parse_inner_declarator(declaration, may_be_abstract);
3900 /* All later declarators only modify the return type, not declaration */
3902 rem_anchor_token(')');
3906 if (may_be_abstract)
3908 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3909 /* avoid a loop in the outermost scope, because eat_statement doesn't
3911 if (token.type == '}' && current_function == NULL) {
3919 construct_type_t *p = last;
3922 construct_type_t *type;
3923 switch(token.type) {
3925 type = parse_function_declarator(declaration);
3928 type = parse_array_declarator();
3931 goto declarator_finished;
3934 /* insert in the middle of the list (behind p) */
3936 type->next = p->next;
3947 declarator_finished:
3948 /* append inner_types at the end of the list, we don't to set last anymore
3949 * as it's not needed anymore */
3951 assert(first == NULL);
3952 first = inner_types;
3954 last->next = inner_types;
3962 static void parse_declaration_attributes(declaration_t *declaration)
3964 gnu_attribute_t *attributes = NULL;
3965 decl_modifiers_t modifiers = parse_attributes(&attributes);
3967 if (declaration == NULL)
3970 declaration->modifiers |= modifiers;
3971 /* check if we have these stupid mode attributes... */
3972 type_t *old_type = declaration->type;
3973 if (old_type == NULL)
3976 gnu_attribute_t *attribute = attributes;
3977 for ( ; attribute != NULL; attribute = attribute->next) {
3978 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
3981 atomic_type_kind_t akind = attribute->u.akind;
3982 if (!is_type_signed(old_type)) {
3984 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
3985 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
3986 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
3987 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
3989 panic("invalid akind in mode attribute");
3993 = make_atomic_type(akind, old_type->base.qualifiers);
3997 static type_t *construct_declarator_type(construct_type_t *construct_list,
4000 construct_type_t *iter = construct_list;
4001 for( ; iter != NULL; iter = iter->next) {
4002 switch(iter->kind) {
4003 case CONSTRUCT_INVALID:
4004 internal_errorf(HERE, "invalid type construction found");
4005 case CONSTRUCT_FUNCTION: {
4006 construct_function_type_t *construct_function_type
4007 = (construct_function_type_t*) iter;
4009 type_t *function_type = construct_function_type->function_type;
4011 function_type->function.return_type = type;
4013 type_t *skipped_return_type = skip_typeref(type);
4014 if (is_type_function(skipped_return_type)) {
4015 errorf(HERE, "function returning function is not allowed");
4016 type = type_error_type;
4017 } else if (is_type_array(skipped_return_type)) {
4018 errorf(HERE, "function returning array is not allowed");
4019 type = type_error_type;
4021 type = function_type;
4026 case CONSTRUCT_POINTER: {
4027 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4028 type_t *pointer_type = allocate_type_zero(TYPE_POINTER, &null_position);
4029 pointer_type->pointer.points_to = type;
4030 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
4032 type = pointer_type;
4036 case CONSTRUCT_ARRAY: {
4037 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4038 type_t *array_type = allocate_type_zero(TYPE_ARRAY, &null_position);
4040 expression_t *size_expression = parsed_array->size;
4041 if (size_expression != NULL) {
4043 = create_implicit_cast(size_expression, type_size_t);
4046 array_type->base.qualifiers = parsed_array->type_qualifiers;
4047 array_type->array.element_type = type;
4048 array_type->array.is_static = parsed_array->is_static;
4049 array_type->array.is_variable = parsed_array->is_variable;
4050 array_type->array.size_expression = size_expression;
4052 if (size_expression != NULL) {
4053 if (is_constant_expression(size_expression)) {
4054 array_type->array.size_constant = true;
4055 array_type->array.size
4056 = fold_constant(size_expression);
4058 array_type->array.is_vla = true;
4062 type_t *skipped_type = skip_typeref(type);
4063 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
4064 errorf(HERE, "array of void is not allowed");
4065 type = type_error_type;
4073 type_t *hashed_type = typehash_insert(type);
4074 if (hashed_type != type) {
4075 /* the function type was constructed earlier freeing it here will
4076 * destroy other types... */
4077 if (iter->kind != CONSTRUCT_FUNCTION) {
4087 static declaration_t *parse_declarator(
4088 const declaration_specifiers_t *specifiers, bool may_be_abstract)
4090 declaration_t *const declaration = allocate_declaration_zero();
4091 declaration->source_position = specifiers->source_position;
4092 declaration->declared_storage_class = specifiers->declared_storage_class;
4093 declaration->modifiers = specifiers->modifiers;
4094 declaration->deprecated_string = specifiers->deprecated_string;
4095 declaration->get_property_sym = specifiers->get_property_sym;
4096 declaration->put_property_sym = specifiers->put_property_sym;
4097 declaration->is_inline = specifiers->is_inline;
4099 declaration->storage_class = specifiers->declared_storage_class;
4100 if (declaration->storage_class == STORAGE_CLASS_NONE
4101 && scope != global_scope) {
4102 declaration->storage_class = STORAGE_CLASS_AUTO;
4105 if (specifiers->alignment != 0) {
4106 /* TODO: add checks here */
4107 declaration->alignment = specifiers->alignment;
4110 construct_type_t *construct_type
4111 = parse_inner_declarator(declaration, may_be_abstract);
4112 type_t *const type = specifiers->type;
4113 declaration->type = construct_declarator_type(construct_type, type);
4115 parse_declaration_attributes(declaration);
4117 fix_declaration_type(declaration);
4119 if (construct_type != NULL) {
4120 obstack_free(&temp_obst, construct_type);
4126 static type_t *parse_abstract_declarator(type_t *base_type)
4128 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4130 type_t *result = construct_declarator_type(construct_type, base_type);
4131 if (construct_type != NULL) {
4132 obstack_free(&temp_obst, construct_type);
4138 static declaration_t *append_declaration(declaration_t* const declaration)
4140 if (last_declaration != NULL) {
4141 last_declaration->next = declaration;
4143 scope->declarations = declaration;
4145 last_declaration = declaration;
4150 * Check if the declaration of main is suspicious. main should be a
4151 * function with external linkage, returning int, taking either zero
4152 * arguments, two, or three arguments of appropriate types, ie.
4154 * int main([ int argc, char **argv [, char **env ] ]).
4156 * @param decl the declaration to check
4157 * @param type the function type of the declaration
4159 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
4161 if (decl->storage_class == STORAGE_CLASS_STATIC) {
4162 warningf(&decl->source_position,
4163 "'main' is normally a non-static function");
4165 if (skip_typeref(func_type->return_type) != type_int) {
4166 warningf(&decl->source_position,
4167 "return type of 'main' should be 'int', but is '%T'",
4168 func_type->return_type);
4170 const function_parameter_t *parm = func_type->parameters;
4172 type_t *const first_type = parm->type;
4173 if (!types_compatible(skip_typeref(first_type), type_int)) {
4174 warningf(&decl->source_position,
4175 "first argument of 'main' should be 'int', but is '%T'", first_type);
4179 type_t *const second_type = parm->type;
4180 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4181 warningf(&decl->source_position,
4182 "second argument of 'main' should be 'char**', but is '%T'", second_type);
4186 type_t *const third_type = parm->type;
4187 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4188 warningf(&decl->source_position,
4189 "third argument of 'main' should be 'char**', but is '%T'", third_type);
4193 goto warn_arg_count;
4197 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
4203 * Check if a symbol is the equal to "main".
4205 static bool is_sym_main(const symbol_t *const sym)
4207 return strcmp(sym->string, "main") == 0;
4210 static declaration_t *record_declaration(
4211 declaration_t *const declaration,
4212 const bool is_definition)
4214 const symbol_t *const symbol = declaration->symbol;
4215 const namespace_t namespc = (namespace_t)declaration->namespc;
4217 assert(symbol != NULL);
4218 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4220 type_t *const orig_type = declaration->type;
4221 type_t *const type = skip_typeref(orig_type);
4222 if (is_type_function(type) &&
4223 type->function.unspecified_parameters &&
4224 warning.strict_prototypes &&
4225 previous_declaration == NULL) {
4226 warningf(&declaration->source_position,
4227 "function declaration '%#T' is not a prototype",
4228 orig_type, declaration->symbol);
4231 if (warning.main && is_type_function(type) && is_sym_main(symbol)) {
4232 check_type_of_main(declaration, &type->function);
4235 if (warning.nested_externs &&
4236 declaration->storage_class == STORAGE_CLASS_EXTERN &&
4237 scope != global_scope) {
4238 warningf(&declaration->source_position,
4239 "nested extern declaration of '%#T'", declaration->type, symbol);
4242 assert(declaration != previous_declaration);
4243 if (previous_declaration != NULL
4244 && previous_declaration->parent_scope == scope) {
4245 /* can happen for K&R style declarations */
4246 if (previous_declaration->type == NULL) {
4247 previous_declaration->type = declaration->type;
4250 const type_t *prev_type = skip_typeref(previous_declaration->type);
4251 if (!types_compatible(type, prev_type)) {
4252 errorf(&declaration->source_position,
4253 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4254 orig_type, symbol, previous_declaration->type, symbol,
4255 &previous_declaration->source_position);
4257 unsigned old_storage_class = previous_declaration->storage_class;
4258 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
4259 errorf(&declaration->source_position,
4260 "redeclaration of enum entry '%Y' (declared %P)",
4261 symbol, &previous_declaration->source_position);
4262 return previous_declaration;
4265 if (warning.redundant_decls &&
4267 previous_declaration->storage_class == STORAGE_CLASS_STATIC &&
4268 !(previous_declaration->modifiers & DM_USED) &&
4269 !previous_declaration->used) {
4270 warningf(&previous_declaration->source_position,
4271 "unnecessary static forward declaration for '%#T'",
4272 previous_declaration->type, symbol);
4275 unsigned new_storage_class = declaration->storage_class;
4277 if (is_type_incomplete(prev_type)) {
4278 previous_declaration->type = type;
4282 /* pretend no storage class means extern for function
4283 * declarations (except if the previous declaration is neither
4284 * none nor extern) */
4285 if (is_type_function(type)) {
4286 if (prev_type->function.unspecified_parameters) {
4287 previous_declaration->type = type;
4291 switch (old_storage_class) {
4292 case STORAGE_CLASS_NONE:
4293 old_storage_class = STORAGE_CLASS_EXTERN;
4296 case STORAGE_CLASS_EXTERN:
4297 if (is_definition) {
4298 if (warning.missing_prototypes &&
4299 prev_type->function.unspecified_parameters &&
4300 !is_sym_main(symbol)) {
4301 warningf(&declaration->source_position,
4302 "no previous prototype for '%#T'",
4305 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4306 new_storage_class = STORAGE_CLASS_EXTERN;
4315 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4316 new_storage_class == STORAGE_CLASS_EXTERN) {
4317 warn_redundant_declaration:
4318 if (!is_definition &&
4319 warning.redundant_decls &&
4320 strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
4321 warningf(&declaration->source_position,
4322 "redundant declaration for '%Y' (declared %P)",
4323 symbol, &previous_declaration->source_position);
4325 } else if (current_function == NULL) {
4326 if (old_storage_class != STORAGE_CLASS_STATIC &&
4327 new_storage_class == STORAGE_CLASS_STATIC) {
4328 errorf(&declaration->source_position,
4329 "static declaration of '%Y' follows non-static declaration (declared %P)",
4330 symbol, &previous_declaration->source_position);
4331 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4332 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4333 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4335 goto warn_redundant_declaration;
4337 } else if (old_storage_class == new_storage_class) {
4338 errorf(&declaration->source_position,
4339 "redeclaration of '%Y' (declared %P)",
4340 symbol, &previous_declaration->source_position);
4342 errorf(&declaration->source_position,
4343 "redeclaration of '%Y' with different linkage (declared %P)",
4344 symbol, &previous_declaration->source_position);
4348 previous_declaration->modifiers |= declaration->modifiers;
4349 previous_declaration->is_inline |= declaration->is_inline;
4350 return previous_declaration;
4351 } else if (is_type_function(type)) {
4352 if (is_definition &&
4353 declaration->storage_class != STORAGE_CLASS_STATIC) {
4354 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4355 warningf(&declaration->source_position,
4356 "no previous prototype for '%#T'", orig_type, symbol);
4357 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4358 warningf(&declaration->source_position,
4359 "no previous declaration for '%#T'", orig_type,
4364 if (warning.missing_declarations &&
4365 scope == global_scope && (
4366 declaration->storage_class == STORAGE_CLASS_NONE ||
4367 declaration->storage_class == STORAGE_CLASS_THREAD
4369 warningf(&declaration->source_position,
4370 "no previous declaration for '%#T'", orig_type, symbol);
4374 assert(declaration->parent_scope == NULL);
4375 assert(scope != NULL);
4377 declaration->parent_scope = scope;
4379 environment_push(declaration);
4380 return append_declaration(declaration);
4383 static void parser_error_multiple_definition(declaration_t *declaration,
4384 const source_position_t *source_position)
4386 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4387 declaration->symbol, &declaration->source_position);
4390 static bool is_declaration_specifier(const token_t *token,
4391 bool only_specifiers_qualifiers)
4393 switch(token->type) {
4398 return is_typedef_symbol(token->v.symbol);
4400 case T___extension__:
4402 return !only_specifiers_qualifiers;
4409 static void parse_init_declarator_rest(declaration_t *declaration)
4413 type_t *orig_type = declaration->type;
4414 type_t *type = skip_typeref(orig_type);
4416 if (declaration->init.initializer != NULL) {
4417 parser_error_multiple_definition(declaration, HERE);
4420 bool must_be_constant = false;
4421 if (declaration->storage_class == STORAGE_CLASS_STATIC
4422 || declaration->storage_class == STORAGE_CLASS_THREAD_STATIC
4423 || declaration->parent_scope == global_scope) {
4424 must_be_constant = true;
4427 if (is_type_function(type)) {
4428 errorf(&declaration->source_position,
4429 "function %#T is initialized like a variable",
4430 orig_type, declaration->symbol);
4431 orig_type = type_error_type;
4434 parse_initializer_env_t env;
4435 env.type = orig_type;
4436 env.must_be_constant = must_be_constant;
4437 env.declaration = current_init_decl = declaration;
4439 initializer_t *initializer = parse_initializer(&env);
4440 current_init_decl = NULL;
4442 if (!is_type_function(type)) {
4443 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
4444 * the array type size */
4445 declaration->type = env.type;
4446 declaration->init.initializer = initializer;
4450 /* parse rest of a declaration without any declarator */
4451 static void parse_anonymous_declaration_rest(
4452 const declaration_specifiers_t *specifiers)
4456 declaration_t *const declaration = allocate_declaration_zero();
4457 declaration->type = specifiers->type;
4458 declaration->declared_storage_class = specifiers->declared_storage_class;
4459 declaration->source_position = specifiers->source_position;
4460 declaration->modifiers = specifiers->modifiers;
4462 if (declaration->declared_storage_class != STORAGE_CLASS_NONE) {
4463 warningf(&declaration->source_position,
4464 "useless storage class in empty declaration");
4466 declaration->storage_class = STORAGE_CLASS_NONE;
4468 type_t *type = declaration->type;
4469 switch (type->kind) {
4470 case TYPE_COMPOUND_STRUCT:
4471 case TYPE_COMPOUND_UNION: {
4472 if (type->compound.declaration->symbol == NULL) {
4473 warningf(&declaration->source_position,
4474 "unnamed struct/union that defines no instances");
4483 warningf(&declaration->source_position, "empty declaration");
4487 append_declaration(declaration);
4490 static void parse_declaration_rest(declaration_t *ndeclaration,
4491 const declaration_specifiers_t *specifiers,
4492 parsed_declaration_func finished_declaration)
4494 add_anchor_token(';');
4495 add_anchor_token('=');
4496 add_anchor_token(',');
4498 declaration_t *declaration =
4499 finished_declaration(ndeclaration, token.type == '=');
4501 type_t *orig_type = declaration->type;
4502 type_t *type = skip_typeref(orig_type);
4504 if (type->kind != TYPE_FUNCTION &&
4505 declaration->is_inline &&
4506 is_type_valid(type)) {
4507 warningf(&declaration->source_position,
4508 "variable '%Y' declared 'inline'\n", declaration->symbol);
4511 if (token.type == '=') {
4512 parse_init_declarator_rest(declaration);
4515 if (token.type != ',')
4519 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4524 rem_anchor_token(';');
4525 rem_anchor_token('=');
4526 rem_anchor_token(',');
4529 static declaration_t *finished_kr_declaration(declaration_t *declaration, bool is_definition)
4531 symbol_t *symbol = declaration->symbol;
4532 if (symbol == NULL) {
4533 errorf(HERE, "anonymous declaration not valid as function parameter");
4536 namespace_t namespc = (namespace_t) declaration->namespc;
4537 if (namespc != NAMESPACE_NORMAL) {
4538 return record_declaration(declaration, false);
4541 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4542 if (previous_declaration == NULL ||
4543 previous_declaration->parent_scope != scope) {
4544 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4549 if (is_definition) {
4550 errorf(HERE, "parameter %Y is initialised", declaration->symbol);
4553 if (previous_declaration->type == NULL) {
4554 previous_declaration->type = declaration->type;
4555 previous_declaration->declared_storage_class = declaration->declared_storage_class;
4556 previous_declaration->storage_class = declaration->storage_class;
4557 previous_declaration->parent_scope = scope;
4558 return previous_declaration;
4560 return record_declaration(declaration, false);
4564 static void parse_declaration(parsed_declaration_func finished_declaration)
4566 declaration_specifiers_t specifiers;
4567 memset(&specifiers, 0, sizeof(specifiers));
4568 parse_declaration_specifiers(&specifiers);
4570 if (token.type == ';') {
4571 parse_anonymous_declaration_rest(&specifiers);
4573 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4574 parse_declaration_rest(declaration, &specifiers, finished_declaration);
4578 static type_t *get_default_promoted_type(type_t *orig_type)
4580 type_t *result = orig_type;
4582 type_t *type = skip_typeref(orig_type);
4583 if (is_type_integer(type)) {
4584 result = promote_integer(type);
4585 } else if (type == type_float) {
4586 result = type_double;
4592 static void parse_kr_declaration_list(declaration_t *declaration)
4594 type_t *type = skip_typeref(declaration->type);
4595 if (!is_type_function(type))
4598 if (!type->function.kr_style_parameters)
4601 /* push function parameters */
4602 int top = environment_top();
4603 scope_t *last_scope = scope;
4604 set_scope(&declaration->scope);
4606 declaration_t *parameter = declaration->scope.declarations;
4607 for ( ; parameter != NULL; parameter = parameter->next) {
4608 assert(parameter->parent_scope == NULL);
4609 parameter->parent_scope = scope;
4610 environment_push(parameter);
4613 /* parse declaration list */
4614 while (is_declaration_specifier(&token, false)) {
4615 parse_declaration(finished_kr_declaration);
4618 /* pop function parameters */
4619 assert(scope == &declaration->scope);
4620 set_scope(last_scope);
4621 environment_pop_to(top);
4623 /* update function type */
4624 type_t *new_type = duplicate_type(type);
4626 function_parameter_t *parameters = NULL;
4627 function_parameter_t *last_parameter = NULL;
4629 declaration_t *parameter_declaration = declaration->scope.declarations;
4630 for( ; parameter_declaration != NULL;
4631 parameter_declaration = parameter_declaration->next) {
4632 type_t *parameter_type = parameter_declaration->type;
4633 if (parameter_type == NULL) {
4635 errorf(HERE, "no type specified for function parameter '%Y'",
4636 parameter_declaration->symbol);
4638 if (warning.implicit_int) {
4639 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4640 parameter_declaration->symbol);
4642 parameter_type = type_int;
4643 parameter_declaration->type = parameter_type;
4647 semantic_parameter(parameter_declaration);
4648 parameter_type = parameter_declaration->type;
4651 * we need the default promoted types for the function type
4653 parameter_type = get_default_promoted_type(parameter_type);
4655 function_parameter_t *function_parameter
4656 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
4657 memset(function_parameter, 0, sizeof(function_parameter[0]));
4659 function_parameter->type = parameter_type;
4660 if (last_parameter != NULL) {
4661 last_parameter->next = function_parameter;
4663 parameters = function_parameter;
4665 last_parameter = function_parameter;
4668 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
4670 new_type->function.parameters = parameters;
4671 new_type->function.unspecified_parameters = true;
4673 type = typehash_insert(new_type);
4674 if (type != new_type) {
4675 obstack_free(type_obst, new_type);
4678 declaration->type = type;
4681 static bool first_err = true;
4684 * When called with first_err set, prints the name of the current function,
4687 static void print_in_function(void)
4691 diagnosticf("%s: In function '%Y':\n",
4692 current_function->source_position.input_name,
4693 current_function->symbol);
4698 * Check if all labels are defined in the current function.
4699 * Check if all labels are used in the current function.
4701 static void check_labels(void)
4703 for (const goto_statement_t *goto_statement = goto_first;
4704 goto_statement != NULL;
4705 goto_statement = goto_statement->next) {
4706 declaration_t *label = goto_statement->label;
4709 if (label->source_position.input_name == NULL) {
4710 print_in_function();
4711 errorf(&goto_statement->base.source_position,
4712 "label '%Y' used but not defined", label->symbol);
4715 goto_first = goto_last = NULL;
4717 if (warning.unused_label) {
4718 for (const label_statement_t *label_statement = label_first;
4719 label_statement != NULL;
4720 label_statement = label_statement->next) {
4721 const declaration_t *label = label_statement->label;
4723 if (! label->used) {
4724 print_in_function();
4725 warningf(&label_statement->base.source_position,
4726 "label '%Y' defined but not used", label->symbol);
4730 label_first = label_last = NULL;
4734 * Check declarations of current_function for unused entities.
4736 static void check_declarations(void)
4738 if (warning.unused_parameter) {
4739 const scope_t *scope = ¤t_function->scope;
4741 if (is_sym_main(current_function->symbol)) {
4742 /* do not issue unused warnings for main */
4745 const declaration_t *parameter = scope->declarations;
4746 for (; parameter != NULL; parameter = parameter->next) {
4747 if (! parameter->used) {
4748 print_in_function();
4749 warningf(¶meter->source_position,
4750 "unused parameter '%Y'", parameter->symbol);
4754 if (warning.unused_variable) {
4758 static int determine_truth(expression_t const* const cond)
4761 !is_constant_expression(cond) ? 0 :
4762 fold_constant(cond) != 0 ? 1 :
4766 static bool noreturn_candidate;
4768 static void check_reachable(statement_t *const stmt)
4770 if (stmt->base.reachable)
4772 if (stmt->kind != STATEMENT_DO_WHILE)
4773 stmt->base.reachable = true;
4775 statement_t *last = stmt;
4777 switch (stmt->kind) {
4778 case STATEMENT_INVALID:
4779 case STATEMENT_EMPTY:
4780 case STATEMENT_DECLARATION:
4782 next = stmt->base.next;
4785 case STATEMENT_COMPOUND:
4786 next = stmt->compound.statements;
4789 case STATEMENT_RETURN:
4790 noreturn_candidate = false;
4793 case STATEMENT_IF: {
4794 if_statement_t const* const ifs = &stmt->ifs;
4795 int const val = determine_truth(ifs->condition);
4798 check_reachable(ifs->true_statement);
4803 if (ifs->false_statement != NULL) {
4804 check_reachable(ifs->false_statement);
4808 next = stmt->base.next;
4812 case STATEMENT_SWITCH: {
4813 switch_statement_t const *const switchs = &stmt->switchs;
4814 expression_t const *const expr = switchs->expression;
4816 if (is_constant_expression(expr)) {
4817 long const val = fold_constant(expr);
4818 case_label_statement_t * defaults = NULL;
4819 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4820 if (i->expression == NULL) {
4825 if (i->first_case <= val && val <= i->last_case) {
4826 check_reachable((statement_t*)i);
4831 if (defaults != NULL) {
4832 check_reachable((statement_t*)defaults);
4836 bool has_default = false;
4837 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4838 if (i->expression == NULL)
4841 check_reachable((statement_t*)i);
4848 next = stmt->base.next;
4852 case STATEMENT_EXPRESSION: {
4853 /* Check for noreturn function call */
4854 expression_t const *const expr = stmt->expression.expression;
4855 if (expr->kind == EXPR_CALL) {
4856 expression_t const *const func = expr->call.function;
4857 if (func->kind == EXPR_REFERENCE) {
4858 declaration_t const *const decl = func->reference.declaration;
4859 if (decl != NULL && decl->modifiers & DM_NORETURN) {
4865 next = stmt->base.next;
4869 case STATEMENT_CONTINUE: {
4870 statement_t *parent = stmt;
4872 parent = parent->base.parent;
4873 if (parent == NULL) /* continue not within loop */
4877 switch (parent->kind) {
4878 case STATEMENT_WHILE: goto continue_while;
4879 case STATEMENT_DO_WHILE: goto continue_do_while;
4880 case STATEMENT_FOR: goto continue_for;
4887 case STATEMENT_BREAK: {
4888 statement_t *parent = stmt;
4890 parent = parent->base.parent;
4891 if (parent == NULL) /* break not within loop/switch */
4894 switch (parent->kind) {
4895 case STATEMENT_SWITCH:
4896 case STATEMENT_WHILE:
4897 case STATEMENT_DO_WHILE:
4900 next = parent->base.next;
4901 goto found_break_parent;
4910 case STATEMENT_GOTO:
4911 next = stmt->gotos.label->init.statement;
4912 if (next == NULL) /* missing label */
4916 case STATEMENT_LABEL:
4917 next = stmt->label.statement;
4920 case STATEMENT_CASE_LABEL:
4921 next = stmt->case_label.statement;
4924 case STATEMENT_WHILE: {
4925 while_statement_t const *const whiles = &stmt->whiles;
4926 int const val = determine_truth(whiles->condition);
4929 check_reachable(whiles->body);
4934 next = stmt->base.next;
4938 case STATEMENT_DO_WHILE:
4939 next = stmt->do_while.body;
4942 case STATEMENT_FOR: {
4943 for_statement_t *const fors = &stmt->fors;
4945 if (fors->condition_reachable)
4947 fors->condition_reachable = true;
4949 expression_t const *const cond = fors->condition;
4951 cond == NULL ? 1 : determine_truth(cond);
4954 check_reachable(fors->body);
4959 next = stmt->base.next;
4963 case STATEMENT_MS_TRY: {
4964 ms_try_statement_t const *const ms_try = &stmt->ms_try;
4965 check_reachable(ms_try->try_statement);
4966 next = ms_try->final_statement;
4970 case STATEMENT_LEAVE: {
4971 statement_t *parent = stmt;
4973 parent = parent->base.parent;
4974 if (parent == NULL) /* __leave not within __try */
4977 if (parent->kind == STATEMENT_MS_TRY) {
4979 next = parent->ms_try.final_statement;
4987 while (next == NULL) {
4988 next = last->base.parent;
4990 noreturn_candidate = false;
4992 type_t *const type = current_function->type;
4993 assert(is_type_function(type));
4994 type_t *const ret = skip_typeref(type->function.return_type);
4995 if (warning.return_type &&
4996 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
4997 is_type_valid(ret) &&
4998 !is_sym_main(current_function->symbol)) {
4999 warningf(&stmt->base.source_position,
5000 "control reaches end of non-void function");
5005 switch (next->kind) {
5006 case STATEMENT_INVALID:
5007 case STATEMENT_EMPTY:
5008 case STATEMENT_DECLARATION:
5009 case STATEMENT_EXPRESSION:
5011 case STATEMENT_RETURN:
5012 case STATEMENT_CONTINUE:
5013 case STATEMENT_BREAK:
5014 case STATEMENT_GOTO:
5015 case STATEMENT_LEAVE:
5016 panic("invalid control flow in function");
5018 case STATEMENT_COMPOUND:
5020 case STATEMENT_SWITCH:
5021 case STATEMENT_LABEL:
5022 case STATEMENT_CASE_LABEL:
5024 next = next->base.next;
5027 case STATEMENT_WHILE: {
5029 if (next->base.reachable)
5031 next->base.reachable = true;
5033 while_statement_t const *const whiles = &next->whiles;
5034 int const val = determine_truth(whiles->condition);
5037 check_reachable(whiles->body);
5043 next = next->base.next;
5047 case STATEMENT_DO_WHILE: {
5049 if (next->base.reachable)
5051 next->base.reachable = true;
5053 do_while_statement_t const *const dw = &next->do_while;
5054 int const val = determine_truth(dw->condition);
5057 check_reachable(dw->body);
5063 next = next->base.next;
5067 case STATEMENT_FOR: {
5069 for_statement_t *const fors = &next->fors;
5071 fors->step_reachable = true;
5073 if (fors->condition_reachable)
5075 fors->condition_reachable = true;
5077 expression_t const *const cond = fors->condition;
5079 cond == NULL ? 1 : determine_truth(cond);
5082 check_reachable(fors->body);
5088 next = next->base.next;
5092 case STATEMENT_MS_TRY:
5094 next = next->ms_try.final_statement;
5100 next = stmt->base.parent;
5102 warningf(&stmt->base.source_position,
5103 "control reaches end of non-void function");
5107 check_reachable(next);
5110 static void check_unreachable(statement_t const* const stmt)
5112 if (!stmt->base.reachable &&
5113 stmt->kind != STATEMENT_DO_WHILE &&
5114 stmt->kind != STATEMENT_FOR &&
5115 (stmt->kind != STATEMENT_COMPOUND || stmt->compound.statements == NULL)) {
5116 warningf(&stmt->base.source_position, "statement is unreachable");
5119 switch (stmt->kind) {
5120 case STATEMENT_INVALID:
5121 case STATEMENT_EMPTY:
5122 case STATEMENT_RETURN:
5123 case STATEMENT_DECLARATION:
5124 case STATEMENT_EXPRESSION:
5125 case STATEMENT_CONTINUE:
5126 case STATEMENT_BREAK:
5127 case STATEMENT_GOTO:
5129 case STATEMENT_LEAVE:
5132 case STATEMENT_COMPOUND:
5133 if (stmt->compound.statements)
5134 check_unreachable(stmt->compound.statements);
5138 check_unreachable(stmt->ifs.true_statement);
5139 if (stmt->ifs.false_statement != NULL)
5140 check_unreachable(stmt->ifs.false_statement);
5143 case STATEMENT_SWITCH:
5144 check_unreachable(stmt->switchs.body);
5147 case STATEMENT_LABEL:
5148 check_unreachable(stmt->label.statement);
5151 case STATEMENT_CASE_LABEL:
5152 check_unreachable(stmt->case_label.statement);
5155 case STATEMENT_WHILE:
5156 check_unreachable(stmt->whiles.body);
5159 case STATEMENT_DO_WHILE:
5160 check_unreachable(stmt->do_while.body);
5161 if (!stmt->base.reachable) {
5162 expression_t const *const cond = stmt->do_while.condition;
5163 if (determine_truth(cond) >= 0) {
5164 warningf(&cond->base.source_position,
5165 "condition of do-while-loop is unreachable");
5170 case STATEMENT_FOR: {
5171 for_statement_t const* const fors = &stmt->fors;
5173 // if init and step are unreachable, cond is unreachable, too
5174 if (!stmt->base.reachable && !fors->step_reachable) {
5175 warningf(&stmt->base.source_position, "statement is unreachable");
5177 if (!stmt->base.reachable && fors->initialisation != NULL) {
5178 warningf(&fors->initialisation->base.source_position,
5179 "initialisation of for-statement is unreachable");
5182 if (!fors->condition_reachable && fors->condition != NULL) {
5183 warningf(&fors->condition->base.source_position,
5184 "condition of for-statement is unreachable");
5187 if (!fors->step_reachable && fors->step != NULL) {
5188 warningf(&fors->step->base.source_position,
5189 "step of for-statement is unreachable");
5193 check_unreachable(fors->body);
5197 case STATEMENT_MS_TRY: {
5198 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5199 check_unreachable(ms_try->try_statement);
5200 check_unreachable(ms_try->final_statement);
5204 if (stmt->base.next)
5205 check_unreachable(stmt->base.next);
5208 static void parse_external_declaration(void)
5210 /* function-definitions and declarations both start with declaration
5212 declaration_specifiers_t specifiers;
5213 memset(&specifiers, 0, sizeof(specifiers));
5215 add_anchor_token(';');
5216 parse_declaration_specifiers(&specifiers);
5217 rem_anchor_token(';');
5219 /* must be a declaration */
5220 if (token.type == ';') {
5221 parse_anonymous_declaration_rest(&specifiers);
5225 add_anchor_token(',');
5226 add_anchor_token('=');
5227 rem_anchor_token(';');
5229 /* declarator is common to both function-definitions and declarations */
5230 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5232 rem_anchor_token(',');
5233 rem_anchor_token('=');
5234 rem_anchor_token(';');
5236 /* must be a declaration */
5237 switch (token.type) {
5241 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
5245 /* must be a function definition */
5246 parse_kr_declaration_list(ndeclaration);
5248 if (token.type != '{') {
5249 parse_error_expected("while parsing function definition", '{', NULL);
5250 eat_until_matching_token(';');
5254 type_t *type = ndeclaration->type;
5256 /* note that we don't skip typerefs: the standard doesn't allow them here
5257 * (so we can't use is_type_function here) */
5258 if (type->kind != TYPE_FUNCTION) {
5259 if (is_type_valid(type)) {
5260 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5261 type, ndeclaration->symbol);
5267 if (warning.aggregate_return &&
5268 is_type_compound(skip_typeref(type->function.return_type))) {
5269 warningf(HERE, "function '%Y' returns an aggregate",
5270 ndeclaration->symbol);
5272 if (warning.traditional && !type->function.unspecified_parameters) {
5273 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5274 ndeclaration->symbol);
5276 if (warning.old_style_definition && type->function.unspecified_parameters) {
5277 warningf(HERE, "old-style function definition '%Y'",
5278 ndeclaration->symbol);
5281 /* § 6.7.5.3 (14) a function definition with () means no
5282 * parameters (and not unspecified parameters) */
5283 if (type->function.unspecified_parameters
5284 && type->function.parameters == NULL
5285 && !type->function.kr_style_parameters) {
5286 type_t *duplicate = duplicate_type(type);
5287 duplicate->function.unspecified_parameters = false;
5289 type = typehash_insert(duplicate);
5290 if (type != duplicate) {
5291 obstack_free(type_obst, duplicate);
5293 ndeclaration->type = type;
5296 declaration_t *const declaration = record_declaration(ndeclaration, true);
5297 if (ndeclaration != declaration) {
5298 declaration->scope = ndeclaration->scope;
5300 type = skip_typeref(declaration->type);
5302 /* push function parameters and switch scope */
5303 int top = environment_top();
5304 scope_t *last_scope = scope;
5305 set_scope(&declaration->scope);
5307 declaration_t *parameter = declaration->scope.declarations;
5308 for( ; parameter != NULL; parameter = parameter->next) {
5309 if (parameter->parent_scope == &ndeclaration->scope) {
5310 parameter->parent_scope = scope;
5312 assert(parameter->parent_scope == NULL
5313 || parameter->parent_scope == scope);
5314 parameter->parent_scope = scope;
5315 if (parameter->symbol == NULL) {
5316 errorf(¶meter->source_position, "parameter name omitted");
5319 environment_push(parameter);
5322 if (declaration->init.statement != NULL) {
5323 parser_error_multiple_definition(declaration, HERE);
5326 /* parse function body */
5327 int label_stack_top = label_top();
5328 declaration_t *old_current_function = current_function;
5329 current_function = declaration;
5330 current_parent = NULL;
5332 statement_t *const body = parse_compound_statement(false);
5333 declaration->init.statement = body;
5336 check_declarations();
5337 if (warning.return_type ||
5338 warning.unreachable_code ||
5339 (warning.missing_noreturn && !(declaration->modifiers & DM_NORETURN))) {
5340 noreturn_candidate = true;
5341 check_reachable(body);
5342 if (warning.unreachable_code)
5343 check_unreachable(body);
5344 if (warning.missing_noreturn &&
5345 noreturn_candidate &&
5346 !(declaration->modifiers & DM_NORETURN)) {
5347 warningf(&body->base.source_position,
5348 "function '%#T' is candidate for attribute 'noreturn'",
5349 type, declaration->symbol);
5353 assert(current_parent == NULL);
5354 assert(current_function == declaration);
5355 current_function = old_current_function;
5356 label_pop_to(label_stack_top);
5359 assert(scope == &declaration->scope);
5360 set_scope(last_scope);
5361 environment_pop_to(top);
5364 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5365 source_position_t *source_position)
5367 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
5369 type->bitfield.base_type = base_type;
5370 type->bitfield.size = size;
5375 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
5378 declaration_t *iter = compound_declaration->scope.declarations;
5379 for( ; iter != NULL; iter = iter->next) {
5380 if (iter->namespc != NAMESPACE_NORMAL)
5383 if (iter->symbol == NULL) {
5384 type_t *type = skip_typeref(iter->type);
5385 if (is_type_compound(type)) {
5386 declaration_t *result
5387 = find_compound_entry(type->compound.declaration, symbol);
5394 if (iter->symbol == symbol) {
5402 static void parse_compound_declarators(declaration_t *struct_declaration,
5403 const declaration_specifiers_t *specifiers)
5405 declaration_t *last_declaration = struct_declaration->scope.declarations;
5406 if (last_declaration != NULL) {
5407 while(last_declaration->next != NULL) {
5408 last_declaration = last_declaration->next;
5413 declaration_t *declaration;
5415 if (token.type == ':') {
5416 source_position_t source_position = *HERE;
5419 type_t *base_type = specifiers->type;
5420 expression_t *size = parse_constant_expression();
5422 if (!is_type_integer(skip_typeref(base_type))) {
5423 errorf(HERE, "bitfield base type '%T' is not an integer type",
5427 type_t *type = make_bitfield_type(base_type, size, &source_position);
5429 declaration = allocate_declaration_zero();
5430 declaration->namespc = NAMESPACE_NORMAL;
5431 declaration->declared_storage_class = STORAGE_CLASS_NONE;
5432 declaration->storage_class = STORAGE_CLASS_NONE;
5433 declaration->source_position = source_position;
5434 declaration->modifiers = specifiers->modifiers;
5435 declaration->type = type;
5437 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
5439 type_t *orig_type = declaration->type;
5440 type_t *type = skip_typeref(orig_type);
5442 if (token.type == ':') {
5443 source_position_t source_position = *HERE;
5445 expression_t *size = parse_constant_expression();
5447 if (!is_type_integer(type)) {
5448 errorf(HERE, "bitfield base type '%T' is not an integer type",
5452 type_t *bitfield_type = make_bitfield_type(orig_type, size, &source_position);
5453 declaration->type = bitfield_type;
5455 /* TODO we ignore arrays for now... what is missing is a check
5456 * that they're at the end of the struct */
5457 if (is_type_incomplete(type) && !is_type_array(type)) {
5459 "compound member '%Y' has incomplete type '%T'",
5460 declaration->symbol, orig_type);
5461 } else if (is_type_function(type)) {
5462 errorf(HERE, "compound member '%Y' must not have function type '%T'",
5463 declaration->symbol, orig_type);
5468 /* make sure we don't define a symbol multiple times */
5469 symbol_t *symbol = declaration->symbol;
5470 if (symbol != NULL) {
5471 declaration_t *prev_decl
5472 = find_compound_entry(struct_declaration, symbol);
5474 if (prev_decl != NULL) {
5475 assert(prev_decl->symbol == symbol);
5476 errorf(&declaration->source_position,
5477 "multiple declarations of symbol '%Y' (declared %P)",
5478 symbol, &prev_decl->source_position);
5482 /* append declaration */
5483 if (last_declaration != NULL) {
5484 last_declaration->next = declaration;
5486 struct_declaration->scope.declarations = declaration;
5488 last_declaration = declaration;
5490 if (token.type != ',')
5500 static void parse_compound_type_entries(declaration_t *compound_declaration)
5503 add_anchor_token('}');
5505 while(token.type != '}' && token.type != T_EOF) {
5506 declaration_specifiers_t specifiers;
5507 memset(&specifiers, 0, sizeof(specifiers));
5508 parse_declaration_specifiers(&specifiers);
5510 parse_compound_declarators(compound_declaration, &specifiers);
5512 rem_anchor_token('}');
5514 if (token.type == T_EOF) {
5515 errorf(HERE, "EOF while parsing struct");
5520 static type_t *parse_typename(void)
5522 declaration_specifiers_t specifiers;
5523 memset(&specifiers, 0, sizeof(specifiers));
5524 parse_declaration_specifiers(&specifiers);
5525 if (specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
5526 /* TODO: improve error message, user does probably not know what a
5527 * storage class is...
5529 errorf(HERE, "typename may not have a storage class");
5532 type_t *result = parse_abstract_declarator(specifiers.type);
5540 typedef expression_t* (*parse_expression_function) (unsigned precedence);
5541 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
5542 expression_t *left);
5544 typedef struct expression_parser_function_t expression_parser_function_t;
5545 struct expression_parser_function_t {
5546 unsigned precedence;
5547 parse_expression_function parser;
5548 unsigned infix_precedence;
5549 parse_expression_infix_function infix_parser;
5552 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5555 * Prints an error message if an expression was expected but not read
5557 static expression_t *expected_expression_error(void)
5559 /* skip the error message if the error token was read */
5560 if (token.type != T_ERROR) {
5561 errorf(HERE, "expected expression, got token '%K'", &token);
5565 return create_invalid_expression();
5569 * Parse a string constant.
5571 static expression_t *parse_string_const(void)
5574 if (token.type == T_STRING_LITERAL) {
5575 string_t res = token.v.string;
5577 while (token.type == T_STRING_LITERAL) {
5578 res = concat_strings(&res, &token.v.string);
5581 if (token.type != T_WIDE_STRING_LITERAL) {
5582 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
5583 /* note: that we use type_char_ptr here, which is already the
5584 * automatic converted type. revert_automatic_type_conversion
5585 * will construct the array type */
5586 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
5587 cnst->string.value = res;
5591 wres = concat_string_wide_string(&res, &token.v.wide_string);
5593 wres = token.v.wide_string;
5598 switch (token.type) {
5599 case T_WIDE_STRING_LITERAL:
5600 wres = concat_wide_strings(&wres, &token.v.wide_string);
5603 case T_STRING_LITERAL:
5604 wres = concat_wide_string_string(&wres, &token.v.string);
5608 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5609 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5610 cnst->wide_string.value = wres;
5619 * Parse an integer constant.
5621 static expression_t *parse_int_const(void)
5623 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5624 cnst->base.source_position = *HERE;
5625 cnst->base.type = token.datatype;
5626 cnst->conste.v.int_value = token.v.intvalue;
5634 * Parse a character constant.
5636 static expression_t *parse_character_constant(void)
5638 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
5640 cnst->base.source_position = *HERE;
5641 cnst->base.type = token.datatype;
5642 cnst->conste.v.character = token.v.string;
5644 if (cnst->conste.v.character.size != 1) {
5645 if (warning.multichar && (c_mode & _GNUC)) {
5647 warningf(HERE, "multi-character character constant");
5649 errorf(HERE, "more than 1 characters in character constant");
5658 * Parse a wide character constant.
5660 static expression_t *parse_wide_character_constant(void)
5662 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
5664 cnst->base.source_position = *HERE;
5665 cnst->base.type = token.datatype;
5666 cnst->conste.v.wide_character = token.v.wide_string;
5668 if (cnst->conste.v.wide_character.size != 1) {
5669 if (warning.multichar && (c_mode & _GNUC)) {
5671 warningf(HERE, "multi-character character constant");
5673 errorf(HERE, "more than 1 characters in character constant");
5682 * Parse a float constant.
5684 static expression_t *parse_float_const(void)
5686 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5687 cnst->base.type = token.datatype;
5688 cnst->conste.v.float_value = token.v.floatvalue;
5695 static declaration_t *create_implicit_function(symbol_t *symbol,
5696 const source_position_t *source_position)
5698 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
5699 ntype->function.return_type = type_int;
5700 ntype->function.unspecified_parameters = true;
5702 type_t *type = typehash_insert(ntype);
5703 if (type != ntype) {
5707 declaration_t *const declaration = allocate_declaration_zero();
5708 declaration->storage_class = STORAGE_CLASS_EXTERN;
5709 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
5710 declaration->type = type;
5711 declaration->symbol = symbol;
5712 declaration->source_position = *source_position;
5713 declaration->implicit = true;
5715 bool strict_prototypes_old = warning.strict_prototypes;
5716 warning.strict_prototypes = false;
5717 record_declaration(declaration, false);
5718 warning.strict_prototypes = strict_prototypes_old;
5724 * Creates a return_type (func)(argument_type) function type if not
5727 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
5728 type_t *argument_type2)
5730 function_parameter_t *parameter2
5731 = obstack_alloc(type_obst, sizeof(parameter2[0]));
5732 memset(parameter2, 0, sizeof(parameter2[0]));
5733 parameter2->type = argument_type2;
5735 function_parameter_t *parameter1
5736 = obstack_alloc(type_obst, sizeof(parameter1[0]));
5737 memset(parameter1, 0, sizeof(parameter1[0]));
5738 parameter1->type = argument_type1;
5739 parameter1->next = parameter2;
5741 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5742 type->function.return_type = return_type;
5743 type->function.parameters = parameter1;
5745 type_t *result = typehash_insert(type);
5746 if (result != type) {
5754 * Creates a return_type (func)(argument_type) function type if not
5757 * @param return_type the return type
5758 * @param argument_type the argument type
5760 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
5762 function_parameter_t *parameter
5763 = obstack_alloc(type_obst, sizeof(parameter[0]));
5764 memset(parameter, 0, sizeof(parameter[0]));
5765 parameter->type = argument_type;
5767 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5768 type->function.return_type = return_type;
5769 type->function.parameters = parameter;
5771 type_t *result = typehash_insert(type);
5772 if (result != type) {
5779 static type_t *make_function_0_type(type_t *return_type)
5781 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5782 type->function.return_type = return_type;
5783 type->function.parameters = NULL;
5785 type_t *result = typehash_insert(type);
5786 if (result != type) {
5794 * Creates a function type for some function like builtins.
5796 * @param symbol the symbol describing the builtin
5798 static type_t *get_builtin_symbol_type(symbol_t *symbol)
5800 switch(symbol->ID) {
5801 case T___builtin_alloca:
5802 return make_function_1_type(type_void_ptr, type_size_t);
5803 case T___builtin_huge_val:
5804 return make_function_0_type(type_double);
5805 case T___builtin_nan:
5806 return make_function_1_type(type_double, type_char_ptr);
5807 case T___builtin_nanf:
5808 return make_function_1_type(type_float, type_char_ptr);
5809 case T___builtin_nand:
5810 return make_function_1_type(type_long_double, type_char_ptr);
5811 case T___builtin_va_end:
5812 return make_function_1_type(type_void, type_valist);
5813 case T___builtin_expect:
5814 return make_function_2_type(type_long, type_long, type_long);
5816 internal_errorf(HERE, "not implemented builtin symbol found");
5821 * Performs automatic type cast as described in § 6.3.2.1.
5823 * @param orig_type the original type
5825 static type_t *automatic_type_conversion(type_t *orig_type)
5827 type_t *type = skip_typeref(orig_type);
5828 if (is_type_array(type)) {
5829 array_type_t *array_type = &type->array;
5830 type_t *element_type = array_type->element_type;
5831 unsigned qualifiers = array_type->base.qualifiers;
5833 return make_pointer_type(element_type, qualifiers);
5836 if (is_type_function(type)) {
5837 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5844 * reverts the automatic casts of array to pointer types and function
5845 * to function-pointer types as defined § 6.3.2.1
5847 type_t *revert_automatic_type_conversion(const expression_t *expression)
5849 switch (expression->kind) {
5850 case EXPR_REFERENCE: return expression->reference.declaration->type;
5851 case EXPR_SELECT: return expression->select.compound_entry->type;
5853 case EXPR_UNARY_DEREFERENCE: {
5854 const expression_t *const value = expression->unary.value;
5855 type_t *const type = skip_typeref(value->base.type);
5856 assert(is_type_pointer(type));
5857 return type->pointer.points_to;
5860 case EXPR_BUILTIN_SYMBOL:
5861 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
5863 case EXPR_ARRAY_ACCESS: {
5864 const expression_t *array_ref = expression->array_access.array_ref;
5865 type_t *type_left = skip_typeref(array_ref->base.type);
5866 if (!is_type_valid(type_left))
5868 assert(is_type_pointer(type_left));
5869 return type_left->pointer.points_to;
5872 case EXPR_STRING_LITERAL: {
5873 size_t size = expression->string.value.size;
5874 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
5877 case EXPR_WIDE_STRING_LITERAL: {
5878 size_t size = expression->wide_string.value.size;
5879 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
5882 case EXPR_COMPOUND_LITERAL:
5883 return expression->compound_literal.type;
5888 return expression->base.type;
5891 static expression_t *parse_reference(void)
5893 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
5895 reference_expression_t *ref = &expression->reference;
5896 symbol_t *const symbol = token.v.symbol;
5898 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
5900 source_position_t source_position = token.source_position;
5903 if (declaration == NULL) {
5904 if (token.type == '(') {
5905 /* an implicitly declared function */
5907 errorf(HERE, "unknown symbol '%Y' found.", symbol);
5908 } else if (warning.implicit_function_declaration) {
5909 warningf(HERE, "implicit declaration of function '%Y'",
5913 declaration = create_implicit_function(symbol,
5916 errorf(HERE, "unknown symbol '%Y' found.", symbol);
5917 declaration = create_error_declaration(symbol, STORAGE_CLASS_NONE);
5921 type_t *type = declaration->type;
5923 /* we always do the auto-type conversions; the & and sizeof parser contains
5924 * code to revert this! */
5925 type = automatic_type_conversion(type);
5927 ref->declaration = declaration;
5928 ref->base.type = type;
5930 /* this declaration is used */
5931 declaration->used = true;
5933 /* check for deprecated functions */
5934 if (warning.deprecated_declarations &&
5935 declaration->modifiers & DM_DEPRECATED) {
5936 char const *const prefix = is_type_function(declaration->type) ?
5937 "function" : "variable";
5939 if (declaration->deprecated_string != NULL) {
5940 warningf(&source_position,
5941 "%s '%Y' is deprecated (declared %P): \"%s\"", prefix,
5942 declaration->symbol, &declaration->source_position,
5943 declaration->deprecated_string);
5945 warningf(&source_position,
5946 "%s '%Y' is deprecated (declared %P)", prefix,
5947 declaration->symbol, &declaration->source_position);
5950 if (warning.init_self && declaration == current_init_decl) {
5951 current_init_decl = NULL;
5952 warningf(&source_position,
5953 "variable '%#T' is initialized by itself",
5954 declaration->type, declaration->symbol);
5960 static bool semantic_cast(expression_t *cast)
5962 expression_t *expression = cast->unary.value;
5963 type_t *orig_dest_type = cast->base.type;
5964 type_t *orig_type_right = expression->base.type;
5965 type_t const *dst_type = skip_typeref(orig_dest_type);
5966 type_t const *src_type = skip_typeref(orig_type_right);
5967 source_position_t const *pos = &cast->base.source_position;
5969 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
5970 if (dst_type == type_void)
5973 /* only integer and pointer can be casted to pointer */
5974 if (is_type_pointer(dst_type) &&
5975 !is_type_pointer(src_type) &&
5976 !is_type_integer(src_type) &&
5977 is_type_valid(src_type)) {
5978 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
5982 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
5983 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
5987 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
5988 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
5992 if (warning.cast_qual &&
5993 is_type_pointer(src_type) &&
5994 is_type_pointer(dst_type)) {
5995 type_t *src = skip_typeref(src_type->pointer.points_to);
5996 type_t *dst = skip_typeref(dst_type->pointer.points_to);
5997 unsigned missing_qualifiers =
5998 src->base.qualifiers & ~dst->base.qualifiers;
5999 if (missing_qualifiers != 0) {
6001 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6002 missing_qualifiers, orig_type_right);
6008 static expression_t *parse_compound_literal(type_t *type)
6010 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6012 parse_initializer_env_t env;
6014 env.declaration = NULL;
6015 env.must_be_constant = false;
6016 initializer_t *initializer = parse_initializer(&env);
6019 expression->compound_literal.initializer = initializer;
6020 expression->compound_literal.type = type;
6021 expression->base.type = automatic_type_conversion(type);
6027 * Parse a cast expression.
6029 static expression_t *parse_cast(void)
6031 source_position_t source_position = token.source_position;
6033 type_t *type = parse_typename();
6035 /* matching add_anchor_token() is at call site */
6036 rem_anchor_token(')');
6039 if (token.type == '{') {
6040 return parse_compound_literal(type);
6043 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6044 cast->base.source_position = source_position;
6046 expression_t *value = parse_sub_expression(20);
6047 cast->base.type = type;
6048 cast->unary.value = value;
6050 if (! semantic_cast(cast)) {
6051 /* TODO: record the error in the AST. else it is impossible to detect it */
6056 return create_invalid_expression();
6060 * Parse a statement expression.
6062 static expression_t *parse_statement_expression(void)
6064 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6066 statement_t *statement = parse_compound_statement(true);
6067 expression->statement.statement = statement;
6068 expression->base.source_position = statement->base.source_position;
6070 /* find last statement and use its type */
6071 type_t *type = type_void;
6072 const statement_t *stmt = statement->compound.statements;
6074 while (stmt->base.next != NULL)
6075 stmt = stmt->base.next;
6077 if (stmt->kind == STATEMENT_EXPRESSION) {
6078 type = stmt->expression.expression->base.type;
6081 warningf(&expression->base.source_position, "empty statement expression ({})");
6083 expression->base.type = type;
6089 return create_invalid_expression();
6093 * Parse a parenthesized expression.
6095 static expression_t *parse_parenthesized_expression(void)
6098 add_anchor_token(')');
6100 switch(token.type) {
6102 /* gcc extension: a statement expression */
6103 return parse_statement_expression();
6107 return parse_cast();
6109 if (is_typedef_symbol(token.v.symbol)) {
6110 return parse_cast();
6114 expression_t *result = parse_expression();
6115 rem_anchor_token(')');
6120 return create_invalid_expression();
6123 static expression_t *parse_function_keyword(void)
6128 if (current_function == NULL) {
6129 errorf(HERE, "'__func__' used outside of a function");
6132 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6133 expression->base.type = type_char_ptr;
6134 expression->funcname.kind = FUNCNAME_FUNCTION;
6139 static expression_t *parse_pretty_function_keyword(void)
6141 eat(T___PRETTY_FUNCTION__);
6143 if (current_function == NULL) {
6144 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6147 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6148 expression->base.type = type_char_ptr;
6149 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6154 static expression_t *parse_funcsig_keyword(void)
6158 if (current_function == NULL) {
6159 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6162 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6163 expression->base.type = type_char_ptr;
6164 expression->funcname.kind = FUNCNAME_FUNCSIG;
6169 static expression_t *parse_funcdname_keyword(void)
6171 eat(T___FUNCDNAME__);
6173 if (current_function == NULL) {
6174 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6177 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6178 expression->base.type = type_char_ptr;
6179 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6184 static designator_t *parse_designator(void)
6186 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6187 result->source_position = *HERE;
6189 if (token.type != T_IDENTIFIER) {
6190 parse_error_expected("while parsing member designator",
6191 T_IDENTIFIER, NULL);
6194 result->symbol = token.v.symbol;
6197 designator_t *last_designator = result;
6199 if (token.type == '.') {
6201 if (token.type != T_IDENTIFIER) {
6202 parse_error_expected("while parsing member designator",
6203 T_IDENTIFIER, NULL);
6206 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6207 designator->source_position = *HERE;
6208 designator->symbol = token.v.symbol;
6211 last_designator->next = designator;
6212 last_designator = designator;
6215 if (token.type == '[') {
6217 add_anchor_token(']');
6218 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6219 designator->source_position = *HERE;
6220 designator->array_index = parse_expression();
6221 rem_anchor_token(']');
6223 if (designator->array_index == NULL) {
6227 last_designator->next = designator;
6228 last_designator = designator;
6240 * Parse the __builtin_offsetof() expression.
6242 static expression_t *parse_offsetof(void)
6244 eat(T___builtin_offsetof);
6246 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6247 expression->base.type = type_size_t;
6250 add_anchor_token(',');
6251 type_t *type = parse_typename();
6252 rem_anchor_token(',');
6254 add_anchor_token(')');
6255 designator_t *designator = parse_designator();
6256 rem_anchor_token(')');
6259 expression->offsetofe.type = type;
6260 expression->offsetofe.designator = designator;
6263 memset(&path, 0, sizeof(path));
6264 path.top_type = type;
6265 path.path = NEW_ARR_F(type_path_entry_t, 0);
6267 descend_into_subtype(&path);
6269 if (!walk_designator(&path, designator, true)) {
6270 return create_invalid_expression();
6273 DEL_ARR_F(path.path);
6277 return create_invalid_expression();
6281 * Parses a _builtin_va_start() expression.
6283 static expression_t *parse_va_start(void)
6285 eat(T___builtin_va_start);
6287 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6290 add_anchor_token(',');
6291 expression->va_starte.ap = parse_assignment_expression();
6292 rem_anchor_token(',');
6294 expression_t *const expr = parse_assignment_expression();
6295 if (expr->kind == EXPR_REFERENCE) {
6296 declaration_t *const decl = expr->reference.declaration;
6298 return create_invalid_expression();
6299 if (decl->parent_scope == ¤t_function->scope &&
6300 decl->next == NULL) {
6301 expression->va_starte.parameter = decl;
6306 errorf(&expr->base.source_position,
6307 "second argument of 'va_start' must be last parameter of the current function");
6309 return create_invalid_expression();
6313 * Parses a _builtin_va_arg() expression.
6315 static expression_t *parse_va_arg(void)
6317 eat(T___builtin_va_arg);
6319 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6322 expression->va_arge.ap = parse_assignment_expression();
6324 expression->base.type = parse_typename();
6329 return create_invalid_expression();
6332 static expression_t *parse_builtin_symbol(void)
6334 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
6336 symbol_t *symbol = token.v.symbol;
6338 expression->builtin_symbol.symbol = symbol;
6341 type_t *type = get_builtin_symbol_type(symbol);
6342 type = automatic_type_conversion(type);
6344 expression->base.type = type;
6349 * Parses a __builtin_constant() expression.
6351 static expression_t *parse_builtin_constant(void)
6353 eat(T___builtin_constant_p);
6355 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6358 add_anchor_token(')');
6359 expression->builtin_constant.value = parse_assignment_expression();
6360 rem_anchor_token(')');
6362 expression->base.type = type_int;
6366 return create_invalid_expression();
6370 * Parses a __builtin_prefetch() expression.
6372 static expression_t *parse_builtin_prefetch(void)
6374 eat(T___builtin_prefetch);
6376 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
6379 add_anchor_token(')');
6380 expression->builtin_prefetch.adr = parse_assignment_expression();
6381 if (token.type == ',') {
6383 expression->builtin_prefetch.rw = parse_assignment_expression();
6385 if (token.type == ',') {
6387 expression->builtin_prefetch.locality = parse_assignment_expression();
6389 rem_anchor_token(')');
6391 expression->base.type = type_void;
6395 return create_invalid_expression();
6399 * Parses a __builtin_is_*() compare expression.
6401 static expression_t *parse_compare_builtin(void)
6403 expression_t *expression;
6405 switch(token.type) {
6406 case T___builtin_isgreater:
6407 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6409 case T___builtin_isgreaterequal:
6410 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6412 case T___builtin_isless:
6413 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6415 case T___builtin_islessequal:
6416 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6418 case T___builtin_islessgreater:
6419 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6421 case T___builtin_isunordered:
6422 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6425 internal_errorf(HERE, "invalid compare builtin found");
6428 expression->base.source_position = *HERE;
6432 expression->binary.left = parse_assignment_expression();
6434 expression->binary.right = parse_assignment_expression();
6437 type_t *const orig_type_left = expression->binary.left->base.type;
6438 type_t *const orig_type_right = expression->binary.right->base.type;
6440 type_t *const type_left = skip_typeref(orig_type_left);
6441 type_t *const type_right = skip_typeref(orig_type_right);
6442 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6443 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6444 type_error_incompatible("invalid operands in comparison",
6445 &expression->base.source_position, orig_type_left, orig_type_right);
6448 semantic_comparison(&expression->binary);
6453 return create_invalid_expression();
6458 * Parses a __builtin_expect() expression.
6460 static expression_t *parse_builtin_expect(void)
6462 eat(T___builtin_expect);
6464 expression_t *expression
6465 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
6468 expression->binary.left = parse_assignment_expression();
6470 expression->binary.right = parse_constant_expression();
6473 expression->base.type = expression->binary.left->base.type;
6477 return create_invalid_expression();
6482 * Parses a MS assume() expression.
6484 static expression_t *parse_assume(void)
6488 expression_t *expression
6489 = allocate_expression_zero(EXPR_UNARY_ASSUME);
6492 add_anchor_token(')');
6493 expression->unary.value = parse_assignment_expression();
6494 rem_anchor_token(')');
6497 expression->base.type = type_void;
6500 return create_invalid_expression();
6504 * Parse a microsoft __noop expression.
6506 static expression_t *parse_noop_expression(void)
6508 source_position_t source_position = *HERE;
6511 if (token.type == '(') {
6512 /* parse arguments */
6514 add_anchor_token(')');
6515 add_anchor_token(',');
6517 if (token.type != ')') {
6519 (void)parse_assignment_expression();
6520 if (token.type != ',')
6526 rem_anchor_token(',');
6527 rem_anchor_token(')');
6530 /* the result is a (int)0 */
6531 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6532 cnst->base.source_position = source_position;
6533 cnst->base.type = type_int;
6534 cnst->conste.v.int_value = 0;
6535 cnst->conste.is_ms_noop = true;
6540 return create_invalid_expression();
6544 * Parses a primary expression.
6546 static expression_t *parse_primary_expression(void)
6548 switch (token.type) {
6549 case T_INTEGER: return parse_int_const();
6550 case T_CHARACTER_CONSTANT: return parse_character_constant();
6551 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6552 case T_FLOATINGPOINT: return parse_float_const();
6553 case T_STRING_LITERAL:
6554 case T_WIDE_STRING_LITERAL: return parse_string_const();
6555 case T_IDENTIFIER: return parse_reference();
6556 case T___FUNCTION__:
6557 case T___func__: return parse_function_keyword();
6558 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6559 case T___FUNCSIG__: return parse_funcsig_keyword();
6560 case T___FUNCDNAME__: return parse_funcdname_keyword();
6561 case T___builtin_offsetof: return parse_offsetof();
6562 case T___builtin_va_start: return parse_va_start();
6563 case T___builtin_va_arg: return parse_va_arg();
6564 case T___builtin_expect:
6565 case T___builtin_alloca:
6566 case T___builtin_nan:
6567 case T___builtin_nand:
6568 case T___builtin_nanf:
6569 case T___builtin_huge_val:
6570 case T___builtin_va_end: return parse_builtin_symbol();
6571 case T___builtin_isgreater:
6572 case T___builtin_isgreaterequal:
6573 case T___builtin_isless:
6574 case T___builtin_islessequal:
6575 case T___builtin_islessgreater:
6576 case T___builtin_isunordered: return parse_compare_builtin();
6577 case T___builtin_constant_p: return parse_builtin_constant();
6578 case T___builtin_prefetch: return parse_builtin_prefetch();
6579 case T__assume: return parse_assume();
6581 case '(': return parse_parenthesized_expression();
6582 case T___noop: return parse_noop_expression();
6585 errorf(HERE, "unexpected token %K, expected an expression", &token);
6586 return create_invalid_expression();
6590 * Check if the expression has the character type and issue a warning then.
6592 static void check_for_char_index_type(const expression_t *expression)
6594 type_t *const type = expression->base.type;
6595 const type_t *const base_type = skip_typeref(type);
6597 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
6598 warning.char_subscripts) {
6599 warningf(&expression->base.source_position,
6600 "array subscript has type '%T'", type);
6604 static expression_t *parse_array_expression(unsigned precedence,
6610 add_anchor_token(']');
6612 expression_t *inside = parse_expression();
6614 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6616 array_access_expression_t *array_access = &expression->array_access;
6618 type_t *const orig_type_left = left->base.type;
6619 type_t *const orig_type_inside = inside->base.type;
6621 type_t *const type_left = skip_typeref(orig_type_left);
6622 type_t *const type_inside = skip_typeref(orig_type_inside);
6624 type_t *return_type;
6625 if (is_type_pointer(type_left)) {
6626 return_type = type_left->pointer.points_to;
6627 array_access->array_ref = left;
6628 array_access->index = inside;
6629 check_for_char_index_type(inside);
6630 } else if (is_type_pointer(type_inside)) {
6631 return_type = type_inside->pointer.points_to;
6632 array_access->array_ref = inside;
6633 array_access->index = left;
6634 array_access->flipped = true;
6635 check_for_char_index_type(left);
6637 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6639 "array access on object with non-pointer types '%T', '%T'",
6640 orig_type_left, orig_type_inside);
6642 return_type = type_error_type;
6643 array_access->array_ref = create_invalid_expression();
6646 rem_anchor_token(']');
6647 if (token.type != ']') {
6648 parse_error_expected("Problem while parsing array access", ']', NULL);
6653 return_type = automatic_type_conversion(return_type);
6654 expression->base.type = return_type;
6659 static expression_t *parse_typeprop(expression_kind_t const kind,
6660 source_position_t const pos,
6661 unsigned const precedence)
6663 expression_t *tp_expression = allocate_expression_zero(kind);
6664 tp_expression->base.type = type_size_t;
6665 tp_expression->base.source_position = pos;
6667 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6669 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
6671 add_anchor_token(')');
6672 type_t* const orig_type = parse_typename();
6673 tp_expression->typeprop.type = orig_type;
6675 type_t const* const type = skip_typeref(orig_type);
6676 char const* const wrong_type =
6677 is_type_incomplete(type) ? "incomplete" :
6678 type->kind == TYPE_FUNCTION ? "function designator" :
6679 type->kind == TYPE_BITFIELD ? "bitfield" :
6681 if (wrong_type != NULL) {
6682 errorf(&pos, "operand of %s expression must not be %s type '%T'",
6683 what, wrong_type, type);
6686 rem_anchor_token(')');
6689 expression_t *expression = parse_sub_expression(precedence);
6691 type_t* const orig_type = revert_automatic_type_conversion(expression);
6692 expression->base.type = orig_type;
6694 type_t const* const type = skip_typeref(orig_type);
6695 char const* const wrong_type =
6696 is_type_incomplete(type) ? "incomplete" :
6697 type->kind == TYPE_FUNCTION ? "function designator" :
6698 type->kind == TYPE_BITFIELD ? "bitfield" :
6700 if (wrong_type != NULL) {
6701 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
6704 tp_expression->typeprop.type = expression->base.type;
6705 tp_expression->typeprop.tp_expression = expression;
6708 return tp_expression;
6710 return create_invalid_expression();
6713 static expression_t *parse_sizeof(unsigned precedence)
6715 source_position_t pos = *HERE;
6717 return parse_typeprop(EXPR_SIZEOF, pos, precedence);
6720 static expression_t *parse_alignof(unsigned precedence)
6722 source_position_t pos = *HERE;
6724 return parse_typeprop(EXPR_ALIGNOF, pos, precedence);
6727 static expression_t *parse_select_expression(unsigned precedence,
6728 expression_t *compound)
6731 assert(token.type == '.' || token.type == T_MINUSGREATER);
6733 bool is_pointer = (token.type == T_MINUSGREATER);
6736 expression_t *select = allocate_expression_zero(EXPR_SELECT);
6737 select->select.compound = compound;
6739 if (token.type != T_IDENTIFIER) {
6740 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
6743 symbol_t *symbol = token.v.symbol;
6746 type_t *const orig_type = compound->base.type;
6747 type_t *const type = skip_typeref(orig_type);
6749 type_t *type_left = type;
6750 bool saw_error = false;
6751 if (is_type_pointer(type)) {
6754 "request for member '%Y' in something not a struct or union, but '%T'",
6758 type_left = type->pointer.points_to;
6759 } else if (is_pointer) {
6760 if (is_type_valid(type)) {
6761 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6766 type_left = skip_typeref(type_left);
6768 declaration_t *entry;
6769 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
6770 type_left->kind == TYPE_COMPOUND_UNION) {
6771 declaration_t *const declaration = type_left->compound.declaration;
6773 if (!declaration->init.complete) {
6774 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
6776 return create_invalid_expression();
6779 entry = find_compound_entry(declaration, symbol);
6780 if (entry == NULL) {
6781 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
6782 goto create_error_entry;
6785 if (is_type_valid(type_left) && !saw_error) {
6787 "request for member '%Y' in something not a struct or union, but '%T'",
6791 entry = allocate_declaration_zero();
6792 entry->symbol = symbol;
6795 select->select.compound_entry = entry;
6796 /* we always do the auto-type conversions; the & and sizeof parser contains
6797 * code to revert this! */
6798 select->base.type = automatic_type_conversion(entry->type);
6800 type_t *skipped = skip_typeref(entry->type);
6801 if (skipped->kind == TYPE_BITFIELD) {
6802 select->base.type = skipped->bitfield.base_type;
6808 static void check_call_argument(const function_parameter_t *parameter,
6809 call_argument_t *argument, unsigned pos)
6811 type_t *expected_type = parameter->type;
6812 type_t *expected_type_skip = skip_typeref(expected_type);
6813 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6814 expression_t *arg_expr = argument->expression;
6815 type_t *arg_type = skip_typeref(arg_expr->base.type);
6817 /* handle transparent union gnu extension */
6818 if (is_type_union(expected_type_skip)
6819 && (expected_type_skip->base.modifiers
6820 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
6821 declaration_t *union_decl = expected_type_skip->compound.declaration;
6823 declaration_t *declaration = union_decl->scope.declarations;
6824 type_t *best_type = NULL;
6825 for ( ; declaration != NULL; declaration = declaration->next) {
6826 type_t *decl_type = declaration->type;
6827 error = semantic_assign(decl_type, arg_expr);
6828 if (error == ASSIGN_ERROR_INCOMPATIBLE
6829 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6832 if (error == ASSIGN_SUCCESS) {
6833 best_type = decl_type;
6834 } else if (best_type == NULL) {
6835 best_type = decl_type;
6839 if (best_type != NULL) {
6840 expected_type = best_type;
6844 error = semantic_assign(expected_type, arg_expr);
6845 argument->expression = create_implicit_cast(argument->expression,
6848 if (error != ASSIGN_SUCCESS) {
6849 /* report exact scope in error messages (like "in argument 3") */
6851 snprintf(buf, sizeof(buf), "call argument %u", pos);
6852 report_assign_error(error, expected_type, arg_expr, buf,
6853 &arg_expr->base.source_position);
6854 } else if (warning.traditional | warning.conversion) {
6856 /* passing as integer instead of float or complex */
6857 (is_type_integer(expected_type) &&
6858 (is_type_float(arg_type) || is_type_complex(arg_type))) ||
6859 /* passing as complex instead of integer or float */
6860 (is_type_complex(expected_type) &&
6861 (is_type_integer(arg_type) || is_type_float(arg_type))) ||
6862 /* passing as float instead of integer or complex */
6863 (is_type_float(expected_type) &&
6864 (is_type_integer(arg_type) || is_type_complex(arg_type))) ||
6865 /* passing as float instead of double */
6866 (is_type_float(expected_type) && expected_type != type_double &&
6867 is_type_float(arg_type))) {
6868 warningf(&arg_expr->base.source_position,
6869 "passing call argument %u as '%T' rather than '%T' due to prototype",
6870 pos, expected_type, arg_type);
6872 if (is_type_integer(expected_type) && is_type_integer(arg_type)) {
6873 /* TODO check for size HERE */
6879 * Parse a call expression, ie. expression '( ... )'.
6881 * @param expression the function address
6883 static expression_t *parse_call_expression(unsigned precedence,
6884 expression_t *expression)
6887 expression_t *result = allocate_expression_zero(EXPR_CALL);
6888 result->base.source_position = expression->base.source_position;
6890 call_expression_t *call = &result->call;
6891 call->function = expression;
6893 type_t *const orig_type = expression->base.type;
6894 type_t *const type = skip_typeref(orig_type);
6896 function_type_t *function_type = NULL;
6897 if (is_type_pointer(type)) {
6898 type_t *const to_type = skip_typeref(type->pointer.points_to);
6900 if (is_type_function(to_type)) {
6901 function_type = &to_type->function;
6902 call->base.type = function_type->return_type;
6906 if (function_type == NULL && is_type_valid(type)) {
6907 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
6910 /* parse arguments */
6912 add_anchor_token(')');
6913 add_anchor_token(',');
6915 if (token.type != ')') {
6916 call_argument_t *last_argument = NULL;
6919 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
6921 argument->expression = parse_assignment_expression();
6922 if (last_argument == NULL) {
6923 call->arguments = argument;
6925 last_argument->next = argument;
6927 last_argument = argument;
6929 if (token.type != ',')
6934 rem_anchor_token(',');
6935 rem_anchor_token(')');
6938 if (function_type == NULL)
6941 function_parameter_t *parameter = function_type->parameters;
6942 call_argument_t *argument = call->arguments;
6943 if (!function_type->unspecified_parameters) {
6944 for (unsigned pos = 0; parameter != NULL && argument != NULL;
6945 parameter = parameter->next, argument = argument->next) {
6946 check_call_argument(parameter, argument, ++pos);
6949 if (parameter != NULL) {
6950 errorf(HERE, "too few arguments to function '%E'", expression);
6951 } else if (argument != NULL && !function_type->variadic) {
6952 errorf(HERE, "too many arguments to function '%E'", expression);
6956 /* do default promotion */
6957 for( ; argument != NULL; argument = argument->next) {
6958 type_t *type = argument->expression->base.type;
6960 type = get_default_promoted_type(type);
6962 argument->expression
6963 = create_implicit_cast(argument->expression, type);
6966 check_format(&result->call);
6968 if (warning.aggregate_return &&
6969 is_type_compound(skip_typeref(function_type->return_type))) {
6970 warningf(&result->base.source_position,
6971 "function call has aggregate value");
6976 return create_invalid_expression();
6979 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
6981 static bool same_compound_type(const type_t *type1, const type_t *type2)
6984 is_type_compound(type1) &&
6985 type1->kind == type2->kind &&
6986 type1->compound.declaration == type2->compound.declaration;
6990 * Parse a conditional expression, ie. 'expression ? ... : ...'.
6992 * @param expression the conditional expression
6994 static expression_t *parse_conditional_expression(unsigned precedence,
6995 expression_t *expression)
6997 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
6999 conditional_expression_t *conditional = &result->conditional;
7000 conditional->base.source_position = *HERE;
7001 conditional->condition = expression;
7004 add_anchor_token(':');
7007 type_t *const condition_type_orig = expression->base.type;
7008 type_t *const condition_type = skip_typeref(condition_type_orig);
7009 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
7010 type_error("expected a scalar type in conditional condition",
7011 &expression->base.source_position, condition_type_orig);
7014 expression_t *true_expression = expression;
7015 bool gnu_cond = false;
7016 if ((c_mode & _GNUC) && token.type == ':') {
7019 true_expression = parse_expression();
7020 rem_anchor_token(':');
7022 expression_t *false_expression = parse_sub_expression(precedence);
7024 type_t *const orig_true_type = true_expression->base.type;
7025 type_t *const orig_false_type = false_expression->base.type;
7026 type_t *const true_type = skip_typeref(orig_true_type);
7027 type_t *const false_type = skip_typeref(orig_false_type);
7030 type_t *result_type;
7031 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7032 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7033 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID)
7034 || !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7035 warningf(&conditional->base.source_position,
7036 "ISO C forbids conditional expression with only one void side");
7038 result_type = type_void;
7039 } else if (is_type_arithmetic(true_type)
7040 && is_type_arithmetic(false_type)) {
7041 result_type = semantic_arithmetic(true_type, false_type);
7043 true_expression = create_implicit_cast(true_expression, result_type);
7044 false_expression = create_implicit_cast(false_expression, result_type);
7046 conditional->true_expression = true_expression;
7047 conditional->false_expression = false_expression;
7048 conditional->base.type = result_type;
7049 } else if (same_compound_type(true_type, false_type)) {
7050 /* just take 1 of the 2 types */
7051 result_type = true_type;
7052 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7053 type_t *pointer_type;
7055 expression_t *other_expression;
7056 if (is_type_pointer(true_type) &&
7057 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7058 pointer_type = true_type;
7059 other_type = false_type;
7060 other_expression = false_expression;
7062 pointer_type = false_type;
7063 other_type = true_type;
7064 other_expression = true_expression;
7067 if (is_null_pointer_constant(other_expression)) {
7068 result_type = pointer_type;
7069 } else if (is_type_pointer(other_type)) {
7070 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7071 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7074 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7075 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7077 } else if (types_compatible(get_unqualified_type(to1),
7078 get_unqualified_type(to2))) {
7081 warningf(&conditional->base.source_position,
7082 "pointer types '%T' and '%T' in conditional expression are incompatible",
7083 true_type, false_type);
7087 type_t *const copy = duplicate_type(to);
7088 copy->base.qualifiers = to1->base.qualifiers | to2->base.qualifiers;
7090 type_t *const type = typehash_insert(copy);
7094 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7095 } else if (is_type_integer(other_type)) {
7096 warningf(&conditional->base.source_position,
7097 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7098 result_type = pointer_type;
7100 type_error_incompatible("while parsing conditional",
7101 &expression->base.source_position, true_type, false_type);
7102 result_type = type_error_type;
7105 /* TODO: one pointer to void*, other some pointer */
7107 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7108 type_error_incompatible("while parsing conditional",
7109 &conditional->base.source_position, true_type,
7112 result_type = type_error_type;
7115 conditional->true_expression
7116 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7117 conditional->false_expression
7118 = create_implicit_cast(false_expression, result_type);
7119 conditional->base.type = result_type;
7122 return create_invalid_expression();
7126 * Parse an extension expression.
7128 static expression_t *parse_extension(unsigned precedence)
7130 eat(T___extension__);
7132 /* TODO enable extensions */
7133 expression_t *expression = parse_sub_expression(precedence);
7134 /* TODO disable extensions */
7139 * Parse a __builtin_classify_type() expression.
7141 static expression_t *parse_builtin_classify_type(const unsigned precedence)
7143 eat(T___builtin_classify_type);
7145 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7146 result->base.type = type_int;
7149 add_anchor_token(')');
7150 expression_t *expression = parse_sub_expression(precedence);
7151 rem_anchor_token(')');
7153 result->classify_type.type_expression = expression;
7157 return create_invalid_expression();
7160 static bool check_pointer_arithmetic(const source_position_t *source_position,
7161 type_t *pointer_type,
7162 type_t *orig_pointer_type)
7164 type_t *points_to = pointer_type->pointer.points_to;
7165 points_to = skip_typeref(points_to);
7167 if (is_type_incomplete(points_to)) {
7168 if (!(c_mode & _GNUC) || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7169 errorf(source_position,
7170 "arithmetic with pointer to incomplete type '%T' not allowed",
7173 } else if (warning.pointer_arith) {
7174 warningf(source_position,
7175 "pointer of type '%T' used in arithmetic",
7178 } else if (is_type_function(points_to)) {
7179 if (!(c_mode && _GNUC)) {
7180 errorf(source_position,
7181 "arithmetic with pointer to function type '%T' not allowed",
7184 } else if (warning.pointer_arith) {
7185 warningf(source_position,
7186 "pointer to a function '%T' used in arithmetic",
7193 static bool is_lvalue(const expression_t *expression)
7195 switch (expression->kind) {
7196 case EXPR_REFERENCE:
7197 case EXPR_ARRAY_ACCESS:
7199 case EXPR_UNARY_DEREFERENCE:
7207 static void semantic_incdec(unary_expression_t *expression)
7209 type_t *const orig_type = expression->value->base.type;
7210 type_t *const type = skip_typeref(orig_type);
7211 if (is_type_pointer(type)) {
7212 if (!check_pointer_arithmetic(&expression->base.source_position,
7216 } else if (!is_type_real(type) && is_type_valid(type)) {
7217 /* TODO: improve error message */
7218 errorf(&expression->base.source_position,
7219 "operation needs an arithmetic or pointer type");
7222 if (!is_lvalue(expression->value)) {
7223 /* TODO: improve error message */
7224 errorf(&expression->base.source_position, "lvalue required as operand");
7226 expression->base.type = orig_type;
7229 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7231 type_t *const orig_type = expression->value->base.type;
7232 type_t *const type = skip_typeref(orig_type);
7233 if (!is_type_arithmetic(type)) {
7234 if (is_type_valid(type)) {
7235 /* TODO: improve error message */
7236 errorf(&expression->base.source_position,
7237 "operation needs an arithmetic type");
7242 expression->base.type = orig_type;
7245 static void semantic_unexpr_plus(unary_expression_t *expression)
7247 semantic_unexpr_arithmetic(expression);
7248 if (warning.traditional)
7249 warningf(&expression->base.source_position,
7250 "traditional C rejects the unary plus operator");
7253 static void semantic_not(unary_expression_t *expression)
7255 type_t *const orig_type = expression->value->base.type;
7256 type_t *const type = skip_typeref(orig_type);
7257 if (!is_type_scalar(type) && is_type_valid(type)) {
7258 errorf(&expression->base.source_position,
7259 "operand of ! must be of scalar type");
7262 expression->base.type = type_int;
7265 static void semantic_unexpr_integer(unary_expression_t *expression)
7267 type_t *const orig_type = expression->value->base.type;
7268 type_t *const type = skip_typeref(orig_type);
7269 if (!is_type_integer(type)) {
7270 if (is_type_valid(type)) {
7271 errorf(&expression->base.source_position,
7272 "operand of ~ must be of integer type");
7277 expression->base.type = orig_type;
7280 static void semantic_dereference(unary_expression_t *expression)
7282 type_t *const orig_type = expression->value->base.type;
7283 type_t *const type = skip_typeref(orig_type);
7284 if (!is_type_pointer(type)) {
7285 if (is_type_valid(type)) {
7286 errorf(&expression->base.source_position,
7287 "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
7292 type_t *result_type = type->pointer.points_to;
7293 result_type = automatic_type_conversion(result_type);
7294 expression->base.type = result_type;
7298 * Record that an address is taken (expression represents an lvalue).
7300 * @param expression the expression
7301 * @param may_be_register if true, the expression might be an register
7303 static void set_address_taken(expression_t *expression, bool may_be_register)
7305 if (expression->kind != EXPR_REFERENCE)
7308 declaration_t *const declaration = expression->reference.declaration;
7309 /* happens for parse errors */
7310 if (declaration == NULL)
7313 if (declaration->storage_class == STORAGE_CLASS_REGISTER && !may_be_register) {
7314 errorf(&expression->base.source_position,
7315 "address of register variable '%Y' requested",
7316 declaration->symbol);
7318 declaration->address_taken = 1;
7323 * Check the semantic of the address taken expression.
7325 static void semantic_take_addr(unary_expression_t *expression)
7327 expression_t *value = expression->value;
7328 value->base.type = revert_automatic_type_conversion(value);
7330 type_t *orig_type = value->base.type;
7331 if (!is_type_valid(orig_type))
7334 set_address_taken(value, false);
7336 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7339 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
7340 static expression_t *parse_##unexpression_type(unsigned precedence) \
7342 expression_t *unary_expression \
7343 = allocate_expression_zero(unexpression_type); \
7344 unary_expression->base.source_position = *HERE; \
7346 unary_expression->unary.value = parse_sub_expression(precedence); \
7348 sfunc(&unary_expression->unary); \
7350 return unary_expression; \
7353 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7354 semantic_unexpr_arithmetic)
7355 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7356 semantic_unexpr_plus)
7357 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7359 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7360 semantic_dereference)
7361 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7363 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7364 semantic_unexpr_integer)
7365 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7367 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7370 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
7372 static expression_t *parse_##unexpression_type(unsigned precedence, \
7373 expression_t *left) \
7375 (void) precedence; \
7377 expression_t *unary_expression \
7378 = allocate_expression_zero(unexpression_type); \
7379 unary_expression->base.source_position = *HERE; \
7381 unary_expression->unary.value = left; \
7383 sfunc(&unary_expression->unary); \
7385 return unary_expression; \
7388 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7389 EXPR_UNARY_POSTFIX_INCREMENT,
7391 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7392 EXPR_UNARY_POSTFIX_DECREMENT,
7395 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7397 /* TODO: handle complex + imaginary types */
7399 /* § 6.3.1.8 Usual arithmetic conversions */
7400 if (type_left == type_long_double || type_right == type_long_double) {
7401 return type_long_double;
7402 } else if (type_left == type_double || type_right == type_double) {
7404 } else if (type_left == type_float || type_right == type_float) {
7408 type_left = promote_integer(type_left);
7409 type_right = promote_integer(type_right);
7411 if (type_left == type_right)
7414 bool const signed_left = is_type_signed(type_left);
7415 bool const signed_right = is_type_signed(type_right);
7416 int const rank_left = get_rank(type_left);
7417 int const rank_right = get_rank(type_right);
7419 if (signed_left == signed_right)
7420 return rank_left >= rank_right ? type_left : type_right;
7429 u_rank = rank_right;
7430 u_type = type_right;
7432 s_rank = rank_right;
7433 s_type = type_right;
7438 if (u_rank >= s_rank)
7441 /* casting rank to atomic_type_kind is a bit hacky, but makes things
7443 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
7444 > get_atomic_type_size((atomic_type_kind_t) u_rank))
7448 case ATOMIC_TYPE_INT: return type_unsigned_int;
7449 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7450 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7452 default: panic("invalid atomic type");
7457 * Check the semantic restrictions for a binary expression.
7459 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7461 expression_t *const left = expression->left;
7462 expression_t *const right = expression->right;
7463 type_t *const orig_type_left = left->base.type;
7464 type_t *const orig_type_right = right->base.type;
7465 type_t *const type_left = skip_typeref(orig_type_left);
7466 type_t *const type_right = skip_typeref(orig_type_right);
7468 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7469 /* TODO: improve error message */
7470 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7471 errorf(&expression->base.source_position,
7472 "operation needs arithmetic types");
7477 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7478 expression->left = create_implicit_cast(left, arithmetic_type);
7479 expression->right = create_implicit_cast(right, arithmetic_type);
7480 expression->base.type = arithmetic_type;
7483 static void warn_div_by_zero(binary_expression_t const *const expression)
7485 if (warning.div_by_zero &&
7486 is_type_integer(expression->base.type) &&
7487 is_constant_expression(expression->right) &&
7488 fold_constant(expression->right) == 0) {
7489 warningf(&expression->base.source_position, "division by zero");
7494 * Check the semantic restrictions for a div/mod expression.
7496 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
7497 semantic_binexpr_arithmetic(expression);
7498 warn_div_by_zero(expression);
7501 static void semantic_shift_op(binary_expression_t *expression)
7503 expression_t *const left = expression->left;
7504 expression_t *const right = expression->right;
7505 type_t *const orig_type_left = left->base.type;
7506 type_t *const orig_type_right = right->base.type;
7507 type_t * type_left = skip_typeref(orig_type_left);
7508 type_t * type_right = skip_typeref(orig_type_right);
7510 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7511 /* TODO: improve error message */
7512 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7513 errorf(&expression->base.source_position,
7514 "operands of shift operation must have integer types");
7519 type_left = promote_integer(type_left);
7520 type_right = promote_integer(type_right);
7522 expression->left = create_implicit_cast(left, type_left);
7523 expression->right = create_implicit_cast(right, type_right);
7524 expression->base.type = type_left;
7527 static void semantic_add(binary_expression_t *expression)
7529 expression_t *const left = expression->left;
7530 expression_t *const right = expression->right;
7531 type_t *const orig_type_left = left->base.type;
7532 type_t *const orig_type_right = right->base.type;
7533 type_t *const type_left = skip_typeref(orig_type_left);
7534 type_t *const type_right = skip_typeref(orig_type_right);
7537 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7538 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7539 expression->left = create_implicit_cast(left, arithmetic_type);
7540 expression->right = create_implicit_cast(right, arithmetic_type);
7541 expression->base.type = arithmetic_type;
7543 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7544 check_pointer_arithmetic(&expression->base.source_position,
7545 type_left, orig_type_left);
7546 expression->base.type = type_left;
7547 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7548 check_pointer_arithmetic(&expression->base.source_position,
7549 type_right, orig_type_right);
7550 expression->base.type = type_right;
7551 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7552 errorf(&expression->base.source_position,
7553 "invalid operands to binary + ('%T', '%T')",
7554 orig_type_left, orig_type_right);
7558 static void semantic_sub(binary_expression_t *expression)
7560 expression_t *const left = expression->left;
7561 expression_t *const right = expression->right;
7562 type_t *const orig_type_left = left->base.type;
7563 type_t *const orig_type_right = right->base.type;
7564 type_t *const type_left = skip_typeref(orig_type_left);
7565 type_t *const type_right = skip_typeref(orig_type_right);
7566 source_position_t const *const pos = &expression->base.source_position;
7569 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7570 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7571 expression->left = create_implicit_cast(left, arithmetic_type);
7572 expression->right = create_implicit_cast(right, arithmetic_type);
7573 expression->base.type = arithmetic_type;
7575 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7576 check_pointer_arithmetic(&expression->base.source_position,
7577 type_left, orig_type_left);
7578 expression->base.type = type_left;
7579 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7580 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7581 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7582 if (!types_compatible(unqual_left, unqual_right)) {
7584 "subtracting pointers to incompatible types '%T' and '%T'",
7585 orig_type_left, orig_type_right);
7586 } else if (!is_type_object(unqual_left)) {
7587 if (is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
7588 warningf(pos, "subtracting pointers to void");
7590 errorf(pos, "subtracting pointers to non-object types '%T'",
7594 expression->base.type = type_ptrdiff_t;
7595 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7596 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7597 orig_type_left, orig_type_right);
7602 * Check the semantics of comparison expressions.
7604 * @param expression The expression to check.
7606 static void semantic_comparison(binary_expression_t *expression)
7608 expression_t *left = expression->left;
7609 expression_t *right = expression->right;
7610 type_t *orig_type_left = left->base.type;
7611 type_t *orig_type_right = right->base.type;
7613 type_t *type_left = skip_typeref(orig_type_left);
7614 type_t *type_right = skip_typeref(orig_type_right);
7616 /* TODO non-arithmetic types */
7617 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7618 /* test for signed vs unsigned compares */
7619 if (warning.sign_compare &&
7620 (expression->base.kind != EXPR_BINARY_EQUAL &&
7621 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
7622 (is_type_signed(type_left) != is_type_signed(type_right))) {
7624 /* check if 1 of the operands is a constant, in this case we just
7625 * check wether we can safely represent the resulting constant in
7626 * the type of the other operand. */
7627 expression_t *const_expr = NULL;
7628 expression_t *other_expr = NULL;
7630 if (is_constant_expression(left)) {
7633 } else if (is_constant_expression(right)) {
7638 if (const_expr != NULL) {
7639 type_t *other_type = skip_typeref(other_expr->base.type);
7640 long val = fold_constant(const_expr);
7641 /* TODO: check if val can be represented by other_type */
7645 warningf(&expression->base.source_position,
7646 "comparison between signed and unsigned");
7648 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7649 expression->left = create_implicit_cast(left, arithmetic_type);
7650 expression->right = create_implicit_cast(right, arithmetic_type);
7651 expression->base.type = arithmetic_type;
7652 if (warning.float_equal &&
7653 (expression->base.kind == EXPR_BINARY_EQUAL ||
7654 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
7655 is_type_float(arithmetic_type)) {
7656 warningf(&expression->base.source_position,
7657 "comparing floating point with == or != is unsafe");
7659 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7660 /* TODO check compatibility */
7661 } else if (is_type_pointer(type_left)) {
7662 expression->right = create_implicit_cast(right, type_left);
7663 } else if (is_type_pointer(type_right)) {
7664 expression->left = create_implicit_cast(left, type_right);
7665 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7666 type_error_incompatible("invalid operands in comparison",
7667 &expression->base.source_position,
7668 type_left, type_right);
7670 expression->base.type = type_int;
7674 * Checks if a compound type has constant fields.
7676 static bool has_const_fields(const compound_type_t *type)
7678 const scope_t *scope = &type->declaration->scope;
7679 const declaration_t *declaration = scope->declarations;
7681 for (; declaration != NULL; declaration = declaration->next) {
7682 if (declaration->namespc != NAMESPACE_NORMAL)
7685 const type_t *decl_type = skip_typeref(declaration->type);
7686 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
7693 static bool is_valid_assignment_lhs(expression_t const* const left)
7695 type_t *const orig_type_left = revert_automatic_type_conversion(left);
7696 type_t *const type_left = skip_typeref(orig_type_left);
7698 if (!is_lvalue(left)) {
7699 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
7704 if (is_type_array(type_left)) {
7705 errorf(HERE, "cannot assign to arrays ('%E')", left);
7708 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
7709 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
7713 if (is_type_incomplete(type_left)) {
7714 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
7715 left, orig_type_left);
7718 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
7719 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
7720 left, orig_type_left);
7727 static void semantic_arithmetic_assign(binary_expression_t *expression)
7729 expression_t *left = expression->left;
7730 expression_t *right = expression->right;
7731 type_t *orig_type_left = left->base.type;
7732 type_t *orig_type_right = right->base.type;
7734 if (!is_valid_assignment_lhs(left))
7737 type_t *type_left = skip_typeref(orig_type_left);
7738 type_t *type_right = skip_typeref(orig_type_right);
7740 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7741 /* TODO: improve error message */
7742 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7743 errorf(&expression->base.source_position,
7744 "operation needs arithmetic types");
7749 /* combined instructions are tricky. We can't create an implicit cast on
7750 * the left side, because we need the uncasted form for the store.
7751 * The ast2firm pass has to know that left_type must be right_type
7752 * for the arithmetic operation and create a cast by itself */
7753 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7754 expression->right = create_implicit_cast(right, arithmetic_type);
7755 expression->base.type = type_left;
7758 static void semantic_divmod_assign(binary_expression_t *expression)
7760 semantic_arithmetic_assign(expression);
7761 warn_div_by_zero(expression);
7764 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
7766 expression_t *const left = expression->left;
7767 expression_t *const right = expression->right;
7768 type_t *const orig_type_left = left->base.type;
7769 type_t *const orig_type_right = right->base.type;
7770 type_t *const type_left = skip_typeref(orig_type_left);
7771 type_t *const type_right = skip_typeref(orig_type_right);
7773 if (!is_valid_assignment_lhs(left))
7776 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7777 /* combined instructions are tricky. We can't create an implicit cast on
7778 * the left side, because we need the uncasted form for the store.
7779 * The ast2firm pass has to know that left_type must be right_type
7780 * for the arithmetic operation and create a cast by itself */
7781 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
7782 expression->right = create_implicit_cast(right, arithmetic_type);
7783 expression->base.type = type_left;
7784 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7785 check_pointer_arithmetic(&expression->base.source_position,
7786 type_left, orig_type_left);
7787 expression->base.type = type_left;
7788 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7789 errorf(&expression->base.source_position,
7790 "incompatible types '%T' and '%T' in assignment",
7791 orig_type_left, orig_type_right);
7796 * Check the semantic restrictions of a logical expression.
7798 static void semantic_logical_op(binary_expression_t *expression)
7800 expression_t *const left = expression->left;
7801 expression_t *const right = expression->right;
7802 type_t *const orig_type_left = left->base.type;
7803 type_t *const orig_type_right = right->base.type;
7804 type_t *const type_left = skip_typeref(orig_type_left);
7805 type_t *const type_right = skip_typeref(orig_type_right);
7807 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
7808 /* TODO: improve error message */
7809 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7810 errorf(&expression->base.source_position,
7811 "operation needs scalar types");
7816 expression->base.type = type_int;
7820 * Check the semantic restrictions of a binary assign expression.
7822 static void semantic_binexpr_assign(binary_expression_t *expression)
7824 expression_t *left = expression->left;
7825 type_t *orig_type_left = left->base.type;
7827 type_t *type_left = revert_automatic_type_conversion(left);
7828 type_left = skip_typeref(orig_type_left);
7830 if (!is_valid_assignment_lhs(left))
7833 assign_error_t error = semantic_assign(orig_type_left, expression->right);
7834 report_assign_error(error, orig_type_left, expression->right,
7835 "assignment", &left->base.source_position);
7836 expression->right = create_implicit_cast(expression->right, orig_type_left);
7837 expression->base.type = orig_type_left;
7841 * Determine if the outermost operation (or parts thereof) of the given
7842 * expression has no effect in order to generate a warning about this fact.
7843 * Therefore in some cases this only examines some of the operands of the
7844 * expression (see comments in the function and examples below).
7846 * f() + 23; // warning, because + has no effect
7847 * x || f(); // no warning, because x controls execution of f()
7848 * x ? y : f(); // warning, because y has no effect
7849 * (void)x; // no warning to be able to suppress the warning
7850 * This function can NOT be used for an "expression has definitely no effect"-
7852 static bool expression_has_effect(const expression_t *const expr)
7854 switch (expr->kind) {
7855 case EXPR_UNKNOWN: break;
7856 case EXPR_INVALID: return true; /* do NOT warn */
7857 case EXPR_REFERENCE: return false;
7858 /* suppress the warning for microsoft __noop operations */
7859 case EXPR_CONST: return expr->conste.is_ms_noop;
7860 case EXPR_CHARACTER_CONSTANT: return false;
7861 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
7862 case EXPR_STRING_LITERAL: return false;
7863 case EXPR_WIDE_STRING_LITERAL: return false;
7866 const call_expression_t *const call = &expr->call;
7867 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
7870 switch (call->function->builtin_symbol.symbol->ID) {
7871 case T___builtin_va_end: return true;
7872 default: return false;
7876 /* Generate the warning if either the left or right hand side of a
7877 * conditional expression has no effect */
7878 case EXPR_CONDITIONAL: {
7879 const conditional_expression_t *const cond = &expr->conditional;
7881 expression_has_effect(cond->true_expression) &&
7882 expression_has_effect(cond->false_expression);
7885 case EXPR_SELECT: return false;
7886 case EXPR_ARRAY_ACCESS: return false;
7887 case EXPR_SIZEOF: return false;
7888 case EXPR_CLASSIFY_TYPE: return false;
7889 case EXPR_ALIGNOF: return false;
7891 case EXPR_FUNCNAME: return false;
7892 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
7893 case EXPR_BUILTIN_CONSTANT_P: return false;
7894 case EXPR_BUILTIN_PREFETCH: return true;
7895 case EXPR_OFFSETOF: return false;
7896 case EXPR_VA_START: return true;
7897 case EXPR_VA_ARG: return true;
7898 case EXPR_STATEMENT: return true; // TODO
7899 case EXPR_COMPOUND_LITERAL: return false;
7901 case EXPR_UNARY_NEGATE: return false;
7902 case EXPR_UNARY_PLUS: return false;
7903 case EXPR_UNARY_BITWISE_NEGATE: return false;
7904 case EXPR_UNARY_NOT: return false;
7905 case EXPR_UNARY_DEREFERENCE: return false;
7906 case EXPR_UNARY_TAKE_ADDRESS: return false;
7907 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
7908 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
7909 case EXPR_UNARY_PREFIX_INCREMENT: return true;
7910 case EXPR_UNARY_PREFIX_DECREMENT: return true;
7912 /* Treat void casts as if they have an effect in order to being able to
7913 * suppress the warning */
7914 case EXPR_UNARY_CAST: {
7915 type_t *const type = skip_typeref(expr->base.type);
7916 return is_type_atomic(type, ATOMIC_TYPE_VOID);
7919 case EXPR_UNARY_CAST_IMPLICIT: return true;
7920 case EXPR_UNARY_ASSUME: return true;
7922 case EXPR_BINARY_ADD: return false;
7923 case EXPR_BINARY_SUB: return false;
7924 case EXPR_BINARY_MUL: return false;
7925 case EXPR_BINARY_DIV: return false;
7926 case EXPR_BINARY_MOD: return false;
7927 case EXPR_BINARY_EQUAL: return false;
7928 case EXPR_BINARY_NOTEQUAL: return false;
7929 case EXPR_BINARY_LESS: return false;
7930 case EXPR_BINARY_LESSEQUAL: return false;
7931 case EXPR_BINARY_GREATER: return false;
7932 case EXPR_BINARY_GREATEREQUAL: return false;
7933 case EXPR_BINARY_BITWISE_AND: return false;
7934 case EXPR_BINARY_BITWISE_OR: return false;
7935 case EXPR_BINARY_BITWISE_XOR: return false;
7936 case EXPR_BINARY_SHIFTLEFT: return false;
7937 case EXPR_BINARY_SHIFTRIGHT: return false;
7938 case EXPR_BINARY_ASSIGN: return true;
7939 case EXPR_BINARY_MUL_ASSIGN: return true;
7940 case EXPR_BINARY_DIV_ASSIGN: return true;
7941 case EXPR_BINARY_MOD_ASSIGN: return true;
7942 case EXPR_BINARY_ADD_ASSIGN: return true;
7943 case EXPR_BINARY_SUB_ASSIGN: return true;
7944 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
7945 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
7946 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
7947 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
7948 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
7950 /* Only examine the right hand side of && and ||, because the left hand
7951 * side already has the effect of controlling the execution of the right
7953 case EXPR_BINARY_LOGICAL_AND:
7954 case EXPR_BINARY_LOGICAL_OR:
7955 /* Only examine the right hand side of a comma expression, because the left
7956 * hand side has a separate warning */
7957 case EXPR_BINARY_COMMA:
7958 return expression_has_effect(expr->binary.right);
7960 case EXPR_BINARY_BUILTIN_EXPECT: return true;
7961 case EXPR_BINARY_ISGREATER: return false;
7962 case EXPR_BINARY_ISGREATEREQUAL: return false;
7963 case EXPR_BINARY_ISLESS: return false;
7964 case EXPR_BINARY_ISLESSEQUAL: return false;
7965 case EXPR_BINARY_ISLESSGREATER: return false;
7966 case EXPR_BINARY_ISUNORDERED: return false;
7969 internal_errorf(HERE, "unexpected expression");
7972 static void semantic_comma(binary_expression_t *expression)
7974 if (warning.unused_value) {
7975 const expression_t *const left = expression->left;
7976 if (!expression_has_effect(left)) {
7977 warningf(&left->base.source_position,
7978 "left-hand operand of comma expression has no effect");
7981 expression->base.type = expression->right->base.type;
7984 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
7985 static expression_t *parse_##binexpression_type(unsigned precedence, \
7986 expression_t *left) \
7988 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
7989 binexpr->base.source_position = *HERE; \
7990 binexpr->binary.left = left; \
7993 expression_t *right = parse_sub_expression(precedence + lr); \
7995 binexpr->binary.right = right; \
7996 sfunc(&binexpr->binary); \
8001 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
8002 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
8003 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_divmod_arithmetic, 1)
8004 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_divmod_arithmetic, 1)
8005 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
8006 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
8007 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
8008 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
8009 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
8011 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
8012 semantic_comparison, 1)
8013 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
8014 semantic_comparison, 1)
8015 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
8016 semantic_comparison, 1)
8017 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
8018 semantic_comparison, 1)
8020 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
8021 semantic_binexpr_arithmetic, 1)
8022 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
8023 semantic_binexpr_arithmetic, 1)
8024 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
8025 semantic_binexpr_arithmetic, 1)
8026 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
8027 semantic_logical_op, 1)
8028 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
8029 semantic_logical_op, 1)
8030 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
8031 semantic_shift_op, 1)
8032 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
8033 semantic_shift_op, 1)
8034 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
8035 semantic_arithmetic_addsubb_assign, 0)
8036 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
8037 semantic_arithmetic_addsubb_assign, 0)
8038 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
8039 semantic_arithmetic_assign, 0)
8040 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
8041 semantic_divmod_assign, 0)
8042 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
8043 semantic_divmod_assign, 0)
8044 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
8045 semantic_arithmetic_assign, 0)
8046 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8047 semantic_arithmetic_assign, 0)
8048 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
8049 semantic_arithmetic_assign, 0)
8050 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
8051 semantic_arithmetic_assign, 0)
8052 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
8053 semantic_arithmetic_assign, 0)
8055 static expression_t *parse_sub_expression(unsigned precedence)
8057 if (token.type < 0) {
8058 return expected_expression_error();
8061 expression_parser_function_t *parser
8062 = &expression_parsers[token.type];
8063 source_position_t source_position = token.source_position;
8066 if (parser->parser != NULL) {
8067 left = parser->parser(parser->precedence);
8069 left = parse_primary_expression();
8071 assert(left != NULL);
8072 left->base.source_position = source_position;
8075 if (token.type < 0) {
8076 return expected_expression_error();
8079 parser = &expression_parsers[token.type];
8080 if (parser->infix_parser == NULL)
8082 if (parser->infix_precedence < precedence)
8085 left = parser->infix_parser(parser->infix_precedence, left);
8087 assert(left != NULL);
8088 assert(left->kind != EXPR_UNKNOWN);
8089 left->base.source_position = source_position;
8096 * Parse an expression.
8098 static expression_t *parse_expression(void)
8100 return parse_sub_expression(1);
8104 * Register a parser for a prefix-like operator with given precedence.
8106 * @param parser the parser function
8107 * @param token_type the token type of the prefix token
8108 * @param precedence the precedence of the operator
8110 static void register_expression_parser(parse_expression_function parser,
8111 int token_type, unsigned precedence)
8113 expression_parser_function_t *entry = &expression_parsers[token_type];
8115 if (entry->parser != NULL) {
8116 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8117 panic("trying to register multiple expression parsers for a token");
8119 entry->parser = parser;
8120 entry->precedence = precedence;
8124 * Register a parser for an infix operator with given precedence.
8126 * @param parser the parser function
8127 * @param token_type the token type of the infix operator
8128 * @param precedence the precedence of the operator
8130 static void register_infix_parser(parse_expression_infix_function parser,
8131 int token_type, unsigned precedence)
8133 expression_parser_function_t *entry = &expression_parsers[token_type];
8135 if (entry->infix_parser != NULL) {
8136 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8137 panic("trying to register multiple infix expression parsers for a "
8140 entry->infix_parser = parser;
8141 entry->infix_precedence = precedence;
8145 * Initialize the expression parsers.
8147 static void init_expression_parsers(void)
8149 memset(&expression_parsers, 0, sizeof(expression_parsers));
8151 register_infix_parser(parse_array_expression, '[', 30);
8152 register_infix_parser(parse_call_expression, '(', 30);
8153 register_infix_parser(parse_select_expression, '.', 30);
8154 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
8155 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
8157 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
8160 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 17);
8161 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 17);
8162 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 17);
8163 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 16);
8164 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 16);
8165 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 15);
8166 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 15);
8167 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
8168 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
8169 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
8170 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
8171 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
8172 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
8173 T_EXCLAMATIONMARKEQUAL, 13);
8174 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
8175 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
8176 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
8177 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
8178 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
8179 register_infix_parser(parse_conditional_expression, '?', 7);
8180 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
8181 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
8182 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
8183 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
8184 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
8185 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
8186 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
8187 T_LESSLESSEQUAL, 2);
8188 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8189 T_GREATERGREATEREQUAL, 2);
8190 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
8192 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
8194 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
8197 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
8199 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
8200 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
8201 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
8202 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
8203 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
8204 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
8205 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
8207 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
8209 register_expression_parser(parse_sizeof, T_sizeof, 25);
8210 register_expression_parser(parse_alignof, T___alignof__, 25);
8211 register_expression_parser(parse_extension, T___extension__, 25);
8212 register_expression_parser(parse_builtin_classify_type,
8213 T___builtin_classify_type, 25);
8217 * Parse a asm statement arguments specification.
8219 static asm_argument_t *parse_asm_arguments(bool is_out)
8221 asm_argument_t *result = NULL;
8222 asm_argument_t *last = NULL;
8224 while (token.type == T_STRING_LITERAL || token.type == '[') {
8225 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8226 memset(argument, 0, sizeof(argument[0]));
8228 if (token.type == '[') {
8230 if (token.type != T_IDENTIFIER) {
8231 parse_error_expected("while parsing asm argument",
8232 T_IDENTIFIER, NULL);
8235 argument->symbol = token.v.symbol;
8240 argument->constraints = parse_string_literals();
8242 add_anchor_token(')');
8243 expression_t *expression = parse_expression();
8244 rem_anchor_token(')');
8246 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8247 * change size or type representation (e.g. int -> long is ok, but
8248 * int -> float is not) */
8249 if (expression->kind == EXPR_UNARY_CAST) {
8250 type_t *const type = expression->base.type;
8251 type_kind_t const kind = type->kind;
8252 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8255 if (kind == TYPE_ATOMIC) {
8256 atomic_type_kind_t const akind = type->atomic.akind;
8257 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8258 size = get_atomic_type_size(akind);
8260 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8261 size = get_atomic_type_size(get_intptr_kind());
8265 expression_t *const value = expression->unary.value;
8266 type_t *const value_type = value->base.type;
8267 type_kind_t const value_kind = value_type->kind;
8269 unsigned value_flags;
8270 unsigned value_size;
8271 if (value_kind == TYPE_ATOMIC) {
8272 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8273 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8274 value_size = get_atomic_type_size(value_akind);
8275 } else if (value_kind == TYPE_POINTER) {
8276 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8277 value_size = get_atomic_type_size(get_intptr_kind());
8282 if (value_flags != flags || value_size != size)
8286 } while (expression->kind == EXPR_UNARY_CAST);
8290 if (!is_lvalue(expression)) {
8291 errorf(&expression->base.source_position,
8292 "asm output argument is not an lvalue");
8295 argument->expression = expression;
8298 set_address_taken(expression, true);
8301 last->next = argument;
8307 if (token.type != ',')
8318 * Parse a asm statement clobber specification.
8320 static asm_clobber_t *parse_asm_clobbers(void)
8322 asm_clobber_t *result = NULL;
8323 asm_clobber_t *last = NULL;
8325 while(token.type == T_STRING_LITERAL) {
8326 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8327 clobber->clobber = parse_string_literals();
8330 last->next = clobber;
8336 if (token.type != ',')
8345 * Parse an asm statement.
8347 static statement_t *parse_asm_statement(void)
8351 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8352 statement->base.source_position = token.source_position;
8354 asm_statement_t *asm_statement = &statement->asms;
8356 if (token.type == T_volatile) {
8358 asm_statement->is_volatile = true;
8362 add_anchor_token(')');
8363 add_anchor_token(':');
8364 asm_statement->asm_text = parse_string_literals();
8366 if (token.type != ':') {
8367 rem_anchor_token(':');
8372 asm_statement->outputs = parse_asm_arguments(true);
8373 if (token.type != ':') {
8374 rem_anchor_token(':');
8379 asm_statement->inputs = parse_asm_arguments(false);
8380 if (token.type != ':') {
8381 rem_anchor_token(':');
8384 rem_anchor_token(':');
8387 asm_statement->clobbers = parse_asm_clobbers();
8390 rem_anchor_token(')');
8394 if (asm_statement->outputs == NULL) {
8395 /* GCC: An 'asm' instruction without any output operands will be treated
8396 * identically to a volatile 'asm' instruction. */
8397 asm_statement->is_volatile = true;
8402 return create_invalid_statement();
8406 * Parse a case statement.
8408 static statement_t *parse_case_statement(void)
8412 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8413 source_position_t *const pos = &statement->base.source_position;
8415 *pos = token.source_position;
8416 statement->case_label.expression = parse_expression();
8417 if (! is_constant_expression(statement->case_label.expression)) {
8418 errorf(pos, "case label does not reduce to an integer constant");
8419 statement->case_label.is_bad = true;
8421 long const val = fold_constant(statement->case_label.expression);
8422 statement->case_label.first_case = val;
8423 statement->case_label.last_case = val;
8426 if (c_mode & _GNUC) {
8427 if (token.type == T_DOTDOTDOT) {
8429 statement->case_label.end_range = parse_expression();
8430 if (! is_constant_expression(statement->case_label.end_range)) {
8431 errorf(pos, "case range does not reduce to an integer constant");
8432 statement->case_label.is_bad = true;
8434 long const val = fold_constant(statement->case_label.end_range);
8435 statement->case_label.last_case = val;
8437 if (val < statement->case_label.first_case) {
8438 statement->case_label.is_empty = true;
8439 warningf(pos, "empty range specified");
8445 PUSH_PARENT(statement);
8449 if (current_switch != NULL) {
8450 if (! statement->case_label.is_bad) {
8451 /* Check for duplicate case values */
8452 case_label_statement_t *c = &statement->case_label;
8453 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8454 if (l->is_bad || l->is_empty || l->expression == NULL)
8457 if (c->last_case < l->first_case || c->first_case > l->last_case)
8460 errorf(pos, "duplicate case value (previously used %P)",
8461 &l->base.source_position);
8465 /* link all cases into the switch statement */
8466 if (current_switch->last_case == NULL) {
8467 current_switch->first_case = &statement->case_label;
8469 current_switch->last_case->next = &statement->case_label;
8471 current_switch->last_case = &statement->case_label;
8473 errorf(pos, "case label not within a switch statement");
8476 statement_t *const inner_stmt = parse_statement();
8477 statement->case_label.statement = inner_stmt;
8478 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8479 errorf(&inner_stmt->base.source_position, "declaration after case label");
8486 return create_invalid_statement();
8490 * Parse a default statement.
8492 static statement_t *parse_default_statement(void)
8496 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8497 statement->base.source_position = token.source_position;
8499 PUSH_PARENT(statement);
8502 if (current_switch != NULL) {
8503 const case_label_statement_t *def_label = current_switch->default_label;
8504 if (def_label != NULL) {
8505 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
8506 &def_label->base.source_position);
8508 current_switch->default_label = &statement->case_label;
8510 /* link all cases into the switch statement */
8511 if (current_switch->last_case == NULL) {
8512 current_switch->first_case = &statement->case_label;
8514 current_switch->last_case->next = &statement->case_label;
8516 current_switch->last_case = &statement->case_label;
8519 errorf(&statement->base.source_position,
8520 "'default' label not within a switch statement");
8523 statement_t *const inner_stmt = parse_statement();
8524 statement->case_label.statement = inner_stmt;
8525 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8526 errorf(&inner_stmt->base.source_position, "declaration after default label");
8533 return create_invalid_statement();
8537 * Return the declaration for a given label symbol or create a new one.
8539 * @param symbol the symbol of the label
8541 static declaration_t *get_label(symbol_t *symbol)
8543 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
8544 assert(current_function != NULL);
8545 /* if we found a label in the same function, then we already created the
8547 if (candidate != NULL
8548 && candidate->parent_scope == ¤t_function->scope) {
8552 /* otherwise we need to create a new one */
8553 declaration_t *const declaration = allocate_declaration_zero();
8554 declaration->namespc = NAMESPACE_LABEL;
8555 declaration->symbol = symbol;
8557 label_push(declaration);
8563 * Parse a label statement.
8565 static statement_t *parse_label_statement(void)
8567 assert(token.type == T_IDENTIFIER);
8568 symbol_t *symbol = token.v.symbol;
8571 declaration_t *label = get_label(symbol);
8573 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8574 statement->base.source_position = token.source_position;
8575 statement->label.label = label;
8577 PUSH_PARENT(statement);
8579 /* if source position is already set then the label is defined twice,
8580 * otherwise it was just mentioned in a goto so far */
8581 if (label->source_position.input_name != NULL) {
8582 errorf(HERE, "duplicate label '%Y' (declared %P)",
8583 symbol, &label->source_position);
8585 label->source_position = token.source_position;
8586 label->init.statement = statement;
8591 if (token.type == '}') {
8592 /* TODO only warn? */
8594 warningf(HERE, "label at end of compound statement");
8595 statement->label.statement = create_empty_statement();
8597 errorf(HERE, "label at end of compound statement");
8598 statement->label.statement = create_invalid_statement();
8600 } else if (token.type == ';') {
8601 /* Eat an empty statement here, to avoid the warning about an empty
8602 * statement after a label. label:; is commonly used to have a label
8603 * before a closing brace. */
8604 statement->label.statement = create_empty_statement();
8607 statement_t *const inner_stmt = parse_statement();
8608 statement->label.statement = inner_stmt;
8609 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8610 errorf(&inner_stmt->base.source_position, "declaration after label");
8614 /* remember the labels in a list for later checking */
8615 if (label_last == NULL) {
8616 label_first = &statement->label;
8618 label_last->next = &statement->label;
8620 label_last = &statement->label;
8627 * Parse an if statement.
8629 static statement_t *parse_if(void)
8633 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
8634 statement->base.source_position = token.source_position;
8636 PUSH_PARENT(statement);
8639 add_anchor_token(')');
8640 statement->ifs.condition = parse_expression();
8641 rem_anchor_token(')');
8644 add_anchor_token(T_else);
8645 statement->ifs.true_statement = parse_statement();
8646 rem_anchor_token(T_else);
8648 if (token.type == T_else) {
8650 statement->ifs.false_statement = parse_statement();
8657 return create_invalid_statement();
8661 * Check that all enums are handled in a switch.
8663 * @param statement the switch statement to check
8665 static void check_enum_cases(const switch_statement_t *statement) {
8666 const type_t *type = skip_typeref(statement->expression->base.type);
8667 if (! is_type_enum(type))
8669 const enum_type_t *enumt = &type->enumt;
8671 /* if we have a default, no warnings */
8672 if (statement->default_label != NULL)
8675 /* FIXME: calculation of value should be done while parsing */
8676 const declaration_t *declaration;
8677 long last_value = -1;
8678 for (declaration = enumt->declaration->next;
8679 declaration != NULL && declaration->storage_class == STORAGE_CLASS_ENUM_ENTRY;
8680 declaration = declaration->next) {
8681 const expression_t *expression = declaration->init.enum_value;
8682 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
8684 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
8685 if (l->expression == NULL)
8687 if (l->first_case <= value && value <= l->last_case) {
8693 warningf(&statement->base.source_position,
8694 "enumeration value '%Y' not handled in switch", declaration->symbol);
8701 * Parse a switch statement.
8703 static statement_t *parse_switch(void)
8707 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
8708 statement->base.source_position = token.source_position;
8710 PUSH_PARENT(statement);
8713 add_anchor_token(')');
8714 expression_t *const expr = parse_expression();
8715 type_t * type = skip_typeref(expr->base.type);
8716 if (is_type_integer(type)) {
8717 type = promote_integer(type);
8718 if (warning.traditional) {
8719 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
8720 warningf(&expr->base.source_position,
8721 "'%T' switch expression not converted to '%T' in ISO C",
8725 } else if (is_type_valid(type)) {
8726 errorf(&expr->base.source_position,
8727 "switch quantity is not an integer, but '%T'", type);
8728 type = type_error_type;
8730 statement->switchs.expression = create_implicit_cast(expr, type);
8732 rem_anchor_token(')');
8734 switch_statement_t *rem = current_switch;
8735 current_switch = &statement->switchs;
8736 statement->switchs.body = parse_statement();
8737 current_switch = rem;
8739 if (warning.switch_default &&
8740 statement->switchs.default_label == NULL) {
8741 warningf(&statement->base.source_position, "switch has no default case");
8743 if (warning.switch_enum)
8744 check_enum_cases(&statement->switchs);
8750 return create_invalid_statement();
8753 static statement_t *parse_loop_body(statement_t *const loop)
8755 statement_t *const rem = current_loop;
8756 current_loop = loop;
8758 statement_t *const body = parse_statement();
8765 * Parse a while statement.
8767 static statement_t *parse_while(void)
8771 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
8772 statement->base.source_position = token.source_position;
8774 PUSH_PARENT(statement);
8777 add_anchor_token(')');
8778 statement->whiles.condition = parse_expression();
8779 rem_anchor_token(')');
8782 statement->whiles.body = parse_loop_body(statement);
8788 return create_invalid_statement();
8792 * Parse a do statement.
8794 static statement_t *parse_do(void)
8798 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
8799 statement->base.source_position = token.source_position;
8801 PUSH_PARENT(statement)
8803 add_anchor_token(T_while);
8804 statement->do_while.body = parse_loop_body(statement);
8805 rem_anchor_token(T_while);
8809 add_anchor_token(')');
8810 statement->do_while.condition = parse_expression();
8811 rem_anchor_token(')');
8819 return create_invalid_statement();
8823 * Parse a for statement.
8825 static statement_t *parse_for(void)
8829 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
8830 statement->base.source_position = token.source_position;
8832 PUSH_PARENT(statement);
8834 int top = environment_top();
8835 scope_t *last_scope = scope;
8836 set_scope(&statement->fors.scope);
8839 add_anchor_token(')');
8841 if (token.type != ';') {
8842 if (is_declaration_specifier(&token, false)) {
8843 parse_declaration(record_declaration);
8845 add_anchor_token(';');
8846 expression_t *const init = parse_expression();
8847 statement->fors.initialisation = init;
8848 if (warning.unused_value && !expression_has_effect(init)) {
8849 warningf(&init->base.source_position,
8850 "initialisation of 'for'-statement has no effect");
8852 rem_anchor_token(';');
8859 if (token.type != ';') {
8860 add_anchor_token(';');
8861 statement->fors.condition = parse_expression();
8862 rem_anchor_token(';');
8865 if (token.type != ')') {
8866 expression_t *const step = parse_expression();
8867 statement->fors.step = step;
8868 if (warning.unused_value && !expression_has_effect(step)) {
8869 warningf(&step->base.source_position,
8870 "step of 'for'-statement has no effect");
8873 rem_anchor_token(')');
8875 statement->fors.body = parse_loop_body(statement);
8877 assert(scope == &statement->fors.scope);
8878 set_scope(last_scope);
8879 environment_pop_to(top);
8886 rem_anchor_token(')');
8887 assert(scope == &statement->fors.scope);
8888 set_scope(last_scope);
8889 environment_pop_to(top);
8891 return create_invalid_statement();
8895 * Parse a goto statement.
8897 static statement_t *parse_goto(void)
8901 if (token.type != T_IDENTIFIER) {
8902 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
8906 symbol_t *symbol = token.v.symbol;
8909 declaration_t *label = get_label(symbol);
8911 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
8912 statement->base.source_position = token.source_position;
8914 statement->gotos.label = label;
8916 /* remember the goto's in a list for later checking */
8917 if (goto_last == NULL) {
8918 goto_first = &statement->gotos;
8920 goto_last->next = &statement->gotos;
8922 goto_last = &statement->gotos;
8928 return create_invalid_statement();
8932 * Parse a continue statement.
8934 static statement_t *parse_continue(void)
8936 if (current_loop == NULL) {
8937 errorf(HERE, "continue statement not within loop");
8940 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
8941 statement->base.source_position = token.source_position;
8951 * Parse a break statement.
8953 static statement_t *parse_break(void)
8955 if (current_switch == NULL && current_loop == NULL) {
8956 errorf(HERE, "break statement not within loop or switch");
8959 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
8960 statement->base.source_position = token.source_position;
8970 * Parse a __leave statement.
8972 static statement_t *parse_leave(void)
8974 if (current_try == NULL) {
8975 errorf(HERE, "__leave statement not within __try");
8978 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
8979 statement->base.source_position = token.source_position;
8989 * Check if a given declaration represents a local variable.
8991 static bool is_local_var_declaration(const declaration_t *declaration)
8993 switch ((storage_class_tag_t) declaration->storage_class) {
8994 case STORAGE_CLASS_AUTO:
8995 case STORAGE_CLASS_REGISTER: {
8996 const type_t *type = skip_typeref(declaration->type);
8997 if (is_type_function(type)) {
9009 * Check if a given declaration represents a variable.
9011 static bool is_var_declaration(const declaration_t *declaration)
9013 if (declaration->storage_class == STORAGE_CLASS_TYPEDEF)
9016 const type_t *type = skip_typeref(declaration->type);
9017 return !is_type_function(type);
9021 * Check if a given expression represents a local variable.
9023 static bool is_local_variable(const expression_t *expression)
9025 if (expression->base.kind != EXPR_REFERENCE) {
9028 const declaration_t *declaration = expression->reference.declaration;
9029 return is_local_var_declaration(declaration);
9033 * Check if a given expression represents a local variable and
9034 * return its declaration then, else return NULL.
9036 declaration_t *expr_is_variable(const expression_t *expression)
9038 if (expression->base.kind != EXPR_REFERENCE) {
9041 declaration_t *declaration = expression->reference.declaration;
9042 if (is_var_declaration(declaration))
9048 * Parse a return statement.
9050 static statement_t *parse_return(void)
9052 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9053 statement->base.source_position = token.source_position;
9057 expression_t *return_value = NULL;
9058 if (token.type != ';') {
9059 return_value = parse_expression();
9062 const type_t *const func_type = current_function->type;
9063 assert(is_type_function(func_type));
9064 type_t *const return_type = skip_typeref(func_type->function.return_type);
9066 if (return_value != NULL) {
9067 type_t *return_value_type = skip_typeref(return_value->base.type);
9069 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)
9070 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9071 warningf(&statement->base.source_position,
9072 "'return' with a value, in function returning void");
9073 return_value = NULL;
9075 assign_error_t error = semantic_assign(return_type, return_value);
9076 report_assign_error(error, return_type, return_value, "'return'",
9077 &statement->base.source_position);
9078 return_value = create_implicit_cast(return_value, return_type);
9080 /* check for returning address of a local var */
9081 if (return_value != NULL &&
9082 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9083 const expression_t *expression = return_value->unary.value;
9084 if (is_local_variable(expression)) {
9085 warningf(&statement->base.source_position,
9086 "function returns address of local variable");
9090 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9091 warningf(&statement->base.source_position,
9092 "'return' without value, in function returning non-void");
9095 statement->returns.value = return_value;
9104 * Parse a declaration statement.
9106 static statement_t *parse_declaration_statement(void)
9108 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9110 statement->base.source_position = token.source_position;
9112 declaration_t *before = last_declaration;
9113 parse_declaration(record_declaration);
9115 if (before == NULL) {
9116 statement->declaration.declarations_begin = scope->declarations;
9118 statement->declaration.declarations_begin = before->next;
9120 statement->declaration.declarations_end = last_declaration;
9126 * Parse an expression statement, ie. expr ';'.
9128 static statement_t *parse_expression_statement(void)
9130 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9132 statement->base.source_position = token.source_position;
9133 expression_t *const expr = parse_expression();
9134 statement->expression.expression = expr;
9143 * Parse a microsoft __try { } __finally { } or
9144 * __try{ } __except() { }
9146 static statement_t *parse_ms_try_statment(void)
9148 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9149 statement->base.source_position = token.source_position;
9152 PUSH_PARENT(statement);
9154 ms_try_statement_t *rem = current_try;
9155 current_try = &statement->ms_try;
9156 statement->ms_try.try_statement = parse_compound_statement(false);
9161 if (token.type == T___except) {
9164 add_anchor_token(')');
9165 expression_t *const expr = parse_expression();
9166 type_t * type = skip_typeref(expr->base.type);
9167 if (is_type_integer(type)) {
9168 type = promote_integer(type);
9169 } else if (is_type_valid(type)) {
9170 errorf(&expr->base.source_position,
9171 "__expect expression is not an integer, but '%T'", type);
9172 type = type_error_type;
9174 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9175 rem_anchor_token(')');
9177 statement->ms_try.final_statement = parse_compound_statement(false);
9178 } else if (token.type == T__finally) {
9180 statement->ms_try.final_statement = parse_compound_statement(false);
9182 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9183 return create_invalid_statement();
9187 return create_invalid_statement();
9190 static statement_t *parse_empty_statement(void)
9192 if (warning.empty_statement) {
9193 warningf(HERE, "statement is empty");
9195 statement_t *const statement = create_empty_statement();
9201 * Parse a statement.
9202 * There's also parse_statement() which additionally checks for
9203 * "statement has no effect" warnings
9205 static statement_t *intern_parse_statement(void)
9207 statement_t *statement = NULL;
9209 /* declaration or statement */
9210 add_anchor_token(';');
9211 switch (token.type) {
9212 case T_IDENTIFIER: {
9213 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
9214 if (la1_type == ':') {
9215 statement = parse_label_statement();
9216 } else if (is_typedef_symbol(token.v.symbol)) {
9217 statement = parse_declaration_statement();
9218 } else switch (la1_type) {
9222 statement = parse_declaration_statement();
9226 statement = parse_expression_statement();
9232 case T___extension__:
9233 /* This can be a prefix to a declaration or an expression statement.
9234 * We simply eat it now and parse the rest with tail recursion. */
9237 } while (token.type == T___extension__);
9238 statement = parse_statement();
9242 statement = parse_declaration_statement();
9245 case ';': statement = parse_empty_statement(); break;
9246 case '{': statement = parse_compound_statement(false); break;
9247 case T___leave: statement = parse_leave(); break;
9248 case T___try: statement = parse_ms_try_statment(); break;
9249 case T_asm: statement = parse_asm_statement(); break;
9250 case T_break: statement = parse_break(); break;
9251 case T_case: statement = parse_case_statement(); break;
9252 case T_continue: statement = parse_continue(); break;
9253 case T_default: statement = parse_default_statement(); break;
9254 case T_do: statement = parse_do(); break;
9255 case T_for: statement = parse_for(); break;
9256 case T_goto: statement = parse_goto(); break;
9257 case T_if: statement = parse_if (); break;
9258 case T_return: statement = parse_return(); break;
9259 case T_switch: statement = parse_switch(); break;
9260 case T_while: statement = parse_while(); break;
9261 default: statement = parse_expression_statement(); break;
9263 rem_anchor_token(';');
9265 assert(statement != NULL
9266 && statement->base.source_position.input_name != NULL);
9272 * parse a statement and emits "statement has no effect" warning if needed
9273 * (This is really a wrapper around intern_parse_statement with check for 1
9274 * single warning. It is needed, because for statement expressions we have
9275 * to avoid the warning on the last statement)
9277 static statement_t *parse_statement(void)
9279 statement_t *statement = intern_parse_statement();
9281 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
9282 expression_t *expression = statement->expression.expression;
9283 if (!expression_has_effect(expression)) {
9284 warningf(&expression->base.source_position,
9285 "statement has no effect");
9293 * Parse a compound statement.
9295 static statement_t *parse_compound_statement(bool inside_expression_statement)
9297 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9298 statement->base.source_position = token.source_position;
9300 PUSH_PARENT(statement);
9303 add_anchor_token('}');
9305 int top = environment_top();
9306 scope_t *last_scope = scope;
9307 set_scope(&statement->compound.scope);
9309 statement_t **anchor = &statement->compound.statements;
9310 bool only_decls_so_far = true;
9311 while (token.type != '}' && token.type != T_EOF) {
9312 statement_t *sub_statement = intern_parse_statement();
9313 if (is_invalid_statement(sub_statement)) {
9314 /* an error occurred. if we are at an anchor, return */
9320 if (warning.declaration_after_statement) {
9321 if (sub_statement->kind != STATEMENT_DECLARATION) {
9322 only_decls_so_far = false;
9323 } else if (!only_decls_so_far) {
9324 warningf(&sub_statement->base.source_position,
9325 "ISO C90 forbids mixed declarations and code");
9329 *anchor = sub_statement;
9331 while (sub_statement->base.next != NULL)
9332 sub_statement = sub_statement->base.next;
9334 anchor = &sub_statement->base.next;
9337 if (token.type == '}') {
9340 errorf(&statement->base.source_position,
9341 "end of file while looking for closing '}'");
9344 /* look over all statements again to produce no effect warnings */
9345 if (warning.unused_value) {
9346 statement_t *sub_statement = statement->compound.statements;
9347 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9348 if (sub_statement->kind != STATEMENT_EXPRESSION)
9350 /* don't emit a warning for the last expression in an expression
9351 * statement as it has always an effect */
9352 if (inside_expression_statement && sub_statement->base.next == NULL)
9355 expression_t *expression = sub_statement->expression.expression;
9356 if (!expression_has_effect(expression)) {
9357 warningf(&expression->base.source_position,
9358 "statement has no effect");
9364 rem_anchor_token('}');
9365 assert(scope == &statement->compound.scope);
9366 set_scope(last_scope);
9367 environment_pop_to(top);
9374 * Initialize builtin types.
9376 static void initialize_builtin_types(void)
9378 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
9379 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
9380 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
9381 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
9382 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
9383 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
9384 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
9385 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
9387 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
9388 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
9389 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
9390 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
9392 /* const version of wchar_t */
9393 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
9394 type_const_wchar_t->typedeft.declaration = type_wchar_t->typedeft.declaration;
9395 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
9397 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
9401 * Check for unused global static functions and variables
9403 static void check_unused_globals(void)
9405 if (!warning.unused_function && !warning.unused_variable)
9408 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
9410 decl->modifiers & DM_UNUSED ||
9411 decl->modifiers & DM_USED ||
9412 decl->storage_class != STORAGE_CLASS_STATIC)
9415 type_t *const type = decl->type;
9417 if (is_type_function(skip_typeref(type))) {
9418 if (!warning.unused_function || decl->is_inline)
9421 s = (decl->init.statement != NULL ? "defined" : "declared");
9423 if (!warning.unused_variable)
9429 warningf(&decl->source_position, "'%#T' %s but not used",
9430 type, decl->symbol, s);
9434 static void parse_global_asm(void)
9439 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9440 statement->base.source_position = token.source_position;
9441 statement->asms.asm_text = parse_string_literals();
9442 statement->base.next = unit->global_asm;
9443 unit->global_asm = statement;
9452 * Parse a translation unit.
9454 static void parse_translation_unit(void)
9456 for (;;) switch (token.type) {
9459 case T___extension__:
9460 parse_external_declaration();
9471 /* TODO error in strict mode */
9472 warningf(HERE, "stray ';' outside of function");
9477 errorf(HERE, "stray %K outside of function", &token);
9478 if (token.type == '(' || token.type == '{' || token.type == '[')
9479 eat_until_matching_token(token.type);
9488 * @return the translation unit or NULL if errors occurred.
9490 void start_parsing(void)
9492 environment_stack = NEW_ARR_F(stack_entry_t, 0);
9493 label_stack = NEW_ARR_F(stack_entry_t, 0);
9494 diagnostic_count = 0;
9498 type_set_output(stderr);
9499 ast_set_output(stderr);
9501 assert(unit == NULL);
9502 unit = allocate_ast_zero(sizeof(unit[0]));
9504 assert(global_scope == NULL);
9505 global_scope = &unit->scope;
9507 assert(scope == NULL);
9508 set_scope(&unit->scope);
9510 initialize_builtin_types();
9513 translation_unit_t *finish_parsing(void)
9515 assert(scope == &unit->scope);
9517 last_declaration = NULL;
9519 assert(global_scope == &unit->scope);
9520 check_unused_globals();
9521 global_scope = NULL;
9523 DEL_ARR_F(environment_stack);
9524 DEL_ARR_F(label_stack);
9526 translation_unit_t *result = unit;
9533 lookahead_bufpos = 0;
9534 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
9537 parse_translation_unit();
9541 * Initialize the parser.
9543 void init_parser(void)
9546 /* add predefined symbols for extended-decl-modifier */
9547 sym_align = symbol_table_insert("align");
9548 sym_allocate = symbol_table_insert("allocate");
9549 sym_dllimport = symbol_table_insert("dllimport");
9550 sym_dllexport = symbol_table_insert("dllexport");
9551 sym_naked = symbol_table_insert("naked");
9552 sym_noinline = symbol_table_insert("noinline");
9553 sym_noreturn = symbol_table_insert("noreturn");
9554 sym_nothrow = symbol_table_insert("nothrow");
9555 sym_novtable = symbol_table_insert("novtable");
9556 sym_property = symbol_table_insert("property");
9557 sym_get = symbol_table_insert("get");
9558 sym_put = symbol_table_insert("put");
9559 sym_selectany = symbol_table_insert("selectany");
9560 sym_thread = symbol_table_insert("thread");
9561 sym_uuid = symbol_table_insert("uuid");
9562 sym_deprecated = symbol_table_insert("deprecated");
9563 sym_restrict = symbol_table_insert("restrict");
9564 sym_noalias = symbol_table_insert("noalias");
9566 memset(token_anchor_set, 0, sizeof(token_anchor_set));
9568 init_expression_parsers();
9569 obstack_init(&temp_obst);
9571 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
9572 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
9576 * Terminate the parser.
9578 void exit_parser(void)
9580 obstack_free(&temp_obst, NULL);