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 modifiers; /**< declaration modifiers */
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 translation_unit_t *unit = NULL;
108 static struct obstack temp_obst;
110 static source_position_t null_position = { NULL, 0 };
112 /* symbols for Microsoft extended-decl-modifier */
113 static const symbol_t *sym_align = NULL;
114 static const symbol_t *sym_allocate = NULL;
115 static const symbol_t *sym_dllimport = NULL;
116 static const symbol_t *sym_dllexport = NULL;
117 static const symbol_t *sym_naked = NULL;
118 static const symbol_t *sym_noinline = NULL;
119 static const symbol_t *sym_noreturn = NULL;
120 static const symbol_t *sym_nothrow = NULL;
121 static const symbol_t *sym_novtable = NULL;
122 static const symbol_t *sym_property = NULL;
123 static const symbol_t *sym_get = NULL;
124 static const symbol_t *sym_put = NULL;
125 static const symbol_t *sym_selectany = NULL;
126 static const symbol_t *sym_thread = NULL;
127 static const symbol_t *sym_uuid = NULL;
128 static const symbol_t *sym_deprecated = NULL;
129 static const symbol_t *sym_restrict = NULL;
130 static const symbol_t *sym_noalias = NULL;
132 /** The token anchor set */
133 static unsigned char token_anchor_set[T_LAST_TOKEN];
135 /** The current source position. */
136 #define HERE (&token.source_position)
138 static type_t *type_valist;
140 static statement_t *parse_compound_statement(bool inside_expression_statement);
141 static statement_t *parse_statement(void);
143 static expression_t *parse_sub_expression(unsigned precedence);
144 static expression_t *parse_expression(void);
145 static type_t *parse_typename(void);
147 static void parse_compound_type_entries(declaration_t *compound_declaration);
148 static declaration_t *parse_declarator(
149 const declaration_specifiers_t *specifiers, bool may_be_abstract);
150 static declaration_t *record_declaration(declaration_t *declaration);
152 static void semantic_comparison(binary_expression_t *expression);
154 #define STORAGE_CLASSES \
161 #define TYPE_QUALIFIERS \
168 #ifdef PROVIDE_COMPLEX
169 #define COMPLEX_SPECIFIERS \
171 #define IMAGINARY_SPECIFIERS \
174 #define COMPLEX_SPECIFIERS
175 #define IMAGINARY_SPECIFIERS
178 #define TYPE_SPECIFIERS \
193 case T___builtin_va_list: \
198 #define DECLARATION_START \
203 #define TYPENAME_START \
208 * Allocate an AST node with given size and
209 * initialize all fields with zero.
211 static void *allocate_ast_zero(size_t size)
213 void *res = allocate_ast(size);
214 memset(res, 0, size);
218 static declaration_t *allocate_declaration_zero(void)
220 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
221 declaration->type = type_error_type;
222 declaration->alignment = 0;
227 * Returns the size of a statement node.
229 * @param kind the statement kind
231 static size_t get_statement_struct_size(statement_kind_t kind)
233 static const size_t sizes[] = {
234 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
235 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
236 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
237 [STATEMENT_RETURN] = sizeof(return_statement_t),
238 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
239 [STATEMENT_IF] = sizeof(if_statement_t),
240 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
241 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
242 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
243 [STATEMENT_BREAK] = sizeof(statement_base_t),
244 [STATEMENT_GOTO] = sizeof(goto_statement_t),
245 [STATEMENT_LABEL] = sizeof(label_statement_t),
246 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
247 [STATEMENT_WHILE] = sizeof(while_statement_t),
248 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
249 [STATEMENT_FOR] = sizeof(for_statement_t),
250 [STATEMENT_ASM] = sizeof(asm_statement_t),
251 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
252 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
254 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
255 assert(sizes[kind] != 0);
260 * Returns the size of an expression node.
262 * @param kind the expression kind
264 static size_t get_expression_struct_size(expression_kind_t kind)
266 static const size_t sizes[] = {
267 [EXPR_INVALID] = sizeof(expression_base_t),
268 [EXPR_REFERENCE] = sizeof(reference_expression_t),
269 [EXPR_CONST] = sizeof(const_expression_t),
270 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
271 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
272 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
273 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
274 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
275 [EXPR_CALL] = sizeof(call_expression_t),
276 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
277 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
278 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
279 [EXPR_SELECT] = sizeof(select_expression_t),
280 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
281 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
282 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
283 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
284 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
285 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
286 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
287 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
288 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
289 [EXPR_VA_START] = sizeof(va_start_expression_t),
290 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
291 [EXPR_STATEMENT] = sizeof(statement_expression_t),
293 if(kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
294 return sizes[EXPR_UNARY_FIRST];
296 if(kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
297 return sizes[EXPR_BINARY_FIRST];
299 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
300 assert(sizes[kind] != 0);
305 * Allocate a statement node of given kind and initialize all
308 static statement_t *allocate_statement_zero(statement_kind_t kind)
310 size_t size = get_statement_struct_size(kind);
311 statement_t *res = allocate_ast_zero(size);
313 res->base.kind = kind;
318 * Allocate an expression node of given kind and initialize all
321 static expression_t *allocate_expression_zero(expression_kind_t kind)
323 size_t size = get_expression_struct_size(kind);
324 expression_t *res = allocate_ast_zero(size);
326 res->base.kind = kind;
327 res->base.type = type_error_type;
332 * Creates a new invalid expression.
334 static expression_t *create_invalid_expression(void)
336 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
337 expression->base.source_position = token.source_position;
342 * Creates a new invalid statement.
344 static statement_t *create_invalid_statement(void)
346 statement_t *statement = allocate_statement_zero(STATEMENT_INVALID);
347 statement->base.source_position = token.source_position;
352 * Allocate a new empty statement.
354 static statement_t *create_empty_statement(void)
356 statement_t *statement = allocate_statement_zero(STATEMENT_EMPTY);
357 statement->base.source_position = token.source_position;
362 * Returns the size of a type node.
364 * @param kind the type kind
366 static size_t get_type_struct_size(type_kind_t kind)
368 static const size_t sizes[] = {
369 [TYPE_ATOMIC] = sizeof(atomic_type_t),
370 [TYPE_COMPLEX] = sizeof(complex_type_t),
371 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
372 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
373 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
374 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
375 [TYPE_ENUM] = sizeof(enum_type_t),
376 [TYPE_FUNCTION] = sizeof(function_type_t),
377 [TYPE_POINTER] = sizeof(pointer_type_t),
378 [TYPE_ARRAY] = sizeof(array_type_t),
379 [TYPE_BUILTIN] = sizeof(builtin_type_t),
380 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
381 [TYPE_TYPEOF] = sizeof(typeof_type_t),
383 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
384 assert(kind <= TYPE_TYPEOF);
385 assert(sizes[kind] != 0);
390 * Allocate a type node of given kind and initialize all
393 static type_t *allocate_type_zero(type_kind_t kind, const source_position_t *source_position)
395 size_t size = get_type_struct_size(kind);
396 type_t *res = obstack_alloc(type_obst, size);
397 memset(res, 0, size);
399 res->base.kind = kind;
400 res->base.source_position = *source_position;
405 * Returns the size of an initializer node.
407 * @param kind the initializer kind
409 static size_t get_initializer_size(initializer_kind_t kind)
411 static const size_t sizes[] = {
412 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
413 [INITIALIZER_STRING] = sizeof(initializer_string_t),
414 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
415 [INITIALIZER_LIST] = sizeof(initializer_list_t),
416 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
418 assert(kind < sizeof(sizes) / sizeof(*sizes));
419 assert(sizes[kind] != 0);
424 * Allocate an initializer node of given kind and initialize all
427 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
429 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
436 * Free a type from the type obstack.
438 static void free_type(void *type)
440 obstack_free(type_obst, type);
444 * Returns the index of the top element of the environment stack.
446 static size_t environment_top(void)
448 return ARR_LEN(environment_stack);
452 * Returns the index of the top element of the label stack.
454 static size_t label_top(void)
456 return ARR_LEN(label_stack);
460 * Return the next token.
462 static inline void next_token(void)
464 token = lookahead_buffer[lookahead_bufpos];
465 lookahead_buffer[lookahead_bufpos] = lexer_token;
468 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
471 print_token(stderr, &token);
472 fprintf(stderr, "\n");
477 * Return the next token with a given lookahead.
479 static inline const token_t *look_ahead(int num)
481 assert(num > 0 && num <= MAX_LOOKAHEAD);
482 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
483 return &lookahead_buffer[pos];
487 * Adds a token to the token anchor set (a multi-set).
489 static void add_anchor_token(int token_type) {
490 assert(0 <= token_type && token_type < T_LAST_TOKEN);
491 ++token_anchor_set[token_type];
494 static int save_and_reset_anchor_state(int token_type) {
495 assert(0 <= token_type && token_type < T_LAST_TOKEN);
496 int count = token_anchor_set[token_type];
497 token_anchor_set[token_type] = 0;
501 static void restore_anchor_state(int token_type, int count) {
502 assert(0 <= token_type && token_type < T_LAST_TOKEN);
503 token_anchor_set[token_type] = count;
507 * Remove a token from the token anchor set (a multi-set).
509 static void rem_anchor_token(int token_type) {
510 assert(0 <= token_type && token_type < T_LAST_TOKEN);
511 --token_anchor_set[token_type];
514 static bool at_anchor(void) {
517 return token_anchor_set[token.type];
521 * Eat tokens until a matching token is found.
523 static void eat_until_matching_token(int type) {
524 unsigned parenthesis_count = 0;
525 unsigned brace_count = 0;
526 unsigned bracket_count = 0;
527 int end_token = type;
536 while(token.type != end_token ||
537 (parenthesis_count > 0 || brace_count > 0 || bracket_count > 0)) {
541 case '(': ++parenthesis_count; break;
542 case '{': ++brace_count; break;
543 case '[': ++bracket_count; break;
545 if(parenthesis_count > 0)
553 if(bracket_count > 0)
564 * Eat input tokens until an anchor is found.
566 static void eat_until_anchor(void) {
567 if(token.type == T_EOF)
569 while(token_anchor_set[token.type] == 0) {
570 if(token.type == '(' || token.type == '{' || token.type == '[')
571 eat_until_matching_token(token.type);
572 if(token.type == T_EOF)
578 static void eat_block(void) {
579 eat_until_matching_token('{');
580 if(token.type == '}')
585 * eat all token until a ';' is reached or a stop token is found.
587 static void eat_statement(void) {
588 eat_until_matching_token(';');
589 if(token.type == ';')
593 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while(0)
596 * Report a parse error because an expected token was not found.
599 #if defined __GNUC__ && __GNUC__ >= 4
600 __attribute__((sentinel))
602 void parse_error_expected(const char *message, ...)
604 if(message != NULL) {
605 errorf(HERE, "%s", message);
608 va_start(ap, message);
609 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
614 * Report a type error.
616 static void type_error(const char *msg, const source_position_t *source_position,
619 errorf(source_position, "%s, but found type '%T'", msg, type);
623 * Report an incompatible type.
625 static void type_error_incompatible(const char *msg,
626 const source_position_t *source_position, type_t *type1, type_t *type2)
628 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
633 * Expect the the current token is the expected token.
634 * If not, generate an error, eat the current statement,
635 * and goto the end_error label.
637 #define expect(expected) \
639 if(UNLIKELY(token.type != (expected))) { \
640 parse_error_expected(NULL, (expected), NULL); \
641 add_anchor_token(expected); \
642 eat_until_anchor(); \
643 if (token.type == expected) \
645 rem_anchor_token(expected); \
651 static void set_scope(scope_t *new_scope)
654 scope->last_declaration = last_declaration;
658 last_declaration = new_scope->last_declaration;
662 * Search a symbol in a given namespace and returns its declaration or
663 * NULL if this symbol was not found.
665 static declaration_t *get_declaration(const symbol_t *const symbol,
666 const namespace_t namespc)
668 declaration_t *declaration = symbol->declaration;
669 for( ; declaration != NULL; declaration = declaration->symbol_next) {
670 if(declaration->namespc == namespc)
678 * pushs an environment_entry on the environment stack and links the
679 * corresponding symbol to the new entry
681 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
683 symbol_t *symbol = declaration->symbol;
684 namespace_t namespc = (namespace_t) declaration->namespc;
686 /* replace/add declaration into declaration list of the symbol */
687 declaration_t *iter = symbol->declaration;
689 symbol->declaration = declaration;
691 declaration_t *iter_last = NULL;
692 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
693 /* replace an entry? */
694 if(iter->namespc == namespc) {
695 if(iter_last == NULL) {
696 symbol->declaration = declaration;
698 iter_last->symbol_next = declaration;
700 declaration->symbol_next = iter->symbol_next;
705 assert(iter_last->symbol_next == NULL);
706 iter_last->symbol_next = declaration;
710 /* remember old declaration */
712 entry.symbol = symbol;
713 entry.old_declaration = iter;
714 entry.namespc = (unsigned short) namespc;
715 ARR_APP1(stack_entry_t, *stack_ptr, entry);
718 static void environment_push(declaration_t *declaration)
720 assert(declaration->source_position.input_name != NULL);
721 assert(declaration->parent_scope != NULL);
722 stack_push(&environment_stack, declaration);
725 static void label_push(declaration_t *declaration)
727 declaration->parent_scope = ¤t_function->scope;
728 stack_push(&label_stack, declaration);
732 * pops symbols from the environment stack until @p new_top is the top element
734 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
736 stack_entry_t *stack = *stack_ptr;
737 size_t top = ARR_LEN(stack);
740 assert(new_top <= top);
744 for(i = top; i > new_top; --i) {
745 stack_entry_t *entry = &stack[i - 1];
747 declaration_t *old_declaration = entry->old_declaration;
748 symbol_t *symbol = entry->symbol;
749 namespace_t namespc = (namespace_t)entry->namespc;
751 /* replace/remove declaration */
752 declaration_t *declaration = symbol->declaration;
753 assert(declaration != NULL);
754 if(declaration->namespc == namespc) {
755 if(old_declaration == NULL) {
756 symbol->declaration = declaration->symbol_next;
758 symbol->declaration = old_declaration;
761 declaration_t *iter_last = declaration;
762 declaration_t *iter = declaration->symbol_next;
763 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
764 /* replace an entry? */
765 if(iter->namespc == namespc) {
766 assert(iter_last != NULL);
767 iter_last->symbol_next = old_declaration;
768 if(old_declaration != NULL) {
769 old_declaration->symbol_next = iter->symbol_next;
774 assert(iter != NULL);
778 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
781 static void environment_pop_to(size_t new_top)
783 stack_pop_to(&environment_stack, new_top);
786 static void label_pop_to(size_t new_top)
788 stack_pop_to(&label_stack, new_top);
792 static int get_rank(const type_t *type)
794 assert(!is_typeref(type));
795 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
796 * and esp. footnote 108). However we can't fold constants (yet), so we
797 * can't decide whether unsigned int is possible, while int always works.
798 * (unsigned int would be preferable when possible... for stuff like
799 * struct { enum { ... } bla : 4; } ) */
800 if(type->kind == TYPE_ENUM)
801 return ATOMIC_TYPE_INT;
803 assert(type->kind == TYPE_ATOMIC);
804 return type->atomic.akind;
807 static type_t *promote_integer(type_t *type)
809 if(type->kind == TYPE_BITFIELD)
810 type = type->bitfield.base_type;
812 if(get_rank(type) < ATOMIC_TYPE_INT)
819 * Create a cast expression.
821 * @param expression the expression to cast
822 * @param dest_type the destination type
824 static expression_t *create_cast_expression(expression_t *expression,
827 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
829 cast->unary.value = expression;
830 cast->base.type = dest_type;
836 * Check if a given expression represents the 0 pointer constant.
838 static bool is_null_pointer_constant(const expression_t *expression)
840 /* skip void* cast */
841 if(expression->kind == EXPR_UNARY_CAST
842 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
843 expression = expression->unary.value;
846 /* TODO: not correct yet, should be any constant integer expression
847 * which evaluates to 0 */
848 if (expression->kind != EXPR_CONST)
851 type_t *const type = skip_typeref(expression->base.type);
852 if (!is_type_integer(type))
855 return expression->conste.v.int_value == 0;
859 * Create an implicit cast expression.
861 * @param expression the expression to cast
862 * @param dest_type the destination type
864 static expression_t *create_implicit_cast(expression_t *expression,
867 type_t *const source_type = expression->base.type;
869 if (source_type == dest_type)
872 return create_cast_expression(expression, dest_type);
875 /** Implements the rules from § 6.5.16.1 */
876 static type_t *semantic_assign(type_t *orig_type_left,
877 const expression_t *const right,
879 const source_position_t *source_position)
881 type_t *const orig_type_right = right->base.type;
882 type_t *const type_left = skip_typeref(orig_type_left);
883 type_t *const type_right = skip_typeref(orig_type_right);
885 if(is_type_pointer(type_left)) {
886 if(is_null_pointer_constant(right)) {
887 return orig_type_left;
888 } else if(is_type_pointer(type_right)) {
889 type_t *points_to_left
890 = skip_typeref(type_left->pointer.points_to);
891 type_t *points_to_right
892 = skip_typeref(type_right->pointer.points_to);
894 /* the left type has all qualifiers from the right type */
895 unsigned missing_qualifiers
896 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
897 if(missing_qualifiers != 0) {
898 errorf(source_position,
899 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointed-to type", type_left, context, type_right, missing_qualifiers);
900 return orig_type_left;
903 points_to_left = get_unqualified_type(points_to_left);
904 points_to_right = get_unqualified_type(points_to_right);
906 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
907 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
908 return orig_type_left;
911 if (!types_compatible(points_to_left, points_to_right)) {
912 warningf(source_position,
913 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
914 orig_type_left, context, right, orig_type_right);
917 return orig_type_left;
918 } else if(is_type_integer(type_right)) {
919 warningf(source_position,
920 "%s makes pointer '%T' from integer '%T' without a cast",
921 context, orig_type_left, orig_type_right);
922 return orig_type_left;
924 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
925 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
926 && is_type_pointer(type_right))) {
927 return orig_type_left;
928 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
929 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
930 type_t *const unqual_type_left = get_unqualified_type(type_left);
931 type_t *const unqual_type_right = get_unqualified_type(type_right);
932 if (types_compatible(unqual_type_left, unqual_type_right)) {
933 return orig_type_left;
935 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
936 warningf(source_position,
937 "%s makes integer '%T' from pointer '%T' without a cast",
938 context, orig_type_left, orig_type_right);
939 return orig_type_left;
942 if (!is_type_valid(type_left))
945 if (!is_type_valid(type_right))
946 return orig_type_right;
951 static expression_t *parse_constant_expression(void)
953 /* start parsing at precedence 7 (conditional expression) */
954 expression_t *result = parse_sub_expression(7);
956 if(!is_constant_expression(result)) {
957 errorf(&result->base.source_position,
958 "expression '%E' is not constant\n", result);
964 static expression_t *parse_assignment_expression(void)
966 /* start parsing at precedence 2 (assignment expression) */
967 return parse_sub_expression(2);
970 static type_t *make_global_typedef(const char *name, type_t *type)
972 symbol_t *const symbol = symbol_table_insert(name);
974 declaration_t *const declaration = allocate_declaration_zero();
975 declaration->namespc = NAMESPACE_NORMAL;
976 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
977 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
978 declaration->type = type;
979 declaration->symbol = symbol;
980 declaration->source_position = builtin_source_position;
982 record_declaration(declaration);
984 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
985 typedef_type->typedeft.declaration = declaration;
990 static string_t parse_string_literals(void)
992 assert(token.type == T_STRING_LITERAL);
993 string_t result = token.v.string;
997 while (token.type == T_STRING_LITERAL) {
998 result = concat_strings(&result, &token.v.string);
1005 static const char *gnu_attribute_names[GNU_AK_LAST] = {
1006 [GNU_AK_CONST] = "const",
1007 [GNU_AK_VOLATILE] = "volatile",
1008 [GNU_AK_CDECL] = "cdecl",
1009 [GNU_AK_STDCALL] = "stdcall",
1010 [GNU_AK_FASTCALL] = "fastcall",
1011 [GNU_AK_DEPRECATED] = "deprecated",
1012 [GNU_AK_NOINLINE] = "noinline",
1013 [GNU_AK_NORETURN] = "noreturn",
1014 [GNU_AK_NAKED] = "naked",
1015 [GNU_AK_PURE] = "pure",
1016 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1017 [GNU_AK_MALLOC] = "malloc",
1018 [GNU_AK_WEAK] = "weak",
1019 [GNU_AK_CONSTRUCTOR] = "constructor",
1020 [GNU_AK_DESTRUCTOR] = "destructor",
1021 [GNU_AK_NOTHROW] = "nothrow",
1022 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1023 [GNU_AK_COMMON] = "coommon",
1024 [GNU_AK_NOCOMMON] = "nocommon",
1025 [GNU_AK_PACKED] = "packed",
1026 [GNU_AK_SHARED] = "shared",
1027 [GNU_AK_NOTSHARED] = "notshared",
1028 [GNU_AK_USED] = "used",
1029 [GNU_AK_UNUSED] = "unused",
1030 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1031 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1032 [GNU_AK_LONGCALL] = "longcall",
1033 [GNU_AK_SHORTCALL] = "shortcall",
1034 [GNU_AK_LONG_CALL] = "long_call",
1035 [GNU_AK_SHORT_CALL] = "short_call",
1036 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1037 [GNU_AK_INTERRUPT] = "interrupt",
1038 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1039 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1040 [GNU_AK_NESTING] = "nesting",
1041 [GNU_AK_NEAR] = "near",
1042 [GNU_AK_FAR] = "far",
1043 [GNU_AK_SIGNAL] = "signal",
1044 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1045 [GNU_AK_TINY_DATA] = "tiny_data",
1046 [GNU_AK_SAVEALL] = "saveall",
1047 [GNU_AK_FLATTEN] = "flatten",
1048 [GNU_AK_SSEREGPARM] = "sseregparm",
1049 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1050 [GNU_AK_RETURN_TWICE] = "return_twice",
1051 [GNU_AK_MAY_ALIAS] = "may_alias",
1052 [GNU_AK_MS_STRUCT] = "ms_struct",
1053 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1054 [GNU_AK_DLLIMPORT] = "dllimport",
1055 [GNU_AK_DLLEXPORT] = "dllexport",
1056 [GNU_AK_ALIGNED] = "aligned",
1057 [GNU_AK_ALIAS] = "alias",
1058 [GNU_AK_SECTION] = "section",
1059 [GNU_AK_FORMAT] = "format",
1060 [GNU_AK_FORMAT_ARG] = "format_arg",
1061 [GNU_AK_WEAKREF] = "weakref",
1062 [GNU_AK_NONNULL] = "nonnull",
1063 [GNU_AK_TLS_MODEL] = "tls_model",
1064 [GNU_AK_VISIBILITY] = "visibility",
1065 [GNU_AK_REGPARM] = "regparm",
1066 [GNU_AK_MODE] = "mode",
1067 [GNU_AK_MODEL] = "model",
1068 [GNU_AK_TRAP_EXIT] = "trap_exit",
1069 [GNU_AK_SP_SWITCH] = "sp_switch",
1070 [GNU_AK_SENTINEL] = "sentinel"
1074 * compare two string, ignoring double underscores on the second.
1076 static int strcmp_underscore(const char *s1, const char *s2) {
1077 if(s2[0] == '_' && s2[1] == '_') {
1079 size_t l1 = strlen(s1);
1080 if(l1 + 2 != strlen(s2)) {
1084 return strncmp(s1, s2, l1);
1086 return strcmp(s1, s2);
1090 * Allocate a new gnu temporal attribute.
1092 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind) {
1093 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1094 attribute->kind = kind;
1095 attribute->next = NULL;
1096 attribute->invalid = false;
1097 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;
1314 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1316 if(!attribute->have_arguments)
1319 /* should have no arguments */
1320 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1321 eat_until_matching_token('(');
1322 /* we have already consumed '(', so we stop before ')', eat it */
1324 attribute->invalid = true;
1328 * Parse one GNU attribute.
1330 * Note that attribute names can be specified WITH or WITHOUT
1331 * double underscores, ie const or __const__.
1333 * The following attributes are parsed without arguments
1358 * no_instrument_function
1359 * warn_unused_result
1376 * externally_visible
1384 * The following attributes are parsed with arguments
1385 * aligned( const expression )
1386 * alias( string literal )
1387 * section( string literal )
1388 * format( identifier, const expression, const expression )
1389 * format_arg( const expression )
1390 * tls_model( string literal )
1391 * visibility( string literal )
1392 * regparm( const expression )
1393 * model( string leteral )
1394 * trap_exit( const expression )
1395 * sp_switch( string literal )
1397 * The following attributes might have arguments
1398 * weak_ref( string literal )
1399 * non_null( const expression // ',' )
1400 * interrupt( string literal )
1401 * sentinel( constant expression )
1403 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1405 gnu_attribute_t *head = *attributes;
1406 gnu_attribute_t *last = *attributes;
1407 decl_modifiers_t modifiers = 0;
1408 gnu_attribute_t *attribute;
1410 eat(T___attribute__);
1414 if(token.type != ')') {
1415 /* find the end of the list */
1417 while(last->next != NULL)
1421 /* non-empty attribute list */
1424 if(token.type == T_const) {
1426 } else if(token.type == T_volatile) {
1428 } else if(token.type == T_cdecl) {
1429 /* __attribute__((cdecl)), WITH ms mode */
1431 } else if(token.type != T_IDENTIFIER) {
1432 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1435 const symbol_t *sym = token.v.symbol;
1440 for(i = 0; i < GNU_AK_LAST; ++i) {
1441 if(strcmp_underscore(gnu_attribute_names[i], name) == 0)
1444 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1447 if(kind == GNU_AK_LAST) {
1448 if(warning.attribute)
1449 warningf(HERE, "'%s' attribute directive ignored", name);
1451 /* skip possible arguments */
1452 if(token.type == '(') {
1453 eat_until_matching_token(')');
1456 /* check for arguments */
1457 attribute = allocate_gnu_attribute(kind);
1458 if(token.type == '(') {
1460 if(token.type == ')') {
1461 /* empty args are allowed */
1464 attribute->have_arguments = true;
1469 case GNU_AK_VOLATILE:
1471 case GNU_AK_STDCALL:
1472 case GNU_AK_FASTCALL:
1473 case GNU_AK_DEPRECATED:
1478 case GNU_AK_NOCOMMON:
1480 case GNU_AK_NOTSHARED:
1483 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1484 case GNU_AK_WARN_UNUSED_RESULT:
1485 case GNU_AK_LONGCALL:
1486 case GNU_AK_SHORTCALL:
1487 case GNU_AK_LONG_CALL:
1488 case GNU_AK_SHORT_CALL:
1489 case GNU_AK_FUNCTION_VECTOR:
1490 case GNU_AK_INTERRUPT_HANDLER:
1491 case GNU_AK_NMI_HANDLER:
1492 case GNU_AK_NESTING:
1496 case GNU_AK_EIGTHBIT_DATA:
1497 case GNU_AK_TINY_DATA:
1498 case GNU_AK_SAVEALL:
1499 case GNU_AK_FLATTEN:
1500 case GNU_AK_SSEREGPARM:
1501 case GNU_AK_EXTERNALLY_VISIBLE:
1502 case GNU_AK_RETURN_TWICE:
1503 case GNU_AK_MAY_ALIAS:
1504 case GNU_AK_MS_STRUCT:
1505 case GNU_AK_GCC_STRUCT:
1506 check_no_argument(attribute, name);
1510 check_no_argument(attribute, name);
1511 modifiers |= DM_PURE;
1514 case GNU_AK_ALWAYS_INLINE:
1515 check_no_argument(attribute, name);
1516 modifiers |= DM_FORCEINLINE;
1519 case GNU_AK_DLLIMPORT:
1520 check_no_argument(attribute, name);
1521 modifiers |= DM_DLLIMPORT;
1524 case GNU_AK_DLLEXPORT:
1525 check_no_argument(attribute, name);
1526 modifiers |= DM_DLLEXPORT;
1530 check_no_argument(attribute, name);
1531 modifiers |= DM_PACKED;
1534 case GNU_AK_NOINLINE:
1535 check_no_argument(attribute, name);
1536 modifiers |= DM_NOINLINE;
1539 case GNU_AK_NORETURN:
1540 check_no_argument(attribute, name);
1541 modifiers |= DM_NORETURN;
1544 case GNU_AK_NOTHROW:
1545 check_no_argument(attribute, name);
1546 modifiers |= DM_NOTHROW;
1549 case GNU_AK_TRANSPARENT_UNION:
1550 check_no_argument(attribute, name);
1551 modifiers |= DM_TRANSPARENT_UNION;
1554 case GNU_AK_CONSTRUCTOR:
1555 check_no_argument(attribute, name);
1556 modifiers |= DM_CONSTRUCTOR;
1559 case GNU_AK_DESTRUCTOR:
1560 check_no_argument(attribute, name);
1561 modifiers |= DM_DESTRUCTOR;
1564 case GNU_AK_ALIGNED:
1565 case GNU_AK_FORMAT_ARG:
1566 case GNU_AK_REGPARM:
1567 case GNU_AK_TRAP_EXIT:
1568 if(!attribute->have_arguments) {
1569 /* should have arguments */
1570 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1571 attribute->invalid = true;
1573 parse_gnu_attribute_const_arg(attribute);
1576 case GNU_AK_SECTION:
1577 case GNU_AK_SP_SWITCH:
1578 if(!attribute->have_arguments) {
1579 /* should have arguments */
1580 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1581 attribute->invalid = true;
1583 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1586 if(!attribute->have_arguments) {
1587 /* should have arguments */
1588 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1589 attribute->invalid = true;
1591 parse_gnu_attribute_format_args(attribute);
1593 case GNU_AK_WEAKREF:
1594 /* may have one string argument */
1595 if(attribute->have_arguments)
1596 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1598 case GNU_AK_NONNULL:
1599 if(attribute->have_arguments)
1600 parse_gnu_attribute_const_arg_list(attribute);
1602 case GNU_AK_TLS_MODEL:
1603 if(!attribute->have_arguments) {
1604 /* should have arguments */
1605 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1607 parse_gnu_attribute_tls_model_arg(attribute);
1609 case GNU_AK_VISIBILITY:
1610 if(!attribute->have_arguments) {
1611 /* should have arguments */
1612 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1614 parse_gnu_attribute_visibility_arg(attribute);
1617 if(!attribute->have_arguments) {
1618 /* should have arguments */
1619 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1621 parse_gnu_attribute_model_arg(attribute);
1625 if(!attribute->have_arguments) {
1626 /* should have arguments */
1627 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1629 parse_gnu_attribute_mode_arg(attribute);
1632 case GNU_AK_INTERRUPT:
1633 /* may have one string argument */
1634 if(attribute->have_arguments)
1635 parse_gnu_attribute_interrupt_arg(attribute);
1637 case GNU_AK_SENTINEL:
1638 /* may have one string argument */
1639 if(attribute->have_arguments)
1640 parse_gnu_attribute_const_arg(attribute);
1643 /* already handled */
1647 if(attribute != NULL) {
1649 last->next = attribute;
1652 head = last = attribute;
1656 if(token.type != ',')
1670 * Parse GNU attributes.
1672 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1674 decl_modifiers_t modifiers = 0;
1677 switch(token.type) {
1678 case T___attribute__: {
1679 modifiers |= parse_gnu_attribute(attributes);
1685 if(token.type != T_STRING_LITERAL) {
1686 parse_error_expected("while parsing assembler attribute",
1687 T_STRING_LITERAL, NULL);
1688 eat_until_matching_token('(');
1691 parse_string_literals();
1696 goto attributes_finished;
1700 attributes_finished:
1705 static designator_t *parse_designation(void)
1707 designator_t *result = NULL;
1708 designator_t *last = NULL;
1711 designator_t *designator;
1712 switch(token.type) {
1714 designator = allocate_ast_zero(sizeof(designator[0]));
1715 designator->source_position = token.source_position;
1717 add_anchor_token(']');
1718 designator->array_index = parse_constant_expression();
1719 rem_anchor_token(']');
1723 designator = allocate_ast_zero(sizeof(designator[0]));
1724 designator->source_position = token.source_position;
1726 if(token.type != T_IDENTIFIER) {
1727 parse_error_expected("while parsing designator",
1728 T_IDENTIFIER, NULL);
1731 designator->symbol = token.v.symbol;
1739 assert(designator != NULL);
1741 last->next = designator;
1743 result = designator;
1751 static initializer_t *initializer_from_string(array_type_t *type,
1752 const string_t *const string)
1754 /* TODO: check len vs. size of array type */
1757 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1758 initializer->string.string = *string;
1763 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1764 wide_string_t *const string)
1766 /* TODO: check len vs. size of array type */
1769 initializer_t *const initializer =
1770 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1771 initializer->wide_string.string = *string;
1777 * Build an initializer from a given expression.
1779 static initializer_t *initializer_from_expression(type_t *orig_type,
1780 expression_t *expression)
1782 /* TODO check that expression is a constant expression */
1784 /* § 6.7.8.14/15 char array may be initialized by string literals */
1785 type_t *type = skip_typeref(orig_type);
1786 type_t *expr_type_orig = expression->base.type;
1787 type_t *expr_type = skip_typeref(expr_type_orig);
1788 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1789 array_type_t *const array_type = &type->array;
1790 type_t *const element_type = skip_typeref(array_type->element_type);
1792 if (element_type->kind == TYPE_ATOMIC) {
1793 atomic_type_kind_t akind = element_type->atomic.akind;
1794 switch (expression->kind) {
1795 case EXPR_STRING_LITERAL:
1796 if (akind == ATOMIC_TYPE_CHAR
1797 || akind == ATOMIC_TYPE_SCHAR
1798 || akind == ATOMIC_TYPE_UCHAR) {
1799 return initializer_from_string(array_type,
1800 &expression->string.value);
1803 case EXPR_WIDE_STRING_LITERAL: {
1804 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1805 if (get_unqualified_type(element_type) == bare_wchar_type) {
1806 return initializer_from_wide_string(array_type,
1807 &expression->wide_string.value);
1817 type_t *const res_type = semantic_assign(type, expression, "initializer",
1818 &expression->base.source_position);
1819 if (res_type == NULL)
1822 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1823 result->value.value = create_implicit_cast(expression, res_type);
1829 * Checks if a given expression can be used as an constant initializer.
1831 static bool is_initializer_constant(const expression_t *expression)
1833 return is_constant_expression(expression)
1834 || is_address_constant(expression);
1838 * Parses an scalar initializer.
1840 * § 6.7.8.11; eat {} without warning
1842 static initializer_t *parse_scalar_initializer(type_t *type,
1843 bool must_be_constant)
1845 /* there might be extra {} hierarchies */
1847 while(token.type == '{') {
1850 warningf(HERE, "extra curly braces around scalar initializer");
1855 expression_t *expression = parse_assignment_expression();
1856 if(must_be_constant && !is_initializer_constant(expression)) {
1857 errorf(&expression->base.source_position,
1858 "Initialisation expression '%E' is not constant\n",
1862 initializer_t *initializer = initializer_from_expression(type, expression);
1864 if(initializer == NULL) {
1865 errorf(&expression->base.source_position,
1866 "expression '%E' (type '%T') doesn't match expected type '%T'",
1867 expression, expression->base.type, type);
1872 bool additional_warning_displayed = false;
1874 if(token.type == ',') {
1877 if(token.type != '}') {
1878 if(!additional_warning_displayed) {
1879 warningf(HERE, "additional elements in scalar initializer");
1880 additional_warning_displayed = true;
1891 * An entry in the type path.
1893 typedef struct type_path_entry_t type_path_entry_t;
1894 struct type_path_entry_t {
1895 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1897 size_t index; /**< For array types: the current index. */
1898 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1903 * A type path expression a position inside compound or array types.
1905 typedef struct type_path_t type_path_t;
1906 struct type_path_t {
1907 type_path_entry_t *path; /**< An flexible array containing the current path. */
1908 type_t *top_type; /**< type of the element the path points */
1909 size_t max_index; /**< largest index in outermost array */
1913 * Prints a type path for debugging.
1915 static __attribute__((unused)) void debug_print_type_path(
1916 const type_path_t *path)
1918 size_t len = ARR_LEN(path->path);
1920 for(size_t i = 0; i < len; ++i) {
1921 const type_path_entry_t *entry = & path->path[i];
1923 type_t *type = skip_typeref(entry->type);
1924 if(is_type_compound(type)) {
1925 /* in gcc mode structs can have no members */
1926 if(entry->v.compound_entry == NULL) {
1930 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
1931 } else if(is_type_array(type)) {
1932 fprintf(stderr, "[%zd]", entry->v.index);
1934 fprintf(stderr, "-INVALID-");
1937 if(path->top_type != NULL) {
1938 fprintf(stderr, " (");
1939 print_type(path->top_type);
1940 fprintf(stderr, ")");
1945 * Return the top type path entry, ie. in a path
1946 * (type).a.b returns the b.
1948 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1950 size_t len = ARR_LEN(path->path);
1952 return &path->path[len-1];
1956 * Enlarge the type path by an (empty) element.
1958 static type_path_entry_t *append_to_type_path(type_path_t *path)
1960 size_t len = ARR_LEN(path->path);
1961 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1963 type_path_entry_t *result = & path->path[len];
1964 memset(result, 0, sizeof(result[0]));
1969 * Descending into a sub-type. Enter the scope of the current
1972 static void descend_into_subtype(type_path_t *path)
1974 type_t *orig_top_type = path->top_type;
1975 type_t *top_type = skip_typeref(orig_top_type);
1977 assert(is_type_compound(top_type) || is_type_array(top_type));
1979 type_path_entry_t *top = append_to_type_path(path);
1980 top->type = top_type;
1982 if(is_type_compound(top_type)) {
1983 declaration_t *declaration = top_type->compound.declaration;
1984 declaration_t *entry = declaration->scope.declarations;
1985 top->v.compound_entry = entry;
1988 path->top_type = entry->type;
1990 path->top_type = NULL;
1993 assert(is_type_array(top_type));
1996 path->top_type = top_type->array.element_type;
2001 * Pop an entry from the given type path, ie. returning from
2002 * (type).a.b to (type).a
2004 static void ascend_from_subtype(type_path_t *path)
2006 type_path_entry_t *top = get_type_path_top(path);
2008 path->top_type = top->type;
2010 size_t len = ARR_LEN(path->path);
2011 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2015 * Pop entries from the given type path until the given
2016 * path level is reached.
2018 static void ascend_to(type_path_t *path, size_t top_path_level)
2020 size_t len = ARR_LEN(path->path);
2022 while(len > top_path_level) {
2023 ascend_from_subtype(path);
2024 len = ARR_LEN(path->path);
2028 static bool walk_designator(type_path_t *path, const designator_t *designator,
2029 bool used_in_offsetof)
2031 for( ; designator != NULL; designator = designator->next) {
2032 type_path_entry_t *top = get_type_path_top(path);
2033 type_t *orig_type = top->type;
2035 type_t *type = skip_typeref(orig_type);
2037 if(designator->symbol != NULL) {
2038 symbol_t *symbol = designator->symbol;
2039 if(!is_type_compound(type)) {
2040 if(is_type_valid(type)) {
2041 errorf(&designator->source_position,
2042 "'.%Y' designator used for non-compound type '%T'",
2048 declaration_t *declaration = type->compound.declaration;
2049 declaration_t *iter = declaration->scope.declarations;
2050 for( ; iter != NULL; iter = iter->next) {
2051 if(iter->symbol == symbol) {
2056 errorf(&designator->source_position,
2057 "'%T' has no member named '%Y'", orig_type, symbol);
2060 if(used_in_offsetof) {
2061 type_t *real_type = skip_typeref(iter->type);
2062 if(real_type->kind == TYPE_BITFIELD) {
2063 errorf(&designator->source_position,
2064 "offsetof designator '%Y' may not specify bitfield",
2070 top->type = orig_type;
2071 top->v.compound_entry = iter;
2072 orig_type = iter->type;
2074 expression_t *array_index = designator->array_index;
2075 assert(designator->array_index != NULL);
2077 if(!is_type_array(type)) {
2078 if(is_type_valid(type)) {
2079 errorf(&designator->source_position,
2080 "[%E] designator used for non-array type '%T'",
2081 array_index, orig_type);
2085 if(!is_type_valid(array_index->base.type)) {
2089 long index = fold_constant(array_index);
2090 if(!used_in_offsetof) {
2092 errorf(&designator->source_position,
2093 "array index [%E] must be positive", array_index);
2096 if(type->array.size_constant == true) {
2097 long array_size = type->array.size;
2098 if(index >= array_size) {
2099 errorf(&designator->source_position,
2100 "designator [%E] (%d) exceeds array size %d",
2101 array_index, index, array_size);
2107 top->type = orig_type;
2108 top->v.index = (size_t) index;
2109 orig_type = type->array.element_type;
2111 path->top_type = orig_type;
2113 if(designator->next != NULL) {
2114 descend_into_subtype(path);
2123 static void advance_current_object(type_path_t *path, size_t top_path_level)
2125 type_path_entry_t *top = get_type_path_top(path);
2127 type_t *type = skip_typeref(top->type);
2128 if(is_type_union(type)) {
2129 /* in unions only the first element is initialized */
2130 top->v.compound_entry = NULL;
2131 } else if(is_type_struct(type)) {
2132 declaration_t *entry = top->v.compound_entry;
2134 entry = entry->next;
2135 top->v.compound_entry = entry;
2137 path->top_type = entry->type;
2141 assert(is_type_array(type));
2145 if(!type->array.size_constant || top->v.index < type->array.size) {
2150 /* we're past the last member of the current sub-aggregate, try if we
2151 * can ascend in the type hierarchy and continue with another subobject */
2152 size_t len = ARR_LEN(path->path);
2154 if(len > top_path_level) {
2155 ascend_from_subtype(path);
2156 advance_current_object(path, top_path_level);
2158 path->top_type = NULL;
2163 * skip until token is found.
2165 static void skip_until(int type) {
2166 while(token.type != type) {
2167 if(token.type == T_EOF)
2174 * skip any {...} blocks until a closing bracket is reached.
2176 static void skip_initializers(void)
2178 if(token.type == '{')
2181 while(token.type != '}') {
2182 if(token.type == T_EOF)
2184 if(token.type == '{') {
2192 static initializer_t *create_empty_initializer(void)
2194 static initializer_t empty_initializer
2195 = { .list = { { INITIALIZER_LIST }, 0 } };
2196 return &empty_initializer;
2200 * Parse a part of an initialiser for a struct or union,
2202 static initializer_t *parse_sub_initializer(type_path_t *path,
2203 type_t *outer_type, size_t top_path_level,
2204 parse_initializer_env_t *env)
2206 if(token.type == '}') {
2207 /* empty initializer */
2208 return create_empty_initializer();
2211 type_t *orig_type = path->top_type;
2212 type_t *type = NULL;
2214 if (orig_type == NULL) {
2215 /* We are initializing an empty compound. */
2217 type = skip_typeref(orig_type);
2219 /* we can't do usefull stuff if we didn't even parse the type. Skip the
2220 * initializers in this case. */
2221 if(!is_type_valid(type)) {
2222 skip_initializers();
2223 return create_empty_initializer();
2227 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2230 designator_t *designator = NULL;
2231 if(token.type == '.' || token.type == '[') {
2232 designator = parse_designation();
2234 /* reset path to toplevel, evaluate designator from there */
2235 ascend_to(path, top_path_level);
2236 if(!walk_designator(path, designator, false)) {
2237 /* can't continue after designation error */
2241 initializer_t *designator_initializer
2242 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2243 designator_initializer->designator.designator = designator;
2244 ARR_APP1(initializer_t*, initializers, designator_initializer);
2246 orig_type = path->top_type;
2247 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2252 if(token.type == '{') {
2253 if(type != NULL && is_type_scalar(type)) {
2254 sub = parse_scalar_initializer(type, env->must_be_constant);
2258 if (env->declaration != NULL)
2259 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2260 env->declaration->symbol);
2262 errorf(HERE, "extra brace group at end of initializer");
2264 descend_into_subtype(path);
2266 add_anchor_token('}');
2267 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2269 rem_anchor_token('}');
2272 ascend_from_subtype(path);
2276 goto error_parse_next;
2280 /* must be an expression */
2281 expression_t *expression = parse_assignment_expression();
2283 if(env->must_be_constant && !is_initializer_constant(expression)) {
2284 errorf(&expression->base.source_position,
2285 "Initialisation expression '%E' is not constant\n",
2290 /* we are already outside, ... */
2294 /* handle { "string" } special case */
2295 if((expression->kind == EXPR_STRING_LITERAL
2296 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2297 && outer_type != NULL) {
2298 sub = initializer_from_expression(outer_type, expression);
2300 if(token.type == ',') {
2303 if(token.type != '}') {
2304 warningf(HERE, "excessive elements in initializer for type '%T'",
2307 /* TODO: eat , ... */
2312 /* descend into subtypes until expression matches type */
2314 orig_type = path->top_type;
2315 type = skip_typeref(orig_type);
2317 sub = initializer_from_expression(orig_type, expression);
2321 if(!is_type_valid(type)) {
2324 if(is_type_scalar(type)) {
2325 errorf(&expression->base.source_position,
2326 "expression '%E' doesn't match expected type '%T'",
2327 expression, orig_type);
2331 descend_into_subtype(path);
2335 /* update largest index of top array */
2336 const type_path_entry_t *first = &path->path[0];
2337 type_t *first_type = first->type;
2338 first_type = skip_typeref(first_type);
2339 if(is_type_array(first_type)) {
2340 size_t index = first->v.index;
2341 if(index > path->max_index)
2342 path->max_index = index;
2346 /* append to initializers list */
2347 ARR_APP1(initializer_t*, initializers, sub);
2350 if(env->declaration != NULL)
2351 warningf(HERE, "excess elements in struct initializer for '%Y'",
2352 env->declaration->symbol);
2354 warningf(HERE, "excess elements in struct initializer");
2358 if(token.type == '}') {
2362 if(token.type == '}') {
2367 /* advance to the next declaration if we are not at the end */
2368 advance_current_object(path, top_path_level);
2369 orig_type = path->top_type;
2370 if(orig_type != NULL)
2371 type = skip_typeref(orig_type);
2377 size_t len = ARR_LEN(initializers);
2378 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2379 initializer_t *result = allocate_ast_zero(size);
2380 result->kind = INITIALIZER_LIST;
2381 result->list.len = len;
2382 memcpy(&result->list.initializers, initializers,
2383 len * sizeof(initializers[0]));
2385 DEL_ARR_F(initializers);
2386 ascend_to(path, top_path_level+1);
2391 skip_initializers();
2392 DEL_ARR_F(initializers);
2393 ascend_to(path, top_path_level+1);
2398 * Parses an initializer. Parsers either a compound literal
2399 * (env->declaration == NULL) or an initializer of a declaration.
2401 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2403 type_t *type = skip_typeref(env->type);
2404 initializer_t *result = NULL;
2407 if(is_type_scalar(type)) {
2408 result = parse_scalar_initializer(type, env->must_be_constant);
2409 } else if(token.type == '{') {
2413 memset(&path, 0, sizeof(path));
2414 path.top_type = env->type;
2415 path.path = NEW_ARR_F(type_path_entry_t, 0);
2417 descend_into_subtype(&path);
2419 add_anchor_token('}');
2420 result = parse_sub_initializer(&path, env->type, 1, env);
2421 rem_anchor_token('}');
2423 max_index = path.max_index;
2424 DEL_ARR_F(path.path);
2428 /* parse_scalar_initializer() also works in this case: we simply
2429 * have an expression without {} around it */
2430 result = parse_scalar_initializer(type, env->must_be_constant);
2433 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2434 * the array type size */
2435 if(is_type_array(type) && type->array.size_expression == NULL
2436 && result != NULL) {
2438 switch (result->kind) {
2439 case INITIALIZER_LIST:
2440 size = max_index + 1;
2443 case INITIALIZER_STRING:
2444 size = result->string.string.size;
2447 case INITIALIZER_WIDE_STRING:
2448 size = result->wide_string.string.size;
2452 internal_errorf(HERE, "invalid initializer type");
2455 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2456 cnst->base.type = type_size_t;
2457 cnst->conste.v.int_value = size;
2459 type_t *new_type = duplicate_type(type);
2461 new_type->array.size_expression = cnst;
2462 new_type->array.size_constant = true;
2463 new_type->array.size = size;
2464 env->type = new_type;
2472 static declaration_t *append_declaration(declaration_t *declaration);
2474 static declaration_t *parse_compound_type_specifier(bool is_struct)
2476 gnu_attribute_t *attributes = NULL;
2477 decl_modifiers_t modifiers = 0;
2484 symbol_t *symbol = NULL;
2485 declaration_t *declaration = NULL;
2487 if (token.type == T___attribute__) {
2488 modifiers |= parse_attributes(&attributes);
2491 if(token.type == T_IDENTIFIER) {
2492 symbol = token.v.symbol;
2496 declaration = get_declaration(symbol, NAMESPACE_STRUCT);
2498 declaration = get_declaration(symbol, NAMESPACE_UNION);
2500 } else if(token.type != '{') {
2502 parse_error_expected("while parsing struct type specifier",
2503 T_IDENTIFIER, '{', NULL);
2505 parse_error_expected("while parsing union type specifier",
2506 T_IDENTIFIER, '{', NULL);
2512 if(declaration == NULL) {
2513 declaration = allocate_declaration_zero();
2514 declaration->namespc =
2515 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2516 declaration->source_position = token.source_position;
2517 declaration->symbol = symbol;
2518 declaration->parent_scope = scope;
2519 if (symbol != NULL) {
2520 environment_push(declaration);
2522 append_declaration(declaration);
2525 if(token.type == '{') {
2526 if (declaration->init.complete) {
2527 assert(symbol != NULL);
2528 errorf(HERE, "multiple definitions of '%s %Y'",
2529 is_struct ? "struct" : "union", symbol);
2530 declaration->scope.declarations = NULL;
2532 declaration->init.complete = true;
2534 parse_compound_type_entries(declaration);
2535 modifiers |= parse_attributes(&attributes);
2538 declaration->modifiers |= modifiers;
2542 static void parse_enum_entries(type_t *const enum_type)
2546 if(token.type == '}') {
2548 errorf(HERE, "empty enum not allowed");
2552 add_anchor_token('}');
2554 if(token.type != T_IDENTIFIER) {
2555 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2557 rem_anchor_token('}');
2561 declaration_t *const entry = allocate_declaration_zero();
2562 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
2563 entry->type = enum_type;
2564 entry->symbol = token.v.symbol;
2565 entry->source_position = token.source_position;
2568 if(token.type == '=') {
2570 expression_t *value = parse_constant_expression();
2572 value = create_implicit_cast(value, enum_type);
2573 entry->init.enum_value = value;
2578 record_declaration(entry);
2580 if(token.type != ',')
2583 } while(token.type != '}');
2584 rem_anchor_token('}');
2592 static type_t *parse_enum_specifier(void)
2594 gnu_attribute_t *attributes = NULL;
2595 declaration_t *declaration;
2599 if(token.type == T_IDENTIFIER) {
2600 symbol = token.v.symbol;
2603 declaration = get_declaration(symbol, NAMESPACE_ENUM);
2604 } else if(token.type != '{') {
2605 parse_error_expected("while parsing enum type specifier",
2606 T_IDENTIFIER, '{', NULL);
2613 if(declaration == NULL) {
2614 declaration = allocate_declaration_zero();
2615 declaration->namespc = NAMESPACE_ENUM;
2616 declaration->source_position = token.source_position;
2617 declaration->symbol = symbol;
2618 declaration->parent_scope = scope;
2621 type_t *const type = allocate_type_zero(TYPE_ENUM, &declaration->source_position);
2622 type->enumt.declaration = declaration;
2624 if(token.type == '{') {
2625 if(declaration->init.complete) {
2626 errorf(HERE, "multiple definitions of enum %Y", symbol);
2628 if (symbol != NULL) {
2629 environment_push(declaration);
2631 append_declaration(declaration);
2632 declaration->init.complete = true;
2634 parse_enum_entries(type);
2635 parse_attributes(&attributes);
2642 * if a symbol is a typedef to another type, return true
2644 static bool is_typedef_symbol(symbol_t *symbol)
2646 const declaration_t *const declaration =
2647 get_declaration(symbol, NAMESPACE_NORMAL);
2649 declaration != NULL &&
2650 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
2653 static type_t *parse_typeof(void)
2660 add_anchor_token(')');
2662 expression_t *expression = NULL;
2665 switch(token.type) {
2666 case T___extension__:
2667 /* this can be a prefix to a typename or an expression */
2668 /* we simply eat it now. */
2671 } while(token.type == T___extension__);
2675 if(is_typedef_symbol(token.v.symbol)) {
2676 type = parse_typename();
2678 expression = parse_expression();
2679 type = expression->base.type;
2684 type = parse_typename();
2688 expression = parse_expression();
2689 type = expression->base.type;
2693 rem_anchor_token(')');
2696 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, &expression->base.source_position);
2697 typeof_type->typeoft.expression = expression;
2698 typeof_type->typeoft.typeof_type = type;
2706 SPECIFIER_SIGNED = 1 << 0,
2707 SPECIFIER_UNSIGNED = 1 << 1,
2708 SPECIFIER_LONG = 1 << 2,
2709 SPECIFIER_INT = 1 << 3,
2710 SPECIFIER_DOUBLE = 1 << 4,
2711 SPECIFIER_CHAR = 1 << 5,
2712 SPECIFIER_SHORT = 1 << 6,
2713 SPECIFIER_LONG_LONG = 1 << 7,
2714 SPECIFIER_FLOAT = 1 << 8,
2715 SPECIFIER_BOOL = 1 << 9,
2716 SPECIFIER_VOID = 1 << 10,
2717 SPECIFIER_INT8 = 1 << 11,
2718 SPECIFIER_INT16 = 1 << 12,
2719 SPECIFIER_INT32 = 1 << 13,
2720 SPECIFIER_INT64 = 1 << 14,
2721 SPECIFIER_INT128 = 1 << 15,
2722 SPECIFIER_COMPLEX = 1 << 16,
2723 SPECIFIER_IMAGINARY = 1 << 17,
2726 static type_t *create_builtin_type(symbol_t *const symbol,
2727 type_t *const real_type)
2729 type_t *type = allocate_type_zero(TYPE_BUILTIN, &builtin_source_position);
2730 type->builtin.symbol = symbol;
2731 type->builtin.real_type = real_type;
2733 type_t *result = typehash_insert(type);
2734 if(type != result) {
2741 static type_t *get_typedef_type(symbol_t *symbol)
2743 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
2744 if(declaration == NULL ||
2745 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
2748 type_t *type = allocate_type_zero(TYPE_TYPEDEF, &declaration->source_position);
2749 type->typedeft.declaration = declaration;
2755 * check for the allowed MS alignment values.
2757 static bool check_elignment_value(long long intvalue) {
2758 if(intvalue < 1 || intvalue > 8192) {
2759 errorf(HERE, "illegal alignment value");
2762 unsigned v = (unsigned)intvalue;
2763 for(unsigned i = 1; i <= 8192; i += i) {
2767 errorf(HERE, "alignment must be power of two");
2771 #define DET_MOD(name, tag) do { \
2772 if(*modifiers & tag) warningf(HERE, #name " used more than once"); \
2773 *modifiers |= tag; \
2776 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
2778 decl_modifiers_t *modifiers = &specifiers->modifiers;
2781 if(token.type == T_restrict) {
2783 DET_MOD(restrict, DM_RESTRICT);
2785 } else if(token.type != T_IDENTIFIER)
2787 symbol_t *symbol = token.v.symbol;
2788 if(symbol == sym_align) {
2791 if(token.type != T_INTEGER)
2793 if(check_elignment_value(token.v.intvalue)) {
2794 if(specifiers->alignment != 0)
2795 warningf(HERE, "align used more than once");
2796 specifiers->alignment = (unsigned char)token.v.intvalue;
2800 } else if(symbol == sym_allocate) {
2803 if(token.type != T_IDENTIFIER)
2805 (void)token.v.symbol;
2807 } else if(symbol == sym_dllimport) {
2809 DET_MOD(dllimport, DM_DLLIMPORT);
2810 } else if(symbol == sym_dllexport) {
2812 DET_MOD(dllexport, DM_DLLEXPORT);
2813 } else if(symbol == sym_thread) {
2815 DET_MOD(thread, DM_THREAD);
2816 } else if(symbol == sym_naked) {
2818 DET_MOD(naked, DM_NAKED);
2819 } else if(symbol == sym_noinline) {
2821 DET_MOD(noinline, DM_NOINLINE);
2822 } else if(symbol == sym_noreturn) {
2824 DET_MOD(noreturn, DM_NORETURN);
2825 } else if(symbol == sym_nothrow) {
2827 DET_MOD(nothrow, DM_NOTHROW);
2828 } else if(symbol == sym_novtable) {
2830 DET_MOD(novtable, DM_NOVTABLE);
2831 } else if(symbol == sym_property) {
2835 bool is_get = false;
2836 if(token.type != T_IDENTIFIER)
2838 if(token.v.symbol == sym_get) {
2840 } else if(token.v.symbol == sym_put) {
2842 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
2847 if(token.type != T_IDENTIFIER)
2850 if(specifiers->get_property_sym != NULL) {
2851 errorf(HERE, "get property name already specified");
2853 specifiers->get_property_sym = token.v.symbol;
2856 if(specifiers->put_property_sym != NULL) {
2857 errorf(HERE, "put property name already specified");
2859 specifiers->put_property_sym = token.v.symbol;
2863 if(token.type == ',') {
2870 } else if(symbol == sym_selectany) {
2872 DET_MOD(selectany, DM_SELECTANY);
2873 } else if(symbol == sym_uuid) {
2876 if(token.type != T_STRING_LITERAL)
2880 } else if(symbol == sym_deprecated) {
2882 if(specifiers->deprecated != 0)
2883 warningf(HERE, "deprecated used more than once");
2884 specifiers->deprecated = 1;
2885 if(token.type == '(') {
2887 if(token.type == T_STRING_LITERAL) {
2888 specifiers->deprecated_string = token.v.string.begin;
2891 errorf(HERE, "string literal expected");
2895 } else if(symbol == sym_noalias) {
2897 DET_MOD(noalias, DM_NOALIAS);
2899 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
2901 if(token.type == '(')
2905 if (token.type == ',')
2912 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2914 type_t *type = NULL;
2915 unsigned type_qualifiers = 0;
2916 unsigned type_specifiers = 0;
2919 specifiers->source_position = token.source_position;
2922 switch(token.type) {
2925 #define MATCH_STORAGE_CLASS(token, class) \
2927 if(specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
2928 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2930 specifiers->declared_storage_class = class; \
2934 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
2935 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
2936 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
2937 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
2938 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2943 add_anchor_token(')');
2944 parse_microsoft_extended_decl_modifier(specifiers);
2945 rem_anchor_token(')');
2950 switch (specifiers->declared_storage_class) {
2951 case STORAGE_CLASS_NONE:
2952 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
2955 case STORAGE_CLASS_EXTERN:
2956 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
2959 case STORAGE_CLASS_STATIC:
2960 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
2964 errorf(HERE, "multiple storage classes in declaration specifiers");
2970 /* type qualifiers */
2971 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
2973 type_qualifiers |= qualifier; \
2977 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
2978 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2979 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2980 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
2981 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
2982 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
2983 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
2984 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
2986 case T___extension__:
2991 /* type specifiers */
2992 #define MATCH_SPECIFIER(token, specifier, name) \
2995 if(type_specifiers & specifier) { \
2996 errorf(HERE, "multiple " name " type specifiers given"); \
2998 type_specifiers |= specifier; \
3002 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void")
3003 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char")
3004 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short")
3005 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int")
3006 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float")
3007 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double")
3008 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed")
3009 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned")
3010 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool")
3011 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8")
3012 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16")
3013 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32")
3014 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64")
3015 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128")
3016 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex")
3017 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary")
3019 case T__forceinline:
3020 /* only in microsoft mode */
3021 specifiers->modifiers |= DM_FORCEINLINE;
3025 specifiers->is_inline = true;
3030 if(type_specifiers & SPECIFIER_LONG_LONG) {
3031 errorf(HERE, "multiple type specifiers given");
3032 } else if(type_specifiers & SPECIFIER_LONG) {
3033 type_specifiers |= SPECIFIER_LONG_LONG;
3035 type_specifiers |= SPECIFIER_LONG;
3040 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
3042 type->compound.declaration = parse_compound_type_specifier(true);
3046 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
3048 type->compound.declaration = parse_compound_type_specifier(false);
3052 type = parse_enum_specifier();
3055 type = parse_typeof();
3057 case T___builtin_va_list:
3058 type = duplicate_type(type_valist);
3062 case T___attribute__:
3063 specifiers->modifiers
3064 |= parse_attributes(&specifiers->gnu_attributes);
3067 case T_IDENTIFIER: {
3068 /* only parse identifier if we haven't found a type yet */
3069 if(type != NULL || type_specifiers != 0)
3070 goto finish_specifiers;
3072 type_t *typedef_type = get_typedef_type(token.v.symbol);
3074 if(typedef_type == NULL)
3075 goto finish_specifiers;
3078 type = typedef_type;
3082 /* function specifier */
3084 goto finish_specifiers;
3091 atomic_type_kind_t atomic_type;
3093 /* match valid basic types */
3094 switch(type_specifiers) {
3095 case SPECIFIER_VOID:
3096 atomic_type = ATOMIC_TYPE_VOID;
3098 case SPECIFIER_CHAR:
3099 atomic_type = ATOMIC_TYPE_CHAR;
3101 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3102 atomic_type = ATOMIC_TYPE_SCHAR;
3104 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3105 atomic_type = ATOMIC_TYPE_UCHAR;
3107 case SPECIFIER_SHORT:
3108 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3109 case SPECIFIER_SHORT | SPECIFIER_INT:
3110 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3111 atomic_type = ATOMIC_TYPE_SHORT;
3113 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3114 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3115 atomic_type = ATOMIC_TYPE_USHORT;
3118 case SPECIFIER_SIGNED:
3119 case SPECIFIER_SIGNED | SPECIFIER_INT:
3120 atomic_type = ATOMIC_TYPE_INT;
3122 case SPECIFIER_UNSIGNED:
3123 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3124 atomic_type = ATOMIC_TYPE_UINT;
3126 case SPECIFIER_LONG:
3127 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3128 case SPECIFIER_LONG | SPECIFIER_INT:
3129 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3130 atomic_type = ATOMIC_TYPE_LONG;
3132 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3133 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3134 atomic_type = ATOMIC_TYPE_ULONG;
3136 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3137 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3138 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3139 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3141 atomic_type = ATOMIC_TYPE_LONGLONG;
3143 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3144 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3146 atomic_type = ATOMIC_TYPE_ULONGLONG;
3149 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3150 atomic_type = unsigned_int8_type_kind;
3153 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3154 atomic_type = unsigned_int16_type_kind;
3157 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3158 atomic_type = unsigned_int32_type_kind;
3161 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3162 atomic_type = unsigned_int64_type_kind;
3165 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3166 atomic_type = unsigned_int128_type_kind;
3169 case SPECIFIER_INT8:
3170 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3171 atomic_type = int8_type_kind;
3174 case SPECIFIER_INT16:
3175 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3176 atomic_type = int16_type_kind;
3179 case SPECIFIER_INT32:
3180 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3181 atomic_type = int32_type_kind;
3184 case SPECIFIER_INT64:
3185 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3186 atomic_type = int64_type_kind;
3189 case SPECIFIER_INT128:
3190 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3191 atomic_type = int128_type_kind;
3194 case SPECIFIER_FLOAT:
3195 atomic_type = ATOMIC_TYPE_FLOAT;
3197 case SPECIFIER_DOUBLE:
3198 atomic_type = ATOMIC_TYPE_DOUBLE;
3200 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3201 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3203 case SPECIFIER_BOOL:
3204 atomic_type = ATOMIC_TYPE_BOOL;
3206 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3207 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3208 atomic_type = ATOMIC_TYPE_FLOAT;
3210 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3211 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3212 atomic_type = ATOMIC_TYPE_DOUBLE;
3214 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3215 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3216 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3219 /* invalid specifier combination, give an error message */
3220 if(type_specifiers == 0) {
3221 if (! strict_mode) {
3222 if (warning.implicit_int) {
3223 warningf(HERE, "no type specifiers in declaration, using 'int'");
3225 atomic_type = ATOMIC_TYPE_INT;
3228 errorf(HERE, "no type specifiers given in declaration");
3230 } else if((type_specifiers & SPECIFIER_SIGNED) &&
3231 (type_specifiers & SPECIFIER_UNSIGNED)) {
3232 errorf(HERE, "signed and unsigned specifiers gives");
3233 } else if(type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3234 errorf(HERE, "only integer types can be signed or unsigned");
3236 errorf(HERE, "multiple datatypes in declaration");
3238 atomic_type = ATOMIC_TYPE_INVALID;
3241 if(type_specifiers & SPECIFIER_COMPLEX &&
3242 atomic_type != ATOMIC_TYPE_INVALID) {
3243 type = allocate_type_zero(TYPE_COMPLEX, &builtin_source_position);
3244 type->complex.akind = atomic_type;
3245 } else if(type_specifiers & SPECIFIER_IMAGINARY &&
3246 atomic_type != ATOMIC_TYPE_INVALID) {
3247 type = allocate_type_zero(TYPE_IMAGINARY, &builtin_source_position);
3248 type->imaginary.akind = atomic_type;
3250 type = allocate_type_zero(TYPE_ATOMIC, &builtin_source_position);
3251 type->atomic.akind = atomic_type;
3255 if(type_specifiers != 0) {
3256 errorf(HERE, "multiple datatypes in declaration");
3260 type->base.qualifiers = type_qualifiers;
3261 /* FIXME: check type qualifiers here */
3263 type_t *result = typehash_insert(type);
3264 if(newtype && result != type) {
3268 specifiers->type = result;
3273 static type_qualifiers_t parse_type_qualifiers(void)
3275 type_qualifiers_t type_qualifiers = TYPE_QUALIFIER_NONE;
3278 switch(token.type) {
3279 /* type qualifiers */
3280 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3281 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3282 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3283 /* microsoft extended type modifiers */
3284 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3285 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3286 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3287 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3288 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3291 return type_qualifiers;
3296 static declaration_t *parse_identifier_list(void)
3298 declaration_t *declarations = NULL;
3299 declaration_t *last_declaration = NULL;
3301 declaration_t *const declaration = allocate_declaration_zero();
3302 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3303 declaration->source_position = token.source_position;
3304 declaration->symbol = token.v.symbol;
3307 if(last_declaration != NULL) {
3308 last_declaration->next = declaration;
3310 declarations = declaration;
3312 last_declaration = declaration;
3314 if (token.type != ',') {
3318 } while(token.type == T_IDENTIFIER);
3320 return declarations;
3323 static void semantic_parameter(declaration_t *declaration)
3325 /* TODO: improve error messages */
3327 if(declaration->declared_storage_class == STORAGE_CLASS_TYPEDEF) {
3328 errorf(HERE, "typedef not allowed in parameter list");
3329 } else if(declaration->declared_storage_class != STORAGE_CLASS_NONE
3330 && declaration->declared_storage_class != STORAGE_CLASS_REGISTER) {
3331 errorf(HERE, "parameter may only have none or register storage class");
3334 type_t *const orig_type = declaration->type;
3335 type_t * type = skip_typeref(orig_type);
3337 /* Array as last part of a parameter type is just syntactic sugar. Turn it
3338 * into a pointer. § 6.7.5.3 (7) */
3339 if (is_type_array(type)) {
3340 type_t *const element_type = type->array.element_type;
3342 type = make_pointer_type(element_type, type->base.qualifiers);
3344 declaration->type = type;
3347 if(is_type_incomplete(type)) {
3348 errorf(HERE, "incomplete type '%T' not allowed for parameter '%Y'",
3349 orig_type, declaration->symbol);
3353 static declaration_t *parse_parameter(void)
3355 declaration_specifiers_t specifiers;
3356 memset(&specifiers, 0, sizeof(specifiers));
3358 parse_declaration_specifiers(&specifiers);
3360 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
3362 semantic_parameter(declaration);
3367 static declaration_t *parse_parameters(function_type_t *type)
3369 declaration_t *declarations = NULL;
3372 add_anchor_token(')');
3373 int saved_comma_state = save_and_reset_anchor_state(',');
3375 if(token.type == T_IDENTIFIER) {
3376 symbol_t *symbol = token.v.symbol;
3377 if(!is_typedef_symbol(symbol)) {
3378 type->kr_style_parameters = true;
3379 declarations = parse_identifier_list();
3380 goto parameters_finished;
3384 if(token.type == ')') {
3385 type->unspecified_parameters = 1;
3386 goto parameters_finished;
3388 if(token.type == T_void && look_ahead(1)->type == ')') {
3390 goto parameters_finished;
3393 declaration_t *declaration;
3394 declaration_t *last_declaration = NULL;
3395 function_parameter_t *parameter;
3396 function_parameter_t *last_parameter = NULL;
3399 switch(token.type) {
3403 goto parameters_finished;
3406 case T___extension__:
3408 declaration = parse_parameter();
3410 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
3411 memset(parameter, 0, sizeof(parameter[0]));
3412 parameter->type = declaration->type;
3414 if(last_parameter != NULL) {
3415 last_declaration->next = declaration;
3416 last_parameter->next = parameter;
3418 type->parameters = parameter;
3419 declarations = declaration;
3421 last_parameter = parameter;
3422 last_declaration = declaration;
3426 goto parameters_finished;
3428 if (token.type != ',') {
3429 goto parameters_finished;
3435 parameters_finished:
3436 rem_anchor_token(')');
3439 restore_anchor_state(',', saved_comma_state);
3440 return declarations;
3443 restore_anchor_state(',', saved_comma_state);
3452 } construct_type_kind_t;
3454 typedef struct construct_type_t construct_type_t;
3455 struct construct_type_t {
3456 construct_type_kind_t kind;
3457 construct_type_t *next;
3460 typedef struct parsed_pointer_t parsed_pointer_t;
3461 struct parsed_pointer_t {
3462 construct_type_t construct_type;
3463 type_qualifiers_t type_qualifiers;
3466 typedef struct construct_function_type_t construct_function_type_t;
3467 struct construct_function_type_t {
3468 construct_type_t construct_type;
3469 type_t *function_type;
3472 typedef struct parsed_array_t parsed_array_t;
3473 struct parsed_array_t {
3474 construct_type_t construct_type;
3475 type_qualifiers_t type_qualifiers;
3481 typedef struct construct_base_type_t construct_base_type_t;
3482 struct construct_base_type_t {
3483 construct_type_t construct_type;
3487 static construct_type_t *parse_pointer_declarator(void)
3491 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3492 memset(pointer, 0, sizeof(pointer[0]));
3493 pointer->construct_type.kind = CONSTRUCT_POINTER;
3494 pointer->type_qualifiers = parse_type_qualifiers();
3496 return (construct_type_t*) pointer;
3499 static construct_type_t *parse_array_declarator(void)
3502 add_anchor_token(']');
3504 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
3505 memset(array, 0, sizeof(array[0]));
3506 array->construct_type.kind = CONSTRUCT_ARRAY;
3508 if(token.type == T_static) {
3509 array->is_static = true;
3513 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3514 if(type_qualifiers != 0) {
3515 if(token.type == T_static) {
3516 array->is_static = true;
3520 array->type_qualifiers = type_qualifiers;
3522 if(token.type == '*' && look_ahead(1)->type == ']') {
3523 array->is_variable = true;
3525 } else if(token.type != ']') {
3526 array->size = parse_assignment_expression();
3529 rem_anchor_token(']');
3532 return (construct_type_t*) array;
3537 static construct_type_t *parse_function_declarator(declaration_t *declaration)
3540 if(declaration != NULL) {
3541 type = allocate_type_zero(TYPE_FUNCTION, &declaration->source_position);
3543 type = allocate_type_zero(TYPE_FUNCTION, HERE);
3546 declaration_t *parameters = parse_parameters(&type->function);
3547 if(declaration != NULL) {
3548 declaration->scope.declarations = parameters;
3551 construct_function_type_t *construct_function_type =
3552 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
3553 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
3554 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
3555 construct_function_type->function_type = type;
3557 return (construct_type_t*) construct_function_type;
3560 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
3561 bool may_be_abstract)
3563 /* construct a single linked list of construct_type_t's which describe
3564 * how to construct the final declarator type */
3565 construct_type_t *first = NULL;
3566 construct_type_t *last = NULL;
3567 gnu_attribute_t *attributes = NULL;
3570 while(token.type == '*') {
3571 construct_type_t *type = parse_pointer_declarator();
3582 /* TODO: find out if this is correct */
3583 decl_modifiers_t modifiers = parse_attributes(&attributes);
3584 if (declaration != NULL)
3585 declaration->modifiers |= modifiers;
3587 construct_type_t *inner_types = NULL;
3589 switch(token.type) {
3591 if(declaration == NULL) {
3592 errorf(HERE, "no identifier expected in typename");
3594 declaration->symbol = token.v.symbol;
3595 declaration->source_position = token.source_position;
3601 add_anchor_token(')');
3602 inner_types = parse_inner_declarator(declaration, may_be_abstract);
3603 rem_anchor_token(')');
3609 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3610 /* avoid a loop in the outermost scope, because eat_statement doesn't
3612 if(token.type == '}' && current_function == NULL) {
3620 construct_type_t *p = last;
3623 construct_type_t *type;
3624 switch(token.type) {
3626 type = parse_function_declarator(declaration);
3629 type = parse_array_declarator();
3632 goto declarator_finished;
3635 /* insert in the middle of the list (behind p) */
3637 type->next = p->next;
3648 declarator_finished:
3649 modifiers = parse_attributes(&attributes);
3650 if (declaration != NULL)
3651 declaration->modifiers |= modifiers;
3653 /* append inner_types at the end of the list, we don't to set last anymore
3654 * as it's not needed anymore */
3656 assert(first == NULL);
3657 first = inner_types;
3659 last->next = inner_types;
3667 static type_t *construct_declarator_type(construct_type_t *construct_list,
3670 construct_type_t *iter = construct_list;
3671 for( ; iter != NULL; iter = iter->next) {
3672 switch(iter->kind) {
3673 case CONSTRUCT_INVALID:
3674 internal_errorf(HERE, "invalid type construction found");
3675 case CONSTRUCT_FUNCTION: {
3676 construct_function_type_t *construct_function_type
3677 = (construct_function_type_t*) iter;
3679 type_t *function_type = construct_function_type->function_type;
3681 function_type->function.return_type = type;
3683 type_t *skipped_return_type = skip_typeref(type);
3684 if (is_type_function(skipped_return_type)) {
3685 errorf(HERE, "function returning function is not allowed");
3686 type = type_error_type;
3687 } else if (is_type_array(skipped_return_type)) {
3688 errorf(HERE, "function returning array is not allowed");
3689 type = type_error_type;
3691 type = function_type;
3696 case CONSTRUCT_POINTER: {
3697 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
3698 type_t *pointer_type = allocate_type_zero(TYPE_POINTER, &null_position);
3699 pointer_type->pointer.points_to = type;
3700 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
3702 type = pointer_type;
3706 case CONSTRUCT_ARRAY: {
3707 parsed_array_t *parsed_array = (parsed_array_t*) iter;
3708 type_t *array_type = allocate_type_zero(TYPE_ARRAY, &null_position);
3710 expression_t *size_expression = parsed_array->size;
3711 if(size_expression != NULL) {
3713 = create_implicit_cast(size_expression, type_size_t);
3716 array_type->base.qualifiers = parsed_array->type_qualifiers;
3717 array_type->array.element_type = type;
3718 array_type->array.is_static = parsed_array->is_static;
3719 array_type->array.is_variable = parsed_array->is_variable;
3720 array_type->array.size_expression = size_expression;
3722 if(size_expression != NULL) {
3723 if(is_constant_expression(size_expression)) {
3724 array_type->array.size_constant = true;
3725 array_type->array.size
3726 = fold_constant(size_expression);
3728 array_type->array.is_vla = true;
3732 type_t *skipped_type = skip_typeref(type);
3733 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
3734 errorf(HERE, "array of void is not allowed");
3735 type = type_error_type;
3743 type_t *hashed_type = typehash_insert(type);
3744 if(hashed_type != type) {
3745 /* the function type was constructed earlier freeing it here will
3746 * destroy other types... */
3747 if(iter->kind != CONSTRUCT_FUNCTION) {
3757 static declaration_t *parse_declarator(
3758 const declaration_specifiers_t *specifiers, bool may_be_abstract)
3760 declaration_t *const declaration = allocate_declaration_zero();
3761 declaration->declared_storage_class = specifiers->declared_storage_class;
3762 declaration->modifiers = specifiers->modifiers;
3763 declaration->deprecated = specifiers->deprecated;
3764 declaration->deprecated_string = specifiers->deprecated_string;
3765 declaration->get_property_sym = specifiers->get_property_sym;
3766 declaration->put_property_sym = specifiers->put_property_sym;
3767 declaration->is_inline = specifiers->is_inline;
3769 declaration->storage_class = specifiers->declared_storage_class;
3770 if(declaration->storage_class == STORAGE_CLASS_NONE
3771 && scope != global_scope) {
3772 declaration->storage_class = STORAGE_CLASS_AUTO;
3775 if(specifiers->alignment != 0) {
3776 /* TODO: add checks here */
3777 declaration->alignment = specifiers->alignment;
3780 construct_type_t *construct_type
3781 = parse_inner_declarator(declaration, may_be_abstract);
3782 type_t *const type = specifiers->type;
3783 declaration->type = construct_declarator_type(construct_type, type);
3785 if(construct_type != NULL) {
3786 obstack_free(&temp_obst, construct_type);
3792 static type_t *parse_abstract_declarator(type_t *base_type)
3794 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
3796 type_t *result = construct_declarator_type(construct_type, base_type);
3797 if(construct_type != NULL) {
3798 obstack_free(&temp_obst, construct_type);
3804 static declaration_t *append_declaration(declaration_t* const declaration)
3806 if (last_declaration != NULL) {
3807 last_declaration->next = declaration;
3809 scope->declarations = declaration;
3811 last_declaration = declaration;
3816 * Check if the declaration of main is suspicious. main should be a
3817 * function with external linkage, returning int, taking either zero
3818 * arguments, two, or three arguments of appropriate types, ie.
3820 * int main([ int argc, char **argv [, char **env ] ]).
3822 * @param decl the declaration to check
3823 * @param type the function type of the declaration
3825 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
3827 if (decl->storage_class == STORAGE_CLASS_STATIC) {
3828 warningf(&decl->source_position,
3829 "'main' is normally a non-static function");
3831 if (skip_typeref(func_type->return_type) != type_int) {
3832 warningf(&decl->source_position,
3833 "return type of 'main' should be 'int', but is '%T'",
3834 func_type->return_type);
3836 const function_parameter_t *parm = func_type->parameters;
3838 type_t *const first_type = parm->type;
3839 if (!types_compatible(skip_typeref(first_type), type_int)) {
3840 warningf(&decl->source_position,
3841 "first argument of 'main' should be 'int', but is '%T'", first_type);
3845 type_t *const second_type = parm->type;
3846 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
3847 warningf(&decl->source_position,
3848 "second argument of 'main' should be 'char**', but is '%T'", second_type);
3852 type_t *const third_type = parm->type;
3853 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
3854 warningf(&decl->source_position,
3855 "third argument of 'main' should be 'char**', but is '%T'", third_type);
3859 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
3863 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
3869 * Check if a symbol is the equal to "main".
3871 static bool is_sym_main(const symbol_t *const sym)
3873 return strcmp(sym->string, "main") == 0;
3876 static declaration_t *internal_record_declaration(
3877 declaration_t *const declaration,
3878 const bool is_function_definition)
3880 const symbol_t *const symbol = declaration->symbol;
3881 const namespace_t namespc = (namespace_t)declaration->namespc;
3883 assert(declaration->symbol != NULL);
3884 declaration_t *previous_declaration = get_declaration(symbol, namespc);
3886 type_t *const orig_type = declaration->type;
3887 type_t *const type = skip_typeref(orig_type);
3888 if (is_type_function(type) &&
3889 type->function.unspecified_parameters &&
3890 warning.strict_prototypes &&
3891 previous_declaration == NULL) {
3892 warningf(&declaration->source_position,
3893 "function declaration '%#T' is not a prototype",
3894 orig_type, declaration->symbol);
3897 if (is_function_definition && warning.main && is_sym_main(symbol)) {
3898 check_type_of_main(declaration, &type->function);
3901 assert(declaration != previous_declaration);
3902 if (previous_declaration != NULL
3903 && previous_declaration->parent_scope == scope) {
3904 /* can happen for K&R style declarations */
3905 if (previous_declaration->type == NULL) {
3906 previous_declaration->type = declaration->type;
3909 const type_t *prev_type = skip_typeref(previous_declaration->type);
3910 if (!types_compatible(type, prev_type)) {
3911 errorf(&declaration->source_position,
3912 "declaration '%#T' is incompatible with '%#T' (declared %P)",
3913 orig_type, symbol, previous_declaration->type, symbol,
3914 &previous_declaration->source_position);
3916 unsigned old_storage_class = previous_declaration->storage_class;
3917 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
3918 errorf(&declaration->source_position,
3919 "redeclaration of enum entry '%Y' (declared %P)",
3920 symbol, &previous_declaration->source_position);
3921 return previous_declaration;
3924 unsigned new_storage_class = declaration->storage_class;
3926 if (is_type_incomplete(prev_type)) {
3927 previous_declaration->type = type;
3931 /* pretend no storage class means extern for function
3932 * declarations (except if the previous declaration is neither
3933 * none nor extern) */
3934 if (is_type_function(type)) {
3935 if (prev_type->function.unspecified_parameters) {
3936 previous_declaration->type = type;
3940 switch (old_storage_class) {
3941 case STORAGE_CLASS_NONE:
3942 old_storage_class = STORAGE_CLASS_EXTERN;
3944 case STORAGE_CLASS_EXTERN:
3945 if (is_function_definition) {
3946 if (warning.missing_prototypes &&
3947 prev_type->function.unspecified_parameters &&
3948 !is_sym_main(symbol)) {
3949 warningf(&declaration->source_position,
3950 "no previous prototype for '%#T'",
3953 } else if (new_storage_class == STORAGE_CLASS_NONE) {
3954 new_storage_class = STORAGE_CLASS_EXTERN;
3963 if (old_storage_class == STORAGE_CLASS_EXTERN &&
3964 new_storage_class == STORAGE_CLASS_EXTERN) {
3965 warn_redundant_declaration:
3966 if (warning.redundant_decls && strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
3967 warningf(&declaration->source_position,
3968 "redundant declaration for '%Y' (declared %P)",
3969 symbol, &previous_declaration->source_position);
3971 } else if (current_function == NULL) {
3972 if (old_storage_class != STORAGE_CLASS_STATIC &&
3973 new_storage_class == STORAGE_CLASS_STATIC) {
3974 errorf(&declaration->source_position,
3975 "static declaration of '%Y' follows non-static declaration (declared %P)",
3976 symbol, &previous_declaration->source_position);
3977 } else if (old_storage_class != STORAGE_CLASS_EXTERN
3978 && !is_function_definition) {
3979 goto warn_redundant_declaration;
3980 } else if (new_storage_class == STORAGE_CLASS_NONE) {
3981 previous_declaration->storage_class = STORAGE_CLASS_NONE;
3982 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
3984 } else if (old_storage_class == new_storage_class) {
3985 errorf(&declaration->source_position,
3986 "redeclaration of '%Y' (declared %P)",
3987 symbol, &previous_declaration->source_position);
3989 errorf(&declaration->source_position,
3990 "redeclaration of '%Y' with different linkage (declared %P)",
3991 symbol, &previous_declaration->source_position);
3995 if (declaration->is_inline)
3996 previous_declaration->is_inline = true;
3997 return previous_declaration;
3998 } else if (is_function_definition) {
3999 if (declaration->storage_class != STORAGE_CLASS_STATIC) {
4000 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4001 warningf(&declaration->source_position,
4002 "no previous prototype for '%#T'", orig_type, symbol);
4003 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4004 warningf(&declaration->source_position,
4005 "no previous declaration for '%#T'", orig_type,
4009 } else if (warning.missing_declarations &&
4010 scope == global_scope &&
4011 !is_type_function(type) && (
4012 declaration->storage_class == STORAGE_CLASS_NONE ||
4013 declaration->storage_class == STORAGE_CLASS_THREAD
4015 warningf(&declaration->source_position,
4016 "no previous declaration for '%#T'", orig_type, symbol);
4019 assert(declaration->parent_scope == NULL);
4020 assert(scope != NULL);
4022 declaration->parent_scope = scope;
4024 environment_push(declaration);
4025 return append_declaration(declaration);
4028 static declaration_t *record_declaration(declaration_t *declaration)
4030 return internal_record_declaration(declaration, false);
4033 static declaration_t *record_function_definition(declaration_t *declaration)
4035 return internal_record_declaration(declaration, true);
4038 static void parser_error_multiple_definition(declaration_t *declaration,
4039 const source_position_t *source_position)
4041 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4042 declaration->symbol, &declaration->source_position);
4045 static bool is_declaration_specifier(const token_t *token,
4046 bool only_specifiers_qualifiers)
4048 switch(token->type) {
4053 return is_typedef_symbol(token->v.symbol);
4055 case T___extension__:
4057 return !only_specifiers_qualifiers;
4064 static void parse_init_declarator_rest(declaration_t *declaration)
4068 type_t *orig_type = declaration->type;
4069 type_t *type = skip_typeref(orig_type);
4071 if(declaration->init.initializer != NULL) {
4072 parser_error_multiple_definition(declaration, HERE);
4075 bool must_be_constant = false;
4076 if(declaration->storage_class == STORAGE_CLASS_STATIC
4077 || declaration->storage_class == STORAGE_CLASS_THREAD_STATIC
4078 || declaration->parent_scope == global_scope) {
4079 must_be_constant = true;
4082 parse_initializer_env_t env;
4083 env.type = orig_type;
4084 env.must_be_constant = must_be_constant;
4085 env.declaration = declaration;
4087 initializer_t *initializer = parse_initializer(&env);
4089 if(env.type != orig_type) {
4090 orig_type = env.type;
4091 type = skip_typeref(orig_type);
4092 declaration->type = env.type;
4095 if(is_type_function(type)) {
4096 errorf(&declaration->source_position,
4097 "initializers not allowed for function types at declator '%Y' (type '%T')",
4098 declaration->symbol, orig_type);
4100 declaration->init.initializer = initializer;
4104 /* parse rest of a declaration without any declarator */
4105 static void parse_anonymous_declaration_rest(
4106 const declaration_specifiers_t *specifiers,
4107 parsed_declaration_func finished_declaration)
4111 declaration_t *const declaration = allocate_declaration_zero();
4112 declaration->type = specifiers->type;
4113 declaration->declared_storage_class = specifiers->declared_storage_class;
4114 declaration->source_position = specifiers->source_position;
4115 declaration->modifiers = specifiers->modifiers;
4117 if (declaration->declared_storage_class != STORAGE_CLASS_NONE) {
4118 warningf(&declaration->source_position,
4119 "useless storage class in empty declaration");
4121 declaration->storage_class = STORAGE_CLASS_NONE;
4123 type_t *type = declaration->type;
4124 switch (type->kind) {
4125 case TYPE_COMPOUND_STRUCT:
4126 case TYPE_COMPOUND_UNION: {
4127 if (type->compound.declaration->symbol == NULL) {
4128 warningf(&declaration->source_position,
4129 "unnamed struct/union that defines no instances");
4138 warningf(&declaration->source_position, "empty declaration");
4142 finished_declaration(declaration);
4145 static void parse_declaration_rest(declaration_t *ndeclaration,
4146 const declaration_specifiers_t *specifiers,
4147 parsed_declaration_func finished_declaration)
4149 add_anchor_token(';');
4150 add_anchor_token('=');
4151 add_anchor_token(',');
4153 declaration_t *declaration = finished_declaration(ndeclaration);
4155 type_t *orig_type = declaration->type;
4156 type_t *type = skip_typeref(orig_type);
4158 if (type->kind != TYPE_FUNCTION &&
4159 declaration->is_inline &&
4160 is_type_valid(type)) {
4161 warningf(&declaration->source_position,
4162 "variable '%Y' declared 'inline'\n", declaration->symbol);
4165 if(token.type == '=') {
4166 parse_init_declarator_rest(declaration);
4169 if(token.type != ',')
4173 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4178 rem_anchor_token(';');
4179 rem_anchor_token('=');
4180 rem_anchor_token(',');
4183 static declaration_t *finished_kr_declaration(declaration_t *declaration)
4185 symbol_t *symbol = declaration->symbol;
4186 if(symbol == NULL) {
4187 errorf(HERE, "anonymous declaration not valid as function parameter");
4190 namespace_t namespc = (namespace_t) declaration->namespc;
4191 if(namespc != NAMESPACE_NORMAL) {
4192 return record_declaration(declaration);
4195 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4196 if(previous_declaration == NULL ||
4197 previous_declaration->parent_scope != scope) {
4198 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4203 if(previous_declaration->type == NULL) {
4204 previous_declaration->type = declaration->type;
4205 previous_declaration->declared_storage_class = declaration->declared_storage_class;
4206 previous_declaration->storage_class = declaration->storage_class;
4207 previous_declaration->parent_scope = scope;
4208 return previous_declaration;
4210 return record_declaration(declaration);
4214 static void parse_declaration(parsed_declaration_func finished_declaration)
4216 declaration_specifiers_t specifiers;
4217 memset(&specifiers, 0, sizeof(specifiers));
4218 parse_declaration_specifiers(&specifiers);
4220 if(token.type == ';') {
4221 parse_anonymous_declaration_rest(&specifiers, append_declaration);
4223 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4224 parse_declaration_rest(declaration, &specifiers, finished_declaration);
4228 static type_t *get_default_promoted_type(type_t *orig_type)
4230 type_t *result = orig_type;
4232 type_t *type = skip_typeref(orig_type);
4233 if(is_type_integer(type)) {
4234 result = promote_integer(type);
4235 } else if(type == type_float) {
4236 result = type_double;
4242 static void parse_kr_declaration_list(declaration_t *declaration)
4244 type_t *type = skip_typeref(declaration->type);
4245 if (!is_type_function(type))
4248 if (!type->function.kr_style_parameters)
4251 /* push function parameters */
4252 int top = environment_top();
4253 scope_t *last_scope = scope;
4254 set_scope(&declaration->scope);
4256 declaration_t *parameter = declaration->scope.declarations;
4257 for ( ; parameter != NULL; parameter = parameter->next) {
4258 assert(parameter->parent_scope == NULL);
4259 parameter->parent_scope = scope;
4260 environment_push(parameter);
4263 /* parse declaration list */
4264 while (is_declaration_specifier(&token, false)) {
4265 parse_declaration(finished_kr_declaration);
4268 /* pop function parameters */
4269 assert(scope == &declaration->scope);
4270 set_scope(last_scope);
4271 environment_pop_to(top);
4273 /* update function type */
4274 type_t *new_type = duplicate_type(type);
4276 function_parameter_t *parameters = NULL;
4277 function_parameter_t *last_parameter = NULL;
4279 declaration_t *parameter_declaration = declaration->scope.declarations;
4280 for( ; parameter_declaration != NULL;
4281 parameter_declaration = parameter_declaration->next) {
4282 type_t *parameter_type = parameter_declaration->type;
4283 if(parameter_type == NULL) {
4285 errorf(HERE, "no type specified for function parameter '%Y'",
4286 parameter_declaration->symbol);
4288 if (warning.implicit_int) {
4289 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4290 parameter_declaration->symbol);
4292 parameter_type = type_int;
4293 parameter_declaration->type = parameter_type;
4297 semantic_parameter(parameter_declaration);
4298 parameter_type = parameter_declaration->type;
4301 * we need the default promoted types for the function type
4303 parameter_type = get_default_promoted_type(parameter_type);
4305 function_parameter_t *function_parameter
4306 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
4307 memset(function_parameter, 0, sizeof(function_parameter[0]));
4309 function_parameter->type = parameter_type;
4310 if(last_parameter != NULL) {
4311 last_parameter->next = function_parameter;
4313 parameters = function_parameter;
4315 last_parameter = function_parameter;
4318 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
4320 new_type->function.parameters = parameters;
4321 new_type->function.unspecified_parameters = true;
4323 type = typehash_insert(new_type);
4324 if(type != new_type) {
4325 obstack_free(type_obst, new_type);
4328 declaration->type = type;
4331 static bool first_err = true;
4334 * When called with first_err set, prints the name of the current function,
4337 static void print_in_function(void) {
4340 diagnosticf("%s: In function '%Y':\n",
4341 current_function->source_position.input_name,
4342 current_function->symbol);
4347 * Check if all labels are defined in the current function.
4348 * Check if all labels are used in the current function.
4350 static void check_labels(void)
4352 for (const goto_statement_t *goto_statement = goto_first;
4353 goto_statement != NULL;
4354 goto_statement = goto_statement->next) {
4355 declaration_t *label = goto_statement->label;
4358 if (label->source_position.input_name == NULL) {
4359 print_in_function();
4360 errorf(&goto_statement->base.source_position,
4361 "label '%Y' used but not defined", label->symbol);
4364 goto_first = goto_last = NULL;
4366 if (warning.unused_label) {
4367 for (const label_statement_t *label_statement = label_first;
4368 label_statement != NULL;
4369 label_statement = label_statement->next) {
4370 const declaration_t *label = label_statement->label;
4372 if (! label->used) {
4373 print_in_function();
4374 warningf(&label_statement->base.source_position,
4375 "label '%Y' defined but not used", label->symbol);
4379 label_first = label_last = NULL;
4383 * Check declarations of current_function for unused entities.
4385 static void check_declarations(void)
4387 if (warning.unused_parameter) {
4388 const scope_t *scope = ¤t_function->scope;
4390 const declaration_t *parameter = scope->declarations;
4391 for (; parameter != NULL; parameter = parameter->next) {
4392 if (! parameter->used) {
4393 print_in_function();
4394 warningf(¶meter->source_position,
4395 "unused parameter '%Y'", parameter->symbol);
4399 if (warning.unused_variable) {
4403 static void parse_external_declaration(void)
4405 /* function-definitions and declarations both start with declaration
4407 declaration_specifiers_t specifiers;
4408 memset(&specifiers, 0, sizeof(specifiers));
4410 add_anchor_token(';');
4411 parse_declaration_specifiers(&specifiers);
4412 rem_anchor_token(';');
4414 /* must be a declaration */
4415 if(token.type == ';') {
4416 parse_anonymous_declaration_rest(&specifiers, append_declaration);
4420 add_anchor_token(',');
4421 add_anchor_token('=');
4422 rem_anchor_token(';');
4424 /* declarator is common to both function-definitions and declarations */
4425 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4427 rem_anchor_token(',');
4428 rem_anchor_token('=');
4429 rem_anchor_token(';');
4431 /* must be a declaration */
4432 if(token.type == ',' || token.type == '=' || token.type == ';') {
4433 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
4437 /* must be a function definition */
4438 parse_kr_declaration_list(ndeclaration);
4440 if(token.type != '{') {
4441 parse_error_expected("while parsing function definition", '{', NULL);
4442 eat_until_matching_token(';');
4446 type_t *type = ndeclaration->type;
4448 /* note that we don't skip typerefs: the standard doesn't allow them here
4449 * (so we can't use is_type_function here) */
4450 if(type->kind != TYPE_FUNCTION) {
4451 if (is_type_valid(type)) {
4452 errorf(HERE, "declarator '%#T' has a body but is not a function type",
4453 type, ndeclaration->symbol);
4459 /* § 6.7.5.3 (14) a function definition with () means no
4460 * parameters (and not unspecified parameters) */
4461 if(type->function.unspecified_parameters
4462 && type->function.parameters == NULL
4463 && !type->function.kr_style_parameters) {
4464 type_t *duplicate = duplicate_type(type);
4465 duplicate->function.unspecified_parameters = false;
4467 type = typehash_insert(duplicate);
4468 if(type != duplicate) {
4469 obstack_free(type_obst, duplicate);
4471 ndeclaration->type = type;
4474 declaration_t *const declaration = record_function_definition(ndeclaration);
4475 if(ndeclaration != declaration) {
4476 declaration->scope = ndeclaration->scope;
4478 type = skip_typeref(declaration->type);
4480 /* push function parameters and switch scope */
4481 int top = environment_top();
4482 scope_t *last_scope = scope;
4483 set_scope(&declaration->scope);
4485 declaration_t *parameter = declaration->scope.declarations;
4486 for( ; parameter != NULL; parameter = parameter->next) {
4487 if(parameter->parent_scope == &ndeclaration->scope) {
4488 parameter->parent_scope = scope;
4490 assert(parameter->parent_scope == NULL
4491 || parameter->parent_scope == scope);
4492 parameter->parent_scope = scope;
4493 environment_push(parameter);
4496 if(declaration->init.statement != NULL) {
4497 parser_error_multiple_definition(declaration, HERE);
4499 goto end_of_parse_external_declaration;
4501 /* parse function body */
4502 int label_stack_top = label_top();
4503 declaration_t *old_current_function = current_function;
4504 current_function = declaration;
4506 declaration->init.statement = parse_compound_statement(false);
4509 check_declarations();
4511 assert(current_function == declaration);
4512 current_function = old_current_function;
4513 label_pop_to(label_stack_top);
4516 end_of_parse_external_declaration:
4517 assert(scope == &declaration->scope);
4518 set_scope(last_scope);
4519 environment_pop_to(top);
4522 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
4523 source_position_t *source_position)
4525 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
4527 type->bitfield.base_type = base_type;
4528 type->bitfield.size = size;
4533 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
4536 declaration_t *iter = compound_declaration->scope.declarations;
4537 for( ; iter != NULL; iter = iter->next) {
4538 if(iter->namespc != NAMESPACE_NORMAL)
4541 if(iter->symbol == NULL) {
4542 type_t *type = skip_typeref(iter->type);
4543 if(is_type_compound(type)) {
4544 declaration_t *result
4545 = find_compound_entry(type->compound.declaration, symbol);
4552 if(iter->symbol == symbol) {
4560 static void parse_compound_declarators(declaration_t *struct_declaration,
4561 const declaration_specifiers_t *specifiers)
4563 declaration_t *last_declaration = struct_declaration->scope.declarations;
4564 if(last_declaration != NULL) {
4565 while(last_declaration->next != NULL) {
4566 last_declaration = last_declaration->next;
4571 declaration_t *declaration;
4573 if(token.type == ':') {
4574 source_position_t source_position = *HERE;
4577 type_t *base_type = specifiers->type;
4578 expression_t *size = parse_constant_expression();
4580 if(!is_type_integer(skip_typeref(base_type))) {
4581 errorf(HERE, "bitfield base type '%T' is not an integer type",
4585 type_t *type = make_bitfield_type(base_type, size, &source_position);
4587 declaration = allocate_declaration_zero();
4588 declaration->namespc = NAMESPACE_NORMAL;
4589 declaration->declared_storage_class = STORAGE_CLASS_NONE;
4590 declaration->storage_class = STORAGE_CLASS_NONE;
4591 declaration->source_position = source_position;
4592 declaration->modifiers = specifiers->modifiers;
4593 declaration->type = type;
4595 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
4597 type_t *orig_type = declaration->type;
4598 type_t *type = skip_typeref(orig_type);
4600 if(token.type == ':') {
4601 source_position_t source_position = *HERE;
4603 expression_t *size = parse_constant_expression();
4605 if(!is_type_integer(type)) {
4606 errorf(HERE, "bitfield base type '%T' is not an "
4607 "integer type", orig_type);
4610 type_t *bitfield_type = make_bitfield_type(orig_type, size, &source_position);
4611 declaration->type = bitfield_type;
4613 /* TODO we ignore arrays for now... what is missing is a check
4614 * that they're at the end of the struct */
4615 if(is_type_incomplete(type) && !is_type_array(type)) {
4617 "compound member '%Y' has incomplete type '%T'",
4618 declaration->symbol, orig_type);
4619 } else if(is_type_function(type)) {
4620 errorf(HERE, "compound member '%Y' must not have function "
4621 "type '%T'", declaration->symbol, orig_type);
4626 /* make sure we don't define a symbol multiple times */
4627 symbol_t *symbol = declaration->symbol;
4628 if(symbol != NULL) {
4629 declaration_t *prev_decl
4630 = find_compound_entry(struct_declaration, symbol);
4632 if(prev_decl != NULL) {
4633 assert(prev_decl->symbol == symbol);
4634 errorf(&declaration->source_position,
4635 "multiple declarations of symbol '%Y' (declared %P)",
4636 symbol, &prev_decl->source_position);
4640 /* append declaration */
4641 if(last_declaration != NULL) {
4642 last_declaration->next = declaration;
4644 struct_declaration->scope.declarations = declaration;
4646 last_declaration = declaration;
4648 if(token.type != ',')
4658 static void parse_compound_type_entries(declaration_t *compound_declaration)
4661 add_anchor_token('}');
4663 while(token.type != '}' && token.type != T_EOF) {
4664 declaration_specifiers_t specifiers;
4665 memset(&specifiers, 0, sizeof(specifiers));
4666 parse_declaration_specifiers(&specifiers);
4668 parse_compound_declarators(compound_declaration, &specifiers);
4670 rem_anchor_token('}');
4672 if(token.type == T_EOF) {
4673 errorf(HERE, "EOF while parsing struct");
4678 static type_t *parse_typename(void)
4680 declaration_specifiers_t specifiers;
4681 memset(&specifiers, 0, sizeof(specifiers));
4682 parse_declaration_specifiers(&specifiers);
4683 if(specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
4684 /* TODO: improve error message, user does probably not know what a
4685 * storage class is...
4687 errorf(HERE, "typename may not have a storage class");
4690 type_t *result = parse_abstract_declarator(specifiers.type);
4698 typedef expression_t* (*parse_expression_function) (unsigned precedence);
4699 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
4700 expression_t *left);
4702 typedef struct expression_parser_function_t expression_parser_function_t;
4703 struct expression_parser_function_t {
4704 unsigned precedence;
4705 parse_expression_function parser;
4706 unsigned infix_precedence;
4707 parse_expression_infix_function infix_parser;
4710 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
4713 * Prints an error message if an expression was expected but not read
4715 static expression_t *expected_expression_error(void)
4717 /* skip the error message if the error token was read */
4718 if (token.type != T_ERROR) {
4719 errorf(HERE, "expected expression, got token '%K'", &token);
4723 return create_invalid_expression();
4727 * Parse a string constant.
4729 static expression_t *parse_string_const(void)
4732 if (token.type == T_STRING_LITERAL) {
4733 string_t res = token.v.string;
4735 while (token.type == T_STRING_LITERAL) {
4736 res = concat_strings(&res, &token.v.string);
4739 if (token.type != T_WIDE_STRING_LITERAL) {
4740 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
4741 /* note: that we use type_char_ptr here, which is already the
4742 * automatic converted type. revert_automatic_type_conversion
4743 * will construct the array type */
4744 cnst->base.type = type_char_ptr;
4745 cnst->string.value = res;
4749 wres = concat_string_wide_string(&res, &token.v.wide_string);
4751 wres = token.v.wide_string;
4756 switch (token.type) {
4757 case T_WIDE_STRING_LITERAL:
4758 wres = concat_wide_strings(&wres, &token.v.wide_string);
4761 case T_STRING_LITERAL:
4762 wres = concat_wide_string_string(&wres, &token.v.string);
4766 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
4767 cnst->base.type = type_wchar_t_ptr;
4768 cnst->wide_string.value = wres;
4777 * Parse an integer constant.
4779 static expression_t *parse_int_const(void)
4781 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
4782 cnst->base.source_position = *HERE;
4783 cnst->base.type = token.datatype;
4784 cnst->conste.v.int_value = token.v.intvalue;
4792 * Parse a character constant.
4794 static expression_t *parse_character_constant(void)
4796 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
4798 cnst->base.source_position = *HERE;
4799 cnst->base.type = token.datatype;
4800 cnst->conste.v.character = token.v.string;
4802 if (cnst->conste.v.character.size != 1) {
4803 if (warning.multichar && (c_mode & _GNUC)) {
4805 warningf(HERE, "multi-character character constant");
4807 errorf(HERE, "more than 1 characters in character constant");
4816 * Parse a wide character constant.
4818 static expression_t *parse_wide_character_constant(void)
4820 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
4822 cnst->base.source_position = *HERE;
4823 cnst->base.type = token.datatype;
4824 cnst->conste.v.wide_character = token.v.wide_string;
4826 if (cnst->conste.v.wide_character.size != 1) {
4827 if (warning.multichar && (c_mode & _GNUC)) {
4829 warningf(HERE, "multi-character character constant");
4831 errorf(HERE, "more than 1 characters in character constant");
4840 * Parse a float constant.
4842 static expression_t *parse_float_const(void)
4844 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
4845 cnst->base.type = token.datatype;
4846 cnst->conste.v.float_value = token.v.floatvalue;
4853 static declaration_t *create_implicit_function(symbol_t *symbol,
4854 const source_position_t *source_position)
4856 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
4857 ntype->function.return_type = type_int;
4858 ntype->function.unspecified_parameters = true;
4860 type_t *type = typehash_insert(ntype);
4865 declaration_t *const declaration = allocate_declaration_zero();
4866 declaration->storage_class = STORAGE_CLASS_EXTERN;
4867 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
4868 declaration->type = type;
4869 declaration->symbol = symbol;
4870 declaration->source_position = *source_position;
4872 bool strict_prototypes_old = warning.strict_prototypes;
4873 warning.strict_prototypes = false;
4874 record_declaration(declaration);
4875 warning.strict_prototypes = strict_prototypes_old;
4881 * Creates a return_type (func)(argument_type) function type if not
4884 * @param return_type the return type
4885 * @param argument_type the argument type
4887 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
4889 function_parameter_t *parameter
4890 = obstack_alloc(type_obst, sizeof(parameter[0]));
4891 memset(parameter, 0, sizeof(parameter[0]));
4892 parameter->type = argument_type;
4894 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
4895 type->function.return_type = return_type;
4896 type->function.parameters = parameter;
4898 type_t *result = typehash_insert(type);
4899 if(result != type) {
4906 static type_t *make_function_0_type(type_t *return_type)
4908 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
4909 type->function.return_type = return_type;
4910 type->function.parameters = NULL;
4912 type_t *result = typehash_insert(type);
4913 if(result != type) {
4921 * Creates a function type for some function like builtins.
4923 * @param symbol the symbol describing the builtin
4925 static type_t *get_builtin_symbol_type(symbol_t *symbol)
4927 switch(symbol->ID) {
4928 case T___builtin_alloca:
4929 return make_function_1_type(type_void_ptr, type_size_t);
4930 case T___builtin_huge_val:
4931 return make_function_0_type(type_double);
4932 case T___builtin_nan:
4933 return make_function_1_type(type_double, type_char_ptr);
4934 case T___builtin_nanf:
4935 return make_function_1_type(type_float, type_char_ptr);
4936 case T___builtin_nand:
4937 return make_function_1_type(type_long_double, type_char_ptr);
4938 case T___builtin_va_end:
4939 return make_function_1_type(type_void, type_valist);
4941 internal_errorf(HERE, "not implemented builtin symbol found");
4946 * Performs automatic type cast as described in § 6.3.2.1.
4948 * @param orig_type the original type
4950 static type_t *automatic_type_conversion(type_t *orig_type)
4952 type_t *type = skip_typeref(orig_type);
4953 if(is_type_array(type)) {
4954 array_type_t *array_type = &type->array;
4955 type_t *element_type = array_type->element_type;
4956 unsigned qualifiers = array_type->base.qualifiers;
4958 return make_pointer_type(element_type, qualifiers);
4961 if(is_type_function(type)) {
4962 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
4969 * reverts the automatic casts of array to pointer types and function
4970 * to function-pointer types as defined § 6.3.2.1
4972 type_t *revert_automatic_type_conversion(const expression_t *expression)
4974 switch (expression->kind) {
4975 case EXPR_REFERENCE: return expression->reference.declaration->type;
4976 case EXPR_SELECT: return expression->select.compound_entry->type;
4978 case EXPR_UNARY_DEREFERENCE: {
4979 const expression_t *const value = expression->unary.value;
4980 type_t *const type = skip_typeref(value->base.type);
4981 assert(is_type_pointer(type));
4982 return type->pointer.points_to;
4985 case EXPR_BUILTIN_SYMBOL:
4986 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
4988 case EXPR_ARRAY_ACCESS: {
4989 const expression_t *array_ref = expression->array_access.array_ref;
4990 type_t *type_left = skip_typeref(array_ref->base.type);
4991 if (!is_type_valid(type_left))
4993 assert(is_type_pointer(type_left));
4994 return type_left->pointer.points_to;
4997 case EXPR_STRING_LITERAL: {
4998 size_t size = expression->string.value.size;
4999 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
5002 case EXPR_WIDE_STRING_LITERAL: {
5003 size_t size = expression->wide_string.value.size;
5004 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
5007 case EXPR_COMPOUND_LITERAL:
5008 return expression->compound_literal.type;
5013 return expression->base.type;
5016 static expression_t *parse_reference(void)
5018 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
5020 reference_expression_t *ref = &expression->reference;
5021 symbol_t *const symbol = token.v.symbol;
5023 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
5025 source_position_t source_position = token.source_position;
5028 if(declaration == NULL) {
5029 if (! strict_mode && token.type == '(') {
5030 /* an implicitly defined function */
5031 if (warning.implicit_function_declaration) {
5032 warningf(HERE, "implicit declaration of function '%Y'",
5036 declaration = create_implicit_function(symbol,
5039 errorf(HERE, "unknown symbol '%Y' found.", symbol);
5040 return create_invalid_expression();
5044 type_t *type = declaration->type;
5046 /* we always do the auto-type conversions; the & and sizeof parser contains
5047 * code to revert this! */
5048 type = automatic_type_conversion(type);
5050 ref->declaration = declaration;
5051 ref->base.type = type;
5053 /* this declaration is used */
5054 declaration->used = true;
5056 /* check for deprecated functions */
5057 if(declaration->deprecated != 0) {
5058 const char *prefix = "";
5059 if (is_type_function(declaration->type))
5060 prefix = "function ";
5062 if (declaration->deprecated_string != NULL) {
5063 warningf(&source_position,
5064 "%s'%Y' was declared 'deprecated(\"%s\")'", prefix, declaration->symbol,
5065 declaration->deprecated_string);
5067 warningf(&source_position,
5068 "%s'%Y' was declared 'deprecated'", prefix, declaration->symbol);
5075 static void check_cast_allowed(expression_t *expression, type_t *dest_type)
5079 /* TODO check if explicit cast is allowed and issue warnings/errors */
5082 static expression_t *parse_compound_literal(type_t *type)
5084 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
5086 parse_initializer_env_t env;
5088 env.declaration = NULL;
5089 env.must_be_constant = false;
5090 initializer_t *initializer = parse_initializer(&env);
5093 expression->compound_literal.initializer = initializer;
5094 expression->compound_literal.type = type;
5095 expression->base.type = automatic_type_conversion(type);
5101 * Parse a cast expression.
5103 static expression_t *parse_cast(void)
5105 source_position_t source_position = token.source_position;
5107 type_t *type = parse_typename();
5109 /* matching add_anchor_token() is at call site */
5110 rem_anchor_token(')');
5113 if(token.type == '{') {
5114 return parse_compound_literal(type);
5117 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
5118 cast->base.source_position = source_position;
5120 expression_t *value = parse_sub_expression(20);
5122 check_cast_allowed(value, type);
5124 cast->base.type = type;
5125 cast->unary.value = value;
5129 return create_invalid_expression();
5133 * Parse a statement expression.
5135 static expression_t *parse_statement_expression(void)
5137 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
5139 statement_t *statement = parse_compound_statement(true);
5140 expression->statement.statement = statement;
5141 expression->base.source_position = statement->base.source_position;
5143 /* find last statement and use its type */
5144 type_t *type = type_void;
5145 const statement_t *stmt = statement->compound.statements;
5147 while (stmt->base.next != NULL)
5148 stmt = stmt->base.next;
5150 if (stmt->kind == STATEMENT_EXPRESSION) {
5151 type = stmt->expression.expression->base.type;
5154 warningf(&expression->base.source_position, "empty statement expression ({})");
5156 expression->base.type = type;
5162 return create_invalid_expression();
5166 * Parse a braced expression.
5168 static expression_t *parse_brace_expression(void)
5171 add_anchor_token(')');
5173 switch(token.type) {
5175 /* gcc extension: a statement expression */
5176 return parse_statement_expression();
5180 return parse_cast();
5182 if(is_typedef_symbol(token.v.symbol)) {
5183 return parse_cast();
5187 expression_t *result = parse_expression();
5188 rem_anchor_token(')');
5193 return create_invalid_expression();
5196 static expression_t *parse_function_keyword(void)
5201 if (current_function == NULL) {
5202 errorf(HERE, "'__func__' used outside of a function");
5205 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5206 expression->base.type = type_char_ptr;
5207 expression->funcname.kind = FUNCNAME_FUNCTION;
5212 static expression_t *parse_pretty_function_keyword(void)
5214 eat(T___PRETTY_FUNCTION__);
5216 if (current_function == NULL) {
5217 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
5220 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5221 expression->base.type = type_char_ptr;
5222 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
5227 static expression_t *parse_funcsig_keyword(void)
5231 if (current_function == NULL) {
5232 errorf(HERE, "'__FUNCSIG__' used outside of a function");
5235 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5236 expression->base.type = type_char_ptr;
5237 expression->funcname.kind = FUNCNAME_FUNCSIG;
5242 static expression_t *parse_funcdname_keyword(void)
5244 eat(T___FUNCDNAME__);
5246 if (current_function == NULL) {
5247 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
5250 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
5251 expression->base.type = type_char_ptr;
5252 expression->funcname.kind = FUNCNAME_FUNCDNAME;
5257 static designator_t *parse_designator(void)
5259 designator_t *result = allocate_ast_zero(sizeof(result[0]));
5260 result->source_position = *HERE;
5262 if(token.type != T_IDENTIFIER) {
5263 parse_error_expected("while parsing member designator",
5264 T_IDENTIFIER, NULL);
5267 result->symbol = token.v.symbol;
5270 designator_t *last_designator = result;
5272 if(token.type == '.') {
5274 if(token.type != T_IDENTIFIER) {
5275 parse_error_expected("while parsing member designator",
5276 T_IDENTIFIER, NULL);
5279 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
5280 designator->source_position = *HERE;
5281 designator->symbol = token.v.symbol;
5284 last_designator->next = designator;
5285 last_designator = designator;
5288 if(token.type == '[') {
5290 add_anchor_token(']');
5291 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
5292 designator->source_position = *HERE;
5293 designator->array_index = parse_expression();
5294 rem_anchor_token(']');
5296 if(designator->array_index == NULL) {
5300 last_designator->next = designator;
5301 last_designator = designator;
5313 * Parse the __builtin_offsetof() expression.
5315 static expression_t *parse_offsetof(void)
5317 eat(T___builtin_offsetof);
5319 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
5320 expression->base.type = type_size_t;
5323 add_anchor_token(',');
5324 type_t *type = parse_typename();
5325 rem_anchor_token(',');
5327 add_anchor_token(')');
5328 designator_t *designator = parse_designator();
5329 rem_anchor_token(')');
5332 expression->offsetofe.type = type;
5333 expression->offsetofe.designator = designator;
5336 memset(&path, 0, sizeof(path));
5337 path.top_type = type;
5338 path.path = NEW_ARR_F(type_path_entry_t, 0);
5340 descend_into_subtype(&path);
5342 if(!walk_designator(&path, designator, true)) {
5343 return create_invalid_expression();
5346 DEL_ARR_F(path.path);
5350 return create_invalid_expression();
5354 * Parses a _builtin_va_start() expression.
5356 static expression_t *parse_va_start(void)
5358 eat(T___builtin_va_start);
5360 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
5363 add_anchor_token(',');
5364 expression->va_starte.ap = parse_assignment_expression();
5365 rem_anchor_token(',');
5367 expression_t *const expr = parse_assignment_expression();
5368 if (expr->kind == EXPR_REFERENCE) {
5369 declaration_t *const decl = expr->reference.declaration;
5371 return create_invalid_expression();
5372 if (decl->parent_scope == ¤t_function->scope &&
5373 decl->next == NULL) {
5374 expression->va_starte.parameter = decl;
5379 errorf(&expr->base.source_position,
5380 "second argument of 'va_start' must be last parameter of the current function");
5382 return create_invalid_expression();
5386 * Parses a _builtin_va_arg() expression.
5388 static expression_t *parse_va_arg(void)
5390 eat(T___builtin_va_arg);
5392 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
5395 expression->va_arge.ap = parse_assignment_expression();
5397 expression->base.type = parse_typename();
5402 return create_invalid_expression();
5405 static expression_t *parse_builtin_symbol(void)
5407 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
5409 symbol_t *symbol = token.v.symbol;
5411 expression->builtin_symbol.symbol = symbol;
5414 type_t *type = get_builtin_symbol_type(symbol);
5415 type = automatic_type_conversion(type);
5417 expression->base.type = type;
5422 * Parses a __builtin_constant() expression.
5424 static expression_t *parse_builtin_constant(void)
5426 eat(T___builtin_constant_p);
5428 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
5431 add_anchor_token(')');
5432 expression->builtin_constant.value = parse_assignment_expression();
5433 rem_anchor_token(')');
5435 expression->base.type = type_int;
5439 return create_invalid_expression();
5443 * Parses a __builtin_prefetch() expression.
5445 static expression_t *parse_builtin_prefetch(void)
5447 eat(T___builtin_prefetch);
5449 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
5452 add_anchor_token(')');
5453 expression->builtin_prefetch.adr = parse_assignment_expression();
5454 if (token.type == ',') {
5456 expression->builtin_prefetch.rw = parse_assignment_expression();
5458 if (token.type == ',') {
5460 expression->builtin_prefetch.locality = parse_assignment_expression();
5462 rem_anchor_token(')');
5464 expression->base.type = type_void;
5468 return create_invalid_expression();
5472 * Parses a __builtin_is_*() compare expression.
5474 static expression_t *parse_compare_builtin(void)
5476 expression_t *expression;
5478 switch(token.type) {
5479 case T___builtin_isgreater:
5480 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
5482 case T___builtin_isgreaterequal:
5483 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
5485 case T___builtin_isless:
5486 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
5488 case T___builtin_islessequal:
5489 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
5491 case T___builtin_islessgreater:
5492 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
5494 case T___builtin_isunordered:
5495 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
5498 internal_errorf(HERE, "invalid compare builtin found");
5501 expression->base.source_position = *HERE;
5505 expression->binary.left = parse_assignment_expression();
5507 expression->binary.right = parse_assignment_expression();
5510 type_t *const orig_type_left = expression->binary.left->base.type;
5511 type_t *const orig_type_right = expression->binary.right->base.type;
5513 type_t *const type_left = skip_typeref(orig_type_left);
5514 type_t *const type_right = skip_typeref(orig_type_right);
5515 if(!is_type_float(type_left) && !is_type_float(type_right)) {
5516 if (is_type_valid(type_left) && is_type_valid(type_right)) {
5517 type_error_incompatible("invalid operands in comparison",
5518 &expression->base.source_position, orig_type_left, orig_type_right);
5521 semantic_comparison(&expression->binary);
5526 return create_invalid_expression();
5530 * Parses a __builtin_expect() expression.
5532 static expression_t *parse_builtin_expect(void)
5534 eat(T___builtin_expect);
5536 expression_t *expression
5537 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
5540 expression->binary.left = parse_assignment_expression();
5542 expression->binary.right = parse_constant_expression();
5545 expression->base.type = expression->binary.left->base.type;
5549 return create_invalid_expression();
5553 * Parses a MS assume() expression.
5555 static expression_t *parse_assume(void) {
5558 expression_t *expression
5559 = allocate_expression_zero(EXPR_UNARY_ASSUME);
5562 add_anchor_token(')');
5563 expression->unary.value = parse_assignment_expression();
5564 rem_anchor_token(')');
5567 expression->base.type = type_void;
5570 return create_invalid_expression();
5574 * Parse a microsoft __noop expression.
5576 static expression_t *parse_noop_expression(void) {
5577 source_position_t source_position = *HERE;
5580 if (token.type == '(') {
5581 /* parse arguments */
5583 add_anchor_token(')');
5584 add_anchor_token(',');
5586 if(token.type != ')') {
5588 (void)parse_assignment_expression();
5589 if(token.type != ',')
5595 rem_anchor_token(',');
5596 rem_anchor_token(')');
5599 /* the result is a (int)0 */
5600 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5601 cnst->base.source_position = source_position;
5602 cnst->base.type = type_int;
5603 cnst->conste.v.int_value = 0;
5604 cnst->conste.is_ms_noop = true;
5609 return create_invalid_expression();
5613 * Parses a primary expression.
5615 static expression_t *parse_primary_expression(void)
5617 switch (token.type) {
5618 case T_INTEGER: return parse_int_const();
5619 case T_CHARACTER_CONSTANT: return parse_character_constant();
5620 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
5621 case T_FLOATINGPOINT: return parse_float_const();
5622 case T_STRING_LITERAL:
5623 case T_WIDE_STRING_LITERAL: return parse_string_const();
5624 case T_IDENTIFIER: return parse_reference();
5625 case T___FUNCTION__:
5626 case T___func__: return parse_function_keyword();
5627 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
5628 case T___FUNCSIG__: return parse_funcsig_keyword();
5629 case T___FUNCDNAME__: return parse_funcdname_keyword();
5630 case T___builtin_offsetof: return parse_offsetof();
5631 case T___builtin_va_start: return parse_va_start();
5632 case T___builtin_va_arg: return parse_va_arg();
5633 case T___builtin_expect: return parse_builtin_expect();
5634 case T___builtin_alloca:
5635 case T___builtin_nan:
5636 case T___builtin_nand:
5637 case T___builtin_nanf:
5638 case T___builtin_huge_val:
5639 case T___builtin_va_end: return parse_builtin_symbol();
5640 case T___builtin_isgreater:
5641 case T___builtin_isgreaterequal:
5642 case T___builtin_isless:
5643 case T___builtin_islessequal:
5644 case T___builtin_islessgreater:
5645 case T___builtin_isunordered: return parse_compare_builtin();
5646 case T___builtin_constant_p: return parse_builtin_constant();
5647 case T___builtin_prefetch: return parse_builtin_prefetch();
5648 case T__assume: return parse_assume();
5650 case '(': return parse_brace_expression();
5651 case T___noop: return parse_noop_expression();
5654 errorf(HERE, "unexpected token %K, expected an expression", &token);
5655 return create_invalid_expression();
5659 * Check if the expression has the character type and issue a warning then.
5661 static void check_for_char_index_type(const expression_t *expression) {
5662 type_t *const type = expression->base.type;
5663 const type_t *const base_type = skip_typeref(type);
5665 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
5666 warning.char_subscripts) {
5667 warningf(&expression->base.source_position,
5668 "array subscript has type '%T'", type);
5672 static expression_t *parse_array_expression(unsigned precedence,
5678 add_anchor_token(']');
5680 expression_t *inside = parse_expression();
5682 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
5684 array_access_expression_t *array_access = &expression->array_access;
5686 type_t *const orig_type_left = left->base.type;
5687 type_t *const orig_type_inside = inside->base.type;
5689 type_t *const type_left = skip_typeref(orig_type_left);
5690 type_t *const type_inside = skip_typeref(orig_type_inside);
5692 type_t *return_type;
5693 if (is_type_pointer(type_left)) {
5694 return_type = type_left->pointer.points_to;
5695 array_access->array_ref = left;
5696 array_access->index = inside;
5697 check_for_char_index_type(inside);
5698 } else if (is_type_pointer(type_inside)) {
5699 return_type = type_inside->pointer.points_to;
5700 array_access->array_ref = inside;
5701 array_access->index = left;
5702 array_access->flipped = true;
5703 check_for_char_index_type(left);
5705 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
5707 "array access on object with non-pointer types '%T', '%T'",
5708 orig_type_left, orig_type_inside);
5710 return_type = type_error_type;
5711 array_access->array_ref = create_invalid_expression();
5714 rem_anchor_token(']');
5715 if(token.type != ']') {
5716 parse_error_expected("Problem while parsing array access", ']', NULL);
5721 return_type = automatic_type_conversion(return_type);
5722 expression->base.type = return_type;
5727 static expression_t *parse_typeprop(expression_kind_t const kind,
5728 source_position_t const pos,
5729 unsigned const precedence)
5731 expression_t *tp_expression = allocate_expression_zero(kind);
5732 tp_expression->base.type = type_size_t;
5733 tp_expression->base.source_position = pos;
5735 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
5737 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
5739 add_anchor_token(')');
5740 type_t* const orig_type = parse_typename();
5741 tp_expression->typeprop.type = orig_type;
5743 type_t const* const type = skip_typeref(orig_type);
5744 char const* const wrong_type =
5745 is_type_incomplete(type) ? "incomplete" :
5746 type->kind == TYPE_FUNCTION ? "function designator" :
5747 type->kind == TYPE_BITFIELD ? "bitfield" :
5749 if (wrong_type != NULL) {
5750 errorf(&pos, "operand of %s expression must not be %s type '%T'",
5751 what, wrong_type, type);
5754 rem_anchor_token(')');
5757 expression_t *expression = parse_sub_expression(precedence);
5759 type_t* const orig_type = revert_automatic_type_conversion(expression);
5760 expression->base.type = orig_type;
5762 type_t const* const type = skip_typeref(orig_type);
5763 char const* const wrong_type =
5764 is_type_incomplete(type) ? "incomplete" :
5765 type->kind == TYPE_FUNCTION ? "function designator" :
5766 type->kind == TYPE_BITFIELD ? "bitfield" :
5768 if (wrong_type != NULL) {
5769 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
5772 tp_expression->typeprop.type = expression->base.type;
5773 tp_expression->typeprop.tp_expression = expression;
5776 return tp_expression;
5778 return create_invalid_expression();
5781 static expression_t *parse_sizeof(unsigned precedence)
5783 source_position_t pos = *HERE;
5785 return parse_typeprop(EXPR_SIZEOF, pos, precedence);
5788 static expression_t *parse_alignof(unsigned precedence)
5790 source_position_t pos = *HERE;
5792 return parse_typeprop(EXPR_ALIGNOF, pos, precedence);
5795 static expression_t *parse_select_expression(unsigned precedence,
5796 expression_t *compound)
5799 assert(token.type == '.' || token.type == T_MINUSGREATER);
5801 bool is_pointer = (token.type == T_MINUSGREATER);
5804 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5805 select->select.compound = compound;
5807 if (token.type != T_IDENTIFIER) {
5808 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
5811 symbol_t *symbol = token.v.symbol;
5812 select->select.symbol = symbol;
5815 type_t *const orig_type = compound->base.type;
5816 type_t *const type = skip_typeref(orig_type);
5818 type_t *type_left = type;
5820 if (!is_type_pointer(type)) {
5821 if (is_type_valid(type)) {
5822 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
5824 return create_invalid_expression();
5826 type_left = type->pointer.points_to;
5828 type_left = skip_typeref(type_left);
5830 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
5831 type_left->kind != TYPE_COMPOUND_UNION) {
5832 if (is_type_valid(type_left)) {
5833 errorf(HERE, "request for member '%Y' in something not a struct or "
5834 "union, but '%T'", symbol, type_left);
5836 return create_invalid_expression();
5839 declaration_t *const declaration = type_left->compound.declaration;
5841 if (!declaration->init.complete) {
5842 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
5844 return create_invalid_expression();
5847 declaration_t *iter = find_compound_entry(declaration, symbol);
5849 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
5850 return create_invalid_expression();
5853 /* we always do the auto-type conversions; the & and sizeof parser contains
5854 * code to revert this! */
5855 type_t *expression_type = automatic_type_conversion(iter->type);
5857 select->select.compound_entry = iter;
5858 select->base.type = expression_type;
5860 type_t *skipped = skip_typeref(iter->type);
5861 if (skipped->kind == TYPE_BITFIELD) {
5862 select->base.type = skipped->bitfield.base_type;
5869 * Parse a call expression, ie. expression '( ... )'.
5871 * @param expression the function address
5873 static expression_t *parse_call_expression(unsigned precedence,
5874 expression_t *expression)
5877 expression_t *result = allocate_expression_zero(EXPR_CALL);
5878 result->base.source_position = expression->base.source_position;
5880 call_expression_t *call = &result->call;
5881 call->function = expression;
5883 type_t *const orig_type = expression->base.type;
5884 type_t *const type = skip_typeref(orig_type);
5886 function_type_t *function_type = NULL;
5887 if (is_type_pointer(type)) {
5888 type_t *const to_type = skip_typeref(type->pointer.points_to);
5890 if (is_type_function(to_type)) {
5891 function_type = &to_type->function;
5892 call->base.type = function_type->return_type;
5896 if (function_type == NULL && is_type_valid(type)) {
5897 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
5900 /* parse arguments */
5902 add_anchor_token(')');
5903 add_anchor_token(',');
5905 if(token.type != ')') {
5906 call_argument_t *last_argument = NULL;
5909 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
5911 argument->expression = parse_assignment_expression();
5912 if(last_argument == NULL) {
5913 call->arguments = argument;
5915 last_argument->next = argument;
5917 last_argument = argument;
5919 if(token.type != ',')
5924 rem_anchor_token(',');
5925 rem_anchor_token(')');
5928 if(function_type == NULL)
5931 function_parameter_t *parameter = function_type->parameters;
5932 call_argument_t *argument = call->arguments;
5933 if (!function_type->unspecified_parameters) {
5934 for( ; parameter != NULL && argument != NULL;
5935 parameter = parameter->next, argument = argument->next) {
5936 type_t *expected_type = parameter->type;
5937 /* TODO report scope in error messages */
5938 expression_t *const arg_expr = argument->expression;
5939 type_t *const res_type = semantic_assign(expected_type, arg_expr,
5941 &arg_expr->base.source_position);
5942 if (res_type == NULL) {
5943 /* TODO improve error message */
5944 errorf(&arg_expr->base.source_position,
5945 "Cannot call function with argument '%E' of type '%T' where type '%T' is expected",
5946 arg_expr, arg_expr->base.type, expected_type);
5948 argument->expression = create_implicit_cast(argument->expression, expected_type);
5952 if (parameter != NULL) {
5953 errorf(HERE, "too few arguments to function '%E'", expression);
5954 } else if (argument != NULL && !function_type->variadic) {
5955 errorf(HERE, "too many arguments to function '%E'", expression);
5959 /* do default promotion */
5960 for( ; argument != NULL; argument = argument->next) {
5961 type_t *type = argument->expression->base.type;
5963 type = get_default_promoted_type(type);
5965 argument->expression
5966 = create_implicit_cast(argument->expression, type);
5969 check_format(&result->call);
5973 return create_invalid_expression();
5976 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
5978 static bool same_compound_type(const type_t *type1, const type_t *type2)
5981 is_type_compound(type1) &&
5982 type1->kind == type2->kind &&
5983 type1->compound.declaration == type2->compound.declaration;
5987 * Parse a conditional expression, ie. 'expression ? ... : ...'.
5989 * @param expression the conditional expression
5991 static expression_t *parse_conditional_expression(unsigned precedence,
5992 expression_t *expression)
5995 add_anchor_token(':');
5997 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
5999 conditional_expression_t *conditional = &result->conditional;
6000 conditional->condition = expression;
6003 type_t *const condition_type_orig = expression->base.type;
6004 type_t *const condition_type = skip_typeref(condition_type_orig);
6005 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
6006 type_error("expected a scalar type in conditional condition",
6007 &expression->base.source_position, condition_type_orig);
6010 expression_t *true_expression = parse_expression();
6011 rem_anchor_token(':');
6013 expression_t *false_expression = parse_sub_expression(precedence);
6015 type_t *const orig_true_type = true_expression->base.type;
6016 type_t *const orig_false_type = false_expression->base.type;
6017 type_t *const true_type = skip_typeref(orig_true_type);
6018 type_t *const false_type = skip_typeref(orig_false_type);
6021 type_t *result_type;
6022 if(is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
6023 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
6024 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID)
6025 || !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
6026 warningf(&expression->base.source_position,
6027 "ISO C forbids conditional expression with only one void side");
6029 result_type = type_void;
6030 } else if (is_type_arithmetic(true_type)
6031 && is_type_arithmetic(false_type)) {
6032 result_type = semantic_arithmetic(true_type, false_type);
6034 true_expression = create_implicit_cast(true_expression, result_type);
6035 false_expression = create_implicit_cast(false_expression, result_type);
6037 conditional->true_expression = true_expression;
6038 conditional->false_expression = false_expression;
6039 conditional->base.type = result_type;
6040 } else if (same_compound_type(true_type, false_type)) {
6041 /* just take 1 of the 2 types */
6042 result_type = true_type;
6043 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
6044 type_t *pointer_type;
6046 expression_t *other_expression;
6047 if (is_type_pointer(true_type)) {
6048 pointer_type = true_type;
6049 other_type = false_type;
6050 other_expression = false_expression;
6052 pointer_type = false_type;
6053 other_type = true_type;
6054 other_expression = true_expression;
6057 if(is_type_pointer(other_type)) {
6058 if(!pointers_compatible(true_type, false_type)) {
6059 warningf(&expression->base.source_position,
6060 "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
6062 result_type = true_type;
6063 } else if(is_null_pointer_constant(other_expression)) {
6064 result_type = pointer_type;
6065 } else if(is_type_integer(other_type)) {
6066 warningf(&expression->base.source_position,
6067 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
6068 result_type = pointer_type;
6070 type_error_incompatible("while parsing conditional",
6071 &expression->base.source_position, true_type, false_type);
6072 result_type = type_error_type;
6075 /* TODO: one pointer to void*, other some pointer */
6077 if (is_type_valid(true_type) && is_type_valid(false_type)) {
6078 type_error_incompatible("while parsing conditional",
6079 &expression->base.source_position, true_type,
6082 result_type = type_error_type;
6085 conditional->true_expression
6086 = create_implicit_cast(true_expression, result_type);
6087 conditional->false_expression
6088 = create_implicit_cast(false_expression, result_type);
6089 conditional->base.type = result_type;
6092 return create_invalid_expression();
6096 * Parse an extension expression.
6098 static expression_t *parse_extension(unsigned precedence)
6100 eat(T___extension__);
6102 /* TODO enable extensions */
6103 expression_t *expression = parse_sub_expression(precedence);
6104 /* TODO disable extensions */
6109 * Parse a __builtin_classify_type() expression.
6111 static expression_t *parse_builtin_classify_type(const unsigned precedence)
6113 eat(T___builtin_classify_type);
6115 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
6116 result->base.type = type_int;
6119 add_anchor_token(')');
6120 expression_t *expression = parse_sub_expression(precedence);
6121 rem_anchor_token(')');
6123 result->classify_type.type_expression = expression;
6127 return create_invalid_expression();
6130 static void check_pointer_arithmetic(const source_position_t *source_position,
6131 type_t *pointer_type,
6132 type_t *orig_pointer_type)
6134 type_t *points_to = pointer_type->pointer.points_to;
6135 points_to = skip_typeref(points_to);
6137 if (is_type_incomplete(points_to) &&
6139 || !is_type_atomic(points_to, ATOMIC_TYPE_VOID))) {
6140 errorf(source_position,
6141 "arithmetic with pointer to incomplete type '%T' not allowed",
6143 } else if (is_type_function(points_to)) {
6144 errorf(source_position,
6145 "arithmetic with pointer to function type '%T' not allowed",
6150 static void semantic_incdec(unary_expression_t *expression)
6152 type_t *const orig_type = expression->value->base.type;
6153 type_t *const type = skip_typeref(orig_type);
6154 if (is_type_pointer(type)) {
6155 check_pointer_arithmetic(&expression->base.source_position,
6157 } else if (!is_type_real(type) && is_type_valid(type)) {
6158 /* TODO: improve error message */
6159 errorf(HERE, "operation needs an arithmetic or pointer type");
6161 expression->base.type = orig_type;
6164 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
6166 type_t *const orig_type = expression->value->base.type;
6167 type_t *const type = skip_typeref(orig_type);
6168 if(!is_type_arithmetic(type)) {
6169 if (is_type_valid(type)) {
6170 /* TODO: improve error message */
6171 errorf(HERE, "operation needs an arithmetic type");
6176 expression->base.type = orig_type;
6179 static void semantic_unexpr_scalar(unary_expression_t *expression)
6181 type_t *const orig_type = expression->value->base.type;
6182 type_t *const type = skip_typeref(orig_type);
6183 if (!is_type_scalar(type)) {
6184 if (is_type_valid(type)) {
6185 errorf(HERE, "operand of ! must be of scalar type");
6190 expression->base.type = orig_type;
6193 static void semantic_unexpr_integer(unary_expression_t *expression)
6195 type_t *const orig_type = expression->value->base.type;
6196 type_t *const type = skip_typeref(orig_type);
6197 if (!is_type_integer(type)) {
6198 if (is_type_valid(type)) {
6199 errorf(HERE, "operand of ~ must be of integer type");
6204 expression->base.type = orig_type;
6207 static void semantic_dereference(unary_expression_t *expression)
6209 type_t *const orig_type = expression->value->base.type;
6210 type_t *const type = skip_typeref(orig_type);
6211 if(!is_type_pointer(type)) {
6212 if (is_type_valid(type)) {
6213 errorf(HERE, "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
6218 type_t *result_type = type->pointer.points_to;
6219 result_type = automatic_type_conversion(result_type);
6220 expression->base.type = result_type;
6224 * Check the semantic of the address taken expression.
6226 static void semantic_take_addr(unary_expression_t *expression)
6228 expression_t *value = expression->value;
6229 value->base.type = revert_automatic_type_conversion(value);
6231 type_t *orig_type = value->base.type;
6232 if(!is_type_valid(orig_type))
6235 if(value->kind == EXPR_REFERENCE) {
6236 declaration_t *const declaration = value->reference.declaration;
6237 if(declaration != NULL) {
6238 if (declaration->storage_class == STORAGE_CLASS_REGISTER) {
6239 errorf(&expression->base.source_position,
6240 "address of register variable '%Y' requested",
6241 declaration->symbol);
6243 declaration->address_taken = 1;
6247 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6250 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
6251 static expression_t *parse_##unexpression_type(unsigned precedence) \
6255 expression_t *unary_expression \
6256 = allocate_expression_zero(unexpression_type); \
6257 unary_expression->base.source_position = *HERE; \
6258 unary_expression->unary.value = parse_sub_expression(precedence); \
6260 sfunc(&unary_expression->unary); \
6262 return unary_expression; \
6265 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
6266 semantic_unexpr_arithmetic)
6267 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
6268 semantic_unexpr_arithmetic)
6269 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
6270 semantic_unexpr_scalar)
6271 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
6272 semantic_dereference)
6273 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
6275 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
6276 semantic_unexpr_integer)
6277 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
6279 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
6282 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
6284 static expression_t *parse_##unexpression_type(unsigned precedence, \
6285 expression_t *left) \
6287 (void) precedence; \
6290 expression_t *unary_expression \
6291 = allocate_expression_zero(unexpression_type); \
6292 unary_expression->unary.value = left; \
6294 sfunc(&unary_expression->unary); \
6296 return unary_expression; \
6299 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
6300 EXPR_UNARY_POSTFIX_INCREMENT,
6302 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
6303 EXPR_UNARY_POSTFIX_DECREMENT,
6306 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
6308 /* TODO: handle complex + imaginary types */
6310 /* § 6.3.1.8 Usual arithmetic conversions */
6311 if(type_left == type_long_double || type_right == type_long_double) {
6312 return type_long_double;
6313 } else if(type_left == type_double || type_right == type_double) {
6315 } else if(type_left == type_float || type_right == type_float) {
6319 type_right = promote_integer(type_right);
6320 type_left = promote_integer(type_left);
6322 if(type_left == type_right)
6325 bool signed_left = is_type_signed(type_left);
6326 bool signed_right = is_type_signed(type_right);
6327 int rank_left = get_rank(type_left);
6328 int rank_right = get_rank(type_right);
6329 if(rank_left < rank_right) {
6330 if(signed_left == signed_right || !signed_right) {
6336 if(signed_left == signed_right || !signed_left) {
6345 * Check the semantic restrictions for a binary expression.
6347 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
6349 expression_t *const left = expression->left;
6350 expression_t *const right = expression->right;
6351 type_t *const orig_type_left = left->base.type;
6352 type_t *const orig_type_right = right->base.type;
6353 type_t *const type_left = skip_typeref(orig_type_left);
6354 type_t *const type_right = skip_typeref(orig_type_right);
6356 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
6357 /* TODO: improve error message */
6358 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6359 errorf(HERE, "operation needs arithmetic types");
6364 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6365 expression->left = create_implicit_cast(left, arithmetic_type);
6366 expression->right = create_implicit_cast(right, arithmetic_type);
6367 expression->base.type = arithmetic_type;
6370 static void semantic_shift_op(binary_expression_t *expression)
6372 expression_t *const left = expression->left;
6373 expression_t *const right = expression->right;
6374 type_t *const orig_type_left = left->base.type;
6375 type_t *const 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 if(!is_type_integer(type_left) || !is_type_integer(type_right)) {
6380 /* TODO: improve error message */
6381 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6382 errorf(HERE, "operation needs integer types");
6387 type_left = promote_integer(type_left);
6388 type_right = promote_integer(type_right);
6390 expression->left = create_implicit_cast(left, type_left);
6391 expression->right = create_implicit_cast(right, type_right);
6392 expression->base.type = type_left;
6395 static void semantic_add(binary_expression_t *expression)
6397 expression_t *const left = expression->left;
6398 expression_t *const right = expression->right;
6399 type_t *const orig_type_left = left->base.type;
6400 type_t *const orig_type_right = right->base.type;
6401 type_t *const type_left = skip_typeref(orig_type_left);
6402 type_t *const type_right = skip_typeref(orig_type_right);
6405 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
6406 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6407 expression->left = create_implicit_cast(left, arithmetic_type);
6408 expression->right = create_implicit_cast(right, arithmetic_type);
6409 expression->base.type = arithmetic_type;
6411 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
6412 check_pointer_arithmetic(&expression->base.source_position,
6413 type_left, orig_type_left);
6414 expression->base.type = type_left;
6415 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
6416 check_pointer_arithmetic(&expression->base.source_position,
6417 type_right, orig_type_right);
6418 expression->base.type = type_right;
6419 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
6420 errorf(&expression->base.source_position,
6421 "invalid operands to binary + ('%T', '%T')",
6422 orig_type_left, orig_type_right);
6426 static void semantic_sub(binary_expression_t *expression)
6428 expression_t *const left = expression->left;
6429 expression_t *const right = expression->right;
6430 type_t *const orig_type_left = left->base.type;
6431 type_t *const orig_type_right = right->base.type;
6432 type_t *const type_left = skip_typeref(orig_type_left);
6433 type_t *const type_right = skip_typeref(orig_type_right);
6436 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
6437 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6438 expression->left = create_implicit_cast(left, arithmetic_type);
6439 expression->right = create_implicit_cast(right, arithmetic_type);
6440 expression->base.type = arithmetic_type;
6442 } else if(is_type_pointer(type_left) && is_type_integer(type_right)) {
6443 check_pointer_arithmetic(&expression->base.source_position,
6444 type_left, orig_type_left);
6445 expression->base.type = type_left;
6446 } else if(is_type_pointer(type_left) && is_type_pointer(type_right)) {
6447 if(!pointers_compatible(type_left, type_right)) {
6449 "pointers to incompatible objects to binary '-' ('%T', '%T')",
6450 orig_type_left, orig_type_right);
6452 expression->base.type = type_ptrdiff_t;
6454 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
6455 errorf(HERE, "invalid operands to binary '-' ('%T', '%T')",
6456 orig_type_left, orig_type_right);
6461 * Check the semantics of comparison expressions.
6463 * @param expression The expression to check.
6465 static void semantic_comparison(binary_expression_t *expression)
6467 expression_t *left = expression->left;
6468 expression_t *right = expression->right;
6469 type_t *orig_type_left = left->base.type;
6470 type_t *orig_type_right = right->base.type;
6472 type_t *type_left = skip_typeref(orig_type_left);
6473 type_t *type_right = skip_typeref(orig_type_right);
6475 /* TODO non-arithmetic types */
6476 if(is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
6477 /* test for signed vs unsigned compares */
6478 if (warning.sign_compare &&
6479 (expression->base.kind != EXPR_BINARY_EQUAL &&
6480 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
6481 (is_type_signed(type_left) != is_type_signed(type_right))) {
6483 /* check if 1 of the operands is a constant, in this case we just
6484 * check wether we can safely represent the resulting constant in
6485 * the type of the other operand. */
6486 expression_t *const_expr = NULL;
6487 expression_t *other_expr = NULL;
6489 if(is_constant_expression(left)) {
6492 } else if(is_constant_expression(right)) {
6497 if(const_expr != NULL) {
6498 type_t *other_type = skip_typeref(other_expr->base.type);
6499 long val = fold_constant(const_expr);
6500 /* TODO: check if val can be represented by other_type */
6504 warningf(&expression->base.source_position,
6505 "comparison between signed and unsigned");
6507 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6508 expression->left = create_implicit_cast(left, arithmetic_type);
6509 expression->right = create_implicit_cast(right, arithmetic_type);
6510 expression->base.type = arithmetic_type;
6511 if (warning.float_equal &&
6512 (expression->base.kind == EXPR_BINARY_EQUAL ||
6513 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
6514 is_type_float(arithmetic_type)) {
6515 warningf(&expression->base.source_position,
6516 "comparing floating point with == or != is unsafe");
6518 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
6519 /* TODO check compatibility */
6520 } else if (is_type_pointer(type_left)) {
6521 expression->right = create_implicit_cast(right, type_left);
6522 } else if (is_type_pointer(type_right)) {
6523 expression->left = create_implicit_cast(left, type_right);
6524 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
6525 type_error_incompatible("invalid operands in comparison",
6526 &expression->base.source_position,
6527 type_left, type_right);
6529 expression->base.type = type_int;
6533 * Checks if a compound type has constant fields.
6535 static bool has_const_fields(const compound_type_t *type)
6537 const scope_t *scope = &type->declaration->scope;
6538 const declaration_t *declaration = scope->declarations;
6540 for (; declaration != NULL; declaration = declaration->next) {
6541 if (declaration->namespc != NAMESPACE_NORMAL)
6544 const type_t *decl_type = skip_typeref(declaration->type);
6545 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
6552 static bool is_lvalue(const expression_t *expression)
6554 switch (expression->kind) {
6555 case EXPR_REFERENCE:
6556 case EXPR_ARRAY_ACCESS:
6558 case EXPR_UNARY_DEREFERENCE:
6566 static bool is_valid_assignment_lhs(expression_t const* const left)
6568 type_t *const orig_type_left = revert_automatic_type_conversion(left);
6569 type_t *const type_left = skip_typeref(orig_type_left);
6571 if (!is_lvalue(left)) {
6572 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
6577 if (is_type_array(type_left)) {
6578 errorf(HERE, "cannot assign to arrays ('%E')", left);
6581 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
6582 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
6586 if (is_type_incomplete(type_left)) {
6587 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
6588 left, orig_type_left);
6591 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
6592 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
6593 left, orig_type_left);
6600 static void semantic_arithmetic_assign(binary_expression_t *expression)
6602 expression_t *left = expression->left;
6603 expression_t *right = expression->right;
6604 type_t *orig_type_left = left->base.type;
6605 type_t *orig_type_right = right->base.type;
6607 if (!is_valid_assignment_lhs(left))
6610 type_t *type_left = skip_typeref(orig_type_left);
6611 type_t *type_right = skip_typeref(orig_type_right);
6613 if(!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
6614 /* TODO: improve error message */
6615 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6616 errorf(HERE, "operation needs arithmetic types");
6621 /* combined instructions are tricky. We can't create an implicit cast on
6622 * the left side, because we need the uncasted form for the store.
6623 * The ast2firm pass has to know that left_type must be right_type
6624 * for the arithmetic operation and create a cast by itself */
6625 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
6626 expression->right = create_implicit_cast(right, arithmetic_type);
6627 expression->base.type = type_left;
6630 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
6632 expression_t *const left = expression->left;
6633 expression_t *const right = expression->right;
6634 type_t *const orig_type_left = left->base.type;
6635 type_t *const orig_type_right = right->base.type;
6636 type_t *const type_left = skip_typeref(orig_type_left);
6637 type_t *const type_right = skip_typeref(orig_type_right);
6639 if (!is_valid_assignment_lhs(left))
6642 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
6643 /* combined instructions are tricky. We can't create an implicit cast on
6644 * the left side, because we need the uncasted form for the store.
6645 * The ast2firm pass has to know that left_type must be right_type
6646 * for the arithmetic operation and create a cast by itself */
6647 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
6648 expression->right = create_implicit_cast(right, arithmetic_type);
6649 expression->base.type = type_left;
6650 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
6651 check_pointer_arithmetic(&expression->base.source_position,
6652 type_left, orig_type_left);
6653 expression->base.type = type_left;
6654 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
6655 errorf(HERE, "incompatible types '%T' and '%T' in assignment", orig_type_left, orig_type_right);
6660 * Check the semantic restrictions of a logical expression.
6662 static void semantic_logical_op(binary_expression_t *expression)
6664 expression_t *const left = expression->left;
6665 expression_t *const right = expression->right;
6666 type_t *const orig_type_left = left->base.type;
6667 type_t *const orig_type_right = right->base.type;
6668 type_t *const type_left = skip_typeref(orig_type_left);
6669 type_t *const type_right = skip_typeref(orig_type_right);
6671 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
6672 /* TODO: improve error message */
6673 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6674 errorf(HERE, "operation needs scalar types");
6679 expression->base.type = type_int;
6683 * Check the semantic restrictions of a binary assign expression.
6685 static void semantic_binexpr_assign(binary_expression_t *expression)
6687 expression_t *left = expression->left;
6688 type_t *orig_type_left = left->base.type;
6690 type_t *type_left = revert_automatic_type_conversion(left);
6691 type_left = skip_typeref(orig_type_left);
6693 if (!is_valid_assignment_lhs(left))
6696 type_t *const res_type = semantic_assign(orig_type_left, expression->right,
6697 "assignment", &left->base.source_position);
6698 if (res_type == NULL) {
6699 errorf(&expression->base.source_position,
6700 "cannot assign to '%T' from '%T'",
6701 orig_type_left, expression->right->base.type);
6703 expression->right = create_implicit_cast(expression->right, res_type);
6706 expression->base.type = orig_type_left;
6710 * Determine if the outermost operation (or parts thereof) of the given
6711 * expression has no effect in order to generate a warning about this fact.
6712 * Therefore in some cases this only examines some of the operands of the
6713 * expression (see comments in the function and examples below).
6715 * f() + 23; // warning, because + has no effect
6716 * x || f(); // no warning, because x controls execution of f()
6717 * x ? y : f(); // warning, because y has no effect
6718 * (void)x; // no warning to be able to suppress the warning
6719 * This function can NOT be used for an "expression has definitely no effect"-
6721 static bool expression_has_effect(const expression_t *const expr)
6723 switch (expr->kind) {
6724 case EXPR_UNKNOWN: break;
6725 case EXPR_INVALID: return true; /* do NOT warn */
6726 case EXPR_REFERENCE: return false;
6727 /* suppress the warning for microsoft __noop operations */
6728 case EXPR_CONST: return expr->conste.is_ms_noop;
6729 case EXPR_CHARACTER_CONSTANT: return false;
6730 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
6731 case EXPR_STRING_LITERAL: return false;
6732 case EXPR_WIDE_STRING_LITERAL: return false;
6735 const call_expression_t *const call = &expr->call;
6736 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
6739 switch (call->function->builtin_symbol.symbol->ID) {
6740 case T___builtin_va_end: return true;
6741 default: return false;
6745 /* Generate the warning if either the left or right hand side of a
6746 * conditional expression has no effect */
6747 case EXPR_CONDITIONAL: {
6748 const conditional_expression_t *const cond = &expr->conditional;
6750 expression_has_effect(cond->true_expression) &&
6751 expression_has_effect(cond->false_expression);
6754 case EXPR_SELECT: return false;
6755 case EXPR_ARRAY_ACCESS: return false;
6756 case EXPR_SIZEOF: return false;
6757 case EXPR_CLASSIFY_TYPE: return false;
6758 case EXPR_ALIGNOF: return false;
6760 case EXPR_FUNCNAME: return false;
6761 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
6762 case EXPR_BUILTIN_CONSTANT_P: return false;
6763 case EXPR_BUILTIN_PREFETCH: return true;
6764 case EXPR_OFFSETOF: return false;
6765 case EXPR_VA_START: return true;
6766 case EXPR_VA_ARG: return true;
6767 case EXPR_STATEMENT: return true; // TODO
6768 case EXPR_COMPOUND_LITERAL: return false;
6770 case EXPR_UNARY_NEGATE: return false;
6771 case EXPR_UNARY_PLUS: return false;
6772 case EXPR_UNARY_BITWISE_NEGATE: return false;
6773 case EXPR_UNARY_NOT: return false;
6774 case EXPR_UNARY_DEREFERENCE: return false;
6775 case EXPR_UNARY_TAKE_ADDRESS: return false;
6776 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
6777 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
6778 case EXPR_UNARY_PREFIX_INCREMENT: return true;
6779 case EXPR_UNARY_PREFIX_DECREMENT: return true;
6781 /* Treat void casts as if they have an effect in order to being able to
6782 * suppress the warning */
6783 case EXPR_UNARY_CAST: {
6784 type_t *const type = skip_typeref(expr->base.type);
6785 return is_type_atomic(type, ATOMIC_TYPE_VOID);
6788 case EXPR_UNARY_CAST_IMPLICIT: return true;
6789 case EXPR_UNARY_ASSUME: return true;
6791 case EXPR_BINARY_ADD: return false;
6792 case EXPR_BINARY_SUB: return false;
6793 case EXPR_BINARY_MUL: return false;
6794 case EXPR_BINARY_DIV: return false;
6795 case EXPR_BINARY_MOD: return false;
6796 case EXPR_BINARY_EQUAL: return false;
6797 case EXPR_BINARY_NOTEQUAL: return false;
6798 case EXPR_BINARY_LESS: return false;
6799 case EXPR_BINARY_LESSEQUAL: return false;
6800 case EXPR_BINARY_GREATER: return false;
6801 case EXPR_BINARY_GREATEREQUAL: return false;
6802 case EXPR_BINARY_BITWISE_AND: return false;
6803 case EXPR_BINARY_BITWISE_OR: return false;
6804 case EXPR_BINARY_BITWISE_XOR: return false;
6805 case EXPR_BINARY_SHIFTLEFT: return false;
6806 case EXPR_BINARY_SHIFTRIGHT: return false;
6807 case EXPR_BINARY_ASSIGN: return true;
6808 case EXPR_BINARY_MUL_ASSIGN: return true;
6809 case EXPR_BINARY_DIV_ASSIGN: return true;
6810 case EXPR_BINARY_MOD_ASSIGN: return true;
6811 case EXPR_BINARY_ADD_ASSIGN: return true;
6812 case EXPR_BINARY_SUB_ASSIGN: return true;
6813 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
6814 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
6815 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
6816 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
6817 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
6819 /* Only examine the right hand side of && and ||, because the left hand
6820 * side already has the effect of controlling the execution of the right
6822 case EXPR_BINARY_LOGICAL_AND:
6823 case EXPR_BINARY_LOGICAL_OR:
6824 /* Only examine the right hand side of a comma expression, because the left
6825 * hand side has a separate warning */
6826 case EXPR_BINARY_COMMA:
6827 return expression_has_effect(expr->binary.right);
6829 case EXPR_BINARY_BUILTIN_EXPECT: return true;
6830 case EXPR_BINARY_ISGREATER: return false;
6831 case EXPR_BINARY_ISGREATEREQUAL: return false;
6832 case EXPR_BINARY_ISLESS: return false;
6833 case EXPR_BINARY_ISLESSEQUAL: return false;
6834 case EXPR_BINARY_ISLESSGREATER: return false;
6835 case EXPR_BINARY_ISUNORDERED: return false;
6838 internal_errorf(HERE, "unexpected expression");
6841 static void semantic_comma(binary_expression_t *expression)
6843 if (warning.unused_value) {
6844 const expression_t *const left = expression->left;
6845 if (!expression_has_effect(left)) {
6846 warningf(&left->base.source_position,
6847 "left-hand operand of comma expression has no effect");
6850 expression->base.type = expression->right->base.type;
6853 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
6854 static expression_t *parse_##binexpression_type(unsigned precedence, \
6855 expression_t *left) \
6858 source_position_t pos = *HERE; \
6860 expression_t *right = parse_sub_expression(precedence + lr); \
6862 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
6863 binexpr->base.source_position = pos; \
6864 binexpr->binary.left = left; \
6865 binexpr->binary.right = right; \
6866 sfunc(&binexpr->binary); \
6871 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
6872 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
6873 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_binexpr_arithmetic, 1)
6874 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_binexpr_arithmetic, 1)
6875 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
6876 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
6877 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
6878 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
6879 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
6881 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
6882 semantic_comparison, 1)
6883 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
6884 semantic_comparison, 1)
6885 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
6886 semantic_comparison, 1)
6887 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
6888 semantic_comparison, 1)
6890 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
6891 semantic_binexpr_arithmetic, 1)
6892 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
6893 semantic_binexpr_arithmetic, 1)
6894 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
6895 semantic_binexpr_arithmetic, 1)
6896 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
6897 semantic_logical_op, 1)
6898 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
6899 semantic_logical_op, 1)
6900 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
6901 semantic_shift_op, 1)
6902 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
6903 semantic_shift_op, 1)
6904 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
6905 semantic_arithmetic_addsubb_assign, 0)
6906 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
6907 semantic_arithmetic_addsubb_assign, 0)
6908 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
6909 semantic_arithmetic_assign, 0)
6910 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
6911 semantic_arithmetic_assign, 0)
6912 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
6913 semantic_arithmetic_assign, 0)
6914 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
6915 semantic_arithmetic_assign, 0)
6916 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
6917 semantic_arithmetic_assign, 0)
6918 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
6919 semantic_arithmetic_assign, 0)
6920 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
6921 semantic_arithmetic_assign, 0)
6922 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
6923 semantic_arithmetic_assign, 0)
6925 static expression_t *parse_sub_expression(unsigned precedence)
6927 if(token.type < 0) {
6928 return expected_expression_error();
6931 expression_parser_function_t *parser
6932 = &expression_parsers[token.type];
6933 source_position_t source_position = token.source_position;
6936 if(parser->parser != NULL) {
6937 left = parser->parser(parser->precedence);
6939 left = parse_primary_expression();
6941 assert(left != NULL);
6942 left->base.source_position = source_position;
6945 if(token.type < 0) {
6946 return expected_expression_error();
6949 parser = &expression_parsers[token.type];
6950 if(parser->infix_parser == NULL)
6952 if(parser->infix_precedence < precedence)
6955 left = parser->infix_parser(parser->infix_precedence, left);
6957 assert(left != NULL);
6958 assert(left->kind != EXPR_UNKNOWN);
6959 left->base.source_position = source_position;
6966 * Parse an expression.
6968 static expression_t *parse_expression(void)
6970 return parse_sub_expression(1);
6974 * Register a parser for a prefix-like operator with given precedence.
6976 * @param parser the parser function
6977 * @param token_type the token type of the prefix token
6978 * @param precedence the precedence of the operator
6980 static void register_expression_parser(parse_expression_function parser,
6981 int token_type, unsigned precedence)
6983 expression_parser_function_t *entry = &expression_parsers[token_type];
6985 if(entry->parser != NULL) {
6986 diagnosticf("for token '%k'\n", (token_type_t)token_type);
6987 panic("trying to register multiple expression parsers for a token");
6989 entry->parser = parser;
6990 entry->precedence = precedence;
6994 * Register a parser for an infix operator with given precedence.
6996 * @param parser the parser function
6997 * @param token_type the token type of the infix operator
6998 * @param precedence the precedence of the operator
7000 static void register_infix_parser(parse_expression_infix_function parser,
7001 int token_type, unsigned precedence)
7003 expression_parser_function_t *entry = &expression_parsers[token_type];
7005 if(entry->infix_parser != NULL) {
7006 diagnosticf("for token '%k'\n", (token_type_t)token_type);
7007 panic("trying to register multiple infix expression parsers for a "
7010 entry->infix_parser = parser;
7011 entry->infix_precedence = precedence;
7015 * Initialize the expression parsers.
7017 static void init_expression_parsers(void)
7019 memset(&expression_parsers, 0, sizeof(expression_parsers));
7021 register_infix_parser(parse_array_expression, '[', 30);
7022 register_infix_parser(parse_call_expression, '(', 30);
7023 register_infix_parser(parse_select_expression, '.', 30);
7024 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
7025 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
7027 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
7030 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 17);
7031 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 17);
7032 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 17);
7033 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 16);
7034 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 16);
7035 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 15);
7036 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 15);
7037 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
7038 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
7039 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
7040 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
7041 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
7042 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
7043 T_EXCLAMATIONMARKEQUAL, 13);
7044 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
7045 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
7046 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
7047 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
7048 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
7049 register_infix_parser(parse_conditional_expression, '?', 7);
7050 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
7051 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
7052 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
7053 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
7054 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
7055 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
7056 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
7057 T_LESSLESSEQUAL, 2);
7058 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
7059 T_GREATERGREATEREQUAL, 2);
7060 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
7062 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
7064 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
7067 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
7069 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
7070 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
7071 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
7072 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
7073 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
7074 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
7075 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
7077 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
7079 register_expression_parser(parse_sizeof, T_sizeof, 25);
7080 register_expression_parser(parse_alignof, T___alignof__, 25);
7081 register_expression_parser(parse_extension, T___extension__, 25);
7082 register_expression_parser(parse_builtin_classify_type,
7083 T___builtin_classify_type, 25);
7087 * Parse a asm statement arguments specification.
7089 static asm_argument_t *parse_asm_arguments(bool is_out)
7091 asm_argument_t *result = NULL;
7092 asm_argument_t *last = NULL;
7094 while(token.type == T_STRING_LITERAL || token.type == '[') {
7095 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7096 memset(argument, 0, sizeof(argument[0]));
7098 if(token.type == '[') {
7100 if(token.type != T_IDENTIFIER) {
7101 parse_error_expected("while parsing asm argument",
7102 T_IDENTIFIER, NULL);
7105 argument->symbol = token.v.symbol;
7110 argument->constraints = parse_string_literals();
7112 argument->expression = parse_expression();
7113 if (is_out && !is_lvalue(argument->expression)) {
7114 errorf(&argument->expression->base.source_position,
7115 "asm output argument is not an lvalue");
7120 last->next = argument;
7126 if(token.type != ',')
7137 * Parse a asm statement clobber specification.
7139 static asm_clobber_t *parse_asm_clobbers(void)
7141 asm_clobber_t *result = NULL;
7142 asm_clobber_t *last = NULL;
7144 while(token.type == T_STRING_LITERAL) {
7145 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
7146 clobber->clobber = parse_string_literals();
7149 last->next = clobber;
7155 if(token.type != ',')
7164 * Parse an asm statement.
7166 static statement_t *parse_asm_statement(void)
7170 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
7171 statement->base.source_position = token.source_position;
7173 asm_statement_t *asm_statement = &statement->asms;
7175 if(token.type == T_volatile) {
7177 asm_statement->is_volatile = true;
7181 add_anchor_token(')');
7182 add_anchor_token(':');
7183 asm_statement->asm_text = parse_string_literals();
7185 if(token.type != ':') {
7186 rem_anchor_token(':');
7191 asm_statement->outputs = parse_asm_arguments(true);
7192 if(token.type != ':') {
7193 rem_anchor_token(':');
7198 asm_statement->inputs = parse_asm_arguments(false);
7199 if(token.type != ':') {
7200 rem_anchor_token(':');
7203 rem_anchor_token(':');
7206 asm_statement->clobbers = parse_asm_clobbers();
7209 rem_anchor_token(')');
7214 return create_invalid_statement();
7218 * Parse a case statement.
7220 static statement_t *parse_case_statement(void)
7224 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
7226 statement->base.source_position = token.source_position;
7227 statement->case_label.expression = parse_expression();
7229 if (c_mode & _GNUC) {
7230 if (token.type == T_DOTDOTDOT) {
7232 statement->case_label.end_range = parse_expression();
7238 if (! is_constant_expression(statement->case_label.expression)) {
7239 errorf(&statement->base.source_position,
7240 "case label does not reduce to an integer constant");
7242 /* TODO: check if the case label is already known */
7243 if (current_switch != NULL) {
7244 /* link all cases into the switch statement */
7245 if (current_switch->last_case == NULL) {
7246 current_switch->first_case =
7247 current_switch->last_case = &statement->case_label;
7249 current_switch->last_case->next = &statement->case_label;
7252 errorf(&statement->base.source_position,
7253 "case label not within a switch statement");
7256 statement->case_label.statement = parse_statement();
7260 return create_invalid_statement();
7264 * Finds an existing default label of a switch statement.
7266 static case_label_statement_t *
7267 find_default_label(const switch_statement_t *statement)
7269 case_label_statement_t *label = statement->first_case;
7270 for ( ; label != NULL; label = label->next) {
7271 if (label->expression == NULL)
7278 * Parse a default statement.
7280 static statement_t *parse_default_statement(void)
7284 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
7286 statement->base.source_position = token.source_position;
7289 if (current_switch != NULL) {
7290 const case_label_statement_t *def_label = find_default_label(current_switch);
7291 if (def_label != NULL) {
7292 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
7293 &def_label->base.source_position);
7295 /* link all cases into the switch statement */
7296 if (current_switch->last_case == NULL) {
7297 current_switch->first_case =
7298 current_switch->last_case = &statement->case_label;
7300 current_switch->last_case->next = &statement->case_label;
7304 errorf(&statement->base.source_position,
7305 "'default' label not within a switch statement");
7307 statement->case_label.statement = parse_statement();
7311 return create_invalid_statement();
7315 * Return the declaration for a given label symbol or create a new one.
7317 static declaration_t *get_label(symbol_t *symbol)
7319 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
7320 assert(current_function != NULL);
7321 /* if we found a label in the same function, then we already created the
7323 if(candidate != NULL
7324 && candidate->parent_scope == ¤t_function->scope) {
7328 /* otherwise we need to create a new one */
7329 declaration_t *const declaration = allocate_declaration_zero();
7330 declaration->namespc = NAMESPACE_LABEL;
7331 declaration->symbol = symbol;
7333 label_push(declaration);
7339 * Parse a label statement.
7341 static statement_t *parse_label_statement(void)
7343 assert(token.type == T_IDENTIFIER);
7344 symbol_t *symbol = token.v.symbol;
7347 declaration_t *label = get_label(symbol);
7349 /* if source position is already set then the label is defined twice,
7350 * otherwise it was just mentioned in a goto so far */
7351 if(label->source_position.input_name != NULL) {
7352 errorf(HERE, "duplicate label '%Y' (declared %P)",
7353 symbol, &label->source_position);
7355 label->source_position = token.source_position;
7358 statement_t *statement = allocate_statement_zero(STATEMENT_LABEL);
7360 statement->base.source_position = token.source_position;
7361 statement->label.label = label;
7365 if(token.type == '}') {
7366 /* TODO only warn? */
7368 warningf(HERE, "label at end of compound statement");
7369 statement->label.statement = create_empty_statement();
7371 errorf(HERE, "label at end of compound statement");
7372 statement->label.statement = create_invalid_statement();
7376 if (token.type == ';') {
7377 /* eat an empty statement here, to avoid the warning about an empty
7378 * after a label. label:; is commonly used to have a label before
7380 statement->label.statement = create_empty_statement();
7383 statement->label.statement = parse_statement();
7387 /* remember the labels's in a list for later checking */
7388 if (label_last == NULL) {
7389 label_first = &statement->label;
7391 label_last->next = &statement->label;
7393 label_last = &statement->label;
7399 * Parse an if statement.
7401 static statement_t *parse_if(void)
7405 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
7406 statement->base.source_position = token.source_position;
7409 add_anchor_token(')');
7410 statement->ifs.condition = parse_expression();
7411 rem_anchor_token(')');
7414 add_anchor_token(T_else);
7415 statement->ifs.true_statement = parse_statement();
7416 rem_anchor_token(T_else);
7418 if(token.type == T_else) {
7420 statement->ifs.false_statement = parse_statement();
7425 return create_invalid_statement();
7429 * Parse a switch statement.
7431 static statement_t *parse_switch(void)
7435 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
7436 statement->base.source_position = token.source_position;
7439 expression_t *const expr = parse_expression();
7440 type_t * type = skip_typeref(expr->base.type);
7441 if (is_type_integer(type)) {
7442 type = promote_integer(type);
7443 } else if (is_type_valid(type)) {
7444 errorf(&expr->base.source_position,
7445 "switch quantity is not an integer, but '%T'", type);
7446 type = type_error_type;
7448 statement->switchs.expression = create_implicit_cast(expr, type);
7451 switch_statement_t *rem = current_switch;
7452 current_switch = &statement->switchs;
7453 statement->switchs.body = parse_statement();
7454 current_switch = rem;
7456 if(warning.switch_default &&
7457 find_default_label(&statement->switchs) == NULL) {
7458 warningf(&statement->base.source_position, "switch has no default case");
7463 return create_invalid_statement();
7466 static statement_t *parse_loop_body(statement_t *const loop)
7468 statement_t *const rem = current_loop;
7469 current_loop = loop;
7471 statement_t *const body = parse_statement();
7478 * Parse a while statement.
7480 static statement_t *parse_while(void)
7484 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
7485 statement->base.source_position = token.source_position;
7488 add_anchor_token(')');
7489 statement->whiles.condition = parse_expression();
7490 rem_anchor_token(')');
7493 statement->whiles.body = parse_loop_body(statement);
7497 return create_invalid_statement();
7501 * Parse a do statement.
7503 static statement_t *parse_do(void)
7507 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
7509 statement->base.source_position = token.source_position;
7511 add_anchor_token(T_while);
7512 statement->do_while.body = parse_loop_body(statement);
7513 rem_anchor_token(T_while);
7517 add_anchor_token(')');
7518 statement->do_while.condition = parse_expression();
7519 rem_anchor_token(')');
7525 return create_invalid_statement();
7529 * Parse a for statement.
7531 static statement_t *parse_for(void)
7535 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
7536 statement->base.source_position = token.source_position;
7538 int top = environment_top();
7539 scope_t *last_scope = scope;
7540 set_scope(&statement->fors.scope);
7543 add_anchor_token(')');
7545 if(token.type != ';') {
7546 if(is_declaration_specifier(&token, false)) {
7547 parse_declaration(record_declaration);
7549 add_anchor_token(';');
7550 expression_t *const init = parse_expression();
7551 statement->fors.initialisation = init;
7552 if (warning.unused_value && !expression_has_effect(init)) {
7553 warningf(&init->base.source_position,
7554 "initialisation of 'for'-statement has no effect");
7556 rem_anchor_token(';');
7563 if(token.type != ';') {
7564 add_anchor_token(';');
7565 statement->fors.condition = parse_expression();
7566 rem_anchor_token(';');
7569 if(token.type != ')') {
7570 expression_t *const step = parse_expression();
7571 statement->fors.step = step;
7572 if (warning.unused_value && !expression_has_effect(step)) {
7573 warningf(&step->base.source_position,
7574 "step of 'for'-statement has no effect");
7577 rem_anchor_token(')');
7579 statement->fors.body = parse_loop_body(statement);
7581 assert(scope == &statement->fors.scope);
7582 set_scope(last_scope);
7583 environment_pop_to(top);
7588 rem_anchor_token(')');
7589 assert(scope == &statement->fors.scope);
7590 set_scope(last_scope);
7591 environment_pop_to(top);
7593 return create_invalid_statement();
7597 * Parse a goto statement.
7599 static statement_t *parse_goto(void)
7603 if(token.type != T_IDENTIFIER) {
7604 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
7608 symbol_t *symbol = token.v.symbol;
7611 declaration_t *label = get_label(symbol);
7613 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
7614 statement->base.source_position = token.source_position;
7616 statement->gotos.label = label;
7618 /* remember the goto's in a list for later checking */
7619 if (goto_last == NULL) {
7620 goto_first = &statement->gotos;
7622 goto_last->next = &statement->gotos;
7624 goto_last = &statement->gotos;
7630 return create_invalid_statement();
7634 * Parse a continue statement.
7636 static statement_t *parse_continue(void)
7638 statement_t *statement;
7639 if (current_loop == NULL) {
7640 errorf(HERE, "continue statement not within loop");
7641 statement = create_invalid_statement();
7643 statement = allocate_statement_zero(STATEMENT_CONTINUE);
7645 statement->base.source_position = token.source_position;
7653 return create_invalid_statement();
7657 * Parse a break statement.
7659 static statement_t *parse_break(void)
7661 statement_t *statement;
7662 if (current_switch == NULL && current_loop == NULL) {
7663 errorf(HERE, "break statement not within loop or switch");
7664 statement = create_invalid_statement();
7666 statement = allocate_statement_zero(STATEMENT_BREAK);
7668 statement->base.source_position = token.source_position;
7676 return create_invalid_statement();
7680 * Parse a __leave statement.
7682 static statement_t *parse_leave(void)
7684 statement_t *statement;
7685 if (current_try == NULL) {
7686 errorf(HERE, "__leave statement not within __try");
7687 statement = create_invalid_statement();
7689 statement = allocate_statement_zero(STATEMENT_LEAVE);
7691 statement->base.source_position = token.source_position;
7699 return create_invalid_statement();
7703 * Check if a given declaration represents a local variable.
7705 static bool is_local_var_declaration(const declaration_t *declaration) {
7706 switch ((storage_class_tag_t) declaration->storage_class) {
7707 case STORAGE_CLASS_AUTO:
7708 case STORAGE_CLASS_REGISTER: {
7709 const type_t *type = skip_typeref(declaration->type);
7710 if(is_type_function(type)) {
7722 * Check if a given declaration represents a variable.
7724 static bool is_var_declaration(const declaration_t *declaration) {
7725 if(declaration->storage_class == STORAGE_CLASS_TYPEDEF)
7728 const type_t *type = skip_typeref(declaration->type);
7729 return !is_type_function(type);
7733 * Check if a given expression represents a local variable.
7735 static bool is_local_variable(const expression_t *expression)
7737 if (expression->base.kind != EXPR_REFERENCE) {
7740 const declaration_t *declaration = expression->reference.declaration;
7741 return is_local_var_declaration(declaration);
7745 * Check if a given expression represents a local variable and
7746 * return its declaration then, else return NULL.
7748 declaration_t *expr_is_variable(const expression_t *expression)
7750 if (expression->base.kind != EXPR_REFERENCE) {
7753 declaration_t *declaration = expression->reference.declaration;
7754 if (is_var_declaration(declaration))
7760 * Parse a return statement.
7762 static statement_t *parse_return(void)
7764 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
7765 statement->base.source_position = token.source_position;
7769 expression_t *return_value = NULL;
7770 if(token.type != ';') {
7771 return_value = parse_expression();
7775 const type_t *const func_type = current_function->type;
7776 assert(is_type_function(func_type));
7777 type_t *const return_type = skip_typeref(func_type->function.return_type);
7779 if(return_value != NULL) {
7780 type_t *return_value_type = skip_typeref(return_value->base.type);
7782 if(is_type_atomic(return_type, ATOMIC_TYPE_VOID)
7783 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
7784 warningf(&statement->base.source_position,
7785 "'return' with a value, in function returning void");
7786 return_value = NULL;
7788 type_t *const res_type = semantic_assign(return_type,
7789 return_value, "'return'", &statement->base.source_position);
7790 if (res_type == NULL) {
7791 errorf(&statement->base.source_position,
7792 "cannot return something of type '%T' in function returning '%T'",
7793 return_value->base.type, return_type);
7795 return_value = create_implicit_cast(return_value, res_type);
7798 /* check for returning address of a local var */
7799 if (return_value != NULL &&
7800 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
7801 const expression_t *expression = return_value->unary.value;
7802 if (is_local_variable(expression)) {
7803 warningf(&statement->base.source_position,
7804 "function returns address of local variable");
7808 if(!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
7809 warningf(&statement->base.source_position,
7810 "'return' without value, in function returning non-void");
7813 statement->returns.value = return_value;
7817 return create_invalid_statement();
7821 * Parse a declaration statement.
7823 static statement_t *parse_declaration_statement(void)
7825 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
7827 statement->base.source_position = token.source_position;
7829 declaration_t *before = last_declaration;
7830 parse_declaration(record_declaration);
7832 if(before == NULL) {
7833 statement->declaration.declarations_begin = scope->declarations;
7835 statement->declaration.declarations_begin = before->next;
7837 statement->declaration.declarations_end = last_declaration;
7843 * Parse an expression statement, ie. expr ';'.
7845 static statement_t *parse_expression_statement(void)
7847 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
7849 statement->base.source_position = token.source_position;
7850 expression_t *const expr = parse_expression();
7851 statement->expression.expression = expr;
7857 return create_invalid_statement();
7861 * Parse a microsoft __try { } __finally { } or
7862 * __try{ } __except() { }
7864 static statement_t *parse_ms_try_statment(void) {
7865 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
7867 statement->base.source_position = token.source_position;
7870 ms_try_statement_t *rem = current_try;
7871 current_try = &statement->ms_try;
7872 statement->ms_try.try_statement = parse_compound_statement(false);
7875 if(token.type == T___except) {
7878 add_anchor_token(')');
7879 expression_t *const expr = parse_expression();
7880 type_t * type = skip_typeref(expr->base.type);
7881 if (is_type_integer(type)) {
7882 type = promote_integer(type);
7883 } else if (is_type_valid(type)) {
7884 errorf(&expr->base.source_position,
7885 "__expect expression is not an integer, but '%T'", type);
7886 type = type_error_type;
7888 statement->ms_try.except_expression = create_implicit_cast(expr, type);
7889 rem_anchor_token(')');
7891 statement->ms_try.final_statement = parse_compound_statement(false);
7892 } else if(token.type == T__finally) {
7894 statement->ms_try.final_statement = parse_compound_statement(false);
7896 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
7897 return create_invalid_statement();
7901 return create_invalid_statement();
7905 * Parse a statement.
7906 * There's also parse_statement() which additionally checks for
7907 * "statement has no effect" warnings
7909 static statement_t *intern_parse_statement(void)
7911 statement_t *statement = NULL;
7913 /* declaration or statement */
7914 add_anchor_token(';');
7915 switch(token.type) {
7917 statement = parse_asm_statement();
7921 statement = parse_case_statement();
7925 statement = parse_default_statement();
7929 statement = parse_compound_statement(false);
7933 statement = parse_if();
7937 statement = parse_switch();
7941 statement = parse_while();
7945 statement = parse_do();
7949 statement = parse_for();
7953 statement = parse_goto();
7957 statement = parse_continue();
7961 statement = parse_break();
7965 statement = parse_leave();
7969 statement = parse_return();
7973 if(warning.empty_statement) {
7974 warningf(HERE, "statement is empty");
7976 statement = create_empty_statement();
7981 if(look_ahead(1)->type == ':') {
7982 statement = parse_label_statement();
7986 if(is_typedef_symbol(token.v.symbol)) {
7987 statement = parse_declaration_statement();
7991 statement = parse_expression_statement();
7994 case T___extension__:
7995 /* this can be a prefix to a declaration or an expression statement */
7996 /* we simply eat it now and parse the rest with tail recursion */
7999 } while(token.type == T___extension__);
8000 statement = parse_statement();
8004 statement = parse_declaration_statement();
8008 statement = parse_ms_try_statment();
8012 statement = parse_expression_statement();
8015 rem_anchor_token(';');
8017 assert(statement != NULL
8018 && statement->base.source_position.input_name != NULL);
8024 * parse a statement and emits "statement has no effect" warning if needed
8025 * (This is really a wrapper around intern_parse_statement with check for 1
8026 * single warning. It is needed, because for statement expressions we have
8027 * to avoid the warning on the last statement)
8029 static statement_t *parse_statement(void)
8031 statement_t *statement = intern_parse_statement();
8033 if(statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
8034 expression_t *expression = statement->expression.expression;
8035 if(!expression_has_effect(expression)) {
8036 warningf(&expression->base.source_position,
8037 "statement has no effect");
8045 * Parse a compound statement.
8047 static statement_t *parse_compound_statement(bool inside_expression_statement)
8049 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
8051 statement->base.source_position = token.source_position;
8054 add_anchor_token('}');
8056 int top = environment_top();
8057 scope_t *last_scope = scope;
8058 set_scope(&statement->compound.scope);
8060 statement_t *last_statement = NULL;
8062 while(token.type != '}' && token.type != T_EOF) {
8063 statement_t *sub_statement = intern_parse_statement();
8064 if(is_invalid_statement(sub_statement)) {
8065 /* an error occurred. if we are at an anchor, return */
8071 if(last_statement != NULL) {
8072 last_statement->base.next = sub_statement;
8074 statement->compound.statements = sub_statement;
8077 while(sub_statement->base.next != NULL)
8078 sub_statement = sub_statement->base.next;
8080 last_statement = sub_statement;
8083 if(token.type == '}') {
8086 errorf(&statement->base.source_position,
8087 "end of file while looking for closing '}'");
8090 /* look over all statements again to produce no effect warnings */
8091 if(warning.unused_value) {
8092 statement_t *sub_statement = statement->compound.statements;
8093 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
8094 if(sub_statement->kind != STATEMENT_EXPRESSION)
8096 /* don't emit a warning for the last expression in an expression
8097 * statement as it has always an effect */
8098 if(inside_expression_statement && sub_statement->base.next == NULL)
8101 expression_t *expression = sub_statement->expression.expression;
8102 if(!expression_has_effect(expression)) {
8103 warningf(&expression->base.source_position,
8104 "statement has no effect");
8110 rem_anchor_token('}');
8111 assert(scope == &statement->compound.scope);
8112 set_scope(last_scope);
8113 environment_pop_to(top);
8119 * Initialize builtin types.
8121 static void initialize_builtin_types(void)
8123 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
8124 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
8125 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
8126 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
8127 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
8128 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
8129 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", type_int);
8130 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
8132 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
8133 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
8134 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
8135 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
8139 * Check for unused global static functions and variables
8141 static void check_unused_globals(void)
8143 if (!warning.unused_function && !warning.unused_variable)
8146 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
8147 if (decl->used || decl->storage_class != STORAGE_CLASS_STATIC)
8150 type_t *const type = decl->type;
8152 if (is_type_function(skip_typeref(type))) {
8153 if (!warning.unused_function || decl->is_inline)
8156 s = (decl->init.statement != NULL ? "defined" : "declared");
8158 if (!warning.unused_variable)
8164 warningf(&decl->source_position, "'%#T' %s but not used",
8165 type, decl->symbol, s);
8170 * Parse a translation unit.
8172 static void parse_translation_unit(void)
8174 while(token.type != T_EOF) {
8175 if (token.type == ';') {
8176 /* TODO error in strict mode */
8177 warningf(HERE, "stray ';' outside of function");
8180 parse_external_declaration();
8188 * @return the translation unit or NULL if errors occurred.
8190 void start_parsing(void)
8192 environment_stack = NEW_ARR_F(stack_entry_t, 0);
8193 label_stack = NEW_ARR_F(stack_entry_t, 0);
8194 diagnostic_count = 0;
8198 type_set_output(stderr);
8199 ast_set_output(stderr);
8201 assert(unit == NULL);
8202 unit = allocate_ast_zero(sizeof(unit[0]));
8204 assert(global_scope == NULL);
8205 global_scope = &unit->scope;
8207 assert(scope == NULL);
8208 set_scope(&unit->scope);
8210 initialize_builtin_types();
8213 translation_unit_t *finish_parsing(void)
8215 assert(scope == &unit->scope);
8217 last_declaration = NULL;
8219 assert(global_scope == &unit->scope);
8220 check_unused_globals();
8221 global_scope = NULL;
8223 DEL_ARR_F(environment_stack);
8224 DEL_ARR_F(label_stack);
8226 translation_unit_t *result = unit;
8233 lookahead_bufpos = 0;
8234 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
8237 parse_translation_unit();
8241 * Initialize the parser.
8243 void init_parser(void)
8246 /* add predefined symbols for extended-decl-modifier */
8247 sym_align = symbol_table_insert("align");
8248 sym_allocate = symbol_table_insert("allocate");
8249 sym_dllimport = symbol_table_insert("dllimport");
8250 sym_dllexport = symbol_table_insert("dllexport");
8251 sym_naked = symbol_table_insert("naked");
8252 sym_noinline = symbol_table_insert("noinline");
8253 sym_noreturn = symbol_table_insert("noreturn");
8254 sym_nothrow = symbol_table_insert("nothrow");
8255 sym_novtable = symbol_table_insert("novtable");
8256 sym_property = symbol_table_insert("property");
8257 sym_get = symbol_table_insert("get");
8258 sym_put = symbol_table_insert("put");
8259 sym_selectany = symbol_table_insert("selectany");
8260 sym_thread = symbol_table_insert("thread");
8261 sym_uuid = symbol_table_insert("uuid");
8262 sym_deprecated = symbol_table_insert("deprecated");
8263 sym_restrict = symbol_table_insert("restrict");
8264 sym_noalias = symbol_table_insert("noalias");
8266 memset(token_anchor_set, 0, sizeof(token_anchor_set));
8268 init_expression_parsers();
8269 obstack_init(&temp_obst);
8271 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
8272 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
8276 * Terminate the parser.
8278 void exit_parser(void)
8280 obstack_free(&temp_obst, NULL);