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 //#define PRINT_TOKENS
43 #define MAX_LOOKAHEAD 2
46 declaration_t *old_declaration;
48 unsigned short namespc;
51 typedef struct argument_list_t argument_list_t;
52 struct argument_list_t {
54 argument_list_t *next;
57 typedef struct gnu_attribute_t gnu_attribute_t;
58 struct gnu_attribute_t {
59 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
60 gnu_attribute_t *next;
61 bool invalid; /**< Set if this attribute had argument errors, */
62 bool have_arguments; /**< True, if this attribute has arguments. */
66 atomic_type_kind_t akind;
67 long argument; /**< Single argument. */
68 argument_list_t *arguments; /**< List of argument expressions. */
72 typedef struct declaration_specifiers_t declaration_specifiers_t;
73 struct declaration_specifiers_t {
74 source_position_t source_position;
75 unsigned char declared_storage_class;
76 unsigned char alignment; /**< Alignment, 0 if not set. */
77 unsigned int is_inline : 1;
78 unsigned int deprecated : 1;
79 decl_modifiers_t modifiers; /**< declaration modifiers */
80 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
81 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
82 symbol_t *get_property_sym; /**< the name of the get property if set. */
83 symbol_t *put_property_sym; /**< the name of the put property if set. */
88 * An environment for parsing initializers (and compound literals).
90 typedef struct parse_initializer_env_t {
91 type_t *type; /**< the type of the initializer. In case of an
92 array type with unspecified size this gets
93 adjusted to the actual size. */
94 declaration_t *declaration; /**< the declaration that is initialized if any */
95 bool must_be_constant;
96 } parse_initializer_env_t;
98 typedef declaration_t* (*parsed_declaration_func) (declaration_t *declaration);
100 static token_t token;
101 static token_t lookahead_buffer[MAX_LOOKAHEAD];
102 static int lookahead_bufpos;
103 static stack_entry_t *environment_stack = NULL;
104 static stack_entry_t *label_stack = NULL;
105 static scope_t *global_scope = NULL;
106 static scope_t *scope = NULL;
107 static declaration_t *last_declaration = NULL;
108 static declaration_t *current_function = NULL;
109 static switch_statement_t *current_switch = NULL;
110 static statement_t *current_loop = NULL;
111 static statement_t *current_parent = NULL;
112 static ms_try_statement_t *current_try = NULL;
113 static goto_statement_t *goto_first = NULL;
114 static goto_statement_t *goto_last = NULL;
115 static label_statement_t *label_first = NULL;
116 static label_statement_t *label_last = NULL;
117 static translation_unit_t *unit = NULL;
118 static struct obstack temp_obst;
120 #define PUSH_PARENT(stmt) \
121 statement_t *const prev_parent = current_parent; \
122 current_parent = (stmt);
123 #define POP_PARENT ((void)(current_parent = prev_parent))
125 static source_position_t null_position = { NULL, 0 };
127 /* symbols for Microsoft extended-decl-modifier */
128 static const symbol_t *sym_align = NULL;
129 static const symbol_t *sym_allocate = NULL;
130 static const symbol_t *sym_dllimport = NULL;
131 static const symbol_t *sym_dllexport = NULL;
132 static const symbol_t *sym_naked = NULL;
133 static const symbol_t *sym_noinline = NULL;
134 static const symbol_t *sym_noreturn = NULL;
135 static const symbol_t *sym_nothrow = NULL;
136 static const symbol_t *sym_novtable = NULL;
137 static const symbol_t *sym_property = NULL;
138 static const symbol_t *sym_get = NULL;
139 static const symbol_t *sym_put = NULL;
140 static const symbol_t *sym_selectany = NULL;
141 static const symbol_t *sym_thread = NULL;
142 static const symbol_t *sym_uuid = NULL;
143 static const symbol_t *sym_deprecated = NULL;
144 static const symbol_t *sym_restrict = NULL;
145 static const symbol_t *sym_noalias = NULL;
147 /** The token anchor set */
148 static unsigned char token_anchor_set[T_LAST_TOKEN];
150 /** The current source position. */
151 #define HERE (&token.source_position)
153 static type_t *type_valist;
155 static statement_t *parse_compound_statement(bool inside_expression_statement);
156 static statement_t *parse_statement(void);
158 static expression_t *parse_sub_expression(unsigned precedence);
159 static expression_t *parse_expression(void);
160 static type_t *parse_typename(void);
162 static void parse_compound_type_entries(declaration_t *compound_declaration);
163 static declaration_t *parse_declarator(
164 const declaration_specifiers_t *specifiers, bool may_be_abstract);
165 static declaration_t *record_declaration(declaration_t *declaration);
167 static void semantic_comparison(binary_expression_t *expression);
169 #define STORAGE_CLASSES \
177 #define TYPE_QUALIFIERS \
182 case T__forceinline: \
183 case T___attribute__:
185 #ifdef PROVIDE_COMPLEX
186 #define COMPLEX_SPECIFIERS \
188 #define IMAGINARY_SPECIFIERS \
191 #define COMPLEX_SPECIFIERS
192 #define IMAGINARY_SPECIFIERS
195 #define TYPE_SPECIFIERS \
210 case T___builtin_va_list: \
215 #define DECLARATION_START \
220 #define TYPENAME_START \
225 * Allocate an AST node with given size and
226 * initialize all fields with zero.
228 static void *allocate_ast_zero(size_t size)
230 void *res = allocate_ast(size);
231 memset(res, 0, size);
235 static declaration_t *allocate_declaration_zero(void)
237 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
238 declaration->type = type_error_type;
239 declaration->alignment = 0;
244 * Returns the size of a statement node.
246 * @param kind the statement kind
248 static size_t get_statement_struct_size(statement_kind_t kind)
250 static const size_t sizes[] = {
251 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
252 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
253 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
254 [STATEMENT_RETURN] = sizeof(return_statement_t),
255 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
256 [STATEMENT_IF] = sizeof(if_statement_t),
257 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
258 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
259 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
260 [STATEMENT_BREAK] = sizeof(statement_base_t),
261 [STATEMENT_GOTO] = sizeof(goto_statement_t),
262 [STATEMENT_LABEL] = sizeof(label_statement_t),
263 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
264 [STATEMENT_WHILE] = sizeof(while_statement_t),
265 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
266 [STATEMENT_FOR] = sizeof(for_statement_t),
267 [STATEMENT_ASM] = sizeof(asm_statement_t),
268 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
269 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
271 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
272 assert(sizes[kind] != 0);
277 * Returns the size of an expression node.
279 * @param kind the expression kind
281 static size_t get_expression_struct_size(expression_kind_t kind)
283 static const size_t sizes[] = {
284 [EXPR_INVALID] = sizeof(expression_base_t),
285 [EXPR_REFERENCE] = sizeof(reference_expression_t),
286 [EXPR_CONST] = sizeof(const_expression_t),
287 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
288 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
289 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
290 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
291 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
292 [EXPR_CALL] = sizeof(call_expression_t),
293 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
294 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
295 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
296 [EXPR_SELECT] = sizeof(select_expression_t),
297 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
298 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
299 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
300 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
301 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
302 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
303 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
304 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
305 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
306 [EXPR_VA_START] = sizeof(va_start_expression_t),
307 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
308 [EXPR_STATEMENT] = sizeof(statement_expression_t),
310 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
311 return sizes[EXPR_UNARY_FIRST];
313 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
314 return sizes[EXPR_BINARY_FIRST];
316 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
317 assert(sizes[kind] != 0);
322 * Allocate a statement node of given kind and initialize all
325 static statement_t *allocate_statement_zero(statement_kind_t kind)
327 size_t size = get_statement_struct_size(kind);
328 statement_t *res = allocate_ast_zero(size);
330 res->base.kind = kind;
331 res->base.parent = current_parent;
336 * Allocate an expression node of given kind and initialize all
339 static expression_t *allocate_expression_zero(expression_kind_t kind)
341 size_t size = get_expression_struct_size(kind);
342 expression_t *res = allocate_ast_zero(size);
344 res->base.kind = kind;
345 res->base.type = type_error_type;
350 * Creates a new invalid expression.
352 static expression_t *create_invalid_expression(void)
354 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
355 expression->base.source_position = token.source_position;
360 * Creates a new invalid statement.
362 static statement_t *create_invalid_statement(void)
364 statement_t *statement = allocate_statement_zero(STATEMENT_INVALID);
365 statement->base.source_position = token.source_position;
370 * Allocate a new empty statement.
372 static statement_t *create_empty_statement(void)
374 statement_t *statement = allocate_statement_zero(STATEMENT_EMPTY);
375 statement->base.source_position = token.source_position;
380 * Returns the size of a type node.
382 * @param kind the type kind
384 static size_t get_type_struct_size(type_kind_t kind)
386 static const size_t sizes[] = {
387 [TYPE_ATOMIC] = sizeof(atomic_type_t),
388 [TYPE_COMPLEX] = sizeof(complex_type_t),
389 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
390 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
391 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
392 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
393 [TYPE_ENUM] = sizeof(enum_type_t),
394 [TYPE_FUNCTION] = sizeof(function_type_t),
395 [TYPE_POINTER] = sizeof(pointer_type_t),
396 [TYPE_ARRAY] = sizeof(array_type_t),
397 [TYPE_BUILTIN] = sizeof(builtin_type_t),
398 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
399 [TYPE_TYPEOF] = sizeof(typeof_type_t),
401 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
402 assert(kind <= TYPE_TYPEOF);
403 assert(sizes[kind] != 0);
408 * Allocate a type node of given kind and initialize all
411 * @param kind type kind to allocate
412 * @param source_position the source position of the type definition
414 static type_t *allocate_type_zero(type_kind_t kind, const source_position_t *source_position)
416 size_t size = get_type_struct_size(kind);
417 type_t *res = obstack_alloc(type_obst, size);
418 memset(res, 0, size);
420 res->base.kind = kind;
421 res->base.source_position = *source_position;
426 * Returns the size of an initializer node.
428 * @param kind the initializer kind
430 static size_t get_initializer_size(initializer_kind_t kind)
432 static const size_t sizes[] = {
433 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
434 [INITIALIZER_STRING] = sizeof(initializer_string_t),
435 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
436 [INITIALIZER_LIST] = sizeof(initializer_list_t),
437 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
439 assert(kind < sizeof(sizes) / sizeof(*sizes));
440 assert(sizes[kind] != 0);
445 * Allocate an initializer node of given kind and initialize all
448 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
450 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
457 * Free a type from the type obstack.
459 static void free_type(void *type)
461 obstack_free(type_obst, type);
465 * Returns the index of the top element of the environment stack.
467 static size_t environment_top(void)
469 return ARR_LEN(environment_stack);
473 * Returns the index of the top element of the label stack.
475 static size_t label_top(void)
477 return ARR_LEN(label_stack);
481 * Return the next token.
483 static inline void next_token(void)
485 token = lookahead_buffer[lookahead_bufpos];
486 lookahead_buffer[lookahead_bufpos] = lexer_token;
489 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
492 print_token(stderr, &token);
493 fprintf(stderr, "\n");
498 * Return the next token with a given lookahead.
500 static inline const token_t *look_ahead(int num)
502 assert(num > 0 && num <= MAX_LOOKAHEAD);
503 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
504 return &lookahead_buffer[pos];
508 * Adds a token to the token anchor set (a multi-set).
510 static void add_anchor_token(int token_type)
512 assert(0 <= token_type && token_type < T_LAST_TOKEN);
513 ++token_anchor_set[token_type];
516 static int save_and_reset_anchor_state(int token_type)
518 assert(0 <= token_type && token_type < T_LAST_TOKEN);
519 int count = token_anchor_set[token_type];
520 token_anchor_set[token_type] = 0;
524 static void restore_anchor_state(int token_type, int count)
526 assert(0 <= token_type && token_type < T_LAST_TOKEN);
527 token_anchor_set[token_type] = count;
531 * Remove a token from the token anchor set (a multi-set).
533 static void rem_anchor_token(int token_type)
535 assert(0 <= token_type && token_type < T_LAST_TOKEN);
536 --token_anchor_set[token_type];
539 static bool at_anchor(void)
543 return token_anchor_set[token.type];
547 * Eat tokens until a matching token is found.
549 static void eat_until_matching_token(int type)
553 case '(': end_token = ')'; break;
554 case '{': end_token = '}'; break;
555 case '[': end_token = ']'; break;
556 default: end_token = type; break;
559 unsigned parenthesis_count = 0;
560 unsigned brace_count = 0;
561 unsigned bracket_count = 0;
562 while (token.type != end_token ||
563 parenthesis_count != 0 ||
565 bracket_count != 0) {
566 switch (token.type) {
568 case '(': ++parenthesis_count; break;
569 case '{': ++brace_count; break;
570 case '[': ++bracket_count; break;
573 if (parenthesis_count > 0)
583 if (bracket_count > 0)
586 if (token.type == end_token &&
587 parenthesis_count == 0 &&
601 * Eat input tokens until an anchor is found.
603 static void eat_until_anchor(void)
605 if (token.type == T_EOF)
607 while (token_anchor_set[token.type] == 0) {
608 if (token.type == '(' || token.type == '{' || token.type == '[')
609 eat_until_matching_token(token.type);
610 if (token.type == T_EOF)
616 static void eat_block(void)
618 eat_until_matching_token('{');
619 if (token.type == '}')
624 * eat all token until a ';' is reached or a stop token is found.
626 static void eat_statement(void)
628 eat_until_matching_token(';');
629 if (token.type == ';')
633 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while (0)
636 * Report a parse error because an expected token was not found.
639 #if defined __GNUC__ && __GNUC__ >= 4
640 __attribute__((sentinel))
642 void parse_error_expected(const char *message, ...)
644 if (message != NULL) {
645 errorf(HERE, "%s", message);
648 va_start(ap, message);
649 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
654 * Report a type error.
656 static void type_error(const char *msg, const source_position_t *source_position,
659 errorf(source_position, "%s, but found type '%T'", msg, type);
663 * Report an incompatible type.
665 static void type_error_incompatible(const char *msg,
666 const source_position_t *source_position, type_t *type1, type_t *type2)
668 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
673 * Expect the the current token is the expected token.
674 * If not, generate an error, eat the current statement,
675 * and goto the end_error label.
677 #define expect(expected) \
679 if (UNLIKELY(token.type != (expected))) { \
680 parse_error_expected(NULL, (expected), NULL); \
681 add_anchor_token(expected); \
682 eat_until_anchor(); \
683 if (token.type == expected) \
685 rem_anchor_token(expected); \
691 static void set_scope(scope_t *new_scope)
694 scope->last_declaration = last_declaration;
698 last_declaration = new_scope->last_declaration;
702 * Search a symbol in a given namespace and returns its declaration or
703 * NULL if this symbol was not found.
705 static declaration_t *get_declaration(const symbol_t *const symbol,
706 const namespace_t namespc)
708 declaration_t *declaration = symbol->declaration;
709 for( ; declaration != NULL; declaration = declaration->symbol_next) {
710 if (declaration->namespc == namespc)
718 * pushs an environment_entry on the environment stack and links the
719 * corresponding symbol to the new entry
721 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
723 symbol_t *symbol = declaration->symbol;
724 namespace_t namespc = (namespace_t) declaration->namespc;
726 /* replace/add declaration into declaration list of the symbol */
727 declaration_t *iter = symbol->declaration;
729 symbol->declaration = declaration;
731 declaration_t *iter_last = NULL;
732 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
733 /* replace an entry? */
734 if (iter->namespc == namespc) {
735 if (iter_last == NULL) {
736 symbol->declaration = declaration;
738 iter_last->symbol_next = declaration;
740 declaration->symbol_next = iter->symbol_next;
745 assert(iter_last->symbol_next == NULL);
746 iter_last->symbol_next = declaration;
750 /* remember old declaration */
752 entry.symbol = symbol;
753 entry.old_declaration = iter;
754 entry.namespc = (unsigned short) namespc;
755 ARR_APP1(stack_entry_t, *stack_ptr, entry);
758 static void environment_push(declaration_t *declaration)
760 assert(declaration->source_position.input_name != NULL);
761 assert(declaration->parent_scope != NULL);
762 stack_push(&environment_stack, declaration);
766 * Push a declaration of the label stack.
768 * @param declaration the declaration
770 static void label_push(declaration_t *declaration)
772 declaration->parent_scope = ¤t_function->scope;
773 stack_push(&label_stack, declaration);
777 * pops symbols from the environment stack until @p new_top is the top element
779 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
781 stack_entry_t *stack = *stack_ptr;
782 size_t top = ARR_LEN(stack);
785 assert(new_top <= top);
789 for(i = top; i > new_top; --i) {
790 stack_entry_t *entry = &stack[i - 1];
792 declaration_t *old_declaration = entry->old_declaration;
793 symbol_t *symbol = entry->symbol;
794 namespace_t namespc = (namespace_t)entry->namespc;
796 /* replace/remove declaration */
797 declaration_t *declaration = symbol->declaration;
798 assert(declaration != NULL);
799 if (declaration->namespc == namespc) {
800 if (old_declaration == NULL) {
801 symbol->declaration = declaration->symbol_next;
803 symbol->declaration = old_declaration;
806 declaration_t *iter_last = declaration;
807 declaration_t *iter = declaration->symbol_next;
808 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
809 /* replace an entry? */
810 if (iter->namespc == namespc) {
811 assert(iter_last != NULL);
812 iter_last->symbol_next = old_declaration;
813 if (old_declaration != NULL) {
814 old_declaration->symbol_next = iter->symbol_next;
819 assert(iter != NULL);
823 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
826 static void environment_pop_to(size_t new_top)
828 stack_pop_to(&environment_stack, new_top);
832 * Pop all entries on the label stack until the new_top
835 * @param new_top the new stack top
837 static void label_pop_to(size_t new_top)
839 stack_pop_to(&label_stack, new_top);
843 static int get_rank(const type_t *type)
845 assert(!is_typeref(type));
846 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
847 * and esp. footnote 108). However we can't fold constants (yet), so we
848 * can't decide whether unsigned int is possible, while int always works.
849 * (unsigned int would be preferable when possible... for stuff like
850 * struct { enum { ... } bla : 4; } ) */
851 if (type->kind == TYPE_ENUM)
852 return ATOMIC_TYPE_INT;
854 assert(type->kind == TYPE_ATOMIC);
855 return type->atomic.akind;
858 static type_t *promote_integer(type_t *type)
860 if (type->kind == TYPE_BITFIELD)
861 type = type->bitfield.base_type;
863 if (get_rank(type) < ATOMIC_TYPE_INT)
870 * Create a cast expression.
872 * @param expression the expression to cast
873 * @param dest_type the destination type
875 static expression_t *create_cast_expression(expression_t *expression,
878 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
880 cast->unary.value = expression;
881 cast->base.type = dest_type;
887 * Check if a given expression represents the 0 pointer constant.
889 static bool is_null_pointer_constant(const expression_t *expression)
891 /* skip void* cast */
892 if (expression->kind == EXPR_UNARY_CAST
893 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
894 expression = expression->unary.value;
897 /* TODO: not correct yet, should be any constant integer expression
898 * which evaluates to 0 */
899 if (expression->kind != EXPR_CONST)
902 type_t *const type = skip_typeref(expression->base.type);
903 if (!is_type_integer(type))
906 return expression->conste.v.int_value == 0;
910 * Create an implicit cast expression.
912 * @param expression the expression to cast
913 * @param dest_type the destination type
915 static expression_t *create_implicit_cast(expression_t *expression,
918 type_t *const source_type = expression->base.type;
920 if (source_type == dest_type)
923 return create_cast_expression(expression, dest_type);
926 typedef enum assign_error_t {
928 ASSIGN_ERROR_INCOMPATIBLE,
929 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
930 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
931 ASSIGN_WARNING_POINTER_FROM_INT,
932 ASSIGN_WARNING_INT_FROM_POINTER
935 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
936 const expression_t *const right,
938 const source_position_t *source_position)
940 type_t *const orig_type_right = right->base.type;
941 type_t *const type_left = skip_typeref(orig_type_left);
942 type_t *const type_right = skip_typeref(orig_type_right);
947 case ASSIGN_ERROR_INCOMPATIBLE:
948 errorf(source_position,
949 "destination type '%T' in %s is incompatible with type '%T'",
950 orig_type_left, context, orig_type_right);
953 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
954 type_t *points_to_left
955 = skip_typeref(type_left->pointer.points_to);
956 type_t *points_to_right
957 = skip_typeref(type_right->pointer.points_to);
959 /* the left type has all qualifiers from the right type */
960 unsigned missing_qualifiers
961 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
962 errorf(source_position,
963 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointed-to type",
964 orig_type_left, context, orig_type_right, missing_qualifiers);
968 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
969 warningf(source_position,
970 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
971 orig_type_left, context, right, orig_type_right);
974 case ASSIGN_WARNING_POINTER_FROM_INT:
975 warningf(source_position,
976 "%s makes integer '%T' from pointer '%T' without a cast",
977 context, orig_type_left, orig_type_right);
980 case ASSIGN_WARNING_INT_FROM_POINTER:
981 warningf(source_position,
982 "%s makes integer '%T' from pointer '%T' without a cast",
983 context, orig_type_left, orig_type_right);
987 panic("invalid error value");
991 /** Implements the rules from § 6.5.16.1 */
992 static assign_error_t semantic_assign(type_t *orig_type_left,
993 const expression_t *const right)
995 type_t *const orig_type_right = right->base.type;
996 type_t *const type_left = skip_typeref(orig_type_left);
997 type_t *const type_right = skip_typeref(orig_type_right);
999 if (is_type_pointer(type_left)) {
1000 if (is_null_pointer_constant(right)) {
1001 return ASSIGN_SUCCESS;
1002 } else if (is_type_pointer(type_right)) {
1003 type_t *points_to_left
1004 = skip_typeref(type_left->pointer.points_to);
1005 type_t *points_to_right
1006 = skip_typeref(type_right->pointer.points_to);
1008 /* the left type has all qualifiers from the right type */
1009 unsigned missing_qualifiers
1010 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1011 if (missing_qualifiers != 0) {
1012 return ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1015 points_to_left = get_unqualified_type(points_to_left);
1016 points_to_right = get_unqualified_type(points_to_right);
1018 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
1019 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1020 return ASSIGN_SUCCESS;
1023 if (!types_compatible(points_to_left, points_to_right)) {
1024 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1027 return ASSIGN_SUCCESS;
1028 } else if (is_type_integer(type_right)) {
1029 return ASSIGN_WARNING_POINTER_FROM_INT;
1031 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1032 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1033 && is_type_pointer(type_right))) {
1034 return ASSIGN_SUCCESS;
1035 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1036 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1037 type_t *const unqual_type_left = get_unqualified_type(type_left);
1038 type_t *const unqual_type_right = get_unqualified_type(type_right);
1039 if (types_compatible(unqual_type_left, unqual_type_right)) {
1040 return ASSIGN_SUCCESS;
1042 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1043 return ASSIGN_WARNING_INT_FROM_POINTER;
1046 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1047 return ASSIGN_SUCCESS;
1049 return ASSIGN_ERROR_INCOMPATIBLE;
1052 static expression_t *parse_constant_expression(void)
1054 /* start parsing at precedence 7 (conditional expression) */
1055 expression_t *result = parse_sub_expression(7);
1057 if (!is_constant_expression(result)) {
1058 errorf(&result->base.source_position,
1059 "expression '%E' is not constant\n", result);
1065 static expression_t *parse_assignment_expression(void)
1067 /* start parsing at precedence 2 (assignment expression) */
1068 return parse_sub_expression(2);
1071 static type_t *make_global_typedef(const char *name, type_t *type)
1073 symbol_t *const symbol = symbol_table_insert(name);
1075 declaration_t *const declaration = allocate_declaration_zero();
1076 declaration->namespc = NAMESPACE_NORMAL;
1077 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
1078 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
1079 declaration->type = type;
1080 declaration->symbol = symbol;
1081 declaration->source_position = builtin_source_position;
1083 record_declaration(declaration);
1085 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
1086 typedef_type->typedeft.declaration = declaration;
1088 return typedef_type;
1091 static string_t parse_string_literals(void)
1093 assert(token.type == T_STRING_LITERAL);
1094 string_t result = token.v.string;
1098 while (token.type == T_STRING_LITERAL) {
1099 result = concat_strings(&result, &token.v.string);
1106 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1107 [GNU_AK_CONST] = "const",
1108 [GNU_AK_VOLATILE] = "volatile",
1109 [GNU_AK_CDECL] = "cdecl",
1110 [GNU_AK_STDCALL] = "stdcall",
1111 [GNU_AK_FASTCALL] = "fastcall",
1112 [GNU_AK_DEPRECATED] = "deprecated",
1113 [GNU_AK_NOINLINE] = "noinline",
1114 [GNU_AK_NORETURN] = "noreturn",
1115 [GNU_AK_NAKED] = "naked",
1116 [GNU_AK_PURE] = "pure",
1117 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1118 [GNU_AK_MALLOC] = "malloc",
1119 [GNU_AK_WEAK] = "weak",
1120 [GNU_AK_CONSTRUCTOR] = "constructor",
1121 [GNU_AK_DESTRUCTOR] = "destructor",
1122 [GNU_AK_NOTHROW] = "nothrow",
1123 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1124 [GNU_AK_COMMON] = "common",
1125 [GNU_AK_NOCOMMON] = "nocommon",
1126 [GNU_AK_PACKED] = "packed",
1127 [GNU_AK_SHARED] = "shared",
1128 [GNU_AK_NOTSHARED] = "notshared",
1129 [GNU_AK_USED] = "used",
1130 [GNU_AK_UNUSED] = "unused",
1131 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1132 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1133 [GNU_AK_LONGCALL] = "longcall",
1134 [GNU_AK_SHORTCALL] = "shortcall",
1135 [GNU_AK_LONG_CALL] = "long_call",
1136 [GNU_AK_SHORT_CALL] = "short_call",
1137 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1138 [GNU_AK_INTERRUPT] = "interrupt",
1139 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1140 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1141 [GNU_AK_NESTING] = "nesting",
1142 [GNU_AK_NEAR] = "near",
1143 [GNU_AK_FAR] = "far",
1144 [GNU_AK_SIGNAL] = "signal",
1145 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1146 [GNU_AK_TINY_DATA] = "tiny_data",
1147 [GNU_AK_SAVEALL] = "saveall",
1148 [GNU_AK_FLATTEN] = "flatten",
1149 [GNU_AK_SSEREGPARM] = "sseregparm",
1150 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1151 [GNU_AK_RETURN_TWICE] = "return_twice",
1152 [GNU_AK_MAY_ALIAS] = "may_alias",
1153 [GNU_AK_MS_STRUCT] = "ms_struct",
1154 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1155 [GNU_AK_DLLIMPORT] = "dllimport",
1156 [GNU_AK_DLLEXPORT] = "dllexport",
1157 [GNU_AK_ALIGNED] = "aligned",
1158 [GNU_AK_ALIAS] = "alias",
1159 [GNU_AK_SECTION] = "section",
1160 [GNU_AK_FORMAT] = "format",
1161 [GNU_AK_FORMAT_ARG] = "format_arg",
1162 [GNU_AK_WEAKREF] = "weakref",
1163 [GNU_AK_NONNULL] = "nonnull",
1164 [GNU_AK_TLS_MODEL] = "tls_model",
1165 [GNU_AK_VISIBILITY] = "visibility",
1166 [GNU_AK_REGPARM] = "regparm",
1167 [GNU_AK_MODE] = "mode",
1168 [GNU_AK_MODEL] = "model",
1169 [GNU_AK_TRAP_EXIT] = "trap_exit",
1170 [GNU_AK_SP_SWITCH] = "sp_switch",
1171 [GNU_AK_SENTINEL] = "sentinel"
1175 * compare two string, ignoring double underscores on the second.
1177 static int strcmp_underscore(const char *s1, const char *s2)
1179 if (s2[0] == '_' && s2[1] == '_') {
1180 size_t len2 = strlen(s2);
1181 size_t len1 = strlen(s1);
1182 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1183 return strncmp(s1, s2+2, len2-4);
1187 return strcmp(s1, s2);
1191 * Allocate a new gnu temporal attribute.
1193 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1195 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1196 attribute->kind = kind;
1197 attribute->next = NULL;
1198 attribute->invalid = false;
1199 attribute->have_arguments = false;
1205 * parse one constant expression argument.
1207 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1209 expression_t *expression;
1210 add_anchor_token(')');
1211 expression = parse_constant_expression();
1212 rem_anchor_token(')');
1214 attribute->u.argument = fold_constant(expression);
1217 attribute->invalid = true;
1221 * parse a list of constant expressions arguments.
1223 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1225 argument_list_t **list = &attribute->u.arguments;
1226 argument_list_t *entry;
1227 expression_t *expression;
1228 add_anchor_token(')');
1229 add_anchor_token(',');
1231 expression = parse_constant_expression();
1232 entry = obstack_alloc(&temp_obst, sizeof(entry));
1233 entry->argument = fold_constant(expression);
1236 list = &entry->next;
1237 if (token.type != ',')
1241 rem_anchor_token(',');
1242 rem_anchor_token(')');
1246 attribute->invalid = true;
1250 * parse one string literal argument.
1252 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1255 add_anchor_token('(');
1256 if (token.type != T_STRING_LITERAL) {
1257 parse_error_expected("while parsing attribute directive",
1258 T_STRING_LITERAL, NULL);
1261 *string = parse_string_literals();
1262 rem_anchor_token('(');
1266 attribute->invalid = true;
1270 * parse one tls model.
1272 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1274 static const char *const tls_models[] = {
1280 string_t string = { NULL, 0 };
1281 parse_gnu_attribute_string_arg(attribute, &string);
1282 if (string.begin != NULL) {
1283 for(size_t i = 0; i < 4; ++i) {
1284 if (strcmp(tls_models[i], string.begin) == 0) {
1285 attribute->u.value = i;
1289 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1291 attribute->invalid = true;
1295 * parse one tls model.
1297 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1299 static const char *const visibilities[] = {
1305 string_t string = { NULL, 0 };
1306 parse_gnu_attribute_string_arg(attribute, &string);
1307 if (string.begin != NULL) {
1308 for(size_t i = 0; i < 4; ++i) {
1309 if (strcmp(visibilities[i], string.begin) == 0) {
1310 attribute->u.value = i;
1314 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1316 attribute->invalid = true;
1320 * parse one (code) model.
1322 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1324 static const char *const visibilities[] = {
1329 string_t string = { NULL, 0 };
1330 parse_gnu_attribute_string_arg(attribute, &string);
1331 if (string.begin != NULL) {
1332 for(int i = 0; i < 3; ++i) {
1333 if (strcmp(visibilities[i], string.begin) == 0) {
1334 attribute->u.value = i;
1338 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1340 attribute->invalid = true;
1343 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1345 /* TODO: find out what is allowed here... */
1347 /* at least: byte, word, pointer, list of machine modes
1348 * __XXX___ is interpreted as XXX */
1349 add_anchor_token(')');
1351 if (token.type != T_IDENTIFIER) {
1352 expect(T_IDENTIFIER);
1355 /* This isn't really correct, the backend should provide a list of machine
1356 * specific modes (according to gcc philosophy that is...) */
1357 const char *symbol_str = token.v.symbol->string;
1358 if (strcmp_underscore("QI", symbol_str) == 0 ||
1359 strcmp_underscore("byte", symbol_str) == 0) {
1360 attribute->u.akind = ATOMIC_TYPE_CHAR;
1361 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1362 attribute->u.akind = ATOMIC_TYPE_SHORT;
1363 } else if (strcmp_underscore("SI", symbol_str) == 0
1364 || strcmp_underscore("word", symbol_str) == 0
1365 || strcmp_underscore("pointer", symbol_str) == 0) {
1366 attribute->u.akind = ATOMIC_TYPE_INT;
1367 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1368 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1370 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1371 attribute->invalid = true;
1375 rem_anchor_token(')');
1379 attribute->invalid = true;
1383 * parse one interrupt argument.
1385 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1387 static const char *const interrupts[] = {
1394 string_t string = { NULL, 0 };
1395 parse_gnu_attribute_string_arg(attribute, &string);
1396 if (string.begin != NULL) {
1397 for(size_t i = 0; i < 5; ++i) {
1398 if (strcmp(interrupts[i], string.begin) == 0) {
1399 attribute->u.value = i;
1403 errorf(HERE, "'%s' is not an interrupt", string.begin);
1405 attribute->invalid = true;
1409 * parse ( identifier, const expression, const expression )
1411 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1413 static const char *const format_names[] = {
1421 if (token.type != T_IDENTIFIER) {
1422 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1425 const char *name = token.v.symbol->string;
1426 for(i = 0; i < 4; ++i) {
1427 if (strcmp_underscore(format_names[i], name) == 0)
1431 if (warning.attribute)
1432 warningf(HERE, "'%s' is an unrecognized format function type", name);
1437 add_anchor_token(')');
1438 add_anchor_token(',');
1439 parse_constant_expression();
1440 rem_anchor_token(',');
1441 rem_anchor_token('(');
1444 add_anchor_token(')');
1445 parse_constant_expression();
1446 rem_anchor_token('(');
1450 attribute->u.value = true;
1453 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1455 if (!attribute->have_arguments)
1458 /* should have no arguments */
1459 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1460 eat_until_matching_token('(');
1461 /* we have already consumed '(', so we stop before ')', eat it */
1463 attribute->invalid = true;
1467 * Parse one GNU attribute.
1469 * Note that attribute names can be specified WITH or WITHOUT
1470 * double underscores, ie const or __const__.
1472 * The following attributes are parsed without arguments
1497 * no_instrument_function
1498 * warn_unused_result
1515 * externally_visible
1523 * The following attributes are parsed with arguments
1524 * aligned( const expression )
1525 * alias( string literal )
1526 * section( string literal )
1527 * format( identifier, const expression, const expression )
1528 * format_arg( const expression )
1529 * tls_model( string literal )
1530 * visibility( string literal )
1531 * regparm( const expression )
1532 * model( string leteral )
1533 * trap_exit( const expression )
1534 * sp_switch( string literal )
1536 * The following attributes might have arguments
1537 * weak_ref( string literal )
1538 * non_null( const expression // ',' )
1539 * interrupt( string literal )
1540 * sentinel( constant expression )
1542 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1544 gnu_attribute_t *head = *attributes;
1545 gnu_attribute_t *last = *attributes;
1546 decl_modifiers_t modifiers = 0;
1547 gnu_attribute_t *attribute;
1549 eat(T___attribute__);
1553 if (token.type != ')') {
1554 /* find the end of the list */
1556 while (last->next != NULL)
1560 /* non-empty attribute list */
1563 if (token.type == T_const) {
1565 } else if (token.type == T_volatile) {
1567 } else if (token.type == T_cdecl) {
1568 /* __attribute__((cdecl)), WITH ms mode */
1570 } else if (token.type == T_IDENTIFIER) {
1571 const symbol_t *sym = token.v.symbol;
1574 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1581 for(i = 0; i < GNU_AK_LAST; ++i) {
1582 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1585 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1588 if (kind == GNU_AK_LAST) {
1589 if (warning.attribute)
1590 warningf(HERE, "'%s' attribute directive ignored", name);
1592 /* skip possible arguments */
1593 if (token.type == '(') {
1594 eat_until_matching_token(')');
1597 /* check for arguments */
1598 attribute = allocate_gnu_attribute(kind);
1599 if (token.type == '(') {
1601 if (token.type == ')') {
1602 /* empty args are allowed */
1605 attribute->have_arguments = true;
1610 case GNU_AK_VOLATILE:
1615 case GNU_AK_NOCOMMON:
1617 case GNU_AK_NOTSHARED:
1618 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1619 case GNU_AK_WARN_UNUSED_RESULT:
1620 case GNU_AK_LONGCALL:
1621 case GNU_AK_SHORTCALL:
1622 case GNU_AK_LONG_CALL:
1623 case GNU_AK_SHORT_CALL:
1624 case GNU_AK_FUNCTION_VECTOR:
1625 case GNU_AK_INTERRUPT_HANDLER:
1626 case GNU_AK_NMI_HANDLER:
1627 case GNU_AK_NESTING:
1631 case GNU_AK_EIGTHBIT_DATA:
1632 case GNU_AK_TINY_DATA:
1633 case GNU_AK_SAVEALL:
1634 case GNU_AK_FLATTEN:
1635 case GNU_AK_SSEREGPARM:
1636 case GNU_AK_EXTERNALLY_VISIBLE:
1637 case GNU_AK_RETURN_TWICE:
1638 case GNU_AK_MAY_ALIAS:
1639 case GNU_AK_MS_STRUCT:
1640 case GNU_AK_GCC_STRUCT:
1643 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1644 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1645 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1646 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1647 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1648 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1649 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1650 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1651 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1652 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1653 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1654 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1655 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1656 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1657 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1658 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1659 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1661 case GNU_AK_ALIGNED:
1662 /* __align__ may be used without an argument */
1663 if (attribute->have_arguments) {
1664 parse_gnu_attribute_const_arg(attribute);
1668 case GNU_AK_FORMAT_ARG:
1669 case GNU_AK_REGPARM:
1670 case GNU_AK_TRAP_EXIT:
1671 if (!attribute->have_arguments) {
1672 /* should have arguments */
1673 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1674 attribute->invalid = true;
1676 parse_gnu_attribute_const_arg(attribute);
1679 case GNU_AK_SECTION:
1680 case GNU_AK_SP_SWITCH:
1681 if (!attribute->have_arguments) {
1682 /* should have arguments */
1683 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1684 attribute->invalid = true;
1686 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1689 if (!attribute->have_arguments) {
1690 /* should have arguments */
1691 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1692 attribute->invalid = true;
1694 parse_gnu_attribute_format_args(attribute);
1696 case GNU_AK_WEAKREF:
1697 /* may have one string argument */
1698 if (attribute->have_arguments)
1699 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1701 case GNU_AK_NONNULL:
1702 if (attribute->have_arguments)
1703 parse_gnu_attribute_const_arg_list(attribute);
1705 case GNU_AK_TLS_MODEL:
1706 if (!attribute->have_arguments) {
1707 /* should have arguments */
1708 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1710 parse_gnu_attribute_tls_model_arg(attribute);
1712 case GNU_AK_VISIBILITY:
1713 if (!attribute->have_arguments) {
1714 /* should have arguments */
1715 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1717 parse_gnu_attribute_visibility_arg(attribute);
1720 if (!attribute->have_arguments) {
1721 /* should have arguments */
1722 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1724 parse_gnu_attribute_model_arg(attribute);
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_mode_arg(attribute);
1735 case GNU_AK_INTERRUPT:
1736 /* may have one string argument */
1737 if (attribute->have_arguments)
1738 parse_gnu_attribute_interrupt_arg(attribute);
1740 case GNU_AK_SENTINEL:
1741 /* may have one string argument */
1742 if (attribute->have_arguments)
1743 parse_gnu_attribute_const_arg(attribute);
1746 /* already handled */
1750 check_no_argument(attribute, name);
1753 if (attribute != NULL) {
1755 last->next = attribute;
1758 head = last = attribute;
1762 if (token.type != ',')
1776 * Parse GNU attributes.
1778 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1780 decl_modifiers_t modifiers = 0;
1783 switch(token.type) {
1784 case T___attribute__:
1785 modifiers |= parse_gnu_attribute(attributes);
1791 if (token.type != T_STRING_LITERAL) {
1792 parse_error_expected("while parsing assembler attribute",
1793 T_STRING_LITERAL, NULL);
1794 eat_until_matching_token('(');
1797 parse_string_literals();
1802 case T_cdecl: modifiers |= DM_CDECL; break;
1803 case T__fastcall: modifiers |= DM_FASTCALL; break;
1804 case T__stdcall: modifiers |= DM_STDCALL; break;
1807 /* TODO record modifier */
1808 warningf(HERE, "Ignoring declaration modifier %K", &token);
1812 default: return modifiers;
1819 static designator_t *parse_designation(void)
1821 designator_t *result = NULL;
1822 designator_t *last = NULL;
1825 designator_t *designator;
1826 switch(token.type) {
1828 designator = allocate_ast_zero(sizeof(designator[0]));
1829 designator->source_position = token.source_position;
1831 add_anchor_token(']');
1832 designator->array_index = parse_constant_expression();
1833 rem_anchor_token(']');
1837 designator = allocate_ast_zero(sizeof(designator[0]));
1838 designator->source_position = token.source_position;
1840 if (token.type != T_IDENTIFIER) {
1841 parse_error_expected("while parsing designator",
1842 T_IDENTIFIER, NULL);
1845 designator->symbol = token.v.symbol;
1853 assert(designator != NULL);
1855 last->next = designator;
1857 result = designator;
1865 static initializer_t *initializer_from_string(array_type_t *type,
1866 const string_t *const string)
1868 /* TODO: check len vs. size of array type */
1871 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1872 initializer->string.string = *string;
1877 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1878 wide_string_t *const string)
1880 /* TODO: check len vs. size of array type */
1883 initializer_t *const initializer =
1884 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1885 initializer->wide_string.string = *string;
1891 * Build an initializer from a given expression.
1893 static initializer_t *initializer_from_expression(type_t *orig_type,
1894 expression_t *expression)
1896 /* TODO check that expression is a constant expression */
1898 /* § 6.7.8.14/15 char array may be initialized by string literals */
1899 type_t *type = skip_typeref(orig_type);
1900 type_t *expr_type_orig = expression->base.type;
1901 type_t *expr_type = skip_typeref(expr_type_orig);
1902 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1903 array_type_t *const array_type = &type->array;
1904 type_t *const element_type = skip_typeref(array_type->element_type);
1906 if (element_type->kind == TYPE_ATOMIC) {
1907 atomic_type_kind_t akind = element_type->atomic.akind;
1908 switch (expression->kind) {
1909 case EXPR_STRING_LITERAL:
1910 if (akind == ATOMIC_TYPE_CHAR
1911 || akind == ATOMIC_TYPE_SCHAR
1912 || akind == ATOMIC_TYPE_UCHAR) {
1913 return initializer_from_string(array_type,
1914 &expression->string.value);
1917 case EXPR_WIDE_STRING_LITERAL: {
1918 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1919 if (get_unqualified_type(element_type) == bare_wchar_type) {
1920 return initializer_from_wide_string(array_type,
1921 &expression->wide_string.value);
1931 assign_error_t error = semantic_assign(type, expression);
1932 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1934 report_assign_error(error, type, expression, "initializer",
1935 &expression->base.source_position);
1937 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1938 result->value.value = create_implicit_cast(expression, type);
1944 * Checks if a given expression can be used as an constant initializer.
1946 static bool is_initializer_constant(const expression_t *expression)
1948 return is_constant_expression(expression)
1949 || is_address_constant(expression);
1953 * Parses an scalar initializer.
1955 * § 6.7.8.11; eat {} without warning
1957 static initializer_t *parse_scalar_initializer(type_t *type,
1958 bool must_be_constant)
1960 /* there might be extra {} hierarchies */
1962 if (token.type == '{') {
1963 warningf(HERE, "extra curly braces around scalar initializer");
1967 } while (token.type == '{');
1970 expression_t *expression = parse_assignment_expression();
1971 if (must_be_constant && !is_initializer_constant(expression)) {
1972 errorf(&expression->base.source_position,
1973 "Initialisation expression '%E' is not constant\n",
1977 initializer_t *initializer = initializer_from_expression(type, expression);
1979 if (initializer == NULL) {
1980 errorf(&expression->base.source_position,
1981 "expression '%E' (type '%T') doesn't match expected type '%T'",
1982 expression, expression->base.type, type);
1987 bool additional_warning_displayed = false;
1988 while (braces > 0) {
1989 if (token.type == ',') {
1992 if (token.type != '}') {
1993 if (!additional_warning_displayed) {
1994 warningf(HERE, "additional elements in scalar initializer");
1995 additional_warning_displayed = true;
2006 * An entry in the type path.
2008 typedef struct type_path_entry_t type_path_entry_t;
2009 struct type_path_entry_t {
2010 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2012 size_t index; /**< For array types: the current index. */
2013 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2018 * A type path expression a position inside compound or array types.
2020 typedef struct type_path_t type_path_t;
2021 struct type_path_t {
2022 type_path_entry_t *path; /**< An flexible array containing the current path. */
2023 type_t *top_type; /**< type of the element the path points */
2024 size_t max_index; /**< largest index in outermost array */
2028 * Prints a type path for debugging.
2030 static __attribute__((unused)) void debug_print_type_path(
2031 const type_path_t *path)
2033 size_t len = ARR_LEN(path->path);
2035 for(size_t i = 0; i < len; ++i) {
2036 const type_path_entry_t *entry = & path->path[i];
2038 type_t *type = skip_typeref(entry->type);
2039 if (is_type_compound(type)) {
2040 /* in gcc mode structs can have no members */
2041 if (entry->v.compound_entry == NULL) {
2045 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
2046 } else if (is_type_array(type)) {
2047 fprintf(stderr, "[%zu]", entry->v.index);
2049 fprintf(stderr, "-INVALID-");
2052 if (path->top_type != NULL) {
2053 fprintf(stderr, " (");
2054 print_type(path->top_type);
2055 fprintf(stderr, ")");
2060 * Return the top type path entry, ie. in a path
2061 * (type).a.b returns the b.
2063 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2065 size_t len = ARR_LEN(path->path);
2067 return &path->path[len-1];
2071 * Enlarge the type path by an (empty) element.
2073 static type_path_entry_t *append_to_type_path(type_path_t *path)
2075 size_t len = ARR_LEN(path->path);
2076 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2078 type_path_entry_t *result = & path->path[len];
2079 memset(result, 0, sizeof(result[0]));
2084 * Descending into a sub-type. Enter the scope of the current
2087 static void descend_into_subtype(type_path_t *path)
2089 type_t *orig_top_type = path->top_type;
2090 type_t *top_type = skip_typeref(orig_top_type);
2092 assert(is_type_compound(top_type) || is_type_array(top_type));
2094 type_path_entry_t *top = append_to_type_path(path);
2095 top->type = top_type;
2097 if (is_type_compound(top_type)) {
2098 declaration_t *declaration = top_type->compound.declaration;
2099 declaration_t *entry = declaration->scope.declarations;
2100 top->v.compound_entry = entry;
2102 if (entry != NULL) {
2103 path->top_type = entry->type;
2105 path->top_type = NULL;
2108 assert(is_type_array(top_type));
2111 path->top_type = top_type->array.element_type;
2116 * Pop an entry from the given type path, ie. returning from
2117 * (type).a.b to (type).a
2119 static void ascend_from_subtype(type_path_t *path)
2121 type_path_entry_t *top = get_type_path_top(path);
2123 path->top_type = top->type;
2125 size_t len = ARR_LEN(path->path);
2126 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2130 * Pop entries from the given type path until the given
2131 * path level is reached.
2133 static void ascend_to(type_path_t *path, size_t top_path_level)
2135 size_t len = ARR_LEN(path->path);
2137 while (len > top_path_level) {
2138 ascend_from_subtype(path);
2139 len = ARR_LEN(path->path);
2143 static bool walk_designator(type_path_t *path, const designator_t *designator,
2144 bool used_in_offsetof)
2146 for( ; designator != NULL; designator = designator->next) {
2147 type_path_entry_t *top = get_type_path_top(path);
2148 type_t *orig_type = top->type;
2150 type_t *type = skip_typeref(orig_type);
2152 if (designator->symbol != NULL) {
2153 symbol_t *symbol = designator->symbol;
2154 if (!is_type_compound(type)) {
2155 if (is_type_valid(type)) {
2156 errorf(&designator->source_position,
2157 "'.%Y' designator used for non-compound type '%T'",
2163 declaration_t *declaration = type->compound.declaration;
2164 declaration_t *iter = declaration->scope.declarations;
2165 for( ; iter != NULL; iter = iter->next) {
2166 if (iter->symbol == symbol) {
2171 errorf(&designator->source_position,
2172 "'%T' has no member named '%Y'", orig_type, symbol);
2175 if (used_in_offsetof) {
2176 type_t *real_type = skip_typeref(iter->type);
2177 if (real_type->kind == TYPE_BITFIELD) {
2178 errorf(&designator->source_position,
2179 "offsetof designator '%Y' may not specify bitfield",
2185 top->type = orig_type;
2186 top->v.compound_entry = iter;
2187 orig_type = iter->type;
2189 expression_t *array_index = designator->array_index;
2190 assert(designator->array_index != NULL);
2192 if (!is_type_array(type)) {
2193 if (is_type_valid(type)) {
2194 errorf(&designator->source_position,
2195 "[%E] designator used for non-array type '%T'",
2196 array_index, orig_type);
2200 if (!is_type_valid(array_index->base.type)) {
2204 long index = fold_constant(array_index);
2205 if (!used_in_offsetof) {
2207 errorf(&designator->source_position,
2208 "array index [%E] must be positive", array_index);
2211 if (type->array.size_constant == true) {
2212 long array_size = type->array.size;
2213 if (index >= array_size) {
2214 errorf(&designator->source_position,
2215 "designator [%E] (%d) exceeds array size %d",
2216 array_index, index, array_size);
2222 top->type = orig_type;
2223 top->v.index = (size_t) index;
2224 orig_type = type->array.element_type;
2226 path->top_type = orig_type;
2228 if (designator->next != NULL) {
2229 descend_into_subtype(path);
2238 static void advance_current_object(type_path_t *path, size_t top_path_level)
2240 type_path_entry_t *top = get_type_path_top(path);
2242 type_t *type = skip_typeref(top->type);
2243 if (is_type_union(type)) {
2244 /* in unions only the first element is initialized */
2245 top->v.compound_entry = NULL;
2246 } else if (is_type_struct(type)) {
2247 declaration_t *entry = top->v.compound_entry;
2249 entry = entry->next;
2250 top->v.compound_entry = entry;
2251 if (entry != NULL) {
2252 path->top_type = entry->type;
2256 assert(is_type_array(type));
2260 if (!type->array.size_constant || top->v.index < type->array.size) {
2265 /* we're past the last member of the current sub-aggregate, try if we
2266 * can ascend in the type hierarchy and continue with another subobject */
2267 size_t len = ARR_LEN(path->path);
2269 if (len > top_path_level) {
2270 ascend_from_subtype(path);
2271 advance_current_object(path, top_path_level);
2273 path->top_type = NULL;
2278 * skip until token is found.
2280 static void skip_until(int type)
2282 while (token.type != type) {
2283 if (token.type == T_EOF)
2290 * skip any {...} blocks until a closing bracket is reached.
2292 static void skip_initializers(void)
2294 if (token.type == '{')
2297 while (token.type != '}') {
2298 if (token.type == T_EOF)
2300 if (token.type == '{') {
2308 static initializer_t *create_empty_initializer(void)
2310 static initializer_t empty_initializer
2311 = { .list = { { INITIALIZER_LIST }, 0 } };
2312 return &empty_initializer;
2316 * Parse a part of an initialiser for a struct or union,
2318 static initializer_t *parse_sub_initializer(type_path_t *path,
2319 type_t *outer_type, size_t top_path_level,
2320 parse_initializer_env_t *env)
2322 if (token.type == '}') {
2323 /* empty initializer */
2324 return create_empty_initializer();
2327 type_t *orig_type = path->top_type;
2328 type_t *type = NULL;
2330 if (orig_type == NULL) {
2331 /* We are initializing an empty compound. */
2333 type = skip_typeref(orig_type);
2335 /* we can't do usefull stuff if we didn't even parse the type. Skip the
2336 * initializers in this case. */
2337 if (!is_type_valid(type)) {
2338 skip_initializers();
2339 return create_empty_initializer();
2343 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2346 designator_t *designator = NULL;
2347 if (token.type == '.' || token.type == '[') {
2348 designator = parse_designation();
2349 goto finish_designator;
2350 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2351 /* GNU-style designator ("identifier: value") */
2352 designator = allocate_ast_zero(sizeof(designator[0]));
2353 designator->source_position = token.source_position;
2354 designator->symbol = token.v.symbol;
2359 /* reset path to toplevel, evaluate designator from there */
2360 ascend_to(path, top_path_level);
2361 if (!walk_designator(path, designator, false)) {
2362 /* can't continue after designation error */
2366 initializer_t *designator_initializer
2367 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2368 designator_initializer->designator.designator = designator;
2369 ARR_APP1(initializer_t*, initializers, designator_initializer);
2371 orig_type = path->top_type;
2372 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2377 if (token.type == '{') {
2378 if (type != NULL && is_type_scalar(type)) {
2379 sub = parse_scalar_initializer(type, env->must_be_constant);
2383 if (env->declaration != NULL) {
2384 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2385 env->declaration->symbol);
2387 errorf(HERE, "extra brace group at end of initializer");
2390 descend_into_subtype(path);
2392 add_anchor_token('}');
2393 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2395 rem_anchor_token('}');
2398 ascend_from_subtype(path);
2402 goto error_parse_next;
2406 /* must be an expression */
2407 expression_t *expression = parse_assignment_expression();
2409 if (env->must_be_constant && !is_initializer_constant(expression)) {
2410 errorf(&expression->base.source_position,
2411 "Initialisation expression '%E' is not constant\n",
2416 /* we are already outside, ... */
2420 /* handle { "string" } special case */
2421 if ((expression->kind == EXPR_STRING_LITERAL
2422 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2423 && outer_type != NULL) {
2424 sub = initializer_from_expression(outer_type, expression);
2426 if (token.type == ',') {
2429 if (token.type != '}') {
2430 warningf(HERE, "excessive elements in initializer for type '%T'",
2433 /* TODO: eat , ... */
2438 /* descend into subtypes until expression matches type */
2440 orig_type = path->top_type;
2441 type = skip_typeref(orig_type);
2443 sub = initializer_from_expression(orig_type, expression);
2447 if (!is_type_valid(type)) {
2450 if (is_type_scalar(type)) {
2451 errorf(&expression->base.source_position,
2452 "expression '%E' doesn't match expected type '%T'",
2453 expression, orig_type);
2457 descend_into_subtype(path);
2461 /* update largest index of top array */
2462 const type_path_entry_t *first = &path->path[0];
2463 type_t *first_type = first->type;
2464 first_type = skip_typeref(first_type);
2465 if (is_type_array(first_type)) {
2466 size_t index = first->v.index;
2467 if (index > path->max_index)
2468 path->max_index = index;
2472 /* append to initializers list */
2473 ARR_APP1(initializer_t*, initializers, sub);
2476 if (env->declaration != NULL)
2477 warningf(HERE, "excess elements in struct initializer for '%Y'",
2478 env->declaration->symbol);
2480 warningf(HERE, "excess elements in struct initializer");
2484 if (token.type == '}') {
2488 if (token.type == '}') {
2493 /* advance to the next declaration if we are not at the end */
2494 advance_current_object(path, top_path_level);
2495 orig_type = path->top_type;
2496 if (orig_type != NULL)
2497 type = skip_typeref(orig_type);
2503 size_t len = ARR_LEN(initializers);
2504 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2505 initializer_t *result = allocate_ast_zero(size);
2506 result->kind = INITIALIZER_LIST;
2507 result->list.len = len;
2508 memcpy(&result->list.initializers, initializers,
2509 len * sizeof(initializers[0]));
2511 DEL_ARR_F(initializers);
2512 ascend_to(path, top_path_level+1);
2517 skip_initializers();
2518 DEL_ARR_F(initializers);
2519 ascend_to(path, top_path_level+1);
2524 * Parses an initializer. Parsers either a compound literal
2525 * (env->declaration == NULL) or an initializer of a declaration.
2527 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2529 type_t *type = skip_typeref(env->type);
2530 initializer_t *result = NULL;
2533 if (is_type_scalar(type)) {
2534 result = parse_scalar_initializer(type, env->must_be_constant);
2535 } else if (token.type == '{') {
2539 memset(&path, 0, sizeof(path));
2540 path.top_type = env->type;
2541 path.path = NEW_ARR_F(type_path_entry_t, 0);
2543 descend_into_subtype(&path);
2545 add_anchor_token('}');
2546 result = parse_sub_initializer(&path, env->type, 1, env);
2547 rem_anchor_token('}');
2549 max_index = path.max_index;
2550 DEL_ARR_F(path.path);
2554 /* parse_scalar_initializer() also works in this case: we simply
2555 * have an expression without {} around it */
2556 result = parse_scalar_initializer(type, env->must_be_constant);
2559 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2560 * the array type size */
2561 if (is_type_array(type) && type->array.size_expression == NULL
2562 && result != NULL) {
2564 switch (result->kind) {
2565 case INITIALIZER_LIST:
2566 size = max_index + 1;
2569 case INITIALIZER_STRING:
2570 size = result->string.string.size;
2573 case INITIALIZER_WIDE_STRING:
2574 size = result->wide_string.string.size;
2577 case INITIALIZER_DESIGNATOR:
2578 case INITIALIZER_VALUE:
2579 /* can happen for parse errors */
2584 internal_errorf(HERE, "invalid initializer type");
2587 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2588 cnst->base.type = type_size_t;
2589 cnst->conste.v.int_value = size;
2591 type_t *new_type = duplicate_type(type);
2593 new_type->array.size_expression = cnst;
2594 new_type->array.size_constant = true;
2595 new_type->array.size = size;
2596 env->type = new_type;
2604 static declaration_t *append_declaration(declaration_t *declaration);
2606 static declaration_t *parse_compound_type_specifier(bool is_struct)
2608 gnu_attribute_t *attributes = NULL;
2609 decl_modifiers_t modifiers = 0;
2616 symbol_t *symbol = NULL;
2617 declaration_t *declaration = NULL;
2619 if (token.type == T___attribute__) {
2620 modifiers |= parse_attributes(&attributes);
2623 if (token.type == T_IDENTIFIER) {
2624 symbol = token.v.symbol;
2627 namespace_t const namespc =
2628 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2629 declaration = get_declaration(symbol, namespc);
2630 if (declaration != NULL) {
2631 if (declaration->parent_scope != scope &&
2632 (token.type == '{' || token.type == ';')) {
2634 } else if (declaration->init.complete &&
2635 token.type == '{') {
2636 assert(symbol != NULL);
2637 errorf(HERE, "multiple definitions of '%s %Y' (previous definition at %P)",
2638 is_struct ? "struct" : "union", symbol,
2639 &declaration->source_position);
2640 declaration->scope.declarations = NULL;
2643 } else if (token.type != '{') {
2645 parse_error_expected("while parsing struct type specifier",
2646 T_IDENTIFIER, '{', NULL);
2648 parse_error_expected("while parsing union type specifier",
2649 T_IDENTIFIER, '{', NULL);
2655 if (declaration == NULL) {
2656 declaration = allocate_declaration_zero();
2657 declaration->namespc =
2658 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2659 declaration->source_position = token.source_position;
2660 declaration->symbol = symbol;
2661 declaration->parent_scope = scope;
2662 if (symbol != NULL) {
2663 environment_push(declaration);
2665 append_declaration(declaration);
2668 if (token.type == '{') {
2669 declaration->init.complete = true;
2671 parse_compound_type_entries(declaration);
2672 modifiers |= parse_attributes(&attributes);
2675 declaration->modifiers |= modifiers;
2679 static void parse_enum_entries(type_t *const enum_type)
2683 if (token.type == '}') {
2685 errorf(HERE, "empty enum not allowed");
2689 add_anchor_token('}');
2691 if (token.type != T_IDENTIFIER) {
2692 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2694 rem_anchor_token('}');
2698 declaration_t *const entry = allocate_declaration_zero();
2699 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
2700 entry->type = enum_type;
2701 entry->symbol = token.v.symbol;
2702 entry->source_position = token.source_position;
2705 if (token.type == '=') {
2707 expression_t *value = parse_constant_expression();
2709 value = create_implicit_cast(value, enum_type);
2710 entry->init.enum_value = value;
2715 record_declaration(entry);
2717 if (token.type != ',')
2720 } while (token.type != '}');
2721 rem_anchor_token('}');
2729 static type_t *parse_enum_specifier(void)
2731 gnu_attribute_t *attributes = NULL;
2732 declaration_t *declaration;
2736 if (token.type == T_IDENTIFIER) {
2737 symbol = token.v.symbol;
2740 declaration = get_declaration(symbol, NAMESPACE_ENUM);
2741 } else if (token.type != '{') {
2742 parse_error_expected("while parsing enum type specifier",
2743 T_IDENTIFIER, '{', NULL);
2750 if (declaration == NULL) {
2751 declaration = allocate_declaration_zero();
2752 declaration->namespc = NAMESPACE_ENUM;
2753 declaration->source_position = token.source_position;
2754 declaration->symbol = symbol;
2755 declaration->parent_scope = scope;
2758 type_t *const type = allocate_type_zero(TYPE_ENUM, &declaration->source_position);
2759 type->enumt.declaration = declaration;
2761 if (token.type == '{') {
2762 if (declaration->init.complete) {
2763 errorf(HERE, "multiple definitions of enum %Y", symbol);
2765 if (symbol != NULL) {
2766 environment_push(declaration);
2768 append_declaration(declaration);
2769 declaration->init.complete = true;
2771 parse_enum_entries(type);
2772 parse_attributes(&attributes);
2779 * if a symbol is a typedef to another type, return true
2781 static bool is_typedef_symbol(symbol_t *symbol)
2783 const declaration_t *const declaration =
2784 get_declaration(symbol, NAMESPACE_NORMAL);
2786 declaration != NULL &&
2787 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
2790 static type_t *parse_typeof(void)
2797 add_anchor_token(')');
2799 expression_t *expression = NULL;
2802 switch(token.type) {
2803 case T___extension__:
2804 /* This can be a prefix to a typename or an expression. We simply eat
2808 } while (token.type == T___extension__);
2812 if (is_typedef_symbol(token.v.symbol)) {
2813 type = parse_typename();
2815 expression = parse_expression();
2816 type = expression->base.type;
2821 type = parse_typename();
2825 expression = parse_expression();
2826 type = expression->base.type;
2830 rem_anchor_token(')');
2833 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, &expression->base.source_position);
2834 typeof_type->typeoft.expression = expression;
2835 typeof_type->typeoft.typeof_type = type;
2842 typedef enum specifiers_t {
2843 SPECIFIER_SIGNED = 1 << 0,
2844 SPECIFIER_UNSIGNED = 1 << 1,
2845 SPECIFIER_LONG = 1 << 2,
2846 SPECIFIER_INT = 1 << 3,
2847 SPECIFIER_DOUBLE = 1 << 4,
2848 SPECIFIER_CHAR = 1 << 5,
2849 SPECIFIER_SHORT = 1 << 6,
2850 SPECIFIER_LONG_LONG = 1 << 7,
2851 SPECIFIER_FLOAT = 1 << 8,
2852 SPECIFIER_BOOL = 1 << 9,
2853 SPECIFIER_VOID = 1 << 10,
2854 SPECIFIER_INT8 = 1 << 11,
2855 SPECIFIER_INT16 = 1 << 12,
2856 SPECIFIER_INT32 = 1 << 13,
2857 SPECIFIER_INT64 = 1 << 14,
2858 SPECIFIER_INT128 = 1 << 15,
2859 SPECIFIER_COMPLEX = 1 << 16,
2860 SPECIFIER_IMAGINARY = 1 << 17,
2863 static type_t *create_builtin_type(symbol_t *const symbol,
2864 type_t *const real_type)
2866 type_t *type = allocate_type_zero(TYPE_BUILTIN, &builtin_source_position);
2867 type->builtin.symbol = symbol;
2868 type->builtin.real_type = real_type;
2870 type_t *result = typehash_insert(type);
2871 if (type != result) {
2878 static type_t *get_typedef_type(symbol_t *symbol)
2880 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
2881 if (declaration == NULL ||
2882 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
2885 type_t *type = allocate_type_zero(TYPE_TYPEDEF, &declaration->source_position);
2886 type->typedeft.declaration = declaration;
2892 * check for the allowed MS alignment values.
2894 static bool check_alignment_value(long long intvalue)
2896 if (intvalue < 1 || intvalue > 8192) {
2897 errorf(HERE, "illegal alignment value");
2900 unsigned v = (unsigned)intvalue;
2901 for(unsigned i = 1; i <= 8192; i += i) {
2905 errorf(HERE, "alignment must be power of two");
2909 #define DET_MOD(name, tag) do { \
2910 if (*modifiers & tag) warningf(HERE, #name " used more than once"); \
2911 *modifiers |= tag; \
2914 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
2916 decl_modifiers_t *modifiers = &specifiers->modifiers;
2919 if (token.type == T_restrict) {
2921 DET_MOD(restrict, DM_RESTRICT);
2923 } else if (token.type != T_IDENTIFIER)
2925 symbol_t *symbol = token.v.symbol;
2926 if (symbol == sym_align) {
2929 if (token.type != T_INTEGER)
2931 if (check_alignment_value(token.v.intvalue)) {
2932 if (specifiers->alignment != 0)
2933 warningf(HERE, "align used more than once");
2934 specifiers->alignment = (unsigned char)token.v.intvalue;
2938 } else if (symbol == sym_allocate) {
2941 if (token.type != T_IDENTIFIER)
2943 (void)token.v.symbol;
2945 } else if (symbol == sym_dllimport) {
2947 DET_MOD(dllimport, DM_DLLIMPORT);
2948 } else if (symbol == sym_dllexport) {
2950 DET_MOD(dllexport, DM_DLLEXPORT);
2951 } else if (symbol == sym_thread) {
2953 DET_MOD(thread, DM_THREAD);
2954 } else if (symbol == sym_naked) {
2956 DET_MOD(naked, DM_NAKED);
2957 } else if (symbol == sym_noinline) {
2959 DET_MOD(noinline, DM_NOINLINE);
2960 } else if (symbol == sym_noreturn) {
2962 DET_MOD(noreturn, DM_NORETURN);
2963 } else if (symbol == sym_nothrow) {
2965 DET_MOD(nothrow, DM_NOTHROW);
2966 } else if (symbol == sym_novtable) {
2968 DET_MOD(novtable, DM_NOVTABLE);
2969 } else if (symbol == sym_property) {
2973 bool is_get = false;
2974 if (token.type != T_IDENTIFIER)
2976 if (token.v.symbol == sym_get) {
2978 } else if (token.v.symbol == sym_put) {
2980 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
2985 if (token.type != T_IDENTIFIER)
2988 if (specifiers->get_property_sym != NULL) {
2989 errorf(HERE, "get property name already specified");
2991 specifiers->get_property_sym = token.v.symbol;
2994 if (specifiers->put_property_sym != NULL) {
2995 errorf(HERE, "put property name already specified");
2997 specifiers->put_property_sym = token.v.symbol;
3001 if (token.type == ',') {
3008 } else if (symbol == sym_selectany) {
3010 DET_MOD(selectany, DM_SELECTANY);
3011 } else if (symbol == sym_uuid) {
3014 if (token.type != T_STRING_LITERAL)
3018 } else if (symbol == sym_deprecated) {
3020 if (specifiers->deprecated != 0)
3021 warningf(HERE, "deprecated used more than once");
3022 specifiers->deprecated = 1;
3023 if (token.type == '(') {
3025 if (token.type == T_STRING_LITERAL) {
3026 specifiers->deprecated_string = token.v.string.begin;
3029 errorf(HERE, "string literal expected");
3033 } else if (symbol == sym_noalias) {
3035 DET_MOD(noalias, DM_NOALIAS);
3037 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
3039 if (token.type == '(')
3043 if (token.type == ',')
3050 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3052 type_t *type = NULL;
3053 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3054 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3055 unsigned type_specifiers = 0;
3058 specifiers->source_position = token.source_position;
3061 specifiers->modifiers
3062 |= parse_attributes(&specifiers->gnu_attributes);
3063 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3064 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3066 switch(token.type) {
3069 #define MATCH_STORAGE_CLASS(token, class) \
3071 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
3072 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3074 specifiers->declared_storage_class = class; \
3078 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3079 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3080 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3081 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3082 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3087 add_anchor_token(')');
3088 parse_microsoft_extended_decl_modifier(specifiers);
3089 rem_anchor_token(')');
3094 switch (specifiers->declared_storage_class) {
3095 case STORAGE_CLASS_NONE:
3096 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
3099 case STORAGE_CLASS_EXTERN:
3100 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
3103 case STORAGE_CLASS_STATIC:
3104 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
3108 errorf(HERE, "multiple storage classes in declaration specifiers");
3114 /* type qualifiers */
3115 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3117 qualifiers |= qualifier; \
3121 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3122 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3123 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3124 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3125 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3126 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3127 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3128 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3130 case T___extension__:
3135 /* type specifiers */
3136 #define MATCH_SPECIFIER(token, specifier, name) \
3139 if (type_specifiers & specifier) { \
3140 errorf(HERE, "multiple " name " type specifiers given"); \
3142 type_specifiers |= specifier; \
3146 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3147 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3148 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3149 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3150 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3151 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3152 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3153 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3154 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3155 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3156 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3157 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3158 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3159 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3160 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3161 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3163 case T__forceinline:
3164 /* only in microsoft mode */
3165 specifiers->modifiers |= DM_FORCEINLINE;
3170 specifiers->is_inline = true;
3175 if (type_specifiers & SPECIFIER_LONG_LONG) {
3176 errorf(HERE, "multiple type specifiers given");
3177 } else if (type_specifiers & SPECIFIER_LONG) {
3178 type_specifiers |= SPECIFIER_LONG_LONG;
3180 type_specifiers |= SPECIFIER_LONG;
3185 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
3187 type->compound.declaration = parse_compound_type_specifier(true);
3191 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
3192 type->compound.declaration = parse_compound_type_specifier(false);
3193 if (type->compound.declaration->modifiers & DM_TRANSPARENT_UNION)
3194 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3198 type = parse_enum_specifier();
3201 type = parse_typeof();
3203 case T___builtin_va_list:
3204 type = duplicate_type(type_valist);
3208 case T_IDENTIFIER: {
3209 /* only parse identifier if we haven't found a type yet */
3210 if (type != NULL || type_specifiers != 0)
3211 goto finish_specifiers;
3213 type_t *typedef_type = get_typedef_type(token.v.symbol);
3215 if (typedef_type == NULL)
3216 goto finish_specifiers;
3219 type = typedef_type;
3223 /* function specifier */
3225 goto finish_specifiers;
3232 atomic_type_kind_t atomic_type;
3234 /* match valid basic types */
3235 switch(type_specifiers) {
3236 case SPECIFIER_VOID:
3237 atomic_type = ATOMIC_TYPE_VOID;
3239 case SPECIFIER_CHAR:
3240 atomic_type = ATOMIC_TYPE_CHAR;
3242 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3243 atomic_type = ATOMIC_TYPE_SCHAR;
3245 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3246 atomic_type = ATOMIC_TYPE_UCHAR;
3248 case SPECIFIER_SHORT:
3249 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3250 case SPECIFIER_SHORT | SPECIFIER_INT:
3251 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3252 atomic_type = ATOMIC_TYPE_SHORT;
3254 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3255 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3256 atomic_type = ATOMIC_TYPE_USHORT;
3259 case SPECIFIER_SIGNED:
3260 case SPECIFIER_SIGNED | SPECIFIER_INT:
3261 atomic_type = ATOMIC_TYPE_INT;
3263 case SPECIFIER_UNSIGNED:
3264 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3265 atomic_type = ATOMIC_TYPE_UINT;
3267 case SPECIFIER_LONG:
3268 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3269 case SPECIFIER_LONG | SPECIFIER_INT:
3270 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3271 atomic_type = ATOMIC_TYPE_LONG;
3273 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3274 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3275 atomic_type = ATOMIC_TYPE_ULONG;
3278 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3279 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3280 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3281 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3283 atomic_type = ATOMIC_TYPE_LONGLONG;
3284 goto warn_about_long_long;
3286 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3287 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3289 atomic_type = ATOMIC_TYPE_ULONGLONG;
3290 warn_about_long_long:
3291 if (warning.long_long) {
3292 warningf(&specifiers->source_position,
3293 "ISO C90 does not support 'long long'");
3297 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3298 atomic_type = unsigned_int8_type_kind;
3301 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3302 atomic_type = unsigned_int16_type_kind;
3305 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3306 atomic_type = unsigned_int32_type_kind;
3309 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3310 atomic_type = unsigned_int64_type_kind;
3313 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3314 atomic_type = unsigned_int128_type_kind;
3317 case SPECIFIER_INT8:
3318 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3319 atomic_type = int8_type_kind;
3322 case SPECIFIER_INT16:
3323 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3324 atomic_type = int16_type_kind;
3327 case SPECIFIER_INT32:
3328 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3329 atomic_type = int32_type_kind;
3332 case SPECIFIER_INT64:
3333 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3334 atomic_type = int64_type_kind;
3337 case SPECIFIER_INT128:
3338 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3339 atomic_type = int128_type_kind;
3342 case SPECIFIER_FLOAT:
3343 atomic_type = ATOMIC_TYPE_FLOAT;
3345 case SPECIFIER_DOUBLE:
3346 atomic_type = ATOMIC_TYPE_DOUBLE;
3348 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3349 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3351 case SPECIFIER_BOOL:
3352 atomic_type = ATOMIC_TYPE_BOOL;
3354 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3355 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3356 atomic_type = ATOMIC_TYPE_FLOAT;
3358 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3359 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3360 atomic_type = ATOMIC_TYPE_DOUBLE;
3362 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3363 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3364 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3367 /* invalid specifier combination, give an error message */
3368 if (type_specifiers == 0) {
3369 if (! strict_mode) {
3370 if (warning.implicit_int) {
3371 warningf(HERE, "no type specifiers in declaration, using 'int'");
3373 atomic_type = ATOMIC_TYPE_INT;
3376 errorf(HERE, "no type specifiers given in declaration");
3378 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3379 (type_specifiers & SPECIFIER_UNSIGNED)) {
3380 errorf(HERE, "signed and unsigned specifiers gives");
3381 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3382 errorf(HERE, "only integer types can be signed or unsigned");
3384 errorf(HERE, "multiple datatypes in declaration");
3386 atomic_type = ATOMIC_TYPE_INVALID;
3389 if (type_specifiers & SPECIFIER_COMPLEX &&
3390 atomic_type != ATOMIC_TYPE_INVALID) {
3391 type = allocate_type_zero(TYPE_COMPLEX, &builtin_source_position);
3392 type->complex.akind = atomic_type;
3393 } else if (type_specifiers & SPECIFIER_IMAGINARY &&
3394 atomic_type != ATOMIC_TYPE_INVALID) {
3395 type = allocate_type_zero(TYPE_IMAGINARY, &builtin_source_position);
3396 type->imaginary.akind = atomic_type;
3398 type = allocate_type_zero(TYPE_ATOMIC, &builtin_source_position);
3399 type->atomic.akind = atomic_type;
3403 if (type_specifiers != 0) {
3404 errorf(HERE, "multiple datatypes in declaration");
3408 /* FIXME: check type qualifiers here */
3410 type->base.qualifiers = qualifiers;
3411 type->base.modifiers = modifiers;
3413 type_t *result = typehash_insert(type);
3414 if (newtype && result != type) {
3418 specifiers->type = result;
3423 static type_qualifiers_t parse_type_qualifiers(void)
3425 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3428 switch(token.type) {
3429 /* type qualifiers */
3430 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3431 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3432 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3433 /* microsoft extended type modifiers */
3434 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3435 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3436 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3437 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3438 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3446 static declaration_t *parse_identifier_list(void)
3448 declaration_t *declarations = NULL;
3449 declaration_t *last_declaration = NULL;
3451 declaration_t *const declaration = allocate_declaration_zero();
3452 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3453 declaration->source_position = token.source_position;
3454 declaration->symbol = token.v.symbol;
3457 if (last_declaration != NULL) {
3458 last_declaration->next = declaration;
3460 declarations = declaration;
3462 last_declaration = declaration;
3464 if (token.type != ',') {
3468 } while (token.type == T_IDENTIFIER);
3470 return declarations;
3473 static type_t *automatic_type_conversion(type_t *orig_type);
3475 static void semantic_parameter(declaration_t *declaration)
3477 /* TODO: improve error messages */
3478 source_position_t const* const pos = &declaration->source_position;
3480 switch (declaration->declared_storage_class) {
3481 case STORAGE_CLASS_TYPEDEF:
3482 errorf(pos, "typedef not allowed in parameter list");
3485 /* Allowed storage classes */
3486 case STORAGE_CLASS_NONE:
3487 case STORAGE_CLASS_REGISTER:
3491 errorf(pos, "parameter may only have none or register storage class");
3495 type_t *const orig_type = declaration->type;
3496 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
3497 * sugar. Turn it into a pointer.
3498 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
3499 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
3501 type_t *const type = automatic_type_conversion(orig_type);
3502 declaration->type = type;
3504 if (is_type_incomplete(skip_typeref(type))) {
3505 errorf(pos, "incomplete type '%T' not allowed for parameter '%Y'",
3506 orig_type, declaration->symbol);
3510 static declaration_t *parse_parameter(void)
3512 declaration_specifiers_t specifiers;
3513 memset(&specifiers, 0, sizeof(specifiers));
3515 parse_declaration_specifiers(&specifiers);
3517 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
3522 static declaration_t *parse_parameters(function_type_t *type)
3524 declaration_t *declarations = NULL;
3527 add_anchor_token(')');
3528 int saved_comma_state = save_and_reset_anchor_state(',');
3530 if (token.type == T_IDENTIFIER) {
3531 symbol_t *symbol = token.v.symbol;
3532 if (!is_typedef_symbol(symbol)) {
3533 type->kr_style_parameters = true;
3534 declarations = parse_identifier_list();
3535 goto parameters_finished;
3539 if (token.type == ')') {
3540 type->unspecified_parameters = 1;
3541 goto parameters_finished;
3544 declaration_t *declaration;
3545 declaration_t *last_declaration = NULL;
3546 function_parameter_t *parameter;
3547 function_parameter_t *last_parameter = NULL;
3550 switch(token.type) {
3554 goto parameters_finished;
3557 case T___extension__:
3559 declaration = parse_parameter();
3561 /* func(void) is not a parameter */
3562 if (last_parameter == NULL
3563 && token.type == ')'
3564 && declaration->symbol == NULL
3565 && skip_typeref(declaration->type) == type_void) {
3566 goto parameters_finished;
3568 semantic_parameter(declaration);
3570 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
3571 memset(parameter, 0, sizeof(parameter[0]));
3572 parameter->type = declaration->type;
3574 if (last_parameter != NULL) {
3575 last_declaration->next = declaration;
3576 last_parameter->next = parameter;
3578 type->parameters = parameter;
3579 declarations = declaration;
3581 last_parameter = parameter;
3582 last_declaration = declaration;
3586 goto parameters_finished;
3588 if (token.type != ',') {
3589 goto parameters_finished;
3595 parameters_finished:
3596 rem_anchor_token(')');
3599 restore_anchor_state(',', saved_comma_state);
3600 return declarations;
3603 restore_anchor_state(',', saved_comma_state);
3607 typedef enum construct_type_kind_t {
3612 } construct_type_kind_t;
3614 typedef struct construct_type_t construct_type_t;
3615 struct construct_type_t {
3616 construct_type_kind_t kind;
3617 construct_type_t *next;
3620 typedef struct parsed_pointer_t parsed_pointer_t;
3621 struct parsed_pointer_t {
3622 construct_type_t construct_type;
3623 type_qualifiers_t type_qualifiers;
3626 typedef struct construct_function_type_t construct_function_type_t;
3627 struct construct_function_type_t {
3628 construct_type_t construct_type;
3629 type_t *function_type;
3632 typedef struct parsed_array_t parsed_array_t;
3633 struct parsed_array_t {
3634 construct_type_t construct_type;
3635 type_qualifiers_t type_qualifiers;
3641 typedef struct construct_base_type_t construct_base_type_t;
3642 struct construct_base_type_t {
3643 construct_type_t construct_type;
3647 static construct_type_t *parse_pointer_declarator(void)
3651 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3652 memset(pointer, 0, sizeof(pointer[0]));
3653 pointer->construct_type.kind = CONSTRUCT_POINTER;
3654 pointer->type_qualifiers = parse_type_qualifiers();
3656 return (construct_type_t*) pointer;
3659 static construct_type_t *parse_array_declarator(void)
3662 add_anchor_token(']');
3664 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
3665 memset(array, 0, sizeof(array[0]));
3666 array->construct_type.kind = CONSTRUCT_ARRAY;
3668 if (token.type == T_static) {
3669 array->is_static = true;
3673 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3674 if (type_qualifiers != 0) {
3675 if (token.type == T_static) {
3676 array->is_static = true;
3680 array->type_qualifiers = type_qualifiers;
3682 if (token.type == '*' && look_ahead(1)->type == ']') {
3683 array->is_variable = true;
3685 } else if (token.type != ']') {
3686 array->size = parse_assignment_expression();
3689 rem_anchor_token(']');
3692 return (construct_type_t*) array;
3697 static construct_type_t *parse_function_declarator(declaration_t *declaration)
3700 if (declaration != NULL) {
3701 type = allocate_type_zero(TYPE_FUNCTION, &declaration->source_position);
3703 unsigned mask = declaration->modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
3705 if (mask & (mask-1)) {
3706 const char *first = NULL, *second = NULL;
3708 /* more than one calling convention set */
3709 if (declaration->modifiers & DM_CDECL) {
3710 if (first == NULL) first = "cdecl";
3711 else if (second == NULL) second = "cdecl";
3713 if (declaration->modifiers & DM_STDCALL) {
3714 if (first == NULL) first = "stdcall";
3715 else if (second == NULL) second = "stdcall";
3717 if (declaration->modifiers & DM_FASTCALL) {
3718 if (first == NULL) first = "faslcall";
3719 else if (second == NULL) second = "fastcall";
3721 if (declaration->modifiers & DM_THISCALL) {
3722 if (first == NULL) first = "thiscall";
3723 else if (second == NULL) second = "thiscall";
3725 errorf(&declaration->source_position, "%s and %s attributes are not compatible", first, second);
3728 if (declaration->modifiers & DM_CDECL)
3729 type->function.calling_convention = CC_CDECL;
3730 else if (declaration->modifiers & DM_STDCALL)
3731 type->function.calling_convention = CC_STDCALL;
3732 else if (declaration->modifiers & DM_FASTCALL)
3733 type->function.calling_convention = CC_FASTCALL;
3734 else if (declaration->modifiers & DM_THISCALL)
3735 type->function.calling_convention = CC_THISCALL;
3737 type = allocate_type_zero(TYPE_FUNCTION, HERE);
3740 declaration_t *parameters = parse_parameters(&type->function);
3741 if (declaration != NULL) {
3742 declaration->scope.declarations = parameters;
3745 construct_function_type_t *construct_function_type =
3746 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
3747 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
3748 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
3749 construct_function_type->function_type = type;
3751 return &construct_function_type->construct_type;
3754 static void fix_declaration_type(declaration_t *declaration)
3756 decl_modifiers_t declaration_modifiers = declaration->modifiers;
3757 type_modifiers_t type_modifiers = declaration->type->base.modifiers;
3759 if (declaration_modifiers & DM_TRANSPARENT_UNION)
3760 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3762 if (declaration->type->base.modifiers == type_modifiers)
3765 type_t *copy = duplicate_type(declaration->type);
3766 copy->base.modifiers = type_modifiers;
3768 type_t *result = typehash_insert(copy);
3769 if (result != copy) {
3770 obstack_free(type_obst, copy);
3773 declaration->type = result;
3776 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
3777 bool may_be_abstract)
3779 /* construct a single linked list of construct_type_t's which describe
3780 * how to construct the final declarator type */
3781 construct_type_t *first = NULL;
3782 construct_type_t *last = NULL;
3783 gnu_attribute_t *attributes = NULL;
3785 decl_modifiers_t modifiers = parse_attributes(&attributes);
3788 while (token.type == '*') {
3789 construct_type_t *type = parse_pointer_declarator();
3799 /* TODO: find out if this is correct */
3800 modifiers |= parse_attributes(&attributes);
3803 if (declaration != NULL)
3804 declaration->modifiers |= modifiers;
3806 construct_type_t *inner_types = NULL;
3808 switch(token.type) {
3810 if (declaration == NULL) {
3811 errorf(HERE, "no identifier expected in typename");
3813 declaration->symbol = token.v.symbol;
3814 declaration->source_position = token.source_position;
3820 add_anchor_token(')');
3821 inner_types = parse_inner_declarator(declaration, may_be_abstract);
3822 rem_anchor_token(')');
3826 if (may_be_abstract)
3828 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3829 /* avoid a loop in the outermost scope, because eat_statement doesn't
3831 if (token.type == '}' && current_function == NULL) {
3839 construct_type_t *p = last;
3842 construct_type_t *type;
3843 switch(token.type) {
3845 type = parse_function_declarator(declaration);
3848 type = parse_array_declarator();
3851 goto declarator_finished;
3854 /* insert in the middle of the list (behind p) */
3856 type->next = p->next;
3867 declarator_finished:
3868 /* append inner_types at the end of the list, we don't to set last anymore
3869 * as it's not needed anymore */
3871 assert(first == NULL);
3872 first = inner_types;
3874 last->next = inner_types;
3882 static void parse_declaration_attributes(declaration_t *declaration)
3884 gnu_attribute_t *attributes = NULL;
3885 decl_modifiers_t modifiers = parse_attributes(&attributes);
3887 if (declaration == NULL)
3890 declaration->modifiers |= modifiers;
3891 /* check if we have these stupid mode attributes... */
3892 type_t *old_type = declaration->type;
3893 if (old_type == NULL)
3896 gnu_attribute_t *attribute = attributes;
3897 for ( ; attribute != NULL; attribute = attribute->next) {
3898 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
3901 atomic_type_kind_t akind = attribute->u.akind;
3902 if (!is_type_signed(old_type)) {
3904 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
3905 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
3906 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
3907 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
3909 panic("invalid akind in mode attribute");
3913 = make_atomic_type(akind, old_type->base.qualifiers);
3917 static type_t *construct_declarator_type(construct_type_t *construct_list,
3920 construct_type_t *iter = construct_list;
3921 for( ; iter != NULL; iter = iter->next) {
3922 switch(iter->kind) {
3923 case CONSTRUCT_INVALID:
3924 internal_errorf(HERE, "invalid type construction found");
3925 case CONSTRUCT_FUNCTION: {
3926 construct_function_type_t *construct_function_type
3927 = (construct_function_type_t*) iter;
3929 type_t *function_type = construct_function_type->function_type;
3931 function_type->function.return_type = type;
3933 type_t *skipped_return_type = skip_typeref(type);
3934 if (is_type_function(skipped_return_type)) {
3935 errorf(HERE, "function returning function is not allowed");
3936 type = type_error_type;
3937 } else if (is_type_array(skipped_return_type)) {
3938 errorf(HERE, "function returning array is not allowed");
3939 type = type_error_type;
3941 type = function_type;
3946 case CONSTRUCT_POINTER: {
3947 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
3948 type_t *pointer_type = allocate_type_zero(TYPE_POINTER, &null_position);
3949 pointer_type->pointer.points_to = type;
3950 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
3952 type = pointer_type;
3956 case CONSTRUCT_ARRAY: {
3957 parsed_array_t *parsed_array = (parsed_array_t*) iter;
3958 type_t *array_type = allocate_type_zero(TYPE_ARRAY, &null_position);
3960 expression_t *size_expression = parsed_array->size;
3961 if (size_expression != NULL) {
3963 = create_implicit_cast(size_expression, type_size_t);
3966 array_type->base.qualifiers = parsed_array->type_qualifiers;
3967 array_type->array.element_type = type;
3968 array_type->array.is_static = parsed_array->is_static;
3969 array_type->array.is_variable = parsed_array->is_variable;
3970 array_type->array.size_expression = size_expression;
3972 if (size_expression != NULL) {
3973 if (is_constant_expression(size_expression)) {
3974 array_type->array.size_constant = true;
3975 array_type->array.size
3976 = fold_constant(size_expression);
3978 array_type->array.is_vla = true;
3982 type_t *skipped_type = skip_typeref(type);
3983 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
3984 errorf(HERE, "array of void is not allowed");
3985 type = type_error_type;
3993 type_t *hashed_type = typehash_insert(type);
3994 if (hashed_type != type) {
3995 /* the function type was constructed earlier freeing it here will
3996 * destroy other types... */
3997 if (iter->kind != CONSTRUCT_FUNCTION) {
4007 static declaration_t *parse_declarator(
4008 const declaration_specifiers_t *specifiers, bool may_be_abstract)
4010 declaration_t *const declaration = allocate_declaration_zero();
4011 declaration->declared_storage_class = specifiers->declared_storage_class;
4012 declaration->modifiers = specifiers->modifiers;
4013 declaration->deprecated_string = specifiers->deprecated_string;
4014 declaration->get_property_sym = specifiers->get_property_sym;
4015 declaration->put_property_sym = specifiers->put_property_sym;
4016 declaration->is_inline = specifiers->is_inline;
4018 declaration->storage_class = specifiers->declared_storage_class;
4019 if (declaration->storage_class == STORAGE_CLASS_NONE
4020 && scope != global_scope) {
4021 declaration->storage_class = STORAGE_CLASS_AUTO;
4024 if (specifiers->alignment != 0) {
4025 /* TODO: add checks here */
4026 declaration->alignment = specifiers->alignment;
4029 construct_type_t *construct_type
4030 = parse_inner_declarator(declaration, may_be_abstract);
4031 type_t *const type = specifiers->type;
4032 declaration->type = construct_declarator_type(construct_type, type);
4034 parse_declaration_attributes(declaration);
4036 fix_declaration_type(declaration);
4038 if (construct_type != NULL) {
4039 obstack_free(&temp_obst, construct_type);
4045 static type_t *parse_abstract_declarator(type_t *base_type)
4047 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4049 type_t *result = construct_declarator_type(construct_type, base_type);
4050 if (construct_type != NULL) {
4051 obstack_free(&temp_obst, construct_type);
4057 static declaration_t *append_declaration(declaration_t* const declaration)
4059 if (last_declaration != NULL) {
4060 last_declaration->next = declaration;
4062 scope->declarations = declaration;
4064 last_declaration = declaration;
4069 * Check if the declaration of main is suspicious. main should be a
4070 * function with external linkage, returning int, taking either zero
4071 * arguments, two, or three arguments of appropriate types, ie.
4073 * int main([ int argc, char **argv [, char **env ] ]).
4075 * @param decl the declaration to check
4076 * @param type the function type of the declaration
4078 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
4080 if (decl->storage_class == STORAGE_CLASS_STATIC) {
4081 warningf(&decl->source_position,
4082 "'main' is normally a non-static function");
4084 if (skip_typeref(func_type->return_type) != type_int) {
4085 warningf(&decl->source_position,
4086 "return type of 'main' should be 'int', but is '%T'",
4087 func_type->return_type);
4089 const function_parameter_t *parm = func_type->parameters;
4091 type_t *const first_type = parm->type;
4092 if (!types_compatible(skip_typeref(first_type), type_int)) {
4093 warningf(&decl->source_position,
4094 "first argument of 'main' should be 'int', but is '%T'", first_type);
4098 type_t *const second_type = parm->type;
4099 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4100 warningf(&decl->source_position,
4101 "second argument of 'main' should be 'char**', but is '%T'", second_type);
4105 type_t *const third_type = parm->type;
4106 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4107 warningf(&decl->source_position,
4108 "third argument of 'main' should be 'char**', but is '%T'", third_type);
4112 goto warn_arg_count;
4116 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
4122 * Check if a symbol is the equal to "main".
4124 static bool is_sym_main(const symbol_t *const sym)
4126 return strcmp(sym->string, "main") == 0;
4129 static declaration_t *internal_record_declaration(
4130 declaration_t *const declaration,
4131 const bool is_definition)
4133 const symbol_t *const symbol = declaration->symbol;
4134 const namespace_t namespc = (namespace_t)declaration->namespc;
4136 assert(symbol != NULL);
4137 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4139 type_t *const orig_type = declaration->type;
4140 type_t *const type = skip_typeref(orig_type);
4141 if (is_type_function(type) &&
4142 type->function.unspecified_parameters &&
4143 warning.strict_prototypes &&
4144 previous_declaration == NULL) {
4145 warningf(&declaration->source_position,
4146 "function declaration '%#T' is not a prototype",
4147 orig_type, declaration->symbol);
4150 if (warning.main && is_type_function(type) && is_sym_main(symbol)) {
4151 check_type_of_main(declaration, &type->function);
4154 if (warning.nested_externs &&
4155 declaration->storage_class == STORAGE_CLASS_EXTERN &&
4156 scope != global_scope) {
4157 warningf(&declaration->source_position,
4158 "nested extern declaration of '%#T'", declaration->type, symbol);
4161 assert(declaration != previous_declaration);
4162 if (previous_declaration != NULL
4163 && previous_declaration->parent_scope == scope) {
4164 /* can happen for K&R style declarations */
4165 if (previous_declaration->type == NULL) {
4166 previous_declaration->type = declaration->type;
4169 const type_t *prev_type = skip_typeref(previous_declaration->type);
4170 if (!types_compatible(type, prev_type)) {
4171 errorf(&declaration->source_position,
4172 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4173 orig_type, symbol, previous_declaration->type, symbol,
4174 &previous_declaration->source_position);
4176 unsigned old_storage_class = previous_declaration->storage_class;
4177 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
4178 errorf(&declaration->source_position,
4179 "redeclaration of enum entry '%Y' (declared %P)",
4180 symbol, &previous_declaration->source_position);
4181 return previous_declaration;
4184 if (warning.redundant_decls &&
4186 previous_declaration->storage_class == STORAGE_CLASS_STATIC &&
4187 !(previous_declaration->modifiers & DM_USED) &&
4188 !previous_declaration->used) {
4189 warningf(&previous_declaration->source_position,
4190 "unnecessary static forward declaration for '%#T'",
4191 previous_declaration->type, symbol);
4194 unsigned new_storage_class = declaration->storage_class;
4196 if (is_type_incomplete(prev_type)) {
4197 previous_declaration->type = type;
4201 /* pretend no storage class means extern for function
4202 * declarations (except if the previous declaration is neither
4203 * none nor extern) */
4204 if (is_type_function(type)) {
4205 if (prev_type->function.unspecified_parameters) {
4206 previous_declaration->type = type;
4210 switch (old_storage_class) {
4211 case STORAGE_CLASS_NONE:
4212 old_storage_class = STORAGE_CLASS_EXTERN;
4215 case STORAGE_CLASS_EXTERN:
4216 if (is_definition) {
4217 if (warning.missing_prototypes &&
4218 prev_type->function.unspecified_parameters &&
4219 !is_sym_main(symbol)) {
4220 warningf(&declaration->source_position,
4221 "no previous prototype for '%#T'",
4224 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4225 new_storage_class = STORAGE_CLASS_EXTERN;
4234 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4235 new_storage_class == STORAGE_CLASS_EXTERN) {
4236 warn_redundant_declaration:
4237 if (!is_definition &&
4238 warning.redundant_decls &&
4239 strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
4240 warningf(&declaration->source_position,
4241 "redundant declaration for '%Y' (declared %P)",
4242 symbol, &previous_declaration->source_position);
4244 } else if (current_function == NULL) {
4245 if (old_storage_class != STORAGE_CLASS_STATIC &&
4246 new_storage_class == STORAGE_CLASS_STATIC) {
4247 errorf(&declaration->source_position,
4248 "static declaration of '%Y' follows non-static declaration (declared %P)",
4249 symbol, &previous_declaration->source_position);
4250 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4251 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4252 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4254 goto warn_redundant_declaration;
4256 } else if (old_storage_class == new_storage_class) {
4257 errorf(&declaration->source_position,
4258 "redeclaration of '%Y' (declared %P)",
4259 symbol, &previous_declaration->source_position);
4261 errorf(&declaration->source_position,
4262 "redeclaration of '%Y' with different linkage (declared %P)",
4263 symbol, &previous_declaration->source_position);
4267 previous_declaration->modifiers |= declaration->modifiers;
4268 previous_declaration->is_inline |= declaration->is_inline;
4269 return previous_declaration;
4270 } else if (is_type_function(type)) {
4271 if (is_definition &&
4272 declaration->storage_class != STORAGE_CLASS_STATIC) {
4273 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4274 warningf(&declaration->source_position,
4275 "no previous prototype for '%#T'", orig_type, symbol);
4276 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4277 warningf(&declaration->source_position,
4278 "no previous declaration for '%#T'", orig_type,
4283 if (warning.missing_declarations &&
4284 scope == global_scope && (
4285 declaration->storage_class == STORAGE_CLASS_NONE ||
4286 declaration->storage_class == STORAGE_CLASS_THREAD
4288 warningf(&declaration->source_position,
4289 "no previous declaration for '%#T'", orig_type, symbol);
4293 assert(declaration->parent_scope == NULL);
4294 assert(scope != NULL);
4296 declaration->parent_scope = scope;
4298 environment_push(declaration);
4299 return append_declaration(declaration);
4302 static declaration_t *record_declaration(declaration_t *declaration)
4304 return internal_record_declaration(declaration, false);
4307 static declaration_t *record_definition(declaration_t *declaration)
4309 return internal_record_declaration(declaration, true);
4312 static void parser_error_multiple_definition(declaration_t *declaration,
4313 const source_position_t *source_position)
4315 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4316 declaration->symbol, &declaration->source_position);
4319 static bool is_declaration_specifier(const token_t *token,
4320 bool only_specifiers_qualifiers)
4322 switch(token->type) {
4327 return is_typedef_symbol(token->v.symbol);
4329 case T___extension__:
4331 return !only_specifiers_qualifiers;
4338 static void parse_init_declarator_rest(declaration_t *declaration)
4342 type_t *orig_type = declaration->type;
4343 type_t *type = skip_typeref(orig_type);
4345 if (declaration->init.initializer != NULL) {
4346 parser_error_multiple_definition(declaration, HERE);
4349 bool must_be_constant = false;
4350 if (declaration->storage_class == STORAGE_CLASS_STATIC
4351 || declaration->storage_class == STORAGE_CLASS_THREAD_STATIC
4352 || declaration->parent_scope == global_scope) {
4353 must_be_constant = true;
4356 parse_initializer_env_t env;
4357 env.type = orig_type;
4358 env.must_be_constant = must_be_constant;
4359 env.declaration = declaration;
4361 initializer_t *initializer = parse_initializer(&env);
4363 if (env.type != orig_type) {
4364 orig_type = env.type;
4365 type = skip_typeref(orig_type);
4366 declaration->type = env.type;
4369 if (is_type_function(type)) {
4370 errorf(&declaration->source_position,
4371 "initializers not allowed for function types at declator '%Y' (type '%T')",
4372 declaration->symbol, orig_type);
4374 declaration->init.initializer = initializer;
4378 /* parse rest of a declaration without any declarator */
4379 static void parse_anonymous_declaration_rest(
4380 const declaration_specifiers_t *specifiers,
4381 parsed_declaration_func finished_declaration)
4385 declaration_t *const declaration = allocate_declaration_zero();
4386 declaration->type = specifiers->type;
4387 declaration->declared_storage_class = specifiers->declared_storage_class;
4388 declaration->source_position = specifiers->source_position;
4389 declaration->modifiers = specifiers->modifiers;
4391 if (declaration->declared_storage_class != STORAGE_CLASS_NONE) {
4392 warningf(&declaration->source_position,
4393 "useless storage class in empty declaration");
4395 declaration->storage_class = STORAGE_CLASS_NONE;
4397 type_t *type = declaration->type;
4398 switch (type->kind) {
4399 case TYPE_COMPOUND_STRUCT:
4400 case TYPE_COMPOUND_UNION: {
4401 if (type->compound.declaration->symbol == NULL) {
4402 warningf(&declaration->source_position,
4403 "unnamed struct/union that defines no instances");
4412 warningf(&declaration->source_position, "empty declaration");
4416 finished_declaration(declaration);
4419 static void parse_declaration_rest(declaration_t *ndeclaration,
4420 const declaration_specifiers_t *specifiers,
4421 parsed_declaration_func finished_declaration)
4423 add_anchor_token(';');
4424 add_anchor_token('=');
4425 add_anchor_token(',');
4427 declaration_t *declaration = finished_declaration(ndeclaration);
4429 type_t *orig_type = declaration->type;
4430 type_t *type = skip_typeref(orig_type);
4432 if (type->kind != TYPE_FUNCTION &&
4433 declaration->is_inline &&
4434 is_type_valid(type)) {
4435 warningf(&declaration->source_position,
4436 "variable '%Y' declared 'inline'\n", declaration->symbol);
4439 if (token.type == '=') {
4440 parse_init_declarator_rest(declaration);
4443 if (token.type != ',')
4447 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4452 rem_anchor_token(';');
4453 rem_anchor_token('=');
4454 rem_anchor_token(',');
4457 static declaration_t *finished_kr_declaration(declaration_t *declaration)
4459 symbol_t *symbol = declaration->symbol;
4460 if (symbol == NULL) {
4461 errorf(HERE, "anonymous declaration not valid as function parameter");
4464 namespace_t namespc = (namespace_t) declaration->namespc;
4465 if (namespc != NAMESPACE_NORMAL) {
4466 return record_declaration(declaration);
4469 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4470 if (previous_declaration == NULL ||
4471 previous_declaration->parent_scope != scope) {
4472 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4477 if (previous_declaration->type == NULL) {
4478 previous_declaration->type = declaration->type;
4479 previous_declaration->declared_storage_class = declaration->declared_storage_class;
4480 previous_declaration->storage_class = declaration->storage_class;
4481 previous_declaration->parent_scope = scope;
4482 return previous_declaration;
4484 return record_declaration(declaration);
4488 static void parse_declaration(parsed_declaration_func finished_declaration)
4490 declaration_specifiers_t specifiers;
4491 memset(&specifiers, 0, sizeof(specifiers));
4492 parse_declaration_specifiers(&specifiers);
4494 if (token.type == ';') {
4495 parse_anonymous_declaration_rest(&specifiers, append_declaration);
4497 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4498 parse_declaration_rest(declaration, &specifiers, finished_declaration);
4502 static type_t *get_default_promoted_type(type_t *orig_type)
4504 type_t *result = orig_type;
4506 type_t *type = skip_typeref(orig_type);
4507 if (is_type_integer(type)) {
4508 result = promote_integer(type);
4509 } else if (type == type_float) {
4510 result = type_double;
4516 static void parse_kr_declaration_list(declaration_t *declaration)
4518 type_t *type = skip_typeref(declaration->type);
4519 if (!is_type_function(type))
4522 if (!type->function.kr_style_parameters)
4525 /* push function parameters */
4526 int top = environment_top();
4527 scope_t *last_scope = scope;
4528 set_scope(&declaration->scope);
4530 declaration_t *parameter = declaration->scope.declarations;
4531 for ( ; parameter != NULL; parameter = parameter->next) {
4532 assert(parameter->parent_scope == NULL);
4533 parameter->parent_scope = scope;
4534 environment_push(parameter);
4537 /* parse declaration list */
4538 while (is_declaration_specifier(&token, false)) {
4539 parse_declaration(finished_kr_declaration);
4542 /* pop function parameters */
4543 assert(scope == &declaration->scope);
4544 set_scope(last_scope);
4545 environment_pop_to(top);
4547 /* update function type */
4548 type_t *new_type = duplicate_type(type);
4550 function_parameter_t *parameters = NULL;
4551 function_parameter_t *last_parameter = NULL;
4553 declaration_t *parameter_declaration = declaration->scope.declarations;
4554 for( ; parameter_declaration != NULL;
4555 parameter_declaration = parameter_declaration->next) {
4556 type_t *parameter_type = parameter_declaration->type;
4557 if (parameter_type == NULL) {
4559 errorf(HERE, "no type specified for function parameter '%Y'",
4560 parameter_declaration->symbol);
4562 if (warning.implicit_int) {
4563 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4564 parameter_declaration->symbol);
4566 parameter_type = type_int;
4567 parameter_declaration->type = parameter_type;
4571 semantic_parameter(parameter_declaration);
4572 parameter_type = parameter_declaration->type;
4575 * we need the default promoted types for the function type
4577 parameter_type = get_default_promoted_type(parameter_type);
4579 function_parameter_t *function_parameter
4580 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
4581 memset(function_parameter, 0, sizeof(function_parameter[0]));
4583 function_parameter->type = parameter_type;
4584 if (last_parameter != NULL) {
4585 last_parameter->next = function_parameter;
4587 parameters = function_parameter;
4589 last_parameter = function_parameter;
4592 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
4594 new_type->function.parameters = parameters;
4595 new_type->function.unspecified_parameters = true;
4597 type = typehash_insert(new_type);
4598 if (type != new_type) {
4599 obstack_free(type_obst, new_type);
4602 declaration->type = type;
4605 static bool first_err = true;
4608 * When called with first_err set, prints the name of the current function,
4611 static void print_in_function(void)
4615 diagnosticf("%s: In function '%Y':\n",
4616 current_function->source_position.input_name,
4617 current_function->symbol);
4622 * Check if all labels are defined in the current function.
4623 * Check if all labels are used in the current function.
4625 static void check_labels(void)
4627 for (const goto_statement_t *goto_statement = goto_first;
4628 goto_statement != NULL;
4629 goto_statement = goto_statement->next) {
4630 declaration_t *label = goto_statement->label;
4633 if (label->source_position.input_name == NULL) {
4634 print_in_function();
4635 errorf(&goto_statement->base.source_position,
4636 "label '%Y' used but not defined", label->symbol);
4639 goto_first = goto_last = NULL;
4641 if (warning.unused_label) {
4642 for (const label_statement_t *label_statement = label_first;
4643 label_statement != NULL;
4644 label_statement = label_statement->next) {
4645 const declaration_t *label = label_statement->label;
4647 if (! label->used) {
4648 print_in_function();
4649 warningf(&label_statement->base.source_position,
4650 "label '%Y' defined but not used", label->symbol);
4654 label_first = label_last = NULL;
4658 * Check declarations of current_function for unused entities.
4660 static void check_declarations(void)
4662 if (warning.unused_parameter) {
4663 const scope_t *scope = ¤t_function->scope;
4665 const declaration_t *parameter = scope->declarations;
4666 for (; parameter != NULL; parameter = parameter->next) {
4667 if (! parameter->used) {
4668 print_in_function();
4669 warningf(¶meter->source_position,
4670 "unused parameter '%Y'", parameter->symbol);
4674 if (warning.unused_variable) {
4678 static int determine_truth(expression_t const* const cond)
4681 !is_constant_expression(cond) ? 0 :
4682 fold_constant(cond) != 0 ? 1 :
4686 static bool noreturn_candidate;
4688 static void check_reachable(statement_t *const stmt)
4690 if (stmt->base.reachable)
4692 if (stmt->kind != STATEMENT_DO_WHILE)
4693 stmt->base.reachable = true;
4695 statement_t *last = stmt;
4697 switch (stmt->kind) {
4698 case STATEMENT_INVALID:
4699 case STATEMENT_EMPTY:
4700 case STATEMENT_DECLARATION:
4702 next = stmt->base.next;
4705 case STATEMENT_COMPOUND:
4706 next = stmt->compound.statements;
4709 case STATEMENT_RETURN:
4710 noreturn_candidate = false;
4713 case STATEMENT_IF: {
4714 if_statement_t const* const ifs = &stmt->ifs;
4715 int const val = determine_truth(ifs->condition);
4718 check_reachable(ifs->true_statement);
4723 if (ifs->false_statement != NULL) {
4724 check_reachable(ifs->false_statement);
4728 next = stmt->base.next;
4732 case STATEMENT_SWITCH: {
4733 switch_statement_t const *const switchs = &stmt->switchs;
4734 expression_t const *const expr = switchs->expression;
4736 if (is_constant_expression(expr)) {
4737 long const val = fold_constant(expr);
4738 case_label_statement_t * defaults = NULL;
4739 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4740 if (i->expression == NULL) {
4745 expression_t *const case_expr = i->expression;
4746 if (is_constant_expression(case_expr) &&
4747 fold_constant(case_expr) == val) {
4748 check_reachable((statement_t*)i);
4753 if (defaults != NULL) {
4754 check_reachable((statement_t*)defaults);
4758 bool has_default = false;
4759 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4760 if (i->expression == NULL)
4763 check_reachable((statement_t*)i);
4770 next = stmt->base.next;
4774 case STATEMENT_EXPRESSION: {
4775 /* Check for noreturn function call */
4776 expression_t const *const expr = stmt->expression.expression;
4777 if (expr->kind == EXPR_CALL) {
4778 expression_t const *const func = expr->call.function;
4779 if (func->kind == EXPR_REFERENCE) {
4780 declaration_t const *const decl = func->reference.declaration;
4781 if (decl != NULL && decl->modifiers & DM_NORETURN) {
4787 next = stmt->base.next;
4791 case STATEMENT_CONTINUE: {
4792 statement_t *parent = stmt;
4794 parent = parent->base.parent;
4795 if (parent == NULL) /* continue not within loop */
4799 switch (parent->kind) {
4800 case STATEMENT_WHILE: goto continue_while;
4801 case STATEMENT_DO_WHILE: goto continue_do_while;
4802 case STATEMENT_FOR: goto continue_for;
4809 case STATEMENT_BREAK: {
4810 statement_t *parent = stmt;
4812 parent = parent->base.parent;
4813 if (parent == NULL) /* break not within loop/switch */
4816 switch (parent->kind) {
4817 case STATEMENT_SWITCH:
4818 case STATEMENT_WHILE:
4819 case STATEMENT_DO_WHILE:
4822 next = parent->base.next;
4823 goto found_break_parent;
4832 case STATEMENT_GOTO:
4833 next = stmt->gotos.label->init.statement;
4834 if (next == NULL) /* missing label */
4838 case STATEMENT_LABEL:
4839 next = stmt->label.statement;
4842 case STATEMENT_CASE_LABEL:
4843 next = stmt->case_label.statement;
4846 case STATEMENT_WHILE: {
4847 while_statement_t const *const whiles = &stmt->whiles;
4848 int const val = determine_truth(whiles->condition);
4851 check_reachable(whiles->body);
4856 next = stmt->base.next;
4860 case STATEMENT_DO_WHILE:
4861 next = stmt->do_while.body;
4864 case STATEMENT_FOR: {
4865 for_statement_t *const fors = &stmt->fors;
4867 if (fors->condition_reachable)
4869 fors->condition_reachable = true;
4871 expression_t const *const cond = fors->condition;
4873 cond == NULL ? 1 : determine_truth(cond);
4876 check_reachable(fors->body);
4881 next = stmt->base.next;
4885 case STATEMENT_MS_TRY:
4886 case STATEMENT_LEAVE:
4887 panic("unimplemented");
4890 while (next == NULL) {
4891 next = last->base.parent;
4893 noreturn_candidate = false;
4895 type_t *const type = current_function->type;
4896 assert(is_type_function(type));
4897 type_t *const ret = skip_typeref(type->function.return_type);
4898 if (warning.return_type &&
4899 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
4900 !is_sym_main(current_function->symbol)) {
4901 warningf(&stmt->base.source_position,
4902 "control reaches end of non-void function");
4907 switch (next->kind) {
4908 case STATEMENT_INVALID:
4909 case STATEMENT_EMPTY:
4910 case STATEMENT_DECLARATION:
4911 case STATEMENT_EXPRESSION:
4913 case STATEMENT_RETURN:
4914 case STATEMENT_CONTINUE:
4915 case STATEMENT_BREAK:
4916 case STATEMENT_GOTO:
4917 case STATEMENT_LEAVE:
4918 panic("invalid control flow in function");
4920 case STATEMENT_COMPOUND:
4922 case STATEMENT_SWITCH:
4923 case STATEMENT_LABEL:
4924 case STATEMENT_CASE_LABEL:
4926 next = next->base.next;
4929 case STATEMENT_WHILE: {
4931 if (next->base.reachable)
4933 next->base.reachable = true;
4935 while_statement_t const *const whiles = &next->whiles;
4936 int const val = determine_truth(whiles->condition);
4939 check_reachable(whiles->body);
4945 next = next->base.next;
4949 case STATEMENT_DO_WHILE: {
4951 if (next->base.reachable)
4953 next->base.reachable = true;
4955 do_while_statement_t const *const dw = &next->do_while;
4956 int const val = determine_truth(dw->condition);
4959 check_reachable(dw->body);
4965 next = next->base.next;
4969 case STATEMENT_FOR: {
4971 for_statement_t *const fors = &next->fors;
4973 fors->step_reachable = true;
4975 if (fors->condition_reachable)
4977 fors->condition_reachable = true;
4979 expression_t const *const cond = fors->condition;
4981 cond == NULL ? 1 : determine_truth(cond);
4984 check_reachable(fors->body);
4990 next = next->base.next;
4994 case STATEMENT_MS_TRY:
4995 panic("unimplemented");
5000 next = stmt->base.parent;
5002 warningf(&stmt->base.source_position,
5003 "control reaches end of non-void function");
5007 check_reachable(next);
5010 static void check_unreachable(statement_t const* const stmt)
5012 if (!stmt->base.reachable &&
5013 stmt->kind != STATEMENT_COMPOUND &&
5014 stmt->kind != STATEMENT_DO_WHILE &&
5015 stmt->kind != STATEMENT_FOR) {
5016 warningf(&stmt->base.source_position, "statement is unreachable");
5019 switch (stmt->kind) {
5020 case STATEMENT_INVALID:
5021 case STATEMENT_EMPTY:
5022 case STATEMENT_RETURN:
5023 case STATEMENT_DECLARATION:
5024 case STATEMENT_EXPRESSION:
5025 case STATEMENT_CONTINUE:
5026 case STATEMENT_BREAK:
5027 case STATEMENT_GOTO:
5029 case STATEMENT_LEAVE:
5032 case STATEMENT_COMPOUND:
5033 if (stmt->compound.statements)
5034 check_unreachable(stmt->compound.statements);
5038 check_unreachable(stmt->ifs.true_statement);
5039 if (stmt->ifs.false_statement != NULL)
5040 check_unreachable(stmt->ifs.false_statement);
5043 case STATEMENT_SWITCH:
5044 check_unreachable(stmt->switchs.body);
5047 case STATEMENT_LABEL:
5048 check_unreachable(stmt->label.statement);
5051 case STATEMENT_CASE_LABEL:
5052 check_unreachable(stmt->case_label.statement);
5055 case STATEMENT_WHILE:
5056 check_unreachable(stmt->whiles.body);
5059 case STATEMENT_DO_WHILE:
5060 check_unreachable(stmt->do_while.body);
5061 if (!stmt->base.reachable) {
5062 expression_t const *const cond = stmt->do_while.condition;
5063 if (determine_truth(cond) >= 0) {
5064 warningf(&cond->base.source_position,
5065 "condition of do-while-loop is unreachable");
5070 case STATEMENT_FOR: {
5071 for_statement_t const* const fors = &stmt->fors;
5073 // if init and step are unreachable, cond is unreachable, too
5074 if (!stmt->base.reachable && !fors->step_reachable) {
5075 warningf(&stmt->base.source_position, "statement is unreachable");
5077 if (!stmt->base.reachable && fors->initialisation != NULL) {
5078 warningf(&fors->initialisation->base.source_position,
5079 "initialisation of for-statement is unreachable");
5082 if (!fors->condition_reachable && fors->condition != NULL) {
5083 warningf(&fors->condition->base.source_position,
5084 "condition of for-statement is unreachable");
5087 if (!fors->step_reachable && fors->step != NULL) {
5088 warningf(&fors->step->base.source_position,
5089 "step of for-statement is unreachable");
5093 check_unreachable(stmt->fors.body);
5097 case STATEMENT_MS_TRY:
5098 panic("unimplemented");
5101 if (stmt->base.next)
5102 check_unreachable(stmt->base.next);
5105 static void parse_external_declaration(void)
5107 /* function-definitions and declarations both start with declaration
5109 declaration_specifiers_t specifiers;
5110 memset(&specifiers, 0, sizeof(specifiers));
5112 add_anchor_token(';');
5113 parse_declaration_specifiers(&specifiers);
5114 rem_anchor_token(';');
5116 /* must be a declaration */
5117 if (token.type == ';') {
5118 parse_anonymous_declaration_rest(&specifiers, append_declaration);
5122 add_anchor_token(',');
5123 add_anchor_token('=');
5124 rem_anchor_token(';');
5126 /* declarator is common to both function-definitions and declarations */
5127 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5129 rem_anchor_token(',');
5130 rem_anchor_token('=');
5131 rem_anchor_token(';');
5133 /* must be a declaration */
5134 switch (token.type) {
5137 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
5141 parse_declaration_rest(ndeclaration, &specifiers, record_definition);
5145 /* must be a function definition */
5146 parse_kr_declaration_list(ndeclaration);
5148 if (token.type != '{') {
5149 parse_error_expected("while parsing function definition", '{', NULL);
5150 eat_until_matching_token(';');
5154 type_t *type = ndeclaration->type;
5156 /* note that we don't skip typerefs: the standard doesn't allow them here
5157 * (so we can't use is_type_function here) */
5158 if (type->kind != TYPE_FUNCTION) {
5159 if (is_type_valid(type)) {
5160 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5161 type, ndeclaration->symbol);
5167 /* § 6.7.5.3 (14) a function definition with () means no
5168 * parameters (and not unspecified parameters) */
5169 if (type->function.unspecified_parameters
5170 && type->function.parameters == NULL
5171 && !type->function.kr_style_parameters) {
5172 type_t *duplicate = duplicate_type(type);
5173 duplicate->function.unspecified_parameters = false;
5175 type = typehash_insert(duplicate);
5176 if (type != duplicate) {
5177 obstack_free(type_obst, duplicate);
5179 ndeclaration->type = type;
5182 declaration_t *const declaration = record_definition(ndeclaration);
5183 if (ndeclaration != declaration) {
5184 declaration->scope = ndeclaration->scope;
5186 type = skip_typeref(declaration->type);
5188 /* push function parameters and switch scope */
5189 int top = environment_top();
5190 scope_t *last_scope = scope;
5191 set_scope(&declaration->scope);
5193 declaration_t *parameter = declaration->scope.declarations;
5194 for( ; parameter != NULL; parameter = parameter->next) {
5195 if (parameter->parent_scope == &ndeclaration->scope) {
5196 parameter->parent_scope = scope;
5198 assert(parameter->parent_scope == NULL
5199 || parameter->parent_scope == scope);
5200 parameter->parent_scope = scope;
5201 if (parameter->symbol == NULL) {
5202 errorf(&ndeclaration->source_position, "parameter name omitted");
5205 environment_push(parameter);
5208 if (declaration->init.statement != NULL) {
5209 parser_error_multiple_definition(declaration, HERE);
5212 /* parse function body */
5213 int label_stack_top = label_top();
5214 declaration_t *old_current_function = current_function;
5215 current_function = declaration;
5216 current_parent = NULL;
5218 statement_t *const body = parse_compound_statement(false);
5219 declaration->init.statement = body;
5222 check_declarations();
5223 if (warning.return_type ||
5224 warning.unreachable_code ||
5225 (warning.missing_noreturn && !(declaration->modifiers & DM_NORETURN))) {
5226 noreturn_candidate = true;
5227 check_reachable(body);
5228 if (warning.unreachable_code)
5229 check_unreachable(body);
5230 if (warning.missing_noreturn &&
5231 noreturn_candidate &&
5232 !(declaration->modifiers & DM_NORETURN)) {
5233 warningf(&body->base.source_position,
5234 "function '%#T' is candidate for attribute 'noreturn'",
5235 type, declaration->symbol);
5239 assert(current_parent == NULL);
5240 assert(current_function == declaration);
5241 current_function = old_current_function;
5242 label_pop_to(label_stack_top);
5245 assert(scope == &declaration->scope);
5246 set_scope(last_scope);
5247 environment_pop_to(top);
5250 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5251 source_position_t *source_position)
5253 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
5255 type->bitfield.base_type = base_type;
5256 type->bitfield.size = size;
5261 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
5264 declaration_t *iter = compound_declaration->scope.declarations;
5265 for( ; iter != NULL; iter = iter->next) {
5266 if (iter->namespc != NAMESPACE_NORMAL)
5269 if (iter->symbol == NULL) {
5270 type_t *type = skip_typeref(iter->type);
5271 if (is_type_compound(type)) {
5272 declaration_t *result
5273 = find_compound_entry(type->compound.declaration, symbol);
5280 if (iter->symbol == symbol) {
5288 static void parse_compound_declarators(declaration_t *struct_declaration,
5289 const declaration_specifiers_t *specifiers)
5291 declaration_t *last_declaration = struct_declaration->scope.declarations;
5292 if (last_declaration != NULL) {
5293 while(last_declaration->next != NULL) {
5294 last_declaration = last_declaration->next;
5299 declaration_t *declaration;
5301 if (token.type == ':') {
5302 source_position_t source_position = *HERE;
5305 type_t *base_type = specifiers->type;
5306 expression_t *size = parse_constant_expression();
5308 if (!is_type_integer(skip_typeref(base_type))) {
5309 errorf(HERE, "bitfield base type '%T' is not an integer type",
5313 type_t *type = make_bitfield_type(base_type, size, &source_position);
5315 declaration = allocate_declaration_zero();
5316 declaration->namespc = NAMESPACE_NORMAL;
5317 declaration->declared_storage_class = STORAGE_CLASS_NONE;
5318 declaration->storage_class = STORAGE_CLASS_NONE;
5319 declaration->source_position = source_position;
5320 declaration->modifiers = specifiers->modifiers;
5321 declaration->type = type;
5323 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
5325 type_t *orig_type = declaration->type;
5326 type_t *type = skip_typeref(orig_type);
5328 if (token.type == ':') {
5329 source_position_t source_position = *HERE;
5331 expression_t *size = parse_constant_expression();
5333 if (!is_type_integer(type)) {
5334 errorf(HERE, "bitfield base type '%T' is not an "
5335 "integer type", orig_type);
5338 type_t *bitfield_type = make_bitfield_type(orig_type, size, &source_position);
5339 declaration->type = bitfield_type;
5341 /* TODO we ignore arrays for now... what is missing is a check
5342 * that they're at the end of the struct */
5343 if (is_type_incomplete(type) && !is_type_array(type)) {
5345 "compound member '%Y' has incomplete type '%T'",
5346 declaration->symbol, orig_type);
5347 } else if (is_type_function(type)) {
5348 errorf(HERE, "compound member '%Y' must not have function "
5349 "type '%T'", declaration->symbol, orig_type);
5354 /* make sure we don't define a symbol multiple times */
5355 symbol_t *symbol = declaration->symbol;
5356 if (symbol != NULL) {
5357 declaration_t *prev_decl
5358 = find_compound_entry(struct_declaration, symbol);
5360 if (prev_decl != NULL) {
5361 assert(prev_decl->symbol == symbol);
5362 errorf(&declaration->source_position,
5363 "multiple declarations of symbol '%Y' (declared %P)",
5364 symbol, &prev_decl->source_position);
5368 /* append declaration */
5369 if (last_declaration != NULL) {
5370 last_declaration->next = declaration;
5372 struct_declaration->scope.declarations = declaration;
5374 last_declaration = declaration;
5376 if (token.type != ',')
5386 static void parse_compound_type_entries(declaration_t *compound_declaration)
5389 add_anchor_token('}');
5391 while(token.type != '}' && token.type != T_EOF) {
5392 declaration_specifiers_t specifiers;
5393 memset(&specifiers, 0, sizeof(specifiers));
5394 parse_declaration_specifiers(&specifiers);
5396 parse_compound_declarators(compound_declaration, &specifiers);
5398 rem_anchor_token('}');
5400 if (token.type == T_EOF) {
5401 errorf(HERE, "EOF while parsing struct");
5406 static type_t *parse_typename(void)
5408 declaration_specifiers_t specifiers;
5409 memset(&specifiers, 0, sizeof(specifiers));
5410 parse_declaration_specifiers(&specifiers);
5411 if (specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
5412 /* TODO: improve error message, user does probably not know what a
5413 * storage class is...
5415 errorf(HERE, "typename may not have a storage class");
5418 type_t *result = parse_abstract_declarator(specifiers.type);
5426 typedef expression_t* (*parse_expression_function) (unsigned precedence);
5427 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
5428 expression_t *left);
5430 typedef struct expression_parser_function_t expression_parser_function_t;
5431 struct expression_parser_function_t {
5432 unsigned precedence;
5433 parse_expression_function parser;
5434 unsigned infix_precedence;
5435 parse_expression_infix_function infix_parser;
5438 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5441 * Prints an error message if an expression was expected but not read
5443 static expression_t *expected_expression_error(void)
5445 /* skip the error message if the error token was read */
5446 if (token.type != T_ERROR) {
5447 errorf(HERE, "expected expression, got token '%K'", &token);
5451 return create_invalid_expression();
5455 * Parse a string constant.
5457 static expression_t *parse_string_const(void)
5460 if (token.type == T_STRING_LITERAL) {
5461 string_t res = token.v.string;
5463 while (token.type == T_STRING_LITERAL) {
5464 res = concat_strings(&res, &token.v.string);
5467 if (token.type != T_WIDE_STRING_LITERAL) {
5468 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
5469 /* note: that we use type_char_ptr here, which is already the
5470 * automatic converted type. revert_automatic_type_conversion
5471 * will construct the array type */
5472 cnst->base.type = type_char_ptr;
5473 cnst->string.value = res;
5477 wres = concat_string_wide_string(&res, &token.v.wide_string);
5479 wres = token.v.wide_string;
5484 switch (token.type) {
5485 case T_WIDE_STRING_LITERAL:
5486 wres = concat_wide_strings(&wres, &token.v.wide_string);
5489 case T_STRING_LITERAL:
5490 wres = concat_wide_string_string(&wres, &token.v.string);
5494 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5495 cnst->base.type = type_wchar_t_ptr;
5496 cnst->wide_string.value = wres;
5505 * Parse an integer constant.
5507 static expression_t *parse_int_const(void)
5509 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5510 cnst->base.source_position = *HERE;
5511 cnst->base.type = token.datatype;
5512 cnst->conste.v.int_value = token.v.intvalue;
5520 * Parse a character constant.
5522 static expression_t *parse_character_constant(void)
5524 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
5526 cnst->base.source_position = *HERE;
5527 cnst->base.type = token.datatype;
5528 cnst->conste.v.character = token.v.string;
5530 if (cnst->conste.v.character.size != 1) {
5531 if (warning.multichar && (c_mode & _GNUC)) {
5533 warningf(HERE, "multi-character character constant");
5535 errorf(HERE, "more than 1 characters in character constant");
5544 * Parse a wide character constant.
5546 static expression_t *parse_wide_character_constant(void)
5548 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
5550 cnst->base.source_position = *HERE;
5551 cnst->base.type = token.datatype;
5552 cnst->conste.v.wide_character = token.v.wide_string;
5554 if (cnst->conste.v.wide_character.size != 1) {
5555 if (warning.multichar && (c_mode & _GNUC)) {
5557 warningf(HERE, "multi-character character constant");
5559 errorf(HERE, "more than 1 characters in character constant");
5568 * Parse a float constant.
5570 static expression_t *parse_float_const(void)
5572 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5573 cnst->base.type = token.datatype;
5574 cnst->conste.v.float_value = token.v.floatvalue;
5581 static declaration_t *create_implicit_function(symbol_t *symbol,
5582 const source_position_t *source_position)
5584 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
5585 ntype->function.return_type = type_int;
5586 ntype->function.unspecified_parameters = true;
5588 type_t *type = typehash_insert(ntype);
5589 if (type != ntype) {
5593 declaration_t *const declaration = allocate_declaration_zero();
5594 declaration->storage_class = STORAGE_CLASS_EXTERN;
5595 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
5596 declaration->type = type;
5597 declaration->symbol = symbol;
5598 declaration->source_position = *source_position;
5600 bool strict_prototypes_old = warning.strict_prototypes;
5601 warning.strict_prototypes = false;
5602 record_declaration(declaration);
5603 warning.strict_prototypes = strict_prototypes_old;
5609 * Creates a return_type (func)(argument_type) function type if not
5612 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
5613 type_t *argument_type2)
5615 function_parameter_t *parameter2
5616 = obstack_alloc(type_obst, sizeof(parameter2[0]));
5617 memset(parameter2, 0, sizeof(parameter2[0]));
5618 parameter2->type = argument_type2;
5620 function_parameter_t *parameter1
5621 = obstack_alloc(type_obst, sizeof(parameter1[0]));
5622 memset(parameter1, 0, sizeof(parameter1[0]));
5623 parameter1->type = argument_type1;
5624 parameter1->next = parameter2;
5626 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5627 type->function.return_type = return_type;
5628 type->function.parameters = parameter1;
5630 type_t *result = typehash_insert(type);
5631 if (result != type) {
5639 * Creates a return_type (func)(argument_type) function type if not
5642 * @param return_type the return type
5643 * @param argument_type the argument type
5645 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
5647 function_parameter_t *parameter
5648 = obstack_alloc(type_obst, sizeof(parameter[0]));
5649 memset(parameter, 0, sizeof(parameter[0]));
5650 parameter->type = argument_type;
5652 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5653 type->function.return_type = return_type;
5654 type->function.parameters = parameter;
5656 type_t *result = typehash_insert(type);
5657 if (result != type) {
5664 static type_t *make_function_0_type(type_t *return_type)
5666 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5667 type->function.return_type = return_type;
5668 type->function.parameters = NULL;
5670 type_t *result = typehash_insert(type);
5671 if (result != type) {
5679 * Creates a function type for some function like builtins.
5681 * @param symbol the symbol describing the builtin
5683 static type_t *get_builtin_symbol_type(symbol_t *symbol)
5685 switch(symbol->ID) {
5686 case T___builtin_alloca:
5687 return make_function_1_type(type_void_ptr, type_size_t);
5688 case T___builtin_huge_val:
5689 return make_function_0_type(type_double);
5690 case T___builtin_nan:
5691 return make_function_1_type(type_double, type_char_ptr);
5692 case T___builtin_nanf:
5693 return make_function_1_type(type_float, type_char_ptr);
5694 case T___builtin_nand:
5695 return make_function_1_type(type_long_double, type_char_ptr);
5696 case T___builtin_va_end:
5697 return make_function_1_type(type_void, type_valist);
5698 case T___builtin_expect:
5699 return make_function_2_type(type_long, type_long, type_long);
5701 internal_errorf(HERE, "not implemented builtin symbol found");
5706 * Performs automatic type cast as described in § 6.3.2.1.
5708 * @param orig_type the original type
5710 static type_t *automatic_type_conversion(type_t *orig_type)
5712 type_t *type = skip_typeref(orig_type);
5713 if (is_type_array(type)) {
5714 array_type_t *array_type = &type->array;
5715 type_t *element_type = array_type->element_type;
5716 unsigned qualifiers = array_type->base.qualifiers;
5718 return make_pointer_type(element_type, qualifiers);
5721 if (is_type_function(type)) {
5722 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5729 * reverts the automatic casts of array to pointer types and function
5730 * to function-pointer types as defined § 6.3.2.1
5732 type_t *revert_automatic_type_conversion(const expression_t *expression)
5734 switch (expression->kind) {
5735 case EXPR_REFERENCE: return expression->reference.declaration->type;
5736 case EXPR_SELECT: return expression->select.compound_entry->type;
5738 case EXPR_UNARY_DEREFERENCE: {
5739 const expression_t *const value = expression->unary.value;
5740 type_t *const type = skip_typeref(value->base.type);
5741 assert(is_type_pointer(type));
5742 return type->pointer.points_to;
5745 case EXPR_BUILTIN_SYMBOL:
5746 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
5748 case EXPR_ARRAY_ACCESS: {
5749 const expression_t *array_ref = expression->array_access.array_ref;
5750 type_t *type_left = skip_typeref(array_ref->base.type);
5751 if (!is_type_valid(type_left))
5753 assert(is_type_pointer(type_left));
5754 return type_left->pointer.points_to;
5757 case EXPR_STRING_LITERAL: {
5758 size_t size = expression->string.value.size;
5759 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
5762 case EXPR_WIDE_STRING_LITERAL: {
5763 size_t size = expression->wide_string.value.size;
5764 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
5767 case EXPR_COMPOUND_LITERAL:
5768 return expression->compound_literal.type;
5773 return expression->base.type;
5776 static expression_t *parse_reference(void)
5778 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
5780 reference_expression_t *ref = &expression->reference;
5781 symbol_t *const symbol = token.v.symbol;
5783 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
5785 source_position_t source_position = token.source_position;
5788 if (declaration == NULL) {
5789 if (! strict_mode && token.type == '(') {
5790 /* an implicitly defined function */
5791 if (warning.implicit_function_declaration) {
5792 warningf(HERE, "implicit declaration of function '%Y'",
5796 declaration = create_implicit_function(symbol,
5799 errorf(HERE, "unknown symbol '%Y' found.", symbol);
5800 return create_invalid_expression();
5804 type_t *type = declaration->type;
5806 /* we always do the auto-type conversions; the & and sizeof parser contains
5807 * code to revert this! */
5808 type = automatic_type_conversion(type);
5810 ref->declaration = declaration;
5811 ref->base.type = type;
5813 /* this declaration is used */
5814 declaration->used = true;
5816 /* check for deprecated functions */
5817 if (warning.deprecated_declarations &&
5818 declaration->modifiers & DM_DEPRECATED) {
5819 char const *const prefix = is_type_function(declaration->type) ?
5820 "function" : "variable";
5822 if (declaration->deprecated_string != NULL) {
5823 warningf(&source_position,
5824 "%s '%Y' is deprecated (declared %P): \"%s\"", prefix,
5825 declaration->symbol, &declaration->source_position,
5826 declaration->deprecated_string);
5828 warningf(&source_position,
5829 "%s '%Y' is deprecated (declared %P)", prefix,
5830 declaration->symbol, &declaration->source_position);
5837 static void check_cast_allowed(expression_t *expression, type_t *dest_type)
5841 /* TODO check if explicit cast is allowed and issue warnings/errors */
5844 static expression_t *parse_compound_literal(type_t *type)
5846 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
5848 parse_initializer_env_t env;
5850 env.declaration = NULL;
5851 env.must_be_constant = false;
5852 initializer_t *initializer = parse_initializer(&env);
5855 expression->compound_literal.initializer = initializer;
5856 expression->compound_literal.type = type;
5857 expression->base.type = automatic_type_conversion(type);
5863 * Parse a cast expression.
5865 static expression_t *parse_cast(void)
5867 source_position_t source_position = token.source_position;
5869 type_t *type = parse_typename();
5871 /* matching add_anchor_token() is at call site */
5872 rem_anchor_token(')');
5875 if (token.type == '{') {
5876 return parse_compound_literal(type);
5879 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
5880 cast->base.source_position = source_position;
5882 expression_t *value = parse_sub_expression(20);
5884 check_cast_allowed(value, type);
5886 cast->base.type = type;
5887 cast->unary.value = value;
5891 return create_invalid_expression();
5895 * Parse a statement expression.
5897 static expression_t *parse_statement_expression(void)
5899 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
5901 statement_t *statement = parse_compound_statement(true);
5902 expression->statement.statement = statement;
5903 expression->base.source_position = statement->base.source_position;
5905 /* find last statement and use its type */
5906 type_t *type = type_void;
5907 const statement_t *stmt = statement->compound.statements;
5909 while (stmt->base.next != NULL)
5910 stmt = stmt->base.next;
5912 if (stmt->kind == STATEMENT_EXPRESSION) {
5913 type = stmt->expression.expression->base.type;
5916 warningf(&expression->base.source_position, "empty statement expression ({})");
5918 expression->base.type = type;
5924 return create_invalid_expression();
5928 * Parse a braced expression.
5930 static expression_t *parse_brace_expression(void)
5933 add_anchor_token(')');
5935 switch(token.type) {
5937 /* gcc extension: a statement expression */
5938 return parse_statement_expression();
5942 return parse_cast();
5944 if (is_typedef_symbol(token.v.symbol)) {
5945 return parse_cast();
5949 expression_t *result = parse_expression();
5950 rem_anchor_token(')');
5955 return create_invalid_expression();
5958 static expression_t *parse_function_keyword(void)
5963 if (current_function == NULL) {
5964 errorf(HERE, "'__func__' used outside of a function");
5967 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5968 expression->base.type = type_char_ptr;
5969 expression->funcname.kind = FUNCNAME_FUNCTION;
5974 static expression_t *parse_pretty_function_keyword(void)
5976 eat(T___PRETTY_FUNCTION__);
5978 if (current_function == NULL) {
5979 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
5982 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5983 expression->base.type = type_char_ptr;
5984 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
5989 static expression_t *parse_funcsig_keyword(void)
5993 if (current_function == NULL) {
5994 errorf(HERE, "'__FUNCSIG__' used outside of a function");
5997 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5998 expression->base.type = type_char_ptr;
5999 expression->funcname.kind = FUNCNAME_FUNCSIG;
6004 static expression_t *parse_funcdname_keyword(void)
6006 eat(T___FUNCDNAME__);
6008 if (current_function == NULL) {
6009 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6012 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6013 expression->base.type = type_char_ptr;
6014 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6019 static designator_t *parse_designator(void)
6021 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6022 result->source_position = *HERE;
6024 if (token.type != T_IDENTIFIER) {
6025 parse_error_expected("while parsing member designator",
6026 T_IDENTIFIER, NULL);
6029 result->symbol = token.v.symbol;
6032 designator_t *last_designator = result;
6034 if (token.type == '.') {
6036 if (token.type != T_IDENTIFIER) {
6037 parse_error_expected("while parsing member designator",
6038 T_IDENTIFIER, NULL);
6041 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6042 designator->source_position = *HERE;
6043 designator->symbol = token.v.symbol;
6046 last_designator->next = designator;
6047 last_designator = designator;
6050 if (token.type == '[') {
6052 add_anchor_token(']');
6053 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6054 designator->source_position = *HERE;
6055 designator->array_index = parse_expression();
6056 rem_anchor_token(']');
6058 if (designator->array_index == NULL) {
6062 last_designator->next = designator;
6063 last_designator = designator;
6075 * Parse the __builtin_offsetof() expression.
6077 static expression_t *parse_offsetof(void)
6079 eat(T___builtin_offsetof);
6081 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6082 expression->base.type = type_size_t;
6085 add_anchor_token(',');
6086 type_t *type = parse_typename();
6087 rem_anchor_token(',');
6089 add_anchor_token(')');
6090 designator_t *designator = parse_designator();
6091 rem_anchor_token(')');
6094 expression->offsetofe.type = type;
6095 expression->offsetofe.designator = designator;
6098 memset(&path, 0, sizeof(path));
6099 path.top_type = type;
6100 path.path = NEW_ARR_F(type_path_entry_t, 0);
6102 descend_into_subtype(&path);
6104 if (!walk_designator(&path, designator, true)) {
6105 return create_invalid_expression();
6108 DEL_ARR_F(path.path);
6112 return create_invalid_expression();
6116 * Parses a _builtin_va_start() expression.
6118 static expression_t *parse_va_start(void)
6120 eat(T___builtin_va_start);
6122 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6125 add_anchor_token(',');
6126 expression->va_starte.ap = parse_assignment_expression();
6127 rem_anchor_token(',');
6129 expression_t *const expr = parse_assignment_expression();
6130 if (expr->kind == EXPR_REFERENCE) {
6131 declaration_t *const decl = expr->reference.declaration;
6133 return create_invalid_expression();
6134 if (decl->parent_scope == ¤t_function->scope &&
6135 decl->next == NULL) {
6136 expression->va_starte.parameter = decl;
6141 errorf(&expr->base.source_position,
6142 "second argument of 'va_start' must be last parameter of the current function");
6144 return create_invalid_expression();
6148 * Parses a _builtin_va_arg() expression.
6150 static expression_t *parse_va_arg(void)
6152 eat(T___builtin_va_arg);
6154 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6157 expression->va_arge.ap = parse_assignment_expression();
6159 expression->base.type = parse_typename();
6164 return create_invalid_expression();
6167 static expression_t *parse_builtin_symbol(void)
6169 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
6171 symbol_t *symbol = token.v.symbol;
6173 expression->builtin_symbol.symbol = symbol;
6176 type_t *type = get_builtin_symbol_type(symbol);
6177 type = automatic_type_conversion(type);
6179 expression->base.type = type;
6184 * Parses a __builtin_constant() expression.
6186 static expression_t *parse_builtin_constant(void)
6188 eat(T___builtin_constant_p);
6190 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6193 add_anchor_token(')');
6194 expression->builtin_constant.value = parse_assignment_expression();
6195 rem_anchor_token(')');
6197 expression->base.type = type_int;
6201 return create_invalid_expression();
6205 * Parses a __builtin_prefetch() expression.
6207 static expression_t *parse_builtin_prefetch(void)
6209 eat(T___builtin_prefetch);
6211 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
6214 add_anchor_token(')');
6215 expression->builtin_prefetch.adr = parse_assignment_expression();
6216 if (token.type == ',') {
6218 expression->builtin_prefetch.rw = parse_assignment_expression();
6220 if (token.type == ',') {
6222 expression->builtin_prefetch.locality = parse_assignment_expression();
6224 rem_anchor_token(')');
6226 expression->base.type = type_void;
6230 return create_invalid_expression();
6234 * Parses a __builtin_is_*() compare expression.
6236 static expression_t *parse_compare_builtin(void)
6238 expression_t *expression;
6240 switch(token.type) {
6241 case T___builtin_isgreater:
6242 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6244 case T___builtin_isgreaterequal:
6245 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6247 case T___builtin_isless:
6248 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6250 case T___builtin_islessequal:
6251 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6253 case T___builtin_islessgreater:
6254 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6256 case T___builtin_isunordered:
6257 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6260 internal_errorf(HERE, "invalid compare builtin found");
6263 expression->base.source_position = *HERE;
6267 expression->binary.left = parse_assignment_expression();
6269 expression->binary.right = parse_assignment_expression();
6272 type_t *const orig_type_left = expression->binary.left->base.type;
6273 type_t *const orig_type_right = expression->binary.right->base.type;
6275 type_t *const type_left = skip_typeref(orig_type_left);
6276 type_t *const type_right = skip_typeref(orig_type_right);
6277 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6278 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6279 type_error_incompatible("invalid operands in comparison",
6280 &expression->base.source_position, orig_type_left, orig_type_right);
6283 semantic_comparison(&expression->binary);
6288 return create_invalid_expression();
6293 * Parses a __builtin_expect() expression.
6295 static expression_t *parse_builtin_expect(void)
6297 eat(T___builtin_expect);
6299 expression_t *expression
6300 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
6303 expression->binary.left = parse_assignment_expression();
6305 expression->binary.right = parse_constant_expression();
6308 expression->base.type = expression->binary.left->base.type;
6312 return create_invalid_expression();
6317 * Parses a MS assume() expression.
6319 static expression_t *parse_assume(void)
6323 expression_t *expression
6324 = allocate_expression_zero(EXPR_UNARY_ASSUME);
6327 add_anchor_token(')');
6328 expression->unary.value = parse_assignment_expression();
6329 rem_anchor_token(')');
6332 expression->base.type = type_void;
6335 return create_invalid_expression();
6339 * Parse a microsoft __noop expression.
6341 static expression_t *parse_noop_expression(void)
6343 source_position_t source_position = *HERE;
6346 if (token.type == '(') {
6347 /* parse arguments */
6349 add_anchor_token(')');
6350 add_anchor_token(',');
6352 if (token.type != ')') {
6354 (void)parse_assignment_expression();
6355 if (token.type != ',')
6361 rem_anchor_token(',');
6362 rem_anchor_token(')');
6365 /* the result is a (int)0 */
6366 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6367 cnst->base.source_position = source_position;
6368 cnst->base.type = type_int;
6369 cnst->conste.v.int_value = 0;
6370 cnst->conste.is_ms_noop = true;
6375 return create_invalid_expression();
6379 * Parses a primary expression.
6381 static expression_t *parse_primary_expression(void)
6383 switch (token.type) {
6384 case T_INTEGER: return parse_int_const();
6385 case T_CHARACTER_CONSTANT: return parse_character_constant();
6386 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6387 case T_FLOATINGPOINT: return parse_float_const();
6388 case T_STRING_LITERAL:
6389 case T_WIDE_STRING_LITERAL: return parse_string_const();
6390 case T_IDENTIFIER: return parse_reference();
6391 case T___FUNCTION__:
6392 case T___func__: return parse_function_keyword();
6393 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6394 case T___FUNCSIG__: return parse_funcsig_keyword();
6395 case T___FUNCDNAME__: return parse_funcdname_keyword();
6396 case T___builtin_offsetof: return parse_offsetof();
6397 case T___builtin_va_start: return parse_va_start();
6398 case T___builtin_va_arg: return parse_va_arg();
6399 case T___builtin_expect:
6400 case T___builtin_alloca:
6401 case T___builtin_nan:
6402 case T___builtin_nand:
6403 case T___builtin_nanf:
6404 case T___builtin_huge_val:
6405 case T___builtin_va_end: return parse_builtin_symbol();
6406 case T___builtin_isgreater:
6407 case T___builtin_isgreaterequal:
6408 case T___builtin_isless:
6409 case T___builtin_islessequal:
6410 case T___builtin_islessgreater:
6411 case T___builtin_isunordered: return parse_compare_builtin();
6412 case T___builtin_constant_p: return parse_builtin_constant();
6413 case T___builtin_prefetch: return parse_builtin_prefetch();
6414 case T__assume: return parse_assume();
6416 case '(': return parse_brace_expression();
6417 case T___noop: return parse_noop_expression();
6420 errorf(HERE, "unexpected token %K, expected an expression", &token);
6421 return create_invalid_expression();
6425 * Check if the expression has the character type and issue a warning then.
6427 static void check_for_char_index_type(const expression_t *expression)
6429 type_t *const type = expression->base.type;
6430 const type_t *const base_type = skip_typeref(type);
6432 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
6433 warning.char_subscripts) {
6434 warningf(&expression->base.source_position,
6435 "array subscript has type '%T'", type);
6439 static expression_t *parse_array_expression(unsigned precedence,
6445 add_anchor_token(']');
6447 expression_t *inside = parse_expression();
6449 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6451 array_access_expression_t *array_access = &expression->array_access;
6453 type_t *const orig_type_left = left->base.type;
6454 type_t *const orig_type_inside = inside->base.type;
6456 type_t *const type_left = skip_typeref(orig_type_left);
6457 type_t *const type_inside = skip_typeref(orig_type_inside);
6459 type_t *return_type;
6460 if (is_type_pointer(type_left)) {
6461 return_type = type_left->pointer.points_to;
6462 array_access->array_ref = left;
6463 array_access->index = inside;
6464 check_for_char_index_type(inside);
6465 } else if (is_type_pointer(type_inside)) {
6466 return_type = type_inside->pointer.points_to;
6467 array_access->array_ref = inside;
6468 array_access->index = left;
6469 array_access->flipped = true;
6470 check_for_char_index_type(left);
6472 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6474 "array access on object with non-pointer types '%T', '%T'",
6475 orig_type_left, orig_type_inside);
6477 return_type = type_error_type;
6478 array_access->array_ref = create_invalid_expression();
6481 rem_anchor_token(']');
6482 if (token.type != ']') {
6483 parse_error_expected("Problem while parsing array access", ']', NULL);
6488 return_type = automatic_type_conversion(return_type);
6489 expression->base.type = return_type;
6494 static expression_t *parse_typeprop(expression_kind_t const kind,
6495 source_position_t const pos,
6496 unsigned const precedence)
6498 expression_t *tp_expression = allocate_expression_zero(kind);
6499 tp_expression->base.type = type_size_t;
6500 tp_expression->base.source_position = pos;
6502 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6504 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
6506 add_anchor_token(')');
6507 type_t* const orig_type = parse_typename();
6508 tp_expression->typeprop.type = orig_type;
6510 type_t const* const type = skip_typeref(orig_type);
6511 char const* const wrong_type =
6512 is_type_incomplete(type) ? "incomplete" :
6513 type->kind == TYPE_FUNCTION ? "function designator" :
6514 type->kind == TYPE_BITFIELD ? "bitfield" :
6516 if (wrong_type != NULL) {
6517 errorf(&pos, "operand of %s expression must not be %s type '%T'",
6518 what, wrong_type, type);
6521 rem_anchor_token(')');
6524 expression_t *expression = parse_sub_expression(precedence);
6526 type_t* const orig_type = revert_automatic_type_conversion(expression);
6527 expression->base.type = orig_type;
6529 type_t const* const type = skip_typeref(orig_type);
6530 char const* const wrong_type =
6531 is_type_incomplete(type) ? "incomplete" :
6532 type->kind == TYPE_FUNCTION ? "function designator" :
6533 type->kind == TYPE_BITFIELD ? "bitfield" :
6535 if (wrong_type != NULL) {
6536 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
6539 tp_expression->typeprop.type = expression->base.type;
6540 tp_expression->typeprop.tp_expression = expression;
6543 return tp_expression;
6545 return create_invalid_expression();
6548 static expression_t *parse_sizeof(unsigned precedence)
6550 source_position_t pos = *HERE;
6552 return parse_typeprop(EXPR_SIZEOF, pos, precedence);
6555 static expression_t *parse_alignof(unsigned precedence)
6557 source_position_t pos = *HERE;
6559 return parse_typeprop(EXPR_ALIGNOF, pos, precedence);
6562 static expression_t *parse_select_expression(unsigned precedence,
6563 expression_t *compound)
6566 assert(token.type == '.' || token.type == T_MINUSGREATER);
6568 bool is_pointer = (token.type == T_MINUSGREATER);
6571 expression_t *select = allocate_expression_zero(EXPR_SELECT);
6572 select->select.compound = compound;
6574 if (token.type != T_IDENTIFIER) {
6575 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
6578 symbol_t *symbol = token.v.symbol;
6579 select->select.symbol = symbol;
6582 type_t *const orig_type = compound->base.type;
6583 type_t *const type = skip_typeref(orig_type);
6585 type_t *type_left = type;
6587 if (!is_type_pointer(type)) {
6588 if (is_type_valid(type)) {
6589 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6591 return create_invalid_expression();
6593 type_left = type->pointer.points_to;
6595 type_left = skip_typeref(type_left);
6597 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
6598 type_left->kind != TYPE_COMPOUND_UNION) {
6599 if (is_type_valid(type_left)) {
6600 errorf(HERE, "request for member '%Y' in something not a struct or "
6601 "union, but '%T'", symbol, type_left);
6603 return create_invalid_expression();
6606 declaration_t *const declaration = type_left->compound.declaration;
6608 if (!declaration->init.complete) {
6609 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
6611 return create_invalid_expression();
6614 declaration_t *iter = find_compound_entry(declaration, symbol);
6616 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
6617 return create_invalid_expression();
6620 /* we always do the auto-type conversions; the & and sizeof parser contains
6621 * code to revert this! */
6622 type_t *expression_type = automatic_type_conversion(iter->type);
6624 select->select.compound_entry = iter;
6625 select->base.type = expression_type;
6627 type_t *skipped = skip_typeref(iter->type);
6628 if (skipped->kind == TYPE_BITFIELD) {
6629 select->base.type = skipped->bitfield.base_type;
6635 static void check_call_argument(const function_parameter_t *parameter,
6636 call_argument_t *argument)
6638 type_t *expected_type = parameter->type;
6639 type_t *expected_type_skip = skip_typeref(expected_type);
6640 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6641 expression_t *arg_expr = argument->expression;
6643 /* handle transparent union gnu extension */
6644 if (is_type_union(expected_type_skip)
6645 && (expected_type_skip->base.modifiers
6646 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
6647 declaration_t *union_decl = expected_type_skip->compound.declaration;
6649 declaration_t *declaration = union_decl->scope.declarations;
6650 type_t *best_type = NULL;
6651 for ( ; declaration != NULL; declaration = declaration->next) {
6652 type_t *decl_type = declaration->type;
6653 error = semantic_assign(decl_type, arg_expr);
6654 if (error == ASSIGN_ERROR_INCOMPATIBLE
6655 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6658 if (error == ASSIGN_SUCCESS) {
6659 best_type = decl_type;
6660 } else if (best_type == NULL) {
6661 best_type = decl_type;
6665 if (best_type != NULL) {
6666 expected_type = best_type;
6670 error = semantic_assign(expected_type, arg_expr);
6671 argument->expression = create_implicit_cast(argument->expression,
6674 /* TODO report exact scope in error messages (like "in 3rd parameter") */
6675 report_assign_error(error, expected_type, arg_expr, "function call",
6676 &arg_expr->base.source_position);
6680 * Parse a call expression, ie. expression '( ... )'.
6682 * @param expression the function address
6684 static expression_t *parse_call_expression(unsigned precedence,
6685 expression_t *expression)
6688 expression_t *result = allocate_expression_zero(EXPR_CALL);
6689 result->base.source_position = expression->base.source_position;
6691 call_expression_t *call = &result->call;
6692 call->function = expression;
6694 type_t *const orig_type = expression->base.type;
6695 type_t *const type = skip_typeref(orig_type);
6697 function_type_t *function_type = NULL;
6698 if (is_type_pointer(type)) {
6699 type_t *const to_type = skip_typeref(type->pointer.points_to);
6701 if (is_type_function(to_type)) {
6702 function_type = &to_type->function;
6703 call->base.type = function_type->return_type;
6707 if (function_type == NULL && is_type_valid(type)) {
6708 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
6711 /* parse arguments */
6713 add_anchor_token(')');
6714 add_anchor_token(',');
6716 if (token.type != ')') {
6717 call_argument_t *last_argument = NULL;
6720 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
6722 argument->expression = parse_assignment_expression();
6723 if (last_argument == NULL) {
6724 call->arguments = argument;
6726 last_argument->next = argument;
6728 last_argument = argument;
6730 if (token.type != ',')
6735 rem_anchor_token(',');
6736 rem_anchor_token(')');
6739 if (function_type == NULL)
6742 function_parameter_t *parameter = function_type->parameters;
6743 call_argument_t *argument = call->arguments;
6744 if (!function_type->unspecified_parameters) {
6745 for( ; parameter != NULL && argument != NULL;
6746 parameter = parameter->next, argument = argument->next) {
6747 check_call_argument(parameter, argument);
6750 if (parameter != NULL) {
6751 errorf(HERE, "too few arguments to function '%E'", expression);
6752 } else if (argument != NULL && !function_type->variadic) {
6753 errorf(HERE, "too many arguments to function '%E'", expression);
6757 /* do default promotion */
6758 for( ; argument != NULL; argument = argument->next) {
6759 type_t *type = argument->expression->base.type;
6761 type = get_default_promoted_type(type);
6763 argument->expression
6764 = create_implicit_cast(argument->expression, type);
6767 check_format(&result->call);
6771 return create_invalid_expression();
6774 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
6776 static bool same_compound_type(const type_t *type1, const type_t *type2)
6779 is_type_compound(type1) &&
6780 type1->kind == type2->kind &&
6781 type1->compound.declaration == type2->compound.declaration;
6785 * Parse a conditional expression, ie. 'expression ? ... : ...'.
6787 * @param expression the conditional expression
6789 static expression_t *parse_conditional_expression(unsigned precedence,
6790 expression_t *expression)
6793 add_anchor_token(':');
6795 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
6797 conditional_expression_t *conditional = &result->conditional;
6798 conditional->condition = expression;
6801 type_t *const condition_type_orig = expression->base.type;
6802 type_t *const condition_type = skip_typeref(condition_type_orig);
6803 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
6804 type_error("expected a scalar type in conditional condition",
6805 &expression->base.source_position, condition_type_orig);
6808 expression_t *true_expression = parse_expression();
6809 rem_anchor_token(':');
6811 expression_t *false_expression = parse_sub_expression(precedence);
6813 type_t *const orig_true_type = true_expression->base.type;
6814 type_t *const orig_false_type = false_expression->base.type;
6815 type_t *const true_type = skip_typeref(orig_true_type);
6816 type_t *const false_type = skip_typeref(orig_false_type);
6819 type_t *result_type;
6820 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
6821 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
6822 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID)
6823 || !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
6824 warningf(&expression->base.source_position,
6825 "ISO C forbids conditional expression with only one void side");
6827 result_type = type_void;
6828 } else if (is_type_arithmetic(true_type)
6829 && is_type_arithmetic(false_type)) {
6830 result_type = semantic_arithmetic(true_type, false_type);
6832 true_expression = create_implicit_cast(true_expression, result_type);
6833 false_expression = create_implicit_cast(false_expression, result_type);
6835 conditional->true_expression = true_expression;
6836 conditional->false_expression = false_expression;
6837 conditional->base.type = result_type;
6838 } else if (same_compound_type(true_type, false_type)) {
6839 /* just take 1 of the 2 types */
6840 result_type = true_type;
6841 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
6842 type_t *pointer_type;
6844 expression_t *other_expression;
6845 if (is_type_pointer(true_type) &&
6846 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
6847 pointer_type = true_type;
6848 other_type = false_type;
6849 other_expression = false_expression;
6851 pointer_type = false_type;
6852 other_type = true_type;
6853 other_expression = true_expression;
6856 if (is_null_pointer_constant(other_expression)) {
6857 result_type = pointer_type;
6858 } else if (is_type_pointer(other_type)) {
6859 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
6860 type_t *to2 = skip_typeref(other_type->pointer.points_to);
6863 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
6864 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
6866 } else if (types_compatible(get_unqualified_type(to1),
6867 get_unqualified_type(to2))) {
6870 warningf(&expression->base.source_position,
6871 "pointer types '%T' and '%T' in conditional expression are incompatible",
6872 true_type, false_type);
6876 type_t *const copy = duplicate_type(to);
6877 copy->base.qualifiers = to1->base.qualifiers | to2->base.qualifiers;
6879 type_t *const type = typehash_insert(copy);
6883 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
6884 } else if (is_type_integer(other_type)) {
6885 warningf(&expression->base.source_position,
6886 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
6887 result_type = pointer_type;
6889 type_error_incompatible("while parsing conditional",
6890 &expression->base.source_position, true_type, false_type);
6891 result_type = type_error_type;
6894 /* TODO: one pointer to void*, other some pointer */
6896 if (is_type_valid(true_type) && is_type_valid(false_type)) {
6897 type_error_incompatible("while parsing conditional",
6898 &expression->base.source_position, true_type,
6901 result_type = type_error_type;
6904 conditional->true_expression
6905 = create_implicit_cast(true_expression, result_type);
6906 conditional->false_expression
6907 = create_implicit_cast(false_expression, result_type);
6908 conditional->base.type = result_type;
6911 return create_invalid_expression();
6915 * Parse an extension expression.
6917 static expression_t *parse_extension(unsigned precedence)
6919 eat(T___extension__);
6921 /* TODO enable extensions */
6922 expression_t *expression = parse_sub_expression(precedence);
6923 /* TODO disable extensions */
6928 * Parse a __builtin_classify_type() expression.
6930 static expression_t *parse_builtin_classify_type(const unsigned precedence)
6932 eat(T___builtin_classify_type);
6934 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
6935 result->base.type = type_int;
6938 add_anchor_token(')');
6939 expression_t *expression = parse_sub_expression(precedence);
6940 rem_anchor_token(')');
6942 result->classify_type.type_expression = expression;
6946 return create_invalid_expression();
6949 static bool check_pointer_arithmetic(const source_position_t *source_position,
6950 type_t *pointer_type,
6951 type_t *orig_pointer_type)
6953 type_t *points_to = pointer_type->pointer.points_to;
6954 points_to = skip_typeref(points_to);
6956 if (is_type_incomplete(points_to) &&
6958 || !is_type_atomic(points_to, ATOMIC_TYPE_VOID))) {
6959 errorf(source_position,
6960 "arithmetic with pointer to incomplete type '%T' not allowed",
6963 } else if (is_type_function(points_to)) {
6964 errorf(source_position,
6965 "arithmetic with pointer to function type '%T' not allowed",
6972 static void semantic_incdec(unary_expression_t *expression)
6974 type_t *const orig_type = expression->value->base.type;
6975 type_t *const type = skip_typeref(orig_type);
6976 if (is_type_pointer(type)) {
6977 if (!check_pointer_arithmetic(&expression->base.source_position,
6981 } else if (!is_type_real(type) && is_type_valid(type)) {
6982 /* TODO: improve error message */
6983 errorf(&expression->base.source_position,
6984 "operation needs an arithmetic or pointer type");
6987 expression->base.type = orig_type;
6990 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
6992 type_t *const orig_type = expression->value->base.type;
6993 type_t *const type = skip_typeref(orig_type);
6994 if (!is_type_arithmetic(type)) {
6995 if (is_type_valid(type)) {
6996 /* TODO: improve error message */
6997 errorf(&expression->base.source_position,
6998 "operation needs an arithmetic type");
7003 expression->base.type = orig_type;
7006 static void semantic_not(unary_expression_t *expression)
7008 type_t *const orig_type = expression->value->base.type;
7009 type_t *const type = skip_typeref(orig_type);
7010 if (!is_type_scalar(type) && is_type_valid(type)) {
7011 errorf(&expression->base.source_position,
7012 "operand of ! must be of scalar type");
7015 expression->base.type = type_int;
7018 static void semantic_unexpr_integer(unary_expression_t *expression)
7020 type_t *const orig_type = expression->value->base.type;
7021 type_t *const type = skip_typeref(orig_type);
7022 if (!is_type_integer(type)) {
7023 if (is_type_valid(type)) {
7024 errorf(&expression->base.source_position,
7025 "operand of ~ must be of integer type");
7030 expression->base.type = orig_type;
7033 static void semantic_dereference(unary_expression_t *expression)
7035 type_t *const orig_type = expression->value->base.type;
7036 type_t *const type = skip_typeref(orig_type);
7037 if (!is_type_pointer(type)) {
7038 if (is_type_valid(type)) {
7039 errorf(&expression->base.source_position,
7040 "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
7045 type_t *result_type = type->pointer.points_to;
7046 result_type = automatic_type_conversion(result_type);
7047 expression->base.type = result_type;
7050 static void set_address_taken(expression_t *expression, bool may_be_register)
7052 if (expression->kind != EXPR_REFERENCE)
7055 declaration_t *const declaration = expression->reference.declaration;
7056 /* happens for parse errors */
7057 if (declaration == NULL)
7060 if (declaration->storage_class == STORAGE_CLASS_REGISTER && !may_be_register) {
7061 errorf(&expression->base.source_position,
7062 "address of register variable '%Y' requested",
7063 declaration->symbol);
7065 declaration->address_taken = 1;
7070 * Check the semantic of the address taken expression.
7072 static void semantic_take_addr(unary_expression_t *expression)
7074 expression_t *value = expression->value;
7075 value->base.type = revert_automatic_type_conversion(value);
7077 type_t *orig_type = value->base.type;
7078 if (!is_type_valid(orig_type))
7081 set_address_taken(value, false);
7083 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7086 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
7087 static expression_t *parse_##unexpression_type(unsigned precedence) \
7091 expression_t *unary_expression \
7092 = allocate_expression_zero(unexpression_type); \
7093 unary_expression->base.source_position = *HERE; \
7094 unary_expression->unary.value = parse_sub_expression(precedence); \
7096 sfunc(&unary_expression->unary); \
7098 return unary_expression; \
7101 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7102 semantic_unexpr_arithmetic)
7103 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7104 semantic_unexpr_arithmetic)
7105 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7107 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7108 semantic_dereference)
7109 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7111 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7112 semantic_unexpr_integer)
7113 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7115 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7118 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
7120 static expression_t *parse_##unexpression_type(unsigned precedence, \
7121 expression_t *left) \
7123 (void) precedence; \
7126 expression_t *unary_expression \
7127 = allocate_expression_zero(unexpression_type); \
7128 unary_expression->base.source_position = *HERE; \
7129 unary_expression->unary.value = left; \
7131 sfunc(&unary_expression->unary); \
7133 return unary_expression; \
7136 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7137 EXPR_UNARY_POSTFIX_INCREMENT,
7139 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7140 EXPR_UNARY_POSTFIX_DECREMENT,
7143 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7145 /* TODO: handle complex + imaginary types */
7147 /* § 6.3.1.8 Usual arithmetic conversions */
7148 if (type_left == type_long_double || type_right == type_long_double) {
7149 return type_long_double;
7150 } else if (type_left == type_double || type_right == type_double) {
7152 } else if (type_left == type_float || type_right == type_float) {
7156 type_left = promote_integer(type_left);
7157 type_right = promote_integer(type_right);
7159 if (type_left == type_right)
7162 bool const signed_left = is_type_signed(type_left);
7163 bool const signed_right = is_type_signed(type_right);
7164 int const rank_left = get_rank(type_left);
7165 int const rank_right = get_rank(type_right);
7167 if (signed_left == signed_right)
7168 return rank_left >= rank_right ? type_left : type_right;
7177 u_rank = rank_right;
7178 u_type = type_right;
7180 s_rank = rank_right;
7181 s_type = type_right;
7186 if (u_rank >= s_rank)
7189 if (get_atomic_type_size(s_rank) > get_atomic_type_size(u_rank))
7193 case ATOMIC_TYPE_INT: return type_int;
7194 case ATOMIC_TYPE_LONG: return type_long;
7195 case ATOMIC_TYPE_LONGLONG: return type_long_long;
7197 default: panic("invalid atomic type");
7202 * Check the semantic restrictions for a binary expression.
7204 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7206 expression_t *const left = expression->left;
7207 expression_t *const right = expression->right;
7208 type_t *const orig_type_left = left->base.type;
7209 type_t *const orig_type_right = right->base.type;
7210 type_t *const type_left = skip_typeref(orig_type_left);
7211 type_t *const type_right = skip_typeref(orig_type_right);
7213 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7214 /* TODO: improve error message */
7215 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7216 errorf(&expression->base.source_position,
7217 "operation needs arithmetic types");
7222 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7223 expression->left = create_implicit_cast(left, arithmetic_type);
7224 expression->right = create_implicit_cast(right, arithmetic_type);
7225 expression->base.type = arithmetic_type;
7228 static void semantic_shift_op(binary_expression_t *expression)
7230 expression_t *const left = expression->left;
7231 expression_t *const right = expression->right;
7232 type_t *const orig_type_left = left->base.type;
7233 type_t *const orig_type_right = right->base.type;
7234 type_t * type_left = skip_typeref(orig_type_left);
7235 type_t * type_right = skip_typeref(orig_type_right);
7237 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7238 /* TODO: improve error message */
7239 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7240 errorf(&expression->base.source_position,
7241 "operands of shift operation must have integer types");
7246 type_left = promote_integer(type_left);
7247 type_right = promote_integer(type_right);
7249 expression->left = create_implicit_cast(left, type_left);
7250 expression->right = create_implicit_cast(right, type_right);
7251 expression->base.type = type_left;
7254 static void semantic_add(binary_expression_t *expression)
7256 expression_t *const left = expression->left;
7257 expression_t *const right = expression->right;
7258 type_t *const orig_type_left = left->base.type;
7259 type_t *const orig_type_right = right->base.type;
7260 type_t *const type_left = skip_typeref(orig_type_left);
7261 type_t *const type_right = skip_typeref(orig_type_right);
7264 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7265 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7266 expression->left = create_implicit_cast(left, arithmetic_type);
7267 expression->right = create_implicit_cast(right, arithmetic_type);
7268 expression->base.type = arithmetic_type;
7270 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7271 check_pointer_arithmetic(&expression->base.source_position,
7272 type_left, orig_type_left);
7273 expression->base.type = type_left;
7274 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7275 check_pointer_arithmetic(&expression->base.source_position,
7276 type_right, orig_type_right);
7277 expression->base.type = type_right;
7278 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7279 errorf(&expression->base.source_position,
7280 "invalid operands to binary + ('%T', '%T')",
7281 orig_type_left, orig_type_right);
7285 static void semantic_sub(binary_expression_t *expression)
7287 expression_t *const left = expression->left;
7288 expression_t *const right = expression->right;
7289 type_t *const orig_type_left = left->base.type;
7290 type_t *const orig_type_right = right->base.type;
7291 type_t *const type_left = skip_typeref(orig_type_left);
7292 type_t *const type_right = skip_typeref(orig_type_right);
7293 source_position_t const *const pos = &expression->base.source_position;
7296 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7297 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7298 expression->left = create_implicit_cast(left, arithmetic_type);
7299 expression->right = create_implicit_cast(right, arithmetic_type);
7300 expression->base.type = arithmetic_type;
7302 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7303 check_pointer_arithmetic(&expression->base.source_position,
7304 type_left, orig_type_left);
7305 expression->base.type = type_left;
7306 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7307 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7308 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7309 if (!types_compatible(unqual_left, unqual_right)) {
7311 "subtracting pointers to incompatible types '%T' and '%T'",
7312 orig_type_left, orig_type_right);
7313 } else if (!is_type_object(unqual_left)) {
7314 if (is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
7315 warningf(pos, "subtracting pointers to void");
7317 errorf(pos, "subtracting pointers to non-object types '%T'",
7321 expression->base.type = type_ptrdiff_t;
7322 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7323 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7324 orig_type_left, orig_type_right);
7329 * Check the semantics of comparison expressions.
7331 * @param expression The expression to check.
7333 static void semantic_comparison(binary_expression_t *expression)
7335 expression_t *left = expression->left;
7336 expression_t *right = expression->right;
7337 type_t *orig_type_left = left->base.type;
7338 type_t *orig_type_right = right->base.type;
7340 type_t *type_left = skip_typeref(orig_type_left);
7341 type_t *type_right = skip_typeref(orig_type_right);
7343 /* TODO non-arithmetic types */
7344 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7345 /* test for signed vs unsigned compares */
7346 if (warning.sign_compare &&
7347 (expression->base.kind != EXPR_BINARY_EQUAL &&
7348 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
7349 (is_type_signed(type_left) != is_type_signed(type_right))) {
7351 /* check if 1 of the operands is a constant, in this case we just
7352 * check wether we can safely represent the resulting constant in
7353 * the type of the other operand. */
7354 expression_t *const_expr = NULL;
7355 expression_t *other_expr = NULL;
7357 if (is_constant_expression(left)) {
7360 } else if (is_constant_expression(right)) {
7365 if (const_expr != NULL) {
7366 type_t *other_type = skip_typeref(other_expr->base.type);
7367 long val = fold_constant(const_expr);
7368 /* TODO: check if val can be represented by other_type */
7372 warningf(&expression->base.source_position,
7373 "comparison between signed and unsigned");
7375 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7376 expression->left = create_implicit_cast(left, arithmetic_type);
7377 expression->right = create_implicit_cast(right, arithmetic_type);
7378 expression->base.type = arithmetic_type;
7379 if (warning.float_equal &&
7380 (expression->base.kind == EXPR_BINARY_EQUAL ||
7381 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
7382 is_type_float(arithmetic_type)) {
7383 warningf(&expression->base.source_position,
7384 "comparing floating point with == or != is unsafe");
7386 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7387 /* TODO check compatibility */
7388 } else if (is_type_pointer(type_left)) {
7389 expression->right = create_implicit_cast(right, type_left);
7390 } else if (is_type_pointer(type_right)) {
7391 expression->left = create_implicit_cast(left, type_right);
7392 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7393 type_error_incompatible("invalid operands in comparison",
7394 &expression->base.source_position,
7395 type_left, type_right);
7397 expression->base.type = type_int;
7401 * Checks if a compound type has constant fields.
7403 static bool has_const_fields(const compound_type_t *type)
7405 const scope_t *scope = &type->declaration->scope;
7406 const declaration_t *declaration = scope->declarations;
7408 for (; declaration != NULL; declaration = declaration->next) {
7409 if (declaration->namespc != NAMESPACE_NORMAL)
7412 const type_t *decl_type = skip_typeref(declaration->type);
7413 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
7420 static bool is_lvalue(const expression_t *expression)
7422 switch (expression->kind) {
7423 case EXPR_REFERENCE:
7424 case EXPR_ARRAY_ACCESS:
7426 case EXPR_UNARY_DEREFERENCE:
7434 static bool is_valid_assignment_lhs(expression_t const* const left)
7436 type_t *const orig_type_left = revert_automatic_type_conversion(left);
7437 type_t *const type_left = skip_typeref(orig_type_left);
7439 if (!is_lvalue(left)) {
7440 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
7445 if (is_type_array(type_left)) {
7446 errorf(HERE, "cannot assign to arrays ('%E')", left);
7449 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
7450 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
7454 if (is_type_incomplete(type_left)) {
7455 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
7456 left, orig_type_left);
7459 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
7460 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
7461 left, orig_type_left);
7468 static void semantic_arithmetic_assign(binary_expression_t *expression)
7470 expression_t *left = expression->left;
7471 expression_t *right = expression->right;
7472 type_t *orig_type_left = left->base.type;
7473 type_t *orig_type_right = right->base.type;
7475 if (!is_valid_assignment_lhs(left))
7478 type_t *type_left = skip_typeref(orig_type_left);
7479 type_t *type_right = skip_typeref(orig_type_right);
7481 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7482 /* TODO: improve error message */
7483 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7484 errorf(&expression->base.source_position,
7485 "operation needs arithmetic types");
7490 /* combined instructions are tricky. We can't create an implicit cast on
7491 * the left side, because we need the uncasted form for the store.
7492 * The ast2firm pass has to know that left_type must be right_type
7493 * for the arithmetic operation and create a cast by itself */
7494 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7495 expression->right = create_implicit_cast(right, arithmetic_type);
7496 expression->base.type = type_left;
7499 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
7501 expression_t *const left = expression->left;
7502 expression_t *const right = expression->right;
7503 type_t *const orig_type_left = left->base.type;
7504 type_t *const orig_type_right = right->base.type;
7505 type_t *const type_left = skip_typeref(orig_type_left);
7506 type_t *const type_right = skip_typeref(orig_type_right);
7508 if (!is_valid_assignment_lhs(left))
7511 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7512 /* combined instructions are tricky. We can't create an implicit cast on
7513 * the left side, because we need the uncasted form for the store.
7514 * The ast2firm pass has to know that left_type must be right_type
7515 * for the arithmetic operation and create a cast by itself */
7516 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
7517 expression->right = create_implicit_cast(right, arithmetic_type);
7518 expression->base.type = type_left;
7519 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7520 check_pointer_arithmetic(&expression->base.source_position,
7521 type_left, orig_type_left);
7522 expression->base.type = type_left;
7523 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7524 errorf(&expression->base.source_position,
7525 "incompatible types '%T' and '%T' in assignment",
7526 orig_type_left, orig_type_right);
7531 * Check the semantic restrictions of a logical expression.
7533 static void semantic_logical_op(binary_expression_t *expression)
7535 expression_t *const left = expression->left;
7536 expression_t *const right = expression->right;
7537 type_t *const orig_type_left = left->base.type;
7538 type_t *const orig_type_right = right->base.type;
7539 type_t *const type_left = skip_typeref(orig_type_left);
7540 type_t *const type_right = skip_typeref(orig_type_right);
7542 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
7543 /* TODO: improve error message */
7544 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7545 errorf(&expression->base.source_position,
7546 "operation needs scalar types");
7551 expression->base.type = type_int;
7555 * Check the semantic restrictions of a binary assign expression.
7557 static void semantic_binexpr_assign(binary_expression_t *expression)
7559 expression_t *left = expression->left;
7560 type_t *orig_type_left = left->base.type;
7562 type_t *type_left = revert_automatic_type_conversion(left);
7563 type_left = skip_typeref(orig_type_left);
7565 if (!is_valid_assignment_lhs(left))
7568 assign_error_t error = semantic_assign(orig_type_left, expression->right);
7569 report_assign_error(error, orig_type_left, expression->right,
7570 "assignment", &left->base.source_position);
7571 expression->right = create_implicit_cast(expression->right, orig_type_left);
7572 expression->base.type = orig_type_left;
7576 * Determine if the outermost operation (or parts thereof) of the given
7577 * expression has no effect in order to generate a warning about this fact.
7578 * Therefore in some cases this only examines some of the operands of the
7579 * expression (see comments in the function and examples below).
7581 * f() + 23; // warning, because + has no effect
7582 * x || f(); // no warning, because x controls execution of f()
7583 * x ? y : f(); // warning, because y has no effect
7584 * (void)x; // no warning to be able to suppress the warning
7585 * This function can NOT be used for an "expression has definitely no effect"-
7587 static bool expression_has_effect(const expression_t *const expr)
7589 switch (expr->kind) {
7590 case EXPR_UNKNOWN: break;
7591 case EXPR_INVALID: return true; /* do NOT warn */
7592 case EXPR_REFERENCE: return false;
7593 /* suppress the warning for microsoft __noop operations */
7594 case EXPR_CONST: return expr->conste.is_ms_noop;
7595 case EXPR_CHARACTER_CONSTANT: return false;
7596 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
7597 case EXPR_STRING_LITERAL: return false;
7598 case EXPR_WIDE_STRING_LITERAL: return false;
7601 const call_expression_t *const call = &expr->call;
7602 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
7605 switch (call->function->builtin_symbol.symbol->ID) {
7606 case T___builtin_va_end: return true;
7607 default: return false;
7611 /* Generate the warning if either the left or right hand side of a
7612 * conditional expression has no effect */
7613 case EXPR_CONDITIONAL: {
7614 const conditional_expression_t *const cond = &expr->conditional;
7616 expression_has_effect(cond->true_expression) &&
7617 expression_has_effect(cond->false_expression);
7620 case EXPR_SELECT: return false;
7621 case EXPR_ARRAY_ACCESS: return false;
7622 case EXPR_SIZEOF: return false;
7623 case EXPR_CLASSIFY_TYPE: return false;
7624 case EXPR_ALIGNOF: return false;
7626 case EXPR_FUNCNAME: return false;
7627 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
7628 case EXPR_BUILTIN_CONSTANT_P: return false;
7629 case EXPR_BUILTIN_PREFETCH: return true;
7630 case EXPR_OFFSETOF: return false;
7631 case EXPR_VA_START: return true;
7632 case EXPR_VA_ARG: return true;
7633 case EXPR_STATEMENT: return true; // TODO
7634 case EXPR_COMPOUND_LITERAL: return false;
7636 case EXPR_UNARY_NEGATE: return false;
7637 case EXPR_UNARY_PLUS: return false;
7638 case EXPR_UNARY_BITWISE_NEGATE: return false;
7639 case EXPR_UNARY_NOT: return false;
7640 case EXPR_UNARY_DEREFERENCE: return false;
7641 case EXPR_UNARY_TAKE_ADDRESS: return false;
7642 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
7643 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
7644 case EXPR_UNARY_PREFIX_INCREMENT: return true;
7645 case EXPR_UNARY_PREFIX_DECREMENT: return true;
7647 /* Treat void casts as if they have an effect in order to being able to
7648 * suppress the warning */
7649 case EXPR_UNARY_CAST: {
7650 type_t *const type = skip_typeref(expr->base.type);
7651 return is_type_atomic(type, ATOMIC_TYPE_VOID);
7654 case EXPR_UNARY_CAST_IMPLICIT: return true;
7655 case EXPR_UNARY_ASSUME: return true;
7657 case EXPR_BINARY_ADD: return false;
7658 case EXPR_BINARY_SUB: return false;
7659 case EXPR_BINARY_MUL: return false;
7660 case EXPR_BINARY_DIV: return false;
7661 case EXPR_BINARY_MOD: return false;
7662 case EXPR_BINARY_EQUAL: return false;
7663 case EXPR_BINARY_NOTEQUAL: return false;
7664 case EXPR_BINARY_LESS: return false;
7665 case EXPR_BINARY_LESSEQUAL: return false;
7666 case EXPR_BINARY_GREATER: return false;
7667 case EXPR_BINARY_GREATEREQUAL: return false;
7668 case EXPR_BINARY_BITWISE_AND: return false;
7669 case EXPR_BINARY_BITWISE_OR: return false;
7670 case EXPR_BINARY_BITWISE_XOR: return false;
7671 case EXPR_BINARY_SHIFTLEFT: return false;
7672 case EXPR_BINARY_SHIFTRIGHT: return false;
7673 case EXPR_BINARY_ASSIGN: return true;
7674 case EXPR_BINARY_MUL_ASSIGN: return true;
7675 case EXPR_BINARY_DIV_ASSIGN: return true;
7676 case EXPR_BINARY_MOD_ASSIGN: return true;
7677 case EXPR_BINARY_ADD_ASSIGN: return true;
7678 case EXPR_BINARY_SUB_ASSIGN: return true;
7679 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
7680 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
7681 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
7682 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
7683 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
7685 /* Only examine the right hand side of && and ||, because the left hand
7686 * side already has the effect of controlling the execution of the right
7688 case EXPR_BINARY_LOGICAL_AND:
7689 case EXPR_BINARY_LOGICAL_OR:
7690 /* Only examine the right hand side of a comma expression, because the left
7691 * hand side has a separate warning */
7692 case EXPR_BINARY_COMMA:
7693 return expression_has_effect(expr->binary.right);
7695 case EXPR_BINARY_BUILTIN_EXPECT: return true;
7696 case EXPR_BINARY_ISGREATER: return false;
7697 case EXPR_BINARY_ISGREATEREQUAL: return false;
7698 case EXPR_BINARY_ISLESS: return false;
7699 case EXPR_BINARY_ISLESSEQUAL: return false;
7700 case EXPR_BINARY_ISLESSGREATER: return false;
7701 case EXPR_BINARY_ISUNORDERED: return false;
7704 internal_errorf(HERE, "unexpected expression");
7707 static void semantic_comma(binary_expression_t *expression)
7709 if (warning.unused_value) {
7710 const expression_t *const left = expression->left;
7711 if (!expression_has_effect(left)) {
7712 warningf(&left->base.source_position,
7713 "left-hand operand of comma expression has no effect");
7716 expression->base.type = expression->right->base.type;
7719 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
7720 static expression_t *parse_##binexpression_type(unsigned precedence, \
7721 expression_t *left) \
7724 source_position_t pos = *HERE; \
7726 expression_t *right = parse_sub_expression(precedence + lr); \
7728 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
7729 binexpr->base.source_position = pos; \
7730 binexpr->binary.left = left; \
7731 binexpr->binary.right = right; \
7732 sfunc(&binexpr->binary); \
7737 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
7738 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
7739 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_binexpr_arithmetic, 1)
7740 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_binexpr_arithmetic, 1)
7741 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
7742 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
7743 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
7744 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
7745 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
7747 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
7748 semantic_comparison, 1)
7749 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
7750 semantic_comparison, 1)
7751 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
7752 semantic_comparison, 1)
7753 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
7754 semantic_comparison, 1)
7756 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
7757 semantic_binexpr_arithmetic, 1)
7758 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
7759 semantic_binexpr_arithmetic, 1)
7760 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
7761 semantic_binexpr_arithmetic, 1)
7762 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
7763 semantic_logical_op, 1)
7764 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
7765 semantic_logical_op, 1)
7766 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
7767 semantic_shift_op, 1)
7768 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
7769 semantic_shift_op, 1)
7770 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
7771 semantic_arithmetic_addsubb_assign, 0)
7772 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
7773 semantic_arithmetic_addsubb_assign, 0)
7774 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
7775 semantic_arithmetic_assign, 0)
7776 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
7777 semantic_arithmetic_assign, 0)
7778 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
7779 semantic_arithmetic_assign, 0)
7780 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
7781 semantic_arithmetic_assign, 0)
7782 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
7783 semantic_arithmetic_assign, 0)
7784 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
7785 semantic_arithmetic_assign, 0)
7786 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
7787 semantic_arithmetic_assign, 0)
7788 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
7789 semantic_arithmetic_assign, 0)
7791 static expression_t *parse_sub_expression(unsigned precedence)
7793 if (token.type < 0) {
7794 return expected_expression_error();
7797 expression_parser_function_t *parser
7798 = &expression_parsers[token.type];
7799 source_position_t source_position = token.source_position;
7802 if (parser->parser != NULL) {
7803 left = parser->parser(parser->precedence);
7805 left = parse_primary_expression();
7807 assert(left != NULL);
7808 left->base.source_position = source_position;
7811 if (token.type < 0) {
7812 return expected_expression_error();
7815 parser = &expression_parsers[token.type];
7816 if (parser->infix_parser == NULL)
7818 if (parser->infix_precedence < precedence)
7821 left = parser->infix_parser(parser->infix_precedence, left);
7823 assert(left != NULL);
7824 assert(left->kind != EXPR_UNKNOWN);
7825 left->base.source_position = source_position;
7832 * Parse an expression.
7834 static expression_t *parse_expression(void)
7836 return parse_sub_expression(1);
7840 * Register a parser for a prefix-like operator with given precedence.
7842 * @param parser the parser function
7843 * @param token_type the token type of the prefix token
7844 * @param precedence the precedence of the operator
7846 static void register_expression_parser(parse_expression_function parser,
7847 int token_type, unsigned precedence)
7849 expression_parser_function_t *entry = &expression_parsers[token_type];
7851 if (entry->parser != NULL) {
7852 diagnosticf("for token '%k'\n", (token_type_t)token_type);
7853 panic("trying to register multiple expression parsers for a token");
7855 entry->parser = parser;
7856 entry->precedence = precedence;
7860 * Register a parser for an infix operator with given precedence.
7862 * @param parser the parser function
7863 * @param token_type the token type of the infix operator
7864 * @param precedence the precedence of the operator
7866 static void register_infix_parser(parse_expression_infix_function parser,
7867 int token_type, unsigned precedence)
7869 expression_parser_function_t *entry = &expression_parsers[token_type];
7871 if (entry->infix_parser != NULL) {
7872 diagnosticf("for token '%k'\n", (token_type_t)token_type);
7873 panic("trying to register multiple infix expression parsers for a "
7876 entry->infix_parser = parser;
7877 entry->infix_precedence = precedence;
7881 * Initialize the expression parsers.
7883 static void init_expression_parsers(void)
7885 memset(&expression_parsers, 0, sizeof(expression_parsers));
7887 register_infix_parser(parse_array_expression, '[', 30);
7888 register_infix_parser(parse_call_expression, '(', 30);
7889 register_infix_parser(parse_select_expression, '.', 30);
7890 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
7891 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
7893 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
7896 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 17);
7897 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 17);
7898 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 17);
7899 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 16);
7900 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 16);
7901 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 15);
7902 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 15);
7903 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
7904 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
7905 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
7906 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
7907 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
7908 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
7909 T_EXCLAMATIONMARKEQUAL, 13);
7910 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
7911 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
7912 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
7913 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
7914 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
7915 register_infix_parser(parse_conditional_expression, '?', 7);
7916 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
7917 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
7918 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
7919 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
7920 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
7921 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
7922 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
7923 T_LESSLESSEQUAL, 2);
7924 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
7925 T_GREATERGREATEREQUAL, 2);
7926 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
7928 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
7930 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
7933 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
7935 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
7936 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
7937 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
7938 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
7939 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
7940 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
7941 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
7943 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
7945 register_expression_parser(parse_sizeof, T_sizeof, 25);
7946 register_expression_parser(parse_alignof, T___alignof__, 25);
7947 register_expression_parser(parse_extension, T___extension__, 25);
7948 register_expression_parser(parse_builtin_classify_type,
7949 T___builtin_classify_type, 25);
7953 * Parse a asm statement arguments specification.
7955 static asm_argument_t *parse_asm_arguments(bool is_out)
7957 asm_argument_t *result = NULL;
7958 asm_argument_t *last = NULL;
7960 while (token.type == T_STRING_LITERAL || token.type == '[') {
7961 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7962 memset(argument, 0, sizeof(argument[0]));
7964 if (token.type == '[') {
7966 if (token.type != T_IDENTIFIER) {
7967 parse_error_expected("while parsing asm argument",
7968 T_IDENTIFIER, NULL);
7971 argument->symbol = token.v.symbol;
7976 argument->constraints = parse_string_literals();
7978 add_anchor_token(')');
7979 expression_t *expression = parse_expression();
7980 rem_anchor_token(')');
7982 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
7983 * change size or type representation (e.g. int -> long is ok, but
7984 * int -> float is not) */
7985 if (expression->kind == EXPR_UNARY_CAST) {
7986 type_t *const type = expression->base.type;
7987 type_kind_t const kind = type->kind;
7988 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
7991 if (kind == TYPE_ATOMIC) {
7992 atomic_type_kind_t const akind = type->atomic.akind;
7993 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
7994 size = get_atomic_type_size(akind);
7996 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
7997 size = get_atomic_type_size(get_intptr_kind());
8001 expression_t *const value = expression->unary.value;
8002 type_t *const value_type = value->base.type;
8003 type_kind_t const value_kind = value_type->kind;
8005 unsigned value_flags;
8006 unsigned value_size;
8007 if (value_kind == TYPE_ATOMIC) {
8008 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8009 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8010 value_size = get_atomic_type_size(value_akind);
8011 } else if (value_kind == TYPE_POINTER) {
8012 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8013 value_size = get_atomic_type_size(get_intptr_kind());
8018 if (value_flags != flags || value_size != size)
8022 } while (expression->kind == EXPR_UNARY_CAST);
8026 if (!is_lvalue(expression)) {
8027 errorf(&expression->base.source_position,
8028 "asm output argument is not an lvalue");
8031 argument->expression = expression;
8034 set_address_taken(expression, true);
8037 last->next = argument;
8043 if (token.type != ',')
8054 * Parse a asm statement clobber specification.
8056 static asm_clobber_t *parse_asm_clobbers(void)
8058 asm_clobber_t *result = NULL;
8059 asm_clobber_t *last = NULL;
8061 while(token.type == T_STRING_LITERAL) {
8062 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8063 clobber->clobber = parse_string_literals();
8066 last->next = clobber;
8072 if (token.type != ',')
8081 * Parse an asm statement.
8083 static statement_t *parse_asm_statement(void)
8087 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8088 statement->base.source_position = token.source_position;
8090 asm_statement_t *asm_statement = &statement->asms;
8092 if (token.type == T_volatile) {
8094 asm_statement->is_volatile = true;
8098 add_anchor_token(')');
8099 add_anchor_token(':');
8100 asm_statement->asm_text = parse_string_literals();
8102 if (token.type != ':') {
8103 rem_anchor_token(':');
8108 asm_statement->outputs = parse_asm_arguments(true);
8109 if (token.type != ':') {
8110 rem_anchor_token(':');
8115 asm_statement->inputs = parse_asm_arguments(false);
8116 if (token.type != ':') {
8117 rem_anchor_token(':');
8120 rem_anchor_token(':');
8123 asm_statement->clobbers = parse_asm_clobbers();
8126 rem_anchor_token(')');
8130 if (asm_statement->outputs == NULL) {
8131 /* GCC: An 'asm' instruction without any output operands will be treated
8132 * identically to a volatile 'asm' instruction. */
8133 asm_statement->is_volatile = true;
8138 return create_invalid_statement();
8142 * Parse a case statement.
8144 static statement_t *parse_case_statement(void)
8148 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8149 source_position_t *const pos = &statement->base.source_position;
8151 *pos = token.source_position;
8152 statement->case_label.expression = parse_expression();
8154 PUSH_PARENT(statement);
8156 if (c_mode & _GNUC) {
8157 if (token.type == T_DOTDOTDOT) {
8159 statement->case_label.end_range = parse_expression();
8165 if (! is_constant_expression(statement->case_label.expression)) {
8166 errorf(pos, "case label does not reduce to an integer constant");
8167 } else if (current_switch != NULL) {
8168 /* Check for duplicate case values */
8170 long const val = fold_constant(statement->case_label.expression);
8171 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8172 expression_t const* const e = l->expression;
8173 if (e == NULL || !is_constant_expression(e) || fold_constant(e) != val)
8176 errorf(pos, "duplicate case value (previously used %P)",
8177 &l->base.source_position);
8181 /* link all cases into the switch statement */
8182 if (current_switch->last_case == NULL) {
8183 current_switch->first_case = &statement->case_label;
8185 current_switch->last_case->next = &statement->case_label;
8187 current_switch->last_case = &statement->case_label;
8189 errorf(pos, "case label not within a switch statement");
8192 statement_t *const inner_stmt = parse_statement();
8193 statement->case_label.statement = inner_stmt;
8194 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8195 errorf(&inner_stmt->base.source_position, "declaration after case label");
8202 return create_invalid_statement();
8206 * Finds an existing default label of a switch statement.
8208 static case_label_statement_t *
8209 find_default_label(const switch_statement_t *statement)
8211 case_label_statement_t *label = statement->first_case;
8212 for ( ; label != NULL; label = label->next) {
8213 if (label->expression == NULL)
8220 * Parse a default statement.
8222 static statement_t *parse_default_statement(void)
8226 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8227 statement->base.source_position = token.source_position;
8229 PUSH_PARENT(statement);
8232 if (current_switch != NULL) {
8233 const case_label_statement_t *def_label = find_default_label(current_switch);
8234 if (def_label != NULL) {
8235 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
8236 &def_label->base.source_position);
8238 /* link all cases into the switch statement */
8239 if (current_switch->last_case == NULL) {
8240 current_switch->first_case = &statement->case_label;
8242 current_switch->last_case->next = &statement->case_label;
8244 current_switch->last_case = &statement->case_label;
8247 errorf(&statement->base.source_position,
8248 "'default' label not within a switch statement");
8251 statement_t *const inner_stmt = parse_statement();
8252 statement->case_label.statement = inner_stmt;
8253 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8254 errorf(&inner_stmt->base.source_position, "declaration after default label");
8261 return create_invalid_statement();
8265 * Return the declaration for a given label symbol or create a new one.
8267 * @param symbol the symbol of the label
8269 static declaration_t *get_label(symbol_t *symbol)
8271 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
8272 assert(current_function != NULL);
8273 /* if we found a label in the same function, then we already created the
8275 if (candidate != NULL
8276 && candidate->parent_scope == ¤t_function->scope) {
8280 /* otherwise we need to create a new one */
8281 declaration_t *const declaration = allocate_declaration_zero();
8282 declaration->namespc = NAMESPACE_LABEL;
8283 declaration->symbol = symbol;
8285 label_push(declaration);
8291 * Parse a label statement.
8293 static statement_t *parse_label_statement(void)
8295 assert(token.type == T_IDENTIFIER);
8296 symbol_t *symbol = token.v.symbol;
8299 declaration_t *label = get_label(symbol);
8301 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8302 statement->base.source_position = token.source_position;
8303 statement->label.label = label;
8305 PUSH_PARENT(statement);
8307 /* if source position is already set then the label is defined twice,
8308 * otherwise it was just mentioned in a goto so far */
8309 if (label->source_position.input_name != NULL) {
8310 errorf(HERE, "duplicate label '%Y' (declared %P)",
8311 symbol, &label->source_position);
8313 label->source_position = token.source_position;
8314 label->init.statement = statement;
8319 if (token.type == '}') {
8320 /* TODO only warn? */
8322 warningf(HERE, "label at end of compound statement");
8323 statement->label.statement = create_empty_statement();
8325 errorf(HERE, "label at end of compound statement");
8326 statement->label.statement = create_invalid_statement();
8328 } else if (token.type == ';') {
8329 /* Eat an empty statement here, to avoid the warning about an empty
8330 * statement after a label. label:; is commonly used to have a label
8331 * before a closing brace. */
8332 statement->label.statement = create_empty_statement();
8335 statement_t *const inner_stmt = parse_statement();
8336 statement->label.statement = inner_stmt;
8337 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8338 errorf(&inner_stmt->base.source_position, "declaration after label");
8342 /* remember the labels in a list for later checking */
8343 if (label_last == NULL) {
8344 label_first = &statement->label;
8346 label_last->next = &statement->label;
8348 label_last = &statement->label;
8355 * Parse an if statement.
8357 static statement_t *parse_if(void)
8361 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
8362 statement->base.source_position = token.source_position;
8364 PUSH_PARENT(statement);
8367 add_anchor_token(')');
8368 statement->ifs.condition = parse_expression();
8369 rem_anchor_token(')');
8372 add_anchor_token(T_else);
8373 statement->ifs.true_statement = parse_statement();
8374 rem_anchor_token(T_else);
8376 if (token.type == T_else) {
8378 statement->ifs.false_statement = parse_statement();
8385 return create_invalid_statement();
8389 * Parse a switch statement.
8391 static statement_t *parse_switch(void)
8395 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
8396 statement->base.source_position = token.source_position;
8398 PUSH_PARENT(statement);
8401 expression_t *const expr = parse_expression();
8402 type_t * type = skip_typeref(expr->base.type);
8403 if (is_type_integer(type)) {
8404 type = promote_integer(type);
8405 } else if (is_type_valid(type)) {
8406 errorf(&expr->base.source_position,
8407 "switch quantity is not an integer, but '%T'", type);
8408 type = type_error_type;
8410 statement->switchs.expression = create_implicit_cast(expr, type);
8413 switch_statement_t *rem = current_switch;
8414 current_switch = &statement->switchs;
8415 statement->switchs.body = parse_statement();
8416 current_switch = rem;
8418 if (warning.switch_default &&
8419 find_default_label(&statement->switchs) == NULL) {
8420 warningf(&statement->base.source_position, "switch has no default case");
8427 return create_invalid_statement();
8430 static statement_t *parse_loop_body(statement_t *const loop)
8432 statement_t *const rem = current_loop;
8433 current_loop = loop;
8435 statement_t *const body = parse_statement();
8442 * Parse a while statement.
8444 static statement_t *parse_while(void)
8448 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
8449 statement->base.source_position = token.source_position;
8451 PUSH_PARENT(statement);
8454 add_anchor_token(')');
8455 statement->whiles.condition = parse_expression();
8456 rem_anchor_token(')');
8459 statement->whiles.body = parse_loop_body(statement);
8465 return create_invalid_statement();
8469 * Parse a do statement.
8471 static statement_t *parse_do(void)
8475 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
8476 statement->base.source_position = token.source_position;
8478 PUSH_PARENT(statement)
8480 add_anchor_token(T_while);
8481 statement->do_while.body = parse_loop_body(statement);
8482 rem_anchor_token(T_while);
8486 add_anchor_token(')');
8487 statement->do_while.condition = parse_expression();
8488 rem_anchor_token(')');
8496 return create_invalid_statement();
8500 * Parse a for statement.
8502 static statement_t *parse_for(void)
8506 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
8507 statement->base.source_position = token.source_position;
8509 PUSH_PARENT(statement);
8511 int top = environment_top();
8512 scope_t *last_scope = scope;
8513 set_scope(&statement->fors.scope);
8516 add_anchor_token(')');
8518 if (token.type != ';') {
8519 if (is_declaration_specifier(&token, false)) {
8520 parse_declaration(record_declaration);
8522 add_anchor_token(';');
8523 expression_t *const init = parse_expression();
8524 statement->fors.initialisation = init;
8525 if (warning.unused_value && !expression_has_effect(init)) {
8526 warningf(&init->base.source_position,
8527 "initialisation of 'for'-statement has no effect");
8529 rem_anchor_token(';');
8536 if (token.type != ';') {
8537 add_anchor_token(';');
8538 statement->fors.condition = parse_expression();
8539 rem_anchor_token(';');
8542 if (token.type != ')') {
8543 expression_t *const step = parse_expression();
8544 statement->fors.step = step;
8545 if (warning.unused_value && !expression_has_effect(step)) {
8546 warningf(&step->base.source_position,
8547 "step of 'for'-statement has no effect");
8550 rem_anchor_token(')');
8552 statement->fors.body = parse_loop_body(statement);
8554 assert(scope == &statement->fors.scope);
8555 set_scope(last_scope);
8556 environment_pop_to(top);
8563 rem_anchor_token(')');
8564 assert(scope == &statement->fors.scope);
8565 set_scope(last_scope);
8566 environment_pop_to(top);
8568 return create_invalid_statement();
8572 * Parse a goto statement.
8574 static statement_t *parse_goto(void)
8578 if (token.type != T_IDENTIFIER) {
8579 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
8583 symbol_t *symbol = token.v.symbol;
8586 declaration_t *label = get_label(symbol);
8588 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
8589 statement->base.source_position = token.source_position;
8591 statement->gotos.label = label;
8593 /* remember the goto's in a list for later checking */
8594 if (goto_last == NULL) {
8595 goto_first = &statement->gotos;
8597 goto_last->next = &statement->gotos;
8599 goto_last = &statement->gotos;
8605 return create_invalid_statement();
8609 * Parse a continue statement.
8611 static statement_t *parse_continue(void)
8613 statement_t *statement;
8614 if (current_loop == NULL) {
8615 errorf(HERE, "continue statement not within loop");
8616 statement = create_invalid_statement();
8618 statement = allocate_statement_zero(STATEMENT_CONTINUE);
8620 statement->base.source_position = token.source_position;
8628 return create_invalid_statement();
8632 * Parse a break statement.
8634 static statement_t *parse_break(void)
8636 statement_t *statement;
8637 if (current_switch == NULL && current_loop == NULL) {
8638 errorf(HERE, "break statement not within loop or switch");
8639 statement = create_invalid_statement();
8641 statement = allocate_statement_zero(STATEMENT_BREAK);
8643 statement->base.source_position = token.source_position;
8651 return create_invalid_statement();
8655 * Parse a __leave statement.
8657 static statement_t *parse_leave(void)
8659 statement_t *statement;
8660 if (current_try == NULL) {
8661 errorf(HERE, "__leave statement not within __try");
8662 statement = create_invalid_statement();
8664 statement = allocate_statement_zero(STATEMENT_LEAVE);
8666 statement->base.source_position = token.source_position;
8674 return create_invalid_statement();
8678 * Check if a given declaration represents a local variable.
8680 static bool is_local_var_declaration(const declaration_t *declaration)
8682 switch ((storage_class_tag_t) declaration->storage_class) {
8683 case STORAGE_CLASS_AUTO:
8684 case STORAGE_CLASS_REGISTER: {
8685 const type_t *type = skip_typeref(declaration->type);
8686 if (is_type_function(type)) {
8698 * Check if a given declaration represents a variable.
8700 static bool is_var_declaration(const declaration_t *declaration)
8702 if (declaration->storage_class == STORAGE_CLASS_TYPEDEF)
8705 const type_t *type = skip_typeref(declaration->type);
8706 return !is_type_function(type);
8710 * Check if a given expression represents a local variable.
8712 static bool is_local_variable(const expression_t *expression)
8714 if (expression->base.kind != EXPR_REFERENCE) {
8717 const declaration_t *declaration = expression->reference.declaration;
8718 return is_local_var_declaration(declaration);
8722 * Check if a given expression represents a local variable and
8723 * return its declaration then, else return NULL.
8725 declaration_t *expr_is_variable(const expression_t *expression)
8727 if (expression->base.kind != EXPR_REFERENCE) {
8730 declaration_t *declaration = expression->reference.declaration;
8731 if (is_var_declaration(declaration))
8737 * Parse a return statement.
8739 static statement_t *parse_return(void)
8741 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
8742 statement->base.source_position = token.source_position;
8746 expression_t *return_value = NULL;
8747 if (token.type != ';') {
8748 return_value = parse_expression();
8752 const type_t *const func_type = current_function->type;
8753 assert(is_type_function(func_type));
8754 type_t *const return_type = skip_typeref(func_type->function.return_type);
8756 if (return_value != NULL) {
8757 type_t *return_value_type = skip_typeref(return_value->base.type);
8759 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)
8760 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
8761 warningf(&statement->base.source_position,
8762 "'return' with a value, in function returning void");
8763 return_value = NULL;
8765 assign_error_t error = semantic_assign(return_type, return_value);
8766 report_assign_error(error, return_type, return_value, "'return'",
8767 &statement->base.source_position);
8768 return_value = create_implicit_cast(return_value, return_type);
8770 /* check for returning address of a local var */
8771 if (return_value != NULL &&
8772 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
8773 const expression_t *expression = return_value->unary.value;
8774 if (is_local_variable(expression)) {
8775 warningf(&statement->base.source_position,
8776 "function returns address of local variable");
8780 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
8781 warningf(&statement->base.source_position,
8782 "'return' without value, in function returning non-void");
8785 statement->returns.value = return_value;
8789 return create_invalid_statement();
8793 * Parse a declaration statement.
8795 static statement_t *parse_declaration_statement(void)
8797 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
8799 statement->base.source_position = token.source_position;
8801 declaration_t *before = last_declaration;
8802 parse_declaration(record_declaration);
8804 if (before == NULL) {
8805 statement->declaration.declarations_begin = scope->declarations;
8807 statement->declaration.declarations_begin = before->next;
8809 statement->declaration.declarations_end = last_declaration;
8815 * Parse an expression statement, ie. expr ';'.
8817 static statement_t *parse_expression_statement(void)
8819 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
8821 statement->base.source_position = token.source_position;
8822 expression_t *const expr = parse_expression();
8823 statement->expression.expression = expr;
8829 return create_invalid_statement();
8833 * Parse a microsoft __try { } __finally { } or
8834 * __try{ } __except() { }
8836 static statement_t *parse_ms_try_statment(void)
8838 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
8840 statement->base.source_position = token.source_position;
8843 ms_try_statement_t *rem = current_try;
8844 current_try = &statement->ms_try;
8845 statement->ms_try.try_statement = parse_compound_statement(false);
8848 if (token.type == T___except) {
8851 add_anchor_token(')');
8852 expression_t *const expr = parse_expression();
8853 type_t * type = skip_typeref(expr->base.type);
8854 if (is_type_integer(type)) {
8855 type = promote_integer(type);
8856 } else if (is_type_valid(type)) {
8857 errorf(&expr->base.source_position,
8858 "__expect expression is not an integer, but '%T'", type);
8859 type = type_error_type;
8861 statement->ms_try.except_expression = create_implicit_cast(expr, type);
8862 rem_anchor_token(')');
8864 statement->ms_try.final_statement = parse_compound_statement(false);
8865 } else if (token.type == T__finally) {
8867 statement->ms_try.final_statement = parse_compound_statement(false);
8869 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
8870 return create_invalid_statement();
8874 return create_invalid_statement();
8877 static statement_t *parse_empty_statement(void)
8879 if (warning.empty_statement) {
8880 warningf(HERE, "statement is empty");
8883 return create_empty_statement();
8887 * Parse a statement.
8888 * There's also parse_statement() which additionally checks for
8889 * "statement has no effect" warnings
8891 static statement_t *intern_parse_statement(void)
8893 statement_t *statement = NULL;
8895 /* declaration or statement */
8896 add_anchor_token(';');
8897 switch (token.type) {
8899 if (look_ahead(1)->type == ':') {
8900 statement = parse_label_statement();
8901 } else if (is_typedef_symbol(token.v.symbol)) {
8902 statement = parse_declaration_statement();
8904 statement = parse_expression_statement();
8908 case T___extension__:
8909 /* This can be a prefix to a declaration or an expression statement.
8910 * We simply eat it now and parse the rest with tail recursion. */
8913 } while (token.type == T___extension__);
8914 statement = parse_statement();
8918 statement = parse_declaration_statement();
8921 case ';': statement = parse_empty_statement(); break;
8922 case '{': statement = parse_compound_statement(false); break;
8923 case T___leave: statement = parse_leave(); break;
8924 case T___try: statement = parse_ms_try_statment(); break;
8925 case T_asm: statement = parse_asm_statement(); break;
8926 case T_break: statement = parse_break(); break;
8927 case T_case: statement = parse_case_statement(); break;
8928 case T_continue: statement = parse_continue(); break;
8929 case T_default: statement = parse_default_statement(); break;
8930 case T_do: statement = parse_do(); break;
8931 case T_for: statement = parse_for(); break;
8932 case T_goto: statement = parse_goto(); break;
8933 case T_if: statement = parse_if (); break;
8934 case T_return: statement = parse_return(); break;
8935 case T_switch: statement = parse_switch(); break;
8936 case T_while: statement = parse_while(); break;
8937 default: statement = parse_expression_statement(); break;
8939 rem_anchor_token(';');
8941 assert(statement != NULL
8942 && statement->base.source_position.input_name != NULL);
8948 * parse a statement and emits "statement has no effect" warning if needed
8949 * (This is really a wrapper around intern_parse_statement with check for 1
8950 * single warning. It is needed, because for statement expressions we have
8951 * to avoid the warning on the last statement)
8953 static statement_t *parse_statement(void)
8955 statement_t *statement = intern_parse_statement();
8957 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
8958 expression_t *expression = statement->expression.expression;
8959 if (!expression_has_effect(expression)) {
8960 warningf(&expression->base.source_position,
8961 "statement has no effect");
8969 * Parse a compound statement.
8971 static statement_t *parse_compound_statement(bool inside_expression_statement)
8973 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
8974 statement->base.source_position = token.source_position;
8976 PUSH_PARENT(statement);
8979 add_anchor_token('}');
8981 int top = environment_top();
8982 scope_t *last_scope = scope;
8983 set_scope(&statement->compound.scope);
8985 statement_t *last_statement = NULL;
8987 bool only_decls_so_far = true;
8988 while (token.type != '}' && token.type != T_EOF) {
8989 statement_t *sub_statement = intern_parse_statement();
8990 if (is_invalid_statement(sub_statement)) {
8991 /* an error occurred. if we are at an anchor, return */
8997 if (warning.declaration_after_statement) {
8998 if (sub_statement->kind != STATEMENT_DECLARATION) {
8999 only_decls_so_far = false;
9000 } else if (!only_decls_so_far) {
9001 warningf(&sub_statement->base.source_position,
9002 "ISO C90 forbids mixed declarations and code");
9006 if (last_statement != NULL) {
9007 last_statement->base.next = sub_statement;
9009 statement->compound.statements = sub_statement;
9012 while (sub_statement->base.next != NULL)
9013 sub_statement = sub_statement->base.next;
9015 last_statement = sub_statement;
9018 if (token.type == '}') {
9021 errorf(&statement->base.source_position,
9022 "end of file while looking for closing '}'");
9025 /* look over all statements again to produce no effect warnings */
9026 if (warning.unused_value) {
9027 statement_t *sub_statement = statement->compound.statements;
9028 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9029 if (sub_statement->kind != STATEMENT_EXPRESSION)
9031 /* don't emit a warning for the last expression in an expression
9032 * statement as it has always an effect */
9033 if (inside_expression_statement && sub_statement->base.next == NULL)
9036 expression_t *expression = sub_statement->expression.expression;
9037 if (!expression_has_effect(expression)) {
9038 warningf(&expression->base.source_position,
9039 "statement has no effect");
9045 rem_anchor_token('}');
9046 assert(scope == &statement->compound.scope);
9047 set_scope(last_scope);
9048 environment_pop_to(top);
9055 * Initialize builtin types.
9057 static void initialize_builtin_types(void)
9059 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
9060 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
9061 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
9062 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
9063 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
9064 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
9065 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", type_int);
9066 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
9068 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
9069 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
9070 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
9071 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
9075 * Check for unused global static functions and variables
9077 static void check_unused_globals(void)
9079 if (!warning.unused_function && !warning.unused_variable)
9082 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
9084 decl->modifiers & DM_UNUSED ||
9085 decl->modifiers & DM_USED ||
9086 decl->storage_class != STORAGE_CLASS_STATIC)
9089 type_t *const type = decl->type;
9091 if (is_type_function(skip_typeref(type))) {
9092 if (!warning.unused_function || decl->is_inline)
9095 s = (decl->init.statement != NULL ? "defined" : "declared");
9097 if (!warning.unused_variable)
9103 warningf(&decl->source_position, "'%#T' %s but not used",
9104 type, decl->symbol, s);
9108 static void parse_global_asm(void)
9113 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9114 statement->base.source_position = token.source_position;
9115 statement->asms.asm_text = parse_string_literals();
9116 statement->base.next = unit->global_asm;
9117 unit->global_asm = statement;
9126 * Parse a translation unit.
9128 static void parse_translation_unit(void)
9130 for (;;) switch (token.type) {
9133 case T___extension__:
9134 parse_external_declaration();
9145 /* TODO error in strict mode */
9146 warningf(HERE, "stray ';' outside of function");
9151 errorf(HERE, "stray %K outside of function", &token);
9152 if (token.type == '(' || token.type == '{' || token.type == '[')
9153 eat_until_matching_token(token.type);
9162 * @return the translation unit or NULL if errors occurred.
9164 void start_parsing(void)
9166 environment_stack = NEW_ARR_F(stack_entry_t, 0);
9167 label_stack = NEW_ARR_F(stack_entry_t, 0);
9168 diagnostic_count = 0;
9172 type_set_output(stderr);
9173 ast_set_output(stderr);
9175 assert(unit == NULL);
9176 unit = allocate_ast_zero(sizeof(unit[0]));
9178 assert(global_scope == NULL);
9179 global_scope = &unit->scope;
9181 assert(scope == NULL);
9182 set_scope(&unit->scope);
9184 initialize_builtin_types();
9187 translation_unit_t *finish_parsing(void)
9189 assert(scope == &unit->scope);
9191 last_declaration = NULL;
9193 assert(global_scope == &unit->scope);
9194 check_unused_globals();
9195 global_scope = NULL;
9197 DEL_ARR_F(environment_stack);
9198 DEL_ARR_F(label_stack);
9200 translation_unit_t *result = unit;
9207 lookahead_bufpos = 0;
9208 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
9211 parse_translation_unit();
9215 * Initialize the parser.
9217 void init_parser(void)
9220 /* add predefined symbols for extended-decl-modifier */
9221 sym_align = symbol_table_insert("align");
9222 sym_allocate = symbol_table_insert("allocate");
9223 sym_dllimport = symbol_table_insert("dllimport");
9224 sym_dllexport = symbol_table_insert("dllexport");
9225 sym_naked = symbol_table_insert("naked");
9226 sym_noinline = symbol_table_insert("noinline");
9227 sym_noreturn = symbol_table_insert("noreturn");
9228 sym_nothrow = symbol_table_insert("nothrow");
9229 sym_novtable = symbol_table_insert("novtable");
9230 sym_property = symbol_table_insert("property");
9231 sym_get = symbol_table_insert("get");
9232 sym_put = symbol_table_insert("put");
9233 sym_selectany = symbol_table_insert("selectany");
9234 sym_thread = symbol_table_insert("thread");
9235 sym_uuid = symbol_table_insert("uuid");
9236 sym_deprecated = symbol_table_insert("deprecated");
9237 sym_restrict = symbol_table_insert("restrict");
9238 sym_noalias = symbol_table_insert("noalias");
9240 memset(token_anchor_set, 0, sizeof(token_anchor_set));
9242 init_expression_parsers();
9243 obstack_init(&temp_obst);
9245 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
9246 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
9250 * Terminate the parser.
9252 void exit_parser(void)
9254 obstack_free(&temp_obst, NULL);