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 gnu_attribute_t gnu_attribute_t;
52 struct gnu_attribute_t {
53 gnu_attribute_kind_t kind;
54 gnu_attribute_t *next;
63 typedef struct declaration_specifiers_t declaration_specifiers_t;
64 struct declaration_specifiers_t {
65 source_position_t source_position;
66 unsigned char declared_storage_class;
67 unsigned char alignment; /**< Alignment, 0 if not set. */
68 unsigned int is_inline : 1;
69 unsigned int deprecated : 1;
70 decl_modifiers_t decl_modifiers; /**< MS __declspec extended modifier mask */
71 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
72 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
73 symbol_t *get_property_sym; /**< the name of the get property if set. */
74 symbol_t *put_property_sym; /**< the name of the put property if set. */
79 * An environment for parsing initializers (and compound literals).
81 typedef struct parse_initializer_env_t {
82 type_t *type; /**< the type of the initializer. In case of an
83 array type with unspecified size this gets
84 adjusted to the actual size. */
85 declaration_t *declaration; /**< the declaration that is initialized if any */
86 bool must_be_constant;
87 } parse_initializer_env_t;
89 typedef declaration_t* (*parsed_declaration_func) (declaration_t *declaration);
92 static token_t lookahead_buffer[MAX_LOOKAHEAD];
93 static int lookahead_bufpos;
94 static stack_entry_t *environment_stack = NULL;
95 static stack_entry_t *label_stack = NULL;
96 static scope_t *global_scope = NULL;
97 static scope_t *scope = NULL;
98 static declaration_t *last_declaration = NULL;
99 static declaration_t *current_function = NULL;
100 static switch_statement_t *current_switch = NULL;
101 static statement_t *current_loop = NULL;
102 static ms_try_statement_t *current_try = NULL;
103 static goto_statement_t *goto_first = NULL;
104 static goto_statement_t *goto_last = NULL;
105 static label_statement_t *label_first = NULL;
106 static label_statement_t *label_last = NULL;
107 static struct obstack temp_obst;
109 static source_position_t null_position = { NULL, 0 };
111 /* symbols for Microsoft extended-decl-modifier */
112 static const symbol_t *sym_align = NULL;
113 static const symbol_t *sym_allocate = NULL;
114 static const symbol_t *sym_dllimport = NULL;
115 static const symbol_t *sym_dllexport = NULL;
116 static const symbol_t *sym_naked = NULL;
117 static const symbol_t *sym_noinline = NULL;
118 static const symbol_t *sym_noreturn = NULL;
119 static const symbol_t *sym_nothrow = NULL;
120 static const symbol_t *sym_novtable = NULL;
121 static const symbol_t *sym_property = NULL;
122 static const symbol_t *sym_get = NULL;
123 static const symbol_t *sym_put = NULL;
124 static const symbol_t *sym_selectany = NULL;
125 static const symbol_t *sym_thread = NULL;
126 static const symbol_t *sym_uuid = NULL;
127 static const symbol_t *sym_deprecated = NULL;
128 static const symbol_t *sym_restrict = NULL;
129 static const symbol_t *sym_noalias = NULL;
131 /** The token anchor set */
132 static unsigned char token_anchor_set[T_LAST_TOKEN];
134 /** The current source position. */
135 #define HERE (&token.source_position)
137 static type_t *type_valist;
139 static statement_t *parse_compound_statement(bool inside_expression_statement);
140 static statement_t *parse_statement(void);
142 static expression_t *parse_sub_expression(unsigned precedence);
143 static expression_t *parse_expression(void);
144 static type_t *parse_typename(void);
146 static void parse_compound_type_entries(declaration_t *compound_declaration);
147 static declaration_t *parse_declarator(
148 const declaration_specifiers_t *specifiers, bool may_be_abstract);
149 static declaration_t *record_declaration(declaration_t *declaration);
151 static void semantic_comparison(binary_expression_t *expression);
153 #define STORAGE_CLASSES \
160 #define TYPE_QUALIFIERS \
167 #ifdef PROVIDE_COMPLEX
168 #define COMPLEX_SPECIFIERS \
170 #define IMAGINARY_SPECIFIERS \
173 #define COMPLEX_SPECIFIERS
174 #define IMAGINARY_SPECIFIERS
177 #define TYPE_SPECIFIERS \
192 case T___builtin_va_list: \
197 #define DECLARATION_START \
202 #define TYPENAME_START \
207 * Allocate an AST node with given size and
208 * initialize all fields with zero.
210 static void *allocate_ast_zero(size_t size)
212 void *res = allocate_ast(size);
213 memset(res, 0, size);
217 static declaration_t *allocate_declaration_zero(void)
219 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
220 declaration->type = type_error_type;
221 declaration->alignment = 0;
226 * Returns the size of a statement node.
228 * @param kind the statement kind
230 static size_t get_statement_struct_size(statement_kind_t kind)
232 static const size_t sizes[] = {
233 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
234 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
235 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
236 [STATEMENT_RETURN] = sizeof(return_statement_t),
237 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
238 [STATEMENT_IF] = sizeof(if_statement_t),
239 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
240 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
241 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
242 [STATEMENT_BREAK] = sizeof(statement_base_t),
243 [STATEMENT_GOTO] = sizeof(goto_statement_t),
244 [STATEMENT_LABEL] = sizeof(label_statement_t),
245 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
246 [STATEMENT_WHILE] = sizeof(while_statement_t),
247 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
248 [STATEMENT_FOR] = sizeof(for_statement_t),
249 [STATEMENT_ASM] = sizeof(asm_statement_t),
250 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
251 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
253 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
254 assert(sizes[kind] != 0);
259 * Returns the size of an expression node.
261 * @param kind the expression kind
263 static size_t get_expression_struct_size(expression_kind_t kind)
265 static const size_t sizes[] = {
266 [EXPR_INVALID] = sizeof(expression_base_t),
267 [EXPR_REFERENCE] = sizeof(reference_expression_t),
268 [EXPR_CONST] = sizeof(const_expression_t),
269 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
270 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
271 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
272 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
273 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
274 [EXPR_CALL] = sizeof(call_expression_t),
275 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
276 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
277 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
278 [EXPR_SELECT] = sizeof(select_expression_t),
279 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
280 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
281 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
282 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
283 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
284 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
285 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
286 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
287 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
288 [EXPR_VA_START] = sizeof(va_start_expression_t),
289 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
290 [EXPR_STATEMENT] = sizeof(statement_expression_t),
292 if(kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
293 return sizes[EXPR_UNARY_FIRST];
295 if(kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
296 return sizes[EXPR_BINARY_FIRST];
298 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
299 assert(sizes[kind] != 0);
304 * Allocate a statement node of given kind and initialize all
307 static statement_t *allocate_statement_zero(statement_kind_t kind)
309 size_t size = get_statement_struct_size(kind);
310 statement_t *res = allocate_ast_zero(size);
312 res->base.kind = kind;
317 * Allocate an expression node of given kind and initialize all
320 static expression_t *allocate_expression_zero(expression_kind_t kind)
322 size_t size = get_expression_struct_size(kind);
323 expression_t *res = allocate_ast_zero(size);
325 res->base.kind = kind;
326 res->base.type = type_error_type;
331 * Creates a new invalid expression.
333 static expression_t *create_invalid_expression(void)
335 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
336 expression->base.source_position = token.source_position;
341 * Creates a new invalid statement.
343 static statement_t *create_invalid_statement(void)
345 statement_t *statement = allocate_statement_zero(STATEMENT_INVALID);
346 statement->base.source_position = token.source_position;
351 * Allocate a new empty statement.
353 static statement_t *create_empty_statement(void)
355 statement_t *statement = allocate_statement_zero(STATEMENT_EMPTY);
356 statement->base.source_position = token.source_position;
361 * Returns the size of a type node.
363 * @param kind the type kind
365 static size_t get_type_struct_size(type_kind_t kind)
367 static const size_t sizes[] = {
368 [TYPE_ATOMIC] = sizeof(atomic_type_t),
369 [TYPE_COMPLEX] = sizeof(complex_type_t),
370 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
371 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
372 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
373 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
374 [TYPE_ENUM] = sizeof(enum_type_t),
375 [TYPE_FUNCTION] = sizeof(function_type_t),
376 [TYPE_POINTER] = sizeof(pointer_type_t),
377 [TYPE_ARRAY] = sizeof(array_type_t),
378 [TYPE_BUILTIN] = sizeof(builtin_type_t),
379 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
380 [TYPE_TYPEOF] = sizeof(typeof_type_t),
382 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
383 assert(kind <= TYPE_TYPEOF);
384 assert(sizes[kind] != 0);
389 * Allocate a type node of given kind and initialize all
392 static type_t *allocate_type_zero(type_kind_t kind, const source_position_t *source_position)
394 size_t size = get_type_struct_size(kind);
395 type_t *res = obstack_alloc(type_obst, size);
396 memset(res, 0, size);
398 res->base.kind = kind;
399 res->base.source_position = *source_position;
404 * Returns the size of an initializer node.
406 * @param kind the initializer kind
408 static size_t get_initializer_size(initializer_kind_t kind)
410 static const size_t sizes[] = {
411 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
412 [INITIALIZER_STRING] = sizeof(initializer_string_t),
413 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
414 [INITIALIZER_LIST] = sizeof(initializer_list_t),
415 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
417 assert(kind < sizeof(sizes) / sizeof(*sizes));
418 assert(sizes[kind] != 0);
423 * Allocate an initializer node of given kind and initialize all
426 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
428 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
435 * Free a type from the type obstack.
437 static void free_type(void *type)
439 obstack_free(type_obst, type);
443 * Returns the index of the top element of the environment stack.
445 static size_t environment_top(void)
447 return ARR_LEN(environment_stack);
451 * Returns the index of the top element of the label stack.
453 static size_t label_top(void)
455 return ARR_LEN(label_stack);
459 * Return the next token.
461 static inline void next_token(void)
463 token = lookahead_buffer[lookahead_bufpos];
464 lookahead_buffer[lookahead_bufpos] = lexer_token;
467 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
470 print_token(stderr, &token);
471 fprintf(stderr, "\n");
476 * Return the next token with a given lookahead.
478 static inline const token_t *look_ahead(int num)
480 assert(num > 0 && num <= MAX_LOOKAHEAD);
481 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
482 return &lookahead_buffer[pos];
486 * Adds a token to the token anchor set (a multi-set).
488 static void add_anchor_token(int token_type) {
489 assert(0 <= token_type && token_type < T_LAST_TOKEN);
490 ++token_anchor_set[token_type];
493 static int save_and_reset_anchor_state(int token_type) {
494 assert(0 <= token_type && token_type < T_LAST_TOKEN);
495 int count = token_anchor_set[token_type];
496 token_anchor_set[token_type] = 0;
500 static void restore_anchor_state(int token_type, int count) {
501 assert(0 <= token_type && token_type < T_LAST_TOKEN);
502 token_anchor_set[token_type] = count;
506 * Remove a token from the token anchor set (a multi-set).
508 static void rem_anchor_token(int token_type) {
509 assert(0 <= token_type && token_type < T_LAST_TOKEN);
510 --token_anchor_set[token_type];
513 static bool at_anchor(void) {
516 return token_anchor_set[token.type];
520 * Eat tokens until a matching token is found.
522 static void eat_until_matching_token(int type) {
523 unsigned parenthesis_count = 0;
524 unsigned brace_count = 0;
525 unsigned bracket_count = 0;
526 int end_token = type;
535 while(token.type != end_token ||
536 (parenthesis_count > 0 || brace_count > 0 || bracket_count > 0)) {
540 case '(': ++parenthesis_count; break;
541 case '{': ++brace_count; break;
542 case '[': ++bracket_count; break;
544 if(parenthesis_count > 0)
552 if(bracket_count > 0)
563 * Eat input tokens until an anchor is found.
565 static void eat_until_anchor(void) {
566 if(token.type == T_EOF)
568 while(token_anchor_set[token.type] == 0) {
569 if(token.type == '(' || token.type == '{' || token.type == '[')
570 eat_until_matching_token(token.type);
571 if(token.type == T_EOF)
577 static void eat_block(void) {
578 eat_until_matching_token('{');
579 if(token.type == '}')
584 * eat all token until a ';' is reached or a stop token is found.
586 static void eat_statement(void) {
587 eat_until_matching_token(';');
588 if(token.type == ';')
592 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while(0)
595 * Report a parse error because an expected token was not found.
598 #if defined __GNUC__ && __GNUC__ >= 4
599 __attribute__((sentinel))
601 void parse_error_expected(const char *message, ...)
603 if(message != NULL) {
604 errorf(HERE, "%s", message);
607 va_start(ap, message);
608 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
613 * Report a type error.
615 static void type_error(const char *msg, const source_position_t *source_position,
618 errorf(source_position, "%s, but found type '%T'", msg, type);
622 * Report an incompatible type.
624 static void type_error_incompatible(const char *msg,
625 const source_position_t *source_position, type_t *type1, type_t *type2)
627 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
632 * Expect the the current token is the expected token.
633 * If not, generate an error, eat the current statement,
634 * and goto the end_error label.
636 #define expect(expected) \
638 if(UNLIKELY(token.type != (expected))) { \
639 parse_error_expected(NULL, (expected), NULL); \
640 add_anchor_token(expected); \
641 eat_until_anchor(); \
642 if (token.type == expected) \
644 rem_anchor_token(expected); \
650 static void set_scope(scope_t *new_scope)
653 scope->last_declaration = last_declaration;
657 last_declaration = new_scope->last_declaration;
661 * Search a symbol in a given namespace and returns its declaration or
662 * NULL if this symbol was not found.
664 static declaration_t *get_declaration(const symbol_t *const symbol,
665 const namespace_t namespc)
667 declaration_t *declaration = symbol->declaration;
668 for( ; declaration != NULL; declaration = declaration->symbol_next) {
669 if(declaration->namespc == namespc)
677 * pushs an environment_entry on the environment stack and links the
678 * corresponding symbol to the new entry
680 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
682 symbol_t *symbol = declaration->symbol;
683 namespace_t namespc = (namespace_t) declaration->namespc;
685 /* replace/add declaration into declaration list of the symbol */
686 declaration_t *iter = symbol->declaration;
688 symbol->declaration = declaration;
690 declaration_t *iter_last = NULL;
691 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
692 /* replace an entry? */
693 if(iter->namespc == namespc) {
694 if(iter_last == NULL) {
695 symbol->declaration = declaration;
697 iter_last->symbol_next = declaration;
699 declaration->symbol_next = iter->symbol_next;
704 assert(iter_last->symbol_next == NULL);
705 iter_last->symbol_next = declaration;
709 /* remember old declaration */
711 entry.symbol = symbol;
712 entry.old_declaration = iter;
713 entry.namespc = (unsigned short) namespc;
714 ARR_APP1(stack_entry_t, *stack_ptr, entry);
717 static void environment_push(declaration_t *declaration)
719 assert(declaration->source_position.input_name != NULL);
720 assert(declaration->parent_scope != NULL);
721 stack_push(&environment_stack, declaration);
724 static void label_push(declaration_t *declaration)
726 declaration->parent_scope = ¤t_function->scope;
727 stack_push(&label_stack, declaration);
731 * pops symbols from the environment stack until @p new_top is the top element
733 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
735 stack_entry_t *stack = *stack_ptr;
736 size_t top = ARR_LEN(stack);
739 assert(new_top <= top);
743 for(i = top; i > new_top; --i) {
744 stack_entry_t *entry = &stack[i - 1];
746 declaration_t *old_declaration = entry->old_declaration;
747 symbol_t *symbol = entry->symbol;
748 namespace_t namespc = (namespace_t)entry->namespc;
750 /* replace/remove declaration */
751 declaration_t *declaration = symbol->declaration;
752 assert(declaration != NULL);
753 if(declaration->namespc == namespc) {
754 if(old_declaration == NULL) {
755 symbol->declaration = declaration->symbol_next;
757 symbol->declaration = old_declaration;
760 declaration_t *iter_last = declaration;
761 declaration_t *iter = declaration->symbol_next;
762 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
763 /* replace an entry? */
764 if(iter->namespc == namespc) {
765 assert(iter_last != NULL);
766 iter_last->symbol_next = old_declaration;
767 if(old_declaration != NULL) {
768 old_declaration->symbol_next = iter->symbol_next;
773 assert(iter != NULL);
777 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
780 static void environment_pop_to(size_t new_top)
782 stack_pop_to(&environment_stack, new_top);
785 static void label_pop_to(size_t new_top)
787 stack_pop_to(&label_stack, new_top);
791 static int get_rank(const type_t *type)
793 assert(!is_typeref(type));
794 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
795 * and esp. footnote 108). However we can't fold constants (yet), so we
796 * can't decide whether unsigned int is possible, while int always works.
797 * (unsigned int would be preferable when possible... for stuff like
798 * struct { enum { ... } bla : 4; } ) */
799 if(type->kind == TYPE_ENUM)
800 return ATOMIC_TYPE_INT;
802 assert(type->kind == TYPE_ATOMIC);
803 return type->atomic.akind;
806 static type_t *promote_integer(type_t *type)
808 if(type->kind == TYPE_BITFIELD)
809 type = type->bitfield.base_type;
811 if(get_rank(type) < ATOMIC_TYPE_INT)
818 * Create a cast expression.
820 * @param expression the expression to cast
821 * @param dest_type the destination type
823 static expression_t *create_cast_expression(expression_t *expression,
826 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
828 cast->unary.value = expression;
829 cast->base.type = dest_type;
835 * Check if a given expression represents the 0 pointer constant.
837 static bool is_null_pointer_constant(const expression_t *expression)
839 /* skip void* cast */
840 if(expression->kind == EXPR_UNARY_CAST
841 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
842 expression = expression->unary.value;
845 /* TODO: not correct yet, should be any constant integer expression
846 * which evaluates to 0 */
847 if (expression->kind != EXPR_CONST)
850 type_t *const type = skip_typeref(expression->base.type);
851 if (!is_type_integer(type))
854 return expression->conste.v.int_value == 0;
858 * Create an implicit cast expression.
860 * @param expression the expression to cast
861 * @param dest_type the destination type
863 static expression_t *create_implicit_cast(expression_t *expression,
866 type_t *const source_type = expression->base.type;
868 if (source_type == dest_type)
871 return create_cast_expression(expression, dest_type);
874 /** Implements the rules from § 6.5.16.1 */
875 static type_t *semantic_assign(type_t *orig_type_left,
876 const expression_t *const right,
878 const source_position_t *source_position)
880 type_t *const orig_type_right = right->base.type;
881 type_t *const type_left = skip_typeref(orig_type_left);
882 type_t *const type_right = skip_typeref(orig_type_right);
884 if(is_type_pointer(type_left)) {
885 if(is_null_pointer_constant(right)) {
886 return orig_type_left;
887 } else if(is_type_pointer(type_right)) {
888 type_t *points_to_left
889 = skip_typeref(type_left->pointer.points_to);
890 type_t *points_to_right
891 = skip_typeref(type_right->pointer.points_to);
893 /* the left type has all qualifiers from the right type */
894 unsigned missing_qualifiers
895 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
896 if(missing_qualifiers != 0) {
897 errorf(source_position,
898 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointed-to type", type_left, context, type_right, missing_qualifiers);
899 return orig_type_left;
902 points_to_left = get_unqualified_type(points_to_left);
903 points_to_right = get_unqualified_type(points_to_right);
905 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
906 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
907 return orig_type_left;
910 if (!types_compatible(points_to_left, points_to_right)) {
911 warningf(source_position,
912 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
913 orig_type_left, context, right, orig_type_right);
916 return orig_type_left;
917 } else if(is_type_integer(type_right)) {
918 warningf(source_position,
919 "%s makes pointer '%T' from integer '%T' without a cast",
920 context, orig_type_left, orig_type_right);
921 return orig_type_left;
923 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
924 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
925 && is_type_pointer(type_right))) {
926 return orig_type_left;
927 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
928 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
929 type_t *const unqual_type_left = get_unqualified_type(type_left);
930 type_t *const unqual_type_right = get_unqualified_type(type_right);
931 if (types_compatible(unqual_type_left, unqual_type_right)) {
932 return orig_type_left;
934 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
935 warningf(source_position,
936 "%s makes integer '%T' from pointer '%T' without a cast",
937 context, orig_type_left, orig_type_right);
938 return orig_type_left;
941 if (!is_type_valid(type_left))
944 if (!is_type_valid(type_right))
945 return orig_type_right;
950 static expression_t *parse_constant_expression(void)
952 /* start parsing at precedence 7 (conditional expression) */
953 expression_t *result = parse_sub_expression(7);
955 if(!is_constant_expression(result)) {
956 errorf(&result->base.source_position,
957 "expression '%E' is not constant\n", result);
963 static expression_t *parse_assignment_expression(void)
965 /* start parsing at precedence 2 (assignment expression) */
966 return parse_sub_expression(2);
969 static type_t *make_global_typedef(const char *name, type_t *type)
971 symbol_t *const symbol = symbol_table_insert(name);
973 declaration_t *const declaration = allocate_declaration_zero();
974 declaration->namespc = NAMESPACE_NORMAL;
975 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
976 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
977 declaration->type = type;
978 declaration->symbol = symbol;
979 declaration->source_position = builtin_source_position;
981 record_declaration(declaration);
983 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
984 typedef_type->typedeft.declaration = declaration;
989 static string_t parse_string_literals(void)
991 assert(token.type == T_STRING_LITERAL);
992 string_t result = token.v.string;
996 while (token.type == T_STRING_LITERAL) {
997 result = concat_strings(&result, &token.v.string);
1004 static const char *gnu_attribute_names[GNU_AK_LAST] = {
1005 [GNU_AK_CONST] = "const",
1006 [GNU_AK_VOLATILE] = "volatile",
1007 [GNU_AK_CDECL] = "cdecl",
1008 [GNU_AK_STDCALL] = "stdcall",
1009 [GNU_AK_FASTCALL] = "fastcall",
1010 [GNU_AK_DEPRECATED] = "deprecated",
1011 [GNU_AK_NOINLINE] = "noinline",
1012 [GNU_AK_NORETURN] = "noreturn",
1013 [GNU_AK_NAKED] = "naked",
1014 [GNU_AK_PURE] = "pure",
1015 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1016 [GNU_AK_MALLOC] = "malloc",
1017 [GNU_AK_WEAK] = "weak",
1018 [GNU_AK_CONSTRUCTOR] = "constructor",
1019 [GNU_AK_DESTRUCTOR] = "destructor",
1020 [GNU_AK_NOTHROW] = "nothrow",
1021 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1022 [GNU_AK_COMMON] = "coommon",
1023 [GNU_AK_NOCOMMON] = "nocommon",
1024 [GNU_AK_PACKED] = "packed",
1025 [GNU_AK_SHARED] = "shared",
1026 [GNU_AK_NOTSHARED] = "notshared",
1027 [GNU_AK_USED] = "used",
1028 [GNU_AK_UNUSED] = "unused",
1029 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1030 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1031 [GNU_AK_LONGCALL] = "longcall",
1032 [GNU_AK_SHORTCALL] = "shortcall",
1033 [GNU_AK_LONG_CALL] = "long_call",
1034 [GNU_AK_SHORT_CALL] = "short_call",
1035 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1036 [GNU_AK_INTERRUPT] = "interrupt",
1037 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1038 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1039 [GNU_AK_NESTING] = "nesting",
1040 [GNU_AK_NEAR] = "near",
1041 [GNU_AK_FAR] = "far",
1042 [GNU_AK_SIGNAL] = "signal",
1043 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1044 [GNU_AK_TINY_DATA] = "tiny_data",
1045 [GNU_AK_SAVEALL] = "saveall",
1046 [GNU_AK_FLATTEN] = "flatten",
1047 [GNU_AK_SSEREGPARM] = "sseregparm",
1048 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1049 [GNU_AK_RETURN_TWICE] = "return_twice",
1050 [GNU_AK_MAY_ALIAS] = "may_alias",
1051 [GNU_AK_MS_STRUCT] = "ms_struct",
1052 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1053 [GNU_AK_DLLIMPORT] = "dllimport",
1054 [GNU_AK_DLLEXPORT] = "dllexport",
1055 [GNU_AK_ALIGNED] = "aligned",
1056 [GNU_AK_ALIAS] = "alias",
1057 [GNU_AK_SECTION] = "section",
1058 [GNU_AK_FORMAT] = "format",
1059 [GNU_AK_FORMAT_ARG] = "format_arg",
1060 [GNU_AK_WEAKREF] = "weakref",
1061 [GNU_AK_NONNULL] = "nonnull",
1062 [GNU_AK_TLS_MODEL] = "tls_model",
1063 [GNU_AK_VISIBILITY] = "visibility",
1064 [GNU_AK_REGPARM] = "regparm",
1065 [GNU_AK_MODE] = "mode",
1066 [GNU_AK_MODEL] = "model",
1067 [GNU_AK_TRAP_EXIT] = "trap_exit",
1068 [GNU_AK_SP_SWITCH] = "sp_switch",
1069 [GNU_AK_SENTINEL] = "sentinel"
1073 * compare two string, ignoring double underscores on the second.
1075 static int strcmp_underscore(const char *s1, const char *s2) {
1076 if(s2[0] == '_' && s2[1] == '_') {
1078 size_t l1 = strlen(s1);
1079 if(l1 + 2 != strlen(s2)) {
1083 return strncmp(s1, s2, l1);
1085 return strcmp(s1, s2);
1089 * Allocate a new gnu temporal attribute.
1091 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind) {
1092 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1093 attribute->kind = kind;
1094 attribute->next = NULL;
1095 attribute->invalid = false;
1096 attribute->have_arguments = false;
1103 * parse one constant expression argument.
1105 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute) {
1106 expression_t *expression;
1107 add_anchor_token(')');
1108 expression = parse_constant_expression();
1109 rem_anchor_token(')');
1114 attribute->invalid = true;
1118 * parse a list of constant expressions arguments.
1120 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute) {
1121 expression_t *expression;
1122 add_anchor_token(')');
1123 add_anchor_token(',');
1125 expression = parse_constant_expression();
1126 if(token.type != ',')
1130 rem_anchor_token(',');
1131 rem_anchor_token(')');
1136 attribute->invalid = true;
1140 * parse one string literal argument.
1142 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1145 add_anchor_token('(');
1146 if(token.type != T_STRING_LITERAL) {
1147 parse_error_expected("while parsing attribute directive",
1148 T_STRING_LITERAL, NULL);
1151 *string = parse_string_literals();
1152 rem_anchor_token('(');
1156 attribute->invalid = true;
1160 * parse one tls model.
1162 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute) {
1163 static const char *tls_models[] = {
1169 string_t string = { NULL, 0 };
1170 parse_gnu_attribute_string_arg(attribute, &string);
1171 if(string.begin != NULL) {
1172 for(size_t i = 0; i < 4; ++i) {
1173 if(strcmp(tls_models[i], string.begin) == 0) {
1174 attribute->u.value = i;
1179 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1180 attribute->invalid = true;
1184 * parse one tls model.
1186 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute) {
1187 static const char *visibilities[] = {
1193 string_t string = { NULL, 0 };
1194 parse_gnu_attribute_string_arg(attribute, &string);
1195 if(string.begin != NULL) {
1196 for(size_t i = 0; i < 4; ++i) {
1197 if(strcmp(visibilities[i], string.begin) == 0) {
1198 attribute->u.value = i;
1203 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1204 attribute->invalid = true;
1208 * parse one (code) model.
1210 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute) {
1211 static const char *visibilities[] = {
1216 string_t string = { NULL, 0 };
1217 parse_gnu_attribute_string_arg(attribute, &string);
1218 if(string.begin != NULL) {
1219 for(int i = 0; i < 3; ++i) {
1220 if(strcmp(visibilities[i], string.begin) == 0) {
1221 attribute->u.value = i;
1226 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1227 attribute->invalid = true;
1230 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1232 /* TODO: find out what is allowed here... */
1234 /* at least: byte, word, pointer, list of machine modes
1235 * __XXX___ is interpreted as XXX */
1236 add_anchor_token(')');
1237 expect(T_IDENTIFIER);
1238 rem_anchor_token(')');
1242 attribute->invalid = true;
1246 * parse one interrupt argument.
1248 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute) {
1249 static const char *interrupts[] = {
1256 string_t string = { NULL, 0 };
1257 parse_gnu_attribute_string_arg(attribute, &string);
1258 if(string.begin != NULL) {
1259 for(size_t i = 0; i < 5; ++i) {
1260 if(strcmp(interrupts[i], string.begin) == 0) {
1261 attribute->u.value = i;
1266 errorf(HERE, "'%s' is an interrupt", string.begin);
1267 attribute->invalid = true;
1271 * parse ( identifier, const expression, const expression )
1273 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute) {
1274 static const char *format_names[] = {
1282 if(token.type != T_IDENTIFIER) {
1283 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1286 const char *name = token.v.symbol->string;
1287 for(i = 0; i < 4; ++i) {
1288 if(strcmp_underscore(format_names[i], name) == 0)
1292 if(warning.attribute)
1293 warningf(HERE, "'%s' is an unrecognized format function type", name);
1298 add_anchor_token(')');
1299 add_anchor_token(',');
1300 parse_constant_expression();
1301 rem_anchor_token(',');
1302 rem_anchor_token('(');
1305 add_anchor_token(')');
1306 parse_constant_expression();
1307 rem_anchor_token('(');
1311 attribute->u.value = true;
1315 * Parse one GNU attribute.
1317 * Note that attribute names can be specified WITH or WITHOUT
1318 * double underscores, ie const or __const__.
1320 * The following attributes are parsed without arguments
1345 * no_instrument_function
1346 * warn_unused_result
1363 * externally_visible
1371 * The following attributes are parsed with arguments
1372 * aligned( const expression )
1373 * alias( string literal )
1374 * section( string literal )
1375 * format( identifier, const expression, const expression )
1376 * format_arg( const expression )
1377 * tls_model( string literal )
1378 * visibility( string literal )
1379 * regparm( const expression )
1380 * model( string leteral )
1381 * trap_exit( const expression )
1382 * sp_switch( string literal )
1384 * The following attributes might have arguments
1385 * weak_ref( string literal )
1386 * non_null( const expression // ',' )
1387 * interrupt( string literal )
1388 * sentinel( constant expression )
1390 static void parse_gnu_attribute(gnu_attribute_t **attributes)
1392 gnu_attribute_t *head = *attributes;
1393 gnu_attribute_t *last = *attributes;
1394 gnu_attribute_t *attribute;
1396 eat(T___attribute__);
1400 if(token.type != ')') {
1401 /* find the end of the list */
1403 while(last->next != NULL)
1407 /* non-empty attribute list */
1410 if(token.type == T_const) {
1412 } else if(token.type == T_volatile) {
1414 } else if(token.type == T_cdecl) {
1415 /* __attribute__((cdecl)), WITH ms mode */
1417 } else if(token.type != T_IDENTIFIER) {
1418 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1421 const symbol_t *sym = token.v.symbol;
1426 for(i = 0; i < GNU_AK_LAST; ++i) {
1427 if(strcmp_underscore(gnu_attribute_names[i], name) == 0)
1430 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1433 if(kind == GNU_AK_LAST) {
1434 if(warning.attribute)
1435 warningf(HERE, "'%s' attribute directive ignored", name);
1437 /* skip possible arguments */
1438 if(token.type == '(') {
1439 eat_until_matching_token(')');
1442 /* check for arguments */
1443 attribute = allocate_gnu_attribute(kind);
1444 if(token.type == '(') {
1446 if(token.type == ')') {
1447 /* empty args are allowed */
1450 attribute->have_arguments = true;
1455 case GNU_AK_VOLATILE:
1457 case GNU_AK_STDCALL:
1458 case GNU_AK_FASTCALL:
1459 case GNU_AK_DEPRECATED:
1460 case GNU_AK_NOINLINE:
1461 case GNU_AK_NORETURN:
1464 case GNU_AK_ALWAYS_INLINE:
1467 case GNU_AK_CONSTRUCTOR:
1468 case GNU_AK_DESTRUCTOR:
1469 case GNU_AK_NOTHROW:
1470 case GNU_AK_TRANSPARENT_UNION:
1472 case GNU_AK_NOCOMMON:
1475 case GNU_AK_NOTSHARED:
1478 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1479 case GNU_AK_WARN_UNUSED_RESULT:
1480 case GNU_AK_LONGCALL:
1481 case GNU_AK_SHORTCALL:
1482 case GNU_AK_LONG_CALL:
1483 case GNU_AK_SHORT_CALL:
1484 case GNU_AK_FUNCTION_VECTOR:
1485 case GNU_AK_INTERRUPT_HANDLER:
1486 case GNU_AK_NMI_HANDLER:
1487 case GNU_AK_NESTING:
1491 case GNU_AK_EIGTHBIT_DATA:
1492 case GNU_AK_TINY_DATA:
1493 case GNU_AK_SAVEALL:
1494 case GNU_AK_FLATTEN:
1495 case GNU_AK_SSEREGPARM:
1496 case GNU_AK_EXTERNALLY_VISIBLE:
1497 case GNU_AK_RETURN_TWICE:
1498 case GNU_AK_MAY_ALIAS:
1499 case GNU_AK_MS_STRUCT:
1500 case GNU_AK_GCC_STRUCT:
1501 case GNU_AK_DLLIMPORT:
1502 case GNU_AK_DLLEXPORT:
1503 if(attribute->have_arguments) {
1504 /* should have no arguments */
1505 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1506 eat_until_matching_token('(');
1507 /* we have already consumed '(', so we stop before ')', eat it */
1509 attribute->invalid = true;
1513 case GNU_AK_ALIGNED:
1514 case GNU_AK_FORMAT_ARG:
1515 case GNU_AK_REGPARM:
1516 case GNU_AK_TRAP_EXIT:
1517 if(!attribute->have_arguments) {
1518 /* should have arguments */
1519 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1520 attribute->invalid = true;
1522 parse_gnu_attribute_const_arg(attribute);
1525 case GNU_AK_SECTION:
1526 case GNU_AK_SP_SWITCH:
1527 if(!attribute->have_arguments) {
1528 /* should have arguments */
1529 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1530 attribute->invalid = true;
1532 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1535 if(!attribute->have_arguments) {
1536 /* should have arguments */
1537 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1538 attribute->invalid = true;
1540 parse_gnu_attribute_format_args(attribute);
1542 case GNU_AK_WEAKREF:
1543 /* may have one string argument */
1544 if(attribute->have_arguments)
1545 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1547 case GNU_AK_NONNULL:
1548 if(attribute->have_arguments)
1549 parse_gnu_attribute_const_arg_list(attribute);
1551 case GNU_AK_TLS_MODEL:
1552 if(!attribute->have_arguments) {
1553 /* should have arguments */
1554 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1556 parse_gnu_attribute_tls_model_arg(attribute);
1558 case GNU_AK_VISIBILITY:
1559 if(!attribute->have_arguments) {
1560 /* should have arguments */
1561 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1563 parse_gnu_attribute_visibility_arg(attribute);
1566 if(!attribute->have_arguments) {
1567 /* should have arguments */
1568 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1570 parse_gnu_attribute_model_arg(attribute);
1574 if(!attribute->have_arguments) {
1575 /* should have arguments */
1576 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1578 parse_gnu_attribute_mode_arg(attribute);
1581 case GNU_AK_INTERRUPT:
1582 /* may have one string argument */
1583 if(attribute->have_arguments)
1584 parse_gnu_attribute_interrupt_arg(attribute);
1586 case GNU_AK_SENTINEL:
1587 /* may have one string argument */
1588 if(attribute->have_arguments)
1589 parse_gnu_attribute_const_arg(attribute);
1592 /* already handled */
1596 if(attribute != NULL) {
1598 last->next = attribute;
1601 head = last = attribute;
1605 if(token.type != ',')
1617 * Parse GNU attributes.
1619 static void parse_attributes(gnu_attribute_t **attributes)
1622 switch(token.type) {
1623 case T___attribute__: {
1624 parse_gnu_attribute(attributes);
1630 if(token.type != T_STRING_LITERAL) {
1631 parse_error_expected("while parsing assembler attribute",
1632 T_STRING_LITERAL, NULL);
1633 eat_until_matching_token('(');
1636 parse_string_literals();
1641 goto attributes_finished;
1645 attributes_finished:
1650 static designator_t *parse_designation(void)
1652 designator_t *result = NULL;
1653 designator_t *last = NULL;
1656 designator_t *designator;
1657 switch(token.type) {
1659 designator = allocate_ast_zero(sizeof(designator[0]));
1660 designator->source_position = token.source_position;
1662 add_anchor_token(']');
1663 designator->array_index = parse_constant_expression();
1664 rem_anchor_token(']');
1668 designator = allocate_ast_zero(sizeof(designator[0]));
1669 designator->source_position = token.source_position;
1671 if(token.type != T_IDENTIFIER) {
1672 parse_error_expected("while parsing designator",
1673 T_IDENTIFIER, NULL);
1676 designator->symbol = token.v.symbol;
1684 assert(designator != NULL);
1686 last->next = designator;
1688 result = designator;
1696 static initializer_t *initializer_from_string(array_type_t *type,
1697 const string_t *const string)
1699 /* TODO: check len vs. size of array type */
1702 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1703 initializer->string.string = *string;
1708 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1709 wide_string_t *const string)
1711 /* TODO: check len vs. size of array type */
1714 initializer_t *const initializer =
1715 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1716 initializer->wide_string.string = *string;
1722 * Build an initializer from a given expression.
1724 static initializer_t *initializer_from_expression(type_t *orig_type,
1725 expression_t *expression)
1727 /* TODO check that expression is a constant expression */
1729 /* § 6.7.8.14/15 char array may be initialized by string literals */
1730 type_t *type = skip_typeref(orig_type);
1731 type_t *expr_type_orig = expression->base.type;
1732 type_t *expr_type = skip_typeref(expr_type_orig);
1733 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1734 array_type_t *const array_type = &type->array;
1735 type_t *const element_type = skip_typeref(array_type->element_type);
1737 if (element_type->kind == TYPE_ATOMIC) {
1738 atomic_type_kind_t akind = element_type->atomic.akind;
1739 switch (expression->kind) {
1740 case EXPR_STRING_LITERAL:
1741 if (akind == ATOMIC_TYPE_CHAR
1742 || akind == ATOMIC_TYPE_SCHAR
1743 || akind == ATOMIC_TYPE_UCHAR) {
1744 return initializer_from_string(array_type,
1745 &expression->string.value);
1748 case EXPR_WIDE_STRING_LITERAL: {
1749 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1750 if (get_unqualified_type(element_type) == bare_wchar_type) {
1751 return initializer_from_wide_string(array_type,
1752 &expression->wide_string.value);
1762 type_t *const res_type = semantic_assign(type, expression, "initializer",
1763 &expression->base.source_position);
1764 if (res_type == NULL)
1767 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1768 result->value.value = create_implicit_cast(expression, res_type);
1774 * Checks if a given expression can be used as an constant initializer.
1776 static bool is_initializer_constant(const expression_t *expression)
1778 return is_constant_expression(expression)
1779 || is_address_constant(expression);
1783 * Parses an scalar initializer.
1785 * § 6.7.8.11; eat {} without warning
1787 static initializer_t *parse_scalar_initializer(type_t *type,
1788 bool must_be_constant)
1790 /* there might be extra {} hierarchies */
1792 while(token.type == '{') {
1795 warningf(HERE, "extra curly braces around scalar initializer");
1800 expression_t *expression = parse_assignment_expression();
1801 if(must_be_constant && !is_initializer_constant(expression)) {
1802 errorf(&expression->base.source_position,
1803 "Initialisation expression '%E' is not constant\n",
1807 initializer_t *initializer = initializer_from_expression(type, expression);
1809 if(initializer == NULL) {
1810 errorf(&expression->base.source_position,
1811 "expression '%E' (type '%T') doesn't match expected type '%T'",
1812 expression, expression->base.type, type);
1817 bool additional_warning_displayed = false;
1819 if(token.type == ',') {
1822 if(token.type != '}') {
1823 if(!additional_warning_displayed) {
1824 warningf(HERE, "additional elements in scalar initializer");
1825 additional_warning_displayed = true;
1836 * An entry in the type path.
1838 typedef struct type_path_entry_t type_path_entry_t;
1839 struct type_path_entry_t {
1840 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1842 size_t index; /**< For array types: the current index. */
1843 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1848 * A type path expression a position inside compound or array types.
1850 typedef struct type_path_t type_path_t;
1851 struct type_path_t {
1852 type_path_entry_t *path; /**< An flexible array containing the current path. */
1853 type_t *top_type; /**< type of the element the path points */
1854 size_t max_index; /**< largest index in outermost array */
1858 * Prints a type path for debugging.
1860 static __attribute__((unused)) void debug_print_type_path(
1861 const type_path_t *path)
1863 size_t len = ARR_LEN(path->path);
1865 for(size_t i = 0; i < len; ++i) {
1866 const type_path_entry_t *entry = & path->path[i];
1868 type_t *type = skip_typeref(entry->type);
1869 if(is_type_compound(type)) {
1870 /* in gcc mode structs can have no members */
1871 if(entry->v.compound_entry == NULL) {
1875 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
1876 } else if(is_type_array(type)) {
1877 fprintf(stderr, "[%zd]", entry->v.index);
1879 fprintf(stderr, "-INVALID-");
1882 if(path->top_type != NULL) {
1883 fprintf(stderr, " (");
1884 print_type(path->top_type);
1885 fprintf(stderr, ")");
1890 * Return the top type path entry, ie. in a path
1891 * (type).a.b returns the b.
1893 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1895 size_t len = ARR_LEN(path->path);
1897 return &path->path[len-1];
1901 * Enlarge the type path by an (empty) element.
1903 static type_path_entry_t *append_to_type_path(type_path_t *path)
1905 size_t len = ARR_LEN(path->path);
1906 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1908 type_path_entry_t *result = & path->path[len];
1909 memset(result, 0, sizeof(result[0]));
1914 * Descending into a sub-type. Enter the scope of the current
1917 static void descend_into_subtype(type_path_t *path)
1919 type_t *orig_top_type = path->top_type;
1920 type_t *top_type = skip_typeref(orig_top_type);
1922 assert(is_type_compound(top_type) || is_type_array(top_type));
1924 type_path_entry_t *top = append_to_type_path(path);
1925 top->type = top_type;
1927 if(is_type_compound(top_type)) {
1928 declaration_t *declaration = top_type->compound.declaration;
1929 declaration_t *entry = declaration->scope.declarations;
1930 top->v.compound_entry = entry;
1933 path->top_type = entry->type;
1935 path->top_type = NULL;
1938 assert(is_type_array(top_type));
1941 path->top_type = top_type->array.element_type;
1946 * Pop an entry from the given type path, ie. returning from
1947 * (type).a.b to (type).a
1949 static void ascend_from_subtype(type_path_t *path)
1951 type_path_entry_t *top = get_type_path_top(path);
1953 path->top_type = top->type;
1955 size_t len = ARR_LEN(path->path);
1956 ARR_RESIZE(type_path_entry_t, path->path, len-1);
1960 * Pop entries from the given type path until the given
1961 * path level is reached.
1963 static void ascend_to(type_path_t *path, size_t top_path_level)
1965 size_t len = ARR_LEN(path->path);
1967 while(len > top_path_level) {
1968 ascend_from_subtype(path);
1969 len = ARR_LEN(path->path);
1973 static bool walk_designator(type_path_t *path, const designator_t *designator,
1974 bool used_in_offsetof)
1976 for( ; designator != NULL; designator = designator->next) {
1977 type_path_entry_t *top = get_type_path_top(path);
1978 type_t *orig_type = top->type;
1980 type_t *type = skip_typeref(orig_type);
1982 if(designator->symbol != NULL) {
1983 symbol_t *symbol = designator->symbol;
1984 if(!is_type_compound(type)) {
1985 if(is_type_valid(type)) {
1986 errorf(&designator->source_position,
1987 "'.%Y' designator used for non-compound type '%T'",
1993 declaration_t *declaration = type->compound.declaration;
1994 declaration_t *iter = declaration->scope.declarations;
1995 for( ; iter != NULL; iter = iter->next) {
1996 if(iter->symbol == symbol) {
2001 errorf(&designator->source_position,
2002 "'%T' has no member named '%Y'", orig_type, symbol);
2005 if(used_in_offsetof) {
2006 type_t *real_type = skip_typeref(iter->type);
2007 if(real_type->kind == TYPE_BITFIELD) {
2008 errorf(&designator->source_position,
2009 "offsetof designator '%Y' may not specify bitfield",
2015 top->type = orig_type;
2016 top->v.compound_entry = iter;
2017 orig_type = iter->type;
2019 expression_t *array_index = designator->array_index;
2020 assert(designator->array_index != NULL);
2022 if(!is_type_array(type)) {
2023 if(is_type_valid(type)) {
2024 errorf(&designator->source_position,
2025 "[%E] designator used for non-array type '%T'",
2026 array_index, orig_type);
2030 if(!is_type_valid(array_index->base.type)) {
2034 long index = fold_constant(array_index);
2035 if(!used_in_offsetof) {
2037 errorf(&designator->source_position,
2038 "array index [%E] must be positive", array_index);
2041 if(type->array.size_constant == true) {
2042 long array_size = type->array.size;
2043 if(index >= array_size) {
2044 errorf(&designator->source_position,
2045 "designator [%E] (%d) exceeds array size %d",
2046 array_index, index, array_size);
2052 top->type = orig_type;
2053 top->v.index = (size_t) index;
2054 orig_type = type->array.element_type;
2056 path->top_type = orig_type;
2058 if(designator->next != NULL) {
2059 descend_into_subtype(path);
2068 static void advance_current_object(type_path_t *path, size_t top_path_level)
2070 type_path_entry_t *top = get_type_path_top(path);
2072 type_t *type = skip_typeref(top->type);
2073 if(is_type_union(type)) {
2074 /* in unions only the first element is initialized */
2075 top->v.compound_entry = NULL;
2076 } else if(is_type_struct(type)) {
2077 declaration_t *entry = top->v.compound_entry;
2079 entry = entry->next;
2080 top->v.compound_entry = entry;
2082 path->top_type = entry->type;
2086 assert(is_type_array(type));
2090 if(!type->array.size_constant || top->v.index < type->array.size) {
2095 /* we're past the last member of the current sub-aggregate, try if we
2096 * can ascend in the type hierarchy and continue with another subobject */
2097 size_t len = ARR_LEN(path->path);
2099 if(len > top_path_level) {
2100 ascend_from_subtype(path);
2101 advance_current_object(path, top_path_level);
2103 path->top_type = NULL;
2108 * skip until token is found.
2110 static void skip_until(int type) {
2111 while(token.type != type) {
2112 if(token.type == T_EOF)
2119 * skip any {...} blocks until a closing bracket is reached.
2121 static void skip_initializers(void)
2123 if(token.type == '{')
2126 while(token.type != '}') {
2127 if(token.type == T_EOF)
2129 if(token.type == '{') {
2137 static initializer_t *create_empty_initializer(void)
2139 static initializer_t empty_initializer
2140 = { .list = { { INITIALIZER_LIST }, 0 } };
2141 return &empty_initializer;
2145 * Parse a part of an initialiser for a struct or union,
2147 static initializer_t *parse_sub_initializer(type_path_t *path,
2148 type_t *outer_type, size_t top_path_level,
2149 parse_initializer_env_t *env)
2151 if(token.type == '}') {
2152 /* empty initializer */
2153 return create_empty_initializer();
2156 type_t *orig_type = path->top_type;
2157 type_t *type = NULL;
2159 if (orig_type == NULL) {
2160 /* We are initializing an empty compound. */
2162 type = skip_typeref(orig_type);
2164 /* we can't do usefull stuff if we didn't even parse the type. Skip the
2165 * initializers in this case. */
2166 if(!is_type_valid(type)) {
2167 skip_initializers();
2168 return create_empty_initializer();
2172 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2175 designator_t *designator = NULL;
2176 if(token.type == '.' || token.type == '[') {
2177 designator = parse_designation();
2179 /* reset path to toplevel, evaluate designator from there */
2180 ascend_to(path, top_path_level);
2181 if(!walk_designator(path, designator, false)) {
2182 /* can't continue after designation error */
2186 initializer_t *designator_initializer
2187 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2188 designator_initializer->designator.designator = designator;
2189 ARR_APP1(initializer_t*, initializers, designator_initializer);
2194 if(token.type == '{') {
2195 if(type != NULL && is_type_scalar(type)) {
2196 sub = parse_scalar_initializer(type, env->must_be_constant);
2200 if (env->declaration != NULL)
2201 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2202 env->declaration->symbol);
2204 errorf(HERE, "extra brace group at end of initializer");
2206 descend_into_subtype(path);
2208 add_anchor_token('}');
2209 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2211 rem_anchor_token('}');
2214 ascend_from_subtype(path);
2218 goto error_parse_next;
2222 /* must be an expression */
2223 expression_t *expression = parse_assignment_expression();
2225 if(env->must_be_constant && !is_initializer_constant(expression)) {
2226 errorf(&expression->base.source_position,
2227 "Initialisation expression '%E' is not constant\n",
2232 /* we are already outside, ... */
2236 /* handle { "string" } special case */
2237 if((expression->kind == EXPR_STRING_LITERAL
2238 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2239 && outer_type != NULL) {
2240 sub = initializer_from_expression(outer_type, expression);
2242 if(token.type == ',') {
2245 if(token.type != '}') {
2246 warningf(HERE, "excessive elements in initializer for type '%T'",
2249 /* TODO: eat , ... */
2254 /* descend into subtypes until expression matches type */
2256 orig_type = path->top_type;
2257 type = skip_typeref(orig_type);
2259 sub = initializer_from_expression(orig_type, expression);
2263 if(!is_type_valid(type)) {
2266 if(is_type_scalar(type)) {
2267 errorf(&expression->base.source_position,
2268 "expression '%E' doesn't match expected type '%T'",
2269 expression, orig_type);
2273 descend_into_subtype(path);
2277 /* update largest index of top array */
2278 const type_path_entry_t *first = &path->path[0];
2279 type_t *first_type = first->type;
2280 first_type = skip_typeref(first_type);
2281 if(is_type_array(first_type)) {
2282 size_t index = first->v.index;
2283 if(index > path->max_index)
2284 path->max_index = index;
2288 /* append to initializers list */
2289 ARR_APP1(initializer_t*, initializers, sub);
2292 if(env->declaration != NULL)
2293 warningf(HERE, "excess elements in struct initializer for '%Y'",
2294 env->declaration->symbol);
2296 warningf(HERE, "excess elements in struct initializer");
2300 if(token.type == '}') {
2304 if(token.type == '}') {
2309 /* advance to the next declaration if we are not at the end */
2310 advance_current_object(path, top_path_level);
2311 orig_type = path->top_type;
2312 if(orig_type != NULL)
2313 type = skip_typeref(orig_type);
2319 size_t len = ARR_LEN(initializers);
2320 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2321 initializer_t *result = allocate_ast_zero(size);
2322 result->kind = INITIALIZER_LIST;
2323 result->list.len = len;
2324 memcpy(&result->list.initializers, initializers,
2325 len * sizeof(initializers[0]));
2327 DEL_ARR_F(initializers);
2328 ascend_to(path, top_path_level+1);
2333 skip_initializers();
2334 DEL_ARR_F(initializers);
2335 ascend_to(path, top_path_level+1);
2340 * Parses an initializer. Parsers either a compound literal
2341 * (env->declaration == NULL) or an initializer of a declaration.
2343 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2345 type_t *type = skip_typeref(env->type);
2346 initializer_t *result = NULL;
2349 if(is_type_scalar(type)) {
2350 result = parse_scalar_initializer(type, env->must_be_constant);
2351 } else if(token.type == '{') {
2355 memset(&path, 0, sizeof(path));
2356 path.top_type = env->type;
2357 path.path = NEW_ARR_F(type_path_entry_t, 0);
2359 descend_into_subtype(&path);
2361 add_anchor_token('}');
2362 result = parse_sub_initializer(&path, env->type, 1, env);
2363 rem_anchor_token('}');
2365 max_index = path.max_index;
2366 DEL_ARR_F(path.path);
2370 /* parse_scalar_initializer() also works in this case: we simply
2371 * have an expression without {} around it */
2372 result = parse_scalar_initializer(type, env->must_be_constant);
2375 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2376 * the array type size */
2377 if(is_type_array(type) && type->array.size_expression == NULL
2378 && result != NULL) {
2380 switch (result->kind) {
2381 case INITIALIZER_LIST:
2382 size = max_index + 1;
2385 case INITIALIZER_STRING:
2386 size = result->string.string.size;
2389 case INITIALIZER_WIDE_STRING:
2390 size = result->wide_string.string.size;
2394 internal_errorf(HERE, "invalid initializer type");
2397 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2398 cnst->base.type = type_size_t;
2399 cnst->conste.v.int_value = size;
2401 type_t *new_type = duplicate_type(type);
2403 new_type->array.size_expression = cnst;
2404 new_type->array.size_constant = true;
2405 new_type->array.size = size;
2406 env->type = new_type;
2414 static declaration_t *append_declaration(declaration_t *declaration);
2416 static declaration_t *parse_compound_type_specifier(bool is_struct)
2418 gnu_attribute_t *attributes = NULL;
2425 symbol_t *symbol = NULL;
2426 declaration_t *declaration = NULL;
2428 if (token.type == T___attribute__) {
2429 parse_attributes(&attributes);
2432 if(token.type == T_IDENTIFIER) {
2433 symbol = token.v.symbol;
2437 declaration = get_declaration(symbol, NAMESPACE_STRUCT);
2439 declaration = get_declaration(symbol, NAMESPACE_UNION);
2441 } else if(token.type != '{') {
2443 parse_error_expected("while parsing struct type specifier",
2444 T_IDENTIFIER, '{', NULL);
2446 parse_error_expected("while parsing union type specifier",
2447 T_IDENTIFIER, '{', NULL);
2453 if(declaration == NULL) {
2454 declaration = allocate_declaration_zero();
2455 declaration->namespc =
2456 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2457 declaration->source_position = token.source_position;
2458 declaration->symbol = symbol;
2459 declaration->parent_scope = scope;
2460 if (symbol != NULL) {
2461 environment_push(declaration);
2463 append_declaration(declaration);
2466 if(token.type == '{') {
2467 if (declaration->init.complete) {
2468 assert(symbol != NULL);
2469 errorf(HERE, "multiple definitions of '%s %Y'",
2470 is_struct ? "struct" : "union", symbol);
2471 declaration->scope.declarations = NULL;
2473 declaration->init.complete = true;
2475 parse_compound_type_entries(declaration);
2476 parse_attributes(&attributes);
2482 static void parse_enum_entries(type_t *const enum_type)
2486 if(token.type == '}') {
2488 errorf(HERE, "empty enum not allowed");
2492 add_anchor_token('}');
2494 if(token.type != T_IDENTIFIER) {
2495 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2497 rem_anchor_token('}');
2501 declaration_t *const entry = allocate_declaration_zero();
2502 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
2503 entry->type = enum_type;
2504 entry->symbol = token.v.symbol;
2505 entry->source_position = token.source_position;
2508 if(token.type == '=') {
2510 expression_t *value = parse_constant_expression();
2512 value = create_implicit_cast(value, enum_type);
2513 entry->init.enum_value = value;
2518 record_declaration(entry);
2520 if(token.type != ',')
2523 } while(token.type != '}');
2524 rem_anchor_token('}');
2532 static type_t *parse_enum_specifier(void)
2534 gnu_attribute_t *attributes = NULL;
2535 declaration_t *declaration;
2539 if(token.type == T_IDENTIFIER) {
2540 symbol = token.v.symbol;
2543 declaration = get_declaration(symbol, NAMESPACE_ENUM);
2544 } else if(token.type != '{') {
2545 parse_error_expected("while parsing enum type specifier",
2546 T_IDENTIFIER, '{', NULL);
2553 if(declaration == NULL) {
2554 declaration = allocate_declaration_zero();
2555 declaration->namespc = NAMESPACE_ENUM;
2556 declaration->source_position = token.source_position;
2557 declaration->symbol = symbol;
2558 declaration->parent_scope = scope;
2561 type_t *const type = allocate_type_zero(TYPE_ENUM, &declaration->source_position);
2562 type->enumt.declaration = declaration;
2564 if(token.type == '{') {
2565 if(declaration->init.complete) {
2566 errorf(HERE, "multiple definitions of enum %Y", symbol);
2568 if (symbol != NULL) {
2569 environment_push(declaration);
2571 append_declaration(declaration);
2572 declaration->init.complete = true;
2574 parse_enum_entries(type);
2575 parse_attributes(&attributes);
2582 * if a symbol is a typedef to another type, return true
2584 static bool is_typedef_symbol(symbol_t *symbol)
2586 const declaration_t *const declaration =
2587 get_declaration(symbol, NAMESPACE_NORMAL);
2589 declaration != NULL &&
2590 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
2593 static type_t *parse_typeof(void)
2600 add_anchor_token(')');
2602 expression_t *expression = NULL;
2605 switch(token.type) {
2606 case T___extension__:
2607 /* this can be a prefix to a typename or an expression */
2608 /* we simply eat it now. */
2611 } while(token.type == T___extension__);
2615 if(is_typedef_symbol(token.v.symbol)) {
2616 type = parse_typename();
2618 expression = parse_expression();
2619 type = expression->base.type;
2624 type = parse_typename();
2628 expression = parse_expression();
2629 type = expression->base.type;
2633 rem_anchor_token(')');
2636 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, &expression->base.source_position);
2637 typeof_type->typeoft.expression = expression;
2638 typeof_type->typeoft.typeof_type = type;
2646 SPECIFIER_SIGNED = 1 << 0,
2647 SPECIFIER_UNSIGNED = 1 << 1,
2648 SPECIFIER_LONG = 1 << 2,
2649 SPECIFIER_INT = 1 << 3,
2650 SPECIFIER_DOUBLE = 1 << 4,
2651 SPECIFIER_CHAR = 1 << 5,
2652 SPECIFIER_SHORT = 1 << 6,
2653 SPECIFIER_LONG_LONG = 1 << 7,
2654 SPECIFIER_FLOAT = 1 << 8,
2655 SPECIFIER_BOOL = 1 << 9,
2656 SPECIFIER_VOID = 1 << 10,
2657 SPECIFIER_INT8 = 1 << 11,
2658 SPECIFIER_INT16 = 1 << 12,
2659 SPECIFIER_INT32 = 1 << 13,
2660 SPECIFIER_INT64 = 1 << 14,
2661 SPECIFIER_INT128 = 1 << 15,
2662 SPECIFIER_COMPLEX = 1 << 16,
2663 SPECIFIER_IMAGINARY = 1 << 17,
2666 static type_t *create_builtin_type(symbol_t *const symbol,
2667 type_t *const real_type)
2669 type_t *type = allocate_type_zero(TYPE_BUILTIN, &builtin_source_position);
2670 type->builtin.symbol = symbol;
2671 type->builtin.real_type = real_type;
2673 type_t *result = typehash_insert(type);
2674 if(type != result) {
2681 static type_t *get_typedef_type(symbol_t *symbol)
2683 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
2684 if(declaration == NULL ||
2685 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
2688 type_t *type = allocate_type_zero(TYPE_TYPEDEF, &declaration->source_position);
2689 type->typedeft.declaration = declaration;
2695 * check for the allowed MS alignment values.
2697 static bool check_elignment_value(long long intvalue) {
2698 if(intvalue < 1 || intvalue > 8192) {
2699 errorf(HERE, "illegal alignment value");
2702 unsigned v = (unsigned)intvalue;
2703 for(unsigned i = 1; i <= 8192; i += i) {
2707 errorf(HERE, "alignment must be power of two");
2711 #define DET_MOD(name, tag) do { \
2712 if(*modifiers & tag) warningf(HERE, #name " used more than once"); \
2713 *modifiers |= tag; \
2716 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
2718 decl_modifiers_t *modifiers = &specifiers->decl_modifiers;
2721 if(token.type == T_restrict) {
2723 DET_MOD(restrict, DM_RESTRICT);
2725 } else if(token.type != T_IDENTIFIER)
2727 symbol_t *symbol = token.v.symbol;
2728 if(symbol == sym_align) {
2731 if(token.type != T_INTEGER)
2733 if(check_elignment_value(token.v.intvalue)) {
2734 if(specifiers->alignment != 0)
2735 warningf(HERE, "align used more than once");
2736 specifiers->alignment = (unsigned char)token.v.intvalue;
2740 } else if(symbol == sym_allocate) {
2743 if(token.type != T_IDENTIFIER)
2745 (void)token.v.symbol;
2747 } else if(symbol == sym_dllimport) {
2749 DET_MOD(dllimport, DM_DLLIMPORT);
2750 } else if(symbol == sym_dllexport) {
2752 DET_MOD(dllexport, DM_DLLEXPORT);
2753 } else if(symbol == sym_thread) {
2755 DET_MOD(thread, DM_THREAD);
2756 } else if(symbol == sym_naked) {
2758 DET_MOD(naked, DM_NAKED);
2759 } else if(symbol == sym_noinline) {
2761 DET_MOD(noinline, DM_NOINLINE);
2762 } else if(symbol == sym_noreturn) {
2764 DET_MOD(noreturn, DM_NORETURN);
2765 } else if(symbol == sym_nothrow) {
2767 DET_MOD(nothrow, DM_NOTHROW);
2768 } else if(symbol == sym_novtable) {
2770 DET_MOD(novtable, DM_NOVTABLE);
2771 } else if(symbol == sym_property) {
2775 bool is_get = false;
2776 if(token.type != T_IDENTIFIER)
2778 if(token.v.symbol == sym_get) {
2780 } else if(token.v.symbol == sym_put) {
2782 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
2787 if(token.type != T_IDENTIFIER)
2790 if(specifiers->get_property_sym != NULL) {
2791 errorf(HERE, "get property name already specified");
2793 specifiers->get_property_sym = token.v.symbol;
2796 if(specifiers->put_property_sym != NULL) {
2797 errorf(HERE, "put property name already specified");
2799 specifiers->put_property_sym = token.v.symbol;
2803 if(token.type == ',') {
2810 } else if(symbol == sym_selectany) {
2812 DET_MOD(selectany, DM_SELECTANY);
2813 } else if(symbol == sym_uuid) {
2816 if(token.type != T_STRING_LITERAL)
2820 } else if(symbol == sym_deprecated) {
2822 if(specifiers->deprecated != 0)
2823 warningf(HERE, "deprecated used more than once");
2824 specifiers->deprecated = 1;
2825 if(token.type == '(') {
2827 if(token.type == T_STRING_LITERAL) {
2828 specifiers->deprecated_string = token.v.string.begin;
2831 errorf(HERE, "string literal expected");
2835 } else if(symbol == sym_noalias) {
2837 DET_MOD(noalias, DM_NOALIAS);
2839 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
2841 if(token.type == '(')
2845 if (token.type == ',')
2852 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2854 type_t *type = NULL;
2855 unsigned type_qualifiers = 0;
2856 unsigned type_specifiers = 0;
2859 specifiers->source_position = token.source_position;
2862 switch(token.type) {
2865 #define MATCH_STORAGE_CLASS(token, class) \
2867 if(specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
2868 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2870 specifiers->declared_storage_class = class; \
2874 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2875 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2876 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2877 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2878 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2883 add_anchor_token(')');
2884 parse_microsoft_extended_decl_modifier(specifiers);
2885 rem_anchor_token(')');
2890 switch (specifiers->declared_storage_class) {
2891 case STORAGE_CLASS_NONE:
2892 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
2895 case STORAGE_CLASS_EXTERN:
2896 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
2899 case STORAGE_CLASS_STATIC:
2900 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
2904 errorf(HERE, "multiple storage classes in declaration specifiers");
2910 /* type qualifiers */
2911 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2913 type_qualifiers |= qualifier; \
2917 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2918 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2919 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2920 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2921 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2922 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2923 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2924 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2926 case T___extension__:
2931 /* type specifiers */
2932 #define MATCH_SPECIFIER(token, specifier, name) \
2935 if(type_specifiers & specifier) { \
2936 errorf(HERE, "multiple " name " type specifiers given"); \
2938 type_specifiers |= specifier; \
2942 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void")
2943 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char")
2944 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short")
2945 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int")
2946 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float")
2947 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double")
2948 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed")
2949 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned")
2950 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool")
2951 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8")
2952 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16")
2953 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32")
2954 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64")
2955 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128")
2956 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex")
2957 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary")
2959 case T__forceinline:
2960 /* only in microsoft mode */
2961 specifiers->decl_modifiers |= DM_FORCEINLINE;
2965 specifiers->is_inline = true;
2970 if(type_specifiers & SPECIFIER_LONG_LONG) {
2971 errorf(HERE, "multiple type specifiers given");
2972 } else if(type_specifiers & SPECIFIER_LONG) {
2973 type_specifiers |= SPECIFIER_LONG_LONG;
2975 type_specifiers |= SPECIFIER_LONG;
2980 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
2982 type->compound.declaration = parse_compound_type_specifier(true);
2986 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
2988 type->compound.declaration = parse_compound_type_specifier(false);
2992 type = parse_enum_specifier();
2995 type = parse_typeof();
2997 case T___builtin_va_list:
2998 type = duplicate_type(type_valist);
3002 case T___attribute__:
3003 parse_attributes(&specifiers->gnu_attributes);
3006 case T_IDENTIFIER: {
3007 /* only parse identifier if we haven't found a type yet */
3008 if(type != NULL || type_specifiers != 0)
3009 goto finish_specifiers;
3011 type_t *typedef_type = get_typedef_type(token.v.symbol);
3013 if(typedef_type == NULL)
3014 goto finish_specifiers;
3017 type = typedef_type;
3021 /* function specifier */
3023 goto finish_specifiers;
3030 atomic_type_kind_t atomic_type;
3032 /* match valid basic types */
3033 switch(type_specifiers) {
3034 case SPECIFIER_VOID:
3035 atomic_type = ATOMIC_TYPE_VOID;
3037 case SPECIFIER_CHAR:
3038 atomic_type = ATOMIC_TYPE_CHAR;
3040 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3041 atomic_type = ATOMIC_TYPE_SCHAR;
3043 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3044 atomic_type = ATOMIC_TYPE_UCHAR;
3046 case SPECIFIER_SHORT:
3047 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3048 case SPECIFIER_SHORT | SPECIFIER_INT:
3049 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3050 atomic_type = ATOMIC_TYPE_SHORT;
3052 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3053 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3054 atomic_type = ATOMIC_TYPE_USHORT;
3057 case SPECIFIER_SIGNED:
3058 case SPECIFIER_SIGNED | SPECIFIER_INT:
3059 atomic_type = ATOMIC_TYPE_INT;
3061 case SPECIFIER_UNSIGNED:
3062 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3063 atomic_type = ATOMIC_TYPE_UINT;
3065 case SPECIFIER_LONG:
3066 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3067 case SPECIFIER_LONG | SPECIFIER_INT:
3068 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3069 atomic_type = ATOMIC_TYPE_LONG;
3071 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3072 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3073 atomic_type = ATOMIC_TYPE_ULONG;
3075 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3076 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3077 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3078 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3080 atomic_type = ATOMIC_TYPE_LONGLONG;
3082 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3083 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3085 atomic_type = ATOMIC_TYPE_ULONGLONG;
3088 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3089 atomic_type = unsigned_int8_type_kind;
3092 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3093 atomic_type = unsigned_int16_type_kind;
3096 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3097 atomic_type = unsigned_int32_type_kind;
3100 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3101 atomic_type = unsigned_int64_type_kind;
3104 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3105 atomic_type = unsigned_int128_type_kind;
3108 case SPECIFIER_INT8:
3109 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3110 atomic_type = int8_type_kind;
3113 case SPECIFIER_INT16:
3114 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3115 atomic_type = int16_type_kind;
3118 case SPECIFIER_INT32:
3119 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3120 atomic_type = int32_type_kind;
3123 case SPECIFIER_INT64:
3124 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3125 atomic_type = int64_type_kind;
3128 case SPECIFIER_INT128:
3129 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3130 atomic_type = int128_type_kind;
3133 case SPECIFIER_FLOAT:
3134 atomic_type = ATOMIC_TYPE_FLOAT;
3136 case SPECIFIER_DOUBLE:
3137 atomic_type = ATOMIC_TYPE_DOUBLE;
3139 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3140 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3142 case SPECIFIER_BOOL:
3143 atomic_type = ATOMIC_TYPE_BOOL;
3145 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3146 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3147 atomic_type = ATOMIC_TYPE_FLOAT;
3149 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3150 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3151 atomic_type = ATOMIC_TYPE_DOUBLE;
3153 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3154 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3155 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3158 /* invalid specifier combination, give an error message */
3159 if(type_specifiers == 0) {
3160 if (! strict_mode) {
3161 if (warning.implicit_int) {
3162 warningf(HERE, "no type specifiers in declaration, using 'int'");
3164 atomic_type = ATOMIC_TYPE_INT;
3167 errorf(HERE, "no type specifiers given in declaration");
3169 } else if((type_specifiers & SPECIFIER_SIGNED) &&
3170 (type_specifiers & SPECIFIER_UNSIGNED)) {
3171 errorf(HERE, "signed and unsigned specifiers gives");
3172 } else if(type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3173 errorf(HERE, "only integer types can be signed or unsigned");
3175 errorf(HERE, "multiple datatypes in declaration");
3177 atomic_type = ATOMIC_TYPE_INVALID;
3180 if(type_specifiers & SPECIFIER_COMPLEX &&
3181 atomic_type != ATOMIC_TYPE_INVALID) {
3182 type = allocate_type_zero(TYPE_COMPLEX, &builtin_source_position);
3183 type->complex.akind = atomic_type;
3184 } else if(type_specifiers & SPECIFIER_IMAGINARY &&
3185 atomic_type != ATOMIC_TYPE_INVALID) {
3186 type = allocate_type_zero(TYPE_IMAGINARY, &builtin_source_position);
3187 type->imaginary.akind = atomic_type;
3189 type = allocate_type_zero(TYPE_ATOMIC, &builtin_source_position);
3190 type->atomic.akind = atomic_type;
3194 if(type_specifiers != 0) {
3195 errorf(HERE, "multiple datatypes in declaration");
3199 type->base.qualifiers = type_qualifiers;
3200 /* FIXME: check type qualifiers here */
3202 type_t *result = typehash_insert(type);
3203 if(newtype && result != type) {
3207 specifiers->type = result;
3212 static type_qualifiers_t parse_type_qualifiers(void)
3214 type_qualifiers_t type_qualifiers = TYPE_QUALIFIER_NONE;
3217 switch(token.type) {
3218 /* type qualifiers */
3219 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3220 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3221 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3222 /* microsoft extended type modifiers */
3223 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3224 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3225 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3226 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3227 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3230 return type_qualifiers;
3235 static declaration_t *parse_identifier_list(void)
3237 declaration_t *declarations = NULL;
3238 declaration_t *last_declaration = NULL;
3240 declaration_t *const declaration = allocate_declaration_zero();
3241 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3242 declaration->source_position = token.source_position;
3243 declaration->symbol = token.v.symbol;
3246 if(last_declaration != NULL) {
3247 last_declaration->next = declaration;
3249 declarations = declaration;
3251 last_declaration = declaration;
3253 if (token.type != ',') {
3257 } while(token.type == T_IDENTIFIER);
3259 return declarations;
3262 static void semantic_parameter(declaration_t *declaration)
3264 /* TODO: improve error messages */
3266 if(declaration->declared_storage_class == STORAGE_CLASS_TYPEDEF) {
3267 errorf(HERE, "typedef not allowed in parameter list");
3268 } else if(declaration->declared_storage_class != STORAGE_CLASS_NONE
3269 && declaration->declared_storage_class != STORAGE_CLASS_REGISTER) {
3270 errorf(HERE, "parameter may only have none or register storage class");
3273 type_t *const orig_type = declaration->type;
3274 type_t * type = skip_typeref(orig_type);
3276 /* Array as last part of a parameter type is just syntactic sugar. Turn it
3277 * into a pointer. § 6.7.5.3 (7) */
3278 if (is_type_array(type)) {
3279 type_t *const element_type = type->array.element_type;
3281 type = make_pointer_type(element_type, type->base.qualifiers);
3283 declaration->type = type;
3286 if(is_type_incomplete(type)) {
3287 errorf(HERE, "incomplete type '%T' not allowed for parameter '%Y'",
3288 orig_type, declaration->symbol);
3292 static declaration_t *parse_parameter(void)
3294 declaration_specifiers_t specifiers;
3295 memset(&specifiers, 0, sizeof(specifiers));
3297 parse_declaration_specifiers(&specifiers);
3299 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
3301 semantic_parameter(declaration);
3306 static declaration_t *parse_parameters(function_type_t *type)
3308 declaration_t *declarations = NULL;
3311 add_anchor_token(')');
3312 int saved_comma_state = save_and_reset_anchor_state(',');
3314 if(token.type == T_IDENTIFIER) {
3315 symbol_t *symbol = token.v.symbol;
3316 if(!is_typedef_symbol(symbol)) {
3317 type->kr_style_parameters = true;
3318 declarations = parse_identifier_list();
3319 goto parameters_finished;
3323 if(token.type == ')') {
3324 type->unspecified_parameters = 1;
3325 goto parameters_finished;
3327 if(token.type == T_void && look_ahead(1)->type == ')') {
3329 goto parameters_finished;
3332 declaration_t *declaration;
3333 declaration_t *last_declaration = NULL;
3334 function_parameter_t *parameter;
3335 function_parameter_t *last_parameter = NULL;
3338 switch(token.type) {
3342 goto parameters_finished;
3345 case T___extension__:
3347 declaration = parse_parameter();
3349 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
3350 memset(parameter, 0, sizeof(parameter[0]));
3351 parameter->type = declaration->type;
3353 if(last_parameter != NULL) {
3354 last_declaration->next = declaration;
3355 last_parameter->next = parameter;
3357 type->parameters = parameter;
3358 declarations = declaration;
3360 last_parameter = parameter;
3361 last_declaration = declaration;
3365 goto parameters_finished;
3367 if (token.type != ',') {
3368 goto parameters_finished;
3374 parameters_finished:
3375 rem_anchor_token(')');
3378 restore_anchor_state(',', saved_comma_state);
3379 return declarations;
3382 restore_anchor_state(',', saved_comma_state);
3391 } construct_type_kind_t;
3393 typedef struct construct_type_t construct_type_t;
3394 struct construct_type_t {
3395 construct_type_kind_t kind;
3396 construct_type_t *next;
3399 typedef struct parsed_pointer_t parsed_pointer_t;
3400 struct parsed_pointer_t {
3401 construct_type_t construct_type;
3402 type_qualifiers_t type_qualifiers;
3405 typedef struct construct_function_type_t construct_function_type_t;
3406 struct construct_function_type_t {
3407 construct_type_t construct_type;
3408 type_t *function_type;
3411 typedef struct parsed_array_t parsed_array_t;
3412 struct parsed_array_t {
3413 construct_type_t construct_type;
3414 type_qualifiers_t type_qualifiers;
3420 typedef struct construct_base_type_t construct_base_type_t;
3421 struct construct_base_type_t {
3422 construct_type_t construct_type;
3426 static construct_type_t *parse_pointer_declarator(void)
3430 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3431 memset(pointer, 0, sizeof(pointer[0]));
3432 pointer->construct_type.kind = CONSTRUCT_POINTER;
3433 pointer->type_qualifiers = parse_type_qualifiers();
3435 return (construct_type_t*) pointer;
3438 static construct_type_t *parse_array_declarator(void)
3441 add_anchor_token(']');
3443 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
3444 memset(array, 0, sizeof(array[0]));
3445 array->construct_type.kind = CONSTRUCT_ARRAY;
3447 if(token.type == T_static) {
3448 array->is_static = true;
3452 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3453 if(type_qualifiers != 0) {
3454 if(token.type == T_static) {
3455 array->is_static = true;
3459 array->type_qualifiers = type_qualifiers;
3461 if(token.type == '*' && look_ahead(1)->type == ']') {
3462 array->is_variable = true;
3464 } else if(token.type != ']') {
3465 array->size = parse_assignment_expression();
3468 rem_anchor_token(']');
3471 return (construct_type_t*) array;
3476 static construct_type_t *parse_function_declarator(declaration_t *declaration)
3479 if(declaration != NULL) {
3480 type = allocate_type_zero(TYPE_FUNCTION, &declaration->source_position);
3482 type = allocate_type_zero(TYPE_FUNCTION, HERE);
3485 declaration_t *parameters = parse_parameters(&type->function);
3486 if(declaration != NULL) {
3487 declaration->scope.declarations = parameters;
3490 construct_function_type_t *construct_function_type =
3491 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
3492 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
3493 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
3494 construct_function_type->function_type = type;
3496 return (construct_type_t*) construct_function_type;
3499 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
3500 bool may_be_abstract)
3502 /* construct a single linked list of construct_type_t's which describe
3503 * how to construct the final declarator type */
3504 construct_type_t *first = NULL;
3505 construct_type_t *last = NULL;
3506 gnu_attribute_t *attributes = NULL;
3509 while(token.type == '*') {
3510 construct_type_t *type = parse_pointer_declarator();
3521 /* TODO: find out if this is correct */
3522 parse_attributes(&attributes);
3524 construct_type_t *inner_types = NULL;
3526 switch(token.type) {
3528 if(declaration == NULL) {
3529 errorf(HERE, "no identifier expected in typename");
3531 declaration->symbol = token.v.symbol;
3532 declaration->source_position = token.source_position;
3538 add_anchor_token(')');
3539 inner_types = parse_inner_declarator(declaration, may_be_abstract);
3540 rem_anchor_token(')');
3546 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3547 /* avoid a loop in the outermost scope, because eat_statement doesn't
3549 if(token.type == '}' && current_function == NULL) {
3557 construct_type_t *p = last;
3560 construct_type_t *type;
3561 switch(token.type) {
3563 type = parse_function_declarator(declaration);
3566 type = parse_array_declarator();
3569 goto declarator_finished;
3572 /* insert in the middle of the list (behind p) */
3574 type->next = p->next;
3585 declarator_finished:
3586 parse_attributes(&attributes);
3588 /* append inner_types at the end of the list, we don't to set last anymore
3589 * as it's not needed anymore */
3591 assert(first == NULL);
3592 first = inner_types;
3594 last->next = inner_types;
3602 static type_t *construct_declarator_type(construct_type_t *construct_list,
3605 construct_type_t *iter = construct_list;
3606 for( ; iter != NULL; iter = iter->next) {
3607 switch(iter->kind) {
3608 case CONSTRUCT_INVALID:
3609 internal_errorf(HERE, "invalid type construction found");
3610 case CONSTRUCT_FUNCTION: {
3611 construct_function_type_t *construct_function_type
3612 = (construct_function_type_t*) iter;
3614 type_t *function_type = construct_function_type->function_type;
3616 function_type->function.return_type = type;
3618 type_t *skipped_return_type = skip_typeref(type);
3619 if (is_type_function(skipped_return_type)) {
3620 errorf(HERE, "function returning function is not allowed");
3621 type = type_error_type;
3622 } else if (is_type_array(skipped_return_type)) {
3623 errorf(HERE, "function returning array is not allowed");
3624 type = type_error_type;
3626 type = function_type;
3631 case CONSTRUCT_POINTER: {
3632 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
3633 type_t *pointer_type = allocate_type_zero(TYPE_POINTER, &null_position);
3634 pointer_type->pointer.points_to = type;
3635 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
3637 type = pointer_type;
3641 case CONSTRUCT_ARRAY: {
3642 parsed_array_t *parsed_array = (parsed_array_t*) iter;
3643 type_t *array_type = allocate_type_zero(TYPE_ARRAY, &null_position);
3645 expression_t *size_expression = parsed_array->size;
3646 if(size_expression != NULL) {
3648 = create_implicit_cast(size_expression, type_size_t);
3651 array_type->base.qualifiers = parsed_array->type_qualifiers;
3652 array_type->array.element_type = type;
3653 array_type->array.is_static = parsed_array->is_static;
3654 array_type->array.is_variable = parsed_array->is_variable;
3655 array_type->array.size_expression = size_expression;
3657 if(size_expression != NULL) {
3658 if(is_constant_expression(size_expression)) {
3659 array_type->array.size_constant = true;
3660 array_type->array.size
3661 = fold_constant(size_expression);
3663 array_type->array.is_vla = true;
3667 type_t *skipped_type = skip_typeref(type);
3668 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
3669 errorf(HERE, "array of void is not allowed");
3670 type = type_error_type;
3678 type_t *hashed_type = typehash_insert(type);
3679 if(hashed_type != type) {
3680 /* the function type was constructed earlier freeing it here will
3681 * destroy other types... */
3682 if(iter->kind != CONSTRUCT_FUNCTION) {
3692 static declaration_t *parse_declarator(
3693 const declaration_specifiers_t *specifiers, bool may_be_abstract)
3695 declaration_t *const declaration = allocate_declaration_zero();
3696 declaration->declared_storage_class = specifiers->declared_storage_class;
3697 declaration->decl_modifiers = specifiers->decl_modifiers;
3698 declaration->deprecated = specifiers->deprecated;
3699 declaration->deprecated_string = specifiers->deprecated_string;
3700 declaration->get_property_sym = specifiers->get_property_sym;
3701 declaration->put_property_sym = specifiers->put_property_sym;
3702 declaration->is_inline = specifiers->is_inline;
3704 declaration->storage_class = specifiers->declared_storage_class;
3705 if(declaration->storage_class == STORAGE_CLASS_NONE
3706 && scope != global_scope) {
3707 declaration->storage_class = STORAGE_CLASS_AUTO;
3710 if(specifiers->alignment != 0) {
3711 /* TODO: add checks here */
3712 declaration->alignment = specifiers->alignment;
3715 construct_type_t *construct_type
3716 = parse_inner_declarator(declaration, may_be_abstract);
3717 type_t *const type = specifiers->type;
3718 declaration->type = construct_declarator_type(construct_type, type);
3720 if(construct_type != NULL) {
3721 obstack_free(&temp_obst, construct_type);
3727 static type_t *parse_abstract_declarator(type_t *base_type)
3729 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
3731 type_t *result = construct_declarator_type(construct_type, base_type);
3732 if(construct_type != NULL) {
3733 obstack_free(&temp_obst, construct_type);
3739 static declaration_t *append_declaration(declaration_t* const declaration)
3741 if (last_declaration != NULL) {
3742 last_declaration->next = declaration;
3744 scope->declarations = declaration;
3746 last_declaration = declaration;
3751 * Check if the declaration of main is suspicious. main should be a
3752 * function with external linkage, returning int, taking either zero
3753 * arguments, two, or three arguments of appropriate types, ie.
3755 * int main([ int argc, char **argv [, char **env ] ]).
3757 * @param decl the declaration to check
3758 * @param type the function type of the declaration
3760 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
3762 if (decl->storage_class == STORAGE_CLASS_STATIC) {
3763 warningf(&decl->source_position,
3764 "'main' is normally a non-static function");
3766 if (skip_typeref(func_type->return_type) != type_int) {
3767 warningf(&decl->source_position,
3768 "return type of 'main' should be 'int', but is '%T'",
3769 func_type->return_type);
3771 const function_parameter_t *parm = func_type->parameters;
3773 type_t *const first_type = parm->type;
3774 if (!types_compatible(skip_typeref(first_type), type_int)) {
3775 warningf(&decl->source_position,
3776 "first argument of 'main' should be 'int', but is '%T'", first_type);
3780 type_t *const second_type = parm->type;
3781 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
3782 warningf(&decl->source_position,
3783 "second argument of 'main' should be 'char**', but is '%T'", second_type);
3787 type_t *const third_type = parm->type;
3788 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
3789 warningf(&decl->source_position,
3790 "third argument of 'main' should be 'char**', but is '%T'", third_type);
3794 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
3798 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
3804 * Check if a symbol is the equal to "main".
3806 static bool is_sym_main(const symbol_t *const sym)
3808 return strcmp(sym->string, "main") == 0;
3811 static declaration_t *internal_record_declaration(
3812 declaration_t *const declaration,
3813 const bool is_function_definition)
3815 const symbol_t *const symbol = declaration->symbol;
3816 const namespace_t namespc = (namespace_t)declaration->namespc;
3818 assert(declaration->symbol != NULL);
3819 declaration_t *previous_declaration = get_declaration(symbol, namespc);
3821 type_t *const orig_type = declaration->type;
3822 type_t *const type = skip_typeref(orig_type);
3823 if (is_type_function(type) &&
3824 type->function.unspecified_parameters &&
3825 warning.strict_prototypes &&
3826 previous_declaration == NULL) {
3827 warningf(&declaration->source_position,
3828 "function declaration '%#T' is not a prototype",
3829 orig_type, declaration->symbol);
3832 if (is_function_definition && warning.main && is_sym_main(symbol)) {
3833 check_type_of_main(declaration, &type->function);
3836 assert(declaration != previous_declaration);
3837 if (previous_declaration != NULL
3838 && previous_declaration->parent_scope == scope) {
3839 /* can happen for K&R style declarations */
3840 if (previous_declaration->type == NULL) {
3841 previous_declaration->type = declaration->type;
3844 const type_t *prev_type = skip_typeref(previous_declaration->type);
3845 if (!types_compatible(type, prev_type)) {
3846 errorf(&declaration->source_position,
3847 "declaration '%#T' is incompatible with '%#T' (declared %P)",
3848 orig_type, symbol, previous_declaration->type, symbol,
3849 &previous_declaration->source_position);
3851 unsigned old_storage_class = previous_declaration->storage_class;
3852 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
3853 errorf(&declaration->source_position,
3854 "redeclaration of enum entry '%Y' (declared %P)",
3855 symbol, &previous_declaration->source_position);
3856 return previous_declaration;
3859 unsigned new_storage_class = declaration->storage_class;
3861 if (is_type_incomplete(prev_type)) {
3862 previous_declaration->type = type;
3866 /* pretend no storage class means extern for function
3867 * declarations (except if the previous declaration is neither
3868 * none nor extern) */
3869 if (is_type_function(type)) {
3870 switch (old_storage_class) {
3871 case STORAGE_CLASS_NONE:
3872 old_storage_class = STORAGE_CLASS_EXTERN;
3874 case STORAGE_CLASS_EXTERN:
3875 if (is_function_definition) {
3876 if (warning.missing_prototypes &&
3877 prev_type->function.unspecified_parameters &&
3878 !is_sym_main(symbol)) {
3879 warningf(&declaration->source_position,
3880 "no previous prototype for '%#T'",
3883 } else if (new_storage_class == STORAGE_CLASS_NONE) {
3884 new_storage_class = STORAGE_CLASS_EXTERN;
3893 if (old_storage_class == STORAGE_CLASS_EXTERN &&
3894 new_storage_class == STORAGE_CLASS_EXTERN) {
3895 warn_redundant_declaration:
3896 if (warning.redundant_decls) {
3897 warningf(&declaration->source_position,
3898 "redundant declaration for '%Y' (declared %P)",
3899 symbol, &previous_declaration->source_position);
3901 } else if (current_function == NULL) {
3902 if (old_storage_class != STORAGE_CLASS_STATIC &&
3903 new_storage_class == STORAGE_CLASS_STATIC) {
3904 errorf(&declaration->source_position,
3905 "static declaration of '%Y' follows non-static declaration (declared %P)",
3906 symbol, &previous_declaration->source_position);
3907 } else if (old_storage_class != STORAGE_CLASS_EXTERN
3908 && !is_function_definition) {
3909 goto warn_redundant_declaration;
3910 } else if (new_storage_class == STORAGE_CLASS_NONE) {
3911 previous_declaration->storage_class = STORAGE_CLASS_NONE;
3912 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
3914 } else if (old_storage_class == new_storage_class) {
3915 errorf(&declaration->source_position,
3916 "redeclaration of '%Y' (declared %P)",
3917 symbol, &previous_declaration->source_position);
3919 errorf(&declaration->source_position,
3920 "redeclaration of '%Y' with different linkage (declared %P)",
3921 symbol, &previous_declaration->source_position);
3925 if (declaration->is_inline)
3926 previous_declaration->is_inline = true;
3927 return previous_declaration;
3928 } else if (is_function_definition) {
3929 if (declaration->storage_class != STORAGE_CLASS_STATIC) {
3930 if (warning.missing_prototypes && !is_sym_main(symbol)) {
3931 warningf(&declaration->source_position,
3932 "no previous prototype for '%#T'", orig_type, symbol);
3933 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
3934 warningf(&declaration->source_position,
3935 "no previous declaration for '%#T'", orig_type,
3939 } else if (warning.missing_declarations &&
3940 scope == global_scope &&
3941 !is_type_function(type) && (
3942 declaration->storage_class == STORAGE_CLASS_NONE ||
3943 declaration->storage_class == STORAGE_CLASS_THREAD
3945 warningf(&declaration->source_position,
3946 "no previous declaration for '%#T'", orig_type, symbol);
3949 assert(declaration->parent_scope == NULL);
3950 assert(scope != NULL);
3952 declaration->parent_scope = scope;
3954 environment_push(declaration);
3955 return append_declaration(declaration);
3958 static declaration_t *record_declaration(declaration_t *declaration)
3960 return internal_record_declaration(declaration, false);
3963 static declaration_t *record_function_definition(declaration_t *declaration)
3965 return internal_record_declaration(declaration, true);
3968 static void parser_error_multiple_definition(declaration_t *declaration,
3969 const source_position_t *source_position)
3971 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
3972 declaration->symbol, &declaration->source_position);
3975 static bool is_declaration_specifier(const token_t *token,
3976 bool only_specifiers_qualifiers)
3978 switch(token->type) {
3983 return is_typedef_symbol(token->v.symbol);
3985 case T___extension__:
3987 return !only_specifiers_qualifiers;
3994 static void parse_init_declarator_rest(declaration_t *declaration)
3998 type_t *orig_type = declaration->type;
3999 type_t *type = skip_typeref(orig_type);
4001 if(declaration->init.initializer != NULL) {
4002 parser_error_multiple_definition(declaration, HERE);
4005 bool must_be_constant = false;
4006 if(declaration->storage_class == STORAGE_CLASS_STATIC
4007 || declaration->storage_class == STORAGE_CLASS_THREAD_STATIC
4008 || declaration->parent_scope == global_scope) {
4009 must_be_constant = true;
4012 parse_initializer_env_t env;
4013 env.type = orig_type;
4014 env.must_be_constant = must_be_constant;
4015 env.declaration = declaration;
4017 initializer_t *initializer = parse_initializer(&env);
4019 if(env.type != orig_type) {
4020 orig_type = env.type;
4021 type = skip_typeref(orig_type);
4022 declaration->type = env.type;
4025 if(is_type_function(type)) {
4026 errorf(&declaration->source_position,
4027 "initializers not allowed for function types at declator '%Y' (type '%T')",
4028 declaration->symbol, orig_type);
4030 declaration->init.initializer = initializer;
4034 /* parse rest of a declaration without any declarator */
4035 static void parse_anonymous_declaration_rest(
4036 const declaration_specifiers_t *specifiers,
4037 parsed_declaration_func finished_declaration)
4041 declaration_t *const declaration = allocate_declaration_zero();
4042 declaration->type = specifiers->type;
4043 declaration->declared_storage_class = specifiers->declared_storage_class;
4044 declaration->source_position = specifiers->source_position;
4045 declaration->decl_modifiers = specifiers->decl_modifiers;
4047 if (declaration->declared_storage_class != STORAGE_CLASS_NONE) {
4048 warningf(&declaration->source_position,
4049 "useless storage class in empty declaration");
4051 declaration->storage_class = STORAGE_CLASS_NONE;
4053 type_t *type = declaration->type;
4054 switch (type->kind) {
4055 case TYPE_COMPOUND_STRUCT:
4056 case TYPE_COMPOUND_UNION: {
4057 if (type->compound.declaration->symbol == NULL) {
4058 warningf(&declaration->source_position,
4059 "unnamed struct/union that defines no instances");
4068 warningf(&declaration->source_position, "empty declaration");
4072 finished_declaration(declaration);
4075 static void parse_declaration_rest(declaration_t *ndeclaration,
4076 const declaration_specifiers_t *specifiers,
4077 parsed_declaration_func finished_declaration)
4079 add_anchor_token(';');
4080 add_anchor_token('=');
4081 add_anchor_token(',');
4083 declaration_t *declaration = finished_declaration(ndeclaration);
4085 type_t *orig_type = declaration->type;
4086 type_t *type = skip_typeref(orig_type);
4088 if (type->kind != TYPE_FUNCTION &&
4089 declaration->is_inline &&
4090 is_type_valid(type)) {
4091 warningf(&declaration->source_position,
4092 "variable '%Y' declared 'inline'\n", declaration->symbol);
4095 if(token.type == '=') {
4096 parse_init_declarator_rest(declaration);
4099 if(token.type != ',')
4103 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4108 rem_anchor_token(';');
4109 rem_anchor_token('=');
4110 rem_anchor_token(',');
4113 static declaration_t *finished_kr_declaration(declaration_t *declaration)
4115 symbol_t *symbol = declaration->symbol;
4116 if(symbol == NULL) {
4117 errorf(HERE, "anonymous declaration not valid as function parameter");
4120 namespace_t namespc = (namespace_t) declaration->namespc;
4121 if(namespc != NAMESPACE_NORMAL) {
4122 return record_declaration(declaration);
4125 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4126 if(previous_declaration == NULL ||
4127 previous_declaration->parent_scope != scope) {
4128 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4133 if(previous_declaration->type == NULL) {
4134 previous_declaration->type = declaration->type;
4135 previous_declaration->declared_storage_class = declaration->declared_storage_class;
4136 previous_declaration->storage_class = declaration->storage_class;
4137 previous_declaration->parent_scope = scope;
4138 return previous_declaration;
4140 return record_declaration(declaration);
4144 static void parse_declaration(parsed_declaration_func finished_declaration)
4146 declaration_specifiers_t specifiers;
4147 memset(&specifiers, 0, sizeof(specifiers));
4148 parse_declaration_specifiers(&specifiers);
4150 if(token.type == ';') {
4151 parse_anonymous_declaration_rest(&specifiers, append_declaration);
4153 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4154 parse_declaration_rest(declaration, &specifiers, finished_declaration);
4158 static type_t *get_default_promoted_type(type_t *orig_type)
4160 type_t *result = orig_type;
4162 type_t *type = skip_typeref(orig_type);
4163 if(is_type_integer(type)) {
4164 result = promote_integer(type);
4165 } else if(type == type_float) {
4166 result = type_double;
4172 static void parse_kr_declaration_list(declaration_t *declaration)
4174 type_t *type = skip_typeref(declaration->type);
4175 if (!is_type_function(type))
4178 if (!type->function.kr_style_parameters)
4181 /* push function parameters */
4182 int top = environment_top();
4183 scope_t *last_scope = scope;
4184 set_scope(&declaration->scope);
4186 declaration_t *parameter = declaration->scope.declarations;
4187 for ( ; parameter != NULL; parameter = parameter->next) {
4188 assert(parameter->parent_scope == NULL);
4189 parameter->parent_scope = scope;
4190 environment_push(parameter);
4193 /* parse declaration list */
4194 while (is_declaration_specifier(&token, false)) {
4195 parse_declaration(finished_kr_declaration);
4198 /* pop function parameters */
4199 assert(scope == &declaration->scope);
4200 set_scope(last_scope);
4201 environment_pop_to(top);
4203 /* update function type */
4204 type_t *new_type = duplicate_type(type);
4206 function_parameter_t *parameters = NULL;
4207 function_parameter_t *last_parameter = NULL;
4209 declaration_t *parameter_declaration = declaration->scope.declarations;
4210 for( ; parameter_declaration != NULL;
4211 parameter_declaration = parameter_declaration->next) {
4212 type_t *parameter_type = parameter_declaration->type;
4213 if(parameter_type == NULL) {
4215 errorf(HERE, "no type specified for function parameter '%Y'",
4216 parameter_declaration->symbol);
4218 if (warning.implicit_int) {
4219 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4220 parameter_declaration->symbol);
4222 parameter_type = type_int;
4223 parameter_declaration->type = parameter_type;
4227 semantic_parameter(parameter_declaration);
4228 parameter_type = parameter_declaration->type;
4231 * we need the default promoted types for the function type
4233 parameter_type = get_default_promoted_type(parameter_type);
4235 function_parameter_t *function_parameter
4236 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
4237 memset(function_parameter, 0, sizeof(function_parameter[0]));
4239 function_parameter->type = parameter_type;
4240 if(last_parameter != NULL) {
4241 last_parameter->next = function_parameter;
4243 parameters = function_parameter;
4245 last_parameter = function_parameter;
4248 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
4250 new_type->function.parameters = parameters;
4251 new_type->function.unspecified_parameters = true;
4253 type = typehash_insert(new_type);
4254 if(type != new_type) {
4255 obstack_free(type_obst, new_type);
4258 declaration->type = type;
4261 static bool first_err = true;
4264 * When called with first_err set, prints the name of the current function,
4267 static void print_in_function(void) {
4270 diagnosticf("%s: In function '%Y':\n",
4271 current_function->source_position.input_name,
4272 current_function->symbol);
4277 * Check if all labels are defined in the current function.
4278 * Check if all labels are used in the current function.
4280 static void check_labels(void)
4282 for (const goto_statement_t *goto_statement = goto_first;
4283 goto_statement != NULL;
4284 goto_statement = goto_statement->next) {
4285 declaration_t *label = goto_statement->label;
4288 if (label->source_position.input_name == NULL) {
4289 print_in_function();
4290 errorf(&goto_statement->base.source_position,
4291 "label '%Y' used but not defined", label->symbol);
4294 goto_first = goto_last = NULL;
4296 if (warning.unused_label) {
4297 for (const label_statement_t *label_statement = label_first;
4298 label_statement != NULL;
4299 label_statement = label_statement->next) {
4300 const declaration_t *label = label_statement->label;
4302 if (! label->used) {
4303 print_in_function();
4304 warningf(&label_statement->base.source_position,
4305 "label '%Y' defined but not used", label->symbol);
4309 label_first = label_last = NULL;
4313 * Check declarations of current_function for unused entities.
4315 static void check_declarations(void)
4317 if (warning.unused_parameter) {
4318 const scope_t *scope = ¤t_function->scope;
4320 const declaration_t *parameter = scope->declarations;
4321 for (; parameter != NULL; parameter = parameter->next) {
4322 if (! parameter->used) {
4323 print_in_function();
4324 warningf(¶meter->source_position,
4325 "unused parameter '%Y'", parameter->symbol);
4329 if (warning.unused_variable) {
4333 static void parse_external_declaration(void)
4335 /* function-definitions and declarations both start with declaration
4337 declaration_specifiers_t specifiers;
4338 memset(&specifiers, 0, sizeof(specifiers));
4340 add_anchor_token(';');
4341 parse_declaration_specifiers(&specifiers);
4342 rem_anchor_token(';');
4344 /* must be a declaration */
4345 if(token.type == ';') {
4346 parse_anonymous_declaration_rest(&specifiers, append_declaration);
4350 add_anchor_token(',');
4351 add_anchor_token('=');
4352 rem_anchor_token(';');
4354 /* declarator is common to both function-definitions and declarations */
4355 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4357 rem_anchor_token(',');
4358 rem_anchor_token('=');
4359 rem_anchor_token(';');
4361 /* must be a declaration */
4362 if(token.type == ',' || token.type == '=' || token.type == ';') {
4363 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
4367 /* must be a function definition */
4368 parse_kr_declaration_list(ndeclaration);
4370 if(token.type != '{') {
4371 parse_error_expected("while parsing function definition", '{', NULL);
4372 eat_until_matching_token(';');
4376 type_t *type = ndeclaration->type;
4378 /* note that we don't skip typerefs: the standard doesn't allow them here
4379 * (so we can't use is_type_function here) */
4380 if(type->kind != TYPE_FUNCTION) {
4381 if (is_type_valid(type)) {
4382 errorf(HERE, "declarator '%#T' has a body but is not a function type",
4383 type, ndeclaration->symbol);
4389 /* § 6.7.5.3 (14) a function definition with () means no
4390 * parameters (and not unspecified parameters) */
4391 if(type->function.unspecified_parameters
4392 && type->function.parameters == NULL
4393 && !type->function.kr_style_parameters) {
4394 type_t *duplicate = duplicate_type(type);
4395 duplicate->function.unspecified_parameters = false;
4397 type = typehash_insert(duplicate);
4398 if(type != duplicate) {
4399 obstack_free(type_obst, duplicate);
4401 ndeclaration->type = type;
4404 declaration_t *const declaration = record_function_definition(ndeclaration);
4405 if(ndeclaration != declaration) {
4406 declaration->scope = ndeclaration->scope;
4408 type = skip_typeref(declaration->type);
4410 /* push function parameters and switch scope */
4411 int top = environment_top();
4412 scope_t *last_scope = scope;
4413 set_scope(&declaration->scope);
4415 declaration_t *parameter = declaration->scope.declarations;
4416 for( ; parameter != NULL; parameter = parameter->next) {
4417 if(parameter->parent_scope == &ndeclaration->scope) {
4418 parameter->parent_scope = scope;
4420 assert(parameter->parent_scope == NULL
4421 || parameter->parent_scope == scope);
4422 parameter->parent_scope = scope;
4423 environment_push(parameter);
4426 if(declaration->init.statement != NULL) {
4427 parser_error_multiple_definition(declaration, HERE);
4429 goto end_of_parse_external_declaration;
4431 /* parse function body */
4432 int label_stack_top = label_top();
4433 declaration_t *old_current_function = current_function;
4434 current_function = declaration;
4436 declaration->init.statement = parse_compound_statement(false);
4439 check_declarations();
4441 assert(current_function == declaration);
4442 current_function = old_current_function;
4443 label_pop_to(label_stack_top);
4446 end_of_parse_external_declaration:
4447 assert(scope == &declaration->scope);
4448 set_scope(last_scope);
4449 environment_pop_to(top);
4452 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
4453 source_position_t *source_position)
4455 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
4457 type->bitfield.base_type = base_type;
4458 type->bitfield.size = size;
4463 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
4466 declaration_t *iter = compound_declaration->scope.declarations;
4467 for( ; iter != NULL; iter = iter->next) {
4468 if(iter->namespc != NAMESPACE_NORMAL)
4471 if(iter->symbol == NULL) {
4472 type_t *type = skip_typeref(iter->type);
4473 if(is_type_compound(type)) {
4474 declaration_t *result
4475 = find_compound_entry(type->compound.declaration, symbol);
4482 if(iter->symbol == symbol) {
4490 static void parse_compound_declarators(declaration_t *struct_declaration,
4491 const declaration_specifiers_t *specifiers)
4493 declaration_t *last_declaration = struct_declaration->scope.declarations;
4494 if(last_declaration != NULL) {
4495 while(last_declaration->next != NULL) {
4496 last_declaration = last_declaration->next;
4501 declaration_t *declaration;
4503 if(token.type == ':') {
4504 source_position_t source_position = *HERE;
4507 type_t *base_type = specifiers->type;
4508 expression_t *size = parse_constant_expression();
4510 if(!is_type_integer(skip_typeref(base_type))) {
4511 errorf(HERE, "bitfield base type '%T' is not an integer type",
4515 type_t *type = make_bitfield_type(base_type, size, &source_position);
4517 declaration = allocate_declaration_zero();
4518 declaration->namespc = NAMESPACE_NORMAL;
4519 declaration->declared_storage_class = STORAGE_CLASS_NONE;
4520 declaration->storage_class = STORAGE_CLASS_NONE;
4521 declaration->source_position = source_position;
4522 declaration->decl_modifiers = specifiers->decl_modifiers;
4523 declaration->type = type;
4525 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
4527 type_t *orig_type = declaration->type;
4528 type_t *type = skip_typeref(orig_type);
4530 if(token.type == ':') {
4531 source_position_t source_position = *HERE;
4533 expression_t *size = parse_constant_expression();
4535 if(!is_type_integer(type)) {
4536 errorf(HERE, "bitfield base type '%T' is not an "
4537 "integer type", orig_type);
4540 type_t *bitfield_type = make_bitfield_type(orig_type, size, &source_position);
4541 declaration->type = bitfield_type;
4543 /* TODO we ignore arrays for now... what is missing is a check
4544 * that they're at the end of the struct */
4545 if(is_type_incomplete(type) && !is_type_array(type)) {
4547 "compound member '%Y' has incomplete type '%T'",
4548 declaration->symbol, orig_type);
4549 } else if(is_type_function(type)) {
4550 errorf(HERE, "compound member '%Y' must not have function "
4551 "type '%T'", declaration->symbol, orig_type);
4556 /* make sure we don't define a symbol multiple times */
4557 symbol_t *symbol = declaration->symbol;
4558 if(symbol != NULL) {
4559 declaration_t *prev_decl
4560 = find_compound_entry(struct_declaration, symbol);
4562 if(prev_decl != NULL) {
4563 assert(prev_decl->symbol == symbol);
4564 errorf(&declaration->source_position,
4565 "multiple declarations of symbol '%Y' (declared %P)",
4566 symbol, &prev_decl->source_position);
4570 /* append declaration */
4571 if(last_declaration != NULL) {
4572 last_declaration->next = declaration;
4574 struct_declaration->scope.declarations = declaration;
4576 last_declaration = declaration;
4578 if(token.type != ',')
4588 static void parse_compound_type_entries(declaration_t *compound_declaration)
4591 add_anchor_token('}');
4593 while(token.type != '}' && token.type != T_EOF) {
4594 declaration_specifiers_t specifiers;
4595 memset(&specifiers, 0, sizeof(specifiers));
4596 parse_declaration_specifiers(&specifiers);
4598 parse_compound_declarators(compound_declaration, &specifiers);
4600 rem_anchor_token('}');
4602 if(token.type == T_EOF) {
4603 errorf(HERE, "EOF while parsing struct");
4608 static type_t *parse_typename(void)
4610 declaration_specifiers_t specifiers;
4611 memset(&specifiers, 0, sizeof(specifiers));
4612 parse_declaration_specifiers(&specifiers);
4613 if(specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
4614 /* TODO: improve error message, user does probably not know what a
4615 * storage class is...
4617 errorf(HERE, "typename may not have a storage class");
4620 type_t *result = parse_abstract_declarator(specifiers.type);
4628 typedef expression_t* (*parse_expression_function) (unsigned precedence);
4629 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
4630 expression_t *left);
4632 typedef struct expression_parser_function_t expression_parser_function_t;
4633 struct expression_parser_function_t {
4634 unsigned precedence;
4635 parse_expression_function parser;
4636 unsigned infix_precedence;
4637 parse_expression_infix_function infix_parser;
4640 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
4643 * Prints an error message if an expression was expected but not read
4645 static expression_t *expected_expression_error(void)
4647 /* skip the error message if the error token was read */
4648 if (token.type != T_ERROR) {
4649 errorf(HERE, "expected expression, got token '%K'", &token);
4653 return create_invalid_expression();
4657 * Parse a string constant.
4659 static expression_t *parse_string_const(void)
4662 if (token.type == T_STRING_LITERAL) {
4663 string_t res = token.v.string;
4665 while (token.type == T_STRING_LITERAL) {
4666 res = concat_strings(&res, &token.v.string);
4669 if (token.type != T_WIDE_STRING_LITERAL) {
4670 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
4671 /* note: that we use type_char_ptr here, which is already the
4672 * automatic converted type. revert_automatic_type_conversion
4673 * will construct the array type */
4674 cnst->base.type = type_char_ptr;
4675 cnst->string.value = res;
4679 wres = concat_string_wide_string(&res, &token.v.wide_string);
4681 wres = token.v.wide_string;
4686 switch (token.type) {
4687 case T_WIDE_STRING_LITERAL:
4688 wres = concat_wide_strings(&wres, &token.v.wide_string);
4691 case T_STRING_LITERAL:
4692 wres = concat_wide_string_string(&wres, &token.v.string);
4696 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
4697 cnst->base.type = type_wchar_t_ptr;
4698 cnst->wide_string.value = wres;
4707 * Parse an integer constant.
4709 static expression_t *parse_int_const(void)
4711 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
4712 cnst->base.source_position = *HERE;
4713 cnst->base.type = token.datatype;
4714 cnst->conste.v.int_value = token.v.intvalue;
4722 * Parse a character constant.
4724 static expression_t *parse_character_constant(void)
4726 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
4728 cnst->base.source_position = *HERE;
4729 cnst->base.type = token.datatype;
4730 cnst->conste.v.character = token.v.string;
4732 if (cnst->conste.v.character.size != 1) {
4733 if (warning.multichar && (c_mode & _GNUC)) {
4735 warningf(HERE, "multi-character character constant");
4737 errorf(HERE, "more than 1 characters in character constant");
4746 * Parse a wide character constant.
4748 static expression_t *parse_wide_character_constant(void)
4750 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
4752 cnst->base.source_position = *HERE;
4753 cnst->base.type = token.datatype;
4754 cnst->conste.v.wide_character = token.v.wide_string;
4756 if (cnst->conste.v.wide_character.size != 1) {
4757 if (warning.multichar && (c_mode & _GNUC)) {
4759 warningf(HERE, "multi-character character constant");
4761 errorf(HERE, "more than 1 characters in character constant");
4770 * Parse a float constant.
4772 static expression_t *parse_float_const(void)
4774 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
4775 cnst->base.type = token.datatype;
4776 cnst->conste.v.float_value = token.v.floatvalue;
4783 static declaration_t *create_implicit_function(symbol_t *symbol,
4784 const source_position_t *source_position)
4786 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
4787 ntype->function.return_type = type_int;
4788 ntype->function.unspecified_parameters = true;
4790 type_t *type = typehash_insert(ntype);
4795 declaration_t *const declaration = allocate_declaration_zero();
4796 declaration->storage_class = STORAGE_CLASS_EXTERN;
4797 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
4798 declaration->type = type;
4799 declaration->symbol = symbol;
4800 declaration->source_position = *source_position;
4802 bool strict_prototypes_old = warning.strict_prototypes;
4803 warning.strict_prototypes = false;
4804 record_declaration(declaration);
4805 warning.strict_prototypes = strict_prototypes_old;
4811 * Creates a return_type (func)(argument_type) function type if not
4814 * @param return_type the return type
4815 * @param argument_type the argument type
4817 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
4819 function_parameter_t *parameter
4820 = obstack_alloc(type_obst, sizeof(parameter[0]));
4821 memset(parameter, 0, sizeof(parameter[0]));
4822 parameter->type = argument_type;
4824 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
4825 type->function.return_type = return_type;
4826 type->function.parameters = parameter;
4828 type_t *result = typehash_insert(type);
4829 if(result != type) {
4836 static type_t *make_function_0_type(type_t *return_type)
4838 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
4839 type->function.return_type = return_type;
4840 type->function.parameters = NULL;
4842 type_t *result = typehash_insert(type);
4843 if(result != type) {
4851 * Creates a function type for some function like builtins.
4853 * @param symbol the symbol describing the builtin
4855 static type_t *get_builtin_symbol_type(symbol_t *symbol)
4857 switch(symbol->ID) {
4858 case T___builtin_alloca:
4859 return make_function_1_type(type_void_ptr, type_size_t);
4860 case T___builtin_huge_val:
4861 return make_function_0_type(type_double);
4862 case T___builtin_nan:
4863 return make_function_1_type(type_double, type_char_ptr);
4864 case T___builtin_nanf:
4865 return make_function_1_type(type_float, type_char_ptr);
4866 case T___builtin_nand:
4867 return make_function_1_type(type_long_double, type_char_ptr);
4868 case T___builtin_va_end:
4869 return make_function_1_type(type_void, type_valist);
4871 internal_errorf(HERE, "not implemented builtin symbol found");
4876 * Performs automatic type cast as described in § 6.3.2.1.
4878 * @param orig_type the original type
4880 static type_t *automatic_type_conversion(type_t *orig_type)
4882 type_t *type = skip_typeref(orig_type);
4883 if(is_type_array(type)) {
4884 array_type_t *array_type = &type->array;
4885 type_t *element_type = array_type->element_type;
4886 unsigned qualifiers = array_type->base.qualifiers;
4888 return make_pointer_type(element_type, qualifiers);
4891 if(is_type_function(type)) {
4892 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
4899 * reverts the automatic casts of array to pointer types and function
4900 * to function-pointer types as defined § 6.3.2.1
4902 type_t *revert_automatic_type_conversion(const expression_t *expression)
4904 switch (expression->kind) {
4905 case EXPR_REFERENCE: return expression->reference.declaration->type;
4906 case EXPR_SELECT: return expression->select.compound_entry->type;
4908 case EXPR_UNARY_DEREFERENCE: {
4909 const expression_t *const value = expression->unary.value;
4910 type_t *const type = skip_typeref(value->base.type);
4911 assert(is_type_pointer(type));
4912 return type->pointer.points_to;
4915 case EXPR_BUILTIN_SYMBOL:
4916 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
4918 case EXPR_ARRAY_ACCESS: {
4919 const expression_t *array_ref = expression->array_access.array_ref;
4920 type_t *type_left = skip_typeref(array_ref->base.type);
4921 if (!is_type_valid(type_left))
4923 assert(is_type_pointer(type_left));
4924 return type_left->pointer.points_to;
4927 case EXPR_STRING_LITERAL: {
4928 size_t size = expression->string.value.size;
4929 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
4932 case EXPR_WIDE_STRING_LITERAL: {
4933 size_t size = expression->wide_string.value.size;
4934 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
4937 case EXPR_COMPOUND_LITERAL:
4938 return expression->compound_literal.type;
4943 return expression->base.type;
4946 static expression_t *parse_reference(void)
4948 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
4950 reference_expression_t *ref = &expression->reference;
4951 symbol_t *const symbol = token.v.symbol;
4953 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
4955 source_position_t source_position = token.source_position;
4958 if(declaration == NULL) {
4959 if (! strict_mode && token.type == '(') {
4960 /* an implicitly defined function */
4961 if (warning.implicit_function_declaration) {
4962 warningf(HERE, "implicit declaration of function '%Y'",
4966 declaration = create_implicit_function(symbol,
4969 errorf(HERE, "unknown symbol '%Y' found.", symbol);
4970 return create_invalid_expression();
4974 type_t *type = declaration->type;
4976 /* we always do the auto-type conversions; the & and sizeof parser contains
4977 * code to revert this! */
4978 type = automatic_type_conversion(type);
4980 ref->declaration = declaration;
4981 ref->base.type = type;
4983 /* this declaration is used */
4984 declaration->used = true;
4986 /* check for deprecated functions */
4987 if(declaration->deprecated != 0) {
4988 const char *prefix = "";
4989 if (is_type_function(declaration->type))
4990 prefix = "function ";
4992 if (declaration->deprecated_string != NULL) {
4993 warningf(&source_position,
4994 "%s'%Y' was declared 'deprecated(\"%s\")'", prefix, declaration->symbol,
4995 declaration->deprecated_string);
4997 warningf(&source_position,
4998 "%s'%Y' was declared 'deprecated'", prefix, declaration->symbol);
5005 static void check_cast_allowed(expression_t *expression, type_t *dest_type)
5009 /* TODO check if explicit cast is allowed and issue warnings/errors */
5012 static expression_t *parse_compound_literal(type_t *type)
5014 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
5016 parse_initializer_env_t env;
5018 env.declaration = NULL;
5019 env.must_be_constant = false;
5020 initializer_t *initializer = parse_initializer(&env);
5023 expression->compound_literal.initializer = initializer;
5024 expression->compound_literal.type = type;
5025 expression->base.type = automatic_type_conversion(type);
5031 * Parse a cast expression.
5033 static expression_t *parse_cast(void)
5035 source_position_t source_position = token.source_position;
5037 type_t *type = parse_typename();
5039 /* matching add_anchor_token() is at call site */
5040 rem_anchor_token(')');
5043 if(token.type == '{') {
5044 return parse_compound_literal(type);
5047 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
5048 cast->base.source_position = source_position;
5050 expression_t *value = parse_sub_expression(20);
5052 check_cast_allowed(value, type);
5054 cast->base.type = type;
5055 cast->unary.value = value;
5059 return create_invalid_expression();
5063 * Parse a statement expression.
5065 static expression_t *parse_statement_expression(void)
5067 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
5069 statement_t *statement = parse_compound_statement(true);
5070 expression->statement.statement = statement;
5071 expression->base.source_position = statement->base.source_position;
5073 /* find last statement and use its type */
5074 type_t *type = type_void;
5075 const statement_t *stmt = statement->compound.statements;
5077 while (stmt->base.next != NULL)
5078 stmt = stmt->base.next;
5080 if (stmt->kind == STATEMENT_EXPRESSION) {
5081 type = stmt->expression.expression->base.type;
5084 warningf(&expression->base.source_position, "empty statement expression ({})");
5086 expression->base.type = type;
5092 return create_invalid_expression();
5096 * Parse a braced expression.
5098 static expression_t *parse_brace_expression(void)
5101 add_anchor_token(')');
5103 switch(token.type) {
5105 /* gcc extension: a statement expression */
5106 return parse_statement_expression();
5110 return parse_cast();
5112 if(is_typedef_symbol(token.v.symbol)) {
5113 return parse_cast();
5117 expression_t *result = parse_expression();
5118 rem_anchor_token(')');
5123 return create_invalid_expression();
5126 static expression_t *parse_function_keyword(void)
5131 if (current_function == NULL) {
5132 errorf(HERE, "'__func__' used outside of a function");
5135 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5136 expression->base.type = type_char_ptr;
5137 expression->funcname.kind = FUNCNAME_FUNCTION;
5142 static expression_t *parse_pretty_function_keyword(void)
5144 eat(T___PRETTY_FUNCTION__);
5146 if (current_function == NULL) {
5147 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
5150 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5151 expression->base.type = type_char_ptr;
5152 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
5157 static expression_t *parse_funcsig_keyword(void)
5161 if (current_function == NULL) {
5162 errorf(HERE, "'__FUNCSIG__' used outside of a function");
5165 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5166 expression->base.type = type_char_ptr;
5167 expression->funcname.kind = FUNCNAME_FUNCSIG;
5172 static expression_t *parse_funcdname_keyword(void)
5174 eat(T___FUNCDNAME__);
5176 if (current_function == NULL) {
5177 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
5180 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5181 expression->base.type = type_char_ptr;
5182 expression->funcname.kind = FUNCNAME_FUNCDNAME;
5187 static designator_t *parse_designator(void)
5189 designator_t *result = allocate_ast_zero(sizeof(result[0]));
5190 result->source_position = *HERE;
5192 if(token.type != T_IDENTIFIER) {
5193 parse_error_expected("while parsing member designator",
5194 T_IDENTIFIER, NULL);
5197 result->symbol = token.v.symbol;
5200 designator_t *last_designator = result;
5202 if(token.type == '.') {
5204 if(token.type != T_IDENTIFIER) {
5205 parse_error_expected("while parsing member designator",
5206 T_IDENTIFIER, NULL);
5209 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
5210 designator->source_position = *HERE;
5211 designator->symbol = token.v.symbol;
5214 last_designator->next = designator;
5215 last_designator = designator;
5218 if(token.type == '[') {
5220 add_anchor_token(']');
5221 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
5222 designator->source_position = *HERE;
5223 designator->array_index = parse_expression();
5224 rem_anchor_token(']');
5226 if(designator->array_index == NULL) {
5230 last_designator->next = designator;
5231 last_designator = designator;
5243 * Parse the __builtin_offsetof() expression.
5245 static expression_t *parse_offsetof(void)
5247 eat(T___builtin_offsetof);
5249 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
5250 expression->base.type = type_size_t;
5253 add_anchor_token(',');
5254 type_t *type = parse_typename();
5255 rem_anchor_token(',');
5257 add_anchor_token(')');
5258 designator_t *designator = parse_designator();
5259 rem_anchor_token(')');
5262 expression->offsetofe.type = type;
5263 expression->offsetofe.designator = designator;
5266 memset(&path, 0, sizeof(path));
5267 path.top_type = type;
5268 path.path = NEW_ARR_F(type_path_entry_t, 0);
5270 descend_into_subtype(&path);
5272 if(!walk_designator(&path, designator, true)) {
5273 return create_invalid_expression();
5276 DEL_ARR_F(path.path);
5280 return create_invalid_expression();
5284 * Parses a _builtin_va_start() expression.
5286 static expression_t *parse_va_start(void)
5288 eat(T___builtin_va_start);
5290 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
5293 add_anchor_token(',');
5294 expression->va_starte.ap = parse_assignment_expression();
5295 rem_anchor_token(',');
5297 expression_t *const expr = parse_assignment_expression();
5298 if (expr->kind == EXPR_REFERENCE) {
5299 declaration_t *const decl = expr->reference.declaration;
5301 return create_invalid_expression();
5302 if (decl->parent_scope == ¤t_function->scope &&
5303 decl->next == NULL) {
5304 expression->va_starte.parameter = decl;
5309 errorf(&expr->base.source_position,
5310 "second argument of 'va_start' must be last parameter of the current function");
5312 return create_invalid_expression();
5316 * Parses a _builtin_va_arg() expression.
5318 static expression_t *parse_va_arg(void)
5320 eat(T___builtin_va_arg);
5322 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
5325 expression->va_arge.ap = parse_assignment_expression();
5327 expression->base.type = parse_typename();
5332 return create_invalid_expression();
5335 static expression_t *parse_builtin_symbol(void)
5337 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
5339 symbol_t *symbol = token.v.symbol;
5341 expression->builtin_symbol.symbol = symbol;
5344 type_t *type = get_builtin_symbol_type(symbol);
5345 type = automatic_type_conversion(type);
5347 expression->base.type = type;
5352 * Parses a __builtin_constant() expression.
5354 static expression_t *parse_builtin_constant(void)
5356 eat(T___builtin_constant_p);
5358 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
5361 add_anchor_token(')');
5362 expression->builtin_constant.value = parse_assignment_expression();
5363 rem_anchor_token(')');
5365 expression->base.type = type_int;
5369 return create_invalid_expression();
5373 * Parses a __builtin_prefetch() expression.
5375 static expression_t *parse_builtin_prefetch(void)
5377 eat(T___builtin_prefetch);
5379 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
5382 add_anchor_token(')');
5383 expression->builtin_prefetch.adr = parse_assignment_expression();
5384 if (token.type == ',') {
5386 expression->builtin_prefetch.rw = parse_assignment_expression();
5388 if (token.type == ',') {
5390 expression->builtin_prefetch.locality = parse_assignment_expression();
5392 rem_anchor_token(')');
5394 expression->base.type = type_void;
5398 return create_invalid_expression();
5402 * Parses a __builtin_is_*() compare expression.
5404 static expression_t *parse_compare_builtin(void)
5406 expression_t *expression;
5408 switch(token.type) {
5409 case T___builtin_isgreater:
5410 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
5412 case T___builtin_isgreaterequal:
5413 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
5415 case T___builtin_isless:
5416 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
5418 case T___builtin_islessequal:
5419 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
5421 case T___builtin_islessgreater:
5422 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
5424 case T___builtin_isunordered:
5425 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
5428 internal_errorf(HERE, "invalid compare builtin found");
5431 expression->base.source_position = *HERE;
5435 expression->binary.left = parse_assignment_expression();
5437 expression->binary.right = parse_assignment_expression();
5440 type_t *const orig_type_left = expression->binary.left->base.type;
5441 type_t *const orig_type_right = expression->binary.right->base.type;
5443 type_t *const type_left = skip_typeref(orig_type_left);
5444 type_t *const type_right = skip_typeref(orig_type_right);
5445 if(!is_type_float(type_left) && !is_type_float(type_right)) {
5446 if (is_type_valid(type_left) && is_type_valid(type_right)) {
5447 type_error_incompatible("invalid operands in comparison",
5448 &expression->base.source_position, orig_type_left, orig_type_right);
5451 semantic_comparison(&expression->binary);
5456 return create_invalid_expression();
5460 * Parses a __builtin_expect() expression.
5462 static expression_t *parse_builtin_expect(void)
5464 eat(T___builtin_expect);
5466 expression_t *expression
5467 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
5470 expression->binary.left = parse_assignment_expression();
5472 expression->binary.right = parse_constant_expression();
5475 expression->base.type = expression->binary.left->base.type;
5479 return create_invalid_expression();
5483 * Parses a MS assume() expression.
5485 static expression_t *parse_assume(void) {
5488 expression_t *expression
5489 = allocate_expression_zero(EXPR_UNARY_ASSUME);
5492 add_anchor_token(')');
5493 expression->unary.value = parse_assignment_expression();
5494 rem_anchor_token(')');
5497 expression->base.type = type_void;
5500 return create_invalid_expression();
5504 * Parse a microsoft __noop expression.
5506 static expression_t *parse_noop_expression(void) {
5507 source_position_t source_position = *HERE;
5510 if (token.type == '(') {
5511 /* parse arguments */
5513 add_anchor_token(')');
5514 add_anchor_token(',');
5516 if(token.type != ')') {
5518 (void)parse_assignment_expression();
5519 if(token.type != ',')
5525 rem_anchor_token(',');
5526 rem_anchor_token(')');
5529 /* the result is a (int)0 */
5530 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5531 cnst->base.source_position = source_position;
5532 cnst->base.type = type_int;
5533 cnst->conste.v.int_value = 0;
5534 cnst->conste.is_ms_noop = true;
5539 return create_invalid_expression();
5543 * Parses a primary expression.
5545 static expression_t *parse_primary_expression(void)
5547 switch (token.type) {
5548 case T_INTEGER: return parse_int_const();
5549 case T_CHARACTER_CONSTANT: return parse_character_constant();
5550 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
5551 case T_FLOATINGPOINT: return parse_float_const();
5552 case T_STRING_LITERAL:
5553 case T_WIDE_STRING_LITERAL: return parse_string_const();
5554 case T_IDENTIFIER: return parse_reference();
5555 case T___FUNCTION__:
5556 case T___func__: return parse_function_keyword();
5557 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
5558 case T___FUNCSIG__: return parse_funcsig_keyword();
5559 case T___FUNCDNAME__: return parse_funcdname_keyword();
5560 case T___builtin_offsetof: return parse_offsetof();
5561 case T___builtin_va_start: return parse_va_start();
5562 case T___builtin_va_arg: return parse_va_arg();
5563 case T___builtin_expect: return parse_builtin_expect();
5564 case T___builtin_alloca:
5565 case T___builtin_nan:
5566 case T___builtin_nand:
5567 case T___builtin_nanf:
5568 case T___builtin_huge_val:
5569 case T___builtin_va_end: return parse_builtin_symbol();
5570 case T___builtin_isgreater:
5571 case T___builtin_isgreaterequal:
5572 case T___builtin_isless:
5573 case T___builtin_islessequal:
5574 case T___builtin_islessgreater:
5575 case T___builtin_isunordered: return parse_compare_builtin();
5576 case T___builtin_constant_p: return parse_builtin_constant();
5577 case T___builtin_prefetch: return parse_builtin_prefetch();
5578 case T__assume: return parse_assume();
5580 case '(': return parse_brace_expression();
5581 case T___noop: return parse_noop_expression();
5584 errorf(HERE, "unexpected token %K, expected an expression", &token);
5585 return create_invalid_expression();
5589 * Check if the expression has the character type and issue a warning then.
5591 static void check_for_char_index_type(const expression_t *expression) {
5592 type_t *const type = expression->base.type;
5593 const type_t *const base_type = skip_typeref(type);
5595 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
5596 warning.char_subscripts) {
5597 warningf(&expression->base.source_position,
5598 "array subscript has type '%T'", type);
5602 static expression_t *parse_array_expression(unsigned precedence,
5608 add_anchor_token(']');
5610 expression_t *inside = parse_expression();
5612 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
5614 array_access_expression_t *array_access = &expression->array_access;
5616 type_t *const orig_type_left = left->base.type;
5617 type_t *const orig_type_inside = inside->base.type;
5619 type_t *const type_left = skip_typeref(orig_type_left);
5620 type_t *const type_inside = skip_typeref(orig_type_inside);
5622 type_t *return_type;
5623 if (is_type_pointer(type_left)) {
5624 return_type = type_left->pointer.points_to;
5625 array_access->array_ref = left;
5626 array_access->index = inside;
5627 check_for_char_index_type(inside);
5628 } else if (is_type_pointer(type_inside)) {
5629 return_type = type_inside->pointer.points_to;
5630 array_access->array_ref = inside;
5631 array_access->index = left;
5632 array_access->flipped = true;
5633 check_for_char_index_type(left);
5635 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
5637 "array access on object with non-pointer types '%T', '%T'",
5638 orig_type_left, orig_type_inside);
5640 return_type = type_error_type;
5641 array_access->array_ref = create_invalid_expression();
5644 rem_anchor_token(']');
5645 if(token.type != ']') {
5646 parse_error_expected("Problem while parsing array access", ']', NULL);
5651 return_type = automatic_type_conversion(return_type);
5652 expression->base.type = return_type;
5657 static expression_t *parse_typeprop(expression_kind_t const kind,
5658 source_position_t const pos,
5659 unsigned const precedence)
5661 expression_t *tp_expression = allocate_expression_zero(kind);
5662 tp_expression->base.type = type_size_t;
5663 tp_expression->base.source_position = pos;
5665 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
5667 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
5669 add_anchor_token(')');
5670 type_t* const orig_type = parse_typename();
5671 tp_expression->typeprop.type = orig_type;
5673 type_t const* const type = skip_typeref(orig_type);
5674 char const* const wrong_type =
5675 is_type_incomplete(type) ? "incomplete" :
5676 type->kind == TYPE_FUNCTION ? "function designator" :
5677 type->kind == TYPE_BITFIELD ? "bitfield" :
5679 if (wrong_type != NULL) {
5680 errorf(&pos, "operand of %s expression must not be %s type '%T'",
5681 what, wrong_type, type);
5684 rem_anchor_token(')');
5687 expression_t *expression = parse_sub_expression(precedence);
5689 type_t* const orig_type = revert_automatic_type_conversion(expression);
5690 expression->base.type = orig_type;
5692 type_t const* const type = skip_typeref(orig_type);
5693 char const* const wrong_type =
5694 is_type_incomplete(type) ? "incomplete" :
5695 type->kind == TYPE_FUNCTION ? "function designator" :
5696 type->kind == TYPE_BITFIELD ? "bitfield" :
5698 if (wrong_type != NULL) {
5699 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
5702 tp_expression->typeprop.type = expression->base.type;
5703 tp_expression->typeprop.tp_expression = expression;
5706 return tp_expression;
5708 return create_invalid_expression();
5711 static expression_t *parse_sizeof(unsigned precedence)
5713 source_position_t pos = *HERE;
5715 return parse_typeprop(EXPR_SIZEOF, pos, precedence);
5718 static expression_t *parse_alignof(unsigned precedence)
5720 source_position_t pos = *HERE;
5722 return parse_typeprop(EXPR_ALIGNOF, pos, precedence);
5725 static expression_t *parse_select_expression(unsigned precedence,
5726 expression_t *compound)
5729 assert(token.type == '.' || token.type == T_MINUSGREATER);
5731 bool is_pointer = (token.type == T_MINUSGREATER);
5734 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5735 select->select.compound = compound;
5737 if (token.type != T_IDENTIFIER) {
5738 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
5741 symbol_t *symbol = token.v.symbol;
5742 select->select.symbol = symbol;
5745 type_t *const orig_type = compound->base.type;
5746 type_t *const type = skip_typeref(orig_type);
5748 type_t *type_left = type;
5750 if (!is_type_pointer(type)) {
5751 if (is_type_valid(type)) {
5752 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
5754 return create_invalid_expression();
5756 type_left = type->pointer.points_to;
5758 type_left = skip_typeref(type_left);
5760 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
5761 type_left->kind != TYPE_COMPOUND_UNION) {
5762 if (is_type_valid(type_left)) {
5763 errorf(HERE, "request for member '%Y' in something not a struct or "
5764 "union, but '%T'", symbol, type_left);
5766 return create_invalid_expression();
5769 declaration_t *const declaration = type_left->compound.declaration;
5771 if (!declaration->init.complete) {
5772 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
5774 return create_invalid_expression();
5777 declaration_t *iter = find_compound_entry(declaration, symbol);
5779 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
5780 return create_invalid_expression();
5783 /* we always do the auto-type conversions; the & and sizeof parser contains
5784 * code to revert this! */
5785 type_t *expression_type = automatic_type_conversion(iter->type);
5787 select->select.compound_entry = iter;
5788 select->base.type = expression_type;
5790 type_t *skipped = skip_typeref(iter->type);
5791 if (skipped->kind == TYPE_BITFIELD) {
5792 select->base.type = skipped->bitfield.base_type;
5799 * Parse a call expression, ie. expression '( ... )'.
5801 * @param expression the function address
5803 static expression_t *parse_call_expression(unsigned precedence,
5804 expression_t *expression)
5807 expression_t *result = allocate_expression_zero(EXPR_CALL);
5808 result->base.source_position = expression->base.source_position;
5810 call_expression_t *call = &result->call;
5811 call->function = expression;
5813 type_t *const orig_type = expression->base.type;
5814 type_t *const type = skip_typeref(orig_type);
5816 function_type_t *function_type = NULL;
5817 if (is_type_pointer(type)) {
5818 type_t *const to_type = skip_typeref(type->pointer.points_to);
5820 if (is_type_function(to_type)) {
5821 function_type = &to_type->function;
5822 call->base.type = function_type->return_type;
5826 if (function_type == NULL && is_type_valid(type)) {
5827 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
5830 /* parse arguments */
5832 add_anchor_token(')');
5833 add_anchor_token(',');
5835 if(token.type != ')') {
5836 call_argument_t *last_argument = NULL;
5839 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
5841 argument->expression = parse_assignment_expression();
5842 if(last_argument == NULL) {
5843 call->arguments = argument;
5845 last_argument->next = argument;
5847 last_argument = argument;
5849 if(token.type != ',')
5854 rem_anchor_token(',');
5855 rem_anchor_token(')');
5858 if(function_type == NULL)
5861 function_parameter_t *parameter = function_type->parameters;
5862 call_argument_t *argument = call->arguments;
5863 if (!function_type->unspecified_parameters) {
5864 for( ; parameter != NULL && argument != NULL;
5865 parameter = parameter->next, argument = argument->next) {
5866 type_t *expected_type = parameter->type;
5867 /* TODO report scope in error messages */
5868 expression_t *const arg_expr = argument->expression;
5869 type_t *const res_type = semantic_assign(expected_type, arg_expr,
5871 &arg_expr->base.source_position);
5872 if (res_type == NULL) {
5873 /* TODO improve error message */
5874 errorf(&arg_expr->base.source_position,
5875 "Cannot call function with argument '%E' of type '%T' where type '%T' is expected",
5876 arg_expr, arg_expr->base.type, expected_type);
5878 argument->expression = create_implicit_cast(argument->expression, expected_type);
5882 if (parameter != NULL) {
5883 errorf(HERE, "too few arguments to function '%E'", expression);
5884 } else if (argument != NULL && !function_type->variadic) {
5885 errorf(HERE, "too many arguments to function '%E'", expression);
5889 /* do default promotion */
5890 for( ; argument != NULL; argument = argument->next) {
5891 type_t *type = argument->expression->base.type;
5893 type = get_default_promoted_type(type);
5895 argument->expression
5896 = create_implicit_cast(argument->expression, type);
5899 check_format(&result->call);
5903 return create_invalid_expression();
5906 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
5908 static bool same_compound_type(const type_t *type1, const type_t *type2)
5911 is_type_compound(type1) &&
5912 type1->kind == type2->kind &&
5913 type1->compound.declaration == type2->compound.declaration;
5917 * Parse a conditional expression, ie. 'expression ? ... : ...'.
5919 * @param expression the conditional expression
5921 static expression_t *parse_conditional_expression(unsigned precedence,
5922 expression_t *expression)
5925 add_anchor_token(':');
5927 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
5929 conditional_expression_t *conditional = &result->conditional;
5930 conditional->condition = expression;
5933 type_t *const condition_type_orig = expression->base.type;
5934 type_t *const condition_type = skip_typeref(condition_type_orig);
5935 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
5936 type_error("expected a scalar type in conditional condition",
5937 &expression->base.source_position, condition_type_orig);
5940 expression_t *true_expression = parse_expression();
5941 rem_anchor_token(':');
5943 expression_t *false_expression = parse_sub_expression(precedence);
5945 type_t *const orig_true_type = true_expression->base.type;
5946 type_t *const orig_false_type = false_expression->base.type;
5947 type_t *const true_type = skip_typeref(orig_true_type);
5948 type_t *const false_type = skip_typeref(orig_false_type);
5951 type_t *result_type;
5952 if(is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
5953 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
5954 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID)
5955 || !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
5956 warningf(&expression->base.source_position,
5957 "ISO C forbids conditional expression with only one void side");
5959 result_type = type_void;
5960 } else if (is_type_arithmetic(true_type)
5961 && is_type_arithmetic(false_type)) {
5962 result_type = semantic_arithmetic(true_type, false_type);
5964 true_expression = create_implicit_cast(true_expression, result_type);
5965 false_expression = create_implicit_cast(false_expression, result_type);
5967 conditional->true_expression = true_expression;
5968 conditional->false_expression = false_expression;
5969 conditional->base.type = result_type;
5970 } else if (same_compound_type(true_type, false_type)) {
5971 /* just take 1 of the 2 types */
5972 result_type = true_type;
5973 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
5974 type_t *pointer_type;
5976 expression_t *other_expression;
5977 if (is_type_pointer(true_type)) {
5978 pointer_type = true_type;
5979 other_type = false_type;
5980 other_expression = false_expression;
5982 pointer_type = false_type;
5983 other_type = true_type;
5984 other_expression = true_expression;
5987 if(is_type_pointer(other_type)) {
5988 if(!pointers_compatible(true_type, false_type)) {
5989 warningf(&expression->base.source_position,
5990 "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
5992 result_type = true_type;
5993 } else if(is_null_pointer_constant(other_expression)) {
5994 result_type = pointer_type;
5995 } else if(is_type_integer(other_type)) {
5996 warningf(&expression->base.source_position,
5997 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
5998 result_type = pointer_type;
6000 type_error_incompatible("while parsing conditional",
6001 &expression->base.source_position, true_type, false_type);
6002 result_type = type_error_type;
6005 /* TODO: one pointer to void*, other some pointer */
6007 if (is_type_valid(true_type) && is_type_valid(false_type)) {
6008 type_error_incompatible("while parsing conditional",
6009 &expression->base.source_position, true_type,
6012 result_type = type_error_type;
6015 conditional->true_expression
6016 = create_implicit_cast(true_expression, result_type);
6017 conditional->false_expression
6018 = create_implicit_cast(false_expression, result_type);
6019 conditional->base.type = result_type;
6022 return create_invalid_expression();
6026 * Parse an extension expression.
6028 static expression_t *parse_extension(unsigned precedence)
6030 eat(T___extension__);
6032 /* TODO enable extensions */
6033 expression_t *expression = parse_sub_expression(precedence);
6034 /* TODO disable extensions */
6039 * Parse a __builtin_classify_type() expression.
6041 static expression_t *parse_builtin_classify_type(const unsigned precedence)
6043 eat(T___builtin_classify_type);
6045 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
6046 result->base.type = type_int;
6049 add_anchor_token(')');
6050 expression_t *expression = parse_sub_expression(precedence);
6051 rem_anchor_token(')');
6053 result->classify_type.type_expression = expression;
6057 return create_invalid_expression();
6060 static void semantic_incdec(unary_expression_t *expression)
6062 type_t *const orig_type = expression->value->base.type;
6063 type_t *const type = skip_typeref(orig_type);
6064 /* TODO !is_type_real && !is_type_pointer */
6065 if(!is_type_arithmetic(type) && type->kind != TYPE_POINTER) {
6066 if (is_type_valid(type)) {
6067 /* TODO: improve error message */
6068 errorf(HERE, "operation needs an arithmetic or pointer type");
6073 expression->base.type = orig_type;
6076 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
6078 type_t *const orig_type = expression->value->base.type;
6079 type_t *const type = skip_typeref(orig_type);
6080 if(!is_type_arithmetic(type)) {
6081 if (is_type_valid(type)) {
6082 /* TODO: improve error message */
6083 errorf(HERE, "operation needs an arithmetic type");
6088 expression->base.type = orig_type;
6091 static void semantic_unexpr_scalar(unary_expression_t *expression)
6093 type_t *const orig_type = expression->value->base.type;
6094 type_t *const type = skip_typeref(orig_type);
6095 if (!is_type_scalar(type)) {
6096 if (is_type_valid(type)) {
6097 errorf(HERE, "operand of ! must be of scalar type");
6102 expression->base.type = orig_type;
6105 static void semantic_unexpr_integer(unary_expression_t *expression)
6107 type_t *const orig_type = expression->value->base.type;
6108 type_t *const type = skip_typeref(orig_type);
6109 if (!is_type_integer(type)) {
6110 if (is_type_valid(type)) {
6111 errorf(HERE, "operand of ~ must be of integer type");
6116 expression->base.type = orig_type;
6119 static void semantic_dereference(unary_expression_t *expression)
6121 type_t *const orig_type = expression->value->base.type;
6122 type_t *const type = skip_typeref(orig_type);
6123 if(!is_type_pointer(type)) {
6124 if (is_type_valid(type)) {
6125 errorf(HERE, "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
6130 type_t *result_type = type->pointer.points_to;
6131 result_type = automatic_type_conversion(result_type);
6132 expression->base.type = result_type;
6136 * Check the semantic of the address taken expression.
6138 static void semantic_take_addr(unary_expression_t *expression)
6140 expression_t *value = expression->value;
6141 value->base.type = revert_automatic_type_conversion(value);
6143 type_t *orig_type = value->base.type;
6144 if(!is_type_valid(orig_type))
6147 if(value->kind == EXPR_REFERENCE) {
6148 declaration_t *const declaration = value->reference.declaration;
6149 if(declaration != NULL) {
6150 if (declaration->storage_class == STORAGE_CLASS_REGISTER) {
6151 errorf(&expression->base.source_position,
6152 "address of register variable '%Y' requested",
6153 declaration->symbol);
6155 declaration->address_taken = 1;
6159 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6162 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
6163 static expression_t *parse_##unexpression_type(unsigned precedence) \
6167 expression_t *unary_expression \
6168 = allocate_expression_zero(unexpression_type); \
6169 unary_expression->base.source_position = *HERE; \
6170 unary_expression->unary.value = parse_sub_expression(precedence); \
6172 sfunc(&unary_expression->unary); \
6174 return unary_expression; \
6177 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
6178 semantic_unexpr_arithmetic)
6179 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
6180 semantic_unexpr_arithmetic)
6181 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
6182 semantic_unexpr_scalar)
6183 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
6184 semantic_dereference)
6185 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
6187 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
6188 semantic_unexpr_integer)
6189 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
6191 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
6194 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
6196 static expression_t *parse_##unexpression_type(unsigned precedence, \
6197 expression_t *left) \
6199 (void) precedence; \
6202 expression_t *unary_expression \
6203 = allocate_expression_zero(unexpression_type); \
6204 unary_expression->unary.value = left; \
6206 sfunc(&unary_expression->unary); \
6208 return unary_expression; \
6211 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
6212 EXPR_UNARY_POSTFIX_INCREMENT,
6214 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
6215 EXPR_UNARY_POSTFIX_DECREMENT,
6218 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
6220 /* TODO: handle complex + imaginary types */
6222 /* § 6.3.1.8 Usual arithmetic conversions */
6223 if(type_left == type_long_double || type_right == type_long_double) {
6224 return type_long_double;
6225 } else if(type_left == type_double || type_right == type_double) {
6227 } else if(type_left == type_float || type_right == type_float) {
6231 type_right = promote_integer(type_right);
6232 type_left = promote_integer(type_left);
6234 if(type_left == type_right)
6237 bool signed_left = is_type_signed(type_left);
6238 bool signed_right = is_type_signed(type_right);
6239 int rank_left = get_rank(type_left);
6240 int rank_right = get_rank(type_right);
6241 if(rank_left < rank_right) {
6242 if(signed_left == signed_right || !signed_right) {
6248 if(signed_left == signed_right || !signed_left) {
6257 * Check the semantic restrictions for a binary expression.
6259 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
6261 expression_t *const left = expression->left;
6262 expression_t *const right = expression->right;
6263 type_t *const orig_type_left = left->base.type;
6264 type_t *const orig_type_right = right->base.type;
6265 type_t *const type_left = skip_typeref(orig_type_left);
6266 type_t *const type_right = skip_typeref(orig_type_right);
6268 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
6269 /* TODO: improve error message */
6270 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6271 errorf(HERE, "operation needs arithmetic types");
6276 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6277 expression->left = create_implicit_cast(left, arithmetic_type);
6278 expression->right = create_implicit_cast(right, arithmetic_type);
6279 expression->base.type = arithmetic_type;
6282 static void semantic_shift_op(binary_expression_t *expression)
6284 expression_t *const left = expression->left;
6285 expression_t *const right = expression->right;
6286 type_t *const orig_type_left = left->base.type;
6287 type_t *const orig_type_right = right->base.type;
6288 type_t * type_left = skip_typeref(orig_type_left);
6289 type_t * type_right = skip_typeref(orig_type_right);
6291 if(!is_type_integer(type_left) || !is_type_integer(type_right)) {
6292 /* TODO: improve error message */
6293 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6294 errorf(HERE, "operation needs integer types");
6299 type_left = promote_integer(type_left);
6300 type_right = promote_integer(type_right);
6302 expression->left = create_implicit_cast(left, type_left);
6303 expression->right = create_implicit_cast(right, type_right);
6304 expression->base.type = type_left;
6307 static void semantic_add(binary_expression_t *expression)
6309 expression_t *const left = expression->left;
6310 expression_t *const right = expression->right;
6311 type_t *const orig_type_left = left->base.type;
6312 type_t *const orig_type_right = right->base.type;
6313 type_t *const type_left = skip_typeref(orig_type_left);
6314 type_t *const type_right = skip_typeref(orig_type_right);
6317 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
6318 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6319 expression->left = create_implicit_cast(left, arithmetic_type);
6320 expression->right = create_implicit_cast(right, arithmetic_type);
6321 expression->base.type = arithmetic_type;
6323 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
6324 expression->base.type = type_left;
6325 } else if(is_type_pointer(type_right) && is_type_integer(type_left)) {
6326 expression->base.type = type_right;
6327 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
6328 errorf(HERE, "invalid operands to binary + ('%T', '%T')", orig_type_left, orig_type_right);
6332 static void semantic_sub(binary_expression_t *expression)
6334 expression_t *const left = expression->left;
6335 expression_t *const right = expression->right;
6336 type_t *const orig_type_left = left->base.type;
6337 type_t *const orig_type_right = right->base.type;
6338 type_t *const type_left = skip_typeref(orig_type_left);
6339 type_t *const type_right = skip_typeref(orig_type_right);
6342 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
6343 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6344 expression->left = create_implicit_cast(left, arithmetic_type);
6345 expression->right = create_implicit_cast(right, arithmetic_type);
6346 expression->base.type = arithmetic_type;
6348 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
6349 expression->base.type = type_left;
6350 } else if(is_type_pointer(type_left) && is_type_pointer(type_right)) {
6351 if(!pointers_compatible(type_left, type_right)) {
6353 "pointers to incompatible objects to binary '-' ('%T', '%T')",
6354 orig_type_left, orig_type_right);
6356 expression->base.type = type_ptrdiff_t;
6358 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
6359 errorf(HERE, "invalid operands to binary '-' ('%T', '%T')",
6360 orig_type_left, orig_type_right);
6365 * Check the semantics of comparison expressions.
6367 * @param expression The expression to check.
6369 static void semantic_comparison(binary_expression_t *expression)
6371 expression_t *left = expression->left;
6372 expression_t *right = expression->right;
6373 type_t *orig_type_left = left->base.type;
6374 type_t *orig_type_right = right->base.type;
6376 type_t *type_left = skip_typeref(orig_type_left);
6377 type_t *type_right = skip_typeref(orig_type_right);
6379 /* TODO non-arithmetic types */
6380 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
6381 /* test for signed vs unsigned compares */
6382 if (warning.sign_compare &&
6383 (expression->base.kind != EXPR_BINARY_EQUAL &&
6384 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
6385 (is_type_signed(type_left) != is_type_signed(type_right))) {
6387 /* check if 1 of the operands is a constant, in this case we just
6388 * check wether we can safely represent the resulting constant in
6389 * the type of the other operand. */
6390 expression_t *const_expr = NULL;
6391 expression_t *other_expr = NULL;
6393 if(is_constant_expression(left)) {
6396 } else if(is_constant_expression(right)) {
6401 if(const_expr != NULL) {
6402 type_t *other_type = skip_typeref(other_expr->base.type);
6403 long val = fold_constant(const_expr);
6404 /* TODO: check if val can be represented by other_type */
6408 warningf(&expression->base.source_position,
6409 "comparison between signed and unsigned");
6411 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6412 expression->left = create_implicit_cast(left, arithmetic_type);
6413 expression->right = create_implicit_cast(right, arithmetic_type);
6414 expression->base.type = arithmetic_type;
6415 if (warning.float_equal &&
6416 (expression->base.kind == EXPR_BINARY_EQUAL ||
6417 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
6418 is_type_float(arithmetic_type)) {
6419 warningf(&expression->base.source_position,
6420 "comparing floating point with == or != is unsafe");
6422 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
6423 /* TODO check compatibility */
6424 } else if (is_type_pointer(type_left)) {
6425 expression->right = create_implicit_cast(right, type_left);
6426 } else if (is_type_pointer(type_right)) {
6427 expression->left = create_implicit_cast(left, type_right);
6428 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
6429 type_error_incompatible("invalid operands in comparison",
6430 &expression->base.source_position,
6431 type_left, type_right);
6433 expression->base.type = type_int;
6437 * Checks if a compound type has constant fields.
6439 static bool has_const_fields(const compound_type_t *type)
6441 const scope_t *scope = &type->declaration->scope;
6442 const declaration_t *declaration = scope->declarations;
6444 for (; declaration != NULL; declaration = declaration->next) {
6445 if (declaration->namespc != NAMESPACE_NORMAL)
6448 const type_t *decl_type = skip_typeref(declaration->type);
6449 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
6456 static bool is_valid_assignment_lhs(expression_t const* const left)
6458 type_t *const orig_type_left = revert_automatic_type_conversion(left);
6459 type_t *const type_left = skip_typeref(orig_type_left);
6461 switch (left->kind) {
6462 case EXPR_REFERENCE:
6463 case EXPR_ARRAY_ACCESS:
6465 case EXPR_UNARY_DEREFERENCE:
6469 errorf(HERE, "left hand side '%E' of assignment is not an lvalue", left);
6473 if (is_type_array(type_left)) {
6474 errorf(HERE, "cannot assign to arrays ('%E')", left);
6477 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
6478 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
6482 if (is_type_incomplete(type_left)) {
6483 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
6484 left, orig_type_left);
6487 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
6488 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
6489 left, orig_type_left);
6496 static void semantic_arithmetic_assign(binary_expression_t *expression)
6498 expression_t *left = expression->left;
6499 expression_t *right = expression->right;
6500 type_t *orig_type_left = left->base.type;
6501 type_t *orig_type_right = right->base.type;
6503 if (!is_valid_assignment_lhs(left))
6506 type_t *type_left = skip_typeref(orig_type_left);
6507 type_t *type_right = skip_typeref(orig_type_right);
6509 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
6510 /* TODO: improve error message */
6511 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6512 errorf(HERE, "operation needs arithmetic types");
6517 /* combined instructions are tricky. We can't create an implicit cast on
6518 * the left side, because we need the uncasted form for the store.
6519 * The ast2firm pass has to know that left_type must be right_type
6520 * for the arithmetic operation and create a cast by itself */
6521 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6522 expression->right = create_implicit_cast(right, arithmetic_type);
6523 expression->base.type = type_left;
6526 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
6528 expression_t *const left = expression->left;
6529 expression_t *const right = expression->right;
6530 type_t *const orig_type_left = left->base.type;
6531 type_t *const orig_type_right = right->base.type;
6532 type_t *const type_left = skip_typeref(orig_type_left);
6533 type_t *const type_right = skip_typeref(orig_type_right);
6535 if (!is_valid_assignment_lhs(left))
6538 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
6539 /* combined instructions are tricky. We can't create an implicit cast on
6540 * the left side, because we need the uncasted form for the store.
6541 * The ast2firm pass has to know that left_type must be right_type
6542 * for the arithmetic operation and create a cast by itself */
6543 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
6544 expression->right = create_implicit_cast(right, arithmetic_type);
6545 expression->base.type = type_left;
6546 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
6547 expression->base.type = type_left;
6548 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
6549 errorf(HERE, "incompatible types '%T' and '%T' in assignment", orig_type_left, orig_type_right);
6554 * Check the semantic restrictions of a logical expression.
6556 static void semantic_logical_op(binary_expression_t *expression)
6558 expression_t *const left = expression->left;
6559 expression_t *const right = expression->right;
6560 type_t *const orig_type_left = left->base.type;
6561 type_t *const orig_type_right = right->base.type;
6562 type_t *const type_left = skip_typeref(orig_type_left);
6563 type_t *const type_right = skip_typeref(orig_type_right);
6565 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
6566 /* TODO: improve error message */
6567 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6568 errorf(HERE, "operation needs scalar types");
6573 expression->base.type = type_int;
6577 * Check the semantic restrictions of a binary assign expression.
6579 static void semantic_binexpr_assign(binary_expression_t *expression)
6581 expression_t *left = expression->left;
6582 type_t *orig_type_left = left->base.type;
6584 type_t *type_left = revert_automatic_type_conversion(left);
6585 type_left = skip_typeref(orig_type_left);
6587 if (!is_valid_assignment_lhs(left))
6590 type_t *const res_type = semantic_assign(orig_type_left, expression->right,
6591 "assignment", &left->base.source_position);
6592 if (res_type == NULL) {
6593 errorf(&expression->base.source_position,
6594 "cannot assign to '%T' from '%T'",
6595 orig_type_left, expression->right->base.type);
6597 expression->right = create_implicit_cast(expression->right, res_type);
6600 expression->base.type = orig_type_left;
6604 * Determine if the outermost operation (or parts thereof) of the given
6605 * expression has no effect in order to generate a warning about this fact.
6606 * Therefore in some cases this only examines some of the operands of the
6607 * expression (see comments in the function and examples below).
6609 * f() + 23; // warning, because + has no effect
6610 * x || f(); // no warning, because x controls execution of f()
6611 * x ? y : f(); // warning, because y has no effect
6612 * (void)x; // no warning to be able to suppress the warning
6613 * This function can NOT be used for an "expression has definitely no effect"-
6615 static bool expression_has_effect(const expression_t *const expr)
6617 switch (expr->kind) {
6618 case EXPR_UNKNOWN: break;
6619 case EXPR_INVALID: return true; /* do NOT warn */
6620 case EXPR_REFERENCE: return false;
6621 /* suppress the warning for microsoft __noop operations */
6622 case EXPR_CONST: return expr->conste.is_ms_noop;
6623 case EXPR_CHARACTER_CONSTANT: return false;
6624 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
6625 case EXPR_STRING_LITERAL: return false;
6626 case EXPR_WIDE_STRING_LITERAL: return false;
6629 const call_expression_t *const call = &expr->call;
6630 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
6633 switch (call->function->builtin_symbol.symbol->ID) {
6634 case T___builtin_va_end: return true;
6635 default: return false;
6639 /* Generate the warning if either the left or right hand side of a
6640 * conditional expression has no effect */
6641 case EXPR_CONDITIONAL: {
6642 const conditional_expression_t *const cond = &expr->conditional;
6644 expression_has_effect(cond->true_expression) &&
6645 expression_has_effect(cond->false_expression);
6648 case EXPR_SELECT: return false;
6649 case EXPR_ARRAY_ACCESS: return false;
6650 case EXPR_SIZEOF: return false;
6651 case EXPR_CLASSIFY_TYPE: return false;
6652 case EXPR_ALIGNOF: return false;
6654 case EXPR_FUNCNAME: return false;
6655 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
6656 case EXPR_BUILTIN_CONSTANT_P: return false;
6657 case EXPR_BUILTIN_PREFETCH: return true;
6658 case EXPR_OFFSETOF: return false;
6659 case EXPR_VA_START: return true;
6660 case EXPR_VA_ARG: return true;
6661 case EXPR_STATEMENT: return true; // TODO
6662 case EXPR_COMPOUND_LITERAL: return false;
6664 case EXPR_UNARY_NEGATE: return false;
6665 case EXPR_UNARY_PLUS: return false;
6666 case EXPR_UNARY_BITWISE_NEGATE: return false;
6667 case EXPR_UNARY_NOT: return false;
6668 case EXPR_UNARY_DEREFERENCE: return false;
6669 case EXPR_UNARY_TAKE_ADDRESS: return false;
6670 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
6671 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
6672 case EXPR_UNARY_PREFIX_INCREMENT: return true;
6673 case EXPR_UNARY_PREFIX_DECREMENT: return true;
6675 /* Treat void casts as if they have an effect in order to being able to
6676 * suppress the warning */
6677 case EXPR_UNARY_CAST: {
6678 type_t *const type = skip_typeref(expr->base.type);
6679 return is_type_atomic(type, ATOMIC_TYPE_VOID);
6682 case EXPR_UNARY_CAST_IMPLICIT: return true;
6683 case EXPR_UNARY_ASSUME: return true;
6685 case EXPR_BINARY_ADD: return false;
6686 case EXPR_BINARY_SUB: return false;
6687 case EXPR_BINARY_MUL: return false;
6688 case EXPR_BINARY_DIV: return false;
6689 case EXPR_BINARY_MOD: return false;
6690 case EXPR_BINARY_EQUAL: return false;
6691 case EXPR_BINARY_NOTEQUAL: return false;
6692 case EXPR_BINARY_LESS: return false;
6693 case EXPR_BINARY_LESSEQUAL: return false;
6694 case EXPR_BINARY_GREATER: return false;
6695 case EXPR_BINARY_GREATEREQUAL: return false;
6696 case EXPR_BINARY_BITWISE_AND: return false;
6697 case EXPR_BINARY_BITWISE_OR: return false;
6698 case EXPR_BINARY_BITWISE_XOR: return false;
6699 case EXPR_BINARY_SHIFTLEFT: return false;
6700 case EXPR_BINARY_SHIFTRIGHT: return false;
6701 case EXPR_BINARY_ASSIGN: return true;
6702 case EXPR_BINARY_MUL_ASSIGN: return true;
6703 case EXPR_BINARY_DIV_ASSIGN: return true;
6704 case EXPR_BINARY_MOD_ASSIGN: return true;
6705 case EXPR_BINARY_ADD_ASSIGN: return true;
6706 case EXPR_BINARY_SUB_ASSIGN: return true;
6707 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
6708 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
6709 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
6710 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
6711 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
6713 /* Only examine the right hand side of && and ||, because the left hand
6714 * side already has the effect of controlling the execution of the right
6716 case EXPR_BINARY_LOGICAL_AND:
6717 case EXPR_BINARY_LOGICAL_OR:
6718 /* Only examine the right hand side of a comma expression, because the left
6719 * hand side has a separate warning */
6720 case EXPR_BINARY_COMMA:
6721 return expression_has_effect(expr->binary.right);
6723 case EXPR_BINARY_BUILTIN_EXPECT: return true;
6724 case EXPR_BINARY_ISGREATER: return false;
6725 case EXPR_BINARY_ISGREATEREQUAL: return false;
6726 case EXPR_BINARY_ISLESS: return false;
6727 case EXPR_BINARY_ISLESSEQUAL: return false;
6728 case EXPR_BINARY_ISLESSGREATER: return false;
6729 case EXPR_BINARY_ISUNORDERED: return false;
6732 internal_errorf(HERE, "unexpected expression");
6735 static void semantic_comma(binary_expression_t *expression)
6737 if (warning.unused_value) {
6738 const expression_t *const left = expression->left;
6739 if (!expression_has_effect(left)) {
6740 warningf(&left->base.source_position,
6741 "left-hand operand of comma expression has no effect");
6744 expression->base.type = expression->right->base.type;
6747 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
6748 static expression_t *parse_##binexpression_type(unsigned precedence, \
6749 expression_t *left) \
6752 source_position_t pos = *HERE; \
6754 expression_t *right = parse_sub_expression(precedence + lr); \
6756 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
6757 binexpr->base.source_position = pos; \
6758 binexpr->binary.left = left; \
6759 binexpr->binary.right = right; \
6760 sfunc(&binexpr->binary); \
6765 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
6766 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
6767 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_binexpr_arithmetic, 1)
6768 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_binexpr_arithmetic, 1)
6769 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
6770 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
6771 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
6772 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
6773 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
6775 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
6776 semantic_comparison, 1)
6777 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
6778 semantic_comparison, 1)
6779 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
6780 semantic_comparison, 1)
6781 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
6782 semantic_comparison, 1)
6784 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
6785 semantic_binexpr_arithmetic, 1)
6786 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
6787 semantic_binexpr_arithmetic, 1)
6788 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
6789 semantic_binexpr_arithmetic, 1)
6790 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
6791 semantic_logical_op, 1)
6792 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
6793 semantic_logical_op, 1)
6794 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
6795 semantic_shift_op, 1)
6796 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
6797 semantic_shift_op, 1)
6798 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
6799 semantic_arithmetic_addsubb_assign, 0)
6800 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
6801 semantic_arithmetic_addsubb_assign, 0)
6802 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
6803 semantic_arithmetic_assign, 0)
6804 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
6805 semantic_arithmetic_assign, 0)
6806 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
6807 semantic_arithmetic_assign, 0)
6808 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
6809 semantic_arithmetic_assign, 0)
6810 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
6811 semantic_arithmetic_assign, 0)
6812 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
6813 semantic_arithmetic_assign, 0)
6814 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
6815 semantic_arithmetic_assign, 0)
6816 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
6817 semantic_arithmetic_assign, 0)
6819 static expression_t *parse_sub_expression(unsigned precedence)
6821 if(token.type < 0) {
6822 return expected_expression_error();
6825 expression_parser_function_t *parser
6826 = &expression_parsers[token.type];
6827 source_position_t source_position = token.source_position;
6830 if(parser->parser != NULL) {
6831 left = parser->parser(parser->precedence);
6833 left = parse_primary_expression();
6835 assert(left != NULL);
6836 left->base.source_position = source_position;
6839 if(token.type < 0) {
6840 return expected_expression_error();
6843 parser = &expression_parsers[token.type];
6844 if(parser->infix_parser == NULL)
6846 if(parser->infix_precedence < precedence)
6849 left = parser->infix_parser(parser->infix_precedence, left);
6851 assert(left != NULL);
6852 assert(left->kind != EXPR_UNKNOWN);
6853 left->base.source_position = source_position;
6860 * Parse an expression.
6862 static expression_t *parse_expression(void)
6864 return parse_sub_expression(1);
6868 * Register a parser for a prefix-like operator with given precedence.
6870 * @param parser the parser function
6871 * @param token_type the token type of the prefix token
6872 * @param precedence the precedence of the operator
6874 static void register_expression_parser(parse_expression_function parser,
6875 int token_type, unsigned precedence)
6877 expression_parser_function_t *entry = &expression_parsers[token_type];
6879 if(entry->parser != NULL) {
6880 diagnosticf("for token '%k'\n", (token_type_t)token_type);
6881 panic("trying to register multiple expression parsers for a token");
6883 entry->parser = parser;
6884 entry->precedence = precedence;
6888 * Register a parser for an infix operator with given precedence.
6890 * @param parser the parser function
6891 * @param token_type the token type of the infix operator
6892 * @param precedence the precedence of the operator
6894 static void register_infix_parser(parse_expression_infix_function parser,
6895 int token_type, unsigned precedence)
6897 expression_parser_function_t *entry = &expression_parsers[token_type];
6899 if(entry->infix_parser != NULL) {
6900 diagnosticf("for token '%k'\n", (token_type_t)token_type);
6901 panic("trying to register multiple infix expression parsers for a "
6904 entry->infix_parser = parser;
6905 entry->infix_precedence = precedence;
6909 * Initialize the expression parsers.
6911 static void init_expression_parsers(void)
6913 memset(&expression_parsers, 0, sizeof(expression_parsers));
6915 register_infix_parser(parse_array_expression, '[', 30);
6916 register_infix_parser(parse_call_expression, '(', 30);
6917 register_infix_parser(parse_select_expression, '.', 30);
6918 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
6919 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
6921 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
6924 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 17);
6925 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 17);
6926 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 17);
6927 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 16);
6928 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 16);
6929 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 15);
6930 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 15);
6931 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
6932 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
6933 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
6934 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
6935 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
6936 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
6937 T_EXCLAMATIONMARKEQUAL, 13);
6938 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
6939 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
6940 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
6941 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
6942 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
6943 register_infix_parser(parse_conditional_expression, '?', 7);
6944 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
6945 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
6946 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
6947 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
6948 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
6949 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
6950 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
6951 T_LESSLESSEQUAL, 2);
6952 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
6953 T_GREATERGREATEREQUAL, 2);
6954 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
6956 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
6958 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
6961 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
6963 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
6964 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
6965 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
6966 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
6967 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
6968 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
6969 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
6971 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
6973 register_expression_parser(parse_sizeof, T_sizeof, 25);
6974 register_expression_parser(parse_alignof, T___alignof__, 25);
6975 register_expression_parser(parse_extension, T___extension__, 25);
6976 register_expression_parser(parse_builtin_classify_type,
6977 T___builtin_classify_type, 25);
6981 * Parse a asm statement constraints specification.
6983 static asm_constraint_t *parse_asm_constraints(void)
6985 asm_constraint_t *result = NULL;
6986 asm_constraint_t *last = NULL;
6988 while(token.type == T_STRING_LITERAL || token.type == '[') {
6989 asm_constraint_t *constraint = allocate_ast_zero(sizeof(constraint[0]));
6990 memset(constraint, 0, sizeof(constraint[0]));
6992 if(token.type == '[') {
6994 if(token.type != T_IDENTIFIER) {
6995 parse_error_expected("while parsing asm constraint",
6996 T_IDENTIFIER, NULL);
6999 constraint->symbol = token.v.symbol;
7004 constraint->constraints = parse_string_literals();
7006 constraint->expression = parse_expression();
7010 last->next = constraint;
7012 result = constraint;
7016 if(token.type != ',')
7027 * Parse a asm statement clobber specification.
7029 static asm_clobber_t *parse_asm_clobbers(void)
7031 asm_clobber_t *result = NULL;
7032 asm_clobber_t *last = NULL;
7034 while(token.type == T_STRING_LITERAL) {
7035 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
7036 clobber->clobber = parse_string_literals();
7039 last->next = clobber;
7045 if(token.type != ',')
7054 * Parse an asm statement.
7056 static statement_t *parse_asm_statement(void)
7060 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
7061 statement->base.source_position = token.source_position;
7063 asm_statement_t *asm_statement = &statement->asms;
7065 if(token.type == T_volatile) {
7067 asm_statement->is_volatile = true;
7071 add_anchor_token(')');
7072 add_anchor_token(':');
7073 asm_statement->asm_text = parse_string_literals();
7075 if(token.type != ':') {
7076 rem_anchor_token(':');
7081 asm_statement->inputs = parse_asm_constraints();
7082 if(token.type != ':') {
7083 rem_anchor_token(':');
7088 asm_statement->outputs = parse_asm_constraints();
7089 if(token.type != ':') {
7090 rem_anchor_token(':');
7093 rem_anchor_token(':');
7096 asm_statement->clobbers = parse_asm_clobbers();
7099 rem_anchor_token(')');
7104 return create_invalid_statement();
7108 * Parse a case statement.
7110 static statement_t *parse_case_statement(void)
7114 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
7116 statement->base.source_position = token.source_position;
7117 statement->case_label.expression = parse_expression();
7119 if (c_mode & _GNUC) {
7120 if (token.type == T_DOTDOTDOT) {
7122 statement->case_label.end_range = parse_expression();
7128 if (! is_constant_expression(statement->case_label.expression)) {
7129 errorf(&statement->base.source_position,
7130 "case label does not reduce to an integer constant");
7132 /* TODO: check if the case label is already known */
7133 if (current_switch != NULL) {
7134 /* link all cases into the switch statement */
7135 if (current_switch->last_case == NULL) {
7136 current_switch->first_case =
7137 current_switch->last_case = &statement->case_label;
7139 current_switch->last_case->next = &statement->case_label;
7142 errorf(&statement->base.source_position,
7143 "case label not within a switch statement");
7146 statement->case_label.statement = parse_statement();
7150 return create_invalid_statement();
7154 * Finds an existing default label of a switch statement.
7156 static case_label_statement_t *
7157 find_default_label(const switch_statement_t *statement)
7159 case_label_statement_t *label = statement->first_case;
7160 for ( ; label != NULL; label = label->next) {
7161 if (label->expression == NULL)
7168 * Parse a default statement.
7170 static statement_t *parse_default_statement(void)
7174 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
7176 statement->base.source_position = token.source_position;
7179 if (current_switch != NULL) {
7180 const case_label_statement_t *def_label = find_default_label(current_switch);
7181 if (def_label != NULL) {
7182 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
7183 &def_label->base.source_position);
7185 /* link all cases into the switch statement */
7186 if (current_switch->last_case == NULL) {
7187 current_switch->first_case =
7188 current_switch->last_case = &statement->case_label;
7190 current_switch->last_case->next = &statement->case_label;
7194 errorf(&statement->base.source_position,
7195 "'default' label not within a switch statement");
7197 statement->case_label.statement = parse_statement();
7201 return create_invalid_statement();
7205 * Return the declaration for a given label symbol or create a new one.
7207 static declaration_t *get_label(symbol_t *symbol)
7209 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
7210 assert(current_function != NULL);
7211 /* if we found a label in the same function, then we already created the
7213 if(candidate != NULL
7214 && candidate->parent_scope == ¤t_function->scope) {
7218 /* otherwise we need to create a new one */
7219 declaration_t *const declaration = allocate_declaration_zero();
7220 declaration->namespc = NAMESPACE_LABEL;
7221 declaration->symbol = symbol;
7223 label_push(declaration);
7229 * Parse a label statement.
7231 static statement_t *parse_label_statement(void)
7233 assert(token.type == T_IDENTIFIER);
7234 symbol_t *symbol = token.v.symbol;
7237 declaration_t *label = get_label(symbol);
7239 /* if source position is already set then the label is defined twice,
7240 * otherwise it was just mentioned in a goto so far */
7241 if(label->source_position.input_name != NULL) {
7242 errorf(HERE, "duplicate label '%Y' (declared %P)",
7243 symbol, &label->source_position);
7245 label->source_position = token.source_position;
7248 statement_t *statement = allocate_statement_zero(STATEMENT_LABEL);
7250 statement->base.source_position = token.source_position;
7251 statement->label.label = label;
7255 if(token.type == '}') {
7256 /* TODO only warn? */
7258 warningf(HERE, "label at end of compound statement");
7259 statement->label.statement = create_empty_statement();
7261 errorf(HERE, "label at end of compound statement");
7262 statement->label.statement = create_invalid_statement();
7266 if (token.type == ';') {
7267 /* eat an empty statement here, to avoid the warning about an empty
7268 * after a label. label:; is commonly used to have a label before
7270 statement->label.statement = create_empty_statement();
7273 statement->label.statement = parse_statement();
7277 /* remember the labels's in a list for later checking */
7278 if (label_last == NULL) {
7279 label_first = &statement->label;
7281 label_last->next = &statement->label;
7283 label_last = &statement->label;
7289 * Parse an if statement.
7291 static statement_t *parse_if(void)
7295 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
7296 statement->base.source_position = token.source_position;
7299 add_anchor_token(')');
7300 statement->ifs.condition = parse_expression();
7301 rem_anchor_token(')');
7304 add_anchor_token(T_else);
7305 statement->ifs.true_statement = parse_statement();
7306 rem_anchor_token(T_else);
7308 if(token.type == T_else) {
7310 statement->ifs.false_statement = parse_statement();
7315 return create_invalid_statement();
7319 * Parse a switch statement.
7321 static statement_t *parse_switch(void)
7325 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
7326 statement->base.source_position = token.source_position;
7329 expression_t *const expr = parse_expression();
7330 type_t * type = skip_typeref(expr->base.type);
7331 if (is_type_integer(type)) {
7332 type = promote_integer(type);
7333 } else if (is_type_valid(type)) {
7334 errorf(&expr->base.source_position,
7335 "switch quantity is not an integer, but '%T'", type);
7336 type = type_error_type;
7338 statement->switchs.expression = create_implicit_cast(expr, type);
7341 switch_statement_t *rem = current_switch;
7342 current_switch = &statement->switchs;
7343 statement->switchs.body = parse_statement();
7344 current_switch = rem;
7346 if(warning.switch_default &&
7347 find_default_label(&statement->switchs) == NULL) {
7348 warningf(&statement->base.source_position, "switch has no default case");
7353 return create_invalid_statement();
7356 static statement_t *parse_loop_body(statement_t *const loop)
7358 statement_t *const rem = current_loop;
7359 current_loop = loop;
7361 statement_t *const body = parse_statement();
7368 * Parse a while statement.
7370 static statement_t *parse_while(void)
7374 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
7375 statement->base.source_position = token.source_position;
7378 add_anchor_token(')');
7379 statement->whiles.condition = parse_expression();
7380 rem_anchor_token(')');
7383 statement->whiles.body = parse_loop_body(statement);
7387 return create_invalid_statement();
7391 * Parse a do statement.
7393 static statement_t *parse_do(void)
7397 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
7399 statement->base.source_position = token.source_position;
7401 add_anchor_token(T_while);
7402 statement->do_while.body = parse_loop_body(statement);
7403 rem_anchor_token(T_while);
7407 add_anchor_token(')');
7408 statement->do_while.condition = parse_expression();
7409 rem_anchor_token(')');
7415 return create_invalid_statement();
7419 * Parse a for statement.
7421 static statement_t *parse_for(void)
7425 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
7426 statement->base.source_position = token.source_position;
7428 int top = environment_top();
7429 scope_t *last_scope = scope;
7430 set_scope(&statement->fors.scope);
7433 add_anchor_token(')');
7435 if(token.type != ';') {
7436 if(is_declaration_specifier(&token, false)) {
7437 parse_declaration(record_declaration);
7439 add_anchor_token(';');
7440 expression_t *const init = parse_expression();
7441 statement->fors.initialisation = init;
7442 if (warning.unused_value && !expression_has_effect(init)) {
7443 warningf(&init->base.source_position,
7444 "initialisation of 'for'-statement has no effect");
7446 rem_anchor_token(';');
7453 if(token.type != ';') {
7454 add_anchor_token(';');
7455 statement->fors.condition = parse_expression();
7456 rem_anchor_token(';');
7459 if(token.type != ')') {
7460 expression_t *const step = parse_expression();
7461 statement->fors.step = step;
7462 if (warning.unused_value && !expression_has_effect(step)) {
7463 warningf(&step->base.source_position,
7464 "step of 'for'-statement has no effect");
7467 rem_anchor_token(')');
7469 statement->fors.body = parse_loop_body(statement);
7471 assert(scope == &statement->fors.scope);
7472 set_scope(last_scope);
7473 environment_pop_to(top);
7478 rem_anchor_token(')');
7479 assert(scope == &statement->fors.scope);
7480 set_scope(last_scope);
7481 environment_pop_to(top);
7483 return create_invalid_statement();
7487 * Parse a goto statement.
7489 static statement_t *parse_goto(void)
7493 if(token.type != T_IDENTIFIER) {
7494 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
7498 symbol_t *symbol = token.v.symbol;
7501 declaration_t *label = get_label(symbol);
7503 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
7504 statement->base.source_position = token.source_position;
7506 statement->gotos.label = label;
7508 /* remember the goto's in a list for later checking */
7509 if (goto_last == NULL) {
7510 goto_first = &statement->gotos;
7512 goto_last->next = &statement->gotos;
7514 goto_last = &statement->gotos;
7520 return create_invalid_statement();
7524 * Parse a continue statement.
7526 static statement_t *parse_continue(void)
7528 statement_t *statement;
7529 if (current_loop == NULL) {
7530 errorf(HERE, "continue statement not within loop");
7531 statement = create_invalid_statement();
7533 statement = allocate_statement_zero(STATEMENT_CONTINUE);
7535 statement->base.source_position = token.source_position;
7543 return create_invalid_statement();
7547 * Parse a break statement.
7549 static statement_t *parse_break(void)
7551 statement_t *statement;
7552 if (current_switch == NULL && current_loop == NULL) {
7553 errorf(HERE, "break statement not within loop or switch");
7554 statement = create_invalid_statement();
7556 statement = allocate_statement_zero(STATEMENT_BREAK);
7558 statement->base.source_position = token.source_position;
7566 return create_invalid_statement();
7570 * Parse a __leave statement.
7572 static statement_t *parse_leave(void)
7574 statement_t *statement;
7575 if (current_try == NULL) {
7576 errorf(HERE, "__leave statement not within __try");
7577 statement = create_invalid_statement();
7579 statement = allocate_statement_zero(STATEMENT_LEAVE);
7581 statement->base.source_position = token.source_position;
7589 return create_invalid_statement();
7593 * Check if a given declaration represents a local variable.
7595 static bool is_local_var_declaration(const declaration_t *declaration) {
7596 switch ((storage_class_tag_t) declaration->storage_class) {
7597 case STORAGE_CLASS_AUTO:
7598 case STORAGE_CLASS_REGISTER: {
7599 const type_t *type = skip_typeref(declaration->type);
7600 if(is_type_function(type)) {
7612 * Check if a given declaration represents a variable.
7614 static bool is_var_declaration(const declaration_t *declaration) {
7615 if(declaration->storage_class == STORAGE_CLASS_TYPEDEF)
7618 const type_t *type = skip_typeref(declaration->type);
7619 return !is_type_function(type);
7623 * Check if a given expression represents a local variable.
7625 static bool is_local_variable(const expression_t *expression)
7627 if (expression->base.kind != EXPR_REFERENCE) {
7630 const declaration_t *declaration = expression->reference.declaration;
7631 return is_local_var_declaration(declaration);
7635 * Check if a given expression represents a local variable and
7636 * return its declaration then, else return NULL.
7638 declaration_t *expr_is_variable(const expression_t *expression)
7640 if (expression->base.kind != EXPR_REFERENCE) {
7643 declaration_t *declaration = expression->reference.declaration;
7644 if (is_var_declaration(declaration))
7650 * Parse a return statement.
7652 static statement_t *parse_return(void)
7654 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
7655 statement->base.source_position = token.source_position;
7659 expression_t *return_value = NULL;
7660 if(token.type != ';') {
7661 return_value = parse_expression();
7665 const type_t *const func_type = current_function->type;
7666 assert(is_type_function(func_type));
7667 type_t *const return_type = skip_typeref(func_type->function.return_type);
7669 if(return_value != NULL) {
7670 type_t *return_value_type = skip_typeref(return_value->base.type);
7672 if(is_type_atomic(return_type, ATOMIC_TYPE_VOID)
7673 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
7674 warningf(&statement->base.source_position,
7675 "'return' with a value, in function returning void");
7676 return_value = NULL;
7678 type_t *const res_type = semantic_assign(return_type,
7679 return_value, "'return'", &statement->base.source_position);
7680 if (res_type == NULL) {
7681 errorf(&statement->base.source_position,
7682 "cannot return something of type '%T' in function returning '%T'",
7683 return_value->base.type, return_type);
7685 return_value = create_implicit_cast(return_value, res_type);
7688 /* check for returning address of a local var */
7689 if (return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
7690 const expression_t *expression = return_value->unary.value;
7691 if (is_local_variable(expression)) {
7692 warningf(&statement->base.source_position,
7693 "function returns address of local variable");
7697 if(!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
7698 warningf(&statement->base.source_position,
7699 "'return' without value, in function returning non-void");
7702 statement->returns.value = return_value;
7706 return create_invalid_statement();
7710 * Parse a declaration statement.
7712 static statement_t *parse_declaration_statement(void)
7714 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
7716 statement->base.source_position = token.source_position;
7718 declaration_t *before = last_declaration;
7719 parse_declaration(record_declaration);
7721 if(before == NULL) {
7722 statement->declaration.declarations_begin = scope->declarations;
7724 statement->declaration.declarations_begin = before->next;
7726 statement->declaration.declarations_end = last_declaration;
7732 * Parse an expression statement, ie. expr ';'.
7734 static statement_t *parse_expression_statement(void)
7736 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
7738 statement->base.source_position = token.source_position;
7739 expression_t *const expr = parse_expression();
7740 statement->expression.expression = expr;
7746 return create_invalid_statement();
7750 * Parse a microsoft __try { } __finally { } or
7751 * __try{ } __except() { }
7753 static statement_t *parse_ms_try_statment(void) {
7754 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
7756 statement->base.source_position = token.source_position;
7759 ms_try_statement_t *rem = current_try;
7760 current_try = &statement->ms_try;
7761 statement->ms_try.try_statement = parse_compound_statement(false);
7764 if(token.type == T___except) {
7767 add_anchor_token(')');
7768 expression_t *const expr = parse_expression();
7769 type_t * type = skip_typeref(expr->base.type);
7770 if (is_type_integer(type)) {
7771 type = promote_integer(type);
7772 } else if (is_type_valid(type)) {
7773 errorf(&expr->base.source_position,
7774 "__expect expression is not an integer, but '%T'", type);
7775 type = type_error_type;
7777 statement->ms_try.except_expression = create_implicit_cast(expr, type);
7778 rem_anchor_token(')');
7780 statement->ms_try.final_statement = parse_compound_statement(false);
7781 } else if(token.type == T__finally) {
7783 statement->ms_try.final_statement = parse_compound_statement(false);
7785 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
7786 return create_invalid_statement();
7790 return create_invalid_statement();
7794 * Parse a statement.
7795 * There's also parse_statement() which additionally checks for
7796 * "statement has no effect" warnings
7798 static statement_t *intern_parse_statement(void)
7800 statement_t *statement = NULL;
7802 /* declaration or statement */
7803 add_anchor_token(';');
7804 switch(token.type) {
7806 statement = parse_asm_statement();
7810 statement = parse_case_statement();
7814 statement = parse_default_statement();
7818 statement = parse_compound_statement(false);
7822 statement = parse_if();
7826 statement = parse_switch();
7830 statement = parse_while();
7834 statement = parse_do();
7838 statement = parse_for();
7842 statement = parse_goto();
7846 statement = parse_continue();
7850 statement = parse_break();
7854 statement = parse_leave();
7858 statement = parse_return();
7862 if(warning.empty_statement) {
7863 warningf(HERE, "statement is empty");
7865 statement = create_empty_statement();
7870 if(look_ahead(1)->type == ':') {
7871 statement = parse_label_statement();
7875 if(is_typedef_symbol(token.v.symbol)) {
7876 statement = parse_declaration_statement();
7880 statement = parse_expression_statement();
7883 case T___extension__:
7884 /* this can be a prefix to a declaration or an expression statement */
7885 /* we simply eat it now and parse the rest with tail recursion */
7888 } while(token.type == T___extension__);
7889 statement = parse_statement();
7893 statement = parse_declaration_statement();
7897 statement = parse_ms_try_statment();
7901 statement = parse_expression_statement();
7904 rem_anchor_token(';');
7906 assert(statement != NULL
7907 && statement->base.source_position.input_name != NULL);
7913 * parse a statement and emits "statement has no effect" warning if needed
7914 * (This is really a wrapper around intern_parse_statement with check for 1
7915 * single warning. It is needed, because for statement expressions we have
7916 * to avoid the warning on the last statement)
7918 static statement_t *parse_statement(void)
7920 statement_t *statement = intern_parse_statement();
7922 if(statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
7923 expression_t *expression = statement->expression.expression;
7924 if(!expression_has_effect(expression)) {
7925 warningf(&expression->base.source_position,
7926 "statement has no effect");
7934 * Parse a compound statement.
7936 static statement_t *parse_compound_statement(bool inside_expression_statement)
7938 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
7940 statement->base.source_position = token.source_position;
7943 add_anchor_token('}');
7945 int top = environment_top();
7946 scope_t *last_scope = scope;
7947 set_scope(&statement->compound.scope);
7949 statement_t *last_statement = NULL;
7951 while(token.type != '}' && token.type != T_EOF) {
7952 statement_t *sub_statement = intern_parse_statement();
7953 if(is_invalid_statement(sub_statement)) {
7954 /* an error occurred. if we are at an anchor, return */
7960 if(last_statement != NULL) {
7961 last_statement->base.next = sub_statement;
7963 statement->compound.statements = sub_statement;
7966 while(sub_statement->base.next != NULL)
7967 sub_statement = sub_statement->base.next;
7969 last_statement = sub_statement;
7972 if(token.type == '}') {
7975 errorf(&statement->base.source_position,
7976 "end of file while looking for closing '}'");
7979 /* look over all statements again to produce no effect warnings */
7980 if(warning.unused_value) {
7981 statement_t *sub_statement = statement->compound.statements;
7982 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
7983 if(sub_statement->kind != STATEMENT_EXPRESSION)
7985 /* don't emit a warning for the last expression in an expression
7986 * statement as it has always an effect */
7987 if(inside_expression_statement && sub_statement->base.next == NULL)
7990 expression_t *expression = sub_statement->expression.expression;
7991 if(!expression_has_effect(expression)) {
7992 warningf(&expression->base.source_position,
7993 "statement has no effect");
7999 rem_anchor_token('}');
8000 assert(scope == &statement->compound.scope);
8001 set_scope(last_scope);
8002 environment_pop_to(top);
8008 * Initialize builtin types.
8010 static void initialize_builtin_types(void)
8012 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
8013 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
8014 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
8015 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
8016 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
8017 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
8018 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", type_int);
8019 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
8021 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
8022 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
8023 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
8024 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
8028 * Check for unused global static functions and variables
8030 static void check_unused_globals(void)
8032 if (!warning.unused_function && !warning.unused_variable)
8035 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
8036 if (decl->used || decl->storage_class != STORAGE_CLASS_STATIC)
8039 type_t *const type = decl->type;
8041 if (is_type_function(skip_typeref(type))) {
8042 if (!warning.unused_function || decl->is_inline)
8045 s = (decl->init.statement != NULL ? "defined" : "declared");
8047 if (!warning.unused_variable)
8053 warningf(&decl->source_position, "'%#T' %s but not used",
8054 type, decl->symbol, s);
8059 * Parse a translation unit.
8061 static translation_unit_t *parse_translation_unit(void)
8063 translation_unit_t *unit = allocate_ast_zero(sizeof(unit[0]));
8065 assert(global_scope == NULL);
8066 global_scope = &unit->scope;
8068 assert(scope == NULL);
8069 set_scope(&unit->scope);
8071 initialize_builtin_types();
8073 while(token.type != T_EOF) {
8074 if (token.type == ';') {
8075 /* TODO error in strict mode */
8076 warningf(HERE, "stray ';' outside of function");
8079 parse_external_declaration();
8083 assert(scope == &unit->scope);
8085 last_declaration = NULL;
8087 assert(global_scope == &unit->scope);
8088 check_unused_globals();
8089 global_scope = NULL;
8097 * @return the translation unit or NULL if errors occurred.
8099 translation_unit_t *parse(void)
8101 environment_stack = NEW_ARR_F(stack_entry_t, 0);
8102 label_stack = NEW_ARR_F(stack_entry_t, 0);
8103 diagnostic_count = 0;
8107 type_set_output(stderr);
8108 ast_set_output(stderr);
8110 lookahead_bufpos = 0;
8111 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
8114 translation_unit_t *unit = parse_translation_unit();
8116 DEL_ARR_F(environment_stack);
8117 DEL_ARR_F(label_stack);
8123 * Initialize the parser.
8125 void init_parser(void)
8128 /* add predefined symbols for extended-decl-modifier */
8129 sym_align = symbol_table_insert("align");
8130 sym_allocate = symbol_table_insert("allocate");
8131 sym_dllimport = symbol_table_insert("dllimport");
8132 sym_dllexport = symbol_table_insert("dllexport");
8133 sym_naked = symbol_table_insert("naked");
8134 sym_noinline = symbol_table_insert("noinline");
8135 sym_noreturn = symbol_table_insert("noreturn");
8136 sym_nothrow = symbol_table_insert("nothrow");
8137 sym_novtable = symbol_table_insert("novtable");
8138 sym_property = symbol_table_insert("property");
8139 sym_get = symbol_table_insert("get");
8140 sym_put = symbol_table_insert("put");
8141 sym_selectany = symbol_table_insert("selectany");
8142 sym_thread = symbol_table_insert("thread");
8143 sym_uuid = symbol_table_insert("uuid");
8144 sym_deprecated = symbol_table_insert("deprecated");
8145 sym_restrict = symbol_table_insert("restrict");
8146 sym_noalias = symbol_table_insert("noalias");
8148 memset(token_anchor_set, 0, sizeof(token_anchor_set));
8150 init_expression_parsers();
8151 obstack_init(&temp_obst);
8153 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
8154 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
8158 * Terminate the parser.
8160 void exit_parser(void)
8162 obstack_free(&temp_obst, NULL);